HomeSort by relevance Sort by last modified time
    Searched defs:RuleData (Results 1 - 2 of 2) sorted by null

  /external/chromium_org/third_party/WebKit/Source/core/css/
RuleSet.cpp 126 RuleData::RuleData(StyleRule* rule, unsigned selectorIndex, unsigned position, AddRuleFlags addRuleFlags)
144 void RuleSet::addToRuleSet(const AtomicString& key, PendingRuleMap& map, const RuleData& ruleData)
146 OwnPtrWillBeMember<WillBeHeapLinkedStack<RuleData> >& rules = map.add(key, nullptr).storedValue->value;
148 rules = adoptPtrWillBeNoop(new WillBeHeapLinkedStack<RuleData>);
149 rules->push(ruleData);
172 bool RuleSet::findBestRuleSetAndAdd(const CSSSelector& component, RuleData& ruleData)
180 m_allRules.append(ruleData);
    [all...]
RuleSet.h 72 class RuleData {
75 RuleData(StyleRule*, unsigned selectorIndex, unsigned position, AddRuleFlags);
92 // Try to balance between memory usage (there can be lots of RuleData objects) and good filtering performance.
101 unsigned m_isLastInArray : 1; // We store an array of RuleData objects in a primitive array.
103 // Some simple testing showed <100,000 RuleData's on large sites.
123 COMPILE_ASSERT(sizeof(RuleData) == sizeof(SameSizeAsRuleData), RuleData_should_stay_small);
137 const WillBeHeapTerminatedArray<RuleData>* idRules(const AtomicString& key) const { ASSERT(!m_pendingRules); return m_idRules.get(key); }
138 const WillBeHeapTerminatedArray<RuleData>* classRules(const AtomicString& key) const { ASSERT(!m_pendingRules); return m_classRules.get(key); }
139 const WillBeHeapTerminatedArray<RuleData>* tagRules(const AtomicString& key) const { ASSERT(!m_pendingRules); return m_tagRules.get(key); }
140 const WillBeHeapTerminatedArray<RuleData>* shadowPseudoElementRules(const AtomicString& key) const { ASSERT(!m_pendingRules); return m_shad (…)
    [all...]

Completed in 162 milliseconds