Optimize functions containing try-catch.

runtime/vm/intermediate_language.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/intermediate_language.h"
 
 #include "vm/bit_vector.h"
 #include "vm/dart_entry.h"
 #include "vm/flow_graph_allocator.h"
 #include "vm/flow_graph_builder.h"
@@ skipping 210 matching lines @@
 }
 
 
 GraphEntryInstr::GraphEntryInstr(const ParsedFunction& parsed_function,
                                  TargetEntryInstr* normal_entry)
     : BlockEntryInstr(0, CatchClauseNode::kInvalidTryIndex),
       parsed_function_(parsed_function),
       normal_entry_(normal_entry),
       catch_entries_(),
       initial_definitions_(),
-      spill_slot_count_(0) {
+      spill_slot_count_(0),
+      fixed_slot_count_(0) {
 }
 
 
 ConstantInstr* GraphEntryInstr::constant_null() {
   ASSERT(initial_definitions_.length() > 0);
   for (intptr_t i = 0; i < initial_definitions_.length(); ++i) {
     ConstantInstr* defn = initial_definitions_[i]->AsConstant();
     if (defn != NULL && defn->value().IsNull()) return defn;
   }
   UNREACHABLE();
   return NULL;
 }
 
 
+CatchBlockEntryInstr* GraphEntryInstr::GetCatchEntry(intptr_t index) {
+  // TODO(fschneider): Sort the catch entries by catch_try_index to avoid
+  // searching.
+  for (intptr_t i = 0; i < catch_entries_.length(); ++i) {
+    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());
 
   if (name.Length() < n) {
     return false;
   }
 
   for (intptr_t i = 0; i < n; i++) {
     if (name.CharAt(i) != prefix[i]) {
       return false;
@@ skipping 2178 matching lines @@
     default:
       UNREACHABLE();
   }
   return kPowRuntimeEntry;
 }
 
 
 #undef __
 
 }  // namespace dart