Optimize functions containing try-catch.

runtime/vm/flow_graph_compiler.h

 // 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.
 
 #ifndef VM_FLOW_GRAPH_COMPILER_H_
 #define VM_FLOW_GRAPH_COMPILER_H_
 
 #include "vm/allocation.h"
 #include "vm/assembler.h"
 #include "vm/code_descriptors.h"
@@ skipping 226 matching lines @@
   ~FlowGraphCompiler();
 
   static bool SupportsUnboxedMints();
 
   // Accessors.
   Assembler* assembler() const { return assembler_; }
   const ParsedFunction& parsed_function() const { return parsed_function_; }
   const GrowableArray<BlockEntryInstr*>& block_order() const {
     return block_order_;
   }
+
+  const FlowGraph& flow_graph() const { return flow_graph_; }
+
   DescriptorList* pc_descriptors_list() const {
     return pc_descriptors_list_;
   }
   BlockEntryInstr* current_block() const { return current_block_; }
   void set_current_block(BlockEntryInstr* value) {
     current_block_ = value;
   }
   static bool CanOptimize();
   bool CanOptimizeFunction() const;
   bool is_optimizing() const { return is_optimizing_; }
@@ skipping 116 matching lines @@
   void EmitEqualityRegConstCompare(Register reg,
                                    const Object& obj,
                                    bool needs_number_check);
   void EmitEqualityRegRegCompare(Register left,
                                  Register right,
                                  bool needs_number_check);
   // Implement equality: if any of the arguments is null do identity check.
   // Fallthrough calls super equality.
   void EmitSuperEqualityCallPrologue(Register result, Label* skip_call);
 
+  void EmitTrySync(Instruction* instr, intptr_t try_index);
+
   intptr_t StackSize() const;
 
   // Returns assembler label associated with the given block entry.
   Label* GetJumpLabel(BlockEntryInstr* block_entry) const;
   bool WasCompacted(BlockEntryInstr* block_entry) const;
 
   // Returns true if there is a next block after the current one in
   // the block order and if it is the given block.
   bool CanFallThroughTo(BlockEntryInstr* block_entry) const;
 
@@ skipping 64 matching lines @@
 
   // Returns 'sorted' array in decreasing count order.
   static void SortICDataByCount(const ICData& ic_data,
                                 GrowableArray<CidTarget>* sorted);
 
  private:
   friend class CheckStackOverflowSlowPath;  // For pending_deoptimization_env_.
 
   void EmitFrameEntry();
 
+  void EmitTrySyncMove(Address dest, Location loc, bool* push_emitted);
+
   void AddStaticCallTarget(const Function& function);
 
   void GenerateDeferredCode();
 
   void EmitInstructionPrologue(Instruction* instr);
   void EmitInstructionEpilogue(Instruction* instr);
 
   // Emit code to load a Value into register 'dst'.
   void LoadValue(Register dst, Value* value);
 
@@ skipping 106 matching lines @@
   // that should be used when deoptimizing we store it in this variable.
   // In future AddDeoptStub should be moved out of the instruction template.
   Environment* pending_deoptimization_env_;
 
   DISALLOW_COPY_AND_ASSIGN(FlowGraphCompiler);
 };
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_COMPILER_H_