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
|
/*
* Copyright (C) 2011 Google 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
* OWNER 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 ShadowRoot_h
#define ShadowRoot_h
#include "core/dom/ContainerNode.h"
#include "core/dom/DocumentFragment.h"
#include "core/dom/Element.h"
#include "core/dom/TreeScope.h"
#include "wtf/DoublyLinkedList.h"
namespace blink {
class Document;
class ElementShadow;
class ExceptionState;
class HTMLShadowElement;
class InsertionPoint;
class ShadowRootRareData;
class StyleSheetList;
class ShadowRoot final : public DocumentFragment, public TreeScope, public DoublyLinkedListNode<ShadowRoot> {
DEFINE_WRAPPERTYPEINFO();
WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(ShadowRoot);
friend class WTF::DoublyLinkedListNode<ShadowRoot>;
public:
// FIXME: We will support multiple shadow subtrees, however current implementation does not work well
// if a shadow root is dynamically created. So we prohibit multiple shadow subtrees
// in several elements for a while.
// See https://bugs.webkit.org/show_bug.cgi?id=77503 and related bugs.
enum ShadowRootType {
UserAgentShadowRoot = 0,
AuthorShadowRoot
};
static PassRefPtrWillBeRawPtr<ShadowRoot> create(Document& document, ShadowRootType type)
{
return adoptRefWillBeNoop(new ShadowRoot(document, type));
}
void recalcStyle(StyleRecalcChange);
// Disambiguate between Node and TreeScope hierarchies; TreeScope's implementation is simpler.
using TreeScope::document;
using TreeScope::getElementById;
Element* host() const { return toElement(parentOrShadowHostNode()); }
ElementShadow* owner() const { return host() ? host()->shadow() : 0; }
ShadowRoot* youngerShadowRoot() const { return prev(); }
ShadowRoot* olderShadowRootForBindings() const;
bool shouldExposeToBindings() const { return type() == AuthorShadowRoot; }
bool isYoungest() const { return !youngerShadowRoot(); }
bool isOldest() const { return !olderShadowRoot(); }
bool isOldestAuthorShadowRoot() const;
virtual void attach(const AttachContext& = AttachContext()) override;
virtual InsertionNotificationRequest insertedInto(ContainerNode*) override;
virtual void removedFrom(ContainerNode*) override;
void registerScopedHTMLStyleChild();
void unregisterScopedHTMLStyleChild();
bool containsShadowElements() const;
bool containsContentElements() const;
bool containsInsertionPoints() const { return containsShadowElements() || containsContentElements(); }
bool containsShadowRoots() const;
unsigned descendantShadowElementCount() const;
// For Internals, don't use this.
unsigned childShadowRootCount() const;
unsigned numberOfStyles() const { return m_numberOfStyles; }
HTMLShadowElement* shadowInsertionPointOfYoungerShadowRoot() const;
void setShadowInsertionPointOfYoungerShadowRoot(PassRefPtrWillBeRawPtr<HTMLShadowElement>);
void didAddInsertionPoint(InsertionPoint*);
void didRemoveInsertionPoint(InsertionPoint*);
const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& descendantInsertionPoints();
ShadowRootType type() const { return static_cast<ShadowRootType>(m_type); }
// Make protected methods from base class public here.
using TreeScope::setDocument;
using TreeScope::setParentTreeScope;
public:
Element* activeElement() const;
ShadowRoot* olderShadowRoot() const { return next(); }
String innerHTML() const;
void setInnerHTML(const String&, ExceptionState&);
PassRefPtrWillBeRawPtr<Node> cloneNode(bool, ExceptionState&);
PassRefPtrWillBeRawPtr<Node> cloneNode(ExceptionState& exceptionState) { return cloneNode(true, exceptionState); }
StyleSheetList* styleSheets();
virtual void trace(Visitor*) override;
private:
ShadowRoot(Document&, ShadowRootType);
virtual ~ShadowRoot();
#if !ENABLE(OILPAN)
virtual void dispose() override;
#endif
virtual void childrenChanged(const ChildrenChange&) override;
ShadowRootRareData* ensureShadowRootRareData();
void addChildShadowRoot();
void removeChildShadowRoot();
void invalidateDescendantInsertionPoints();
// ShadowRoots should never be cloned.
virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool) override { return nullptr; }
// FIXME: This shouldn't happen. https://bugs.webkit.org/show_bug.cgi?id=88834
bool isOrphan() const { return !host(); }
RawPtrWillBeMember<ShadowRoot> m_prev;
RawPtrWillBeMember<ShadowRoot> m_next;
OwnPtrWillBeMember<ShadowRootRareData> m_shadowRootRareData;
unsigned m_numberOfStyles : 27;
unsigned m_type : 1;
unsigned m_registeredWithParentShadowRoot : 1;
unsigned m_descendantInsertionPointsIsValid : 1;
};
inline Element* ShadowRoot::activeElement() const
{
return adjustedFocusedElement();
}
DEFINE_NODE_TYPE_CASTS(ShadowRoot, isShadowRoot());
DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShadowRoot(), treeScope.rootNode().isShadowRoot());
DEFINE_TYPE_CASTS(TreeScope, ShadowRoot, shadowRoot, true, true);
} // namespace blink
#endif // ShadowRoot_h
|
