1 /* 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 */ 20 public class Main { 21 22 static int[] a; 23 24 // 25 // Arithmetic operations. 26 // 27 28 /// CHECK-START: void Main.add(int) loop_optimization (before) 29 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 30 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 31 // 32 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.add(int) loop_optimization (after) 33 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 34 /// CHECK-DAG: VecAdd loop:<<Loop>> outer_loop:none 35 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 36 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) 42 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 43 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 44 // 45 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.sub(int) loop_optimization (after) 46 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 47 /// CHECK-DAG: VecSub loop:<<Loop>> outer_loop:none 48 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 49 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) 55 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 56 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 57 // 58 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.mul(int) loop_optimization (after) 59 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 60 /// CHECK-DAG: VecMul loop:<<Loop>> outer_loop:none 61 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 62 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) 68 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 69 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 70 // 71 /// CHECK-START: void Main.div(int) loop_optimization (after) 72 /// CHECK-NOT: VecDiv 73 // 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) 82 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 83 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 84 // 85 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.neg() loop_optimization (after) 86 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 87 /// CHECK-DAG: VecNeg loop:<<Loop>> outer_loop:none 88 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 89 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) 95 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 96 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 97 // 98 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.not() loop_optimization (after) 99 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 100 /// CHECK-DAG: VecNot loop:<<Loop>> outer_loop:none 101 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 102 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) 108 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 109 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 110 // 111 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shl4() loop_optimization (after) 112 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 113 /// CHECK-DAG: VecShl loop:<<Loop>> outer_loop:none 114 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 115 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) 121 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 122 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 123 // 124 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.sar2() loop_optimization (after) 125 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 126 /// CHECK-DAG: VecShr loop:<<Loop>> outer_loop:none 127 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 128 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) 134 /// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none 135 /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none 136 // 137 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr2() loop_optimization (after) 138 /// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none 139 /// CHECK-DAG: VecUShr loop:<<Loop>> outer_loop:none 140 /// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none 141 static void shr2() { 142 for (int i = 0; i < 128; i++) 143 a[i] >>>= 2; 144 } 145 146 // 147 // Shift sanity. 148 // 149 150 // 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 157 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 158 /// 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) 162 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 163 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Get>>] loop:<<Loop>> outer_loop:none 164 // 165 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr32() loop_optimization (after) 166 /// 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 168 static void shr32() { 169 // TODO: remove a[i] = a[i] altogether? 170 for (int i = 0; i < 128; i++) 171 a[i] >>>= $opt$inline$IntConstant32(); // 0, since & 31 172 } 173 174 /// CHECK-START: void Main.shr33() instruction_simplifier$after_inlining (before) 175 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 33 loop:none 176 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 177 /// 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 182 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 183 /// 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 // 186 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shr33() loop_optimization (after) 187 /// 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 191 static void shr33() { 192 for (int i = 0; i < 128; i++) 193 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 198 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 199 /// 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 204 /// CHECK-DAG: <<Get:i\d+>> ArrayGet loop:<<Loop:B\d+>> outer_loop:none 205 /// 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 // 208 /// CHECK-START-{ARM,ARM64,MIPS64}: void Main.shrMinus254() loop_optimization (after) 209 /// CHECK-DAG: <<Dist:i\d+>> IntConstant 2 loop:none 210 /// 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 213 static void shrMinus254() { 214 for (int i = 0; i < 128; i++) 215 a[i] >>>= $opt$inline$IntConstantMinus254(); // 2, since & 31 216 } 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 } 289 shrMinus254(); 290 for (int i = 0; i < 128; i++) { 291 expectEquals(0x07ffffff, a[i], "shrMinus254"); 292 } 293 // Bit-wise not operator. 294 not(); 295 for (int i = 0; i < 128; i++) { 296 expectEquals(0xf8000000, a[i], "not"); 297 } 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 } 308
