OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
63 void addId(const AtomicString& id); | 63 void addId(const AtomicString& id); |
64 void addTagName(const AtomicString& tagName); | 64 void addTagName(const AtomicString& tagName); |
65 void addAttribute(const AtomicString& attributeLocalName); | 65 void addAttribute(const AtomicString& attributeLocalName); |
66 | 66 |
67 void setWholeSubtreeInvalid(); | 67 void setWholeSubtreeInvalid(); |
68 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; } | 68 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; } |
69 | 69 |
70 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } | 70 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } |
71 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } | 71 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } |
72 | 72 |
| 73 void setInsertionPointCrossing() { m_insertionPointCrossing = true; } |
| 74 bool insertionPointCrossing() const { return m_insertionPointCrossing; } |
| 75 |
73 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } | 76 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } |
74 bool customPseudoInvalid() const { return m_customPseudoInvalid; } | 77 bool customPseudoInvalid() const { return m_customPseudoInvalid; } |
75 | 78 |
76 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } | 79 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } |
77 | 80 |
78 void trace(Visitor*); | 81 void trace(Visitor*); |
79 | 82 |
80 void toTracedValue(TracedValue*) const; | 83 void toTracedValue(TracedValue*) const; |
81 | 84 |
82 #ifndef NDEBUG | 85 #ifndef NDEBUG |
(...skipping 15 matching lines...) Expand all Loading... |
98 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes; | 101 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes; |
99 | 102 |
100 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. | 103 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. |
101 unsigned m_allDescendantsMightBeInvalid : 1; | 104 unsigned m_allDescendantsMightBeInvalid : 1; |
102 | 105 |
103 // If true, all descendants which are custom pseudo elements must be invalid
ated. | 106 // If true, all descendants which are custom pseudo elements must be invalid
ated. |
104 unsigned m_customPseudoInvalid : 1; | 107 unsigned m_customPseudoInvalid : 1; |
105 | 108 |
106 // If true, the invalidation must traverse into ShadowRoots with this set. | 109 // If true, the invalidation must traverse into ShadowRoots with this set. |
107 unsigned m_treeBoundaryCrossing : 1; | 110 unsigned m_treeBoundaryCrossing : 1; |
| 111 |
| 112 // If true, insertion point descendants must be invalidated. |
| 113 unsigned m_insertionPointCrossing : 1; |
108 }; | 114 }; |
109 | 115 |
110 } // namespace blink | 116 } // namespace blink |
111 | 117 |
112 #endif // DescendantInvalidationSet_h | 118 #endif // DescendantInvalidationSet_h |
OLD | NEW |