1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* Copyright (c) 2022, 2024, 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
* @summary Test that Ideal transformations of UModINode* are being performed as expected.
* @library /test/lib /
* @run driver compiler.c2.irTests.UModINodeIdealizationTests
*/
public class UModINodeIdealizationTests {
public static final int RANDOM_POWER_OF_2 = 1 << (1 + Utils.getRandomInstance().nextInt(30));
public static void main(String[] args) {
TestFramework.run();
}
@Run(test = {"constant", "constantAgain", "powerOf2", "powerOf2Big", "powerOf2Random", "reallyConstant"})
public void runMethod() {
int a = RunInfo.getRandom().nextInt();
a = (a == 0) ? 2 : a;
int b = RunInfo.getRandom().nextInt();
b = (b == 0) ? 2 : b;
int min = Integer.MIN_VALUE;
int max = Integer.MAX_VALUE;
assertResult(0, 0, true);
assertResult(a, b, false);
assertResult(min, min, false);
assertResult(max, max, false);
}
@DontCompile
public void assertResult(int a, int b, boolean shouldThrow) {
try {
Asserts.assertEQ(Integer.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(Integer.remainderUnsigned(a, 1), constantAgain(a));
Asserts.assertEQ(Integer.remainderUnsigned(a, 32), powerOf2(a));
Asserts.assertEQ(Integer.remainderUnsigned(a, Integer.MIN_VALUE), powerOf2Big(a));
Asserts.assertEQ(Integer.remainderUnsigned(a, RANDOM_POWER_OF_2), powerOf2Random(a));
Asserts.assertEQ(Integer.remainderUnsigned(Integer.MIN_VALUE, 302032), reallyConstant());
}
@Test
@IR(failOn = {IRNode.UMOD_I, IRNode.MUL})
@IR(counts = {IRNode.DIV_BY_ZERO_TRAP, "1"})
// Checks x % x => 0
public int constant(int x) {
return Integer.remainderUnsigned(x, x);
}
@Test
@IR(failOn = {IRNode.UMOD_I})
// Checks x % 1 => 0
public int constantAgain(int x) {
return Integer.remainderUnsigned(x, 1);
}
@Test
@IR(failOn = {IRNode.UMOD_I, IRNode.MUL})
// Checks that modulo with two constants is calculated at compile time
public int reallyConstant() {
return Integer.remainderUnsigned(Integer.MIN_VALUE, 302032); // -2147483648 = Integer.parseUnsignedInt("2147483648")
}
@Test
@IR(failOn = {IRNode.UMOD_I, IRNode.MUL})
@IR(counts = {IRNode.AND, "1"})
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
public int powerOf2(int x) {
return Integer.remainderUnsigned(x, 32);
}
@Test
@IR(failOn = {IRNode.UMOD_I, IRNode.MUL})
@IR(counts = {IRNode.AND, "1"})
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
public int powerOf2Random(int x) {
return Integer.remainderUnsigned(x, RANDOM_POWER_OF_2);
}
@Test
@IR(failOn = {IRNode.UMOD_I, IRNode.MUL})
@IR(counts = {IRNode.AND, "1"})
// Checks that for x % 2^k, 2^k-1 is used as a bit mask.
public int powerOf2Big(int x) {
return Integer.remainderUnsigned(x, Integer.MIN_VALUE);
}
}
|
