Add ASSERT childNeedsDistributionRecalc in ComposedTreeTraversal

Source/core/dom/shadow/ComposedTreeTraversal.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
  * contributors may be used to endorse or promote products derived from
  * this software without specific prior written permission.
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #ifndef ComposedTreeTraversal_h
 #define ComposedTreeTraversal_h
 
+#include "core/dom/Document.h"
 #include "core/dom/NodeRenderingTraversal.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include "core/dom/shadow/ShadowRoot.h"
 
 namespace blink {
 
 class ContainerNode;
 class Node;
 
 // FIXME: Make some functions inline to optimise the performance.
@@ skipping 15 matching lines @@
 
 private:
     enum TraversalDirection {
         TraversalDirectionForward,
         TraversalDirectionBackward
     };
 
     static void assertPrecondition(const Node& node)
     {
 #if ENABLE(ASSERT)
+        ASSERT(!node.document().childNeedsDistributionRecalc());
         ASSERT(node.canParticipateInComposedTree());
 #endif
     }
 
     static void assertPostcondition(const Node* node)
     {
 #if ENABLE(ASSERT)
         if (node)
             assertPrecondition(*node);
 #endif
@@ skipping 118 matching lines @@
 }
 
 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node)
 {
     return traverseChild(node, TraversalDirectionBackward);
 }
 
 } // namespace
 
 #endif