OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) |
4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) | 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) |
5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All r
ights reserved. |
6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> | 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> |
8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. | 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
(...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
76 ASSERT(!collector.scopeContainsLastMatchedElement()); | 76 ASSERT(!collector.scopeContainsLastMatchedElement()); |
77 collector.setScopeContainsLastMatchedElement(true); | 77 collector.setScopeContainsLastMatchedElement(true); |
78 for (const auto& scope : m_scopingNodes) { | 78 for (const auto& scope : m_scopingNodes) { |
79 const ContainerNode* scopingNode = toContainerNode(scope); | 79 const ContainerNode* scopingNode = toContainerNode(scope); |
80 CSSStyleSheetRuleSubSet* ruleSubSet = m_treeBoundaryCrossingRuleSetMap.g
et(scopingNode); | 80 CSSStyleSheetRuleSubSet* ruleSubSet = m_treeBoundaryCrossingRuleSetMap.g
et(scopingNode); |
81 bool isInnerTreeScope = element->treeScope().isInclusiveAncestorOf(scopi
ngNode->treeScope()); | 81 bool isInnerTreeScope = element->treeScope().isInclusiveAncestorOf(scopi
ngNode->treeScope()); |
82 | 82 |
83 CascadeOrder cascadeOrder = isInnerTreeScope ? innerCascadeOrder : outer
CascadeOrder; | 83 CascadeOrder cascadeOrder = isInnerTreeScope ? innerCascadeOrder : outer
CascadeOrder; |
84 for (const auto& rules : *ruleSubSet) { | 84 for (const auto& rules : *ruleSubSet) { |
85 MatchRequest request(rules->ruleSet.get(), includeEmptyRules, scopin
gNode, rules->parentStyleSheet, rules->parentIndex); | 85 MatchRequest request(rules->ruleSet.get(), includeEmptyRules, scopin
gNode, rules->parentStyleSheet, rules->parentIndex); |
86 collector.collectMatchingRules(request, ruleRange, ignoreCascadeScop
e, cascadeOrder, true); | 86 collector.collectMatchingRules(request, ruleRange, cascadeOrder, tru
e); |
87 } | 87 } |
88 ++innerCascadeOrder; | 88 ++innerCascadeOrder; |
89 --outerCascadeOrder; | 89 --outerCascadeOrder; |
90 } | 90 } |
91 collector.setScopeContainsLastMatchedElement(false); | 91 collector.setScopeContainsLastMatchedElement(false); |
92 } | 92 } |
93 | 93 |
94 void TreeBoundaryCrossingRules::reset(const ContainerNode* scopingNode) | 94 void TreeBoundaryCrossingRules::reset(const ContainerNode* scopingNode) |
95 { | 95 { |
96 m_treeBoundaryCrossingRuleSetMap.remove(scopingNode); | 96 m_treeBoundaryCrossingRuleSetMap.remove(scopingNode); |
(...skipping 19 matching lines...) Expand all Loading... |
116 visitor->trace(m_scopingNodes); | 116 visitor->trace(m_scopingNodes); |
117 #endif | 117 #endif |
118 } | 118 } |
119 | 119 |
120 void TreeBoundaryCrossingRules::RuleSubSet::trace(Visitor* visitor) | 120 void TreeBoundaryCrossingRules::RuleSubSet::trace(Visitor* visitor) |
121 { | 121 { |
122 visitor->trace(ruleSet); | 122 visitor->trace(ruleSet); |
123 } | 123 } |
124 | 124 |
125 } // namespace blink | 125 } // namespace blink |
OLD | NEW |