Turn on parallel recompilation for tests that assert optimization status.

test/mjsunit/array-bounds-check-removal.js

 // Copyright 2011 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 87 matching lines @@
 check_test_base(a, 3, false);
 
 // Test that we deopt on failed bounds checks.
 var dictionary_map_array = new Int32Array(128);
 test_base(dictionary_map_array, 5, true);
 test_base(dictionary_map_array, 6, true);
 test_base(dictionary_map_array, 5, false);
 test_base(dictionary_map_array, 6, false);
 %OptimizeFunctionOnNextCall(test_base);
 test_base(dictionary_map_array, -2, true);
-assertTrue(%GetOptimizationStatus(test_base) != 1);
+assertUnoptimized(test_base);
 
 // Forget about the dictionary_map_array's map.
 %ClearFunctionTypeFeedback(test_base);
 
 test_base(a, 5, true);
 test_base(a, 6, true);
 test_base(a, 5, false);
 test_base(a, 6, false);
 %OptimizeFunctionOnNextCall(test_base);
 test_base(a, 2048, true);
-assertTrue(%GetOptimizationStatus(test_base) != 1);
+assertUnoptimized(test_base);
 
 function test_minus(base,cond) {
   a[base - 1] = 1;
   a[base - 2] = 2;
   a[base + 4] = 3;
   a[base] = 4;
   a[base + 4] = base + 4;
   if (cond) {
     a[base - 4] = 1;
     a[base + 5] = 2;
@@ skipping 36 matching lines @@
 for (var i = 0; i < short_a.length; i++) short_a[i] = 0;
 function short_test(a, i) {
   a[i + 9] = 0;
   a[i - 10] = 0;
 }
 short_test(short_a, 50);
 short_test(short_a, 50);
 %OptimizeFunctionOnNextCall(short_test);
 short_a.length = 10;
 short_test(short_a, 0);
-assertTrue(%GetOptimizationStatus(short_test) != 1);
+assertUnoptimized(test_base);
 
 
 // A test for when we would modify a phi index.
 var data_phi = [0, 1, 2, 3, 4, 5, 6, 7, 8];
 function test_phi(a, base, check) {
   var index;
   if (check) {
     index = base + 1;
   } else {
     index = base + 2;
@@ skipping 35 matching lines @@
 result_composition = test_composition(data_composition_long, 2);
 assertEquals(19, result_composition);
 result_composition = test_composition(data_composition_long, 2);
 assertEquals(19, result_composition);
 %OptimizeFunctionOnNextCall(test_composition);
 result_composition = test_composition(data_composition_short, 2);
 assertEquals(NaN, result_composition);
 
 
 gc();