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
|
/*
* Copyright (c) 2023, 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.
*/
/**
* @test id=Vanilla-Unaligned
* @bug 8302652 8314612
* @summary Special test cases for PhaseIdealLoop::move_unordered_reduction_out_of_loop
* @library /test/lib /
* @run driver compiler.loopopts.superword.TestUnorderedReduction Vanilla-Unaligned
*/
/**
* @test id=Vanilla-Aligned
* @bug 8302652 8314612
* @summary Special test cases for PhaseIdealLoop::move_unordered_reduction_out_of_loop
* @library /test/lib /
* @run driver compiler.loopopts.superword.TestUnorderedReduction Vanilla-Aligned
*/
/**
* @test id=MaxVectorSize16-Unaligned
* @bug 8302652 8314612
* @summary Special test cases for PhaseIdealLoop::move_unordered_reduction_out_of_loop
* @library /test/lib /
* @run driver compiler.loopopts.superword.TestUnorderedReduction MaxVectorSize16-Unaligned
*/
/**
* @test id=MaxVectorSize32-Aligned
* @bug 8302652 8314612
* @summary Special test cases for PhaseIdealLoop::move_unordered_reduction_out_of_loop
* @library /test/lib /
* @run driver compiler.loopopts.superword.TestUnorderedReduction MaxVectorSize32-Aligned
*/
package compiler.loopopts.superword;
import compiler.lib.ir_framework.*;
public class TestUnorderedReduction {
static final int RANGE = 1024;
static final int ITER = 10;
public static void main(String[] args) {
TestFramework framework = new TestFramework(TestUnorderedReduction.class);
framework.addFlags("-Xbatch",
"-XX:CompileCommand=compileonly,compiler.loopopts.superword.TestUnorderedReduction::test*");
if (args.length != 1) {
throw new RuntimeException("Test requires exactly one argument!");
}
switch (args[0]) {
case "Vanilla-Unaligned" -> { framework.addFlags("-XX:+IgnoreUnrecognizedVMOptions", "-XX:-AlignVector"); }
case "Vanilla-Aligned" -> { framework.addFlags("-XX:+IgnoreUnrecognizedVMOptions", "-XX:+AlignVector"); }
case "MaxVectorSize16-Unaligned" -> { framework.addFlags("-XX:+IgnoreUnrecognizedVMOptions", "-XX:-AlignVector", "-XX:MaxVectorSize=16"); }
case "MaxVectorSize32-Aligned" -> { framework.addFlags("-XX:+IgnoreUnrecognizedVMOptions", "-XX:+AlignVector", "-XX:MaxVectorSize=32"); }
default -> { throw new RuntimeException("Test argument not recognized: " + args[0]); }
}
framework.start();
}
@Run(test = {"test1", "test2", "test3"})
@Warmup(0)
public void runTests() throws Exception {
int[] data = new int[RANGE];
init(data);
for (int i = 0; i < ITER; i++) {
int r1 = test1(data, i);
int r2 = ref1(data, i);
if (r1 != r2) {
throw new RuntimeException("Wrong result test1: " + r1 + " != " + r2);
}
}
for (int i = 0; i < ITER; i++) {
int r1 = test2(data, i);
int r2 = ref2(data, i);
if (r1 != r2) {
throw new RuntimeException("Wrong result test2: " + r1 + " != " + r2);
}
}
for (int i = 0; i < ITER; i++) {
int r1 = test3(data, i);
int r2 = ref3(data, i);
if (r1 != r2) {
throw new RuntimeException("Wrong result test3: " + r1 + " != " + r2);
}
}
}
@Test
@IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
IRNode.ADD_VI, "= 0",
IRNode.ADD_REDUCTION_VI, "> 0"}, // count can be high
applyIfAnd = {"MaxVectorSize", "=16", "AlignVector", "false"},
applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
static int test1(int[] data, int sum) {
// Vectorizes, but the UnorderedReduction cannot be moved out of the loop,
// because we have a use inside the loop.
int x = 0;
for (int i = 0; i < RANGE; i+=8) {
sum += 11 * data[i+0]; // vec 1 (16 bytes)
sum += 11 * data[i+1];
sum += 11 * data[i+2];
sum += 11 * data[i+3];
x = sum + i; // vec 1 reduction has more than 1 use
sum += 11 * data[i+4]; // vec 2 (next 16 bytes)
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum + x;
}
static int ref1(int[] data, int sum) {
int x = 0;
for (int i = 0; i < RANGE; i+=8) {
sum += 11 * data[i+0];
sum += 11 * data[i+1];
sum += 11 * data[i+2];
sum += 11 * data[i+3];
x = sum + i;
sum += 11 * data[i+4];
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum + x;
}
@Test
@IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
IRNode.ADD_VI, "> 0",
IRNode.ADD_REDUCTION_VI, "> 0",
IRNode.ADD_REDUCTION_VI, "<= 2"}, // count must be low
applyIfAnd = {"MaxVectorSize", "=16", "AlignVector", "false"},
applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
static int test2(int[] data, int sum) {
for (int i = 0; i < RANGE; i+=8) {
// Vectorized, and UnorderedReduction moved outside loop.
sum += 11 * data[i+0]; // vec 1
sum += 11 * data[i+1];
sum += 11 * data[i+2];
sum += 11 * data[i+3];
sum += 11 * data[i+4]; // vec 2
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum;
}
static int ref2(int[] data, int sum) {
for (int i = 0; i < RANGE; i+=8) {
sum += 11 * data[i+0];
sum += 11 * data[i+1];
sum += 11 * data[i+2];
sum += 11 * data[i+3];
sum += 11 * data[i+4];
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum;
}
@Test
@IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
IRNode.MUL_VI, "> 0",
IRNode.ADD_VI, "= 0", // reduction not moved out of loop
IRNode.ADD_REDUCTION_VI, "> 0",},
applyIfAnd = {"MaxVectorSize", "=16", "AlignVector", "false"},
applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
static int test3(int[] data, int sum) {
for (int i = 0; i < RANGE; i+=8) {
// Partial vectorization of reduction chain -> cannot move out of loop
sum += 11 * data[i+0]; // vec 1
sum += 13 & data[i+1]; // ---------- breaks vec 1 -> scalar reductions
sum += 11 * data[i+2];
sum += 11 * data[i+3];
sum += 11 * data[i+4]; // vec 2 -> vectorizes -> vector reduction
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum;
}
static int ref3(int[] data, int sum) {
for (int i = 0; i < RANGE; i+=8) {
sum += 11 * data[i+0];
sum += 13 & data[i+1];
sum += 11 * data[i+2];
sum += 11 * data[i+3];
sum += 11 * data[i+4];
sum += 11 * data[i+5];
sum += 11 * data[i+6];
sum += 11 * data[i+7];
}
return sum;
}
static void init(int[] data) {
for (int i = 0; i < RANGE; i++) {
data[i] = i + 1;
}
}
}
|
