Move rendering/RenderObject to layout/LayoutObject.

Source/core/dom/NodeRenderingTraversal.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 "config.h"
 #include "core/dom/NodeRenderingTraversal.h"
 
 #include "core/HTMLNames.h"
 #include "core/dom/PseudoElement.h"
 #include "core/dom/shadow/ComposedTreeTraversal.h"
-#include "core/rendering/RenderObject.h"
+#include "core/layout/LayoutObject.h"
 
 namespace blink {
 
 namespace NodeRenderingTraversal {
 
-static bool isRendererReparented(const RenderObject* renderer)
+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)
 {
@@ skipping 168 matching lines @@
     return nextAncestorSibling(node, stayWithin);
 }
 
 Node* next(const Node& node, const Node* stayWithin)
 {
     if (Node* child = pseudoAwareFirstChild(node))
         return child;
     return nextSkippingChildren(node, stayWithin);
 }
 
-RenderObject* nextSiblingRenderer(const Node& node)
+LayoutObject* nextSiblingRenderer(const Node& node)
 {
     for (Node* sibling = NodeRenderingTraversal::nextSibling(node); sibling; sibling = NodeRenderingTraversal::nextSibling(*sibling)) {
-        RenderObject* renderer = sibling->renderer();
+        LayoutObject* renderer = sibling->renderer();
         if (renderer && !isRendererReparented(renderer))
             return renderer;
     }
     return 0;
 }
 
-RenderObject* previousSiblingRenderer(const Node& node)
+LayoutObject* previousSiblingRenderer(const Node& node)
 {
     for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(*sibling)) {
-        RenderObject* renderer = sibling->renderer();
+        LayoutObject* renderer = sibling->renderer();
         if (renderer && !isRendererReparented(renderer))
             return renderer;
     }
     return 0;
 }
 
-RenderObject* nextInTopLayer(const Element& element)
+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 (RenderObject* renderer = topLayerElements[i]->renderer())
+        if (LayoutObject* renderer = topLayerElements[i]->renderer())
             return renderer;
     }
     return 0;
 }
 
 }
 
 } // namespace