| 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 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 113 public: | 113 public: |
| 114 RecursionCheckpoint(RecursionData* data) | 114 RecursionCheckpoint(RecursionData* data) |
| 115 : m_prevInvalidationSetsSize(data->m_invalidationSets.size()), | 115 : m_prevInvalidationSetsSize(data->m_invalidationSets.size()), |
| 116 m_prevInvalidateCustomPseudo(data->m_invalidateCustomPseudo), | 116 m_prevInvalidateCustomPseudo(data->m_invalidateCustomPseudo), |
| 117 m_prevWholeSubtreeInvalid(data->m_wholeSubtreeInvalid), | 117 m_prevWholeSubtreeInvalid(data->m_wholeSubtreeInvalid), |
| 118 m_treeBoundaryCrossing(data->m_treeBoundaryCrossing), | 118 m_treeBoundaryCrossing(data->m_treeBoundaryCrossing), |
| 119 m_insertionPointCrossing(data->m_insertionPointCrossing), | 119 m_insertionPointCrossing(data->m_insertionPointCrossing), |
| 120 m_invalidatesSlotted(data->m_invalidatesSlotted), | 120 m_invalidatesSlotted(data->m_invalidatesSlotted), |
| 121 m_data(data) {} | 121 m_data(data) {} |
| 122 ~RecursionCheckpoint() { | 122 ~RecursionCheckpoint() { |
| 123 m_data->m_invalidationSets.remove( | 123 m_data->m_invalidationSets.erase( |
| 124 m_prevInvalidationSetsSize, | 124 m_prevInvalidationSetsSize, |
| 125 m_data->m_invalidationSets.size() - m_prevInvalidationSetsSize); | 125 m_data->m_invalidationSets.size() - m_prevInvalidationSetsSize); |
| 126 m_data->m_invalidateCustomPseudo = m_prevInvalidateCustomPseudo; | 126 m_data->m_invalidateCustomPseudo = m_prevInvalidateCustomPseudo; |
| 127 m_data->m_wholeSubtreeInvalid = m_prevWholeSubtreeInvalid; | 127 m_data->m_wholeSubtreeInvalid = m_prevWholeSubtreeInvalid; |
| 128 m_data->m_treeBoundaryCrossing = m_treeBoundaryCrossing; | 128 m_data->m_treeBoundaryCrossing = m_treeBoundaryCrossing; |
| 129 m_data->m_insertionPointCrossing = m_insertionPointCrossing; | 129 m_data->m_insertionPointCrossing = m_insertionPointCrossing; |
| 130 m_data->m_invalidatesSlotted = m_invalidatesSlotted; | 130 m_data->m_invalidatesSlotted = m_invalidatesSlotted; |
| 131 } | 131 } |
| 132 | 132 |
| 133 private: | 133 private: |
| (...skipping 10 matching lines...) Expand all Loading... |
| 144 HeapHashMap<Member<ContainerNode>, std::unique_ptr<PendingInvalidations>>; | 144 HeapHashMap<Member<ContainerNode>, std::unique_ptr<PendingInvalidations>>; |
| 145 | 145 |
| 146 PendingInvalidations& ensurePendingInvalidations(ContainerNode&); | 146 PendingInvalidations& ensurePendingInvalidations(ContainerNode&); |
| 147 | 147 |
| 148 PendingInvalidationMap m_pendingInvalidationMap; | 148 PendingInvalidationMap m_pendingInvalidationMap; |
| 149 }; | 149 }; |
| 150 | 150 |
| 151 } // namespace blink | 151 } // namespace blink |
| 152 | 152 |
| 153 #endif // StyleInvalidator_h | 153 #endif // StyleInvalidator_h |
| OLD | NEW |