Support slotchange event

third_party/WebKit/Source/core/dom/shadow/InsertionPoint.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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 18 matching lines @@
  */
 
 #include "core/dom/shadow/InsertionPoint.h"
 
 #include "core/HTMLNames.h"
 #include "core/dom/Document.h"
 #include "core/dom/ElementTraversal.h"
 #include "core/dom/QualifiedName.h"
 #include "core/dom/StaticNodeList.h"
 #include "core/dom/StyleChangeReason.h"
+#include "core/dom/StyleEngine.h"
 #include "core/dom/shadow/ElementShadow.h"
 
 namespace blink {
 
 using namespace HTMLNames;
 
 InsertionPoint::InsertionPoint(const QualifiedName& tagName, Document& document)
     : HTMLElement(tagName, document, CreateInsertionPoint)
     , m_registeredWithShadowRoot(false)
 {
@@ skipping 132 matching lines @@
 
 bool InsertionPoint::layoutObjectIsNeeded(const ComputedStyle& style)
 {
     return !isActive() && HTMLElement::layoutObjectIsNeeded(style);
 }
 
 void InsertionPoint::childrenChanged(const ChildrenChange& change)
 {
     HTMLElement::childrenChanged(change);
     if (ShadowRoot* root = containingShadowRoot()) {
-        if (ElementShadow* rootOwner = root->owner())
+        if (ElementShadow* rootOwner = root->owner()) {
             rootOwner->setNeedsDistributionRecalc();
+            if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1)
+                document().updateAssignment();
+        }
     }
 }
 
 Node::InsertionNotificationRequest InsertionPoint::insertedInto(ContainerNode* insertionPoint)
 {
     HTMLElement::insertedInto(insertionPoint);
     if (ShadowRoot* root = containingShadowRoot()) {
         if (ElementShadow* rootOwner = root->owner()) {
             rootOwner->setNeedsDistributionRecalc();
+            if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1)
+                document().updateAssignment();
             if (canBeActive() && !m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
                 m_registeredWithShadowRoot = true;
                 root->didAddInsertionPoint(this);
                 if (canAffectSelector())
                     rootOwner->willAffectSelector();
             }
         }
     }
 
     // We could have been distributed into in a detached subtree, make sure to
     // clear the distribution when inserted again to avoid cycles.
     clearDistribution();
 
     return InsertionDone;
 }
 
 void InsertionPoint::removedFrom(ContainerNode* insertionPoint)
 {
     ShadowRoot* root = containingShadowRoot();
     if (!root)
         root = insertionPoint->containingShadowRoot();
 
     if (root) {
-        if (ElementShadow* rootOwner = root->owner())
+        if (ElementShadow* rootOwner = root->owner()) {
             rootOwner->setNeedsDistributionRecalc();
+            if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1)
+                document().updateAssignment();
+        }
     }
 
     // host can be null when removedFrom() is called from ElementShadow destructor.
     ElementShadow* rootOwner = root ? root->owner() : 0;
 
     // Since this insertion point is no longer visible from the shadow subtree, it need to clean itself up.
     clearDistribution();
 
     if (m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
         DCHECK(root);
@@ skipping 48 matching lines @@
         if (!insertionPoints)
             return;
         for (size_t i = 0; i < insertionPoints->size(); ++i)
             results.append(insertionPoints->at(i).get());
         DCHECK_NE(current, insertionPoints->last().get());
         current = insertionPoints->last().get();
     }
 }
 
 } // namespace blink