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
|
/*
* Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
* Copyright (C) 2006, 2009 Apple Inc.
*
* 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 THE AUTHOR ``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 AUTHOR 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 XPathStep_h
#define XPathStep_h
#include "core/xml/XPathExpressionNode.h"
#include "core/xml/XPathNodeSet.h"
namespace blink {
class Node;
namespace XPath {
class Predicate;
class Step final : public ParseNode {
WTF_MAKE_NONCOPYABLE(Step);
WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED;
public:
enum Axis {
AncestorAxis, AncestorOrSelfAxis, AttributeAxis,
ChildAxis, DescendantAxis, DescendantOrSelfAxis,
FollowingAxis, FollowingSiblingAxis, NamespaceAxis,
ParentAxis, PrecedingAxis, PrecedingSiblingAxis,
SelfAxis
};
class NodeTest : public NoBaseWillBeGarbageCollectedFinalized<NodeTest> {
WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED;
public:
enum Kind {
TextNodeTest, CommentNodeTest, ProcessingInstructionNodeTest, AnyNodeTest, NameTest
};
NodeTest(Kind kind) : m_kind(kind) { }
NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) { }
NodeTest(Kind kind, const AtomicString& data, const AtomicString& namespaceURI) : m_kind(kind), m_data(data), m_namespaceURI(namespaceURI) { }
NodeTest(const NodeTest& o)
: m_kind(o.m_kind)
, m_data(o.m_data)
, m_namespaceURI(o.m_namespaceURI)
{
ASSERT(o.m_mergedPredicates.isEmpty());
}
NodeTest& operator=(const NodeTest& o)
{
m_kind = o.m_kind;
m_data = o.m_data;
m_namespaceURI = o.m_namespaceURI;
ASSERT(o.m_mergedPredicates.isEmpty());
return *this;
}
void trace(Visitor* visitor) { visitor->trace(m_mergedPredicates); }
Kind kind() const { return m_kind; }
const AtomicString& data() const { return m_data; }
const AtomicString& namespaceURI() const { return m_namespaceURI; }
WillBeHeapVector<OwnPtrWillBeMember<Predicate> >& mergedPredicates() { return m_mergedPredicates; }
const WillBeHeapVector<OwnPtrWillBeMember<Predicate> >& mergedPredicates() const { return m_mergedPredicates; }
private:
Kind m_kind;
AtomicString m_data;
AtomicString m_namespaceURI;
// When possible, we merge some or all predicates with node test for better performance.
WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_mergedPredicates;
};
Step(Axis, const NodeTest&);
Step(Axis, const NodeTest&, WillBeHeapVector<OwnPtrWillBeMember<Predicate> >&);
virtual ~Step();
virtual void trace(Visitor*) override;
void optimize();
void evaluate(EvaluationContext&, Node* context, NodeSet&) const;
Axis axis() const { return m_axis; }
const NodeTest& nodeTest() const { return *m_nodeTest; }
private:
friend void optimizeStepPair(Step*, Step*, bool&);
bool predicatesAreContextListInsensitive() const;
NodeTest& nodeTest() { return *m_nodeTest; }
void parseNodeTest(const String&);
void nodesInAxis(EvaluationContext&, Node* context, NodeSet&) const;
String namespaceFromNodetest(const String& nodeTest) const;
Axis m_axis;
OwnPtrWillBeMember<NodeTest> m_nodeTest;
WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_predicates;
};
void optimizeStepPair(Step*, Step*, bool& dropSecondStep);
} // namespace XPath
} // namespace blink
#endif // XPathStep_h
|
