[cleanup] Add PrepareFunctionForOptimization to regression tests

R=mythria@chromium.org

Bug: v8:9183
Change-Id: Id7c29452ef6d643b59eb3252df188bf288e2de23
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1660469Reviewed-by: Mythri Alle <mythria@chromium.org>
Commit-Queue: Andreas Haas <ahaas@chromium.org>
Cr-Commit-Position: refs/heads/master@{#62168}

test/mjsunit/regress/regress-330046.js

@@ -40,6 +40,7 @@ function f(n, x, b) {
   }
   return sum;
 }
+%PrepareFunctionForOptimization(f);
 
 f(10, o3);
 f(20, o3);

test/mjsunit/regress/regress-343609.js

@@ -27,6 +27,7 @@ function dummy() {
   (function () {
     var o = {c: 10};
     var f1 = get_closure2();
+    %PrepareFunctionForOptimization(f1);
     f1(o);
     f1(o);
     %OptimizeFunctionOnNextCall(f1);
@@ -38,6 +39,7 @@ var o = new Ctor();
 function opt() {
   (function () {
     var f1 = get_closure();
+    %PrepareFunctionForOptimization(f1);
     f1(new Ctor());
     f1(new Ctor());
     %OptimizeFunctionOnNextCall(f1);

test/mjsunit/regress/regress-347914.js

@@ -81,6 +81,7 @@ function __f_0(o) {
     assertTrue(false);
   }
 }
+%PrepareFunctionForOptimization(__f_0);
 __v_4 = {};
 __v_4.size = function() { return 42; }
 __v_4.g = function() { return this.size(); };

test/mjsunit/regress/regress-354433.js

@@ -47,6 +47,7 @@ function __f_5(fun,a,b) {
 }
 
 function __f_8(a,b) { return a%b };
+%PrepareFunctionForOptimization(__f_8);
 
 __f_5(__f_8, 1 << 30, 1);
 __f_5(__f_8, 1, 1 << 30);

test/mjsunit/regress/regress-361608.js

@@ -14,6 +14,7 @@ function foo() {
     f(function() { x = i; });
   }
 }
+%PrepareFunctionForOptimization(foo);
 
 foo();
 %OptimizeFunctionOnNextCall(foo);

test/mjsunit/regress/regress-362128.js

@@ -29,6 +29,7 @@ var foo = (function () {
     return method.apply(receiver, arguments);
   }
 })();
+%PrepareFunctionForOptimization(foo);
 
 foo("a", "b", "c");
 foo("a", "b", "c");

test/mjsunit/regress/regress-3650-1.js

@@ -14,6 +14,7 @@ function f(t) {
   }
   return result.join('');
 }
+%PrepareFunctionForOptimization(f);
 
 var t = {a: "1", b: "2"};
 assertEquals("aa11ab12ba21bb22", f(t));

test/mjsunit/regress/regress-3650-2.js

@@ -15,6 +15,7 @@ function foo(c) {
   for (var p in c) { s++; }
   return s;
 }
+%PrepareFunctionForOptimization(foo);
 
 assertEquals(2, foo(a));
 assertEquals(1, foo(b));

test/mjsunit/regress/regress-368243.js

@@ -12,6 +12,7 @@ function foo(a, c){
     }
   }
 };
+%PrepareFunctionForOptimization(foo);
 
 c = {
   "one" : { x : 1},

test/mjsunit/regress/regress-4267.js

@@ -10,6 +10,7 @@ var a = [];
 Object.defineProperty(a, "0", {configurable: false, value: 10});
 assertEquals(1, a.length);
 var setter = ()=>{ a.length = 0; };
+%PrepareFunctionForOptimization(setter);
 assertThrows(setter);
 assertThrows(setter);
 %OptimizeFunctionOnNextCall(setter);

test/mjsunit/regress/regress-436893.js

@@ -33,5 +33,6 @@ function foo() {
 }
 // Test passing null or undefined as receiver.
 function g() { return foo.apply(null, x()++); }
+%PrepareFunctionForOptimization(g);
 %OptimizeFunctionOnNextCall(g);
 assertThrows(g);

test/mjsunit/regress/regress-4374.js

@@ -9,6 +9,7 @@ var f = (function() {
   var max = Math.max;
   return function f() { return max(0, -1); };
 })();
+%PrepareFunctionForOptimization(f);
 
 assertEquals(0, f());
 %OptimizeFunctionOnNextCall(f);

test/mjsunit/regress/regress-4388.js

@@ -14,6 +14,7 @@ function test_hole_check_for_let(a) {
     }
   }
 }
+%PrepareFunctionForOptimization(test_hole_check_for_let);
 assertDoesNotThrow("test_hole_check_for_let(0)");
 assertThrows("test_hole_check_for_let(1)", ReferenceError);
 %OptimizeFunctionOnNextCall(test_hole_check_for_let)
@@ -29,6 +30,7 @@ function test_hole_check_for_const(a) {
     }
   }
 }
+%PrepareFunctionForOptimization(test_hole_check_for_const);
 assertThrows("test_hole_check_for_const(0)", TypeError);
 assertThrows("test_hole_check_for_const(1)", ReferenceError);
 %OptimizeFunctionOnNextCall(test_hole_check_for_const)

test/mjsunit/regress/regress-446389.js

@@ -5,6 +5,7 @@
 // Flags: --allow-natives-syntax
 
 function runNearStackLimit(f) { function t() { try { t(); } catch(e) { f(); } }; try { t(); } catch(e) {} }
+%PrepareFunctionForOptimization(__f_3);
 %OptimizeFunctionOnNextCall(__f_3);
 function __f_3() {
     var __v_5 = a[0];

test/mjsunit/regress/regress-447526.js

@@ -19,6 +19,7 @@ function foo() {
     bar();
   }
 }
+%PrepareFunctionForOptimization(foo);
 
 
 %OptimizeFunctionOnNextCall(foo);

test/mjsunit/regress/regress-4521.js

@@ -13,6 +13,7 @@ class B {
 class C extends B {
   bar() { return super[%DeoptimizeFunction(C.prototype.bar), "foo"]() }
 }
+%PrepareFunctionForOptimization(C.prototype.bar);
 
 assertEquals(23, new C().bar());
 assertEquals(23, new C().bar());