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 1129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1140 return parentOrShadowHostNode() ? parentOrShadowHostNode()->canStartSelectio
n() : true; | 1140 return parentOrShadowHostNode() ? parentOrShadowHostNode()->canStartSelectio
n() : true; |
1141 } | 1141 } |
1142 | 1142 |
1143 Element* Node::shadowHost() const | 1143 Element* Node::shadowHost() const |
1144 { | 1144 { |
1145 if (ShadowRoot* root = containingShadowRoot()) | 1145 if (ShadowRoot* root = containingShadowRoot()) |
1146 return root->host(); | 1146 return root->host(); |
1147 return 0; | 1147 return 0; |
1148 } | 1148 } |
1149 | 1149 |
1150 Node* Node::deprecatedShadowAncestorNode() const | |
1151 { | |
1152 if (ShadowRoot* root = containingShadowRoot()) | |
1153 return root->host(); | |
1154 | |
1155 return const_cast<Node*>(this); | |
1156 } | |
1157 | |
1158 ShadowRoot* Node::containingShadowRoot() const | 1150 ShadowRoot* Node::containingShadowRoot() const |
1159 { | 1151 { |
1160 Node& root = treeScope().rootNode(); | 1152 Node& root = treeScope().rootNode(); |
1161 return root.isShadowRoot() ? toShadowRoot(&root) : 0; | 1153 return root.isShadowRoot() ? toShadowRoot(&root) : 0; |
1162 } | 1154 } |
1163 | 1155 |
1164 Node* Node::nonBoundaryShadowTreeRootNode() | 1156 Node* Node::nonBoundaryShadowTreeRootNode() |
1165 { | 1157 { |
1166 ASSERT(!isShadowRoot()); | 1158 ASSERT(!isShadowRoot()); |
1167 Node* root = this; | 1159 Node* root = this; |
(...skipping 1395 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2563 node->showTreeForThis(); | 2555 node->showTreeForThis(); |
2564 } | 2556 } |
2565 | 2557 |
2566 void showNodePath(const WebCore::Node* node) | 2558 void showNodePath(const WebCore::Node* node) |
2567 { | 2559 { |
2568 if (node) | 2560 if (node) |
2569 node->showNodePathForThis(); | 2561 node->showNodePathForThis(); |
2570 } | 2562 } |
2571 | 2563 |
2572 #endif | 2564 #endif |
OLD | NEW |