2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
3 * (C) 1999 Antti Koivisto (koivisto@kde.org)
4 * (C) 2001 Dirk Mueller (mueller@kde.org)
5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
8 * Copyright (C) 2011 Google Inc. All rights reserved.
10 * This library is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Library General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This library is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Library General Public License for more details.
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
22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
23 * Boston, MA 02110-1301, USA.
26 #include "core/dom/TreeScopeAdopter.h"
28 #include "core/accessibility/AXObjectCache.h"
29 #include "core/dom/Attr.h"
30 #include "core/dom/NodeRareData.h"
31 #include "core/dom/NodeTraversal.h"
32 #include "core/dom/shadow/ElementShadow.h"
33 #include "core/dom/shadow/ShadowRoot.h"
37 void TreeScopeAdopter::moveTreeToNewScope(Node& root) const
39 ASSERT(needsScopeChange());
42 oldScope().guardRef();
45 // If an element is moved from a document and then eventually back again the collection cache for
46 // that element may contain stale data as changes made to it will have updated the DOMTreeVersion
47 // of the document it was moved to. By increasing the DOMTreeVersion of the donating document here
48 // we ensure that the collection cache will be invalidated as needed when the element is moved back.
49 Document& oldDocument = oldScope().document();
50 Document& newDocument = newScope().document();
51 bool willMoveToNewDocument = oldDocument != newDocument;
52 AXObjectCache* axObjectCache = oldDocument.existingAXObjectCache();
53 if (willMoveToNewDocument)
54 oldDocument.incDOMTreeVersion();
56 for (Node* node = &root; node; node = NodeTraversal::next(*node, &root)) {
57 updateTreeScope(*node);
59 if (willMoveToNewDocument) {
61 axObjectCache->remove(node);
62 moveNodeToNewDocument(*node, oldDocument, newDocument);
63 } else if (node->hasRareData()) {
64 NodeRareData* rareData = node->rareData();
65 if (rareData->nodeLists())
66 rareData->nodeLists()->adoptTreeScope();
69 if (!node->isElementNode())
72 if (node->hasSyntheticAttrChildNodes()) {
73 WillBeHeapVector<RefPtrWillBeMember<Attr> >& attrs = *toElement(node)->attrNodeList();
74 for (unsigned i = 0; i < attrs.size(); ++i)
75 moveTreeToNewScope(*attrs[i]);
78 for (ShadowRoot* shadow = node->youngestShadowRoot(); shadow; shadow = shadow->olderShadowRoot()) {
79 shadow->setParentTreeScope(newScope());
80 if (willMoveToNewDocument)
81 moveTreeToNewDocument(*shadow, oldDocument, newDocument);
86 oldScope().guardDeref();
90 void TreeScopeAdopter::moveTreeToNewDocument(Node& root, Document& oldDocument, Document& newDocument) const
92 ASSERT(oldDocument != newDocument);
93 for (Node* node = &root; node; node = NodeTraversal::next(*node, &root)) {
94 moveNodeToNewDocument(*node, oldDocument, newDocument);
95 for (ShadowRoot* shadow = node->youngestShadowRoot(); shadow; shadow = shadow->olderShadowRoot())
96 moveTreeToNewDocument(*shadow, oldDocument, newDocument);
101 static bool didMoveToNewDocumentWasCalled = false;
102 static Document* oldDocumentDidMoveToNewDocumentWasCalledWith = 0;
104 void TreeScopeAdopter::ensureDidMoveToNewDocumentWasCalled(Document& oldDocument)
106 ASSERT(!didMoveToNewDocumentWasCalled);
107 ASSERT_UNUSED(oldDocument, oldDocument == oldDocumentDidMoveToNewDocumentWasCalledWith);
108 didMoveToNewDocumentWasCalled = true;
112 inline void TreeScopeAdopter::updateTreeScope(Node& node) const
114 ASSERT(!node.isTreeScope());
115 ASSERT(node.treeScope() == oldScope());
117 newScope().guardRef();
118 oldScope().guardDeref();
120 node.setTreeScope(m_newScope);
123 inline void TreeScopeAdopter::moveNodeToNewDocument(Node& node, Document& oldDocument, Document& newDocument) const
125 ASSERT(oldDocument != newDocument);
127 if (node.hasRareData()) {
128 NodeRareData* rareData = node.rareData();
129 if (rareData->nodeLists())
130 rareData->nodeLists()->adoptDocument(oldDocument, newDocument);
133 oldDocument.moveNodeIteratorsToNewDocument(node, newDocument);
135 if (node.isShadowRoot())
136 toShadowRoot(node).setDocument(newDocument);
139 didMoveToNewDocumentWasCalled = false;
140 oldDocumentDidMoveToNewDocumentWasCalledWith = &oldDocument;
143 node.didMoveToNewDocument(oldDocument);
144 ASSERT(didMoveToNewDocumentWasCalled);