Remove support for non-ssa optimizing code generation.

runtime/vm/flow_graph_compiler_ia32.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_IA32_H_
 #define VM_FLOW_GRAPH_COMPILER_IA32_H_
 
 #ifndef VM_FLOW_GRAPH_COMPILER_H_
 #error Include flow_graph_compiler.h instead of flow_graph_compiler_ia32.h.
 #endif
@@ skipping 11 matching lines @@
   struct BlockInfo : public ZoneAllocated {
    public:
     BlockInfo() : label() { }
     Label label;
   };
 
  public:
   FlowGraphCompiler(Assembler* assembler,
                     const FlowGraph& flow_graph,
                     bool is_optimizing,
-                    bool is_ssa,
                     bool is_leaf);
 
   ~FlowGraphCompiler();
 
   // Accessors.
   Assembler* assembler() const { return assembler_; }
   const ParsedFunction& parsed_function() const { return parsed_function_; }
   const GrowableArray<BlockEntryInstr*>& block_order() const {
     return block_order_;
   }
   DescriptorList* pc_descriptors_list() const {
     return pc_descriptors_list_;
   }
   const GrowableObjectArray& object_table() {
     return object_table_;
   }
   BlockEntryInstr* current_block() const { return current_block_; }
   void set_current_block(BlockEntryInstr* value) {
     current_block_ = value;
   }
   static bool CanOptimize();
   bool is_optimizing() const { return is_optimizing_; }
 
-  bool is_ssa() const { return is_ssa_; }
-
   const GrowableArray<BlockInfo*>& block_info() const { return block_info_; }
   ParallelMoveResolver* parallel_move_resolver() {
     return &parallel_move_resolver_;
   }
 
   // Constructor is lighweight, major initialization work should occur here.
   // This makes it easier to measure time spent in the compiler.
   void InitCompiler();
 
   void CompileGraph();
@@ skipping 111 matching lines @@
   // the block order and if it is the given block.
   bool IsNextBlock(BlockEntryInstr* block_entry) const;
 
   void AddExceptionHandler(intptr_t try_index, intptr_t pc_offset);
   void AddCurrentDescriptor(PcDescriptors::Kind kind,
                             intptr_t deopt_id,
                             intptr_t token_pos,
                             intptr_t try_index);
   Label* AddDeoptStub(intptr_t deopt_id,
                       intptr_t try_index_,
-                      DeoptReasonId reason,
-                      Register reg1 = kNoRegister,
-                      Register reg2 = kNoRegister,
-                      Register reg3 = kNoRegister);
+                      DeoptReasonId reason);
 
   void AddSlowPathCode(SlowPathCode* slow_path);
 
   void FinalizeExceptionHandlers(const Code& code);
   void FinalizePcDescriptors(const Code& code);
   void FinalizeDeoptInfo(const Code& code);
   void FinalizeStackmaps(const Code& code);
   void FinalizeVarDescriptors(const Code& code);
   void FinalizeComments(const Code& code);
 
   const Bool& bool_true() const { return bool_true_; }
   const Bool& bool_false() const { return bool_false_; }
   const Class& double_class() const { return double_class_; }
 
-  FrameRegisterAllocator* frame_register_allocator() {
-    return &frame_register_allocator_;
-  }
-
   void SaveLiveRegisters(LocationSummary* locs);
   void RestoreLiveRegisters(LocationSummary* locs);
 
   // Returns true if the compiled function has a finally clause.
   bool HasFinally() const;
 
   static const int kLocalsOffsetFromFP = (-1 * kWordSize);
 
  private:
   friend class DeoptimizationStub;
@@ skipping 58 matching lines @@
                                                    Label* is_instance_lbl,
                                                    Label* is_not_instance_lbl);
 
   void GenerateBoolToJump(Register bool_reg, Label* is_true, Label* is_false);
 
   void CopyParameters();
 
   void GenerateInlinedGetter(intptr_t offset);
   void GenerateInlinedSetter(intptr_t offset);
 
+  // Perform a greedy local register allocation.  Consider all registers free.
+  void AllocateRegistersLocally(Instruction* instr);
+
   // Map a block number in a forward iteration into the block number in the
   // corresponding reverse iteration.  Used to obtain an index into
   // block_order for reverse iterations.
   intptr_t reverse_index(intptr_t index) const {
     return block_order_.length() - index - 1;
   }
 
   // Returns true if the generated code does not call other Dart code or
   // runtime. Only deoptimization is allowed to occur. Closures are not leaf.
   bool IsLeaf() const;
 
   class Assembler* assembler_;
   const ParsedFunction& parsed_function_;
   const GrowableArray<BlockEntryInstr*>& block_order_;
 
   // Compiler specific per-block state.  Indexed by postorder block number
   // for convenience.  This is not the block's index in the block order,
   // which is reverse postorder.
   BlockEntryInstr* current_block_;
   ExceptionHandlerList* exception_handlers_list_;
   DescriptorList* pc_descriptors_list_;
   StackmapTableBuilder* stackmap_table_builder_;
   GrowableArray<BlockInfo*> block_info_;
   GrowableArray<DeoptimizationStub*> deopt_stubs_;
   GrowableArray<SlowPathCode*> slow_path_code_;
   const GrowableObjectArray& object_table_;
   const bool is_optimizing_;
-  const bool is_ssa_;
   const bool is_dart_leaf_;
 
   const Bool& bool_true_;
   const Bool& bool_false_;
   const Class& double_class_;
 
-  FrameRegisterAllocator frame_register_allocator_;
   ParallelMoveResolver parallel_move_resolver_;
 
   // Currently instructions generate deopt stubs internally by
   // calling AddDeoptStub.  To communicate deoptimization environment
   // 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_IA32_H_