Run Crankshaft on a separate thread.

test/cctest/test-deoptimization.cc

 // Copyright 2012 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 343 matching lines @@
                "X.prototype.toString = function () {"
                "  if (deopt) { count++; %DeoptimizeFunction(f); } return 'an X'"
                "};");
     CompileRun(f_source);
     CompileRun("for (var i = 0; i < 5; i++) {"
                "  f('a+', new X());"
                "};");
 
     // Compile an optimized version of f.
     i::FLAG_always_opt = true;
+    i::FLAG_optimize_in_parallel = false;
     CompileRun(f_source);
     CompileRun("f('a+', new X());");
     CHECK(!i::V8::UseCrankshaft() ||
           GetJSFunction(env->Global(), "f")->IsOptimized());
 
     // Call f and force deoptimization while processing the binary operation.
     CompileRun("deopt = true;"
                "var result = f('a+', new X());");
   }
   NonIncrementalGC();
@@ skipping 32 matching lines @@
   // call in the optimized code.
   i::FLAG_prepare_always_opt = true;
   CompileConstructorWithDeoptimizingValueOf();
   CompileRun(f_source);
   CompileRun("for (var i = 0; i < 5; i++) {"
              "  f(8, new X());"
              "};");
 
   // Compile an optimized version of f.
   i::FLAG_always_opt = true;
+  // Be deterministic.
+  i::FLAG_optimize_in_parallel = false;
   CompileRun(f_source);
   CompileRun("f(7, new X());");
   CHECK(!i::V8::UseCrankshaft() ||
         GetJSFunction((*env)->Global(), "f")->IsOptimized());
 
   // Call f and force deoptimization while processing the binary operation.
   CompileRun("deopt = true;"
              "var result = f(7, new X());");
   NonIncrementalGC();
   CHECK(!GetJSFunction((*env)->Global(), "f")->IsOptimized());
@@ skipping 78 matching lines @@
                "X.prototype.toString = function () {"
                "  if (deopt) { count++; %DeoptimizeFunction(f); } return 'b'"
                "};");
     CompileRun(f_source);
     CompileRun("for (var i = 0; i < 5; i++) {"
                "  f('a', new X());"
                "};");
 
     // Compile an optimized version of f.
     i::FLAG_always_opt = true;
+    // Be deterministic.
+    i::FLAG_optimize_in_parallel = false;
+
     CompileRun(f_source);
     CompileRun("f('a', new X());");
     CHECK(!i::V8::UseCrankshaft() ||
           GetJSFunction(env->Global(), "f")->IsOptimized());
 
     // Call f and force deoptimization while processing the comparison.
     CompileRun("deopt = true;"
                "var result = f('a', new X());");
   }
   NonIncrementalGC();
@@ skipping 44 matching lines @@
     CompileRun(g2_source);
     CompileRun("for (var i = 0; i < 5; i++) {"
                "  f1(new X());"
                "  g1(new X());"
                "  f2(new X(), 'z');"
                "  g2(new X(), 'z');"
                "};");
 
     // Compile an optimized version of the functions.
     i::FLAG_always_opt = true;
+    // Be deterministic.
+    i::FLAG_optimize_in_parallel = false;
     CompileRun(f1_source);
     CompileRun(g1_source);
     CompileRun(f2_source);
     CompileRun(g2_source);
     CompileRun("f1(new X());");
     CompileRun("g1(new X());");
     CompileRun("f2(new X(), 'z');");
     CompileRun("g2(new X(), 'z');");
     if (i::V8::UseCrankshaft()) {
       CHECK(GetJSFunction(env->Global(), "f1")->IsOptimized());
@@ skipping 64 matching lines @@
     CompileRun(g2_source);
     CompileRun("for (var i = 0; i < 5; i++) {"
                "  f1(new X());"
                "  g1(new X());"
                "  f2(new X(), 'z');"
                "  g2(new X(), 'z');"
                "};");
 
     // Compile an optimized version of the functions.
     i::FLAG_always_opt = true;
+    // Be deterministic.
+    i::FLAG_optimize_in_parallel = false;
+
     CompileRun(f1_source);
     CompileRun(g1_source);
     CompileRun(f2_source);
     CompileRun(g2_source);
     CompileRun("f1(new X());");
     CompileRun("g1(new X());");
     CompileRun("f2(new X(), 'z');");
     CompileRun("g2(new X(), 'z');");
     if (i::V8::UseCrankshaft()) {
       CHECK(GetJSFunction(env->Global(), "f1")->IsOptimized());
       CHECK(GetJSFunction(env->Global(), "g1")->IsOptimized());
       CHECK(GetJSFunction(env->Global(), "f2")->IsOptimized());
       CHECK(GetJSFunction(env->Global(), "g2")->IsOptimized());
     }
 
     // Call functions and force deoptimization while processing the ics.
     CompileRun("deopt = true;"
                "var result = f1(new X());");
   }
   NonIncrementalGC();
 
   CHECK(!GetJSFunction(env->Global(), "f1")->IsOptimized());
   CHECK(!GetJSFunction(env->Global(), "g1")->IsOptimized());
   CHECK(!GetJSFunction(env->Global(), "f2")->IsOptimized());
   CHECK(!GetJSFunction(env->Global(), "g2")->IsOptimized());
   CHECK_EQ(1, env->Global()->Get(v8_str("count"))->Int32Value());
   CHECK_EQ(13, env->Global()->Get(v8_str("result"))->Int32Value());
   CHECK_EQ(0, Deoptimizer::GetDeoptimizedCodeCount(Isolate::Current()));
 }