Rename NodeRenderingTraversal to LayoutTreeBuilderTraversal

Source/core/dom/LayoutTreeBuilderTraversal.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
  * 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.
  */
 
 #include "config.h"
-#include "core/dom/NodeRenderingTraversal.h"
+#include "core/dom/LayoutTreeBuilderTraversal.h"
 
 #include "core/HTMLNames.h"
 #include "core/dom/PseudoElement.h"
 #include "core/dom/shadow/ComposedTreeTraversal.h"
 #include "core/layout/LayoutObject.h"
 
 namespace blink {
 
-namespace NodeRenderingTraversal {
+namespace LayoutTreeBuilderTraversal {
 
 static bool isRendererReparented(const LayoutObject* renderer)
 {
     if (!renderer->node()->isElementNode())
         return false;
     if (toElement(renderer->node())->isInTopLayer())
         return true;
     return false;
 }
 
 void ParentDetails::didTraverseInsertionPoint(const InsertionPoint* insertionPoint)
 {
     if (!m_insertionPoint) {
         m_insertionPoint = insertionPoint;
     }
 }
 
 ContainerNode* parent(const Node& node, ParentDetails* details)
 {
-    // TODO(hayato): Uncomment this once we can be sure NodeRenderingTraversal is used only for a node in a document.
-    // ASSERT(node.inDocument());
+    ASSERT(node.inDocument() ? !node.document().childNeedsDistributionRecalc() : !node.childNeedsDistributionRecalc());

[hayato, 2015/04/15 10:36:11]

Looks this is the result of wrong rebase, which is unintentional.

Let me fix this in follow-up CL.

+    ASSERT(!node.isShadowRoot());
+    if (isActiveInsertionPoint(node))
+        return 0;
     return ComposedTreeTraversal::parent(node, details);
 }
 
 bool contains(const ContainerNode& container, const Node& node)
 {
-    for (const Node* current = &node; current; current = NodeRenderingTraversal::parent(*current)) {
+    for (const Node* current = &node; current; current = LayoutTreeBuilderTraversal::parent(*current)) {
         if (current == &container)
             return true;
     }
     return false;
 }
 
 Node* nextSibling(const Node& node)
 {
     if (node.isBeforePseudoElement()) {
         if (Node* next = ComposedTreeTraversal::firstChild(*ComposedTreeTraversal::parent(node)))
@@ skipping 143 matching lines @@
 
 Node* next(const Node& node, const Node* stayWithin)
 {
     if (Node* child = pseudoAwareFirstChild(node))
         return child;
     return nextSkippingChildren(node, stayWithin);
 }
 
 LayoutObject* nextSiblingRenderer(const Node& node)
 {
-    for (Node* sibling = NodeRenderingTraversal::nextSibling(node); sibling; sibling = NodeRenderingTraversal::nextSibling(*sibling)) {
+    for (Node* sibling = LayoutTreeBuilderTraversal::nextSibling(node); sibling; sibling = LayoutTreeBuilderTraversal::nextSibling(*sibling)) {
         LayoutObject* renderer = sibling->layoutObject();
         if (renderer && !isRendererReparented(renderer))
             return renderer;
     }
     return 0;
 }
 
 LayoutObject* previousSiblingRenderer(const Node& node)
 {
-    for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(*sibling)) {
+    for (Node* sibling = LayoutTreeBuilderTraversal::previousSibling(node); sibling; sibling = LayoutTreeBuilderTraversal::previousSibling(*sibling)) {
         LayoutObject* renderer = sibling->layoutObject();
         if (renderer && !isRendererReparented(renderer))
             return renderer;
     }
     return 0;
 }
 
 LayoutObject* nextInTopLayer(const Element& element)
 {
     if (!element.isInTopLayer())
         return 0;
     const WillBeHeapVector<RefPtrWillBeMember<Element>>& topLayerElements = element.document().topLayerElements();
     size_t position = topLayerElements.find(&element);
     ASSERT(position != kNotFound);
     for (size_t i = position + 1; i < topLayerElements.size(); ++i) {
         if (LayoutObject* renderer = topLayerElements[i]->layoutObject())
             return renderer;
     }
     return 0;
 }
 
 }
 
 } // namespace