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
|
/*
* Copyright (c) 2020, 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.
*/
/**
* @test
* @bug 8240248
* @summary Add C2 x86 Superword support for scalar logical reduction optimizations : int test
* @library /test/lib /
* @run driver compiler.loopopts.superword.RedTest_int
*/
package compiler.loopopts.superword;
import compiler.lib.ir_framework.*;
public class RedTest_int {
static final int NUM = 1024;
static final int ITER = 8000;
public static void main(String[] args) throws Exception {
TestFramework framework = new TestFramework();
framework.addFlags("-XX:+IgnoreUnrecognizedVMOptions",
"-XX:LoopUnrollLimit=250",
"-XX:CompileThresholdScaling=0.1");
int i = 0;
Scenario[] scenarios = new Scenario[6];
for (int maxUnroll : new int[] {4, 8, 16}) {
scenarios[i] = new Scenario(i, "-XX:+SuperWordReductions",
"-XX:LoopMaxUnroll=" + maxUnroll,
"-XX:-TieredCompilation");
i++;
}
for (int maxUnroll : new int[] {4, 8, 16}) {
scenarios[i] = new Scenario(i, "-XX:-SuperWordReductions",
"-XX:LoopMaxUnroll=" + maxUnroll);
i++;
}
framework.addScenarios(scenarios);
framework.start();
}
@Run(test = {"sumReductionImplement",
"orReductionImplement",
"andReductionImplement",
"xorReductionImplement",
"mulReductionImplement"},
mode = RunMode.STANDALONE)
public void runTests() throws Exception {
int[] a = new int[NUM];
int[] b = new int[NUM];
int[] c = new int[NUM];
reductionInit1(a, b, c);
int total = 0;
int valid = 1454604288;
for (int j = 0; j < ITER; j++) {
total = sumReductionImplement(a, b, c, total);
}
testCorrectness(total, valid, "Add Reduction");
total = 0;
valid = 91586175;
for (int j = 0; j < ITER; j++) {
total = orReductionImplement(a, b, c, total);
}
testCorrectness(total, valid, "Or Reduction");
total = -1;
valid = 91492404;
for (int j = 0; j < ITER; j++) {
total = andReductionImplement(a, b, c, total);
}
testCorrectness(total, valid, "And Reduction");
total = -1;
valid = -1;
for (int j = 0; j < ITER; j++) {
total = xorReductionImplement(a, b, c, total);
}
testCorrectness(total, valid, "Xor Reduction");
reductionInit2(a, b, c);
total = 1;
valid = 1690042369;
for (int j = 0; j < ITER; j++) {
total = mulReductionImplement(a, b, c, total);
}
testCorrectness(total, valid, "Mul Reduction");
}
public static void reductionInit1(
int[] a,
int[] b,
int[] c) {
for (int i = 0; i < a.length; i++) {
a[i] = (i%2) + 0x4099;
b[i] = (i%2) + 0x1033;
c[i] = (i%2) + 0x455;
}
}
public static void reductionInit2(
int[] a,
int[] b,
int[] c) {
for (int i = 0; i < a.length; i++) {
a[i] = 0x11;
b[i] = 0x12;
c[i] = 0x13;
}
}
@Test
@IR(applyIf = {"SuperWordReductions", "false"},
failOn = {IRNode.ADD_REDUCTION_VI})
@IR(applyIfCPUFeature = {"sse4.1", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.ADD_REDUCTION_VI, ">= 1", IRNode.ADD_REDUCTION_VI, "<= 2"}) // one for main-loop, one for vector-post-loop
@IR(applyIfPlatform = {"riscv64", "true"},
applyIfCPUFeature = {"rvv", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.ADD_REDUCTION_VI, ">= 1", IRNode.ADD_REDUCTION_VI, "<= 2"}) // one for main-loop, one for vector-post-loop
public static int sumReductionImplement(
int[] a,
int[] b,
int[] c,
int total) {
for (int i = 0; i < a.length; i++) {
total += (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]);
}
return total;
}
@Test
@IR(applyIf = {"SuperWordReductions", "false"},
failOn = {IRNode.OR_REDUCTION_V})
@IR(applyIfCPUFeature = {"sse4.1", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.OR_REDUCTION_V, ">= 1", IRNode.OR_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
@IR(applyIfPlatform = {"riscv64", "true"},
applyIfCPUFeature = {"rvv", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.OR_REDUCTION_V, ">= 1", IRNode.OR_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
public static int orReductionImplement(
int[] a,
int[] b,
int[] c,
int total) {
for (int i = 0; i < a.length; i++) {
total |= (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]);
}
return total;
}
@Test
@IR(applyIf = {"SuperWordReductions", "false"},
failOn = {IRNode.AND_REDUCTION_V})
@IR(applyIfCPUFeature = {"sse4.1", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.AND_REDUCTION_V, ">= 1", IRNode.AND_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
@IR(applyIfPlatform = {"riscv64", "true"},
applyIfCPUFeature = {"rvv", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.AND_REDUCTION_V, ">= 1", IRNode.AND_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
public static int andReductionImplement(
int[] a,
int[] b,
int[] c,
int total) {
for (int i = 0; i < a.length; i++) {
total &= (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]);
}
return total;
}
@Test
@IR(applyIf = {"SuperWordReductions", "false"},
failOn = {IRNode.XOR_REDUCTION_V})
@IR(applyIfCPUFeature = {"sse4.1", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.XOR_REDUCTION_V, ">= 1", IRNode.XOR_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
@IR(applyIfPlatform = {"riscv64", "true"},
applyIfCPUFeature = {"rvv", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.XOR_REDUCTION_V, ">= 1", IRNode.XOR_REDUCTION_V, "<= 2"}) // one for main-loop, one for vector-post-loop
public static int xorReductionImplement(
int[] a,
int[] b,
int[] c,
int total) {
for (int i = 0; i < a.length; i++) {
total ^= (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]);
}
return total;
}
@Test
@IR(applyIf = {"SuperWordReductions", "false"},
failOn = {IRNode.MUL_REDUCTION_VI})
@IR(applyIfCPUFeature = {"sse4.1", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.MUL_REDUCTION_VI, ">= 1", IRNode.MUL_REDUCTION_VI, "<= 2"}) // one for main-loop, one for vector-post-loop
@IR(applyIfPlatform = {"riscv64", "true"},
applyIfCPUFeature = {"rvv", "true"},
applyIfAnd = {"SuperWordReductions", "true", "LoopMaxUnroll", ">= 8"},
counts = {IRNode.MUL_REDUCTION_VI, ">= 1", IRNode.MUL_REDUCTION_VI, "<= 2"}) // one for main-loop, one for vector-post-loop
public static int mulReductionImplement(
int[] a,
int[] b,
int[] c,
int total) {
for (int i = 0; i < a.length; i++) {
total *= (a[i] * b[i]) + (a[i] * c[i]) + (b[i] * c[i]);
}
return total;
}
public static void testCorrectness(
int total,
int valid,
String op) throws Exception {
if (total != valid) {
throw new Exception(
"Invalid total: " + total + " " +
"Expected value = " + valid + " " + op + ": Failed");
}
}
}
|
