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

src/compiler/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 "src/compiler/node.h"
 
 #include <algorithm>
 
 namespace v8 {
 namespace internal {
@@ skipping 22 matching lines @@
     to->AppendUse(use);
     ++use;
     ++input;
   }
   return result;
 }
 
 
 void Node::Kill() {
   DCHECK_NOT_NULL(op());
-  RemoveAllInputs();
+  NullAllInputs();
   DCHECK(uses().empty());
 }
 
 
 void Node::AppendInput(Zone* zone, Node* new_to) {
   DCHECK_NOT_NULL(zone);
   DCHECK_NOT_NULL(new_to);
   Use* new_use = new (zone) Use;
   Input new_input;
   new_input.to = new_to;
@@ skipping 28 matching lines @@
 void Node::RemoveInput(int index) {
   DCHECK_LE(0, index);
   DCHECK_LT(index, InputCount());
   for (; index < InputCount() - 1; ++index) {
     ReplaceInput(index, InputAt(index + 1));
   }
   TrimInputCount(InputCount() - 1);
 }
 
 
-void Node::RemoveAllInputs() {
+void Node::NullAllInputs() {
   for (Edge edge : input_edges()) edge.UpdateTo(nullptr);
 }
 
 
 void Node::TrimInputCount(int new_input_count) {
   DCHECK_LE(new_input_count, input_count());
   if (new_input_count == input_count()) return;  // Nothing to do.
   for (int index = new_input_count; index < input_count(); ++index) {
     ReplaceInput(index, nullptr);
   }
@@ skipping 150 matching lines @@
   ++(*this);
   return result;
 }
 
 
 bool Node::Uses::empty() const { return begin() == end(); }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8