Clean up node iteration

test/cctest/compiler/test-control-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/v8.h"
 #include "test/cctest/cctest.h"
 
 #include "src/base/bits.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/control-reducer.h"
@@ skipping 112 matching lines @@
 
   Node* EffectPhi(Node* a, Node* b, Node* c) {
     return SetSelfReferences(graph.NewNode(op(3, true), a, b, c, start));
   }
 
   Node* EffectPhi(Node* a, Node* b, Node* c, Node* d) {
     return SetSelfReferences(graph.NewNode(op(4, true), a, b, c, d, start));
   }
 
   Node* SetSelfReferences(Node* node) {
-    Node::Inputs inputs = node->inputs();
-    for (Node::Inputs::iterator iter(inputs.begin()); iter != inputs.end();
-         ++iter) {
-      Node* input = *iter;
-      if (input == self) node->ReplaceInput(iter.index(), node);
+    for (Edge edge : node->input_edges()) {
+      if (edge.to() == self) node->ReplaceInput(edge.index(), node);
     }
     return node;
   }
 
   const Operator* op(int count, bool effect) {
     return effect ? common.EffectPhi(count) : common.Phi(kMachAnyTagged, count);
   }
 
   void Trim() { ControlReducer::TrimGraph(main_zone(), &jsgraph); }
 
@@ skipping 1524 matching lines @@
 
   Node* ret = R.Return(d1.phi, R.start, d1.merge);
 
   R.ReduceGraph();  // d1 gets folded true.
 
   CheckInputs(ret, y2, R.start, R.start);
   CheckDeadDiamond(d1);
   CheckDeadDiamond(d2);
   CheckDeadDiamond(d3);
 }