Remove HTMLShadowElement.

sky/engine/core/dom/shadow/ElementShadow.cpp

 /*
  * 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 15 matching lines @@
 
 #include "config.h"
 #include "core/dom/shadow/ElementShadow.h"
 
 #include "core/css/StyleSheetList.h"
 #include "core/dom/Document.h"
 #include "core/dom/ElementTraversal.h"
 #include "core/dom/NodeTraversal.h"
 #include "core/dom/shadow/ContentDistribution.h"
 #include "core/html/HTMLContentElement.h"
-#include "core/html/HTMLShadowElement.h"
 #include "platform/EventDispatchForbiddenScope.h"
 #include "platform/ScriptForbiddenScope.h"
 
 namespace blink {
 
 class DistributionPool final {
     STACK_ALLOCATED();
 public:
     explicit DistributionPool(const ContainerNode&);
     void clear();
@@ skipping 196 matching lines @@
 const DestinationInsertionPoints* ElementShadow::destinationInsertionPointsFor(const Node* key) const
 {
     ASSERT(key && !key->document().childNeedsDistributionRecalc());
     NodeToDestinationInsertionPoints::const_iterator it = m_nodeToInsertionPoints.find(key);
     return it == m_nodeToInsertionPoints.end() ? 0: &it->value;
 }
 
 void ElementShadow::distribute()
 {
     host()->setNeedsStyleRecalc(SubtreeStyleChange);
-    Vector<RawPtr<HTMLShadowElement>, 32> shadowInsertionPoints;
     DistributionPool pool(*host());
 
     for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {
-        HTMLShadowElement* shadowInsertionPoint = 0;
         const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->descendantInsertionPoints();
         for (size_t i = 0; i < insertionPoints.size(); ++i) {
             InsertionPoint* point = insertionPoints[i].get();
             if (!point->isActive())
                 continue;
-            if (isHTMLShadowElement(*point)) {
-                ASSERT(!shadowInsertionPoint);
-                shadowInsertionPoint = toHTMLShadowElement(point);
-                shadowInsertionPoints.append(shadowInsertionPoint);
-            } else {
-                pool.distributeTo(point, this);
-                if (ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*point))
-                    shadow->setNeedsDistributionRecalc();
-            }
+            pool.distributeTo(point, this);
+            if (ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*point))
+                shadow->setNeedsDistributionRecalc();
         }
     }
-
-    for (size_t i = shadowInsertionPoints.size(); i > 0; --i) {
-        HTMLShadowElement* shadowInsertionPoint = shadowInsertionPoints[i - 1];
-        ShadowRoot* root = shadowInsertionPoint->containingShadowRoot();
-        ASSERT(root);
-        if (root->isOldest()) {
-            pool.distributeTo(shadowInsertionPoint, this);
-        } else {
-            DistributionPool olderShadowRootPool(*root->olderShadowRoot());
-            olderShadowRootPool.distributeTo(shadowInsertionPoint, this);
-            root->olderShadowRoot()->setShadowInsertionPointOfYoungerShadowRoot(shadowInsertionPoint);
-        }
-        if (ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*shadowInsertionPoint))
-            shadow->setNeedsDistributionRecalc();
-    }
 }
 
 void ElementShadow::didDistributeNode(const Node* node, InsertionPoint* insertionPoint)
 {
     NodeToDestinationInsertionPoints::AddResult result = m_nodeToInsertionPoints.add(node, DestinationInsertionPoints());
     result.storedValue->value.append(insertionPoint);
 }
 
 const SelectRuleFeatureSet& ElementShadow::ensureSelectFeatureSet()
 {
@@ skipping 31 matching lines @@
         if (shadow->needsSelectFeatureSet())
             break;
         shadow->setNeedsSelectFeatureSet();
     }
     setNeedsDistributionRecalc();
 }
 
 void ElementShadow::clearDistribution()
 {
     m_nodeToInsertionPoints.clear();
-
-    for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot())
-        root->setShadowInsertionPointOfYoungerShadowRoot(nullptr);
 }
 
 void ElementShadow::trace(Visitor* visitor)
 {
 #if ENABLE(OILPAN)
     visitor->trace(m_nodeToInsertionPoints);
     visitor->trace(m_selectFeatures);
     // Shadow roots are linked with previous and next pointers which are traced.
     // It is therefore enough to trace one of the shadow roots here and the
     // rest will be traced from there.
     visitor->trace(m_shadowRoots.head());
 #endif
 }
 
 } // namespace