06697f7a82
stress_flush_bytecode controls stress flushing of both bytecode and baseline code. So rename the flag to better reflect its functionality Bug: v8:11947 Change-Id: Ie6c124a476c3a7c6eabd1d75de030ee15fe78e32 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3062567 Commit-Queue: Mythri Alle <mythria@chromium.org> Reviewed-by: Michael Achenbach <machenbach@chromium.org> Reviewed-by: Leszek Swirski <leszeks@chromium.org> Reviewed-by: Omer Katz <omerkatz@chromium.org> Cr-Commit-Position: refs/heads/master@{#76043}
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 --opt --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);
|
|
})();
|