Use the sibling limit to decide whether to create layout for whitespace

third_party/WebKit/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
@@ skipping 196 matching lines @@
     return nextNode;
   return nextAncestorSibling(node, stayWithin);
 }
 
 Node* next(const Node& node, const Node* stayWithin) {
   if (Node* child = pseudoAwareFirstChild(node))
     return child;
   return nextSkippingChildren(node, stayWithin);
 }
 
-LayoutObject* nextSiblingLayoutObject(const Node& node) {
-  for (Node* sibling = LayoutTreeBuilderTraversal::nextSibling(node); sibling;
+LayoutObject* nextSiblingLayoutObject(const Node& node, int32_t limit) {
+  DCHECK(limit == kTraverseAllSiblings || limit >= 0) << limit;
+  for (Node* sibling = LayoutTreeBuilderTraversal::nextSibling(node);
+       sibling && limit-- != 0;
        sibling = LayoutTreeBuilderTraversal::nextSibling(*sibling)) {
     LayoutObject* layoutObject = sibling->layoutObject();
     if (layoutObject && !isLayoutObjectReparented(layoutObject))
       return layoutObject;
   }
   return 0;
 }
 
-LayoutObject* previousSiblingLayoutObject(const Node& node) {
+LayoutObject* previousSiblingLayoutObject(const Node& node, int32_t limit) {
+  DCHECK(limit == kTraverseAllSiblings || limit >= 0) << limit;
   for (Node* sibling = LayoutTreeBuilderTraversal::previousSibling(node);
-       sibling;
+       sibling && limit-- != 0;
        sibling = LayoutTreeBuilderTraversal::previousSibling(*sibling)) {
     LayoutObject* layoutObject = sibling->layoutObject();
     if (layoutObject && !isLayoutObjectReparented(layoutObject))
       return layoutObject;
   }
   return 0;
 }
 
 LayoutObject* nextInTopLayer(const Element& element) {
   if (!element.isInTopLayer())
     return 0;
   const HeapVector<Member<Element>>& topLayerElements =
       element.document().topLayerElements();
   size_t position = topLayerElements.find(&element);
   DCHECK_NE(position, kNotFound);
   for (size_t i = position + 1; i < topLayerElements.size(); ++i) {
     if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject())
       return layoutObject;
   }
   return 0;
 }
 
 }  // namespace LayoutTreeBuilderTraversal
 
 }  // namespace blink