| 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 * Copyright (C) 2011 Google Inc. All rights reserved. | 8 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 9 * | 9 * |
| 10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
| 11 * modify it under the terms of the GNU Library General Public | 11 * modify it under the terms of the GNU Library General Public |
| 12 * License as published by the Free Software Foundation; either | 12 * License as published by the Free Software Foundation; either |
| 13 * version 2 of the License, or (at your option) any later version. | 13 * version 2 of the License, or (at your option) any later version. |
| 14 * | 14 * |
| 15 * This library is distributed in the hope that it will be useful, | 15 * This library is distributed in the hope that it will be useful, |
| 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 18 * Library General Public License for more details. | 18 * Library General Public License for more details. |
| 19 * | 19 * |
| 20 * You should have received a copy of the GNU Library General Public License | 20 * You should have received a copy of the GNU Library General Public License |
| 21 * along with this library; see the file COPYING.LIB. If not, write to | 21 * along with this library; see the file COPYING.LIB. If not, write to |
| 22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 23 * Boston, MA 02110-1301, USA. | 23 * Boston, MA 02110-1301, USA. |
| 24 */ | 24 */ |
| 25 #include "core/dom/TreeScopeAdopter.h" | 25 #include "core/dom/TreeScopeAdopter.h" |
| 26 | 26 |
| 27 #include "core/dom/Attr.h" | 27 #include "core/dom/Attr.h" |
| 28 #include "core/dom/Node.h" |
| 28 #include "core/dom/NodeRareData.h" | 29 #include "core/dom/NodeRareData.h" |
| 29 #include "core/dom/NodeTraversal.h" | 30 #include "core/dom/NodeTraversal.h" |
| 31 #include "core/dom/custom/CustomElement.h" |
| 30 #include "core/dom/shadow/ElementShadow.h" | 32 #include "core/dom/shadow/ElementShadow.h" |
| 31 #include "core/dom/shadow/ShadowRoot.h" | 33 #include "core/dom/shadow/ShadowRoot.h" |
| 32 | 34 |
| 33 namespace blink { | 35 namespace blink { |
| 34 | 36 |
| 35 void TreeScopeAdopter::moveTreeToNewScope(Node& root) const | 37 void TreeScopeAdopter::moveTreeToNewScope(Node& root) const |
| 36 { | 38 { |
| 37 DCHECK(needsScopeChange()); | 39 DCHECK(needsScopeChange()); |
| 38 | 40 |
| 39 // If an element is moved from a document and then eventually back again the
collection cache for | 41 // If an element is moved from a document and then eventually back again the
collection cache for |
| (...skipping 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 118 DCHECK_NE(oldDocument, newDocument); | 120 DCHECK_NE(oldDocument, newDocument); |
| 119 | 121 |
| 120 if (node.hasRareData()) { | 122 if (node.hasRareData()) { |
| 121 NodeRareData* rareData = node.rareData(); | 123 NodeRareData* rareData = node.rareData(); |
| 122 if (rareData->nodeLists()) | 124 if (rareData->nodeLists()) |
| 123 rareData->nodeLists()->adoptDocument(oldDocument, newDocument); | 125 rareData->nodeLists()->adoptDocument(oldDocument, newDocument); |
| 124 } | 126 } |
| 125 | 127 |
| 126 oldDocument.moveNodeIteratorsToNewDocument(node, newDocument); | 128 oldDocument.moveNodeIteratorsToNewDocument(node, newDocument); |
| 127 | 129 |
| 130 if (node.isElementNode()) { |
| 131 Element& element = toElement(node); |
| 132 if (element.getCustomElementState() == CustomElementState::Custom) |
| 133 CustomElement::enqueueAdoptedCallback(&element); |
| 134 } |
| 135 |
| 128 if (node.isShadowRoot()) | 136 if (node.isShadowRoot()) |
| 129 toShadowRoot(node).setDocument(newDocument); | 137 toShadowRoot(node).setDocument(newDocument); |
| 130 | 138 |
| 131 #if DCHECK_IS_ON() | 139 #if DCHECK_IS_ON() |
| 132 didMoveToNewDocumentWasCalled = false; | 140 didMoveToNewDocumentWasCalled = false; |
| 133 oldDocumentDidMoveToNewDocumentWasCalledWith = &oldDocument; | 141 oldDocumentDidMoveToNewDocumentWasCalledWith = &oldDocument; |
| 134 #endif | 142 #endif |
| 135 | 143 |
| 136 node.didMoveToNewDocument(oldDocument); | 144 node.didMoveToNewDocument(oldDocument); |
| 137 #if DCHECK_IS_ON() | 145 #if DCHECK_IS_ON() |
| 138 DCHECK(didMoveToNewDocumentWasCalled); | 146 DCHECK(didMoveToNewDocumentWasCalled); |
| 139 #endif | 147 #endif |
| 140 } | 148 } |
| 141 | 149 |
| 142 } // namespace blink | 150 } // namespace blink |
| OLD | NEW |