OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.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. |
| 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@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/) |
| 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
| 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
| 11 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 12 * |
| 13 * This library is free software; you can redistribute it and/or |
| 14 * modify it under the terms of the GNU Library General Public |
| 15 * License as published by the Free Software Foundation; either |
| 16 * version 2 of the License, or (at your option) any later version. |
| 17 * |
| 18 * This library is distributed in the hope that it will be useful, |
| 19 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 21 * Library General Public License for more details. |
| 22 * |
| 23 * You should have received a copy of the GNU Library General Public License |
| 24 * along with this library; see the file COPYING.LIB. If not, write to |
| 25 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 26 * Boston, MA 02110-1301, USA. |
| 27 */ |
| 28 |
| 29 #include "config.h" |
| 30 #include "core/css/TreeBoundaryCrossingRules.h" |
| 31 |
| 32 #include "core/css/ElementRuleCollector.h" |
| 33 #include "core/css/StylePropertySet.h" |
| 34 #include "core/css/resolver/ScopedStyleResolver.h" |
| 35 |
| 36 namespace blink { |
| 37 |
| 38 void TreeBoundaryCrossingRules::collectTreeBoundaryCrossingRules(Element* elemen
t, ElementRuleCollector& collector, bool includeEmptyRules) |
| 39 { |
| 40 if (m_scopingNodes.isEmpty()) |
| 41 return; |
| 42 |
| 43 // When comparing rules declared in outer treescopes, outer's rules win. |
| 44 CascadeOrder outerCascadeOrder = size() + size(); |
| 45 // When comparing rules declared in inner treescopes, inner's rules win. |
| 46 CascadeOrder innerCascadeOrder = size(); |
| 47 |
| 48 ASSERT(!collector.scopeContainsLastMatchedElement()); |
| 49 collector.setScopeContainsLastMatchedElement(true); |
| 50 |
| 51 for (const auto& scope : m_scopingNodes) { |
| 52 |
| 53 bool isInnerTreeScope = element->treeScope().isInclusiveAncestorOf(scope
->treeScope()); |
| 54 CascadeOrder cascadeOrder = isInnerTreeScope ? innerCascadeOrder : outer
CascadeOrder; |
| 55 |
| 56 scope->treeScope().scopedStyleResolver()->collectMatchingTreeBoundaryCro
ssingRules(collector, includeEmptyRules, cascadeOrder); |
| 57 |
| 58 ++innerCascadeOrder; |
| 59 --outerCascadeOrder; |
| 60 } |
| 61 |
| 62 collector.setScopeContainsLastMatchedElement(false); |
| 63 } |
| 64 |
| 65 void TreeBoundaryCrossingRules::addScope(ContainerNode& scopingNode) |
| 66 { |
| 67 m_scopingNodes.add(&scopingNode); |
| 68 } |
| 69 |
| 70 void TreeBoundaryCrossingRules::removeScope(const ContainerNode& scopingNode) |
| 71 { |
| 72 m_scopingNodes.remove(&scopingNode); |
| 73 } |
| 74 |
| 75 DEFINE_TRACE(TreeBoundaryCrossingRules) |
| 76 { |
| 77 #if ENABLE(OILPAN) |
| 78 visitor->trace(m_scopingNodes); |
| 79 #endif |
| 80 } |
| 81 |
| 82 } // namespace blink |
OLD | NEW |