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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/*
* 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.
*/
#ifndef ComposedShadowTreeWalker_h
#define ComposedShadowTreeWalker_h
#include "InsertionPoint.h"
#include "ShadowRoot.h"
namespace WebCore {
class Node;
class ShadowRoot;
// FIXME: Make some functions inline to optimise the performance.
// https://bugs.webkit.org/show_bug.cgi?id=82702
class ComposedShadowTreeWalker {
public:
enum Policy {
CrossUpperBoundary,
DoNotCrossUpperBoundary,
};
enum StartPolicy {
CanStartFromShadowBoundary,
CannotStartFromShadowBoundary
};
class ParentTraversalDetails {
public:
ParentTraversalDetails()
: m_node(0)
, m_insertionPoint(0)
, m_resetStyleInheritance(false)
, m_outOfComposition(false)
{ }
ContainerNode* node() const { return m_node; }
InsertionPoint* insertionPoint() const { return m_insertionPoint; }
bool resetStyleInheritance() const { return m_resetStyleInheritance; }
bool outOfComposition() const { return m_outOfComposition; }
void didFindNode(ContainerNode*);
void didTraverseInsertionPoint(InsertionPoint*);
void didTraverseShadowRoot(const ShadowRoot*);
void childWasOutOfComposition() { m_outOfComposition = true; }
private:
ContainerNode* m_node;
InsertionPoint* m_insertionPoint;
bool m_resetStyleInheritance;
bool m_outOfComposition;
};
ComposedShadowTreeWalker(const Node*, Policy = CrossUpperBoundary, StartPolicy = CannotStartFromShadowBoundary);
// For a common use case such as:
// for (ComposedShadowTreeWalker walker = ComposedShadowTreeWalker::fromFirstChild(node); walker.get(); walker.nextSibling())
static ComposedShadowTreeWalker fromFirstChild(const Node*, Policy = CrossUpperBoundary);
static void findParent(const Node*, ParentTraversalDetails*);
Node* get() const { return const_cast<Node*>(m_node); }
void firstChild();
void lastChild();
void nextSibling();
void previousSibling();
void parent();
void next();
void previous();
private:
ComposedShadowTreeWalker(const Node*, ParentTraversalDetails*);
enum TraversalDirection {
TraversalDirectionForward,
TraversalDirectionBackward
};
bool canCrossUpperBoundary() const { return m_policy == CrossUpperBoundary; }
void assertPrecondition() const
{
#ifndef NDEBUG
ASSERT(m_node);
if (canCrossUpperBoundary())
ASSERT(!m_node->isShadowRoot());
else
ASSERT(!m_node->isShadowRoot() || toShadowRoot(m_node)->isYoungest());
ASSERT(!isActiveInsertionPoint(m_node));
#endif
}
void assertPostcondition() const
{
#ifndef NDEBUG
if (m_node)
assertPrecondition();
#endif
}
static Node* traverseNode(const Node*, TraversalDirection);
static Node* traverseLightChildren(const Node*, TraversalDirection);
Node* traverseFirstChild(const Node*) const;
Node* traverseLastChild(const Node*) const;
Node* traverseChild(const Node*, TraversalDirection) const;
Node* traverseParent(const Node*, ParentTraversalDetails* = 0) const;
static Node* traverseNextSibling(const Node*);
static Node* traversePreviousSibling(const Node*);
static Node* traverseSiblingOrBackToInsertionPoint(const Node*, TraversalDirection);
static Node* traverseSiblingInCurrentTree(const Node*, TraversalDirection);
static Node* traverseSiblings(const Node*, TraversalDirection);
static Node* traverseDistributedNodes(const Node*, const InsertionPoint*, TraversalDirection);
static Node* traverseBackToYoungerShadowRoot(const Node*, TraversalDirection);
static Node* escapeFallbackContentElement(const Node*, TraversalDirection);
Node* traverseNodeEscapingFallbackContents(const Node*, ParentTraversalDetails* = 0) const;
Node* traverseParentInCurrentTree(const Node*, ParentTraversalDetails* = 0) const;
Node* traverseParentBackToYoungerShadowRootOrHost(const ShadowRoot*, ParentTraversalDetails* = 0) const;
const Node* m_node;
Policy m_policy;
};
inline ComposedShadowTreeWalker::ComposedShadowTreeWalker(const Node* node, Policy policy, StartPolicy startPolicy)
: m_node(node)
, m_policy(policy)
{
UNUSED_PARAM(startPolicy);
#ifndef NDEBUG
if (m_node && startPolicy == CannotStartFromShadowBoundary)
assertPrecondition();
#endif
}
class AncestorChainWalker {
public:
explicit AncestorChainWalker(const Node*);
void parent();
Node* get() const { return const_cast<Node*>(m_node); }
bool crossingInsertionPoint() { return m_isCrossingInsertionPoint; }
private:
const Node* m_node;
const Node* m_distributedNode;
bool m_isCrossingInsertionPoint;
};
} // namespace
#endif
|
