2015-02-17 18:10:02 +00:00
|
|
|
// Copyright 2015 the V8 project authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
|
|
|
|
2016-05-09 09:10:19 +00:00
|
|
|
// Flags: --allow-natives-syntax --use-osr
|
2015-02-17 18:10:02 +00:00
|
|
|
|
|
|
|
"use strict";
|
|
|
|
|
2015-02-19 11:36:38 +00:00
|
|
|
function nest(body, name, depth) {
|
|
|
|
var header = "";
|
|
|
|
for (var i = 0; i < depth; i++) {
|
|
|
|
var x = "x" + (i + 1);
|
|
|
|
header += " for(var " + x + " = 0; " + x + " < 2; " + x + " = " + x + " + 1 | 0) {\n";
|
|
|
|
body = body + "}"
|
|
|
|
}
|
|
|
|
|
|
|
|
return body.replace(new RegExp("function " + name + "\\(\\) {"),
|
|
|
|
"function " + name + "_" + x + "() {\n" + header);
|
|
|
|
}
|
|
|
|
|
|
|
|
function test(expected, func, depth) {
|
|
|
|
assertEquals(expected, func());
|
|
|
|
assertEquals(expected, func());
|
|
|
|
assertEquals(expected, func());
|
|
|
|
|
|
|
|
var orig = func.toString();
|
|
|
|
var name = func.name;
|
|
|
|
for (var depth = 1; depth < 4; depth++) {
|
|
|
|
var body = nest(orig, name, depth);
|
|
|
|
func = eval("(" + body + ")");
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(func);
|
2015-02-19 11:36:38 +00:00
|
|
|
|
|
|
|
assertEquals(expected, func());
|
|
|
|
assertEquals(expected, func());
|
|
|
|
assertEquals(expected, func());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-02-17 18:10:02 +00:00
|
|
|
function foo() {
|
|
|
|
var result;
|
|
|
|
{
|
|
|
|
let sum = 0;
|
2015-02-19 11:36:38 +00:00
|
|
|
for (var i = 0; i < 10; i++) {
|
|
|
|
%OptimizeOsr();
|
2015-02-17 18:10:02 +00:00
|
|
|
sum += i;
|
|
|
|
}
|
|
|
|
result = sum;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(foo);
|
2015-02-17 18:10:02 +00:00
|
|
|
|
2015-02-19 11:36:38 +00:00
|
|
|
test(45, foo);
|
2015-02-17 18:10:02 +00:00
|
|
|
|
|
|
|
function bar() {
|
2015-02-19 11:36:38 +00:00
|
|
|
let sum = 0;
|
|
|
|
for (var i = 0; i < 10; i++) {
|
|
|
|
%OptimizeOsr();
|
|
|
|
sum += i;
|
|
|
|
}
|
|
|
|
return sum;
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(bar);
|
2015-02-19 11:36:38 +00:00
|
|
|
|
|
|
|
test(45, bar);
|
|
|
|
|
|
|
|
function bon() {
|
2015-02-17 18:10:02 +00:00
|
|
|
{
|
|
|
|
let sum = 0;
|
2015-02-19 11:36:38 +00:00
|
|
|
for (var i = 0; i < 10; i++) {
|
|
|
|
if (i == 5) %OptimizeOsr();
|
2015-02-17 18:10:02 +00:00
|
|
|
sum += i;
|
|
|
|
}
|
2015-02-19 11:36:38 +00:00
|
|
|
return sum;
|
|
|
|
}
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(bon);
|
2015-02-19 11:36:38 +00:00
|
|
|
|
|
|
|
test(45, bon);
|
|
|
|
|
|
|
|
function row() {
|
|
|
|
var i = 0;
|
|
|
|
{
|
|
|
|
let sum = 0;
|
|
|
|
while (true) {
|
|
|
|
if (i == 8) return sum;
|
|
|
|
%OptimizeOsr();
|
|
|
|
sum = i;
|
|
|
|
i = i + 1 | 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 11;
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(row);
|
2015-02-19 11:36:38 +00:00
|
|
|
|
|
|
|
test(7, row);
|
|
|
|
|
|
|
|
function nub() {
|
|
|
|
let i = 0;
|
|
|
|
while (i < 2) {
|
|
|
|
%OptimizeOsr();
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
return i;
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(nub);
|
2015-02-19 11:36:38 +00:00
|
|
|
|
|
|
|
test(2, nub);
|
|
|
|
|
|
|
|
function kub() {
|
|
|
|
var result = 0;
|
|
|
|
let i = 0;
|
|
|
|
while (i < 2) {
|
|
|
|
let x = i;
|
|
|
|
%OptimizeOsr();
|
|
|
|
i++;
|
|
|
|
result = x;
|
2015-02-17 18:10:02 +00:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
2019-05-03 14:32:12 +00:00
|
|
|
%PrepareFunctionForOptimization(kub);
|
2015-02-17 18:10:02 +00:00
|
|
|
|
2015-02-19 11:36:38 +00:00
|
|
|
test(1, kub);
|