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
|
/*
* Copyright (C) 2010 Google, Inc. All Rights Reserved.
* Copyright (C) 2011 Apple Inc. 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 GOOGLE INC. ``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 GOOGLE INC. OR
* 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 HTMLElementStack_h
#define HTMLElementStack_h
#include "HTMLStackItem.h"
#include <wtf/Forward.h>
#include <wtf/Noncopyable.h>
#include <wtf/OwnPtr.h>
#include <wtf/PassOwnPtr.h>
#include <wtf/RefPtr.h>
namespace WebCore {
class ContainerNode;
class DocumentFragment;
class Element;
class QualifiedName;
// NOTE: The HTML5 spec uses a backwards (grows downward) stack. We're using
// more standard (grows upwards) stack terminology here.
class HTMLElementStack {
WTF_MAKE_NONCOPYABLE(HTMLElementStack); WTF_MAKE_FAST_ALLOCATED;
public:
HTMLElementStack();
~HTMLElementStack();
class ElementRecord {
WTF_MAKE_NONCOPYABLE(ElementRecord); WTF_MAKE_FAST_ALLOCATED;
public:
~ElementRecord(); // Public for ~PassOwnPtr()
Element* element() const { return m_item->element(); }
ContainerNode* node() const { return m_item->node(); }
const AtomicString& namespaceURI() const { return m_item->namespaceURI(); }
PassRefPtr<HTMLStackItem> stackItem() const { return m_item; }
void replaceElement(PassRefPtr<HTMLStackItem>);
bool isAbove(ElementRecord*) const;
ElementRecord* next() const { return m_next.get(); }
private:
friend class HTMLElementStack;
ElementRecord(PassRefPtr<HTMLStackItem>, PassOwnPtr<ElementRecord>);
PassOwnPtr<ElementRecord> releaseNext() { return m_next.release(); }
void setNext(PassOwnPtr<ElementRecord> next) { m_next = next; }
RefPtr<HTMLStackItem> m_item;
OwnPtr<ElementRecord> m_next;
};
unsigned stackDepth() const { return m_stackDepth; }
// Inlining this function is a (small) performance win on the parsing
// benchmark.
Element* top() const
{
ASSERT(m_top->element());
return m_top->element();
}
ContainerNode* topNode() const
{
ASSERT(m_top->node());
return m_top->node();
}
HTMLStackItem* topStackItem() const
{
ASSERT(m_top->stackItem());
return m_top->stackItem().get();
}
HTMLStackItem* oneBelowTop() const;
ElementRecord* topRecord() const;
ElementRecord* find(Element*) const;
ElementRecord* furthestBlockForFormattingElement(Element*) const;
ElementRecord* topmost(const AtomicString& tagName) const;
void insertAbove(PassRefPtr<HTMLStackItem>, ElementRecord*);
void push(PassRefPtr<HTMLStackItem>);
void pushRootNode(PassRefPtr<HTMLStackItem>);
void pushHTMLHtmlElement(PassRefPtr<HTMLStackItem>);
void pushHTMLHeadElement(PassRefPtr<HTMLStackItem>);
void pushHTMLBodyElement(PassRefPtr<HTMLStackItem>);
void pop();
void popUntil(const AtomicString& tagName);
void popUntil(Element*);
void popUntilPopped(const AtomicString& tagName);
void popUntilPopped(const QualifiedName& tagName) { popUntilPopped(tagName.localName()); }
void popUntilPopped(Element*);
void popUntilNumberedHeaderElementPopped();
void popUntilTableScopeMarker(); // "clear the stack back to a table context" in the spec.
void popUntilTableBodyScopeMarker(); // "clear the stack back to a table body context" in the spec.
void popUntilTableRowScopeMarker(); // "clear the stack back to a table row context" in the spec.
void popUntilForeignContentScopeMarker();
void popHTMLHeadElement();
void popHTMLBodyElement();
void popAll();
static bool isMathMLTextIntegrationPoint(HTMLStackItem*);
static bool isHTMLIntegrationPoint(HTMLStackItem*);
void remove(Element*);
void removeHTMLHeadElement(Element*);
bool contains(Element*) const;
bool contains(const AtomicString& tagName) const;
bool inScope(Element*) const;
bool inScope(const AtomicString& tagName) const;
bool inScope(const QualifiedName&) const;
bool inListItemScope(const AtomicString& tagName) const;
bool inListItemScope(const QualifiedName&) const;
bool inTableScope(const AtomicString& tagName) const;
bool inTableScope(const QualifiedName&) const;
bool inButtonScope(const AtomicString& tagName) const;
bool inButtonScope(const QualifiedName&) const;
bool inSelectScope(const AtomicString& tagName) const;
bool inSelectScope(const QualifiedName&) const;
bool hasNumberedHeaderElementInScope() const;
bool hasOnlyOneElement() const;
bool secondElementIsHTMLBodyElement() const;
#if ENABLE(TEMPLATE_ELEMENT)
bool hasTemplateInHTMLScope() const;
#endif
Element* htmlElement() const;
Element* headElement() const;
Element* bodyElement() const;
ContainerNode* rootNode() const;
#ifndef NDEBUG
void show();
#endif
private:
void pushCommon(PassRefPtr<HTMLStackItem>);
void pushRootNodeCommon(PassRefPtr<HTMLStackItem>);
void popCommon();
void removeNonTopCommon(Element*);
OwnPtr<ElementRecord> m_top;
// We remember the root node, <head> and <body> as they are pushed. Their
// ElementRecords keep them alive. The root node is never popped.
// FIXME: We don't currently require type-specific information about
// these elements so we haven't yet bothered to plumb the types all the
// way down through createElement, etc.
ContainerNode* m_rootNode;
Element* m_headElement;
Element* m_bodyElement;
unsigned m_stackDepth;
};
} // namespace WebCore
#endif // HTMLElementStack_h
|
