[turbofan] Initial attempt to cleanup Node and related classes.

src/compiler/graph-reducer.cc

 // Copyright 2014 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/graph-reducer.h"
 
 #include <functional>
 
 #include "src/compiler/graph-inl.h"
 
@@ skipping 136 matching lines @@
     if (node == graph()->end()) graph()->SetEnd(replacement);
     // If {node} was replaced by an old node, unlink {node} and assume that
     // {replacement} was already reduced and finish.
     if (replacement->id() < node_count) {
       node->ReplaceUses(replacement);
       node->Kill();
     } else {
       // Otherwise {node} was replaced by a new node. Replace all old uses of
       // {node} with {replacement}. New nodes created by this reduction can
       // use {node}.
-      node->ReplaceUsesIf(
-          [node_count](Node* const node) { return node->id() < node_count; },
-          replacement);
+      for (Edge edge : node->use_edges()) {
+        if (edge.from()->id() < node_count) {
+          edge.UpdateTo(replacement);
+        }
+      }
       // Unlink {node} if it's no longer used.
       if (node->uses().empty()) {
         node->Kill();
       }
 
       // If there was a replacement, reduce it after popping {node}.
       Recurse(replacement);
     }
   }
 }
@@ skipping 23 matching lines @@
 void GraphReducer::Revisit(Node* node) {
   if (state_.Get(node) == State::kVisited) {
     state_.Set(node, State::kRevisit);
     revisit_.push(node);
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8