Wed, 22 Jan 2014 12:37:28 -0800
Added tag jdk8u5-b05 for changeset b90de55aca30
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | /** |
aoqi@0 | 26 | * @test |
aoqi@0 | 27 | * @bug 7200264 |
aoqi@0 | 28 | * @summary 7192963 changes disabled shift vectors |
aoqi@0 | 29 | * |
aoqi@0 | 30 | * @run shell Test7200264.sh |
aoqi@0 | 31 | */ |
aoqi@0 | 32 | |
aoqi@0 | 33 | /* |
aoqi@0 | 34 | * Copy of test/compiler/6340864/TestIntVect.java without performance tests. |
aoqi@0 | 35 | */ |
aoqi@0 | 36 | public class TestIntVect { |
aoqi@0 | 37 | private static final int ARRLEN = 997; |
aoqi@0 | 38 | private static final int ITERS = 11000; |
aoqi@0 | 39 | private static final int ADD_INIT = Integer.MAX_VALUE-500; |
aoqi@0 | 40 | private static final int BIT_MASK = 0xEC80F731; |
aoqi@0 | 41 | private static final int VALUE = 15; |
aoqi@0 | 42 | private static final int SHIFT = 32; |
aoqi@0 | 43 | |
aoqi@0 | 44 | public static void main(String args[]) { |
aoqi@0 | 45 | System.out.println("Testing Integer vectors"); |
aoqi@0 | 46 | int errn = test(); |
aoqi@0 | 47 | if (errn > 0) { |
aoqi@0 | 48 | System.err.println("FAILED: " + errn + " errors"); |
aoqi@0 | 49 | System.exit(97); |
aoqi@0 | 50 | } |
aoqi@0 | 51 | System.out.println("PASSED"); |
aoqi@0 | 52 | } |
aoqi@0 | 53 | |
aoqi@0 | 54 | static int test() { |
aoqi@0 | 55 | int[] a0 = new int[ARRLEN]; |
aoqi@0 | 56 | int[] a1 = new int[ARRLEN]; |
aoqi@0 | 57 | int[] a2 = new int[ARRLEN]; |
aoqi@0 | 58 | int[] a3 = new int[ARRLEN]; |
aoqi@0 | 59 | int[] a4 = new int[ARRLEN]; |
aoqi@0 | 60 | long[] p2 = new long[ARRLEN/2]; |
aoqi@0 | 61 | // Initialize |
aoqi@0 | 62 | int gold_sum = 0; |
aoqi@0 | 63 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 64 | int val = (int)(ADD_INIT+i); |
aoqi@0 | 65 | gold_sum += val; |
aoqi@0 | 66 | a1[i] = val; |
aoqi@0 | 67 | a2[i] = (int)VALUE; |
aoqi@0 | 68 | a3[i] = (int)-VALUE; |
aoqi@0 | 69 | a4[i] = (int)BIT_MASK; |
aoqi@0 | 70 | } |
aoqi@0 | 71 | System.out.println("Warmup"); |
aoqi@0 | 72 | for (int i=0; i<ITERS; i++) { |
aoqi@0 | 73 | test_sum(a1); |
aoqi@0 | 74 | test_addc(a0, a1); |
aoqi@0 | 75 | test_addv(a0, a1, (int)VALUE); |
aoqi@0 | 76 | test_adda(a0, a1, a2); |
aoqi@0 | 77 | test_subc(a0, a1); |
aoqi@0 | 78 | test_subv(a0, a1, (int)VALUE); |
aoqi@0 | 79 | test_suba(a0, a1, a2); |
aoqi@0 | 80 | test_mulc(a0, a1); |
aoqi@0 | 81 | test_mulv(a0, a1, (int)VALUE); |
aoqi@0 | 82 | test_mula(a0, a1, a2); |
aoqi@0 | 83 | test_divc(a0, a1); |
aoqi@0 | 84 | test_divv(a0, a1, (int)VALUE); |
aoqi@0 | 85 | test_diva(a0, a1, a2); |
aoqi@0 | 86 | test_mulc_n(a0, a1); |
aoqi@0 | 87 | test_mulv(a0, a1, (int)-VALUE); |
aoqi@0 | 88 | test_mula(a0, a1, a3); |
aoqi@0 | 89 | test_divc_n(a0, a1); |
aoqi@0 | 90 | test_divv(a0, a1, (int)-VALUE); |
aoqi@0 | 91 | test_diva(a0, a1, a3); |
aoqi@0 | 92 | test_andc(a0, a1); |
aoqi@0 | 93 | test_andv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 94 | test_anda(a0, a1, a4); |
aoqi@0 | 95 | test_orc(a0, a1); |
aoqi@0 | 96 | test_orv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 97 | test_ora(a0, a1, a4); |
aoqi@0 | 98 | test_xorc(a0, a1); |
aoqi@0 | 99 | test_xorv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 100 | test_xora(a0, a1, a4); |
aoqi@0 | 101 | test_sllc(a0, a1); |
aoqi@0 | 102 | test_sllv(a0, a1, VALUE); |
aoqi@0 | 103 | test_srlc(a0, a1); |
aoqi@0 | 104 | test_srlv(a0, a1, VALUE); |
aoqi@0 | 105 | test_srac(a0, a1); |
aoqi@0 | 106 | test_srav(a0, a1, VALUE); |
aoqi@0 | 107 | test_sllc_n(a0, a1); |
aoqi@0 | 108 | test_sllv(a0, a1, -VALUE); |
aoqi@0 | 109 | test_srlc_n(a0, a1); |
aoqi@0 | 110 | test_srlv(a0, a1, -VALUE); |
aoqi@0 | 111 | test_srac_n(a0, a1); |
aoqi@0 | 112 | test_srav(a0, a1, -VALUE); |
aoqi@0 | 113 | test_sllc_o(a0, a1); |
aoqi@0 | 114 | test_sllv(a0, a1, SHIFT); |
aoqi@0 | 115 | test_srlc_o(a0, a1); |
aoqi@0 | 116 | test_srlv(a0, a1, SHIFT); |
aoqi@0 | 117 | test_srac_o(a0, a1); |
aoqi@0 | 118 | test_srav(a0, a1, SHIFT); |
aoqi@0 | 119 | test_sllc_on(a0, a1); |
aoqi@0 | 120 | test_sllv(a0, a1, -SHIFT); |
aoqi@0 | 121 | test_srlc_on(a0, a1); |
aoqi@0 | 122 | test_srlv(a0, a1, -SHIFT); |
aoqi@0 | 123 | test_srac_on(a0, a1); |
aoqi@0 | 124 | test_srav(a0, a1, -SHIFT); |
aoqi@0 | 125 | test_pack2(p2, a1); |
aoqi@0 | 126 | test_unpack2(a0, p2); |
aoqi@0 | 127 | test_pack2_swap(p2, a1); |
aoqi@0 | 128 | test_unpack2_swap(a0, p2); |
aoqi@0 | 129 | } |
aoqi@0 | 130 | // Test and verify results |
aoqi@0 | 131 | System.out.println("Verification"); |
aoqi@0 | 132 | int errn = 0; |
aoqi@0 | 133 | { |
aoqi@0 | 134 | int sum = test_sum(a1); |
aoqi@0 | 135 | if (sum != gold_sum) { |
aoqi@0 | 136 | System.err.println("test_sum: " + sum + " != " + gold_sum); |
aoqi@0 | 137 | errn++; |
aoqi@0 | 138 | } |
aoqi@0 | 139 | |
aoqi@0 | 140 | test_addc(a0, a1); |
aoqi@0 | 141 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 142 | errn += verify("test_addc: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
aoqi@0 | 143 | } |
aoqi@0 | 144 | test_addv(a0, a1, (int)VALUE); |
aoqi@0 | 145 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 146 | errn += verify("test_addv: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
aoqi@0 | 147 | } |
aoqi@0 | 148 | test_adda(a0, a1, a2); |
aoqi@0 | 149 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 150 | errn += verify("test_adda: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
aoqi@0 | 151 | } |
aoqi@0 | 152 | |
aoqi@0 | 153 | test_subc(a0, a1); |
aoqi@0 | 154 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 155 | errn += verify("test_subc: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
aoqi@0 | 156 | } |
aoqi@0 | 157 | test_subv(a0, a1, (int)VALUE); |
aoqi@0 | 158 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 159 | errn += verify("test_subv: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
aoqi@0 | 160 | } |
aoqi@0 | 161 | test_suba(a0, a1, a2); |
aoqi@0 | 162 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 163 | errn += verify("test_suba: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
aoqi@0 | 164 | } |
aoqi@0 | 165 | |
aoqi@0 | 166 | test_mulc(a0, a1); |
aoqi@0 | 167 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 168 | errn += verify("test_mulc: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
aoqi@0 | 169 | } |
aoqi@0 | 170 | test_mulv(a0, a1, (int)VALUE); |
aoqi@0 | 171 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 172 | errn += verify("test_mulv: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
aoqi@0 | 173 | } |
aoqi@0 | 174 | test_mula(a0, a1, a2); |
aoqi@0 | 175 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 176 | errn += verify("test_mula: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
aoqi@0 | 177 | } |
aoqi@0 | 178 | |
aoqi@0 | 179 | test_divc(a0, a1); |
aoqi@0 | 180 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 181 | errn += verify("test_divc: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
aoqi@0 | 182 | } |
aoqi@0 | 183 | test_divv(a0, a1, (int)VALUE); |
aoqi@0 | 184 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 185 | errn += verify("test_divv: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
aoqi@0 | 186 | } |
aoqi@0 | 187 | test_diva(a0, a1, a2); |
aoqi@0 | 188 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 189 | errn += verify("test_diva: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
aoqi@0 | 190 | } |
aoqi@0 | 191 | |
aoqi@0 | 192 | test_mulc_n(a0, a1); |
aoqi@0 | 193 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 194 | errn += verify("test_mulc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
aoqi@0 | 195 | } |
aoqi@0 | 196 | test_mulv(a0, a1, (int)-VALUE); |
aoqi@0 | 197 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 198 | errn += verify("test_mulv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
aoqi@0 | 199 | } |
aoqi@0 | 200 | test_mula(a0, a1, a3); |
aoqi@0 | 201 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 202 | errn += verify("test_mula_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
aoqi@0 | 203 | } |
aoqi@0 | 204 | |
aoqi@0 | 205 | test_divc_n(a0, a1); |
aoqi@0 | 206 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 207 | errn += verify("test_divc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
aoqi@0 | 208 | } |
aoqi@0 | 209 | test_divv(a0, a1, (int)-VALUE); |
aoqi@0 | 210 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 211 | errn += verify("test_divv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
aoqi@0 | 212 | } |
aoqi@0 | 213 | test_diva(a0, a1, a3); |
aoqi@0 | 214 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 215 | errn += verify("test_diva_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
aoqi@0 | 216 | } |
aoqi@0 | 217 | |
aoqi@0 | 218 | test_andc(a0, a1); |
aoqi@0 | 219 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 220 | errn += verify("test_andc: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
aoqi@0 | 221 | } |
aoqi@0 | 222 | test_andv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 223 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 224 | errn += verify("test_andv: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
aoqi@0 | 225 | } |
aoqi@0 | 226 | test_anda(a0, a1, a4); |
aoqi@0 | 227 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 228 | errn += verify("test_anda: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
aoqi@0 | 229 | } |
aoqi@0 | 230 | |
aoqi@0 | 231 | test_orc(a0, a1); |
aoqi@0 | 232 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 233 | errn += verify("test_orc: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
aoqi@0 | 234 | } |
aoqi@0 | 235 | test_orv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 236 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 237 | errn += verify("test_orv: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
aoqi@0 | 238 | } |
aoqi@0 | 239 | test_ora(a0, a1, a4); |
aoqi@0 | 240 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 241 | errn += verify("test_ora: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
aoqi@0 | 242 | } |
aoqi@0 | 243 | |
aoqi@0 | 244 | test_xorc(a0, a1); |
aoqi@0 | 245 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 246 | errn += verify("test_xorc: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
aoqi@0 | 247 | } |
aoqi@0 | 248 | test_xorv(a0, a1, (int)BIT_MASK); |
aoqi@0 | 249 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 250 | errn += verify("test_xorv: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
aoqi@0 | 251 | } |
aoqi@0 | 252 | test_xora(a0, a1, a4); |
aoqi@0 | 253 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 254 | errn += verify("test_xora: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
aoqi@0 | 255 | } |
aoqi@0 | 256 | |
aoqi@0 | 257 | test_sllc(a0, a1); |
aoqi@0 | 258 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 259 | errn += verify("test_sllc: ", i, a0[i], (int)((int)(ADD_INIT+i)<<VALUE)); |
aoqi@0 | 260 | } |
aoqi@0 | 261 | test_sllv(a0, a1, VALUE); |
aoqi@0 | 262 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 263 | errn += verify("test_sllv: ", i, a0[i], (int)((int)(ADD_INIT+i)<<VALUE)); |
aoqi@0 | 264 | } |
aoqi@0 | 265 | |
aoqi@0 | 266 | test_srlc(a0, a1); |
aoqi@0 | 267 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 268 | errn += verify("test_srlc: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>VALUE)); |
aoqi@0 | 269 | } |
aoqi@0 | 270 | test_srlv(a0, a1, VALUE); |
aoqi@0 | 271 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 272 | errn += verify("test_srlv: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>VALUE)); |
aoqi@0 | 273 | } |
aoqi@0 | 274 | |
aoqi@0 | 275 | test_srac(a0, a1); |
aoqi@0 | 276 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 277 | errn += verify("test_srac: ", i, a0[i], (int)((int)(ADD_INIT+i)>>VALUE)); |
aoqi@0 | 278 | } |
aoqi@0 | 279 | test_srav(a0, a1, VALUE); |
aoqi@0 | 280 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 281 | errn += verify("test_srav: ", i, a0[i], (int)((int)(ADD_INIT+i)>>VALUE)); |
aoqi@0 | 282 | } |
aoqi@0 | 283 | |
aoqi@0 | 284 | test_sllc_n(a0, a1); |
aoqi@0 | 285 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 286 | errn += verify("test_sllc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-VALUE))); |
aoqi@0 | 287 | } |
aoqi@0 | 288 | test_sllv(a0, a1, -VALUE); |
aoqi@0 | 289 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 290 | errn += verify("test_sllv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-VALUE))); |
aoqi@0 | 291 | } |
aoqi@0 | 292 | |
aoqi@0 | 293 | test_srlc_n(a0, a1); |
aoqi@0 | 294 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 295 | errn += verify("test_srlc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-VALUE))); |
aoqi@0 | 296 | } |
aoqi@0 | 297 | test_srlv(a0, a1, -VALUE); |
aoqi@0 | 298 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 299 | errn += verify("test_srlv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-VALUE))); |
aoqi@0 | 300 | } |
aoqi@0 | 301 | |
aoqi@0 | 302 | test_srac_n(a0, a1); |
aoqi@0 | 303 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 304 | errn += verify("test_srac_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-VALUE))); |
aoqi@0 | 305 | } |
aoqi@0 | 306 | test_srav(a0, a1, -VALUE); |
aoqi@0 | 307 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 308 | errn += verify("test_srav_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-VALUE))); |
aoqi@0 | 309 | } |
aoqi@0 | 310 | |
aoqi@0 | 311 | test_sllc_o(a0, a1); |
aoqi@0 | 312 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 313 | errn += verify("test_sllc_o: ", i, a0[i], (int)((int)(ADD_INIT+i)<<SHIFT)); |
aoqi@0 | 314 | } |
aoqi@0 | 315 | test_sllv(a0, a1, SHIFT); |
aoqi@0 | 316 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 317 | errn += verify("test_sllv_o: ", i, a0[i], (int)((int)(ADD_INIT+i)<<SHIFT)); |
aoqi@0 | 318 | } |
aoqi@0 | 319 | |
aoqi@0 | 320 | test_srlc_o(a0, a1); |
aoqi@0 | 321 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 322 | errn += verify("test_srlc_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>SHIFT)); |
aoqi@0 | 323 | } |
aoqi@0 | 324 | test_srlv(a0, a1, SHIFT); |
aoqi@0 | 325 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 326 | errn += verify("test_srlv_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>SHIFT)); |
aoqi@0 | 327 | } |
aoqi@0 | 328 | |
aoqi@0 | 329 | test_srac_o(a0, a1); |
aoqi@0 | 330 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 331 | errn += verify("test_srac_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>SHIFT)); |
aoqi@0 | 332 | } |
aoqi@0 | 333 | test_srav(a0, a1, SHIFT); |
aoqi@0 | 334 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 335 | errn += verify("test_srav_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>SHIFT)); |
aoqi@0 | 336 | } |
aoqi@0 | 337 | |
aoqi@0 | 338 | test_sllc_on(a0, a1); |
aoqi@0 | 339 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 340 | errn += verify("test_sllc_on: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-SHIFT))); |
aoqi@0 | 341 | } |
aoqi@0 | 342 | test_sllv(a0, a1, -SHIFT); |
aoqi@0 | 343 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 344 | errn += verify("test_sllv_on: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-SHIFT))); |
aoqi@0 | 345 | } |
aoqi@0 | 346 | |
aoqi@0 | 347 | test_srlc_on(a0, a1); |
aoqi@0 | 348 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 349 | errn += verify("test_srlc_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-SHIFT))); |
aoqi@0 | 350 | } |
aoqi@0 | 351 | test_srlv(a0, a1, -SHIFT); |
aoqi@0 | 352 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 353 | errn += verify("test_srlv_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-SHIFT))); |
aoqi@0 | 354 | } |
aoqi@0 | 355 | |
aoqi@0 | 356 | test_srac_on(a0, a1); |
aoqi@0 | 357 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 358 | errn += verify("test_srac_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-SHIFT))); |
aoqi@0 | 359 | } |
aoqi@0 | 360 | test_srav(a0, a1, -SHIFT); |
aoqi@0 | 361 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 362 | errn += verify("test_srav_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-SHIFT))); |
aoqi@0 | 363 | } |
aoqi@0 | 364 | |
aoqi@0 | 365 | test_pack2(p2, a1); |
aoqi@0 | 366 | for (int i=0; i<ARRLEN/2; i++) { |
aoqi@0 | 367 | errn += verify("test_pack2: ", i, p2[i], ((long)(ADD_INIT+2*i) & 0xFFFFFFFFl) | ((long)(ADD_INIT+2*i+1) << 32)); |
aoqi@0 | 368 | } |
aoqi@0 | 369 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 370 | a0[i] = -1; |
aoqi@0 | 371 | } |
aoqi@0 | 372 | test_unpack2(a0, p2); |
aoqi@0 | 373 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
aoqi@0 | 374 | errn += verify("test_unpack2: ", i, a0[i], (ADD_INIT+i)); |
aoqi@0 | 375 | } |
aoqi@0 | 376 | |
aoqi@0 | 377 | test_pack2_swap(p2, a1); |
aoqi@0 | 378 | for (int i=0; i<ARRLEN/2; i++) { |
aoqi@0 | 379 | errn += verify("test_pack2_swap: ", i, p2[i], ((long)(ADD_INIT+2*i+1) & 0xFFFFFFFFl) | ((long)(ADD_INIT+2*i) << 32)); |
aoqi@0 | 380 | } |
aoqi@0 | 381 | for (int i=0; i<ARRLEN; i++) { |
aoqi@0 | 382 | a0[i] = -1; |
aoqi@0 | 383 | } |
aoqi@0 | 384 | test_unpack2_swap(a0, p2); |
aoqi@0 | 385 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
aoqi@0 | 386 | errn += verify("test_unpack2_swap: ", i, a0[i], (ADD_INIT+i)); |
aoqi@0 | 387 | } |
aoqi@0 | 388 | |
aoqi@0 | 389 | } |
aoqi@0 | 390 | |
aoqi@0 | 391 | return errn; |
aoqi@0 | 392 | } |
aoqi@0 | 393 | |
aoqi@0 | 394 | static int test_sum(int[] a1) { |
aoqi@0 | 395 | int sum = 0; |
aoqi@0 | 396 | for (int i = 0; i < a1.length; i+=1) { |
aoqi@0 | 397 | sum += a1[i]; |
aoqi@0 | 398 | } |
aoqi@0 | 399 | return sum; |
aoqi@0 | 400 | } |
aoqi@0 | 401 | |
aoqi@0 | 402 | static void test_addc(int[] a0, int[] a1) { |
aoqi@0 | 403 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 404 | a0[i] = (int)(a1[i]+VALUE); |
aoqi@0 | 405 | } |
aoqi@0 | 406 | } |
aoqi@0 | 407 | static void test_addv(int[] a0, int[] a1, int b) { |
aoqi@0 | 408 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 409 | a0[i] = (int)(a1[i]+b); |
aoqi@0 | 410 | } |
aoqi@0 | 411 | } |
aoqi@0 | 412 | static void test_adda(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 413 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 414 | a0[i] = (int)(a1[i]+a2[i]); |
aoqi@0 | 415 | } |
aoqi@0 | 416 | } |
aoqi@0 | 417 | |
aoqi@0 | 418 | static void test_subc(int[] a0, int[] a1) { |
aoqi@0 | 419 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 420 | a0[i] = (int)(a1[i]-VALUE); |
aoqi@0 | 421 | } |
aoqi@0 | 422 | } |
aoqi@0 | 423 | static void test_subv(int[] a0, int[] a1, int b) { |
aoqi@0 | 424 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 425 | a0[i] = (int)(a1[i]-b); |
aoqi@0 | 426 | } |
aoqi@0 | 427 | } |
aoqi@0 | 428 | static void test_suba(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 429 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 430 | a0[i] = (int)(a1[i]-a2[i]); |
aoqi@0 | 431 | } |
aoqi@0 | 432 | } |
aoqi@0 | 433 | |
aoqi@0 | 434 | static void test_mulc(int[] a0, int[] a1) { |
aoqi@0 | 435 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 436 | a0[i] = (int)(a1[i]*VALUE); |
aoqi@0 | 437 | } |
aoqi@0 | 438 | } |
aoqi@0 | 439 | static void test_mulc_n(int[] a0, int[] a1) { |
aoqi@0 | 440 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 441 | a0[i] = (int)(a1[i]*(-VALUE)); |
aoqi@0 | 442 | } |
aoqi@0 | 443 | } |
aoqi@0 | 444 | static void test_mulv(int[] a0, int[] a1, int b) { |
aoqi@0 | 445 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 446 | a0[i] = (int)(a1[i]*b); |
aoqi@0 | 447 | } |
aoqi@0 | 448 | } |
aoqi@0 | 449 | static void test_mula(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 450 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 451 | a0[i] = (int)(a1[i]*a2[i]); |
aoqi@0 | 452 | } |
aoqi@0 | 453 | } |
aoqi@0 | 454 | |
aoqi@0 | 455 | static void test_divc(int[] a0, int[] a1) { |
aoqi@0 | 456 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 457 | a0[i] = (int)(a1[i]/VALUE); |
aoqi@0 | 458 | } |
aoqi@0 | 459 | } |
aoqi@0 | 460 | static void test_divc_n(int[] a0, int[] a1) { |
aoqi@0 | 461 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 462 | a0[i] = (int)(a1[i]/(-VALUE)); |
aoqi@0 | 463 | } |
aoqi@0 | 464 | } |
aoqi@0 | 465 | static void test_divv(int[] a0, int[] a1, int b) { |
aoqi@0 | 466 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 467 | a0[i] = (int)(a1[i]/b); |
aoqi@0 | 468 | } |
aoqi@0 | 469 | } |
aoqi@0 | 470 | static void test_diva(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 471 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 472 | a0[i] = (int)(a1[i]/a2[i]); |
aoqi@0 | 473 | } |
aoqi@0 | 474 | } |
aoqi@0 | 475 | |
aoqi@0 | 476 | static void test_andc(int[] a0, int[] a1) { |
aoqi@0 | 477 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 478 | a0[i] = (int)(a1[i]&BIT_MASK); |
aoqi@0 | 479 | } |
aoqi@0 | 480 | } |
aoqi@0 | 481 | static void test_andv(int[] a0, int[] a1, int b) { |
aoqi@0 | 482 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 483 | a0[i] = (int)(a1[i]&b); |
aoqi@0 | 484 | } |
aoqi@0 | 485 | } |
aoqi@0 | 486 | static void test_anda(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 487 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 488 | a0[i] = (int)(a1[i]&a2[i]); |
aoqi@0 | 489 | } |
aoqi@0 | 490 | } |
aoqi@0 | 491 | |
aoqi@0 | 492 | static void test_orc(int[] a0, int[] a1) { |
aoqi@0 | 493 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 494 | a0[i] = (int)(a1[i]|BIT_MASK); |
aoqi@0 | 495 | } |
aoqi@0 | 496 | } |
aoqi@0 | 497 | static void test_orv(int[] a0, int[] a1, int b) { |
aoqi@0 | 498 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 499 | a0[i] = (int)(a1[i]|b); |
aoqi@0 | 500 | } |
aoqi@0 | 501 | } |
aoqi@0 | 502 | static void test_ora(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 503 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 504 | a0[i] = (int)(a1[i]|a2[i]); |
aoqi@0 | 505 | } |
aoqi@0 | 506 | } |
aoqi@0 | 507 | |
aoqi@0 | 508 | static void test_xorc(int[] a0, int[] a1) { |
aoqi@0 | 509 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 510 | a0[i] = (int)(a1[i]^BIT_MASK); |
aoqi@0 | 511 | } |
aoqi@0 | 512 | } |
aoqi@0 | 513 | static void test_xorv(int[] a0, int[] a1, int b) { |
aoqi@0 | 514 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 515 | a0[i] = (int)(a1[i]^b); |
aoqi@0 | 516 | } |
aoqi@0 | 517 | } |
aoqi@0 | 518 | static void test_xora(int[] a0, int[] a1, int[] a2) { |
aoqi@0 | 519 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 520 | a0[i] = (int)(a1[i]^a2[i]); |
aoqi@0 | 521 | } |
aoqi@0 | 522 | } |
aoqi@0 | 523 | |
aoqi@0 | 524 | static void test_sllc(int[] a0, int[] a1) { |
aoqi@0 | 525 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 526 | a0[i] = (int)(a1[i]<<VALUE); |
aoqi@0 | 527 | } |
aoqi@0 | 528 | } |
aoqi@0 | 529 | static void test_sllc_n(int[] a0, int[] a1) { |
aoqi@0 | 530 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 531 | a0[i] = (int)(a1[i]<<(-VALUE)); |
aoqi@0 | 532 | } |
aoqi@0 | 533 | } |
aoqi@0 | 534 | static void test_sllc_o(int[] a0, int[] a1) { |
aoqi@0 | 535 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 536 | a0[i] = (int)(a1[i]<<SHIFT); |
aoqi@0 | 537 | } |
aoqi@0 | 538 | } |
aoqi@0 | 539 | static void test_sllc_on(int[] a0, int[] a1) { |
aoqi@0 | 540 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 541 | a0[i] = (int)(a1[i]<<(-SHIFT)); |
aoqi@0 | 542 | } |
aoqi@0 | 543 | } |
aoqi@0 | 544 | static void test_sllv(int[] a0, int[] a1, int b) { |
aoqi@0 | 545 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 546 | a0[i] = (int)(a1[i]<<b); |
aoqi@0 | 547 | } |
aoqi@0 | 548 | } |
aoqi@0 | 549 | |
aoqi@0 | 550 | static void test_srlc(int[] a0, int[] a1) { |
aoqi@0 | 551 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 552 | a0[i] = (int)(a1[i]>>>VALUE); |
aoqi@0 | 553 | } |
aoqi@0 | 554 | } |
aoqi@0 | 555 | static void test_srlc_n(int[] a0, int[] a1) { |
aoqi@0 | 556 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 557 | a0[i] = (int)(a1[i]>>>(-VALUE)); |
aoqi@0 | 558 | } |
aoqi@0 | 559 | } |
aoqi@0 | 560 | static void test_srlc_o(int[] a0, int[] a1) { |
aoqi@0 | 561 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 562 | a0[i] = (int)(a1[i]>>>SHIFT); |
aoqi@0 | 563 | } |
aoqi@0 | 564 | } |
aoqi@0 | 565 | static void test_srlc_on(int[] a0, int[] a1) { |
aoqi@0 | 566 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 567 | a0[i] = (int)(a1[i]>>>(-SHIFT)); |
aoqi@0 | 568 | } |
aoqi@0 | 569 | } |
aoqi@0 | 570 | static void test_srlv(int[] a0, int[] a1, int b) { |
aoqi@0 | 571 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 572 | a0[i] = (int)(a1[i]>>>b); |
aoqi@0 | 573 | } |
aoqi@0 | 574 | } |
aoqi@0 | 575 | |
aoqi@0 | 576 | static void test_srac(int[] a0, int[] a1) { |
aoqi@0 | 577 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 578 | a0[i] = (int)(a1[i]>>VALUE); |
aoqi@0 | 579 | } |
aoqi@0 | 580 | } |
aoqi@0 | 581 | static void test_srac_n(int[] a0, int[] a1) { |
aoqi@0 | 582 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 583 | a0[i] = (int)(a1[i]>>(-VALUE)); |
aoqi@0 | 584 | } |
aoqi@0 | 585 | } |
aoqi@0 | 586 | static void test_srac_o(int[] a0, int[] a1) { |
aoqi@0 | 587 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 588 | a0[i] = (int)(a1[i]>>SHIFT); |
aoqi@0 | 589 | } |
aoqi@0 | 590 | } |
aoqi@0 | 591 | static void test_srac_on(int[] a0, int[] a1) { |
aoqi@0 | 592 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 593 | a0[i] = (int)(a1[i]>>(-SHIFT)); |
aoqi@0 | 594 | } |
aoqi@0 | 595 | } |
aoqi@0 | 596 | static void test_srav(int[] a0, int[] a1, int b) { |
aoqi@0 | 597 | for (int i = 0; i < a0.length; i+=1) { |
aoqi@0 | 598 | a0[i] = (int)(a1[i]>>b); |
aoqi@0 | 599 | } |
aoqi@0 | 600 | } |
aoqi@0 | 601 | |
aoqi@0 | 602 | static void test_pack2(long[] p2, int[] a1) { |
aoqi@0 | 603 | if (p2.length*2 > a1.length) return; |
aoqi@0 | 604 | for (int i = 0; i < p2.length; i+=1) { |
aoqi@0 | 605 | long l0 = (long)a1[i*2+0]; |
aoqi@0 | 606 | long l1 = (long)a1[i*2+1]; |
aoqi@0 | 607 | p2[i] = (l1 << 32) | (l0 & 0xFFFFFFFFl); |
aoqi@0 | 608 | } |
aoqi@0 | 609 | } |
aoqi@0 | 610 | static void test_unpack2(int[] a0, long[] p2) { |
aoqi@0 | 611 | if (p2.length*2 > a0.length) return; |
aoqi@0 | 612 | for (int i = 0; i < p2.length; i+=1) { |
aoqi@0 | 613 | long l = p2[i]; |
aoqi@0 | 614 | a0[i*2+0] = (int)(l & 0xFFFFFFFFl); |
aoqi@0 | 615 | a0[i*2+1] = (int)(l >> 32); |
aoqi@0 | 616 | } |
aoqi@0 | 617 | } |
aoqi@0 | 618 | static void test_pack2_swap(long[] p2, int[] a1) { |
aoqi@0 | 619 | if (p2.length*2 > a1.length) return; |
aoqi@0 | 620 | for (int i = 0; i < p2.length; i+=1) { |
aoqi@0 | 621 | long l0 = (long)a1[i*2+0]; |
aoqi@0 | 622 | long l1 = (long)a1[i*2+1]; |
aoqi@0 | 623 | p2[i] = (l0 << 32) | (l1 & 0xFFFFFFFFl); |
aoqi@0 | 624 | } |
aoqi@0 | 625 | } |
aoqi@0 | 626 | static void test_unpack2_swap(int[] a0, long[] p2) { |
aoqi@0 | 627 | if (p2.length*2 > a0.length) return; |
aoqi@0 | 628 | for (int i = 0; i < p2.length; i+=1) { |
aoqi@0 | 629 | long l = p2[i]; |
aoqi@0 | 630 | a0[i*2+0] = (int)(l >> 32); |
aoqi@0 | 631 | a0[i*2+1] = (int)(l & 0xFFFFFFFFl); |
aoqi@0 | 632 | } |
aoqi@0 | 633 | } |
aoqi@0 | 634 | |
aoqi@0 | 635 | static int verify(String text, int i, int elem, int val) { |
aoqi@0 | 636 | if (elem != val) { |
aoqi@0 | 637 | System.err.println(text + "[" + i + "] = " + elem + " != " + val); |
aoqi@0 | 638 | return 1; |
aoqi@0 | 639 | } |
aoqi@0 | 640 | return 0; |
aoqi@0 | 641 | } |
aoqi@0 | 642 | |
aoqi@0 | 643 | static int verify(String text, int i, long elem, long val) { |
aoqi@0 | 644 | if (elem != val) { |
aoqi@0 | 645 | System.err.println(text + "[" + i + "] = " + Long.toHexString(elem) + " != " + Long.toHexString(val)); |
aoqi@0 | 646 | return 1; |
aoqi@0 | 647 | } |
aoqi@0 | 648 | return 0; |
aoqi@0 | 649 | } |
aoqi@0 | 650 | } |