OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef StyleInvalidator_h | 5 #ifndef StyleInvalidator_h |
6 #define StyleInvalidator_h | 6 #define StyleInvalidator_h |
7 | 7 |
8 #include "core/css/invalidation/PendingInvalidations.h" | 8 #include "core/css/invalidation/PendingInvalidations.h" |
9 #include "platform/heap/Handle.h" | 9 #include "platform/heap/Handle.h" |
10 #include "wtf/Noncopyable.h" | 10 #include "wtf/Noncopyable.h" |
(...skipping 13 matching lines...) Expand all Loading... |
24 | 24 |
25 public: | 25 public: |
26 StyleInvalidator(); | 26 StyleInvalidator(); |
27 ~StyleInvalidator(); | 27 ~StyleInvalidator(); |
28 void invalidate(Document&); | 28 void invalidate(Document&); |
29 void scheduleInvalidationSetsForNode(const InvalidationLists&, | 29 void scheduleInvalidationSetsForNode(const InvalidationLists&, |
30 ContainerNode&); | 30 ContainerNode&); |
31 void scheduleSiblingInvalidationsAsDescendants( | 31 void scheduleSiblingInvalidationsAsDescendants( |
32 const InvalidationLists&, | 32 const InvalidationLists&, |
33 ContainerNode& schedulingParent); | 33 ContainerNode& schedulingParent); |
| 34 void rescheduleSiblingInvalidationsAsDescendants(Element&); |
34 void clearInvalidation(ContainerNode&); | 35 void clearInvalidation(ContainerNode&); |
35 | 36 |
36 DEFINE_INLINE_TRACE() { visitor->trace(m_pendingInvalidationMap); } | 37 DEFINE_INLINE_TRACE() { visitor->trace(m_pendingInvalidationMap); } |
37 | 38 |
38 private: | 39 private: |
39 struct RecursionData { | 40 struct RecursionData { |
40 RecursionData() | 41 RecursionData() |
41 : m_invalidateCustomPseudo(false), | 42 : m_invalidateCustomPseudo(false), |
42 m_wholeSubtreeInvalid(false), | 43 m_wholeSubtreeInvalid(false), |
43 m_treeBoundaryCrossing(false), | 44 m_treeBoundaryCrossing(false), |
(...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
143 HeapHashMap<Member<ContainerNode>, std::unique_ptr<PendingInvalidations>>; | 144 HeapHashMap<Member<ContainerNode>, std::unique_ptr<PendingInvalidations>>; |
144 | 145 |
145 PendingInvalidations& ensurePendingInvalidations(ContainerNode&); | 146 PendingInvalidations& ensurePendingInvalidations(ContainerNode&); |
146 | 147 |
147 PendingInvalidationMap m_pendingInvalidationMap; | 148 PendingInvalidationMap m_pendingInvalidationMap; |
148 }; | 149 }; |
149 | 150 |
150 } // namespace blink | 151 } // namespace blink |
151 | 152 |
152 #endif // StyleInvalidator_h | 153 #endif // StyleInvalidator_h |
OLD | NEW |