Remove remaining HTML elements

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 12 matching lines @@
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #include "sky/engine/core/dom/shadow/ElementShadow.h"
 
 #include "sky/engine/core/dom/Document.h"
 #include "sky/engine/core/dom/ElementTraversal.h"
 #include "sky/engine/core/dom/NodeTraversal.h"
 #include "sky/engine/core/dom/shadow/ContentDistribution.h"
-#include "sky/engine/core/html/HTMLContentElement.h"
 #include "sky/engine/platform/EventDispatchForbiddenScope.h"
 #include "sky/engine/platform/ScriptForbiddenScope.h"
 
 namespace blink {
 
 class DistributionPool final {
     STACK_ALLOCATED();
 public:
     explicit DistributionPool(const ContainerNode&);
     void clear();
@@ skipping 36 matching lines @@
 }
 
 void DistributionPool::distributeTo(InsertionPoint* insertionPoint, ElementShadow* elementShadow)
 {
     ContentDistribution distribution;
 
     for (size_t i = 0; i < m_nodes.size(); ++i) {
         if (m_distributed[i])
             continue;
 
-        if (isHTMLContentElement(*insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))
-            continue;
-
         Node* node = m_nodes[i];
         distribution.append(node);
         elementShadow->didDistributeNode(node, insertionPoint);
         m_distributed[i] = true;
     }
 
     // Distributes fallback elements
     if (insertionPoint->isContentInsertionPoint() && distribution.isEmpty()) {
         for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling()) {
             distribution.append(fallbackNode);
@@ skipping 161 matching lines @@
 }
 
 void ElementShadow::collectSelectFeatureSetFrom(ShadowRoot& root)
 {
     if (!root.containsShadowRoots() && !root.containsContentElements())
         return;
 
     for (Element* element = ElementTraversal::firstWithin(root); element; element = ElementTraversal::next(*element, &root)) {
         if (ElementShadow* shadow = element->shadow())
             m_selectFeatures.add(shadow->ensureSelectFeatureSet());
-        if (!isHTMLContentElement(*element))
-            continue;
-        const CSSSelectorList& list = toHTMLContentElement(*element).selectorList();
-        for (const CSSSelector* selector = list.first(); selector; selector = CSSSelectorList::next(*selector)) {
-            for (const CSSSelector* component = selector; component; component = component->tagHistory())
-                m_selectFeatures.collectFeaturesFromSelector(*component);
-        }
     }
 }
 
 void ElementShadow::willAffectSelector()
 {
     for (ElementShadow* shadow = this; shadow; shadow = shadow->containingShadow()) {
         if (shadow->needsSelectFeatureSet())
             break;
         shadow->setNeedsSelectFeatureSet();
     }
     setNeedsDistributionRecalc();
 }
 
 void ElementShadow::clearDistribution()
 {
     m_nodeToInsertionPoints.clear();
 }
 
 } // namespace