v8/test/mjsunit/compiler/osr-block-scope.js

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

139 lines
2.9 KiB
JavaScript
Raw Normal View History

// 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.
// Flags: --allow-natives-syntax --use-osr
"use strict";
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 + "}"
}
// Replace function name
var new_func = body.replace(new RegExp("function " + name + "\\(\\) {"),
"function " + name + "_" + x + "() {\n" + header);
// Replace PrepareForOptimize
return new_func.replace(new RegExp("%PrepareFunctionForOptimization\\(" + name + "\\);"),
"%PrepareFunctionForOptimization(" + name + "_" + x + ");");
}
function test(expected, func, depth) {
%PrepareFunctionForOptimization(func);
assertEquals(expected, func());
%PrepareFunctionForOptimization(func);
assertEquals(expected, func());
%PrepareFunctionForOptimization(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 + ")");
%PrepareFunctionForOptimization(func);
assertEquals(expected, func());
%PrepareFunctionForOptimization(func);
assertEquals(expected, func());
%PrepareFunctionForOptimization(func);
assertEquals(expected, func());
}
}
function foo() {
var result;
{
let sum = 0;
for (var i = 0; i < 10; i++) {
%OptimizeOsr();
sum += i;
%PrepareFunctionForOptimization(foo);
}
result = sum;
}
return result;
}
%PrepareFunctionForOptimization(foo);
test(45, foo);
function bar() {
let sum = 0;
for (var i = 0; i < 10; i++) {
%OptimizeOsr();
sum += i;
%PrepareFunctionForOptimization(bar);
}
return sum;
}
%PrepareFunctionForOptimization(bar);
test(45, bar);
function bon() {
{
let sum = 0;
for (var i = 0; i < 10; i++) {
if (i == 5) %OptimizeOsr();
sum += i;
}
return sum;
}
}
%PrepareFunctionForOptimization(bon);
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;
%PrepareFunctionForOptimization(row);
}
}
return 11;
}
%PrepareFunctionForOptimization(row);
test(7, row);
function nub() {
let i = 0;
while (i < 2) {
%OptimizeOsr();
i++;
%PrepareFunctionForOptimization(nub);
}
return i;
}
%PrepareFunctionForOptimization(nub);
test(2, nub);
function kub() {
var result = 0;
let i = 0;
while (i < 2) {
let x = i;
%OptimizeOsr();
i++;
result = x;
%PrepareFunctionForOptimization(kub);
}
return result;
}
%PrepareFunctionForOptimization(kub);
test(1, kub);