e3e8ea5d65
To be consistent with the all the other tiers and avoid confusion, we rename --opt to ---turbofan, and --always-opt to --always-turbofan. Change-Id: Ie23dc8282b3fb4cf2fbf73b6c3d5264de5d09718 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3610431 Reviewed-by: Leszek Swirski <leszeks@chromium.org> Commit-Queue: Camillo Bruni <cbruni@chromium.org> Reviewed-by: Jakob Linke <jgruber@chromium.org> Cr-Commit-Position: refs/heads/main@{#80336}
165 lines
3.2 KiB
JavaScript
165 lines
3.2 KiB
JavaScript
// Copyright 2017 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 --turbofan --no-flush-bytecode --no-stress-flush-code
|
|
|
|
/* Test MapCheck behavior */
|
|
|
|
(function testForEachMapCheck() {
|
|
function f(v,n,o) {
|
|
Object.freeze(o);
|
|
}
|
|
function g() {
|
|
[1,2,3].forEach(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
|
|
(function testFindMapCheck() {
|
|
function f(v,n,o) {
|
|
Object.freeze(o);
|
|
return false;
|
|
}
|
|
function g() {
|
|
[1,2,3].find(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
(function testMapMapCheck() {
|
|
function f(v,n,o) {
|
|
Object.freeze(o);
|
|
return false;
|
|
}
|
|
function g() {
|
|
[1,2,3].map(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
(function testFilterMapCheck() {
|
|
function f(v,n,o) {
|
|
Object.freeze(o);
|
|
return true;
|
|
}
|
|
function g() {
|
|
[1,2,3].filter(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
|
|
/* Test CheckBounds behavior */
|
|
|
|
(function testForEachCheckBounds() {
|
|
function f(v,n,o) {
|
|
o.length=2;
|
|
}
|
|
function g() {
|
|
[1,2,3].forEach(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
|
|
(function testFindCheckBounds() {
|
|
function f(v,n,o) {
|
|
o.length=2;
|
|
return false;
|
|
}
|
|
function g() {
|
|
[1,2,3].find(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
(function testMapCheckBounds() {
|
|
function f(v,n,o) {
|
|
o.length=2;
|
|
return false;
|
|
}
|
|
function g() {
|
|
[1,2,3].map(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|
|
|
|
(function testFilterCheckBounds() {
|
|
function f(v,n,o) {
|
|
o.length = 2;
|
|
return true;
|
|
}
|
|
function g() {
|
|
[1,2,3].filter(f);
|
|
}
|
|
%PrepareFunctionForOptimization(g);
|
|
g();
|
|
g();
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
g();
|
|
%PrepareFunctionForOptimization(g);
|
|
%OptimizeFunctionOnNextCall(g);
|
|
g();
|
|
g();
|
|
assertOptimized(g);
|
|
})();
|