Sibling invalidation sets

Source/core/css/invalidation/StyleInvalidator.h

Index: Source/core/css/invalidation/StyleInvalidator.h
diff --git a/Source/core/css/invalidation/StyleInvalidator.h b/Source/core/css/invalidation/StyleInvalidator.h
index 23ba0143a3091bd5b494d28a90f44534a4ebcc84..29fc3b57c8f3fab815de8154d84c6b5d35f0750d 100644
--- a/Source/core/css/invalidation/StyleInvalidator.h
+++ b/Source/core/css/invalidation/StyleInvalidator.h
@@ -5,6 +5,7 @@
 #ifndef StyleInvalidator_h
 #define StyleInvalidator_h
 
+#include "core/css/invalidation/InvalidationListData.h"
 #include "platform/heap/Handle.h"
 #include "wtf/Noncopyable.h"
 
@@ -21,7 +22,7 @@ public:
     StyleInvalidator();
     ~StyleInvalidator();
     void invalidate(Document&);
-    void scheduleInvalidation(PassRefPtrWillBeRawPtr<DescendantInvalidationSet>, Element&);
+    void scheduleInvalidationSetsForElement(const InvalidationSetVector& descendant, const InvalidationSetVector& sibling, Element&);
     void clearInvalidation(Element&);
 
     void clearPendingInvalidations();
@@ -29,6 +30,7 @@ public:
     DECLARE_TRACE();
 
 private:
+
     class RecursionData {
         STACK_ALLOCATED();
     public:
@@ -40,7 +42,7 @@ private:
         { }
 
         void pushInvalidationSet(const DescendantInvalidationSet&);
-        bool matchesCurrentInvalidationSets(Element&);
+        bool matchesCurrentInvalidationSets(Element&) const;
         bool hasInvalidationSets() const { return !wholeSubtreeInvalid() && m_invalidationSets.size(); }
 
         bool wholeSubtreeInvalid() const { return m_wholeSubtreeInvalid; }
@@ -57,9 +59,30 @@ private:
         bool m_insertionPointCrossing;
     };
 
-    bool invalidate(Element&, RecursionData&);
+    class SiblingData {
+        STACK_ALLOCATED();
+    public:
+        SiblingData()
+            : m_elementIndex(0)
+        { }
+
+        void pushInvalidationSet(const DescendantInvalidationSet&);
+        bool matchCurrentInvalidationSets(Element&, RecursionData&, bool);
+
+        void advance() { m_elementIndex++; }
+
+        struct Entry {
+            RawPtrWillBeMember<const DescendantInvalidationSet> invalidationSet;
+            unsigned invalidationLimit;
+        };
+
+        WillBeHeapVector<Entry, 16> m_invalidationEntries;
+        unsigned m_elementIndex;
+    };
+
+    bool invalidate(Element&, RecursionData&, SiblingData&);
     bool invalidateChildren(Element&, RecursionData&);
-    bool checkInvalidationSetsAgainstElement(Element&, RecursionData&);
+    bool checkInvalidationSetsAgainstElement(Element&, RecursionData&, SiblingData&);
 
     class RecursionCheckpoint {
         STACK_ALLOCATED();
@@ -91,10 +114,9 @@ private:
         RecursionData* m_data;
     };
 
-    using InvalidationList = WillBeHeapVector<RefPtrWillBeMember<DescendantInvalidationSet>>;
-    using PendingInvalidationMap = WillBeHeapHashMap<RawPtrWillBeMember<Element>, OwnPtrWillBeMember<InvalidationList>>;
+    using PendingInvalidationMap = WillBeHeapHashMap<RawPtrWillBeMember<Element>, RefPtrWillBeMember<InvalidationListData>>;
 
-    InvalidationList& ensurePendingInvalidationList(Element&);
+    InvalidationListData& ensurePendingInvalidationListData(Element&);
 
     PendingInvalidationMap m_pendingInvalidationMap;
 };