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 * Tests for SAD (sum of absolute differences). 19 * 20 * Special case, char array that is first casted to short, forcing sign extension. 21 */ 22 public class SimdSadShort2 { 23 24 // TODO: lower precision still coming, b/64091002 25 sadCastedChar2Short(char[] s1, char[] s2)26 private static short sadCastedChar2Short(char[] s1, char[] s2) { 27 int min_length = Math.min(s1.length, s2.length); 28 short sad = 0; 29 for (int i = 0; i < min_length; i++) { 30 sad += Math.abs(((short) s1[i]) - ((short) s2[i])); 31 } 32 return sad; 33 } 34 sadCastedChar2ShortAlt(char[] s1, char[] s2)35 private static short sadCastedChar2ShortAlt(char[] s1, char[] s2) { 36 int min_length = Math.min(s1.length, s2.length); 37 short sad = 0; 38 for (int i = 0; i < min_length; i++) { 39 short s = (short) s1[i]; 40 short p = (short) s2[i]; 41 sad += s >= p ? s - p : p - s; 42 } 43 return sad; 44 } 45 sadCastedChar2ShortAlt2(char[] s1, char[] s2)46 private static short sadCastedChar2ShortAlt2(char[] s1, char[] s2) { 47 int min_length = Math.min(s1.length, s2.length); 48 short sad = 0; 49 for (int i = 0; i < min_length; i++) { 50 short s = (short) s1[i]; 51 short p = (short) s2[i]; 52 int x = s - p; 53 if (x < 0) x = -x; 54 sad += x; 55 } 56 return sad; 57 } 58 59 /// CHECK-START: int SimdSadShort2.sadCastedChar2Int(char[], char[]) instruction_simplifier (before) 60 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 61 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 62 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 63 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 64 /// CHECK-DAG: <<BC1:i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 65 /// CHECK-DAG: <<BC2:i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 66 /// CHECK-DAG: <<Get1:c\d+>> ArrayGet [{{l\d+}},<<BC1>>] loop:<<Loop>> outer_loop:none 67 /// CHECK-DAG: <<Get2:c\d+>> ArrayGet [{{l\d+}},<<BC2>>] loop:<<Loop>> outer_loop:none 68 /// CHECK-DAG: <<Cnv1:s\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 69 /// CHECK-DAG: <<Cnv2:s\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 70 /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none 71 /// CHECK-DAG: <<Abs:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 72 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 73 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 74 // 75 /// CHECK-START: int SimdSadShort2.sadCastedChar2Int(char[], char[]) loop_optimization (before) 76 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 77 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 78 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 79 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 80 /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 81 /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 82 /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none 83 /// CHECK-DAG: <<Abs:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 84 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 85 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 86 // 87 /// CHECK-START-ARM64: int SimdSadShort2.sadCastedChar2Int(char[], char[]) loop_optimization (after) 88 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 89 /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none 90 /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none 91 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 92 /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none 93 /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 94 /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 95 /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none 96 /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none sadCastedChar2Int(char[] s1, char[] s2)97 private static int sadCastedChar2Int(char[] s1, char[] s2) { 98 int min_length = Math.min(s1.length, s2.length); 99 int sad = 0; 100 for (int i = 0; i < min_length; i++) { 101 sad += Math.abs(((short) s1[i]) - ((short) s2[i])); 102 } 103 return sad; 104 } 105 106 /// CHECK-START: int SimdSadShort2.sadCastedChar2IntAlt(char[], char[]) instruction_simplifier (before) 107 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 108 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 109 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 110 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 111 /// CHECK-DAG: <<BC1:i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 112 /// CHECK-DAG: <<BC2:i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 113 /// CHECK-DAG: <<Get1:c\d+>> ArrayGet [{{l\d+}},<<BC1>>] loop:<<Loop>> outer_loop:none 114 /// CHECK-DAG: <<Get2:c\d+>> ArrayGet [{{l\d+}},<<BC2>>] loop:<<Loop>> outer_loop:none 115 /// CHECK-DAG: <<Cnv1:s\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 116 /// CHECK-DAG: <<Cnv2:s\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 117 /// CHECK-DAG: <<Sub1:i\d+>> Sub [<<Cnv2>>,<<Cnv1>>] loop:<<Loop>> outer_loop:none 118 /// CHECK-DAG: <<Sub2:i\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none 119 /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Sub2>>,<<Sub1>>] loop:<<Loop>> outer_loop:none 120 /// CHECK-DAG: Add [<<Phi2>>,<<Phi3>>] loop:<<Loop>> outer_loop:none 121 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 122 // 123 /// CHECK-START: int SimdSadShort2.sadCastedChar2IntAlt(char[], char[]) loop_optimization (before) 124 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 125 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 126 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 127 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 128 /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 129 /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 130 /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get2>>,<<Get1>>] loop:<<Loop>> outer_loop:none 131 /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 132 /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none 133 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 134 // 135 /// CHECK-START-ARM64: int SimdSadShort2.sadCastedChar2IntAlt(char[], char[]) loop_optimization (after) 136 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 137 /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none 138 /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none 139 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 140 /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none 141 /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 142 /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 143 /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load2>>,<<Load1>>] loop:<<Loop>> outer_loop:none 144 /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none sadCastedChar2IntAlt(char[] s1, char[] s2)145 private static int sadCastedChar2IntAlt(char[] s1, char[] s2) { 146 int min_length = Math.min(s1.length, s2.length); 147 int sad = 0; 148 for (int i = 0; i < min_length; i++) { 149 short s = (short) s1[i]; 150 short p = (short) s2[i]; 151 sad += s >= p ? s - p : p - s; 152 } 153 return sad; 154 } 155 156 /// CHECK-START: int SimdSadShort2.sadCastedChar2IntAlt2(char[], char[]) instruction_simplifier (before) 157 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 158 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 159 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 160 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 161 /// CHECK-DAG: <<BC1:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 162 /// CHECK-DAG: <<BC2:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 163 /// CHECK-DAG: <<Get1:c\d+>> ArrayGet [{{l\d+}},<<BC1>>] loop:<<Loop>> outer_loop:none 164 /// CHECK-DAG: <<Get2:c\d+>> ArrayGet [{{l\d+}},<<BC2>>] loop:<<Loop>> outer_loop:none 165 /// CHECK-DAG: <<Cnv1:s\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 166 /// CHECK-DAG: <<Cnv2:s\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 167 /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none 168 /// CHECK-DAG: <<Neg:i\d+>> Neg [<<Sub>>] loop:<<Loop>> outer_loop:none 169 /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Sub>>,<<Neg>>] loop:<<Loop>> outer_loop:none 170 /// CHECK-DAG: Add [<<Phi2>>,<<Phi3>>] loop:<<Loop>> outer_loop:none 171 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 172 // 173 /// CHECK-START: int SimdSadShort2.sadCastedChar2IntAlt2(char[], char[]) loop_optimization (before) 174 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 175 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 176 /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 177 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 178 /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 179 /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 180 /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none 181 /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 182 /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none 183 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 184 // 185 /// CHECK-START-ARM64: int SimdSadShort2.sadCastedChar2IntAlt2(char[], char[]) loop_optimization (after) 186 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 187 /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none 188 /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none 189 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 190 /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none 191 /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 192 /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 193 /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none 194 /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none sadCastedChar2IntAlt2(char[] s1, char[] s2)195 private static int sadCastedChar2IntAlt2(char[] s1, char[] s2) { 196 int min_length = Math.min(s1.length, s2.length); 197 int sad = 0; 198 for (int i = 0; i < min_length; i++) { 199 short s = (short) s1[i]; 200 short p = (short) s2[i]; 201 int x = s - p; 202 if (x < 0) x = -x; 203 sad += x; 204 } 205 return sad; 206 } 207 208 /// CHECK-START: long SimdSadShort2.sadCastedChar2Long(char[], char[]) instruction_simplifier (before) 209 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 210 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 211 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 0 loop:none 212 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 213 /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none 214 /// CHECK-DAG: <<BC1:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 215 /// CHECK-DAG: <<BC2:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 216 /// CHECK-DAG: <<Get1:c\d+>> ArrayGet [{{l\d+}},<<BC1>>] loop:<<Loop>> outer_loop:none 217 /// CHECK-DAG: <<Get2:c\d+>> ArrayGet [{{l\d+}},<<BC2>>] loop:<<Loop>> outer_loop:none 218 /// CHECK-DAG: <<Cnv1:s\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 219 /// CHECK-DAG: <<Cnv2:s\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 220 /// CHECK-DAG: <<Cnv3:j\d+>> TypeConversion [<<Cnv1>>] loop:<<Loop>> outer_loop:none 221 /// CHECK-DAG: <<Cnv4:j\d+>> TypeConversion [<<Cnv2>>] loop:<<Loop>> outer_loop:none 222 /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv3>>,<<Cnv4>>] loop:<<Loop>> outer_loop:none 223 /// CHECK-DAG: <<Abs:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 224 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 225 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 226 // 227 /// CHECK-START: long SimdSadShort2.sadCastedChar2Long(char[], char[]) loop_optimization (before) 228 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 229 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 230 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 0 loop:none 231 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 232 /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none 233 /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 234 /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 235 /// CHECK-DAG: <<Cnv1:j\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 236 /// CHECK-DAG: <<Cnv2:j\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 237 /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none 238 /// CHECK-DAG: <<Abs:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 239 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 240 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 241 // 242 /// CHECK-START-ARM64: long SimdSadShort2.sadCastedChar2Long(char[], char[]) loop_optimization (after) 243 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 244 /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none 245 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 0 loop:none 246 /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<ConsL>>] loop:none 247 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 248 /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none 249 /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 250 /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 251 /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none 252 /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none sadCastedChar2Long(char[] s1, char[] s2)253 private static long sadCastedChar2Long(char[] s1, char[] s2) { 254 int min_length = Math.min(s1.length, s2.length); 255 long sad = 0; 256 for (int i = 0; i < min_length; i++) { 257 long x = (short) s1[i]; 258 long y = (short) s2[i]; 259 sad += Math.abs(x - y); 260 } 261 return sad; 262 } 263 264 /// CHECK-START: long SimdSadShort2.sadCastedChar2LongAt1(char[], char[]) instruction_simplifier (before) 265 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 266 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 267 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 1 loop:none 268 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 269 /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none 270 /// CHECK-DAG: <<BC1:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 271 /// CHECK-DAG: <<BC2:\i\d+>> BoundsCheck [<<Phi1>>,{{i\d+}}] loop:<<Loop>> outer_loop:none 272 /// CHECK-DAG: <<Get1:c\d+>> ArrayGet [{{l\d+}},<<BC1>>] loop:<<Loop>> outer_loop:none 273 /// CHECK-DAG: <<Get2:c\d+>> ArrayGet [{{l\d+}},<<BC2>>] loop:<<Loop>> outer_loop:none 274 /// CHECK-DAG: <<Cnv1:s\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 275 /// CHECK-DAG: <<Cnv2:s\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 276 /// CHECK-DAG: <<Cnv3:j\d+>> TypeConversion [<<Cnv1>>] loop:<<Loop>> outer_loop:none 277 /// CHECK-DAG: <<Cnv4:j\d+>> TypeConversion [<<Cnv2>>] loop:<<Loop>> outer_loop:none 278 /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv3>>,<<Cnv4>>] loop:<<Loop>> outer_loop:none 279 /// CHECK-DAG: <<Abs:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 280 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 281 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 282 // 283 /// CHECK-START: long SimdSadShort2.sadCastedChar2LongAt1(char[], char[]) loop_optimization (before) 284 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 285 /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none 286 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 1 loop:none 287 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 288 /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none 289 /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 290 /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 291 /// CHECK-DAG: <<Cnv1:j\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none 292 /// CHECK-DAG: <<Cnv2:j\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none 293 /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none 294 /// CHECK-DAG: <<Abs:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none 295 /// CHECK-DAG: Add [<<Phi2>>,<<Abs>>] loop:<<Loop>> outer_loop:none 296 /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none 297 // 298 /// CHECK-START-ARM64: long SimdSadShort2.sadCastedChar2LongAt1(char[], char[]) loop_optimization (after) 299 /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none 300 /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none 301 /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 1 loop:none 302 /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<ConsL>>] loop:none 303 /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none 304 /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none 305 /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 306 /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none 307 /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none 308 /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none sadCastedChar2LongAt1(char[] s1, char[] s2)309 private static long sadCastedChar2LongAt1(char[] s1, char[] s2) { 310 int min_length = Math.min(s1.length, s2.length); 311 long sad = 1; // starts at 1 312 for (int i = 0; i < min_length; i++) { 313 long x = (short) s1[i]; 314 long y = (short) s2[i]; 315 sad += Math.abs(x - y); 316 } 317 return sad; 318 } 319 main()320 public static void main() { 321 // Cross-test the two most extreme values individually. 322 char[] s1 = { 0, 0x8000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; 323 char[] s2 = { 0, 0x7fff, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; 324 expectEquals(-1, sadCastedChar2Short(s1, s2)); 325 expectEquals(-1, sadCastedChar2Short(s2, s1)); 326 expectEquals(-1, sadCastedChar2ShortAlt(s1, s2)); 327 expectEquals(-1, sadCastedChar2ShortAlt(s2, s1)); 328 expectEquals(-1, sadCastedChar2ShortAlt2(s1, s2)); 329 expectEquals(-1, sadCastedChar2ShortAlt2(s2, s1)); 330 expectEquals(65535, sadCastedChar2Int(s1, s2)); 331 expectEquals(65535, sadCastedChar2Int(s2, s1)); 332 expectEquals(65535, sadCastedChar2IntAlt(s1, s2)); 333 expectEquals(65535, sadCastedChar2IntAlt(s2, s1)); 334 expectEquals(65535, sadCastedChar2IntAlt2(s1, s2)); 335 expectEquals(65535, sadCastedChar2IntAlt2(s2, s1)); 336 expectEquals(65535L, sadCastedChar2Long(s1, s2)); 337 expectEquals(65535L, sadCastedChar2Long(s2, s1)); 338 expectEquals(65536L, sadCastedChar2LongAt1(s1, s2)); 339 expectEquals(65536L, sadCastedChar2LongAt1(s2, s1)); 340 341 // Use cross-values to test all cases. 342 char[] interesting = { 343 (char) 0x0000, 344 (char) 0x0001, 345 (char) 0x0002, 346 (char) 0x1234, 347 (char) 0x8000, 348 (char) 0x8001, 349 (char) 0x7fff, 350 (char) 0xffff 351 }; 352 int n = interesting.length; 353 int m = n * n + 1; 354 s1 = new char[m]; 355 s2 = new char[m]; 356 int k = 0; 357 for (int i = 0; i < n; i++) { 358 for (int j = 0; j < n; j++) { 359 s1[k] = interesting[i]; 360 s2[k] = interesting[j]; 361 k++; 362 } 363 } 364 s1[k] = 10; 365 s2[k] = 2; 366 expectEquals(-18932, sadCastedChar2Short(s1, s2)); 367 expectEquals(-18932, sadCastedChar2ShortAlt(s1, s2)); 368 expectEquals(-18932, sadCastedChar2ShortAlt2(s1, s2)); 369 expectEquals(1291788, sadCastedChar2Int(s1, s2)); 370 expectEquals(1291788, sadCastedChar2IntAlt(s1, s2)); 371 expectEquals(1291788, sadCastedChar2IntAlt2(s1, s2)); 372 expectEquals(1291788L, sadCastedChar2Long(s1, s2)); 373 expectEquals(1291789L, sadCastedChar2LongAt1(s1, s2)); 374 375 System.out.println("SimdSadShort2 passed"); 376 } 377 expectEquals(int expected, int result)378 private static void expectEquals(int expected, int result) { 379 if (expected != result) { 380 throw new Error("Expected: " + expected + ", found: " + result); 381 } 382 } 383 expectEquals(long expected, long result)384 private static void expectEquals(long expected, long result) { 385 if (expected != result) { 386 throw new Error("Expected: " + expected + ", found: " + result); 387 } 388 } 389 } 390