russell@unturf.com
0a580b313d
Authors: russell@unturf.com · brackishbert@gmail.com · foxhop.net · TimeHexOn.com Patches, unit tests, benchmarks, whitepaper, and outreach briefs. Public domain — no copyright claimed. Use freely.
124 lines
4.3 KiB
Java
124 lines
4.3 KiB
Java
/*
|
|
* Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*/
|
|
package compiler.c2.irTests;
|
|
|
|
import jdk.test.lib.Asserts;
|
|
import jdk.test.lib.Utils;
|
|
|
|
import java.util.Random;
|
|
|
|
import compiler.lib.ir_framework.*;
|
|
|
|
/*
|
|
* @test
|
|
* @bug 8332268
|
|
* @key randomness
|
|
* @summary Test that Ideal transformations of UModLNode* are being performed as expected.
|
|
* @library /test/lib /
|
|
* @run driver compiler.c2.irTests.UModLNodeIdealizationTests
|
|
*/
|
|
public class UModLNodeIdealizationTests {
|
|
public static final long RANDOM_POWER_OF_2 = 1L << (1 + Utils.getRandomInstance().nextInt(62));
|
|
|
|
public static void main(String[] args) {
|
|
TestFramework.run();
|
|
}
|
|
|
|
@Run(test = {"constant", "constantAgain", "powerOf2", "powerOf2Big", "powerOf2Random", "reallyConstant"})
|
|
public void runMethod() {
|
|
long a = RunInfo.getRandom().nextInt();
|
|
a = (a == 0) ? 2 : a;
|
|
long b = RunInfo.getRandom().nextInt();
|
|
b = (b == 0) ? 2 : b;
|
|
|
|
long min = Long.MIN_VALUE;
|
|
long max = Long.MAX_VALUE;
|
|
|
|
assertResult(0, 0, true);
|
|
assertResult(a, b, false);
|
|
assertResult(min, min, false);
|
|
assertResult(max, max, false);
|
|
}
|
|
|
|
@DontCompile
|
|
public void assertResult(long a, long b, boolean shouldThrow) {
|
|
try {
|
|
Asserts.assertEQ(Long.remainderUnsigned(a, a), constant(a));
|
|
Asserts.assertFalse(shouldThrow, "Expected an exception to be thrown.");
|
|
} catch (ArithmeticException e) {
|
|
Asserts.assertTrue(shouldThrow, "Did not expect an exception to be thrown.");
|
|
}
|
|
|
|
Asserts.assertEQ(Long.remainderUnsigned(a, 1), constantAgain(a));
|
|
Asserts.assertEQ(Long.remainderUnsigned(a, 1L << 33), powerOf2(a));
|
|
Asserts.assertEQ(Long.remainderUnsigned(Long.MIN_VALUE, 302032), reallyConstant());
|
|
Asserts.assertEQ(Long.remainderUnsigned(a, Long.MIN_VALUE), powerOf2Big(a));
|
|
Asserts.assertEQ(Long.remainderUnsigned(a, RANDOM_POWER_OF_2), powerOf2Random(a));
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L, IRNode.MUL})
|
|
@IR(counts = {IRNode.DIV_BY_ZERO_TRAP, "1"})
|
|
// Checks x % x => 0
|
|
public long constant(long x) {
|
|
return Long.remainderUnsigned(x, x);
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L})
|
|
// Checks x % 1 => 0
|
|
public long constantAgain(long x) {
|
|
return Long.remainderUnsigned(x, 1);
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L, IRNode.MUL})
|
|
// Checks that modulo with two constants is calculated at compile time
|
|
public long reallyConstant() {
|
|
return Long.remainderUnsigned(Long.MIN_VALUE, 302032);
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L, IRNode.MUL})
|
|
@IR(counts = {IRNode.AND, "1"})
|
|
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
|
|
public long powerOf2(long x) {
|
|
return Long.remainderUnsigned(x, 1L << 33);
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L, IRNode.MUL})
|
|
@IR(counts = {IRNode.AND, "1"})
|
|
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
|
|
public long powerOf2Random(long x) {
|
|
return Long.remainderUnsigned(x, RANDOM_POWER_OF_2);
|
|
}
|
|
|
|
@Test
|
|
@IR(failOn = {IRNode.UMOD_L, IRNode.MUL})
|
|
@IR(counts = {IRNode.AND, "1"})
|
|
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
|
|
public long powerOf2Big(long x) {
|
|
return Long.remainderUnsigned(x, Long.MIN_VALUE);
|
|
}
|
|
}
|