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 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624
|
/*
* Copyright (C) 2011-2020 Apple Inc. All rights reserved.
* Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS 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 APPLE OR ITS 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 "SelectorQuery.h"
#include "CSSSelectorParser.h"
#include "CSSTokenizer.h"
#include "CommonAtomStrings.h"
#include "ElementAncestorIteratorInlines.h"
#include "HTMLNames.h"
#include "SelectorChecker.h"
#include "StaticNodeList.h"
#include "StyledElement.h"
#include "TypedElementDescendantIteratorInlines.h"
namespace WebCore {
#if ASSERT_ENABLED
static bool isSingleTagNameSelector(const CSSSelector& selector)
{
return selector.isLastInTagHistory() && selector.match() == CSSSelector::Match::Tag;
}
static bool isSingleClassNameSelector(const CSSSelector& selector)
{
return selector.isLastInTagHistory() && selector.match() == CSSSelector::Match::Class;
}
#endif // ASSERT_ENABLED
enum class IdMatchingType : uint8_t {
None,
Rightmost,
Filter
};
template<typename Output> static ALWAYS_INLINE void appendOutputForElement(Output& output, Element& element)
{
if constexpr (std::is_same_v<Output, Element*>) {
ASSERT(!output);
output = &element;
} else
output.append(element);
}
static bool canBeUsedForIdFastPath(const CSSSelector& selector)
{
return selector.match() == CSSSelector::Match::Id
|| (selector.match() == CSSSelector::Match::Exact && selector.attribute() == HTMLNames::idAttr && !selector.attributeValueMatchingIsCaseInsensitive());
}
static IdMatchingType findIdMatchingType(const CSSSelector& firstSelector)
{
bool inRightmost = true;
for (const CSSSelector* selector = &firstSelector; selector; selector = selector->tagHistory()) {
if (canBeUsedForIdFastPath(*selector)) {
if (inRightmost)
return IdMatchingType::Rightmost;
return IdMatchingType::Filter;
}
if (selector->relation() != CSSSelector::RelationType::Subselector)
inRightmost = false;
}
return IdMatchingType::None;
}
SelectorDataList::SelectorDataList(const CSSSelectorList& selectorList)
{
unsigned selectorCount = 0;
for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
selectorCount++;
m_selectors.reserveInitialCapacity(selectorCount);
for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
m_selectors.uncheckedAppend({ selector });
if (selectorCount == 1) {
const CSSSelector& selector = *m_selectors.first().selector;
if (selector.isLastInTagHistory()) {
switch (selector.match()) {
case CSSSelector::Match::Tag:
m_matchType = TagNameMatch;
break;
case CSSSelector::Match::Class:
m_matchType = ClassNameMatch;
break;
default:
if (canBeUsedForIdFastPath(selector))
m_matchType = RightMostWithIdMatch;
else
m_matchType = CompilableSingle;
break;
}
} else {
switch (findIdMatchingType(selector)) {
case IdMatchingType::None:
m_matchType = CompilableSingle;
break;
case IdMatchingType::Rightmost:
m_matchType = RightMostWithIdMatch;
break;
case IdMatchingType::Filter:
m_matchType = CompilableSingleWithRootFilter;
break;
}
}
} else
m_matchType = CompilableMultipleSelectorMatch;
}
inline bool SelectorDataList::selectorMatches(const SelectorData& selectorData, Element& element, const ContainerNode& rootNode) const
{
SelectorChecker selectorChecker(element.document());
SelectorChecker::CheckingContext selectorCheckingContext(SelectorChecker::Mode::QueryingRules);
selectorCheckingContext.scope = rootNode.isDocumentNode() ? nullptr : &rootNode;
return selectorChecker.match(*selectorData.selector, element, selectorCheckingContext);
}
inline Element* SelectorDataList::selectorClosest(const SelectorData& selectorData, Element& element, const ContainerNode& rootNode) const
{
SelectorChecker selectorChecker(element.document());
SelectorChecker::CheckingContext selectorCheckingContext(SelectorChecker::Mode::QueryingRules);
selectorCheckingContext.scope = rootNode.isDocumentNode() ? nullptr : &rootNode;
if (!selectorChecker.match(*selectorData.selector, element, selectorCheckingContext))
return nullptr;
return &element;
}
bool SelectorDataList::matches(Element& targetElement) const
{
for (auto& selctor : m_selectors) {
if (selectorMatches(selctor, targetElement, targetElement))
return true;
}
return false;
}
Element* SelectorDataList::closest(Element& targetElement) const
{
for (auto& currentElement : lineageOfType<Element>(targetElement)) {
for (auto& selector : m_selectors) {
if (auto* candidateElement = selectorClosest(selector, currentElement, targetElement))
return candidateElement;
}
}
return nullptr;
}
Ref<NodeList> SelectorDataList::queryAll(ContainerNode& rootNode) const
{
Vector<Ref<Element>> result;
execute(rootNode, result);
return StaticElementList::create(WTFMove(result));
}
Element* SelectorDataList::queryFirst(ContainerNode& rootNode) const
{
Element* result = nullptr;
execute(rootNode, result);
return result;
}
static const CSSSelector* selectorForIdLookup(const ContainerNode& rootNode, const CSSSelector& firstSelector)
{
if (!rootNode.isConnected())
return nullptr;
if (rootNode.document().inQuirksMode())
return nullptr;
for (const CSSSelector* selector = &firstSelector; selector; selector = selector->tagHistory()) {
if (canBeUsedForIdFastPath(*selector))
return selector;
if (selector->relation() != CSSSelector::RelationType::Subselector)
break;
}
return nullptr;
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeFastPathForIdSelector(const ContainerNode& rootNode, const SelectorData& selectorData, const CSSSelector* idSelector, OutputType& output) const
{
ASSERT(m_selectors.size() == 1);
ASSERT(idSelector);
const AtomString& idToMatch = idSelector->value();
if (UNLIKELY(rootNode.treeScope().containsMultipleElementsWithId(idToMatch))) {
const Vector<Element*>* elements = rootNode.treeScope().getAllElementsById(idToMatch);
ASSERT(elements);
bool rootNodeIsTreeScopeRoot = rootNode.isTreeScope();
for (auto& element : *elements) {
if ((rootNodeIsTreeScopeRoot || element->isDescendantOf(rootNode)) && selectorMatches(selectorData, *element, rootNode)) {
appendOutputForElement(output, *element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
return;
}
Element* element = rootNode.treeScope().getElementById(idToMatch);
if (!element || !(rootNode.isTreeScope() || element->isDescendantOf(rootNode)))
return;
if (selectorMatches(selectorData, *element, rootNode))
appendOutputForElement(output, *element);
}
static ContainerNode& filterRootById(ContainerNode& rootNode, const CSSSelector& firstSelector)
{
if (!rootNode.isConnected())
return rootNode;
if (rootNode.document().inQuirksMode())
return rootNode;
// If there was an Id match in the rightmost Simple Selector, we should be in a RightMostWithIdMatch, not in filter.
// Thus we can skip the rightmost match.
const CSSSelector* selector = &firstSelector;
do {
ASSERT(!canBeUsedForIdFastPath(*selector));
if (selector->relation() != CSSSelector::RelationType::Subselector)
break;
selector = selector->tagHistory();
} while (selector);
bool inAdjacentChain = false;
for (; selector; selector = selector->tagHistory()) {
if (canBeUsedForIdFastPath(*selector)) {
const AtomString& idToMatch = selector->value();
if (ContainerNode* searchRoot = rootNode.treeScope().getElementById(idToMatch)) {
if (LIKELY(!rootNode.treeScope().containsMultipleElementsWithId(idToMatch))) {
if (inAdjacentChain)
searchRoot = searchRoot->parentNode();
if (searchRoot && (rootNode.isTreeScope() || searchRoot == &rootNode || searchRoot->isDescendantOf(rootNode)))
return *searchRoot;
}
}
}
if (selector->relation() == CSSSelector::RelationType::Subselector)
continue;
inAdjacentChain = selector->relation() == CSSSelector::RelationType::DirectAdjacent || selector->relation() == CSSSelector::RelationType::IndirectAdjacent;
}
return rootNode;
}
static ALWAYS_INLINE bool localNameMatches(const Element& element, const AtomString& localName, const AtomString& lowercaseLocalName)
{
if (element.isHTMLElement() && element.document().isHTMLDocument())
return element.localName() == lowercaseLocalName;
return element.localName() == localName;
}
template<typename OutputType>
static inline void elementsForLocalName(const ContainerNode& rootNode, const AtomString& localName, const AtomString& lowercaseLocalName, OutputType& output)
{
if (localName == lowercaseLocalName) {
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
if (element.tagQName().localName() == localName) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
} else {
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
if (localNameMatches(element, localName, lowercaseLocalName)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
}
template<typename OutputType>
static inline void anyElement(const ContainerNode& rootNode, OutputType& output)
{
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeSingleTagNameSelectorData(const ContainerNode& rootNode, const SelectorData& selectorData, OutputType& output) const
{
ASSERT(m_selectors.size() == 1);
ASSERT(isSingleTagNameSelector(*selectorData.selector));
const QualifiedName& tagQualifiedName = selectorData.selector->tagQName();
const AtomString& selectorLocalName = tagQualifiedName.localName();
const AtomString& selectorLowercaseLocalName = selectorData.selector->tagLowercaseLocalName();
const AtomString& selectorNamespaceURI = tagQualifiedName.namespaceURI();
if (selectorNamespaceURI == starAtom()) {
if (selectorLocalName != starAtom()) {
// Common case: name defined, selectorNamespaceURI is a wildcard.
elementsForLocalName(rootNode, selectorLocalName, selectorLowercaseLocalName, output);
} else {
// Other fairly common case: both are wildcards.
anyElement(rootNode, output);
}
} else {
// Fallback: NamespaceURI is set, selectorLocalName may be starAtom().
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
if (element.namespaceURI() == selectorNamespaceURI && localNameMatches(element, selectorLocalName, selectorLowercaseLocalName)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeSingleClassNameSelectorData(const ContainerNode& rootNode, const SelectorData& selectorData, OutputType& output) const
{
ASSERT(m_selectors.size() == 1);
ASSERT(isSingleClassNameSelector(*selectorData.selector));
const AtomString& className = selectorData.selector->value();
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
if (element.hasClass() && element.classNames().contains(className)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeSingleSelectorData(const ContainerNode& rootNode, const ContainerNode& searchRootNode, const SelectorData& selectorData, OutputType& output) const
{
ASSERT(m_selectors.size() == 1);
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(searchRootNode))) {
if (selectorMatches(selectorData, element, rootNode)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeSingleMultiSelectorData(const ContainerNode& rootNode, OutputType& output) const
{
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
for (auto& selector : m_selectors) {
if (selectorMatches(selector, element, rootNode)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
break;
}
}
}
}
#if ENABLE(CSS_SELECTOR_JIT)
template<typename Checker, typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeCompiledSimpleSelectorChecker(const ContainerNode& searchRootNode, Checker selectorChecker, OutputType& output, const SelectorData& selectorData) const
{
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(searchRootNode))) {
selectorData.compiledSelector.wasUsed();
if (selectorChecker(&element)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
template<typename Checker, typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeCompiledSelectorCheckerWithCheckingContext(const ContainerNode& rootNode, const ContainerNode& searchRootNode, Checker selectorChecker, OutputType& output, const SelectorData& selectorData) const
{
SelectorChecker::CheckingContext checkingContext(SelectorChecker::Mode::QueryingRules);
checkingContext.scope = rootNode.isDocumentNode() ? nullptr : &rootNode;
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(searchRootNode))) {
selectorData.compiledSelector.wasUsed();
if (selectorChecker(&element, &checkingContext)) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
}
}
}
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::executeCompiledSingleMultiSelectorData(const ContainerNode& rootNode, OutputType& output) const
{
SelectorChecker::CheckingContext checkingContext(SelectorChecker::Mode::QueryingRules);
checkingContext.scope = rootNode.isDocumentNode() ? nullptr : &rootNode;
for (auto& element : descendantsOfType<Element>(const_cast<ContainerNode&>(rootNode))) {
for (auto& selector : m_selectors) {
selector.compiledSelector.wasUsed();
bool matched = false;
if (selector.compiledSelector.status == SelectorCompilationStatus::SimpleSelectorChecker)
matched = SelectorCompiler::querySelectorSimpleSelectorChecker(selector.compiledSelector, &element);
else {
ASSERT(selector.compiledSelector.status == SelectorCompilationStatus::SelectorCheckerWithCheckingContext);
matched = SelectorCompiler::querySelectorSelectorCheckerWithCheckingContext(selector.compiledSelector, &element, &checkingContext);
}
if (matched) {
appendOutputForElement(output, element);
if constexpr (std::is_same_v<OutputType, Element*>)
return;
break;
}
}
}
}
bool SelectorDataList::compileSelector(const SelectorData& selectorData)
{
auto& compiledSelector = selectorData.compiledSelector;
if (compiledSelector.status == SelectorCompilationStatus::NotCompiled)
SelectorCompiler::compileSelector(compiledSelector, selectorData.selector, SelectorCompiler::SelectorContext::QuerySelector);
return compiledSelector.status != SelectorCompilationStatus::CannotCompile;
}
#endif // ENABLE(CSS_SELECTOR_JIT)
template<typename OutputType>
ALWAYS_INLINE void SelectorDataList::execute(ContainerNode& rootNode, OutputType& output) const
{
ContainerNode* searchRootNode = &rootNode;
switch (m_matchType) {
case RightMostWithIdMatch:
{
const SelectorData& selectorData = m_selectors.first();
if (const CSSSelector* idSelector = selectorForIdLookup(*searchRootNode, *selectorData.selector)) {
executeFastPathForIdSelector(*searchRootNode, m_selectors.first(), idSelector, output);
break;
}
#if ENABLE(CSS_SELECTOR_JIT)
if (compileSelector(selectorData))
goto CompiledSingleCase;
#endif // ENABLE(CSS_SELECTOR_JIT)
goto SingleSelectorCase;
ASSERT_NOT_REACHED();
}
case CompilableSingleWithRootFilter:
case CompilableSingle:
{
#if ENABLE(CSS_SELECTOR_JIT)
const SelectorData& selectorData = m_selectors.first();
ASSERT(selectorData.compiledSelector.status == SelectorCompilationStatus::NotCompiled);
ASSERT(m_matchType == CompilableSingle || m_matchType == CompilableSingleWithRootFilter);
if (compileSelector(selectorData)) {
if (m_matchType == CompilableSingle) {
m_matchType = CompiledSingle;
goto CompiledSingleCase;
}
ASSERT(m_matchType == CompilableSingleWithRootFilter);
m_matchType = CompiledSingleWithRootFilter;
goto CompiledSingleWithRootFilterCase;
}
#endif // ENABLE(CSS_SELECTOR_JIT)
if (m_matchType == CompilableSingle) {
m_matchType = SingleSelector;
goto SingleSelectorCase;
}
ASSERT(m_matchType == CompilableSingleWithRootFilter);
m_matchType = SingleSelectorWithRootFilter;
goto SingleSelectorWithRootFilterCase;
ASSERT_NOT_REACHED();
}
#if ENABLE(CSS_SELECTOR_JIT)
case CompiledSingleWithRootFilter:
CompiledSingleWithRootFilterCase:
searchRootNode = &filterRootById(*searchRootNode, *m_selectors.first().selector);
FALLTHROUGH;
case CompiledSingle:
{
CompiledSingleCase:
const SelectorData& selectorData = m_selectors.first();
if (selectorData.compiledSelector.status == SelectorCompilationStatus::SimpleSelectorChecker) {
executeCompiledSimpleSelectorChecker(*searchRootNode, [&] (const Element* element) {
return SelectorCompiler::querySelectorSimpleSelectorChecker(selectorData.compiledSelector, element);
}, output, selectorData);
} else {
ASSERT(selectorData.compiledSelector.status == SelectorCompilationStatus::SelectorCheckerWithCheckingContext);
executeCompiledSelectorCheckerWithCheckingContext(rootNode, *searchRootNode, [&] (const Element* element, const SelectorChecker::CheckingContext* context) {
return SelectorCompiler::querySelectorSelectorCheckerWithCheckingContext(selectorData.compiledSelector, element, context);
}, output, selectorData);
}
break;
}
#else
case CompiledSingleWithRootFilter:
case CompiledSingle:
ASSERT_NOT_REACHED();
#if !ASSERT_ENABLED
FALLTHROUGH;
#endif
#endif // ENABLE(CSS_SELECTOR_JIT)
case SingleSelectorWithRootFilter:
SingleSelectorWithRootFilterCase:
searchRootNode = &filterRootById(*searchRootNode, *m_selectors.first().selector);
FALLTHROUGH;
case SingleSelector:
SingleSelectorCase:
executeSingleSelectorData(rootNode, *searchRootNode, m_selectors.first(), output);
break;
case TagNameMatch:
executeSingleTagNameSelectorData(*searchRootNode, m_selectors.first(), output);
break;
case ClassNameMatch:
executeSingleClassNameSelectorData(*searchRootNode, m_selectors.first(), output);
break;
case CompilableMultipleSelectorMatch:
#if ENABLE(CSS_SELECTOR_JIT)
{
for (auto& selector : m_selectors) {
if (!compileSelector(selector)) {
m_matchType = MultipleSelectorMatch;
goto MultipleSelectorMatch;
}
}
m_matchType = CompiledMultipleSelectorMatch;
goto CompiledMultipleSelectorMatch;
}
#else
FALLTHROUGH;
#endif // ENABLE(CSS_SELECTOR_JIT)
case CompiledMultipleSelectorMatch:
#if ENABLE(CSS_SELECTOR_JIT)
CompiledMultipleSelectorMatch:
executeCompiledSingleMultiSelectorData(*searchRootNode, output);
break;
#else
FALLTHROUGH;
#endif // ENABLE(CSS_SELECTOR_JIT)
case MultipleSelectorMatch:
#if ENABLE(CSS_SELECTOR_JIT)
MultipleSelectorMatch:
#endif
executeSingleMultiSelectorData(*searchRootNode, output);
break;
}
}
SelectorQuery::SelectorQuery(CSSSelectorList&& selectorList)
: m_selectorList(WTFMove(selectorList))
, m_selectors(m_selectorList)
{
}
SelectorQueryCache& SelectorQueryCache::singleton()
{
static NeverDestroyed<SelectorQueryCache> cache;
return cache.get();
}
SelectorQuery* SelectorQueryCache::add(const String& selectors, const Document& document)
{
ASSERT(!selectors.isEmpty());
constexpr auto maximumSelectorQueryCacheSize = 512;
if (m_entries.size() == maximumSelectorQueryCacheSize)
m_entries.remove(m_entries.random());
auto context = CSSSelectorParserContext { document };
auto key = Key { selectors, context, document.securityOrigin().data() };
return m_entries.ensure(key, [&]() -> std::unique_ptr<SelectorQuery> {
auto tokenizer = CSSTokenizer { selectors };
auto selectorList = parseCSSSelector(tokenizer.tokenRange(), context, nullptr, CSSParserEnum::IsNestedContext::No);
if (!selectorList || selectorList->hasInvalidSelector())
return nullptr;
if (selectorList->selectorsNeedNamespaceResolution())
return nullptr;
if (selectorList->hasExplicitNestingParent())
selectorList = CSSSelectorParser::resolveNestingParent(WTFMove(*selectorList), nullptr);
return makeUnique<SelectorQuery>(WTFMove(*selectorList));
}).iterator->value.get();
}
void SelectorQueryCache::clear()
{
m_entries.clear();
}
}
|