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}
81 lines
2.2 KiB
JavaScript
81 lines
2.2 KiB
JavaScript
// Copyright 2018 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
|
|
|
|
// Test that NumberAbs correctly deals with PositiveInteger \/ MinusZero
|
|
// and turns the -0 into a 0.
|
|
(function() {
|
|
function foo(x) {
|
|
x = Math.floor(x);
|
|
x = Math.max(x, -0);
|
|
return 1 / Math.abs(x);
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(Infinity, foo(-0));
|
|
assertEquals(Infinity, foo(-0));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(Infinity, foo(-0));
|
|
})();
|
|
|
|
// Test that NumberAbs properly passes the kIdentifyZeros truncation
|
|
// for Signed32 \/ MinusZero inputs.
|
|
(function() {
|
|
function foo(x) {
|
|
return Math.abs(x * -2);
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
assertOptimized(foo);
|
|
// Now `foo` should stay optimized even if `x * -2` would produce `-0`.
|
|
assertEquals(0, foo(0));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that NumberAbs properly passes the kIdentifyZeros truncation
|
|
// for Unsigned32 \/ MinusZero inputs.
|
|
(function() {
|
|
function foo(x) {
|
|
x = x | 0;
|
|
return Math.abs(Math.max(x * -2, 0));
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
assertOptimized(foo);
|
|
// Now `foo` should stay optimized even if `x * -2` would produce `-0`.
|
|
assertEquals(0, foo(0));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that NumberAbs properly passes the kIdentifyZeros truncation
|
|
// for OrderedNumber inputs.
|
|
(function() {
|
|
function foo(x) {
|
|
x = x | 0;
|
|
return Math.abs(Math.min(x * -2, 2 ** 32));
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(2, foo(-1));
|
|
assertEquals(4, foo(-2));
|
|
assertOptimized(foo);
|
|
// Now `foo` should stay optimized even if `x * -2` would produce `-0`.
|
|
assertEquals(0, foo(0));
|
|
assertOptimized(foo);
|
|
})();
|