File: SubLNodeIdealizationTests.java

package info (click to toggle)
openjdk-25 25.0.1%2B8-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 825,408 kB
  • sloc: java: 5,585,680; cpp: 1,333,948; xml: 1,321,242; ansic: 488,034; asm: 404,003; objc: 21,088; sh: 15,106; javascript: 13,265; python: 8,319; makefile: 2,518; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (252 lines) | stat: -rw-r--r-- 7,581 bytes parent folder | download | duplicates (5)
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
/*
 * Copyright (c) 2022, 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 compiler.lib.ir_framework.*;

/*
 * @test
 * @bug 8267265 8272735
 * @summary Test that Ideal transformations of SubLNode* are being performed as expected.
 * @library /test/lib /
 * @run driver compiler.c2.irTests.SubLNodeIdealizationTests
 */
public class SubLNodeIdealizationTests {
    public static void main(String[] args) {
        TestFramework.run();
    }

    @Run(test = {"test1", "test2", "test3",
                 "test4", "test5", "test6",
                 "test7", "test8", "test9",
                 "test10", "test11", "test12",
                 "test13", "test14", "test15",
                 "test16", "test17", "test18",
                 "test19", "test20", "test21"})
    public void runMethod() {
        long a = RunInfo.getRandom().nextLong();
        long b = RunInfo.getRandom().nextLong();
        long c = RunInfo.getRandom().nextLong();

        long min = Long.MIN_VALUE;
        long max = Long.MAX_VALUE;

        assertResult(0, 0, 0);
        assertResult(a, b, c);
        assertResult(min, min, min);
        assertResult(max, max, max);
    }

    @DontCompile
    public void assertResult(long a, long b, long c) {
        Asserts.assertEQ(a - 1            , test1(a));
        Asserts.assertEQ((a + 1) - b      , test2(a, b));
        Asserts.assertEQ(a - (b + 2021)   , test3(a, b));
        Asserts.assertEQ(a - (a + b)      , test4(a, b));
        Asserts.assertEQ((a - b) - a      , test5(a, b));
        Asserts.assertEQ(a - (b + a)      , test6(a, b));
        Asserts.assertEQ(0 - (a - b)      , test7(a, b));
        Asserts.assertEQ(0 - (a + 2021)   , test8(a, b));
        Asserts.assertEQ((a + b) - (a + c), test9(a, b, c));
        Asserts.assertEQ((b + a) - (c + a), test10(a, b, c));
        Asserts.assertEQ((b + a) - (a + c), test11(a, b, c));
        Asserts.assertEQ((a + b) - (c + a), test12(a, b, c));
        Asserts.assertEQ(a - (b - c)      , test13(a, b, c));
        Asserts.assertEQ(0 - (a >> 63)    , test14(a));
        Asserts.assertEQ(0 - (0 - a)      , test15(a));
        Asserts.assertEQ((a + b) - b      , test16(a, b));
        Asserts.assertEQ((a + b) - a      , test17(a, b));
        Asserts.assertEQ(a*b - a*c        , test18(a, b, c));
        Asserts.assertEQ(a*b - b*c        , test19(a, b, c));
        Asserts.assertEQ(a*c - b*c        , test20(a, b, c));
        Asserts.assertEQ(a*b - c*a        , test21(a, b, c));
    }

    @Test
    @IR(failOn = {IRNode.SUB})
    @IR(counts = {IRNode.ADD, "1"})
    // Checks (x - c0) => x + (-c0)
    public long test1(long x) {
        return (x - 1);
    }

    @Test
    @IR(counts = {IRNode.ADD, "1",
                  IRNode.SUB, "1"
                 })
    // Checks (x + c0) - y => (x - y) + c0
    public long test2(long x, long y) {
        return (x + 1) - y;
    }

    @Test
    @IR(counts = {IRNode.SUB, "1",
                  IRNode.ADD, "1"
                 })
    // Checks x - (y + c0) => (x - y) + (-c0)
    public long test3(long x, long y) {
        return x - (y + 2021);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks x - (x + y) => 0 - y
    public long test4(long x, long y) {
        return x - (x + y);
    }

    @Test
    @IR(counts = {IRNode.SUB, "1"})
    // Checks (x - y) - x => 0 - y
    public long test5(long x, long y) {
        return (x - y) - x;
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks x - (y + x) => 0 - y
    public long test6(long x, long y) {
        return x - (y + x);
    }

    @Test
    @IR(counts = {IRNode.SUB, "1"})
    // Checks 0 - (x - y) => y - x
    public long test7(long x, long y) {
        return 0 - (x - y);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks 0 - (x + 2021) => -2021 - x
    public long test8(long x, long y) {
        return 0 - (x + 2021);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks (x + a) - (x + b) => a - b;
    public long test9(long x, long a, long b) {
        return (x + a) - (x + b);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks (a + x) - (b + x) => a - b
    public long test10(long x, long a, long b) {
        return (a + x) - (b + x);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks (a + x) - (x + b) => a - b
    public long test11(long x, long a, long b) {
        return (a + x) - (x + b);
    }

    @Test
    @IR(failOn = {IRNode.ADD})
    @IR(counts = {IRNode.SUB, "1"})
    // Checks (x + a) - (b + x) => a - b
    public long test12(long x, long a, long b) {
        return (x + a) - (b + x);
    }

    @Test
    @IR(counts = {IRNode.SUB, "1",
                  IRNode.ADD, "1"
                 })
    // Checks a - (b - c) => (a + c) - b
    public long test13(long a, long b, long c) {
        return a - (b - c);
    }

    @Test
    @IR(failOn = {IRNode.SUB, IRNode.RSHIFT_L})
    @IR(counts = {IRNode.URSHIFT_L, "1"})
    // Checks 0 - (a >> 63) => a >>> 63
    //        signed ^^          ^^^ unsigned
    public long test14(long a) {
        return 0 - (a >> 63);
    }

    @Test
    @IR(failOn = {IRNode.SUB})
    // Checks 0 - (0 - x) => x
    public long test15(long x) {
        return 0 - (0 - x);
    }

    @Test
    @IR(failOn = {IRNode.SUB, IRNode.ADD})
    // Checks (x + y) - y => x
    public long test16(long x, long y) {
        return (x + y) - y;
    }

    @Test
    @IR(failOn = {IRNode.SUB, IRNode.ADD})
    // Checks (x + y) - x => y
    public long test17(long x, long y) {
        return (x + y) - x;
    }

    @Test
    @IR(counts = {IRNode.MUL, "1",
                  IRNode.SUB, "1"})
    // Checks "a*b-a*c => a*(b-c)
    public long test18(long a, long b, long c) {
        return a*b - a*c;
    }

    @Test
    @IR(counts = {IRNode.MUL, "1",
                  IRNode.SUB, "1"})
    // Checks a*b-b*c => b*(a-c)
    public long test19(long a, long b, long c) {
        return a*b - b*c;
    }

    @Test
    @IR(counts = {IRNode.MUL, "1",
                  IRNode.SUB, "1"})
    // Checks a*c-b*c => (a-b)*c
    public long test20(long a, long b, long c) {
        return a*c - b*c;
    }

    @Test
    @IR(counts = {IRNode.MUL, "1",
                  IRNode.SUB, "1"})
    // Checks a*b-c*a => a*(b-c)
    public long test21(long a, long b, long c) {
        return a*b - c*a;
    }
}