Optimize functions containing try-catch.

runtime/vm/flow_graph_compiler.cc

 // 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.
 
 #include "vm/globals.h"  // Needed here to get TARGET_ARCH_XXX.
 
 #include "vm/flow_graph_compiler.h"
 
 #include "vm/cha.h"
 #include "vm/dart_entry.h"
@@ skipping 299 matching lines @@
   char* chars = Isolate::Current()->current_zone()->Alloc<char>(len);
   OS::SNPrint(chars, len, kFormat, function_name, reason);
   const Error& error = Error::Handle(
       LanguageError::New(String::Handle(String::New(chars))));
   Isolate::Current()->long_jump_base()->Jump(1, error);
 }
 
 
 intptr_t FlowGraphCompiler::StackSize() const {
   if (is_optimizing_) {
-    return block_order_[0]->AsGraphEntry()->spill_slot_count();
+    GraphEntryInstr* entry = block_order_[0]->AsGraphEntry();

[Kevin Millikin (Google), 2013/05/08 11:42:00]

Not your code, but I don't like using a property of the block order (which could
change) to find the graph entry.  Replace with flow_graph_.graph_entry().

[Florian Schneider, 2013/05/08 17:10:55]

Done.

+    return entry->fixed_slot_count() + entry->spill_slot_count();
   } else {
     return parsed_function_.num_stack_locals() +
         parsed_function_.num_copied_params();
   }
 }
 
 
 Label* FlowGraphCompiler::GetJumpLabel(
     BlockEntryInstr* block_entry) const {
   const intptr_t block_index = block_entry->postorder_number();
@@ skipping 810 matching lines @@
 
   for (int i = 0; i < len; i++) {
     sorted->Add(CidTarget(ic_data.GetReceiverClassIdAt(i),
                           &Function::ZoneHandle(ic_data.GetTargetAt(i)),
                           ic_data.GetCountAt(i)));
   }
   sorted->Sort(HighestCountFirst);
 }
 
 }  // namespace dart