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
|
/*
* Copyright (C) 2014 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.
* * 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.
* * 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 DescendantInvalidationSet_h
#define DescendantInvalidationSet_h
#include "platform/heap/Handle.h"
#include "wtf/Forward.h"
#include "wtf/HashSet.h"
#include "wtf/RefCounted.h"
#include "wtf/RefPtr.h"
#include "wtf/text/AtomicStringHash.h"
#include "wtf/text/StringHash.h"
namespace blink {
class Element;
class TracedValue;
// Tracks data to determine which elements of a DOM subtree need to have style
// recalculated.
class DescendantInvalidationSet final : public RefCountedWillBeGarbageCollected<DescendantInvalidationSet> {
public:
static PassRefPtrWillBeRawPtr<DescendantInvalidationSet> create()
{
return adoptRefWillBeNoop(new DescendantInvalidationSet);
}
static void cacheTracingFlag();
bool invalidatesElement(Element&) const;
void combine(const DescendantInvalidationSet& other);
void addClass(const AtomicString& className);
void addId(const AtomicString& id);
void addTagName(const AtomicString& tagName);
void addAttribute(const AtomicString& attributeLocalName);
void setWholeSubtreeInvalid();
bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; }
void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; }
bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; }
void setInsertionPointCrossing() { m_insertionPointCrossing = true; }
bool insertionPointCrossing() const { return m_insertionPointCrossing; }
void setCustomPseudoInvalid() { m_customPseudoInvalid = true; }
bool customPseudoInvalid() const { return m_customPseudoInvalid; }
bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attributes; }
void trace(Visitor*);
void toTracedValue(TracedValue*) const;
#ifndef NDEBUG
void show() const;
#endif
private:
DescendantInvalidationSet();
WillBeHeapHashSet<AtomicString>& ensureClassSet();
WillBeHeapHashSet<AtomicString>& ensureIdSet();
WillBeHeapHashSet<AtomicString>& ensureTagNameSet();
WillBeHeapHashSet<AtomicString>& ensureAttributeSet();
// FIXME: optimize this if it becomes a memory issue.
OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_classes;
OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_ids;
OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_tagNames;
OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes;
// If true, all descendants might be invalidated, so a full subtree recalc is required.
unsigned m_allDescendantsMightBeInvalid : 1;
// If true, all descendants which are custom pseudo elements must be invalidated.
unsigned m_customPseudoInvalid : 1;
// If true, the invalidation must traverse into ShadowRoots with this set.
unsigned m_treeBoundaryCrossing : 1;
// If true, insertion point descendants must be invalidated.
unsigned m_insertionPointCrossing : 1;
};
} // namespace blink
#endif // DescendantInvalidationSet_h
|
