Add new files and data structures for the new register allocator.

vm/flow_graph_builder.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_builder.h"
 
 #include "vm/ast_printer.h"
 #include "vm/bit_vector.h"
 #include "vm/code_descriptors.h"
 #include "vm/dart_entry.h"
@@ skipping 2357 matching lines @@
       // Print flow graph to stdout.
       FlowGraphPrinter printer(function, reverse_postorder);
       printer.PrintBlocks();
     }
     if (Dart::flow_graph_writer() != NULL) {
       // Write flow graph to file.
       FlowGraphVisualizer printer(function, reverse_postorder);
       printer.PrintFunction();
     }
   }
-
-  if (for_optimized && FLAG_use_ssa) {
-    Bailout("No SSA code generation support.");
-  }
 }
 
 
 // Compute immediate dominators and the dominance frontier for each basic
 // block.  As a side effect of the algorithm, sets the immediate dominator
 // of each basic block.
 //
 // preorder: an input list of basic block entries in preorder.  The
 //     algorithm relies on the block ordering.
 //
@@ skipping 341 matching lines @@
   char* chars = reinterpret_cast<char*>(
       Isolate::Current()->current_zone()->Allocate(len));
   OS::SNPrint(chars, len, kFormat, function_name, reason);
   const Error& error = Error::Handle(
       LanguageError::New(String::Handle(String::New(chars))));
   Isolate::Current()->long_jump_base()->Jump(1, error);
 }
 
 
 }  // namespace dart