File: TestArrayFillAntiDependence.java

package info (click to toggle)
openjdk-25 25~32ea-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 825,280 kB
  • sloc: java: 5,584,902; cpp: 1,333,941; xml: 1,321,242; ansic: 487,993; asm: 404,003; objc: 21,088; sh: 15,102; javascript: 13,265; python: 8,319; makefile: 2,515; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (212 lines) | stat: -rw-r--r-- 7,201 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
/*
 * Copyright (c) 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.loopopts;

import jdk.test.lib.Asserts;

/**
 * @test
 * @bug 8351468
 * @summary Test that loads anti-dependent on array fill intrinsics are
 *          scheduled correctly, for different load and array fill types.
 *          See detailed comments in testShort() below.
 * @library /test/lib
 * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions
 *                   -Xbatch -XX:-TieredCompilation
 *                   -XX:CompileOnly=compiler.loopopts.TestArrayFillAntiDependence::test*
 *                   -XX:CompileCommand=quiet -XX:LoopUnrollLimit=0 -XX:+OptimizeFill
 *                   compiler.loopopts.TestArrayFillAntiDependence
 * @run main/othervm compiler.loopopts.TestArrayFillAntiDependence
 */

public class TestArrayFillAntiDependence {

    static int N = 10;
    static short M = 4;
    static boolean BOOLEAN_VAL = true;
    static char CHAR_VAL = 42;
    static float FLOAT_VAL = 42.0f;
    static double DOUBLE_VAL = 42.0;
    static byte BYTE_VAL = 42;
    static short SHORT_VAL = 42;
    static int INT_VAL = 42;
    static long LONG_VAL = 42;

    static boolean testBoolean(int pos, int samePos) {
        assert pos == samePos;
        boolean total = false;
        boolean[] array = new boolean[N];
        array[pos] = BOOLEAN_VAL;
        for (int i = 0; i < M; i++) {
            total |= array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = false;
            }
        }
        return total;
    }

    static char testChar(int pos, int samePos) {
        assert pos == samePos;
        char total = 0;
        char[] array = new char[N];
        array[pos] = CHAR_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0;
            }
        }
        return total;
    }

    static float testFloat(int pos, int samePos) {
        assert pos == samePos;
        float total = 0.0f;
        float[] array = new float[N];
        array[pos] = FLOAT_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0.0f;
            }
        }
        return total;
    }

    static double testDouble(int pos, int samePos) {
        assert pos == samePos;
        double total = 0.0;
        double[] array = new double[N];
        array[pos] = DOUBLE_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0.0;
            }
        }
        return total;
    }

    static byte testByte(int pos, int samePos) {
        assert pos == samePos;
        byte total = 0;
        byte[] array = new byte[N];
        array[pos] = BYTE_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0;
            }
        }
        return total;
    }

    static short testShort(int pos, int samePos) {
        // This pre-condition is necessary to reproduce the miscompilation, but
        // should not be exploited by C2 for optimization.
        assert pos == samePos;
        short total = 0;
        short[] array = new short[N];
        array[pos] = SHORT_VAL;
        for (int i = 0; i < M; i++) {
            // This load is wrongly scheduled after the loop below, which is
            // transformed into a call to arrayof_jshort_fill and clears the
            // entire array. As a consequence, the function returns 0 instead of
            // the expected SHORT_VAL.
            // The load is wrongly allowed to be moved beyond the loop
            // (arrayof_jshort_fill call) because their anti-dependence is
            // missed. This is because the call operates on a different memory
            // slice (char[] instead of the expected short[]).
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0;
            }
        }
        return total;
    }

    static int testInt(int pos, int samePos) {
        assert pos == samePos;
        int total = 0;
        int[] array = new int[N];
        array[pos] = INT_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0;
            }
        }
        return total;
    }

    static long testLong(int pos, int samePos) {
        assert pos == samePos;
        long total = 0;
        long[] array = new long[N];
        array[pos] = LONG_VAL;
        for (int i = 0; i < M; i++) {
            total += array[samePos];
            for (int t = 0; t < array.length; t++) {
                array[t] = 0;
            }
        }
        return total;
    }

    public static void main(String[] args) {
        for (int i = 0; i < 10_000; i++) {
            boolean result = testBoolean(0, 0);
            Asserts.assertEquals(BOOLEAN_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            char result = testChar(0, 0);
            Asserts.assertEquals(CHAR_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            float result = testFloat(0, 0);
            Asserts.assertEquals(FLOAT_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            double result = testDouble(0, 0);
            Asserts.assertEquals(DOUBLE_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            byte result = testByte(0, 0);
            Asserts.assertEquals(BYTE_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            short result = testShort(0, 0);
            Asserts.assertEquals(SHORT_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            int result = testInt(0, 0);
            Asserts.assertEquals(INT_VAL, result);
        }
        for (int i = 0; i < 10_000; i++) {
            long result = testLong(0, 0);
            Asserts.assertEquals(LONG_VAL, result);
        }
    }
}