Clarify a role of Shadow DOM related functions

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 247 matching lines @@
     HTMLElement::trace(visitor);
 }
 
 const InsertionPoint* resolveReprojection(const Node* projectedNode)
 {
     DCHECK(projectedNode);
     const InsertionPoint* insertionPoint = 0;
     const Node* current = projectedNode;
     ElementShadow* lastElementShadow = 0;
     while (true) {
-        ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*current);
-        if (!shadow || shadow == lastElementShadow)
+        ElementShadow* shadow = shadowWhereNodeCanBeDistributedForV0(*current);
+        if (!shadow || shadow->isV1() || shadow == lastElementShadow)
             break;
         lastElementShadow = shadow;
         const InsertionPoint* insertedTo = shadow->finalDestinationInsertionPointFor(projectedNode);
         if (!insertedTo)
             break;
         DCHECK_NE(current, insertedTo);
         current = insertedTo;
         insertionPoint = insertedTo;
     }
     return insertionPoint;
 }
 
 void collectDestinationInsertionPoints(const Node& node, HeapVector<Member<InsertionPoint>, 8>& results)
 {
     const Node* current = &node;
     ElementShadow* lastElementShadow = 0;
     while (true) {
-        ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*current);
-        if (!shadow || shadow == lastElementShadow)
+        ElementShadow* shadow = shadowWhereNodeCanBeDistributedForV0(*current);
+        if (!shadow || shadow->isV1() || shadow == lastElementShadow)
             return;
         lastElementShadow = shadow;
         const DestinationInsertionPoints* insertionPoints = shadow->destinationInsertionPointsFor(&node);
         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