[turbofan] Rename Node::RemoveAllInputs() to Node::NullAllInputs().

test/cctest/compiler/test-node.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <functional>
 
 #include "src/v8.h"
 
 #include "graph-tester.h"
 #include "src/compiler/node.h"
@@ skipping 650 matching lines @@
     CHECK_EQ(2, n2->InputCount());
     CHECK_EQ(2, n0->UseCount());
     n2->TrimInputCount(0);
     CHECK_EQ(0, n2->InputCount());
     CHECK_EQ(0, n0->UseCount());
     CHECK_EQ(0, n2->UseCount());
   }
 }
 
 
-TEST(RemoveAllInputs) {
+TEST(NullAllInputs) {
   GraphTester graph;
 
   for (int i = 0; i < 2; i++) {
     Node* n0 = graph.NewNode(&dummy_operator);
     Node* n1 = graph.NewNode(&dummy_operator, n0);
     Node* n2;
     if (i == 0) {
       n2 = graph.NewNode(&dummy_operator, n0, n1);
       CHECK_INPUTS(n2, n0, n1);
     } else {
       n2 = graph.NewNode(&dummy_operator, n0);
       CHECK_INPUTS(n2, n0);
       n2->AppendInput(graph.zone(), n1);  // with out-of-line input.
       CHECK_INPUTS(n2, n0, n1);
     }
 
-    n0->RemoveAllInputs();
+    n0->NullAllInputs();
     CHECK_INPUTS(n0, NONE);
 
     CHECK_USES(n0, n1, n2);
-    n1->RemoveAllInputs();
+    n1->NullAllInputs();
     CHECK_INPUTS(n1, NULL);
     CHECK_INPUTS(n2, n0, n1);
     CHECK_USES(n0, n2);
 
-    n2->RemoveAllInputs();
+    n2->NullAllInputs();
     CHECK_INPUTS(n1, NULL);
     CHECK_INPUTS(n2, NULL, NULL);
     CHECK_USES(n0, NONE);
   }
 
   {
     Node* n0 = graph.NewNode(&dummy_operator);
     Node* n1 = graph.NewNode(&dummy_operator, n0);
     n1->ReplaceInput(0, n1);  // self-reference.
 
     CHECK_INPUTS(n0, NONE);
     CHECK_INPUTS(n1, n1);
     CHECK_USES(n0, NONE);
     CHECK_USES(n1, n1);
-    n1->RemoveAllInputs();
+    n1->NullAllInputs();
 
     CHECK_INPUTS(n0, NONE);
     CHECK_INPUTS(n1, NULL);
     CHECK_USES(n0, NONE);
     CHECK_USES(n1, NONE);
   }
 }
 
 
 TEST(AppendAndTrim) {
@@ skipping 25 matching lines @@
     CheckInputs(last, nodes, i);
 
     for (int j = 0; j < i; j++) {
       if (j < i) CHECK_USES(nodes[j], last);
       if (j >= i) CHECK_USES(nodes[j], NONE);
     }
 
     CHECK_USES(last, NONE);
   }
 }