Renamed Node::attach to Node::attachLayoutTree.

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 80 matching lines @@
     for ( ; j < distributedNodes.size(); ++j)
         distributedNodes.at(j)->lazyReattachIfAttached();
 
     m_distributedNodes.swap(distributedNodes);
     // Deallocate a Vector and a HashMap explicitly so that
     // Oilpan can recycle them without an intervening GC.
     distributedNodes.clear();
     m_distributedNodes.shrinkToFit();
 }
 
-void InsertionPoint::attach(const AttachContext& context)
+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())
-            m_distributedNodes.at(i)->attach(context);
+            m_distributedNodes.at(i)->attachLayoutTree(context);
     }
 
-    HTMLElement::attach(context);
+    HTMLElement::attachLayoutTree(context);
 }
 
 void InsertionPoint::detach(const AttachContext& context)
 {
     for (size_t i = 0; i < m_distributedNodes.size(); ++i)
         m_distributedNodes.at(i)->lazyReattachIfAttached();
 
     HTMLElement::detach(context);
 }
 
@@ skipping 162 matching lines @@
         if (!insertionPoints)
             return;
         for (size_t i = 0; i < insertionPoints->size(); ++i)
             results.append(insertionPoints->at(i).get());
         DCHECK_NE(current, insertionPoints->last().get());
         current = insertionPoints->last().get();
     }
 }
 
 } // namespace blink