Remove the forced layout in getComputedStyle for elements in Shadow DOM

third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.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 137 matching lines @@
 ContainerNode* ComposedTreeTraversal::traverseParent(const Node& node, ParentTraversalDetails* details)
 {
     // TODO(hayato): Stop this hack for a pseudo element because a pseudo element is not a child of its parentOrShadowHostNode() in a composed tree.
     if (node.isPseudoElement())
         return node.parentOrShadowHostNode();
 
     if (node.isChildOfV1ShadowHost()) {
         HTMLSlotElement* slot = finalDestinationSlotFor(node);
         if (!slot)
             return nullptr;
-        return traverseParent(*slot);
+        return traverseParent(*slot, details);
     }
 
     Element* parent = node.parentElement();
     if (parent && isHTMLSlotElement(parent)) {
         HTMLSlotElement& slot = toHTMLSlotElement(*parent);
         if (!slot.getAssignedNodes().isEmpty())
             return nullptr;
         return traverseParent(slot, details);
     }
 
     if (canBeDistributedToInsertionPoint(node))
         return traverseParentForV0(node, details);
 
     ASSERT(!shadowWhereNodeCanBeDistributed(node));
-    return traverseParentOrHost(node);
+    return traverseParentOrHost(node, details);
 }
 
 ContainerNode* ComposedTreeTraversal::traverseParentForV0(const Node& node, ParentTraversalDetails* details)
 {
     if (shadowWhereNodeCanBeDistributed(node)) {
         if (const InsertionPoint* insertionPoint = resolveReprojection(&node)) {
             if (details)
-                details->didTraverseInsertionPoint(insertionPoint);
+                details->didTraverseInsertionPoint();
             // The node is distributed. But the distribution was stopped at this insertion point.
             if (shadowWhereNodeCanBeDistributed(*insertionPoint))
                 return nullptr;
-            return traverseParent(*insertionPoint);
+            return traverseParent(*insertionPoint, details);
         }
         return nullptr;
     }
-    ContainerNode* parent = traverseParentOrHost(node);
+    ContainerNode* parent = traverseParentOrHost(node, details);
     if (isActiveInsertionPoint(*parent))
         return nullptr;
     return parent;
 }
 
-ContainerNode* ComposedTreeTraversal::traverseParentOrHost(const Node& node)
+ContainerNode* ComposedTreeTraversal::traverseParentOrHost(const Node& node, ParentTraversalDetails* details)
 {
     ContainerNode* parent = node.parentNode();
     if (!parent)
         return nullptr;
     if (!parent->isShadowRoot())
         return parent;
     ShadowRoot* shadowRoot = toShadowRoot(parent);
+    if (details)
+        details->didTraverseShadowRoot(shadowRoot);
     ASSERT(!shadowRoot->shadowInsertionPointOfYoungerShadowRoot());
     if (!shadowRoot->isYoungest())
         return nullptr;
     return shadowRoot->host();
 }
 
 Node* ComposedTreeTraversal::childAt(const Node& node, unsigned index)
 {
     assertPrecondition(node);
     Node* child = traverseFirstChild(node);
@@ skipping 139 matching lines @@
 Node& ComposedTreeTraversal::lastWithinOrSelf(const Node& node)
 {
     assertPrecondition(node);
     Node* lastDescendant = lastWithin(node);
     Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node);
     assertPostcondition(&result);
     return result;
 }
 
 } // namespace blink