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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
// Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/css/style_traversal_root.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "third_party/blink/renderer/core/dom/document.h"
#include "third_party/blink/renderer/core/dom/element.h"
#include "third_party/blink/renderer/core/dom/flat_tree_traversal.h"
#include "third_party/blink/renderer/platform/heap/heap.h"
#include "third_party/blink/renderer/platform/heap/persistent.h"
namespace blink {
class StyleTraversalRootTestImpl : public StyleTraversalRoot {
STACK_ALLOCATED();
public:
StyleTraversalRootTestImpl() = default;
void MarkDirty(const Node* node) {
DCHECK(node);
dirty_nodes_.insert(node);
#if DCHECK_IS_ON()
for (const Element* element = node->parentElement(); element;
element = element->parentElement()) {
child_dirty_nodes_.insert(element);
}
#endif
}
bool IsSingleRoot() const { return root_type_ == RootType::kSingleRoot; }
bool IsCommonRoot() const { return root_type_ == RootType::kCommonRoot; }
void SubtreeModified(ContainerNode& parent) override {
if (!GetRootNode() || GetRootNode()->isConnected())
return;
Clear();
}
private:
virtual ContainerNode* ParentInternal(const Node& node) const {
return node.parentNode();
}
#if DCHECK_IS_ON()
ContainerNode* Parent(const Node& node) const override {
return ParentInternal(node);
}
bool IsChildDirty(const Node& node) const override {
return child_dirty_nodes_.Contains(&node);
}
#endif // DCHECK_IS_ON()
bool IsDirty(const Node& node) const final {
return dirty_nodes_.Contains(&node);
}
HeapHashSet<Member<const Node>> dirty_nodes_;
#if DCHECK_IS_ON()
HeapHashSet<Member<const Node>> child_dirty_nodes_;
#endif
};
class StyleTraversalRootTest : public testing::Test {
protected:
enum ElementIndex { kA, kB, kC, kD, kE, kF, kG, kElementCount };
void SetUp() final {
document_ = Document::CreateForTest();
elements_ = MakeGarbageCollected<HeapVector<Member<Element>, 7>>();
for (size_t i = 0; i < kElementCount; i++) {
elements_->push_back(GetDocument().CreateRawElement(html_names::kDivTag));
}
GetDocument().appendChild(DivElement(kA));
DivElement(kA)->appendChild(DivElement(kB));
DivElement(kA)->appendChild(DivElement(kC));
DivElement(kB)->appendChild(DivElement(kD));
DivElement(kB)->appendChild(DivElement(kE));
DivElement(kC)->appendChild(DivElement(kF));
DivElement(kC)->appendChild(DivElement(kG));
// Tree Looks like this:
// div#a
// |-- div#b
// | |-- div#d
// | `-- div#e
// `-- div#c
// |-- div#f
// `-- div#g
}
Document& GetDocument() { return *document_; }
Element* DivElement(ElementIndex index) { return elements_->at(index); }
private:
Persistent<Document> document_;
Persistent<HeapVector<Member<Element>, 7>> elements_;
};
TEST_F(StyleTraversalRootTest, Update_SingleRoot) {
StyleTraversalRootTestImpl root;
root.MarkDirty(DivElement(kA));
// A single dirty node becomes a single root.
root.Update(nullptr, DivElement(kA));
EXPECT_EQ(DivElement(kA), root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
}
TEST_F(StyleTraversalRootTest, Update_CommonRoot) {
StyleTraversalRootTestImpl root;
root.MarkDirty(DivElement(kC));
// Initially make B a single root.
root.Update(nullptr, DivElement(kB));
EXPECT_EQ(DivElement(kB), root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
// Adding C makes A a common root.
root.MarkDirty(DivElement(kB));
root.Update(DivElement(kA), DivElement(kC));
EXPECT_EQ(DivElement(kA), root.GetRootNode());
EXPECT_FALSE(root.IsSingleRoot());
EXPECT_TRUE(root.IsCommonRoot());
}
TEST_F(StyleTraversalRootTest, Update_CommonRootDirtySubtree) {
StyleTraversalRootTestImpl root;
root.MarkDirty(DivElement(kA));
root.Update(nullptr, DivElement(kA));
// Marking descendants of a single dirty root makes the single root a common
// root as long as the new common ancestor is the current root.
root.MarkDirty(DivElement(kD));
root.Update(DivElement(kA), DivElement(kD));
EXPECT_EQ(DivElement(kA), root.GetRootNode());
EXPECT_FALSE(root.IsSingleRoot());
EXPECT_TRUE(root.IsCommonRoot());
}
TEST_F(StyleTraversalRootTest, Update_CommonRootDocumentFallback) {
StyleTraversalRootTestImpl root;
// Initially make B a common root for D and E.
root.MarkDirty(DivElement(kD));
root.Update(nullptr, DivElement(kD));
root.MarkDirty(DivElement(kE));
root.Update(DivElement(kB), DivElement(kE));
EXPECT_EQ(DivElement(kB), root.GetRootNode());
EXPECT_FALSE(root.IsSingleRoot());
EXPECT_TRUE(root.IsCommonRoot());
// Adding C falls back to using the document as the root because we don't know
// if A is above or below the current common root B.
root.MarkDirty(DivElement(kC));
root.Update(DivElement(kA), DivElement(kC));
EXPECT_EQ(&GetDocument(), root.GetRootNode());
EXPECT_FALSE(root.IsSingleRoot());
EXPECT_TRUE(root.IsCommonRoot());
}
TEST_F(StyleTraversalRootTest, SubtreeModified) {
StyleTraversalRootTestImpl root;
// Initially make E a single root.
root.MarkDirty(DivElement(kE));
root.Update(nullptr, DivElement(kE));
EXPECT_EQ(DivElement(kE), root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
// Removing D not affecting E.
DivElement(kD)->remove();
root.SubtreeModified(*DivElement(kB));
EXPECT_EQ(DivElement(kE), root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
// Removing B
DivElement(kB)->remove();
root.SubtreeModified(*DivElement(kA));
EXPECT_FALSE(root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
}
class StyleTraversalRootFlatTreeTestImpl : public StyleTraversalRootTestImpl {
private:
ContainerNode* ParentInternal(const Node& node) const final {
// Flat tree does not include Document or ShadowRoot.
return FlatTreeTraversal::ParentElement(node);
}
};
TEST_F(StyleTraversalRootTest, Update_CommonRoot_FlatTree) {
StyleTraversalRootFlatTreeTestImpl root;
// The single dirty node D becomes a single root.
root.MarkDirty(DivElement(kD));
root.Update(nullptr, DivElement(kD));
EXPECT_EQ(DivElement(kD), root.GetRootNode());
EXPECT_TRUE(root.IsSingleRoot());
// A becomes a common root.
root.MarkDirty(DivElement(kA));
root.Update(nullptr, DivElement(kA));
EXPECT_EQ(DivElement(kA), root.GetRootNode());
EXPECT_TRUE(root.IsCommonRoot());
// Making E dirty and the document becomes the common root.
root.MarkDirty(DivElement(kE));
root.Update(DivElement(kB), DivElement(kE));
EXPECT_EQ(&GetDocument(), root.GetRootNode());
EXPECT_TRUE(root.IsCommonRoot());
}
} // namespace blink
|
