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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/*
* Copyright (C) 2012 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "core/dom/shadow/ComposedTreeTraversal.h"
#include "core/dom/Element.h"
#include "core/dom/shadow/ElementShadow.h"
#include "core/html/HTMLShadowElement.h"
namespace blink {
static inline ElementShadow* shadowFor(const Node& node)
{
return node.isElementNode() ? toElement(node).shadow() : 0;
}
Node* ComposedTreeTraversal::traverseChild(const Node& node, TraversalDirection direction)
{
ElementShadow* shadow = shadowFor(node);
return shadow ? traverseLightChildren(*shadow->youngestShadowRoot(), direction)
: traverseLightChildren(node, direction);
}
Node* ComposedTreeTraversal::traverseLightChildren(const Node& node, TraversalDirection direction)
{
return traverseSiblings(direction == TraversalDirectionForward ? node.firstChild() : node.lastChild(), direction);
}
Node* ComposedTreeTraversal::traverseSiblings(const Node* node, TraversalDirection direction)
{
for (const Node* sibling = node; sibling; sibling = (direction == TraversalDirectionForward ? sibling->nextSibling() : sibling->previousSibling())) {
if (Node* found = traverseNode(*sibling, direction))
return found;
}
return 0;
}
Node* ComposedTreeTraversal::traverseNode(const Node& node, TraversalDirection direction)
{
if (!isActiveInsertionPoint(node))
return const_cast<Node*>(&node);
const InsertionPoint& insertionPoint = toInsertionPoint(node);
if (Node* found = traverseDistributedNodes(direction == TraversalDirectionForward ? insertionPoint.first() : insertionPoint.last(), insertionPoint, direction))
return found;
ASSERT(isHTMLShadowElement(node) || (isHTMLContentElement(node) && !node.hasChildren()));
return 0;
}
Node* ComposedTreeTraversal::traverseDistributedNodes(const Node* node, const InsertionPoint& insertionPoint, TraversalDirection direction)
{
for (const Node* next = node; next; next = (direction == TraversalDirectionForward ? insertionPoint.nextTo(next) : insertionPoint.previousTo(next))) {
if (Node* found = traverseNode(*next, direction))
return found;
}
return 0;
}
Node* ComposedTreeTraversal::traverseSiblingOrBackToInsertionPoint(const Node& node, TraversalDirection direction)
{
if (!shadowWhereNodeCanBeDistributed(node))
return traverseSiblingInCurrentTree(node, direction);
const InsertionPoint* insertionPoint = resolveReprojection(&node);
if (!insertionPoint)
return traverseSiblingInCurrentTree(node, direction);
if (Node* found = traverseDistributedNodes(direction == TraversalDirectionForward ? insertionPoint->nextTo(&node) : insertionPoint->previousTo(&node), *insertionPoint, direction))
return found;
return traverseSiblingOrBackToInsertionPoint(*insertionPoint, direction);
}
Node* ComposedTreeTraversal::traverseSiblingInCurrentTree(const Node& node, TraversalDirection direction)
{
if (Node* found = traverseSiblings(direction == TraversalDirectionForward ? node.nextSibling() : node.previousSibling(), direction))
return found;
if (Node* next = traverseBackToYoungerShadowRoot(node, direction))
return next;
return 0;
}
Node* ComposedTreeTraversal::traverseBackToYoungerShadowRoot(const Node& node, TraversalDirection direction)
{
if (node.parentNode() && node.parentNode()->isShadowRoot()) {
ShadowRoot* parentShadowRoot = toShadowRoot(node.parentNode());
if (!parentShadowRoot->isYoungest()) {
HTMLShadowElement* assignedInsertionPoint = parentShadowRoot->shadowInsertionPointOfYoungerShadowRoot();
ASSERT(assignedInsertionPoint);
return traverseSiblingInCurrentTree(*assignedInsertionPoint, direction);
}
}
return 0;
}
// FIXME: Use an iterative algorithm so that it can be inlined.
// https://bugs.webkit.org/show_bug.cgi?id=90415
ContainerNode* ComposedTreeTraversal::traverseParent(const Node& node, ParentTraversalDetails* details)
{
if (node.isPseudoElement())
return node.parentOrShadowHostNode();
if (shadowWhereNodeCanBeDistributed(node)) {
if (const InsertionPoint* insertionPoint = resolveReprojection(&node)) {
if (details)
details->didTraverseInsertionPoint(insertionPoint);
// The node is distributed. But the distribution was stopped at this insertion point.
if (shadowWhereNodeCanBeDistributed(*insertionPoint))
return 0;
return traverseParentOrHost(*insertionPoint);
}
return 0;
}
return traverseParentOrHost(node);
}
inline ContainerNode* ComposedTreeTraversal::traverseParentOrHost(const Node& node)
{
ContainerNode* parent = node.parentNode();
if (!parent)
return 0;
if (!parent->isShadowRoot())
return parent;
ShadowRoot* shadowRoot = toShadowRoot(parent);
ASSERT(!shadowRoot->shadowInsertionPointOfYoungerShadowRoot());
if (!shadowRoot->isYoungest())
return 0;
Element* host = shadowRoot->host();
if (isActiveInsertionPoint(*host))
return 0;
return host;
}
} // namespace
|
