| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | |
| 3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. | |
| 4 * Copyright (C) 2012 Google Inc. All rights reserved. | |
| 5 * | |
| 6 * Redistribution and use in source and binary forms, with or without | |
| 7 * modification, are permitted provided that the following conditions | |
| 8 * are met: | |
| 9 * 1. Redistributions of source code must retain the above copyright | |
| 10 * notice, this list of conditions and the following disclaimer. | |
| 11 * 2. Redistributions in binary form must reproduce the above copyright | |
| 12 * notice, this list of conditions and the following disclaimer in the | |
| 13 * documentation and/or other materials provided with the distribution. | |
| 14 * | |
| 15 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | |
| 16 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
| 17 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
| 18 * DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | |
| 19 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
| 20 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
| 21 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | |
| 22 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
| 24 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 25 */ | |
| 26 | |
| 27 #ifndef ScopedStyleResolver_h | |
| 28 #define ScopedStyleResolver_h | |
| 29 | |
| 30 #include <wtf/Assertions.h> | |
| 31 #include <wtf/Forward.h> | |
| 32 #include <wtf/HashMap.h> | |
| 33 #include <wtf/OwnPtr.h> | |
| 34 #include <wtf/Vector.h> | |
| 35 | |
| 36 namespace WebCore { | |
| 37 | |
| 38 class ContainerNode; | |
| 39 class CSSStyleSheet; | |
| 40 class Element; | |
| 41 class RuleSet; | |
| 42 class ShadowRoot; | |
| 43 class StyleRuleHost; | |
| 44 struct RuleFeatureSet; | |
| 45 | |
| 46 class ScopedStyleResolver { | |
| 47 public: | |
| 48 typedef HashMap<const ContainerNode*, OwnPtr<RuleSet> > ScopedRuleSetMap; | |
| 49 | |
| 50 struct StackFrame { | |
| 51 StackFrame() : m_scope(0), m_authorStyleBoundsIndex(0), m_ruleSet(0) { } | |
| 52 StackFrame(const ContainerNode* scope, int authorStyleBoundsIndex, RuleS
et* ruleSet) | |
| 53 : m_scope(scope), m_authorStyleBoundsIndex(authorStyleBoundsIndex),
m_ruleSet(ruleSet) | |
| 54 { } | |
| 55 | |
| 56 const ContainerNode* m_scope; | |
| 57 int m_authorStyleBoundsIndex; | |
| 58 RuleSet* m_ruleSet; | |
| 59 }; | |
| 60 | |
| 61 ScopedStyleResolver(); | |
| 62 ~ScopedStyleResolver(); | |
| 63 | |
| 64 static const ContainerNode* scopeFor(const CSSStyleSheet*); | |
| 65 | |
| 66 void push(const ContainerNode* scope, const ContainerNode* scopeParent); | |
| 67 void pop(const ContainerNode* scope); | |
| 68 bool hasScopedStyles() const { return !m_authorStyles.isEmpty(); } | |
| 69 RuleSet* ensureRuleSetFor(const ContainerNode* scope); | |
| 70 bool ensureStackConsistency(ContainerNode*); | |
| 71 unsigned stackSize() const { return m_stack.size(); } | |
| 72 const StackFrame& stackFrameAt(unsigned index) const { return m_stack.at(ind
ex); } | |
| 73 bool matchesStyleBounds(const StackFrame& frame) const { return frame.m_auth
orStyleBoundsIndex == m_stackParentBoundsIndex; } | |
| 74 void collectFeaturesTo(RuleFeatureSet&); | |
| 75 | |
| 76 void addHostRule(StyleRuleHost*, bool hasDocumentSecurityOrigin, const Conta
inerNode* scope); | |
| 77 bool styleSharingCandidateMatchesHostRules(const Element*); | |
| 78 void matchHostRules(const Element*, Vector<RuleSet*>& matchedRules); | |
| 79 | |
| 80 void reportMemoryUsage(MemoryObjectInfo*) const; | |
| 81 | |
| 82 private: | |
| 83 RuleSet* ruleSetFor(const ContainerNode* scope) const; | |
| 84 void setupStack(const ContainerNode*); | |
| 85 bool stackIsConsistent(const ContainerNode* parent) const { return parent &&
parent == m_stackParent; } | |
| 86 RuleSet* ensureAtHostRuleSetFor(const ShadowRoot*); | |
| 87 RuleSet* atHostRuleSetFor(const ShadowRoot*) const; | |
| 88 | |
| 89 ScopedRuleSetMap m_authorStyles; | |
| 90 | |
| 91 // Vector (used as stack) that keeps track of scoping elements (i.e., elemen
ts with a <style scoped> child) | |
| 92 // encountered during tree iteration for style resolution. | |
| 93 Vector<StackFrame> m_stack; | |
| 94 // Element last seen as parent element when updating m_scopingElementStack. | |
| 95 // This is used to decide whether m_scopingElementStack is consistent, separ
ately from SelectorChecker::m_parentStack. | |
| 96 const ContainerNode* m_stackParent; | |
| 97 int m_stackParentBoundsIndex; | |
| 98 | |
| 99 ScopedRuleSetMap m_atHostRules; | |
| 100 }; | |
| 101 | |
| 102 inline bool ScopedStyleResolver::ensureStackConsistency(ContainerNode* parent) | |
| 103 { | |
| 104 // Match scoped author rules by traversing the scoped element stack (rebuild
it if it got inconsistent). | |
| 105 if (!stackIsConsistent(parent)) | |
| 106 setupStack(parent); | |
| 107 return !m_stack.isEmpty(); | |
| 108 } | |
| 109 } // namespace WebCore | |
| 110 | |
| 111 #endif // ScopedStyleResolver_h | |
| OLD | NEW |