mirror of
https://github.com/tc39/test262.git
synced 2025-11-03 21:24:30 +01:00
38 lines
1.1 KiB
JavaScript
38 lines
1.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 --opt
|
|
|
|
// Test that NumberMax properly passes the kIdentifyZeros truncation.
|
|
(function() {
|
|
function foo(x) {
|
|
if (Math.max(x * -2, 1) == 1) return 0;
|
|
return 1;
|
|
}
|
|
|
|
assertEquals(0, foo(2));
|
|
assertEquals(1, foo(-1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(2));
|
|
assertEquals(1, foo(-1));
|
|
assertOptimized(foo);
|
|
// Now `foo` should stay optimized even if `x * -2` would produce `-0`.
|
|
assertEquals(0, foo(0));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that NumberMax properly handles 64-bit comparisons.
|
|
(function() {
|
|
function foo(x) {
|
|
x = x|0;
|
|
return Math.max(x - 1, x + 1);
|
|
}
|
|
|
|
assertEquals(-Math.pow(2, 31) + 1, foo(-Math.pow(2, 31)));
|
|
assertEquals(Math.pow(2, 31), foo(Math.pow(2, 31) - 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(-Math.pow(2, 31) + 1, foo(-Math.pow(2, 31)));
|
|
assertEquals(Math.pow(2, 31), foo(Math.pow(2, 31) - 1));
|
|
})();
|