src/third_party/WebKit/Source/core/dom/shadow/ElementShadow.h

   1 /*
   2  * Copyright (C) 2012 Google Inc. All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions are
   6  * met:
   7  *
   8  *     * Redistributions of source code must retain the above copyright
   9  * notice, this list of conditions and the following disclaimer.
  10  *     * Neither the name of Google Inc. nor the names of its
  11  * contributors may be used to endorse or promote products derived from
  12  * this software without specific prior written permission.
  13  *
  14  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  15  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  16  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  17  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  18  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  19  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  20  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25  */
  26
  27 #ifndef ElementShadow_h
  28 #define ElementShadow_h
  29
  30 #include "core/dom/shadow/InsertionPoint.h"
  31 #include "core/dom/shadow/SelectRuleFeatureSet.h"
  32 #include "core/dom/shadow/ShadowRoot.h"
  33 #include "platform/heap/Handle.h"
  34 #include "wtf/DoublyLinkedList.h"
  35 #include "wtf/Forward.h"
  36 #include "wtf/HashMap.h"
  37 #include "wtf/Noncopyable.h"
  38 #include "wtf/PassOwnPtr.h"
  39 #include "wtf/Vector.h"
  40
  41 namespace WebCore {
  42
  43 class ElementShadow FINAL : public NoBaseWillBeGarbageCollectedFinalized<ElementShadow> {
  44     WTF_MAKE_NONCOPYABLE(ElementShadow);
  45     WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED;
  46 public:
  47     static PassOwnPtrWillBeRawPtr<ElementShadow> create();
  48     ~ElementShadow();
  49
  50     Element* host() const;
  51     ShadowRoot* youngestShadowRoot() const { return m_shadowRoots.head(); }
  52     ShadowRoot* oldestShadowRoot() const { return m_shadowRoots.tail(); }
  53     ElementShadow* containingShadow() const;
  54
  55     ShadowRoot& addShadowRoot(Element& shadowHost, ShadowRoot::ShadowRootType);
  56
  57     bool hasSameStyles(const ElementShadow*) const;
  58
  59     void attach(const Node::AttachContext&);
  60     void detach(const Node::AttachContext&);
  61
  62     void didAffectSelector(AffectedSelectorMask);
  63     void willAffectSelector();
  64     const SelectRuleFeatureSet& ensureSelectFeatureSet();
  65
  66     void distributeIfNeeded();
  67     void setNeedsDistributionRecalc();
  68
  69     const InsertionPoint* finalDestinationInsertionPointFor(const Node*) const;
  70     const DestinationInsertionPoints* destinationInsertionPointsFor(const Node*) const;
  71
  72     void didDistributeNode(const Node*, InsertionPoint*);
  73
  74     void trace(Visitor*);
  75
  76 private:
  77     ElementShadow();
  78
  79 #if !ENABLE(OILPAN)
  80     void removeDetachedShadowRoots();
  81 #endif
  82
  83     void distribute();
  84     void clearDistribution();
  85
  86     void collectSelectFeatureSetFrom(ShadowRoot&);
  87     void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*);
  88
  89     bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; }
  90     void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; }
  91
  92     typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationInsertionPoints;
  93     NodeToDestinationInsertionPoints m_nodeToInsertionPoints;
  94
  95     SelectRuleFeatureSet m_selectFeatures;
  96     // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>.
  97     DoublyLinkedList<ShadowRoot> m_shadowRoots;
  98     bool m_needsDistributionRecalc;
  99     bool m_needsSelectFeatureSet;
 100 };
 101
 102 inline Element* ElementShadow::host() const
 103 {
 104     ASSERT(!m_shadowRoots.isEmpty());
 105     return youngestShadowRoot()->host();
 106 }
 107
 108 inline ShadowRoot* Node::youngestShadowRoot() const
 109 {
 110     if (!isElementNode())
 111         return 0;
 112     return toElement(this)->youngestShadowRoot();
 113 }
 114
 115 inline ShadowRoot* Element::youngestShadowRoot() const
 116 {
 117     if (ElementShadow* shadow = this->shadow())
 118         return shadow->youngestShadowRoot();
 119     return 0;
 120 }
 121
 122 inline ElementShadow* ElementShadow::containingShadow() const
 123 {
 124     if (ShadowRoot* parentRoot = host()->containingShadowRoot())
 125         return parentRoot->owner();
 126     return 0;
 127 }
 128
 129 inline void ElementShadow::distributeIfNeeded()
 130 {
 131     if (m_needsDistributionRecalc)
 132         distribute();
 133     m_needsDistributionRecalc = false;
 134 }
 135
 136 } // namespace
 137
 138 #endif