mirror of
https://github.com/tc39/test262.git
synced 2025-05-03 22:40:28 +02:00
* [javascriptcore-test262-automation] changes from git@github.com:WebKit/webkit.git at sha 949e26452cfa153a7f4afe593da97e2fe9e1b706 on Tue Jul 03 2018 14:35:15 GMT-0400 (Eastern Daylight Time)
106 lines
3.9 KiB
JavaScript
106 lines
3.9 KiB
JavaScript
//@ skip if $hostOS == "windows"
|
|
|
|
// Verify that the dividend propagate the NeedsNegZero if the dividend requires it.
|
|
function moduloWithNegativeZeroDividend(a, b, c)
|
|
{
|
|
var temp = a * b;
|
|
return temp % c;
|
|
}
|
|
noInline(moduloWithNegativeZeroDividend);
|
|
|
|
// Warm up with integers. The test for NegZero should not be eliminated here.
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithNegativeZeroDividend(i, 5, 5);
|
|
if (result !== 0)
|
|
throw "moduloWithNegativeZeroDividend(i, 5, 5), returned: " + result;
|
|
}
|
|
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
// Produce negative zero in the multiplication.
|
|
var result = moduloWithNegativeZeroDividend(-i, 0, 2);
|
|
if (!(result === 0 && (1/result) === -Infinity))
|
|
throw "moduloWithNegativeZeroDividend(-i, 0, 2) failed, returned: " + result;
|
|
|
|
// A negative dividend can produce negative zero results.
|
|
var result = moduloWithNegativeZeroDividend(-i, 5, 5);
|
|
if (!(result === 0 && (1/result) === -Infinity))
|
|
throw "moduloWithNegativeZeroDividend(-i, 5, 5) failed, returned: " + result;
|
|
}
|
|
|
|
// Edge cases.
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithNegativeZeroDividend(-i, 0, Infinity);
|
|
if (!(result === 0 && (1/result) === -Infinity))
|
|
throw "moduloWithNegativeZeroDividend(-i, 0, Infinity) failed, returned: " + result;
|
|
|
|
var result = moduloWithNegativeZeroDividend(-i, 0, -Infinity);
|
|
if (!(result === 0 && (1/result) === -Infinity))
|
|
throw "moduloWithNegativeZeroDividend(-i, 0, -Infinity) failed, returned: " + result;
|
|
|
|
var result = moduloWithNegativeZeroDividend(-i, 0, NaN);
|
|
if (result === result)
|
|
throw "moduloWithNegativeZeroDividend(-i, 0, NaN) failed, returned: " + result;
|
|
}
|
|
|
|
|
|
// In this case, the negative zero is irrelevant. The Neg Zero check can be eliminated.
|
|
function moduloWithUnusedNegativeZeroDividend(a, b, c)
|
|
{
|
|
var temp = a * b;
|
|
return (temp % c) | 0;
|
|
}
|
|
noInline(moduloWithUnusedNegativeZeroDividend);
|
|
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithUnusedNegativeZeroDividend(i, 5, 5);
|
|
if (result !== 0)
|
|
throw "moduloWithUnusedNegativeZeroDividend(i, 5, 5), returned: " + result;
|
|
}
|
|
|
|
// Produce negative zero in the multiplication.
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithUnusedNegativeZeroDividend(-i, 0, 2);
|
|
if (!(result === 0 && (1/result) === Infinity))
|
|
throw "moduloWithUnusedNegativeZeroDividend(-i, 0, 2) failed, returned: " + result;
|
|
}
|
|
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithUnusedNegativeZeroDividend(-i, 0, Infinity);
|
|
if (!(result === 0 && (1/result) === Infinity))
|
|
throw "moduloWithUnusedNegativeZeroDividend(-i, 0, Infinity) failed, returned: " + result;
|
|
|
|
var result = moduloWithUnusedNegativeZeroDividend(-i, 0, -Infinity);
|
|
if (!(result === 0 && (1/result) === Infinity))
|
|
throw "moduloWithUnusedNegativeZeroDividend(-i, 0, -Infinity) failed, returned: " + result;
|
|
|
|
var result = moduloWithUnusedNegativeZeroDividend(-i, 0, NaN);
|
|
if (result !== 0)
|
|
throw "moduloWithUnusedNegativeZeroDividend(-i, 0, NaN) failed, returned: " + result;
|
|
}
|
|
|
|
|
|
// The sign of the divisor is completely irrelevant. This should never fail on negative zero divisors.
|
|
function moduloWithNegativeZeroDivisor(a, b, c)
|
|
{
|
|
var temp = a * b;
|
|
return c % temp;
|
|
}
|
|
noInline(moduloWithNegativeZeroDivisor);
|
|
|
|
// Warm up with integers.
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithNegativeZeroDivisor(i, 2, i);
|
|
if (result !== i)
|
|
throw "moduloWithNegativeZeroDividend(i, 2, i), returned: " + result;
|
|
|
|
var result = moduloWithNegativeZeroDivisor(-i, 2, i);
|
|
if (result !== i)
|
|
throw "moduloWithNegativeZeroDividend(-i, 2, i), returned: " + result;
|
|
}
|
|
|
|
// Produce negative zero in the multiplication.
|
|
for (var i = 1; i < 1e4; ++i) {
|
|
var result = moduloWithNegativeZeroDivisor(-i, 0, 2);
|
|
if (result === result)
|
|
throw "moduloWithNegativeZeroDivisor(-i, 0, 2) failed, returned: " + result;
|
|
} |