Optimize functions containing try-catch.

runtime/vm/intermediate_language.cc

Index: runtime/vm/intermediate_language.cc
===================================================================
--- runtime/vm/intermediate_language.cc	(revision 22436)
+++ runtime/vm/intermediate_language.cc	(working copy)
@@ -225,7 +225,8 @@
       normal_entry_(normal_entry),
       catch_entries_(),
       initial_definitions_(),
-      spill_slot_count_(0) {
+      spill_slot_count_(0),
+      fixed_slot_count_(0) {
 }
 
 
@@ -240,6 +241,14 @@
 }
 
 
+CatchBlockEntryInstr* GraphEntryInstr::GetCatchEntry(intptr_t index) {
+  for (intptr_t i = 0; i < catch_entries_.length(); ++i) {

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

Would it be simple to just sort these by try index and index them directly
instead of searching?

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

Possibly. I'll leave it for now since I don't see more than a couple of those
per function.

+    if (catch_entries_[i]->catch_try_index() == index) return catch_entries_[i];
+  }
+  return NULL;
+}
+
+
 static bool StartsWith(const String& name, const char* prefix, intptr_t n) {
   ASSERT(name.IsOneByteString());