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
|
/*
* Copyright (C) 2012 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 ElementShadow_h
#define ElementShadow_h
#include "ContentDistributor.h"
#include "ExceptionCode.h"
#include "ShadowRoot.h"
#include <wtf/DoublyLinkedList.h>
#include <wtf/Noncopyable.h>
#include <wtf/OwnPtr.h>
#include <wtf/PassRefPtr.h>
#include <wtf/Vector.h>
namespace WebCore {
class Node;
class Element;
class TreeScope;
class ElementShadow {
public:
ElementShadow();
~ElementShadow();
Element* host() const;
ShadowRoot* youngestShadowRoot() const;
ShadowRoot* oldestShadowRoot() const;
void addShadowRoot(Element* shadowHost, PassRefPtr<ShadowRoot>, ExceptionCode&);
void setParentTreeScope(TreeScope*);
void attach();
void detach();
void reattach();
void attachHost(Element*);
void detachHost(Element*);
bool childNeedsStyleRecalc();
bool needsStyleRecalc();
void recalcStyle(Node::StyleChange);
void setNeedsRedistributing();
void clearNeedsRedistributing();
bool needsRedistributing();
void hostChildrenChanged();
InsertionPoint* insertionPointFor(const Node*) const;
ContentDistributor& distributor();
const ContentDistributor& distributor() const;
private:
void removeAllShadowRoots();
void reattachHostChildrenAndShadow();
DoublyLinkedList<ShadowRoot> m_shadowRoots;
ContentDistributor m_distributor;
bool m_needsRedistributing : 1;
WTF_MAKE_NONCOPYABLE(ElementShadow);
};
inline ShadowRoot* ElementShadow::youngestShadowRoot() const
{
return m_shadowRoots.head();
}
inline ShadowRoot* ElementShadow::oldestShadowRoot() const
{
return m_shadowRoots.tail();
}
inline ContentDistributor& ElementShadow::distributor()
{
return m_distributor;
}
inline const ContentDistributor& ElementShadow::distributor() const
{
return m_distributor;
}
inline void ElementShadow::clearNeedsRedistributing()
{
m_needsRedistributing = false;
}
inline Element* ElementShadow::host() const
{
ASSERT(!m_shadowRoots.isEmpty());
return youngestShadowRoot()->host();
}
class ShadowRootVector : public Vector<RefPtr<ShadowRoot> > {
public:
explicit ShadowRootVector(ElementShadow* tree)
{
for (ShadowRoot* root = tree->youngestShadowRoot(); root; root = root->olderShadowRoot())
append(root);
}
};
} // namespace
#endif
|
