Source/core/css/invalidation/DescendantInvalidationSet.h - Issue 1317533002: Sibling invalidation sets

Side by Side Diff: Source/core/css/invalidation/DescendantInvalidationSet.h

Issue 1317533002: Sibling invalidation sets (Closed) Base URL: https://chromium.googlesource.com/chromium/blink.git@master

Patch Set: Rebase Created 5 years, 3 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

OLD	NEW
	(Empty)
1 /*

2 * Copyright (C) 2014 Google Inc. All rights reserved.

3 *

4 * Redistribution and use in source and binary forms, with or without

5 * modification, are permitted provided that the following conditions are

6 * met:

7 *

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

13 * distribution.

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.

17 *

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.

29 */

30

31 #ifndef DescendantInvalidationSet_h

32 #define DescendantInvalidationSet_h

33

34 #include "core/CoreExport.h"

35 #include "platform/heap/Handle.h"

36 #include "wtf/Forward.h"

37 #include "wtf/HashSet.h"

38 #include "wtf/RefCounted.h"

39 #include "wtf/RefPtr.h"

40 #include "wtf/text/AtomicStringHash.h"

41 #include "wtf/text/StringHash.h"

42

43 namespace blink {

44

45 class Element;

46 class TracedValue;

47

48 // Tracks data to determine which elements of a DOM subtree need to have style

49 // recalculated.

50 class CORE_EXPORT DescendantInvalidationSet final : public RefCountedWillBeGarba geCollected<DescendantInvalidationSet> {

51 WTF_MAKE_NONCOPYABLE(DescendantInvalidationSet);

52 public:

53 static PassRefPtrWillBeRawPtr<DescendantInvalidationSet> create()

54 {

55 return adoptRefWillBeNoop(new DescendantInvalidationSet);

56 }

57

58 static void cacheTracingFlag();

59

60 bool invalidatesElement(Element&) const;

61

62 void combine(const DescendantInvalidationSet& other);

63

64 void addClass(const AtomicString& className);

65 void addId(const AtomicString& id);

66 void addTagName(const AtomicString& tagName);

67 void addAttribute(const AtomicString& attributeLocalName);

68

69 void setWholeSubtreeInvalid();

70 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; }

71

72 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; }

73 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; }

74

75 void setInsertionPointCrossing() { m_insertionPointCrossing = true; }

76 bool insertionPointCrossing() const { return m_insertionPointCrossing; }

77

78 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; }

79 bool customPseudoInvalid() const { return m_customPseudoInvalid; }

80

81 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr ibutes && !m_customPseudoInvalid; }

82

83 DECLARE_TRACE();

84

85 void toTracedValue(TracedValue*) const;

86

87 #ifndef NDEBUG

88 void show() const;

89 #endif

90

91 private:

92 DescendantInvalidationSet();

93

94 WillBeHeapHashSet<AtomicString>& ensureClassSet();

95 WillBeHeapHashSet<AtomicString>& ensureIdSet();

96 WillBeHeapHashSet<AtomicString>& ensureTagNameSet();

97 WillBeHeapHashSet<AtomicString>& ensureAttributeSet();

98

99 // FIXME: optimize this if it becomes a memory issue.

100 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_classes;

101 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_ids;

102 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_tagNames;

103 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_attributes;

104

105 // If true, all descendants might be invalidated, so a full subtree recalc i s required.

106 unsigned m_allDescendantsMightBeInvalid : 1;

107

108 // If true, all descendants which are custom pseudo elements must be invalid ated.

109 unsigned m_customPseudoInvalid : 1;

110

111 // If true, the invalidation must traverse into ShadowRoots with this set.

112 unsigned m_treeBoundaryCrossing : 1;

113

114 // If true, insertion point descendants must be invalidated.

115 unsigned m_insertionPointCrossing : 1;

116 };

117

118 } // namespace blink

119

120 #endif // DescendantInvalidationSet_h

OLD	NEW