v8/test/mjsunit/regress/regress-v8-12194.js

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

75 lines
1.5 KiB
JavaScript
Raw Normal View History

// Copyright 2021 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-always-opt --no-stress-opt
// Flags: --deopt-every-n-times=0 --no-force-slow-path
(function TestSliceWithoutParams() {
let array = [0, 1, 2];
function f() {
let array2 = array.slice();
array2[1] = array2[0];
}
%PrepareFunctionForOptimization(f);
f();
%OptimizeFunctionOnNextCall(f);
f();
// Assert that the function was not deoptimized.
assertOptimized(f);
})();
(function TestSliceWithStartZero() {
let array = [0, 1, 2];
function f() {
let array2 = array.slice(0);
array2[1] = array2[0];
}
%PrepareFunctionForOptimization(f);
f();
%OptimizeFunctionOnNextCall(f);
f();
// Assert that the function was not deoptimized.
assertOptimized(f);
})();
(function TestSliceWithStartNonZero() {
let array = [0, 1, 2];
function f() {
let array2 = array.slice(1);
array2[1] = array2[0];
}
%PrepareFunctionForOptimization(f);
f();
%OptimizeFunctionOnNextCall(f);
f();
// Assert that the function was not deoptimized.
assertOptimized(f);
})();
(function TestSliceWithStartZeroEndNonUndefined() {
let array = [0, 1, 2];
function f() {
let array2 = array.slice(0, 1);
array2[1] = array2[0];
}
%PrepareFunctionForOptimization(f);
f();
%OptimizeFunctionOnNextCall(f);
f();
// Assert that the function was not deoptimized.
assertOptimized(f);
})();