Iterative graph traversal in FlowGraph::DiscoverBlocks()

runtime/vm/flow_graph.h

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef VM_FLOW_GRAPH_H_
 #define VM_FLOW_GRAPH_H_
 
 #include "vm/growable_array.h"
 #include "vm/hash_map.h"
 #include "vm/intermediate_language.h"
@@ skipping 24 matching lines @@
   bool Done() const { return current_ >= block_order_.length(); }
 
   BlockEntryInstr* Current() const { return block_order_[current_]; }
 
  private:
   const GrowableArray<BlockEntryInstr*>& block_order_;
   intptr_t current_;
 };
 
 
+struct BlockEntryEdge {
+  BlockEntryEdge(BlockEntryInstr* parent, BlockEntryInstr* child)
+    : parent(parent),
+      child(child) { }
+  BlockEntryInstr* parent;
+  BlockEntryInstr* child;
+
+  DISALLOW_ALLOCATION();
+};
+
+
 struct ConstantPoolTrait {
   typedef ConstantInstr* Value;
   typedef const Object& Key;
   typedef ConstantInstr* Pair;
 
   static Key KeyOf(Pair kv) {
     return kv->value();
   }
 
   static Value ValueOf(Pair kv) {
@@ skipping 384 matching lines @@
   // Per block sets of available blocks. Block A is available at the block B if
   // and only if A dominates B and all paths from A to B are free of side
   // effects.
   GrowableArray<BitVector*> available_at_;
 };
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_H_