Pattern match on generated code to find edge counters.

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/intermediate_language.h"
 #include "vm/parser.h"
@@ skipping 64 matching lines @@
   // Flow graph orders.
   const GrowableArray<BlockEntryInstr*>& preorder() const {
     return preorder_;
   }
   const GrowableArray<BlockEntryInstr*>& postorder() const {
     return postorder_;
   }
   const GrowableArray<BlockEntryInstr*>& reverse_postorder() const {
     return reverse_postorder_;
   }
-  GrowableArray<BlockEntryInstr*>* codegen_block_order(bool is_optimized);
+  static bool ShouldReorderBlocks(const Function& function, bool is_optimized);
+  GrowableArray<BlockEntryInstr*>* CodegenBlockOrder(bool is_optimized);
 
   // Iterators.
   BlockIterator reverse_postorder_iterator() const {
     return BlockIterator(reverse_postorder());
   }
   BlockIterator postorder_iterator() const {
     return BlockIterator(postorder());
   }
 
   intptr_t current_ssa_temp_index() const { return current_ssa_temp_index_; }
@@ skipping 279 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_