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 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
90 while (RefPtr<Node> child = oldParent->firstChild()) { | 90 while (RefPtr<Node> child = oldParent->firstChild()) { |
91 oldParent->parserRemoveChild(child.get()); | 91 oldParent->parserRemoveChild(child.get()); |
92 treeScope().adoptIfNeeded(child.get()); | 92 treeScope().adoptIfNeeded(child.get()); |
93 parserAppendChild(child.get()); | 93 parserAppendChild(child.get()); |
94 } | 94 } |
95 } | 95 } |
96 | 96 |
97 ContainerNode::~ContainerNode() | 97 ContainerNode::~ContainerNode() |
98 { | 98 { |
99 if (Document* document = documentInternal()) | 99 if (Document* document = documentInternal()) |
100 willBeDeletedFrom(document); | 100 willBeDeletedFrom(*document); |
101 removeDetachedChildren(); | 101 removeDetachedChildren(); |
102 } | 102 } |
103 | 103 |
104 static inline bool isChildTypeAllowed(ContainerNode* newParent, Node* child) | 104 static inline bool isChildTypeAllowed(ContainerNode* newParent, Node* child) |
105 { | 105 { |
106 if (!child->isDocumentFragment()) | 106 if (!child->isDocumentFragment()) |
107 return newParent->childTypeAllowed(child->nodeType()); | 107 return newParent->childTypeAllowed(child->nodeType()); |
108 | 108 |
109 for (Node* node = child->firstChild(); node; node = node->nextSibling()) { | 109 for (Node* node = child->firstChild(); node; node = node->nextSibling()) { |
110 if (!newParent->childTypeAllowed(node->nodeType())) | 110 if (!newParent->childTypeAllowed(node->nodeType())) |
(...skipping 878 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
989 return true; | 989 return true; |
990 | 990 |
991 if (node->isElementNode() && toElement(node)->shadow()) | 991 if (node->isElementNode() && toElement(node)->shadow()) |
992 return true; | 992 return true; |
993 | 993 |
994 return false; | 994 return false; |
995 } | 995 } |
996 #endif | 996 #endif |
997 | 997 |
998 } // namespace WebCore | 998 } // namespace WebCore |
OLD | NEW |