Home | History | Annotate | Download | only in css 
      1 /*
      2  * Copyright (C) 1999 Lars Knoll (knoll (at) kde.org)
      3  * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
      4  * Copyright (C) 2013 Google Inc. All rights reserved.
      5  *
      6  * This library is free software; you can redistribute it and/or
      7  * modify it under the terms of the GNU Library General Public
      8  * License as published by the Free Software Foundation; either
      9  * version 2 of the License, or (at your option) any later version.
     10  *
     11  * This library is distributed in the hope that it will be useful,
     12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
     13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
     14  * Library General Public License for more details.
     15  *
     16  * You should have received a copy of the GNU Library General Public License
     17  * along with this library; see the file COPYING.LIB.  If not, write to
     18  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
     19  * Boston, MA 02110-1301, USA.
     20  *
     21  */
     22 
     23 #ifndef TreeBoundaryCrossingRules_h
     24 #define TreeBoundaryCrossingRules_h
     25 
     26 #include "core/css/RuleSet.h"
     27 #include "core/dom/DocumentOrderedList.h"
     28 
     29 #include "wtf/OwnPtr.h"
     30 #include "wtf/RefPtr.h"
     31 #include "wtf/Vector.h"
     32 
     33 namespace blink {
     34 
     35 class CSSStyleSheet;
     36 class ContainerNode;
     37 class ElementRuleCollector;
     38 class RuleFeatureSet;
     39 
     40 class TreeBoundaryCrossingRules FINAL {
     41     DISALLOW_ALLOCATION();
     42 public:
     43     void addTreeBoundaryCrossingRules(const RuleSet&, CSSStyleSheet*, unsigned sheetIndex, ContainerNode&);
     44 
     45     void reset(const ContainerNode* scopingNode);
     46     void collectFeaturesTo(RuleFeatureSet&);
     47     void collectTreeBoundaryCrossingRules(Element*, ElementRuleCollector&, bool includeEmptyRules);
     48 
     49     void trace(Visitor*);
     50 
     51 private:
     52     size_t size() const { return m_scopingNodes.size(); }
     53     class RuleSubSet FINAL : public NoBaseWillBeGarbageCollected<RuleSubSet> {
     54     public:
     55         static PassOwnPtrWillBeRawPtr<RuleSubSet> create(CSSStyleSheet* sheet, unsigned index, PassOwnPtrWillBeRawPtr<RuleSet> rules)
     56         {
     57             return adoptPtrWillBeNoop(new RuleSubSet(sheet, index, rules));
     58         }
     59 
     60         CSSStyleSheet* parentStyleSheet;
     61         unsigned parentIndex;
     62         OwnPtrWillBeMember<RuleSet> ruleSet;
     63 
     64         void trace(Visitor*);
     65 
     66     private:
     67         RuleSubSet(CSSStyleSheet* sheet, unsigned index, PassOwnPtrWillBeRawPtr<RuleSet> rules)
     68             : parentStyleSheet(sheet)
     69             , parentIndex(index)
     70             , ruleSet(rules)
     71         {
     72         }
     73     };
     74     typedef WillBeHeapVector<OwnPtrWillBeMember<RuleSubSet> > CSSStyleSheetRuleSubSet;
     75     void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&);
     76 
     77     DocumentOrderedList m_scopingNodes;
     78     typedef WillBeHeapHashMap<RawPtrWillBeMember<const ContainerNode>, OwnPtrWillBeMember<CSSStyleSheetRuleSubSet> > TreeBoundaryCrossingRuleSetMap;
     79     TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap;
     80 };
     81 
     82 } // namespace blink
     83 
     84 #endif // TreeBoundaryCrossingRules_h
     85