1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
* Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
* Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
* Copyright (C) 2012 Google Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "config.h"
#include "ContainerNodeAlgorithms.h"
#include "Element.h"
#include "ElementShadow.h"
#include "HTMLFrameOwnerElement.h"
namespace WebCore {
void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerNode* node)
{
ChildNodesLazySnapshot snapshot(node);
while (Node* child = snapshot.nextNode()) {
// If we have been removed from the document during this loop, then
// we don't want to tell the rest of our children that they've been
// inserted into the document because they haven't.
if (node->inDocument() && child->parentNode() == node)
notifyNodeInsertedIntoDocument(child);
}
if (!node->isElementNode())
return;
if (ElementShadow* shadow = toElement(node)->shadow()) {
ShadowRootVector roots(shadow);
for (size_t i = 0; i < roots.size(); ++i) {
if (node->inDocument() && roots[i]->host() == node)
notifyNodeInsertedIntoDocument(roots[i].get());
}
}
}
void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoTree(ContainerNode* node)
{
for (Node* child = node->firstChild(); child; child = child->nextSibling()) {
if (child->isContainerNode())
notifyNodeInsertedIntoTree(toContainerNode(child));
}
for (ShadowRoot* root = node->youngestShadowRoot(); root; root = root->olderShadowRoot())
notifyNodeInsertedIntoTree(root);
}
void ChildNodeRemovalNotifier::notifyDescendantRemovedFromDocument(ContainerNode* node)
{
ChildNodesLazySnapshot snapshot(node);
while (Node* child = snapshot.nextNode()) {
// If we have been added to the document during this loop, then we
// don't want to tell the rest of our children that they've been
// removed from the document because they haven't.
if (!node->inDocument() && child->parentNode() == node)
notifyNodeRemovedFromDocument(child);
}
if (!node->isElementNode())
return;
if (node->document()->cssTarget() == node)
node->document()->setCSSTarget(0);
if (ElementShadow* shadow = toElement(node)->shadow()) {
ShadowRootVector roots(shadow);
for (size_t i = 0; i < roots.size(); ++i) {
if (!node->inDocument() && roots[i]->host() == node)
notifyNodeRemovedFromDocument(roots[i].get());
}
}
}
void ChildNodeRemovalNotifier::notifyDescendantRemovedFromTree(ContainerNode* node)
{
for (Node* child = node->firstChild(); child; child = child->nextSibling()) {
if (child->isContainerNode())
notifyNodeRemovedFromTree(toContainerNode(child));
}
if (!node->isElementNode())
return;
if (ElementShadow* shadow = toElement(node)->shadow()) {
ShadowRootVector roots(shadow);
for (size_t i = 0; i < roots.size(); ++i)
notifyNodeRemovedFromTree(roots[i].get());
}
}
void ChildFrameDisconnector::collectDescendant(ElementShadow* shadow)
{
for (ShadowRoot* root = shadow->youngestShadowRoot(); root; root = root->olderShadowRoot())
collectDescendant(root, IncludeRoot);
}
void ChildFrameDisconnector::Target::disconnect()
{
ASSERT(isValid());
toFrameOwnerElement(m_owner.get())->disconnectContentFrame();
}
}
|
