Instruction size and growth threshold for inlining.

runtime/vm/flow_graph.cc

 // Copyright (c) 2012, 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.
 
 #include "vm/flow_graph.h"
 
 #include "vm/bit_vector.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/intermediate_language.h"
 #include "vm/longjump.h"
@@ skipping 902 matching lines @@
     ReorderPhis(caller_entry);
     // Adjust pre/post orders and update the dominator tree.
     DiscoverBlocks();
     // TODO(zerny): Compute the dominator frontier locally.
     GrowableArray<BitVector*> dominance_frontier;
     ComputeDominators(&dominance_frontier);
   }
 }
 
 
+intptr_t FlowGraph::InstructionCount() const {
+  intptr_t size = 0;
+  // Iterate each block, skipping the graph entry.
+  for (intptr_t i = 1; i < preorder_.length(); ++i) {
+    for (ForwardInstructionIterator it(preorder_[i]);
+         !it.Done();
+         it.Advance()) {
+      ++size;
+    }
+  }
+  return size;
+}
+
+
 }  // namespace dart