31a3cfbc10
BUG=v8:8801 Change-Id: I9d9d9824c6c9ad0176bbfd3723da1b578b17c256 Reviewed-on: https://chromium-review.googlesource.com/c/1495555 Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> Reviewed-by: Mythri Alle <mythria@chromium.org> Cr-Commit-Position: refs/heads/master@{#60001}
40 lines
1.2 KiB
JavaScript
40 lines
1.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 --opt
|
|
|
|
// Test that NumberMin properly passes the kIdentifyZeros truncation.
|
|
(function() {
|
|
function foo(x) {
|
|
if (Math.min(x * -2, -1) == -2) return 0;
|
|
return 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(0, foo(1));
|
|
assertEquals(1, foo(2));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(0, foo(1));
|
|
assertEquals(1, foo(2));
|
|
assertOptimized(foo);
|
|
// Now `foo` should stay optimized even if `x * -2` would produce `-0`.
|
|
assertEquals(1, foo(0));
|
|
assertOptimized(foo);
|
|
})();
|
|
|
|
// Test that NumberMin properly handles 64-bit comparisons.
|
|
(function() {
|
|
function foo(x) {
|
|
x = x|0;
|
|
return Math.min(x - 1, x + 1);
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(-Math.pow(2, 31) - 1, foo(-Math.pow(2, 31)));
|
|
assertEquals(Math.pow(2, 31) - 2, foo(Math.pow(2, 31) - 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(-Math.pow(2, 31) - 1, foo(-Math.pow(2, 31)));
|
|
assertEquals(Math.pow(2, 31) - 2, foo(Math.pow(2, 31) - 1));
|
|
})();
|