2 * Copyright (C) 2011 Google Inc. All Rights Reserved.
3 * Copyright (C) 2012 Apple Inc. All Rights Reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
15 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
17 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
18 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include "core/dom/DocumentOrderedMap.h"
31 #include "platform/heap/Handle.h"
32 #include "wtf/Forward.h"
33 #include "wtf/text/AtomicString.h"
41 class HTMLLabelElement;
45 class IdTargetObserverRegistry;
49 // A class which inherits both Node and TreeScope must call clearRareData() in its destructor
50 // so that the Node destructor no longer does problematic NodeList cache manipulation in
52 class TreeScope : public WillBeGarbageCollectedMixin {
54 TreeScope* parentTreeScope() const { return m_parentTreeScope; }
56 TreeScope* olderShadowRootOrParentTreeScope() const;
57 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&) const;
59 Element* adjustedFocusedElement() const;
60 Element* getElementById(const AtomicString&) const;
61 const Vector<Element*>& getAllElementsById(const AtomicString&) const;
62 bool hasElementWithId(StringImpl* id) const;
63 bool containsMultipleElementsWithId(const AtomicString& id) const;
64 void addElementById(const AtomicString& elementId, Element*);
65 void removeElementById(const AtomicString& elementId, Element*);
67 Document& document() const
73 Node* ancestorInThisScope(Node*) const;
75 void addImageMap(HTMLMapElement*);
76 void removeImageMap(HTMLMapElement*);
77 HTMLMapElement* getImageMap(const String& url) const;
79 Element* elementFromPoint(int x, int y) const;
82 bool shouldCacheLabelsByForAttribute() const { return m_labelsByForAttribute; }
83 void addLabel(const AtomicString& forAttributeValue, HTMLLabelElement*);
84 void removeLabel(const AtomicString& forAttributeValue, HTMLLabelElement*);
85 HTMLLabelElement* labelElementForId(const AtomicString& forAttributeValue);
87 DOMSelection* getSelection() const;
89 // Find first anchor with the given name.
90 // First searches for an element with the given ID, but if that fails, then looks
91 // for an anchor with the given name. ID matching is always case sensitive, but
92 // Anchor name matching is case sensitive in strict mode and not case sensitive in
93 // quirks mode for historical compatibility reasons.
94 Element* findAnchor(const String& name);
96 bool applyAuthorStyles() const;
98 // Used by the basic DOM mutation methods (e.g., appendChild()).
99 void adoptIfNeeded(Node&);
101 Node& rootNode() const { return *m_rootNode; }
103 IdTargetObserverRegistry& idTargetObserverRegistry() const { return *m_idTargetObserverRegistry.get(); }
107 // Nodes belonging to this scope hold guard references -
108 // these are enough to keep the scope from being destroyed, but
109 // not enough to keep it from removing its children. This allows a
110 // node that outlives its scope to still have a valid document
111 // pointer without introducing reference cycles.
114 ASSERT(!deletionHasBegun());
120 ASSERT(m_guardRefCount > 0);
121 ASSERT(!deletionHasBegun());
123 if (!m_guardRefCount && !refCount() && !rootNodeHasTreeSharedParent()) {
130 void removedLastRefToScope();
132 bool isInclusiveAncestorOf(const TreeScope&) const;
133 unsigned short comparePosition(const TreeScope&) const;
135 const TreeScope* commonAncestorTreeScope(const TreeScope& other) const;
136 TreeScope* commonAncestorTreeScope(TreeScope& other);
138 Element* getElementByAccessKey(const String& key) const;
140 virtual void trace(Visitor*);
143 TreeScope(ContainerNode&, Document&);
144 TreeScope(Document&);
145 virtual ~TreeScope();
148 void destroyTreeScopeData();
151 void setDocument(Document& document) { m_document = &document; }
152 void setParentTreeScope(TreeScope&);
155 bool hasGuardRefCount() const { return m_guardRefCount; }
158 void setNeedsStyleRecalcForViewportUnits();
161 virtual void dispose() { }
164 int refCount() const;
166 #if SECURITY_ASSERT_ENABLED
167 bool deletionHasBegun();
168 void beginDeletion();
170 bool deletionHasBegun() { return false; }
171 void beginDeletion() { }
175 bool rootNodeHasTreeSharedParent() const;
177 RawPtrWillBeMember<Node> m_rootNode;
178 RawPtrWillBeMember<Document> m_document;
179 RawPtrWillBeMember<TreeScope> m_parentTreeScope;
185 OwnPtr<DocumentOrderedMap> m_elementsById;
186 OwnPtr<DocumentOrderedMap> m_imageMapsByName;
187 OwnPtr<DocumentOrderedMap> m_labelsByForAttribute;
189 OwnPtrWillBeMember<IdTargetObserverRegistry> m_idTargetObserverRegistry;
191 mutable RefPtrWillBeMember<DOMSelection> m_selection;
194 inline bool TreeScope::hasElementWithId(StringImpl* id) const
197 return m_elementsById && m_elementsById->contains(id);
200 inline bool TreeScope::containsMultipleElementsWithId(const AtomicString& id) const
202 return m_elementsById && m_elementsById->containsMultiple(id.impl());
205 inline bool operator==(const TreeScope& a, const TreeScope& b) { return &a == &b; }
206 inline bool operator==(const TreeScope& a, const TreeScope* b) { return &a == b; }
207 inline bool operator==(const TreeScope* a, const TreeScope& b) { return a == &b; }
208 inline bool operator!=(const TreeScope& a, const TreeScope& b) { return !(a == b); }
209 inline bool operator!=(const TreeScope& a, const TreeScope* b) { return !(a == b); }
210 inline bool operator!=(const TreeScope* a, const TreeScope& b) { return !(a == b); }
212 HitTestResult hitTestInDocument(const Document*, int x, int y);
213 TreeScope* commonTreeScope(Node*, Node*);
215 } // namespace WebCore
217 #endif // TreeScope_h