Remove needsShadowTreeWalker flag

Source/core/dom/NodeRenderingTraversal.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 29 matching lines @@
         m_insertionPoint = insertionPoint;
         m_resetStyleInheritance  = m_resetStyleInheritance || insertionPoint->resetStyleInheritance();
     }
 }
 
 void ParentDetails::didTraverseShadowRoot(const ShadowRoot* root)
 {
     m_resetStyleInheritance  = m_resetStyleInheritance || root->resetStyleInheritance();
 }
 
-ContainerNode* parentSlow(const Node* node, ParentDetails* details)
+ContainerNode* parent(const Node* node, ParentDetails* details)
 {
     ComposedShadowTreeWalker walker(node, ComposedShadowTreeWalker::CrossUpperBoundary, ComposedShadowTreeWalker::CanStartFromShadowBoundary);
     ContainerNode* found = toContainerNode(walker.traverseParent(walker.get(), details));
     return details->outOfComposition() ? 0 : found;
 }
 
-Node* nextSiblingSlow(const Node* node)
+Node* nextSibling(const Node* node)
 {
     ComposedShadowTreeWalker walker(node);
     if (node->isBeforePseudoElement()) {
         walker.parent();
         walker.firstChild();
     } else
         walker.nextSibling();
 
     if (walker.get() || node->isAfterPseudoElement())
         return walker.get();
 
     Node* parent = walker.traverseParent(node);
     if (parent && parent->isElementNode())
         return toElement(parent)->pseudoElement(AFTER);
 
     return 0;
 }
 
-Node* previousSiblingSlow(const Node* node)
+Node* previousSibling(const Node* node)
 {
     ComposedShadowTreeWalker walker(node);
     if (node->isAfterPseudoElement()) {
         walker.parent();
         walker.lastChild();
     } else
         walker.previousSibling();
 
     if (walker.get() || node->isBeforePseudoElement())
         return walker.get();
@@ skipping 29 matching lines @@
 Node* lastChildInScope(const Node* node)
 {
     ComposedShadowTreeWalker walker = ComposedShadowTreeWalker(node, ComposedShadowTreeWalker::DoNotCrossUpperBoundary);
     walker.lastChild();
     return walker.get();
 }
 
 }
 
 } // namespace