Rebuild layout tree in flat tree order.

third_party/WebKit/Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All
  * rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved.
  * (http://www.torchmobile.com/)
  *
@@ skipping 751 matching lines @@
   node_flags_ = (node_flags_ & ~kStyleChangeMask) | change_type;
 }
 
 void Node::MarkAncestorsWithChildNeedsStyleRecalc() {
   for (ContainerNode* p = ParentOrShadowHostNode();
        p && !p->ChildNeedsStyleRecalc(); p = p->ParentOrShadowHostNode())
     p->SetChildNeedsStyleRecalc();
   GetDocument().ScheduleLayoutTreeUpdateIfNeeded();
 }
 
+static ContainerNode* GetReattachParent(Node& node) {
+  if (node.IsPseudoElement())
+    return node.ParentOrShadowHostNode();
+  if (node.IsChildOfV1ShadowHost()) {
+    if (HTMLSlotElement* slot = node.FinalDestinationSlot())
+      return slot;
+  }
+  if (node.IsInV0ShadowTree() || node.IsChildOfV0ShadowHost()) {
+    if (ShadowWhereNodeCanBeDistributedForV0(node)) {
+      if (InsertionPoint* insertion_point =
+              const_cast<InsertionPoint*>(ResolveReprojection(&node))) {
+        return insertion_point;
+      }
+    }
+  }
+  return node.ParentOrShadowHostNode();
+}
+
 void Node::MarkAncestorsWithChildNeedsReattachLayoutTree() {
-  for (ContainerNode* p = ParentOrShadowHostNode();
-       p && !p->ChildNeedsReattachLayoutTree(); p = p->ParentOrShadowHostNode())
+  for (ContainerNode* p = GetReattachParent(*this);
+       p && !p->ChildNeedsReattachLayoutTree(); p = GetReattachParent(*p))
     p->SetChildNeedsReattachLayoutTree();
 }
 
 void Node::SetNeedsReattachLayoutTree() {
   DCHECK(GetDocument().InStyleRecalc());
   DCHECK(!GetDocument().ChildNeedsDistributionRecalc());
   SetFlag(kNeedsReattachLayoutTree);
   MarkAncestorsWithChildNeedsReattachLayoutTree();
 }
 
@@ skipping 1599 matching lines @@
 }
 
 HTMLSlotElement* Node::AssignedSlot() const {
   // assignedSlot doesn't need to call updateDistribution().
   DCHECK(!IsPseudoElement());
   if (ShadowRoot* root = V1ShadowRootOfParent())
     return root->AssignedSlotFor(*this);
   return nullptr;
 }
 
+HTMLSlotElement* Node::FinalDestinationSlot() const {
+  HTMLSlotElement* slot = AssignedSlot();
+  if (!slot)
+    return nullptr;
+  for (HTMLSlotElement* next = slot->AssignedSlot(); next;
+       next = next->AssignedSlot()) {
+    slot = next;
+  }
+  return slot;
+}
+
 HTMLSlotElement* Node::assignedSlotForBinding() {
   // assignedSlot doesn't need to call updateDistribution().
   if (ShadowRoot* root = V1ShadowRootOfParent()) {
     if (root->GetType() == ShadowRootType::kOpen)
       return root->AssignedSlotFor(*this);
   }
   return nullptr;
 }
 
 void Node::SetFocused(bool flag, WebFocusType focus_type) {
@@ skipping 189 matching lines @@
   if (node) {
     std::stringstream stream;
     node->PrintNodePathTo(stream);
     LOG(INFO) << stream.str();
   } else {
     LOG(INFO) << "Cannot showNodePath for <null>";
   }
 }
 
 #endif