blob: 85d8b1b70b0c7dcb322333099d4ba422348255ee [file] [log] [blame]
Aart Bikf8f5a162017-02-06 15:35:29 -08001/*
2 * Copyright (C) 2017 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17/**
18 * Functional tests for SIMD vectorization.
19 */
20public class Main {
21
22 static int[] a;
23
24 //
25 // Arithmetic operations.
26 //
27
28 /// CHECK-START: void Main.add(int) loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070029 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080030 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
31 //
Aart Bik9cb7fe42017-11-30 11:46:45 -080032 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.add(int) loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -070033 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +020034 /// CHECK-DAG: VecAdd loop:<<Loop>> outer_loop:none
35 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080036 static void add(int x) {
37 for (int i = 0; i < 128; i++)
38 a[i] += x;
39 }
40
41 /// CHECK-START: void Main.sub(int) loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070042 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080043 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
44 //
Aart Bik9cb7fe42017-11-30 11:46:45 -080045 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.sub(int) loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -070046 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +020047 /// CHECK-DAG: VecSub loop:<<Loop>> outer_loop:none
48 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080049 static void sub(int x) {
50 for (int i = 0; i < 128; i++)
51 a[i] -= x;
52 }
53
54 /// CHECK-START: void Main.mul(int) loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070055 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080056 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
57 //
Aart Bik9cb7fe42017-11-30 11:46:45 -080058 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.mul(int) loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -070059 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +020060 /// CHECK-DAG: VecMul loop:<<Loop>> outer_loop:none
61 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080062 static void mul(int x) {
63 for (int i = 0; i < 128; i++)
64 a[i] *= x;
65 }
66
67 /// CHECK-START: void Main.div(int) loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070068 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080069 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
70 //
71 /// CHECK-START: void Main.div(int) loop_optimization (after)
Aart Bik50e20d52017-05-05 14:07:29 -070072 /// CHECK-NOT: VecDiv
Aart Bikf8f5a162017-02-06 15:35:29 -080073 //
74 // Not supported on any architecture.
75 //
76 static void div(int x) {
77 for (int i = 0; i < 128; i++)
78 a[i] /= x;
79 }
80
81 /// CHECK-START: void Main.neg() loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070082 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080083 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
84 //
Aart Bik9cb7fe42017-11-30 11:46:45 -080085 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.neg() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -070086 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +020087 /// CHECK-DAG: VecNeg loop:<<Loop>> outer_loop:none
88 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080089 static void neg() {
90 for (int i = 0; i < 128; i++)
91 a[i] = -a[i];
92 }
93
94 /// CHECK-START: void Main.not() loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -070095 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -080096 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
97 //
Aart Bik9cb7fe42017-11-30 11:46:45 -080098 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.not() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -070099 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +0200100 /// CHECK-DAG: VecNot loop:<<Loop>> outer_loop:none
101 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800102 static void not() {
103 for (int i = 0; i < 128; i++)
104 a[i] = ~a[i];
105 }
106
107 /// CHECK-START: void Main.shl4() loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -0700108 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800109 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
110 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800111 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shl4() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700112 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +0200113 /// CHECK-DAG: VecShl loop:<<Loop>> outer_loop:none
114 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800115 static void shl4() {
116 for (int i = 0; i < 128; i++)
117 a[i] <<= 4;
118 }
119
120 /// CHECK-START: void Main.sar2() loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -0700121 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800122 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
Artem Serov8f7c4102017-06-21 11:21:37 +0100123 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800124 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.sar2() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700125 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +0200126 /// CHECK-DAG: VecShr loop:<<Loop>> outer_loop:none
127 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800128 static void sar2() {
129 for (int i = 0; i < 128; i++)
130 a[i] >>= 2;
131 }
132
133 /// CHECK-START: void Main.shr2() loop_optimization (before)
Aart Bik8c6c3572017-10-25 11:48:48 -0700134 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800135 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
136 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800137 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr2() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700138 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
Goran Jakovljevic19680d32017-05-11 10:38:36 +0200139 /// CHECK-DAG: VecUShr loop:<<Loop>> outer_loop:none
140 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800141 static void shr2() {
142 for (int i = 0; i < 128; i++)
143 a[i] >>>= 2;
144 }
145
146 //
147 // Shift sanity.
148 //
149
Aart Bik50e20d52017-05-05 14:07:29 -0700150 // Expose constants to optimizing compiler, but not to front-end.
151 public static int $opt$inline$IntConstant32() { return 32; }
152 public static int $opt$inline$IntConstant33() { return 33; }
153 public static int $opt$inline$IntConstantMinus254() { return -254; }
154
155 /// CHECK-START: void Main.shr32() instruction_simplifier$after_inlining (before)
156 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 32 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700157 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700158 /// CHECK-DAG: <<UShr:i\d+>> UShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
159 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
160 //
161 /// CHECK-START: void Main.shr32() instruction_simplifier$after_inlining (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700162 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700163 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Get>>] loop:<<Loop>> outer_loop:none
164 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800165 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr32() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700166 /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none
167 /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Get>>] loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800168 static void shr32() {
Aart Bik50e20d52017-05-05 14:07:29 -0700169 // TODO: remove a[i] = a[i] altogether?
Aart Bikf8f5a162017-02-06 15:35:29 -0800170 for (int i = 0; i < 128; i++)
Aart Bik50e20d52017-05-05 14:07:29 -0700171 a[i] >>>= $opt$inline$IntConstant32(); // 0, since & 31
Aart Bikf8f5a162017-02-06 15:35:29 -0800172 }
173
Aart Bik50e20d52017-05-05 14:07:29 -0700174 /// CHECK-START: void Main.shr33() instruction_simplifier$after_inlining (before)
175 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 33 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700176 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700177 /// CHECK-DAG: <<UShr:i\d+>> UShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
178 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
179 //
180 /// CHECK-START: void Main.shr33() instruction_simplifier$after_inlining (after)
181 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 1 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700182 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700183 /// CHECK-DAG: <<UShr:i\d+>> UShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
184 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
185 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800186 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr33() loop_optimization (after)
Aart Bik8c6c3572017-10-25 11:48:48 -0700187 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 1 loop:none
188 /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none
189 /// CHECK-DAG: <<UShr:d\d+>> VecUShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
190 /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
Aart Bikf8f5a162017-02-06 15:35:29 -0800191 static void shr33() {
192 for (int i = 0; i < 128; i++)
Aart Bik50e20d52017-05-05 14:07:29 -0700193 a[i] >>>= $opt$inline$IntConstant33(); // 1, since & 31
194 }
195
196 /// CHECK-START: void Main.shrMinus254() instruction_simplifier$after_inlining (before)
197 /// CHECK-DAG: <<Dist:i\d+>> IntConstant -254 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700198 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700199 /// CHECK-DAG: <<UShr:i\d+>> UShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
200 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
201 //
202 /// CHECK-START: void Main.shrMinus254() instruction_simplifier$after_inlining (after)
203 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 2 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700204 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700205 /// CHECK-DAG: <<UShr:i\d+>> UShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
206 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
207 //
Aart Bik9cb7fe42017-11-30 11:46:45 -0800208 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shrMinus254() loop_optimization (after)
Goran Jakovljevic19680d32017-05-11 10:38:36 +0200209 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 2 loop:none
Aart Bik8c6c3572017-10-25 11:48:48 -0700210 /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none
211 /// CHECK-DAG: <<UShr:d\d+>> VecUShr [<<Get>>,<<Dist>>] loop:<<Loop>> outer_loop:none
212 /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<UShr>>] loop:<<Loop>> outer_loop:none
Aart Bik50e20d52017-05-05 14:07:29 -0700213 static void shrMinus254() {
214 for (int i = 0; i < 128; i++)
215 a[i] >>>= $opt$inline$IntConstantMinus254(); // 2, since & 31
Aart Bikf8f5a162017-02-06 15:35:29 -0800216 }
217
218 //
219 // Loop bounds.
220 //
221
222 static void bounds() {
223 for (int i = 1; i < 127; i++)
224 a[i] += 11;
225 }
226
227 //
228 // Test Driver.
229 //
230
231 public static void main(String[] args) {
232 // Set up.
233 a = new int[128];
234 for (int i = 0; i < 128; i++) {
235 a[i] = i;
236 }
237 // Arithmetic operations.
238 add(2);
239 for (int i = 0; i < 128; i++) {
240 expectEquals(i + 2, a[i], "add");
241 }
242 sub(2);
243 for (int i = 0; i < 128; i++) {
244 expectEquals(i, a[i], "sub");
245 }
246 mul(2);
247 for (int i = 0; i < 128; i++) {
248 expectEquals(i + i, a[i], "mul");
249 }
250 div(2);
251 for (int i = 0; i < 128; i++) {
252 expectEquals(i, a[i], "div");
253 }
254 neg();
255 for (int i = 0; i < 128; i++) {
256 expectEquals(-i, a[i], "neg");
257 }
258 // Loop bounds.
259 bounds();
260 expectEquals(0, a[0], "bounds0");
261 for (int i = 1; i < 127; i++) {
262 expectEquals(11 - i, a[i], "bounds");
263 }
264 expectEquals(-127, a[127], "bounds127");
265 // Shifts.
266 for (int i = 0; i < 128; i++) {
267 a[i] = 0xffffffff;
268 }
269 shl4();
270 for (int i = 0; i < 128; i++) {
271 expectEquals(0xfffffff0, a[i], "shl4");
272 }
273 sar2();
274 for (int i = 0; i < 128; i++) {
275 expectEquals(0xfffffffc, a[i], "sar2");
276 }
277 shr2();
278 for (int i = 0; i < 128; i++) {
279 expectEquals(0x3fffffff, a[i], "shr2");
280 }
281 shr32();
282 for (int i = 0; i < 128; i++) {
283 expectEquals(0x3fffffff, a[i], "shr32");
284 }
285 shr33();
286 for (int i = 0; i < 128; i++) {
287 expectEquals(0x1fffffff, a[i], "shr33");
288 }
Aart Bik50e20d52017-05-05 14:07:29 -0700289 shrMinus254();
290 for (int i = 0; i < 128; i++) {
291 expectEquals(0x07ffffff, a[i], "shrMinus254");
292 }
293 // Bit-wise not operator.
Aart Bikf8f5a162017-02-06 15:35:29 -0800294 not();
295 for (int i = 0; i < 128; i++) {
Aart Bik50e20d52017-05-05 14:07:29 -0700296 expectEquals(0xf8000000, a[i], "not");
Aart Bikf8f5a162017-02-06 15:35:29 -0800297 }
298 // Done.
299 System.out.println("passed");
300 }
301
302 private static void expectEquals(int expected, int result, String action) {
303 if (expected != result) {
304 throw new Error("Expected: " + expected + ", found: " + result + " for " + action);
305 }
306 }
307}