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
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com)
* Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com)
* Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
* reserved.
* Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
* Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org>
* Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved.
* (http://www.torchmobile.com/)
* Copyright (c) 2011, Code Aurora Forum. All rights reserved.
* Copyright (C) Research In Motion Limited 2011. All rights reserved.
* 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 "third_party/blink/renderer/core/css/selector_filter.h"
#include "third_party/blink/renderer/core/css/css_selector.h"
#include "third_party/blink/renderer/core/dom/document.h"
namespace blink {
// Salt to separate otherwise identical string hashes so a class-selector like
// .article won't match <article> elements.
enum { kTagNameSalt = 13, kIdAttributeSalt = 17, kClassAttributeSalt = 19 };
static inline void CollectElementIdentifierHashes(
const Element& element,
Vector<unsigned, 4>& identifier_hashes) {
identifier_hashes.push_back(
element.LocalNameForSelectorMatching().Impl()->ExistingHash() *
kTagNameSalt);
if (element.HasID())
identifier_hashes.push_back(
element.IdForStyleResolution().Impl()->ExistingHash() *
kIdAttributeSalt);
if (element.IsStyledElement() && element.HasClass()) {
const SpaceSplitString& class_names = element.ClassNames();
wtf_size_t count = class_names.size();
for (wtf_size_t i = 0; i < count; ++i) {
DCHECK(class_names[i].Impl());
// Speculative fix for https://crbug.com/646026
if (class_names[i].Impl())
identifier_hashes.push_back(class_names[i].Impl()->ExistingHash() *
kClassAttributeSalt);
}
}
}
void SelectorFilter::PushParentStackFrame(Element& parent) {
DCHECK(ancestor_identifier_filter_);
DCHECK(parent_stack_.IsEmpty() ||
parent_stack_.back().element == parent.ParentOrShadowHostElement());
DCHECK(!parent_stack_.IsEmpty() || !parent.ParentOrShadowHostElement());
parent_stack_.push_back(ParentStackFrame(parent));
ParentStackFrame& parent_frame = parent_stack_.back();
// Mix tags, class names and ids into some sort of weird bouillabaisse.
// The filter is used for fast rejection of child and descendant selectors.
CollectElementIdentifierHashes(parent, parent_frame.identifier_hashes);
wtf_size_t count = parent_frame.identifier_hashes.size();
for (wtf_size_t i = 0; i < count; ++i)
ancestor_identifier_filter_->Add(parent_frame.identifier_hashes[i]);
}
void SelectorFilter::PopParentStackFrame() {
DCHECK(!parent_stack_.IsEmpty());
DCHECK(ancestor_identifier_filter_);
const ParentStackFrame& parent_frame = parent_stack_.back();
wtf_size_t count = parent_frame.identifier_hashes.size();
for (wtf_size_t i = 0; i < count; ++i)
ancestor_identifier_filter_->Remove(parent_frame.identifier_hashes[i]);
parent_stack_.pop_back();
if (parent_stack_.IsEmpty()) {
#if DCHECK_IS_ON()
DCHECK(ancestor_identifier_filter_->LikelyEmpty());
#endif
ancestor_identifier_filter_.reset();
}
}
void SelectorFilter::PushParent(Element& parent) {
DCHECK(parent.GetDocument().InStyleRecalc());
DCHECK(parent.InActiveDocument());
if (parent_stack_.IsEmpty()) {
DCHECK_EQ(parent, parent.GetDocument().documentElement());
DCHECK(!ancestor_identifier_filter_);
ancestor_identifier_filter_ = std::make_unique<IdentifierFilter>();
PushParentStackFrame(parent);
return;
}
DCHECK(ancestor_identifier_filter_);
// We may get invoked for some random elements in some wacky cases during
// style resolve. Pause maintaining the stack in this case.
if (parent_stack_.back().element != parent.ParentOrShadowHostElement())
return;
PushParentStackFrame(parent);
}
void SelectorFilter::PopParent(Element& parent) {
DCHECK(parent.GetDocument().InStyleRecalc());
DCHECK(parent.InActiveDocument());
// Note that we may get invoked for some random elements in some wacky cases
// during style resolve. Pause maintaining the stack in this case.
if (!ParentStackIsConsistent(&parent))
return;
PopParentStackFrame();
}
static inline void CollectDescendantSelectorIdentifierHashes(
const CSSSelector& selector,
unsigned*& hash) {
switch (selector.Match()) {
case CSSSelector::kId:
if (!selector.Value().IsEmpty())
(*hash++) = selector.Value().Impl()->ExistingHash() * kIdAttributeSalt;
break;
case CSSSelector::kClass:
if (!selector.Value().IsEmpty())
(*hash++) =
selector.Value().Impl()->ExistingHash() * kClassAttributeSalt;
break;
case CSSSelector::kTag:
if (selector.TagQName().LocalName() !=
CSSSelector::UniversalSelectorAtom())
(*hash++) = selector.TagQName().LocalName().Impl()->ExistingHash() *
kTagNameSalt;
break;
default:
break;
}
}
void SelectorFilter::CollectIdentifierHashes(
const CSSSelector& selector,
unsigned* identifier_hashes,
unsigned maximum_identifier_count) {
unsigned* hash = identifier_hashes;
unsigned* end = identifier_hashes + maximum_identifier_count;
CSSSelector::RelationType relation = selector.Relation();
if (selector.RelationIsAffectedByPseudoContent()) {
// Disable fastRejectSelector.
*identifier_hashes = 0;
return;
}
// Skip the rightmost compound. It is handled quickly by the rule hashes.
bool skip_over_subselectors = true;
for (const CSSSelector* current = selector.TagHistory(); current;
current = current->TagHistory()) {
// Only collect identifiers that match ancestors.
switch (relation) {
case CSSSelector::kSubSelector:
if (!skip_over_subselectors)
CollectDescendantSelectorIdentifierHashes(*current, hash);
break;
case CSSSelector::kDirectAdjacent:
case CSSSelector::kIndirectAdjacent:
skip_over_subselectors = true;
break;
case CSSSelector::kShadowSlot:
// Disable fastRejectSelector.
*identifier_hashes = 0;
return;
case CSSSelector::kDescendant:
case CSSSelector::kShadowDeepAsDescendant:
case CSSSelector::kChild:
case CSSSelector::kShadowPseudo:
case CSSSelector::kShadowPart:
case CSSSelector::kShadowDeep:
skip_over_subselectors = false;
CollectDescendantSelectorIdentifierHashes(*current, hash);
break;
}
if (hash == end)
return;
relation = current->Relation();
if (current->RelationIsAffectedByPseudoContent()) {
// Disable fastRejectSelector.
*identifier_hashes = 0;
return;
}
}
*hash = 0;
}
void SelectorFilter::ParentStackFrame::Trace(Visitor* visitor) const {
visitor->Trace(element);
}
void SelectorFilter::Trace(Visitor* visitor) const {
visitor->Trace(parent_stack_);
}
} // namespace blink
|
