More inlining flags and tuned heuristics.

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 922 matching lines @@
     }
   } else {
     // Sort the list of exits by block id.
     GrowableArray<BlockEntryInstr*> exits(callee_exits->length());
     for (intptr_t i = 0; i < callee_exits->length(); ++i) {
       exits.Add((*callee_exits)[i]->GetBlock());
     }
     exits.Sort(LowestBlockIdFirst);
     // Create a join of the returns.
     JoinEntryInstr* join =
-        new JoinEntryInstr(++max_block_id_, CatchClauseNode::kInvalidTryIndex);
+        new JoinEntryInstr(++max_block_id_,
+                           CatchClauseNode::kInvalidTryIndex,
+                           caller_entry->loop_depth());
     for (intptr_t i = 0; i < exits.length(); ++i) {
       ReturnInstr* exit_instr = exits[i]->last_instruction()->AsReturn();
       ASSERT(exit_instr != NULL);
       exit_instr->previous()->Goto(join);
       // Directly add the predecessors of the join in ascending block id order.
       join->predecessors_.Add(exits[i]);
     }
     // If the call has uses, create a phi of the returns.
     if ((call->input_use_list() != NULL) ||
         (call->env_use_list() != NULL)) {
@@ skipping 50 matching lines @@
          !it.Done();
          it.Advance()) {
       ++size;
     }
   }
   return size;
 }
 
 
 }  // namespace dart