v8/test/mjsunit/compiler/bigint64-mod-no-deopt-loop.js
Qifan Pan 3333e29f38 [turbofan] Support BigIntModulus
This CL supports BigInt modulo operations in turbofan and refactors
the code in simplified lowering to avoid boilerplate.

Bug: v8:9407
Change-Id: Id9d80bd82a94a50c6684956d1f8e60f99761c517
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3976434
Commit-Queue: Qifan Pan <panq@google.com>
Reviewed-by: Jakob Kummerow <jkummerow@chromium.org>
Reviewed-by: Nico Hartmann <nicohartmann@chromium.org>
Cr-Commit-Position: refs/heads/main@{#84100}
2022-11-07 16:38:20 +00:00

66 lines
1.9 KiB
JavaScript

// Copyright 2022 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 --no-always-turbofan
(function OptimizeAndTestDivZero() {
function f(x, y) {
return x % y;
}
%PrepareFunctionForOptimization(f);
assertEquals(0n, f(0n, 1n));
assertEquals(-5n, f(-32n, 9n));
%OptimizeFunctionOnNextCall(f);
assertEquals(4n, f(14n, 5n));
assertOptimized(f);
// Re-prepare the function before the first deopt to ensure type feedback is
// not cleared by an untimely gc.
%PrepareFunctionForOptimization(f);
assertOptimized(f);
// CheckedInt64Mod will trigger deopt due to divide-by-zero.
assertThrows(() => f(42n, 0n), RangeError);
if (%Is64Bit()) {
assertUnoptimized(f);
assertEquals(0n, f(0n, 1n));
assertEquals(-5n, f(-32n, 9n));
%OptimizeFunctionOnNextCall(f);
assertEquals(4n, f(14n, 5n));
assertOptimized(f);
// Ensure there is no deopt loop.
assertThrows(() => f(42n, 0n), RangeError);
assertOptimized(f);
}
})();
(function OptimizeAndTestOverflow() {
function f(x, y) {
return x % y;
}
%PrepareFunctionForOptimization(f);
assertEquals(0n, f(0n, 1n));
assertEquals(-5n, f(-32n, 9n));
%OptimizeFunctionOnNextCall(f);
assertEquals(4n, f(14n, 5n));
assertOptimized(f);
// Re-prepare the function before the first deopt to ensure type feedback is
// not cleared by an umtimely gc.
%PrepareFunctionForOptimization(f);
assertOptimized(f);
// CheckedInt64Mod will trigger deopt due to overflow.
assertEquals(0n, f(-(2n ** 63n), -1n));
if (%Is64Bit()) {
assertUnoptimized(f);
assertEquals(0n, f(0n, 1n));
assertEquals(-5n, f(-32n, 9n));
%OptimizeFunctionOnNextCall(f);
assertEquals(4n, f(14n, 5n));
assertOptimized(f);
// Ensure there is no deopt loop.
assertEquals(0n, f(-(2n ** 63n), -1n));
assertOptimized(f);
}
})();