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 "platform/heap/Handle.h" | 8 #include "platform/heap/Handle.h" |
9 | 9 |
10 namespace blink { | 10 namespace blink { |
(...skipping 16 matching lines...) Expand all Loading... |
27 void clearPendingInvalidations(); | 27 void clearPendingInvalidations(); |
28 | 28 |
29 void trace(Visitor*); | 29 void trace(Visitor*); |
30 | 30 |
31 private: | 31 private: |
32 struct RecursionData { | 32 struct RecursionData { |
33 RecursionData() | 33 RecursionData() |
34 : m_invalidateCustomPseudo(false) | 34 : m_invalidateCustomPseudo(false) |
35 , m_wholeSubtreeInvalid(false) | 35 , m_wholeSubtreeInvalid(false) |
36 , m_treeBoundaryCrossing(false) | 36 , m_treeBoundaryCrossing(false) |
| 37 , m_insertionPointCrossing(false) |
37 { } | 38 { } |
38 | 39 |
39 void pushInvalidationSet(const DescendantInvalidationSet&); | 40 void pushInvalidationSet(const DescendantInvalidationSet&); |
40 bool matchesCurrentInvalidationSets(Element&); | 41 bool matchesCurrentInvalidationSets(Element&); |
41 bool hasInvalidationSets() const { return !wholeSubtreeInvalid() && m_in
validationSets.size(); } | 42 bool hasInvalidationSets() const { return !wholeSubtreeInvalid() && m_in
validationSets.size(); } |
42 | 43 |
43 bool wholeSubtreeInvalid() const { return m_wholeSubtreeInvalid; } | 44 bool wholeSubtreeInvalid() const { return m_wholeSubtreeInvalid; } |
44 void setWholeSubtreeInvalid() { m_wholeSubtreeInvalid = true; } | 45 void setWholeSubtreeInvalid() { m_wholeSubtreeInvalid = true; } |
45 | 46 |
46 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } | 47 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } |
| 48 bool insertionPointCrossing() const { return m_insertionPointCrossing; } |
47 | 49 |
48 typedef Vector<const DescendantInvalidationSet*, 16> InvalidationSets; | 50 typedef Vector<const DescendantInvalidationSet*, 16> InvalidationSets; |
49 InvalidationSets m_invalidationSets; | 51 InvalidationSets m_invalidationSets; |
50 bool m_invalidateCustomPseudo; | 52 bool m_invalidateCustomPseudo; |
51 bool m_wholeSubtreeInvalid; | 53 bool m_wholeSubtreeInvalid; |
52 bool m_treeBoundaryCrossing; | 54 bool m_treeBoundaryCrossing; |
| 55 bool m_insertionPointCrossing; |
53 }; | 56 }; |
54 | 57 |
55 bool invalidate(Element&, RecursionData&); | 58 bool invalidate(Element&, RecursionData&); |
56 bool invalidateChildren(Element&, RecursionData&); | 59 bool invalidateChildren(Element&, RecursionData&); |
57 bool checkInvalidationSetsAgainstElement(Element&, RecursionData&); | 60 bool checkInvalidationSetsAgainstElement(Element&, RecursionData&); |
58 | 61 |
59 class RecursionCheckpoint { | 62 class RecursionCheckpoint { |
60 public: | 63 public: |
61 RecursionCheckpoint(RecursionData* data) | 64 RecursionCheckpoint(RecursionData* data) |
62 : m_prevInvalidationSetsSize(data->m_invalidationSets.size()) | 65 : m_prevInvalidationSetsSize(data->m_invalidationSets.size()) |
63 , m_prevInvalidateCustomPseudo(data->m_invalidateCustomPseudo) | 66 , m_prevInvalidateCustomPseudo(data->m_invalidateCustomPseudo) |
64 , m_prevWholeSubtreeInvalid(data->m_wholeSubtreeInvalid) | 67 , m_prevWholeSubtreeInvalid(data->m_wholeSubtreeInvalid) |
65 , m_treeBoundaryCrossing(data->m_treeBoundaryCrossing) | 68 , m_treeBoundaryCrossing(data->m_treeBoundaryCrossing) |
| 69 , m_insertionPointCrossing(data->m_insertionPointCrossing) |
66 , m_data(data) | 70 , m_data(data) |
67 { } | 71 { } |
68 ~RecursionCheckpoint() | 72 ~RecursionCheckpoint() |
69 { | 73 { |
70 m_data->m_invalidationSets.remove(m_prevInvalidationSetsSize, m_data
->m_invalidationSets.size() - m_prevInvalidationSetsSize); | 74 m_data->m_invalidationSets.remove(m_prevInvalidationSetsSize, m_data
->m_invalidationSets.size() - m_prevInvalidationSetsSize); |
71 m_data->m_invalidateCustomPseudo = m_prevInvalidateCustomPseudo; | 75 m_data->m_invalidateCustomPseudo = m_prevInvalidateCustomPseudo; |
72 m_data->m_wholeSubtreeInvalid = m_prevWholeSubtreeInvalid; | 76 m_data->m_wholeSubtreeInvalid = m_prevWholeSubtreeInvalid; |
73 m_data->m_treeBoundaryCrossing = m_treeBoundaryCrossing; | 77 m_data->m_treeBoundaryCrossing = m_treeBoundaryCrossing; |
| 78 m_data->m_insertionPointCrossing = m_insertionPointCrossing; |
74 } | 79 } |
75 | 80 |
76 private: | 81 private: |
77 int m_prevInvalidationSetsSize; | 82 int m_prevInvalidationSetsSize; |
78 bool m_prevInvalidateCustomPseudo; | 83 bool m_prevInvalidateCustomPseudo; |
79 bool m_prevWholeSubtreeInvalid; | 84 bool m_prevWholeSubtreeInvalid; |
80 bool m_treeBoundaryCrossing; | 85 bool m_treeBoundaryCrossing; |
| 86 bool m_insertionPointCrossing; |
81 RecursionData* m_data; | 87 RecursionData* m_data; |
82 }; | 88 }; |
83 | 89 |
84 typedef WillBeHeapVector<RefPtrWillBeMember<DescendantInvalidationSet> > Inv
alidationList; | 90 typedef WillBeHeapVector<RefPtrWillBeMember<DescendantInvalidationSet> > Inv
alidationList; |
85 typedef WillBeHeapHashMap<RawPtrWillBeMember<Element>, OwnPtrWillBeMember<In
validationList> > PendingInvalidationMap; | 91 typedef WillBeHeapHashMap<RawPtrWillBeMember<Element>, OwnPtrWillBeMember<In
validationList> > PendingInvalidationMap; |
86 | 92 |
87 InvalidationList& ensurePendingInvalidationList(Element&); | 93 InvalidationList& ensurePendingInvalidationList(Element&); |
88 | 94 |
89 PendingInvalidationMap m_pendingInvalidationMap; | 95 PendingInvalidationMap m_pendingInvalidationMap; |
90 }; | 96 }; |
91 | 97 |
92 } // namespace blink | 98 } // namespace blink |
93 | 99 |
94 #endif // StyleInvalidator_h | 100 #endif // StyleInvalidator_h |
OLD | NEW |