77c94fae3a
Bug: chromium:852420 Change-Id: Ic34b996460b9ad2124f4bdb18afdcc83f2453e6a Reviewed-on: https://chromium-review.googlesource.com/c/1470109 Reviewed-by: Sigurd Schneider <sigurds@chromium.org> Commit-Queue: Ulan Degenbaev <ulan@chromium.org> Cr-Commit-Position: refs/heads/master@{#59573}
108 lines
2.3 KiB
JavaScript
108 lines
2.3 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
|
|
|
|
(function test() {
|
|
function foo(a) { a.push(a.length = 2); }
|
|
|
|
foo([1]);
|
|
foo([1]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([1]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([1]);
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
(function testElementTypeCheckSmi() {
|
|
function foo(a) { a.push('a'); }
|
|
|
|
foo([1]);
|
|
foo([1]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([1]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([1]);
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
(function testElementTypeCheckDouble() {
|
|
function foo(a) { a.push('a'); }
|
|
|
|
foo([0.3413312]);
|
|
foo([0.3413312]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([0.3413312]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([0.3413312]);
|
|
assertOptimized(foo);
|
|
})();
|
|
(function test() {
|
|
function bar(a) { a.x = 2 };
|
|
%NeverOptimizeFunction(bar);
|
|
function foo(a) { a.push(bar(a)); }
|
|
|
|
foo(["1"]);
|
|
foo(["1"]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(["1"]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(["1"]);
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
(function test() {
|
|
function foo(a) { a.push(a.length = 2); }
|
|
|
|
foo([0.34234]);
|
|
foo([0.34234]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([0.34234]);
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo([0.34234]);
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
(function test() {
|
|
const N = 128 * 1024;
|
|
|
|
function foo(a) { a.push(1); }
|
|
|
|
foo(new Array(N));
|
|
foo(new Array(N));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(new Array(N));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(new Array(N));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
(function test() {
|
|
// Conservative arrays lengths in slow and fast mode.
|
|
const kFastModeLength = 1024;
|
|
const kSlowModeLength = 512 * 1024;
|
|
function mkArray(length) {
|
|
let a = [0.1];
|
|
a.length = length;
|
|
return a;
|
|
}
|
|
function foo(a) { a.push(0.23441233123); }
|
|
|
|
// 1. Optimize foo to handle fast mode arrays.
|
|
foo(mkArray(kFastModeLength));
|
|
foo(mkArray(kFastModeLength));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(mkArray(kFastModeLength));
|
|
|
|
// 2. Given a slow mode array, foo will deopt.
|
|
foo(mkArray(kSlowModeLength));
|
|
|
|
// 3. Optimize foo again.
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
foo(mkArray(kSlowModeLength));
|
|
// 4. It should stay optimized.
|
|
assertOptimized(foo);
|
|
})();
|