Introduce Node::needsDistributionRecalc and use it in ElementShadow to fix the wrong assertions.

Source/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 222 matching lines @@
         }
         root = root->olderShadowRoot();
         otherRoot = otherRoot->olderShadowRoot();
     }
 
     return true;
 }
 
 const InsertionPoint* ElementShadow::finalDestinationInsertionPointFor(const Node* key) const
 {
-    ASSERT(key && !key->document().childNeedsDistributionRecalc());
+    ASSERT(key && !key->needsDistributionRecalc());
     NodeToDestinationInsertionPoints::const_iterator it = m_nodeToInsertionPoints.find(key);
 #if ENABLE(OILPAN)
     return it == m_nodeToInsertionPoints.end() ? nullptr : it->value->last().get();
 #else
     return it == m_nodeToInsertionPoints.end() ? nullptr : it->value.last().get();
 #endif
 }
 
 const DestinationInsertionPoints* ElementShadow::destinationInsertionPointsFor(const Node* key) const
 {
-    ASSERT(key && !key->document().childNeedsDistributionRecalc());
+    ASSERT(key && !key->needsDistributionRecalc());
     NodeToDestinationInsertionPoints::const_iterator it = m_nodeToInsertionPoints.find(key);
 #if ENABLE(OILPAN)
     return it == m_nodeToInsertionPoints.end() ? nullptr : it->value.get();
 #else
     return it == m_nodeToInsertionPoints.end() ? nullptr : &it->value;
 #endif
 }
 
 void ElementShadow::distribute()
 {
@@ skipping 112 matching lines @@
     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