Support the essential part of Shadow DOM v1

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

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 13 matching lines @@
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #ifndef ElementShadow_h
 #define ElementShadow_h
 
 #include "core/CoreExport.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include "core/dom/shadow/SelectRuleFeatureSet.h"
 #include "core/dom/shadow/ShadowRoot.h"
+#include "core/dom/shadow/SlotAssignment.h"
 #include "platform/heap/Handle.h"
 #include "wtf/DoublyLinkedList.h"
 #include "wtf/HashMap.h"
 #include "wtf/Noncopyable.h"
 #include "wtf/PassOwnPtr.h"
 
 namespace blink {
 
 class CORE_EXPORT ElementShadow final : public NoBaseWillBeGarbageCollectedFinalized<ElementShadow> {
     WTF_MAKE_NONCOPYABLE(ElementShadow);
     USING_FAST_MALLOC_WILL_BE_REMOVED(ElementShadow);
 public:
     static PassOwnPtrWillBeRawPtr<ElementShadow> create();
     ~ElementShadow();
 
     Element* host() const;
     ShadowRoot& youngestShadowRoot() const { ASSERT(m_shadowRoots.head()); return *m_shadowRoots.head(); }
     ShadowRoot* oldestShadowRoot() const { return m_shadowRoots.tail(); }
     ElementShadow* containingShadow() const;
 
+    ShadowRoot* shadowRootIfV1() const
+    {
+        if (isV1())
+            return &youngestShadowRoot();
+        return nullptr;
+    }
+
+    HTMLSlotElement* assignedSlotFor(const Node& node) const
+    {
+        ASSERT(m_slotAssignment);
+        return m_slotAssignment->assignedSlotFor(node);
+    }
+
     ShadowRoot& addShadowRoot(Element& shadowHost, ShadowRootType);
 
     bool hasSameStyles(const ElementShadow*) const;
 
     void attach(const Node::AttachContext&);
     void detach(const Node::AttachContext&);
 
     void willAffectSelector();
     const SelectRuleFeatureSet& ensureSelectFeatureSet();
 
     void distributeIfNeeded();
     void setNeedsDistributionRecalc();
 
     const InsertionPoint* finalDestinationInsertionPointFor(const Node*) const;
     const DestinationInsertionPoints* destinationInsertionPointsFor(const Node*) const;
 
     void didDistributeNode(const Node*, InsertionPoint*);
 
+    bool isV1() const { return youngestShadowRoot().isV1(); };
+
     DECLARE_TRACE();
 
 private:
     ElementShadow();
 
 #if !ENABLE(OILPAN)
     void removeDetachedShadowRoots();
 #endif
 
     void distribute();
     void clearDistribution();
 
     void distributeV0();
     void distributeV1();
 
     void collectSelectFeatureSetFrom(ShadowRoot&);
     void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*);
 
     bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; }
     void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; }
 
-    bool isV1() const { return youngestShadowRoot().type() == ShadowRootType::Open || youngestShadowRoot().type() == ShadowRootType::Closed; };
-
 #if ENABLE(OILPAN)
     // The cost of |new| in Oilpan is lower than non-Oilpan.  We should reduce
     // the size of HashMap entry.
     typedef HeapHashMap<Member<const Node>, Member<DestinationInsertionPoints>> NodeToDestinationInsertionPoints;
 #else
     typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationInsertionPoints;
 #endif
     NodeToDestinationInsertionPoints m_nodeToInsertionPoints;
 
     SelectRuleFeatureSet m_selectFeatures;
     // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>.
     DoublyLinkedList<ShadowRoot> m_shadowRoots;
     bool m_needsDistributionRecalc;
     bool m_needsSelectFeatureSet;
+
+    // TODO(hayato): ShadowRoot should be an owner of SlotAssigment
+    OwnPtr<SlotAssignment> m_slotAssignment;
 };
 
 inline Element* ElementShadow::host() const
 {
     ASSERT(!m_shadowRoots.isEmpty());
     return youngestShadowRoot().host();
 }
 
 inline ShadowRoot* Node::youngestShadowRoot() const
 {
     if (!isElementNode())
         return 0;
     return toElement(this)->youngestShadowRoot();
 }
 
 inline ShadowRoot* Element::youngestShadowRoot() const
 {
     if (ElementShadow* shadow = this->shadow())
         return &shadow->youngestShadowRoot();
     return 0;
 }
 
+inline ShadowRoot* Element::shadowRootIfV1() const
+{
+    if (ElementShadow* shadow = this->shadow())
+        return shadow->shadowRootIfV1();
+    return nullptr;
+}
+
 inline ElementShadow* ElementShadow::containingShadow() const
 {
     if (ShadowRoot* parentRoot = host()->containingShadowRoot())
         return parentRoot->owner();
     return 0;
 }
 
 inline void ElementShadow::distributeIfNeeded()
 {
     if (m_needsDistributionRecalc)
         distribute();
     m_needsDistributionRecalc = false;
 }
 
 } // namespace
 
 #endif