Implement proposed shadow tree cascade order.

Source/core/css/resolver/MatchResult.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2013 Google Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
@@ skipping 41 matching lines @@
         void* possiblyPaddedMember;
     };
 };
 
 } // namespace blink
 
 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::MatchedProperties);
 
 namespace blink {
 
+using MatchedPropertiesVector = WillBeHeapVector<MatchedProperties, 64>;
+
+// MatchedPropertiesRange is used to represent a subset of the matched properties from
+// a given origin, for instance UA rules, author rules, or a shadow tree scope. This is
+// needed because rules from different origins are applied in the opposite order for
+// !important rules, yet in the same order as for normal rules within the same origin.
+
+class MatchedPropertiesRange {
+public:
+    MatchedPropertiesRange(MatchedPropertiesVector::const_iterator begin, MatchedPropertiesVector::const_iterator end)
+        : m_begin(begin)
+        , m_end(end)
+    {
+    }
+
+    MatchedPropertiesVector::const_iterator begin() const { return m_begin; }
+    MatchedPropertiesVector::const_iterator end() const { return m_end; }
+
+private:
+    MatchedPropertiesVector::const_iterator m_begin;
+    MatchedPropertiesVector::const_iterator m_end;
+};
+
 class MatchResult {
     STACK_ALLOCATED();
 public:
     void addMatchedProperties(const StylePropertySet* properties, unsigned linkMatchType = CSSSelector::MatchAll, PropertyWhitelistType = PropertyWhitelistNone);
+    bool hasMatchedProperties() const { return m_matchedProperties.size(); }
 
-    unsigned begin() const { return 0; }
-    unsigned end() const { return matchedProperties.size(); }
-    unsigned beginUA() const { return 0; }
-    unsigned endUA() const { return uaEnd; }
-    unsigned beginAuthor() const { return uaEnd; }
-    unsigned endAuthor() const { return matchedProperties.size(); }
+    void closeOriginOrScope(bool isUAOrigin);
 
-    WillBeHeapVector<MatchedProperties, 64> matchedProperties;
-    unsigned uaEnd = 0;
-    bool isCacheable = true;
+    void setIsCacheable(bool cacheable) { m_isCacheable = cacheable; }
+    bool isCacheable() const { return m_isCacheable; }
+
+    MatchedPropertiesRange allRules() const { return MatchedPropertiesRange(m_matchedProperties.begin(), m_matchedProperties.end()); }
+    MatchedPropertiesRange uaRules() const { return MatchedPropertiesRange(m_matchedProperties.begin(), m_matchedProperties.begin() + m_rangeEnd.first()); }
+    MatchedPropertiesRange authorRules() const { return MatchedPropertiesRange(m_matchedProperties.begin() + m_rangeEnd.first(), m_matchedProperties.end()); }
+
+    const MatchedPropertiesVector& matchedProperties() const { return m_matchedProperties; }
+
+private:
+    friend class ImportantAuthorRanges;
+    friend class ImportantAuthorRangeIterator;
+
+    MatchedPropertiesVector m_matchedProperties;
+
+    // End indices for all MatchedPropertiesRanges of m_matchedProperties.
+    // That is, the index of the first element of the next range. We always
+    // store an end index for UA rules even if we have no UA rules,
+    // hence this vector's length is >= 1. If there are No UA rules, the first
+    // entry will be 0 indicating an empty range.
+    Vector<unsigned, 16> m_rangeEnd;
+
+    bool m_isCacheable = true;
+};
+
+class ImportantAuthorRangeIterator {
+public:
+    ImportantAuthorRangeIterator(const MatchResult& result, unsigned index)
+        : m_result(result)
+        , m_index(index) { }
+
+    MatchedPropertiesRange operator*() const
+    {
+        // index = 0 is the UA rule range.
+        ASSERT(m_index);
+        return MatchedPropertiesRange(m_result.m_matchedProperties.begin() + m_result.m_rangeEnd[m_index - 1], m_result.m_matchedProperties.begin() + m_result.m_rangeEnd[m_index]);
+    }
+
+    ImportantAuthorRangeIterator& operator++()
+    {
+        ASSERT(m_index);
+        --m_index;
+        return *this;
+    }
+
+    bool operator!=(const ImportantAuthorRangeIterator& other) const { return m_index != other.m_index || &m_result != &other.m_result; }
+
+private:
+    const MatchResult& m_result;
+    unsigned m_index;
+};
+
+class ImportantAuthorRanges {
+public:
+    explicit ImportantAuthorRanges(const MatchResult& result) : m_result(result) { }
+
+    ImportantAuthorRangeIterator begin() const { return ImportantAuthorRangeIterator(m_result, m_result.m_rangeEnd.size() - 1); }
+    ImportantAuthorRangeIterator end() const { return ImportantAuthorRangeIterator(m_result, 0); }
+
+private:
+    const MatchResult& m_result;
 };
 
 inline bool operator==(const MatchedProperties& a, const MatchedProperties& b)
 {
     return a.properties == b.properties && a.m_types.linkMatchType == b.m_types.linkMatchType;
 }
 
 inline bool operator!=(const MatchedProperties& a, const MatchedProperties& b)
 {
     return !(a == b);
 }
 
 } // namespace blink
 
 #endif // MatchResult_h