2 * Copyright (C) 2014 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef DescendantInvalidationSet_h
32 #define DescendantInvalidationSet_h
34 #include "platform/heap/Handle.h"
35 #include "wtf/Forward.h"
36 #include "wtf/HashSet.h"
37 #include "wtf/RefCounted.h"
38 #include "wtf/RefPtr.h"
39 #include "wtf/text/AtomicStringHash.h"
40 #include "wtf/text/StringHash.h"
46 // Tracks data to determine which elements of a DOM subtree need to have style
48 class DescendantInvalidationSet FINAL : public RefCountedWillBeGarbageCollected<DescendantInvalidationSet> {
50 static PassRefPtrWillBeRawPtr<DescendantInvalidationSet> create()
52 return adoptRefWillBeNoop(new DescendantInvalidationSet);
55 bool invalidatesElement(Element&) const;
57 void combine(const DescendantInvalidationSet& other);
59 void addClass(const AtomicString& className);
60 void addId(const AtomicString& id);
61 void addTagName(const AtomicString& tagName);
62 void addAttribute(const AtomicString& attributeLocalName);
64 void setWholeSubtreeInvalid();
65 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; }
67 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; }
68 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; }
70 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; }
71 bool customPseudoInvalid() const { return m_customPseudoInvalid; }
73 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attributes; }
82 DescendantInvalidationSet();
84 WillBeHeapHashSet<AtomicString>& ensureClassSet();
85 WillBeHeapHashSet<AtomicString>& ensureIdSet();
86 WillBeHeapHashSet<AtomicString>& ensureTagNameSet();
87 WillBeHeapHashSet<AtomicString>& ensureAttributeSet();
89 // FIXME: optimize this if it becomes a memory issue.
90 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_classes;
91 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_ids;
92 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_tagNames;
93 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes;
95 // If true, all descendants might be invalidated, so a full subtree recalc is required.
96 unsigned m_allDescendantsMightBeInvalid : 1;
98 // If true, all descendants which are custom pseudo elements must be invalidated.
99 unsigned m_customPseudoInvalid : 1;
101 // If true, the invalidation must traverse into ShadowRoots with this set.
102 unsigned m_treeBoundaryCrossing : 1;
107 #endif // DescendantInvalidationSet_h