1/*
2 * Copyright 2005 Maksim Orlovich <maksim@kde.org>
3 * Copyright (C) 2006 Apple Computer, Inc.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 *    notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27#ifndef XPathParser_h
28#define XPathParser_h
29
30#include "core/xml/XPathPredicate.h"
31#include "core/xml/XPathStep.h"
32
33namespace blink {
34
35class ExceptionState;
36class XPathNSResolver;
37
38namespace XPath {
39
40class Expression;
41class LocationPath;
42class ParseNode;
43class Parser;
44class Predicate;
45
46struct Token {
47    int type;
48    String str;
49    Step::Axis axis;
50    NumericOp::Opcode numop;
51    EqTestOp::Opcode eqop;
52
53    Token(int t) : type(t) { }
54    Token(int t, const String& v): type(t), str(v) { }
55    Token(int t, Step::Axis v): type(t), axis(v) { }
56    Token(int t, NumericOp::Opcode v): type(t), numop(v) { }
57    Token(int t, EqTestOp::Opcode v): type(t), eqop(v) { }
58};
59
60class Parser {
61    WTF_MAKE_NONCOPYABLE(Parser);
62    STACK_ALLOCATED();
63public:
64    Parser();
65    ~Parser();
66
67    XPathNSResolver* resolver() const { return m_resolver.get(); }
68    bool expandQName(const String& qName, AtomicString& localName, AtomicString& namespaceURI);
69
70    PassOwnPtrWillBeRawPtr<Expression> parseStatement(const String& statement, PassRefPtrWillBeRawPtr<XPathNSResolver>, ExceptionState&);
71
72    static Parser* current() { return currentParser; }
73
74    int lex(void* yylval);
75
76    RawPtrWillBeMember<Expression> m_topExpr;
77    bool m_gotNamespaceError;
78
79    void registerParseNode(ParseNode*);
80    void unregisterParseNode(ParseNode*);
81
82    void registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate> >*);
83    void deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate> >*);
84
85    void registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression> >*);
86    void deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression> >*);
87
88    void registerString(String*);
89    void deleteString(String*);
90
91    void registerNodeTest(Step::NodeTest*);
92    void deleteNodeTest(Step::NodeTest*);
93
94private:
95    bool isBinaryOperatorContext() const;
96
97    void skipWS();
98    Token makeTokenAndAdvance(int type, int advance = 1);
99    Token makeTokenAndAdvance(int type, NumericOp::Opcode, int advance = 1);
100    Token makeTokenAndAdvance(int type, EqTestOp::Opcode, int advance = 1);
101    char peekAheadHelper();
102    char peekCurHelper();
103
104    Token lexString();
105    Token lexNumber();
106    bool lexNCName(String&);
107    bool lexQName(String&);
108
109    Token nextToken();
110    Token nextTokenInternal();
111
112    void reset(const String& data);
113
114    static Parser* currentParser;
115
116    unsigned m_nextPos;
117    String m_data;
118    int m_lastTokenType;
119    RefPtrWillBeMember<XPathNSResolver> m_resolver;
120
121#if !ENABLE(OILPAN)
122    HashSet<ParseNode*> m_parseNodes;
123    HashSet<Vector<OwnPtr<Predicate> >*> m_predicateVectors;
124    HashSet<Vector<OwnPtr<Expression> >*> m_expressionVectors;
125    HashSet<OwnPtr<Step::NodeTest> > m_nodeTests;
126#endif
127    HashSet<OwnPtr<String> > m_strings;
128};
129
130} // namespace XPath
131
132} // namespace blink
133
134int xpathyyparse(blink::XPath::Parser*);
135#endif
136