File: TestSubIdealC0Minus_YPlusC1_.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 (133 lines) | stat: -rw-r--r-- 5,038 bytes parent folder | download | duplicates (6)
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
/*
 * Copyright (c) 2021, 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.
 */

/*
 * @test
 * @bug 8277882
 * @summary New subnode ideal optimization: converting "c0 - (x + c1)" into "(c0 - c1) - x"
 * @library /test/lib
 * @run main/othervm -XX:-TieredCompilation -Xbatch
 *                   -XX:CompileCommand=dontinline,compiler.c2.TestSubIdealC0Minus_YPlusC1_::test*
 *                   -XX:CompileCommand=compileonly,compiler.c2.TestSubIdealC0Minus_YPlusC1_::test*
 *                   compiler.c2.TestSubIdealC0Minus_YPlusC1_
 */
package compiler.c2;

import jdk.test.lib.Asserts;

public class TestSubIdealC0Minus_YPlusC1_ {

    private static final int I_C0_0 = 1234;
    private static final int I_C1 = 1234;
    private static final int I_C0_1 = 4321;

    private static final long L_C0_0 = 123_456_789_123L;
    private static final long L_C1 = 123_456_789_123L;
    private static final long L_C0_1 = 654_321;

    public static int testIC0EqualsC1(int x) {
        return I_C0_0 - (x + I_C1);
    }

    public static long testLC0EqualsC1(long x) {
        return L_C0_0 - (x + L_C1);
    }

    public static int testIC0NotEqualsC1(int x) {
        return I_C0_1 - (x + I_C1);
    }

    public static long testLC0NotEqualsC1(long x) {
        return L_C0_1 - (x + L_C1);
    }

    public static int testIXPlusC1IsOverflow(int x) {
        return Integer.MAX_VALUE - (x + Integer.MAX_VALUE);
    }

    public static long testLXPlusC1IsOverflow(long x) {
        return Long.MAX_VALUE - (x + Long.MAX_VALUE);
    }

    public static int testIXPlusC1IsUnderflow(int x) {
        return Integer.MIN_VALUE - (x + Integer.MIN_VALUE);
    }

    public static long testLXPlusC1IsUnderflow(long x) {
        return Long.MIN_VALUE - (x + Long.MIN_VALUE);
    }

    public static int testIC0MinusC1IsOverflow(int x) {
        return Integer.MAX_VALUE - (x + Integer.MIN_VALUE);
    }

    public static long testLC0MinusC1IsOverflow(long x) {
        return Long.MAX_VALUE - (x + Long.MIN_VALUE);
    }

    public static int testIC0MinusC1IsUnderflow(int x) {
        return Integer.MIN_VALUE - (x + Integer.MAX_VALUE);
    }

    public static long testLC0MinusC1IsUnderflow(long x) {
        return Long.MIN_VALUE - (x + Long.MAX_VALUE);
    }

    public static int testIResultIsOverflow(int x) {
        return 2147483637 - (x + 10); // Integer.MAX_VALUE == 2147483647
    }

    public static long testLResultIsOverflow(long x) {
        return 9223372036854775797L - (x + 10); // Long.MAX_VALUE == 9223372036854775807
    }

    public static int testIResultIsUnderflow(int x) {
        return -2147483637 - (x + 10); // Integer.MIN_VALUE == -2147483648
    }

    public static long testLResultIsUnderflow(long x) {
        return -9223372036854775797L - (x + 10); // Long.MIN_VALUE == -9223372036854775808
    }

    public static void main(String... args) {
        for (int i = 0; i < 50_000; i++) {
            Asserts.assertTrue(testIC0EqualsC1(10) == -10);
            Asserts.assertTrue(testIC0NotEqualsC1(100) == 2987);
            Asserts.assertTrue(testIXPlusC1IsOverflow(10) == -10);
            Asserts.assertTrue(testIXPlusC1IsUnderflow(-10) == 10);
            Asserts.assertTrue(testIC0MinusC1IsOverflow(10) == -11);
            Asserts.assertTrue(testIC0MinusC1IsUnderflow(10) == -9);
            Asserts.assertTrue(testIResultIsOverflow(-21) == Integer.MIN_VALUE);
            Asserts.assertTrue(testIResultIsUnderflow(2) == Integer.MAX_VALUE);

            Asserts.assertTrue(testLC0EqualsC1(10) == -10);
            Asserts.assertTrue(testLC0NotEqualsC1(100) == -123456134902L);
            Asserts.assertTrue(testLXPlusC1IsOverflow(10) == -10);
            Asserts.assertTrue(testLXPlusC1IsUnderflow(-10) == 10);
            Asserts.assertTrue(testLC0MinusC1IsOverflow(10) == -11);
            Asserts.assertTrue(testLC0MinusC1IsUnderflow(10) == -9);
            Asserts.assertTrue(testLResultIsOverflow(-21) == Long.MIN_VALUE);
            Asserts.assertTrue(testLResultIsUnderflow(2) == Long.MAX_VALUE);
        }
    }
}