| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 1671 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1682 if (node.isElementNode()) { | 1682 if (node.isElementNode()) { |
| 1683 const Element& element = toElement(node); | 1683 const Element& element = toElement(node); |
| 1684 if (Element* pseudo = element.pseudoElement(BEFORE)) | 1684 if (Element* pseudo = element.pseudoElement(BEFORE)) |
| 1685 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); | 1685 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); |
| 1686 if (Element* pseudo = element.pseudoElement(AFTER)) | 1686 if (Element* pseudo = element.pseudoElement(AFTER)) |
| 1687 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); | 1687 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); |
| 1688 if (Element* pseudo = element.pseudoElement(FIRST_LETTER)) | 1688 if (Element* pseudo = element.pseudoElement(FIRST_LETTER)) |
| 1689 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); | 1689 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); |
| 1690 if (Element* pseudo = element.pseudoElement(BACKDROP)) | 1690 if (Element* pseudo = element.pseudoElement(BACKDROP)) |
| 1691 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); | 1691 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); |
| 1692 if (Element* pseudo = element.pseudoElement(MARKER)) |
| 1693 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark
edLabel1, markedNode2, markedLabel2); |
| 1692 } | 1694 } |
| 1693 | 1695 |
| 1694 if (node.isShadowRoot()) { | 1696 if (node.isShadowRoot()) { |
| 1695 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow
Root()) | 1697 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow
Root()) |
| 1696 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked
Node1, markedLabel1, markedNode2, markedLabel2); | 1698 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked
Node1, markedLabel1, markedNode2, markedLabel2); |
| 1697 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node)) | 1699 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node)) |
| 1698 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1
, markedLabel1, markedNode2, markedLabel2); | 1700 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1
, markedLabel1, markedNode2, markedLabel2); |
| 1699 } | 1701 } |
| 1700 } | 1702 } |
| 1701 | 1703 |
| (...skipping 758 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2460 node->showTreeForThis(); | 2462 node->showTreeForThis(); |
| 2461 } | 2463 } |
| 2462 | 2464 |
| 2463 void showNodePath(const blink::Node* node) | 2465 void showNodePath(const blink::Node* node) |
| 2464 { | 2466 { |
| 2465 if (node) | 2467 if (node) |
| 2466 node->showNodePathForThis(); | 2468 node->showNodePathForThis(); |
| 2467 } | 2469 } |
| 2468 | 2470 |
| 2469 #endif | 2471 #endif |
| OLD | NEW |