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/dom/Attr.h"
29 #include "core/dom/NodeRareData.h"
30 #include "core/dom/NodeTraversal.h"
31 #include "core/dom/shadow/ElementShadow.h"
32 #include "core/dom/shadow/ShadowRoot.h"
36 void TreeScopeAdopter::moveTreeToNewScope(Node
& root
) const
38 ASSERT(needsScopeChange());
41 oldScope().guardRef();
44 // If an element is moved from a document and then eventually back again the collection cache for
45 // that element may contain stale data as changes made to it will have updated the DOMTreeVersion
46 // of the document it was moved to. By increasing the DOMTreeVersion of the donating document here
47 // we ensure that the collection cache will be invalidated as needed when the element is moved back.
48 Document
& oldDocument
= oldScope().document();
49 Document
& newDocument
= newScope().document();
50 bool willMoveToNewDocument
= oldDocument
!= newDocument
;
51 if (willMoveToNewDocument
)
52 oldDocument
.incDOMTreeVersion();
54 for (Node
& node
: NodeTraversal::inclusiveDescendantsOf(root
)) {
55 updateTreeScope(node
);
57 if (willMoveToNewDocument
) {
58 moveNodeToNewDocument(node
, oldDocument
, newDocument
);
59 } else if (node
.hasRareData()) {
60 NodeRareData
* rareData
= node
.rareData();
61 if (rareData
->nodeLists())
62 rareData
->nodeLists()->adoptTreeScope();
65 if (!node
.isElementNode())
67 Element
& element
= toElement(node
);
69 if (WillBeHeapVector
<RefPtrWillBeMember
<Attr
>>* attrs
= element
.attrNodeList()) {
70 for (const auto& attr
: *attrs
)
71 moveTreeToNewScope(*attr
);
74 for (ShadowRoot
* shadow
= element
.youngestShadowRoot(); shadow
; shadow
= shadow
->olderShadowRoot()) {
75 shadow
->setParentTreeScope(newScope());
76 if (willMoveToNewDocument
)
77 moveTreeToNewDocument(*shadow
, oldDocument
, newDocument
);
82 oldScope().guardDeref();
86 void TreeScopeAdopter::moveTreeToNewDocument(Node
& root
, Document
& oldDocument
, Document
& newDocument
) const
88 ASSERT(oldDocument
!= newDocument
);
89 for (Node
& node
: NodeTraversal::inclusiveDescendantsOf(root
)) {
90 moveNodeToNewDocument(node
, oldDocument
, newDocument
);
92 if (!node
.isElementNode())
94 Element
& element
= toElement(node
);
96 if (WillBeHeapVector
<RefPtrWillBeMember
<Attr
>>* attrs
= element
.attrNodeList()) {
97 for (const auto& attr
: *attrs
)
98 moveTreeToNewDocument(*attr
, oldDocument
, newDocument
);
101 for (ShadowRoot
* shadow
= element
.youngestShadowRoot(); shadow
; shadow
= shadow
->olderShadowRoot())
102 moveTreeToNewDocument(*shadow
, oldDocument
, newDocument
);
107 static bool didMoveToNewDocumentWasCalled
= false;
108 static Document
* oldDocumentDidMoveToNewDocumentWasCalledWith
= 0;
110 void TreeScopeAdopter::ensureDidMoveToNewDocumentWasCalled(Document
& oldDocument
)
112 ASSERT(!didMoveToNewDocumentWasCalled
);
113 ASSERT_UNUSED(oldDocument
, oldDocument
== oldDocumentDidMoveToNewDocumentWasCalledWith
);
114 didMoveToNewDocumentWasCalled
= true;
118 inline void TreeScopeAdopter::updateTreeScope(Node
& node
) const
120 ASSERT(!node
.isTreeScope());
121 ASSERT(node
.treeScope() == oldScope());
123 newScope().guardRef();
124 oldScope().guardDeref();
126 node
.setTreeScope(m_newScope
);
129 inline void TreeScopeAdopter::moveNodeToNewDocument(Node
& node
, Document
& oldDocument
, Document
& newDocument
) const
131 ASSERT(oldDocument
!= newDocument
);
133 if (node
.hasRareData()) {
134 NodeRareData
* rareData
= node
.rareData();
135 if (rareData
->nodeLists())
136 rareData
->nodeLists()->adoptDocument(oldDocument
, newDocument
);
139 oldDocument
.moveNodeIteratorsToNewDocument(node
, newDocument
);
141 if (node
.isShadowRoot())
142 toShadowRoot(node
).setDocument(newDocument
);
145 didMoveToNewDocumentWasCalled
= false;
146 oldDocumentDidMoveToNewDocumentWasCalledWith
= &oldDocument
;
149 node
.didMoveToNewDocument(oldDocument
);
150 ASSERT(didMoveToNewDocumentWasCalled
);