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 Apple Inc. All rights reserv
ed. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
(...skipping 129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
140 for (Node* node = child->firstChild(); node; node = node->nextSibling()) { | 140 for (Node* node = child->firstChild(); node; node = node->nextSibling()) { |
141 if (!newParent->childTypeAllowed(node->nodeType())) | 141 if (!newParent->childTypeAllowed(node->nodeType())) |
142 return false; | 142 return false; |
143 } | 143 } |
144 return true; | 144 return true; |
145 } | 145 } |
146 | 146 |
147 static inline bool isInTemplateContent(const Node* node) | 147 static inline bool isInTemplateContent(const Node* node) |
148 { | 148 { |
149 Document* document = node->document(); | 149 Document* document = node->document(); |
150 return document && document == document->templateDocument(); | 150 return document == document->templateDocument(); |
151 } | 151 } |
152 | 152 |
153 static inline bool containsConsideringHostElements(const Node* newChild, const N
ode* newParent) | 153 static inline bool containsConsideringHostElements(const Node* newChild, const N
ode* newParent) |
154 { | 154 { |
155 return (newParent->isInShadowTree() || isInTemplateContent(newParent)) | 155 return (newParent->isInShadowTree() || isInTemplateContent(newParent)) |
156 ? newChild->containsIncludingHostElements(newParent) | 156 ? newChild->containsIncludingHostElements(newParent) |
157 : newChild->contains(newParent); | 157 : newChild->contains(newParent); |
158 } | 158 } |
159 | 159 |
160 static inline bool checkAcceptChild(ContainerNode* newParent, Node* newChild, No
de* oldChild, ExceptionState& es) | 160 static inline bool checkAcceptChild(ContainerNode* newParent, Node* newChild, No
de* oldChild, ExceptionState& es) |
(...skipping 895 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1056 return true; | 1056 return true; |
1057 | 1057 |
1058 if (node->isElementNode() && toElement(node)->shadow()) | 1058 if (node->isElementNode() && toElement(node)->shadow()) |
1059 return true; | 1059 return true; |
1060 | 1060 |
1061 return false; | 1061 return false; |
1062 } | 1062 } |
1063 #endif | 1063 #endif |
1064 | 1064 |
1065 } // namespace WebCore | 1065 } // namespace WebCore |
OLD | NEW |