Call Element::rebuildLayoutTree from Document::updateStyle directly

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 88 matching lines @@
   distributedNodes.clear();
   m_distributedNodes.shrinkToFit();
 }
 
 void InsertionPoint::attachLayoutTree(const AttachContext& context) {
   // We need to attach the distribution here so that they're inserted in the
   // right order otherwise the n^2 protection inside LayoutTreeBuilder will
   // cause them to be inserted in the wrong place later. This also lets
   // distributed nodes benefit from the n^2 protection.
   for (size_t i = 0; i < m_distributedNodes.size(); ++i) {
-    if (m_distributedNodes.at(i)->needsAttach())
+    if (m_distributedNodes.at(i)->needsReattachLayoutTree())
       m_distributedNodes.at(i)->attachLayoutTree(context);
   }
 
   HTMLElement::attachLayoutTree(context);
 }
 
 void InsertionPoint::detachLayoutTree(const AttachContext& context) {
   for (size_t i = 0; i < m_distributedNodes.size(); ++i)
     m_distributedNodes.at(i)->lazyReattachIfAttached();
 
@@ skipping 176 matching lines @@
     if (!insertionPoints)
       return;
     for (size_t i = 0; i < insertionPoints->size(); ++i)
       results.append(insertionPoints->at(i).get());
     DCHECK_NE(current, insertionPoints->back().get());
     current = insertionPoints->back().get();
   }
 }
 
 }  // namespace blink