mirror of
https://github.com/nodejs/node.git
synced 2025-05-15 17:35:26 +00:00

PR-URL: https://github.com/nodejs/node/pull/44741 Fixes: https://github.com/nodejs/node/issues/44650 Fixes: https://github.com/nodejs/node/issues/37472 Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl> Reviewed-By: Jiawen Geng <technicalcute@gmail.com> Reviewed-By: James M Snell <jasnell@gmail.com>
147 lines
4.1 KiB
JavaScript
147 lines
4.1 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 --turbo-inlining --no-assert-types
|
|
|
|
// Test that SpeculativeNumberEqual[SignedSmall] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
function foo(x, y) {
|
|
if (x * y === 0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(0, foo(-3, 0));
|
|
assertEquals(0, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that SpeculativeNumberEqual[Number] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
// Produce a SpeculativeNumberEqual with Number feedback.
|
|
function foo(x, y) {
|
|
if (x * y === -0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(0, foo(-3, 0));
|
|
assertEquals(0, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that SpeculativeNumberLessThan[SignedSmall] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
function foo(x, y) {
|
|
if (x * y < 0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(1, -1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(1, -1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(1, foo(-3, 0));
|
|
assertEquals(1, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that SpeculativeNumberLessThan[Number] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
// Produce a SpeculativeNumberLessThan with Number feedback.
|
|
function foo(x, y) {
|
|
if (x * y < -0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(1, -1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(1, -1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(1, foo(-3, 0));
|
|
assertEquals(1, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that SpeculativeNumberLessThanOrEqual[SignedSmall] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
function foo(x, y) {
|
|
if (x * y <= 0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(0, foo(-3, 0));
|
|
assertEquals(0, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that SpeculativeNumberLessThanOrEqual[Number] properly passes the
|
|
// kIdentifyZeros truncation.
|
|
(function() {
|
|
// Produce a SpeculativeNumberLessThanOrEqual with Number feedback.
|
|
function foo(x, y) {
|
|
if (x * y <= -0) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(0, 1));
|
|
assertEquals(1, foo(1, 1));
|
|
assertEquals(1, foo(1, 2));
|
|
assertOptimized(foo);
|
|
// Even if x*y produces -0 now, it should stay optimized.
|
|
assertEquals(0, foo(-3, 0));
|
|
assertEquals(0, foo(0, -3));
|
|
assertOptimized(foo);
|
|
})();
|