Use the virtual-frame based optimizing compiler for split-compilation...

src/fast-codegen.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 12 matching lines @@
 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "v8.h"
 
 #include "codegen-inl.h"
 #include "data-flow.h"
 #include "fast-codegen.h"
-#include "full-codegen.h"
 #include "scopes.h"
 
 namespace v8 {
 namespace internal {
 
 #define BAILOUT(reason)                         \
   do {                                          \
     if (FLAG_trace_bailout) {                   \
       PrintF("%s\n", reason);                   \
     }                                           \
@@ skipping 307 matching lines @@
   // Generate the fast-path code.
   FastCodeGenerator fast_cgen(&masm, script, is_eval);
   fast_cgen.Generate(fun, info);
   if (fast_cgen.HasStackOverflow()) {
     ASSERT(!Top::has_pending_exception());
     return Handle<Code>::null();
   }
 
   // Generate the full code for the function in bailout mode, using the same
   // macro assembler.
-  FullCodeGenerator full_cgen(&masm, script, is_eval);
-  full_cgen.Generate(fun, FullCodeGenerator::SECONDARY);
-  if (full_cgen.HasStackOverflow()) {
+  CodeGenerator cgen(&masm, script, is_eval);
+  CodeGeneratorScope scope(&cgen);
+  cgen.Generate(fun, CodeGenerator::SECONDARY, info);
+  if (cgen.HasStackOverflow()) {
     ASSERT(!Top::has_pending_exception());
     return Handle<Code>::null();
   }
 
   Code::Flags flags = Code::ComputeFlags(Code::FUNCTION, NOT_IN_LOOP);
   return CodeGenerator::MakeCodeEpilogue(fun, &masm, flags, script);
 }
 
 
 void FastCodeGenerator::VisitDeclaration(Declaration* decl) {
@@ skipping 212 matching lines @@
 
 
 void FastCodeGenerator::VisitThisFunction(ThisFunction* expr) {
   UNREACHABLE();
 }
 
 #undef __
 
 
 } }  // namespace v8::internal