Clean up node iteration

src/compiler/generic-node-inl.h

 // 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.
 
 #ifndef V8_COMPILER_GENERIC_NODE_INL_H_
 #define V8_COMPILER_GENERIC_NODE_INL_H_
 
 #include "src/v8.h"
 
 #include "src/compiler/generic-graph.h"
@@ skipping 31 matching lines @@
 }
 
 template <class B, class S>
 inline typename GenericNode<B, S>::Inputs::iterator
 GenericNode<B, S>::Inputs::end() {
   return typename GenericNode<B, S>::Inputs::iterator(
       this->node_, this->node_->InputCount());
 }
 
 template <class B, class S>
+inline typename GenericNode<B, S>::InputEdges::iterator
+GenericNode<B, S>::InputEdges::begin() {
+  return typename GenericNode<B, S>::InputEdges::iterator(this->node_, 0);
+}
+
+template <class B, class S>
+inline typename GenericNode<B, S>::InputEdges::iterator
+GenericNode<B, S>::InputEdges::end() {
+  return typename GenericNode<B, S>::InputEdges::iterator(
+      this->node_, this->node_->InputCount());
+}
+
+template <class B, class S>
 inline typename GenericNode<B, S>::Uses::iterator
 GenericNode<B, S>::Uses::begin() {
   return typename GenericNode<B, S>::Uses::iterator(this->node_);
 }
 
 template <class B, class S>
 inline typename GenericNode<B, S>::Uses::iterator
 GenericNode<B, S>::Uses::end() {
   return typename GenericNode<B, S>::Uses::iterator();
 }
 
 template <class B, class S>
+inline typename GenericNode<B, S>::UseEdges::iterator
+GenericNode<B, S>::UseEdges::begin() {
+  return typename GenericNode<B, S>::UseEdges::iterator(this->node_);
+}
+
+template <class B, class S>
+inline typename GenericNode<B, S>::UseEdges::iterator
+GenericNode<B, S>::UseEdges::end() {
+  return typename GenericNode<B, S>::UseEdges::iterator();
+}
+
+template <class B, class S>
 void GenericNode<B, S>::ReplaceUses(GenericNode* replace_to) {
   for (Use* use = first_use_; use != NULL; use = use->next) {
     use->from->GetInputRecordPtr(use->input_index)->to = replace_to;
   }
   if (replace_to->last_use_ == NULL) {
     DCHECK_EQ(NULL, replace_to->first_use_);
     replace_to->first_use_ = first_use_;
     replace_to->last_use_ = last_use_;
   } else if (first_use_ != NULL) {
     DCHECK_NE(NULL, replace_to->first_use_);
@@ skipping 17 matching lines @@
       RemoveUse(use);
       replace_to->AppendUse(use);
       use->from->GetInputRecordPtr(use->input_index)->to = replace_to;
     }
     use = next;
   }
 }
 
 template <class B, class S>
 void GenericNode<B, S>::RemoveAllInputs() {
-  for (typename Inputs::iterator iter(inputs().begin()); iter != inputs().end();
-       ++iter) {
-    iter.GetInput()->Update(NULL);
+  for (auto edge : input_edges()) {
+    edge.UpdateTo(NULL);
   }
 }
 
 template <class B, class S>
 void GenericNode<B, S>::TrimInputCount(int new_input_count) {
   if (new_input_count == input_count_) return;  // Nothing to do.
 
   DCHECK(new_input_count < input_count_);
 
   // Update inline inputs.
@@ skipping 144 matching lines @@
     ++use;
     ++input;
   }
   return result;
 }
 }
 }
 }  // namespace v8::internal::compiler
 
 #endif  // V8_COMPILER_GENERIC_NODE_INL_H_