Rebuild layout tree in flat tree order.

third_party/WebKit/Source/core/dom/shadow/InsertionPoint.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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 103 matching lines @@
   HTMLElement::AttachLayoutTree(context);
 }
 
 void InsertionPoint::DetachLayoutTree(const AttachContext& context) {
   for (size_t i = 0; i < distributed_nodes_.size(); ++i)
     distributed_nodes_.at(i)->LazyReattachIfAttached();
 
   HTMLElement::DetachLayoutTree(context);
 }
 
+void InsertionPoint::RebuildDistributedChildrenLayoutTrees() {
+  Text* next_text_sibling = nullptr;
+  // This loop traverses the nodes from right to left for the same reason as the
+  // one described in ContainerNode::RebuildChildrenLayoutTrees().
+  for (size_t i = distributed_nodes_.size(); i > 0; --i)
+    RebuildLayoutTreeForChild(distributed_nodes_.at(i - 1), next_text_sibling);
+}
+
 void InsertionPoint::WillRecalcStyle(StyleRecalcChange change) {
   StyleChangeType style_change_type = kNoStyleChange;
 
   if (change > kInherit || GetStyleChangeType() > kLocalStyleChange)
     style_change_type = kSubtreeStyleChange;
   else if (change > kNoInherit)
     style_change_type = kLocalStyleChange;
   else
     return;
 
@@ skipping 160 matching lines @@
     if (!insertion_points)
       return;
     for (size_t i = 0; i < insertion_points->size(); ++i)
       results.push_back(insertion_points->at(i).Get());
     DCHECK_NE(current, insertion_points->back().Get());
     current = insertion_points->back().Get();
   }
 }
 
 }  // namespace blink