File: SelectorQuery.h

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (148 lines) | stat: -rw-r--r-- 5,357 bytes parent folder | download
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
/*
 * Copyright (C) 2011, 2013 Apple Inc. All rights reserved.
 * Copyright (C) 2014 Samsung Electronics. All rights reserved.
 *
 * 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.
 */

#ifndef SelectorQuery_h
#define SelectorQuery_h

#include "core/css/CSSSelectorList.h"
#include "platform/heap/Handle.h"
#include "wtf/HashMap.h"
#include "wtf/Vector.h"
#include "wtf/text/AtomicStringHash.h"
#include <memory>

namespace blink {

class CSSSelector;
class ContainerNode;
class Document;
class Element;
class ExceptionState;
template <typename NodeType>
class StaticNodeTypeList;
using StaticElementList = StaticNodeTypeList<Element>;

class SelectorDataList {
  DISALLOW_NEW();

 public:
  void initialize(const CSSSelectorList&);
  bool matches(Element&) const;
  Element* closest(Element&) const;
  StaticElementList* queryAll(ContainerNode& rootNode) const;
  Element* queryFirst(ContainerNode& rootNode) const;

 private:
  bool canUseFastQuery(const ContainerNode& rootNode) const;
  bool selectorMatches(const CSSSelector&,
                       Element&,
                       const ContainerNode&) const;

  template <typename SelectorQueryTrait>
  void collectElementsByClassName(
      ContainerNode& rootNode,
      const AtomicString& className,
      typename SelectorQueryTrait::OutputType&) const;
  template <typename SelectorQueryTrait>
  void collectElementsByTagName(ContainerNode& rootNode,
                                const QualifiedName& tagName,
                                typename SelectorQueryTrait::OutputType&) const;

  template <typename SelectorQueryTrait>
  void findTraverseRootsAndExecute(
      ContainerNode& rootNode,
      typename SelectorQueryTrait::OutputType&) const;

  enum MatchTraverseRootState {
    DoesNotMatchTraverseRoots,
    MatchesTraverseRoots
  };
  template <typename SelectorQueryTrait>
  void executeForTraverseRoot(const CSSSelector&,
                              ContainerNode* traverseRoot,
                              MatchTraverseRootState,
                              ContainerNode& rootNode,
                              typename SelectorQueryTrait::OutputType&) const;
  template <typename SelectorQueryTrait, typename SimpleElementListType>
  void executeForTraverseRoots(const CSSSelector&,
                               SimpleElementListType& traverseRoots,
                               MatchTraverseRootState,
                               ContainerNode& rootNode,
                               typename SelectorQueryTrait::OutputType&) const;

  template <typename SelectorQueryTrait>
  bool selectorListMatches(ContainerNode& rootNode,
                           Element&,
                           typename SelectorQueryTrait::OutputType&) const;
  template <typename SelectorQueryTrait>
  void executeSlow(ContainerNode& rootNode,
                   typename SelectorQueryTrait::OutputType&) const;
  template <typename SelectorQueryTrait>
  void executeSlowTraversingShadowTree(
      ContainerNode& rootNode,
      typename SelectorQueryTrait::OutputType&) const;
  template <typename SelectorQueryTrait>
  void execute(ContainerNode& rootNode,
               typename SelectorQueryTrait::OutputType&) const;

  Vector<const CSSSelector*> m_selectors;
  bool m_usesDeepCombinatorOrShadowPseudo : 1;
  bool m_needsUpdatedDistribution : 1;
};

class CORE_EXPORT SelectorQuery {
  WTF_MAKE_NONCOPYABLE(SelectorQuery);
  USING_FAST_MALLOC(SelectorQuery);

 public:
  static std::unique_ptr<SelectorQuery> adopt(CSSSelectorList);

  bool matches(Element&) const;
  Element* closest(Element&) const;
  StaticElementList* queryAll(ContainerNode& rootNode) const;
  Element* queryFirst(ContainerNode& rootNode) const;

 private:
  explicit SelectorQuery(CSSSelectorList);

  SelectorDataList m_selectors;
  CSSSelectorList m_selectorList;
};

class SelectorQueryCache {
  USING_FAST_MALLOC(SelectorQueryCache);

 public:
  SelectorQuery* add(const AtomicString&, const Document&, ExceptionState&);
  void invalidate();

 private:
  HashMap<AtomicString, std::unique_ptr<SelectorQuery>> m_entries;
};

}  // namespace blink

#endif