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 1267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1278 | 1278 |
1279 if (parent->isShadowRoot()) | 1279 if (parent->isShadowRoot()) |
1280 return toShadowRoot(parent)->host(); | 1280 return toShadowRoot(parent)->host(); |
1281 | 1281 |
1282 if (!parent->isElementNode()) | 1282 if (!parent->isElementNode()) |
1283 return 0; | 1283 return 0; |
1284 | 1284 |
1285 return toElement(parent); | 1285 return toElement(parent); |
1286 } | 1286 } |
1287 | 1287 |
1288 Node* Node::insertionParentForBinding() const | |
1289 { | |
1290 Node* node = resolveReprojection(this); | |
1291 while (node && node->containingShadowRoot() && node->containingShadowRoot()-
>type() == ShadowRoot::UserAgentShadowRoot) | |
1292 node = resolveReprojection(node); | |
1293 return node; | |
1294 } | |
1295 | |
1296 bool Node::needsShadowTreeWalkerSlow() const | 1288 bool Node::needsShadowTreeWalkerSlow() const |
1297 { | 1289 { |
1298 return (isShadowRoot() || (isElementNode() && (isInsertionPoint() || isPseud
oElement() || toElement(this)->hasPseudoElements() || toElement(this)->shadow())
)); | 1290 return (isShadowRoot() || (isElementNode() && (isInsertionPoint() || isPseud
oElement() || toElement(this)->hasPseudoElements() || toElement(this)->shadow())
)); |
1299 } | 1291 } |
1300 | 1292 |
1301 bool Node::isBlockFlowElement() const | 1293 bool Node::isBlockFlowElement() const |
1302 { | 1294 { |
1303 return isElementNode() && renderer() && renderer()->isBlockFlow(); | 1295 return isElementNode() && renderer() && renderer()->isBlockFlow(); |
1304 } | 1296 } |
1305 | 1297 |
(...skipping 1468 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2774 node->showTreeForThis(); | 2766 node->showTreeForThis(); |
2775 } | 2767 } |
2776 | 2768 |
2777 void showNodePath(const WebCore::Node* node) | 2769 void showNodePath(const WebCore::Node* node) |
2778 { | 2770 { |
2779 if (node) | 2771 if (node) |
2780 node->showNodePathForThis(); | 2772 node->showNodePathForThis(); |
2781 } | 2773 } |
2782 | 2774 |
2783 #endif | 2775 #endif |
OLD | NEW |