Eliminate some unnecessary handle allocations in the compiler.

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 741 matching lines @@
   RenameRecursive(entry, &env, live_phis, variable_liveness);
 }
 
 
 void FlowGraph::AttachEnvironment(Instruction* instr,
                                   GrowableArray<Definition*>* env) {
   Environment* deopt_env =
       Environment::From(isolate(),
                         *env,
                         num_non_copied_params_,
-                        Code::Handle(parsed_function_.code()));
+                        &parsed_function_);
   // TODO(fschneider): Add predicates CanEagerlyDeoptimize and
   // CanLazilyDeoptimize to instructions to generally deal with instructions
   // that have pushed arguments and input operands.
   // Right now, closure calls are the only instructions that have both. They
   // also don't have an eager deoptimziation point, so the environment attached
   // here is only used for after the call.
   if (instr->IsClosureCall()) {
     deopt_env = deopt_env->DeepCopy(isolate(),
                                     deopt_env->Length() - instr->InputCount());
   }
@@ skipping 461 matching lines @@
 }
 
 
 bool BlockEffects::IsSideEffectFreePath(BlockEntryInstr* from,
                                         BlockEntryInstr* to) const {
   return available_at_[to->postorder_number()]->Contains(
       from->postorder_number());
 }
 
 }  // namespace dart