Mon, 20 Aug 2012 09:07:21 -0700
6340864: Implement vectorization optimizations in hotspot-server
Summary: Added asm encoding and mach nodes for vector arithmetic instructions on x86.
Reviewed-by: roland
kvn@4001 | 1 | /* |
kvn@4001 | 2 | * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. |
kvn@4001 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
kvn@4001 | 4 | * |
kvn@4001 | 5 | * This code is free software; you can redistribute it and/or modify it |
kvn@4001 | 6 | * under the terms of the GNU General Public License version 2 only, as |
kvn@4001 | 7 | * published by the Free Software Foundation. |
kvn@4001 | 8 | * |
kvn@4001 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
kvn@4001 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
kvn@4001 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
kvn@4001 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
kvn@4001 | 13 | * accompanied this code). |
kvn@4001 | 14 | * |
kvn@4001 | 15 | * You should have received a copy of the GNU General Public License version |
kvn@4001 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
kvn@4001 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
kvn@4001 | 18 | * |
kvn@4001 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
kvn@4001 | 20 | * or visit www.oracle.com if you need additional information or have any |
kvn@4001 | 21 | * questions. |
kvn@4001 | 22 | * |
kvn@4001 | 23 | */ |
kvn@4001 | 24 | |
kvn@4001 | 25 | /** |
kvn@4001 | 26 | * @test |
kvn@4001 | 27 | * @bug 6340864 |
kvn@4001 | 28 | * @summary Implement vectorization optimizations in hotspot-server |
kvn@4001 | 29 | * |
kvn@4001 | 30 | * @run main/othervm/timeout=400 -Xbatch -Xmx64m TestIntVect |
kvn@4001 | 31 | */ |
kvn@4001 | 32 | |
kvn@4001 | 33 | public class TestIntVect { |
kvn@4001 | 34 | private static final int ARRLEN = 997; |
kvn@4001 | 35 | private static final int ITERS = 11000; |
kvn@4001 | 36 | private static final int ADD_INIT = Integer.MAX_VALUE-500; |
kvn@4001 | 37 | private static final int BIT_MASK = 0xEC80F731; |
kvn@4001 | 38 | private static final int VALUE = 15; |
kvn@4001 | 39 | private static final int SHIFT = 32; |
kvn@4001 | 40 | |
kvn@4001 | 41 | public static void main(String args[]) { |
kvn@4001 | 42 | System.out.println("Testing Integer vectors"); |
kvn@4001 | 43 | int errn = test(); |
kvn@4001 | 44 | if (errn > 0) { |
kvn@4001 | 45 | System.err.println("FAILED: " + errn + " errors"); |
kvn@4001 | 46 | System.exit(97); |
kvn@4001 | 47 | } |
kvn@4001 | 48 | System.out.println("PASSED"); |
kvn@4001 | 49 | } |
kvn@4001 | 50 | |
kvn@4001 | 51 | static int test() { |
kvn@4001 | 52 | int[] a0 = new int[ARRLEN]; |
kvn@4001 | 53 | int[] a1 = new int[ARRLEN]; |
kvn@4001 | 54 | int[] a2 = new int[ARRLEN]; |
kvn@4001 | 55 | int[] a3 = new int[ARRLEN]; |
kvn@4001 | 56 | int[] a4 = new int[ARRLEN]; |
kvn@4001 | 57 | long[] p2 = new long[ARRLEN/2]; |
kvn@4001 | 58 | // Initialize |
kvn@4001 | 59 | int gold_sum = 0; |
kvn@4001 | 60 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 61 | int val = (int)(ADD_INIT+i); |
kvn@4001 | 62 | gold_sum += val; |
kvn@4001 | 63 | a1[i] = val; |
kvn@4001 | 64 | a2[i] = (int)VALUE; |
kvn@4001 | 65 | a3[i] = (int)-VALUE; |
kvn@4001 | 66 | a4[i] = (int)BIT_MASK; |
kvn@4001 | 67 | } |
kvn@4001 | 68 | System.out.println("Warmup"); |
kvn@4001 | 69 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 70 | test_sum(a1); |
kvn@4001 | 71 | test_addc(a0, a1); |
kvn@4001 | 72 | test_addv(a0, a1, (int)VALUE); |
kvn@4001 | 73 | test_adda(a0, a1, a2); |
kvn@4001 | 74 | test_subc(a0, a1); |
kvn@4001 | 75 | test_subv(a0, a1, (int)VALUE); |
kvn@4001 | 76 | test_suba(a0, a1, a2); |
kvn@4001 | 77 | test_mulc(a0, a1); |
kvn@4001 | 78 | test_mulv(a0, a1, (int)VALUE); |
kvn@4001 | 79 | test_mula(a0, a1, a2); |
kvn@4001 | 80 | test_divc(a0, a1); |
kvn@4001 | 81 | test_divv(a0, a1, (int)VALUE); |
kvn@4001 | 82 | test_diva(a0, a1, a2); |
kvn@4001 | 83 | test_mulc_n(a0, a1); |
kvn@4001 | 84 | test_mulv(a0, a1, (int)-VALUE); |
kvn@4001 | 85 | test_mula(a0, a1, a3); |
kvn@4001 | 86 | test_divc_n(a0, a1); |
kvn@4001 | 87 | test_divv(a0, a1, (int)-VALUE); |
kvn@4001 | 88 | test_diva(a0, a1, a3); |
kvn@4001 | 89 | test_andc(a0, a1); |
kvn@4001 | 90 | test_andv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 91 | test_anda(a0, a1, a4); |
kvn@4001 | 92 | test_orc(a0, a1); |
kvn@4001 | 93 | test_orv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 94 | test_ora(a0, a1, a4); |
kvn@4001 | 95 | test_xorc(a0, a1); |
kvn@4001 | 96 | test_xorv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 97 | test_xora(a0, a1, a4); |
kvn@4001 | 98 | test_sllc(a0, a1); |
kvn@4001 | 99 | test_sllv(a0, a1, VALUE); |
kvn@4001 | 100 | test_srlc(a0, a1); |
kvn@4001 | 101 | test_srlv(a0, a1, VALUE); |
kvn@4001 | 102 | test_srac(a0, a1); |
kvn@4001 | 103 | test_srav(a0, a1, VALUE); |
kvn@4001 | 104 | test_sllc_n(a0, a1); |
kvn@4001 | 105 | test_sllv(a0, a1, -VALUE); |
kvn@4001 | 106 | test_srlc_n(a0, a1); |
kvn@4001 | 107 | test_srlv(a0, a1, -VALUE); |
kvn@4001 | 108 | test_srac_n(a0, a1); |
kvn@4001 | 109 | test_srav(a0, a1, -VALUE); |
kvn@4001 | 110 | test_sllc_o(a0, a1); |
kvn@4001 | 111 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 112 | test_srlc_o(a0, a1); |
kvn@4001 | 113 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 114 | test_srac_o(a0, a1); |
kvn@4001 | 115 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 116 | test_sllc_on(a0, a1); |
kvn@4001 | 117 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 118 | test_srlc_on(a0, a1); |
kvn@4001 | 119 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 120 | test_srac_on(a0, a1); |
kvn@4001 | 121 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 122 | test_pack2(p2, a1); |
kvn@4001 | 123 | test_unpack2(a0, p2); |
kvn@4001 | 124 | test_pack2_swap(p2, a1); |
kvn@4001 | 125 | test_unpack2_swap(a0, p2); |
kvn@4001 | 126 | } |
kvn@4001 | 127 | // Test and verify results |
kvn@4001 | 128 | System.out.println("Verification"); |
kvn@4001 | 129 | int errn = 0; |
kvn@4001 | 130 | { |
kvn@4001 | 131 | int sum = test_sum(a1); |
kvn@4001 | 132 | if (sum != gold_sum) { |
kvn@4001 | 133 | System.err.println("test_sum: " + sum + " != " + gold_sum); |
kvn@4001 | 134 | errn++; |
kvn@4001 | 135 | } |
kvn@4001 | 136 | |
kvn@4001 | 137 | test_addc(a0, a1); |
kvn@4001 | 138 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 139 | errn += verify("test_addc: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 140 | } |
kvn@4001 | 141 | test_addv(a0, a1, (int)VALUE); |
kvn@4001 | 142 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 143 | errn += verify("test_addv: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 144 | } |
kvn@4001 | 145 | test_adda(a0, a1, a2); |
kvn@4001 | 146 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 147 | errn += verify("test_adda: ", i, a0[i], (int)((int)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 148 | } |
kvn@4001 | 149 | |
kvn@4001 | 150 | test_subc(a0, a1); |
kvn@4001 | 151 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 152 | errn += verify("test_subc: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 153 | } |
kvn@4001 | 154 | test_subv(a0, a1, (int)VALUE); |
kvn@4001 | 155 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 156 | errn += verify("test_subv: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 157 | } |
kvn@4001 | 158 | test_suba(a0, a1, a2); |
kvn@4001 | 159 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 160 | errn += verify("test_suba: ", i, a0[i], (int)((int)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 161 | } |
kvn@4001 | 162 | |
kvn@4001 | 163 | test_mulc(a0, a1); |
kvn@4001 | 164 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 165 | errn += verify("test_mulc: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 166 | } |
kvn@4001 | 167 | test_mulv(a0, a1, (int)VALUE); |
kvn@4001 | 168 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 169 | errn += verify("test_mulv: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 170 | } |
kvn@4001 | 171 | test_mula(a0, a1, a2); |
kvn@4001 | 172 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 173 | errn += verify("test_mula: ", i, a0[i], (int)((int)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 174 | } |
kvn@4001 | 175 | |
kvn@4001 | 176 | test_divc(a0, a1); |
kvn@4001 | 177 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 178 | errn += verify("test_divc: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 179 | } |
kvn@4001 | 180 | test_divv(a0, a1, (int)VALUE); |
kvn@4001 | 181 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 182 | errn += verify("test_divv: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 183 | } |
kvn@4001 | 184 | test_diva(a0, a1, a2); |
kvn@4001 | 185 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 186 | errn += verify("test_diva: ", i, a0[i], (int)((int)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 187 | } |
kvn@4001 | 188 | |
kvn@4001 | 189 | test_mulc_n(a0, a1); |
kvn@4001 | 190 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 191 | errn += verify("test_mulc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 192 | } |
kvn@4001 | 193 | test_mulv(a0, a1, (int)-VALUE); |
kvn@4001 | 194 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 195 | errn += verify("test_mulv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 196 | } |
kvn@4001 | 197 | test_mula(a0, a1, a3); |
kvn@4001 | 198 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 199 | errn += verify("test_mula_n: ", i, a0[i], (int)((int)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 200 | } |
kvn@4001 | 201 | |
kvn@4001 | 202 | test_divc_n(a0, a1); |
kvn@4001 | 203 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 204 | errn += verify("test_divc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 205 | } |
kvn@4001 | 206 | test_divv(a0, a1, (int)-VALUE); |
kvn@4001 | 207 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 208 | errn += verify("test_divv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 209 | } |
kvn@4001 | 210 | test_diva(a0, a1, a3); |
kvn@4001 | 211 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 212 | errn += verify("test_diva_n: ", i, a0[i], (int)((int)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 213 | } |
kvn@4001 | 214 | |
kvn@4001 | 215 | test_andc(a0, a1); |
kvn@4001 | 216 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 217 | errn += verify("test_andc: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 218 | } |
kvn@4001 | 219 | test_andv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 220 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 221 | errn += verify("test_andv: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 222 | } |
kvn@4001 | 223 | test_anda(a0, a1, a4); |
kvn@4001 | 224 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 225 | errn += verify("test_anda: ", i, a0[i], (int)((int)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 226 | } |
kvn@4001 | 227 | |
kvn@4001 | 228 | test_orc(a0, a1); |
kvn@4001 | 229 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 230 | errn += verify("test_orc: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 231 | } |
kvn@4001 | 232 | test_orv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 233 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 234 | errn += verify("test_orv: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 235 | } |
kvn@4001 | 236 | test_ora(a0, a1, a4); |
kvn@4001 | 237 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 238 | errn += verify("test_ora: ", i, a0[i], (int)((int)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 239 | } |
kvn@4001 | 240 | |
kvn@4001 | 241 | test_xorc(a0, a1); |
kvn@4001 | 242 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 243 | errn += verify("test_xorc: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 244 | } |
kvn@4001 | 245 | test_xorv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 246 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 247 | errn += verify("test_xorv: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 248 | } |
kvn@4001 | 249 | test_xora(a0, a1, a4); |
kvn@4001 | 250 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 251 | errn += verify("test_xora: ", i, a0[i], (int)((int)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 252 | } |
kvn@4001 | 253 | |
kvn@4001 | 254 | test_sllc(a0, a1); |
kvn@4001 | 255 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 256 | errn += verify("test_sllc: ", i, a0[i], (int)((int)(ADD_INIT+i)<<VALUE)); |
kvn@4001 | 257 | } |
kvn@4001 | 258 | test_sllv(a0, a1, VALUE); |
kvn@4001 | 259 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 260 | errn += verify("test_sllv: ", i, a0[i], (int)((int)(ADD_INIT+i)<<VALUE)); |
kvn@4001 | 261 | } |
kvn@4001 | 262 | |
kvn@4001 | 263 | test_srlc(a0, a1); |
kvn@4001 | 264 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 265 | errn += verify("test_srlc: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>VALUE)); |
kvn@4001 | 266 | } |
kvn@4001 | 267 | test_srlv(a0, a1, VALUE); |
kvn@4001 | 268 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 269 | errn += verify("test_srlv: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>VALUE)); |
kvn@4001 | 270 | } |
kvn@4001 | 271 | |
kvn@4001 | 272 | test_srac(a0, a1); |
kvn@4001 | 273 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 274 | errn += verify("test_srac: ", i, a0[i], (int)((int)(ADD_INIT+i)>>VALUE)); |
kvn@4001 | 275 | } |
kvn@4001 | 276 | test_srav(a0, a1, VALUE); |
kvn@4001 | 277 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 278 | errn += verify("test_srav: ", i, a0[i], (int)((int)(ADD_INIT+i)>>VALUE)); |
kvn@4001 | 279 | } |
kvn@4001 | 280 | |
kvn@4001 | 281 | test_sllc_n(a0, a1); |
kvn@4001 | 282 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 283 | errn += verify("test_sllc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-VALUE))); |
kvn@4001 | 284 | } |
kvn@4001 | 285 | test_sllv(a0, a1, -VALUE); |
kvn@4001 | 286 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 287 | errn += verify("test_sllv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-VALUE))); |
kvn@4001 | 288 | } |
kvn@4001 | 289 | |
kvn@4001 | 290 | test_srlc_n(a0, a1); |
kvn@4001 | 291 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 292 | errn += verify("test_srlc_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-VALUE))); |
kvn@4001 | 293 | } |
kvn@4001 | 294 | test_srlv(a0, a1, -VALUE); |
kvn@4001 | 295 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 296 | errn += verify("test_srlv_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-VALUE))); |
kvn@4001 | 297 | } |
kvn@4001 | 298 | |
kvn@4001 | 299 | test_srac_n(a0, a1); |
kvn@4001 | 300 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 301 | errn += verify("test_srac_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-VALUE))); |
kvn@4001 | 302 | } |
kvn@4001 | 303 | test_srav(a0, a1, -VALUE); |
kvn@4001 | 304 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 305 | errn += verify("test_srav_n: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-VALUE))); |
kvn@4001 | 306 | } |
kvn@4001 | 307 | |
kvn@4001 | 308 | test_sllc_o(a0, a1); |
kvn@4001 | 309 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 310 | errn += verify("test_sllc_o: ", i, a0[i], (int)((int)(ADD_INIT+i)<<SHIFT)); |
kvn@4001 | 311 | } |
kvn@4001 | 312 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 313 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 314 | errn += verify("test_sllv_o: ", i, a0[i], (int)((int)(ADD_INIT+i)<<SHIFT)); |
kvn@4001 | 315 | } |
kvn@4001 | 316 | |
kvn@4001 | 317 | test_srlc_o(a0, a1); |
kvn@4001 | 318 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 319 | errn += verify("test_srlc_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>SHIFT)); |
kvn@4001 | 320 | } |
kvn@4001 | 321 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 322 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 323 | errn += verify("test_srlv_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>SHIFT)); |
kvn@4001 | 324 | } |
kvn@4001 | 325 | |
kvn@4001 | 326 | test_srac_o(a0, a1); |
kvn@4001 | 327 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 328 | errn += verify("test_srac_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>SHIFT)); |
kvn@4001 | 329 | } |
kvn@4001 | 330 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 331 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 332 | errn += verify("test_srav_o: ", i, a0[i], (int)((int)(ADD_INIT+i)>>SHIFT)); |
kvn@4001 | 333 | } |
kvn@4001 | 334 | |
kvn@4001 | 335 | test_sllc_on(a0, a1); |
kvn@4001 | 336 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 337 | errn += verify("test_sllc_on: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-SHIFT))); |
kvn@4001 | 338 | } |
kvn@4001 | 339 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 340 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 341 | errn += verify("test_sllv_on: ", i, a0[i], (int)((int)(ADD_INIT+i)<<(-SHIFT))); |
kvn@4001 | 342 | } |
kvn@4001 | 343 | |
kvn@4001 | 344 | test_srlc_on(a0, a1); |
kvn@4001 | 345 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 346 | errn += verify("test_srlc_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-SHIFT))); |
kvn@4001 | 347 | } |
kvn@4001 | 348 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 349 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 350 | errn += verify("test_srlv_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>>(-SHIFT))); |
kvn@4001 | 351 | } |
kvn@4001 | 352 | |
kvn@4001 | 353 | test_srac_on(a0, a1); |
kvn@4001 | 354 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 355 | errn += verify("test_srac_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-SHIFT))); |
kvn@4001 | 356 | } |
kvn@4001 | 357 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 358 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 359 | errn += verify("test_srav_on: ", i, a0[i], (int)((int)(ADD_INIT+i)>>(-SHIFT))); |
kvn@4001 | 360 | } |
kvn@4001 | 361 | |
kvn@4001 | 362 | test_pack2(p2, a1); |
kvn@4001 | 363 | for (int i=0; i<ARRLEN/2; i++) { |
kvn@4001 | 364 | errn += verify("test_pack2: ", i, p2[i], ((long)(ADD_INIT+2*i) & 0xFFFFFFFFl) | ((long)(ADD_INIT+2*i+1) << 32)); |
kvn@4001 | 365 | } |
kvn@4001 | 366 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 367 | a0[i] = -1; |
kvn@4001 | 368 | } |
kvn@4001 | 369 | test_unpack2(a0, p2); |
kvn@4001 | 370 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
kvn@4001 | 371 | errn += verify("test_unpack2: ", i, a0[i], (ADD_INIT+i)); |
kvn@4001 | 372 | } |
kvn@4001 | 373 | |
kvn@4001 | 374 | test_pack2_swap(p2, a1); |
kvn@4001 | 375 | for (int i=0; i<ARRLEN/2; i++) { |
kvn@4001 | 376 | errn += verify("test_pack2_swap: ", i, p2[i], ((long)(ADD_INIT+2*i+1) & 0xFFFFFFFFl) | ((long)(ADD_INIT+2*i) << 32)); |
kvn@4001 | 377 | } |
kvn@4001 | 378 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 379 | a0[i] = -1; |
kvn@4001 | 380 | } |
kvn@4001 | 381 | test_unpack2_swap(a0, p2); |
kvn@4001 | 382 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
kvn@4001 | 383 | errn += verify("test_unpack2_swap: ", i, a0[i], (ADD_INIT+i)); |
kvn@4001 | 384 | } |
kvn@4001 | 385 | |
kvn@4001 | 386 | } |
kvn@4001 | 387 | |
kvn@4001 | 388 | if (errn > 0) |
kvn@4001 | 389 | return errn; |
kvn@4001 | 390 | |
kvn@4001 | 391 | System.out.println("Time"); |
kvn@4001 | 392 | long start, end; |
kvn@4001 | 393 | |
kvn@4001 | 394 | start = System.currentTimeMillis(); |
kvn@4001 | 395 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 396 | test_sum(a1); |
kvn@4001 | 397 | } |
kvn@4001 | 398 | end = System.currentTimeMillis(); |
kvn@4001 | 399 | System.out.println("test_sum: " + (end - start)); |
kvn@4001 | 400 | |
kvn@4001 | 401 | start = System.currentTimeMillis(); |
kvn@4001 | 402 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 403 | test_addc(a0, a1); |
kvn@4001 | 404 | } |
kvn@4001 | 405 | end = System.currentTimeMillis(); |
kvn@4001 | 406 | System.out.println("test_addc: " + (end - start)); |
kvn@4001 | 407 | start = System.currentTimeMillis(); |
kvn@4001 | 408 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 409 | test_addv(a0, a1, (int)VALUE); |
kvn@4001 | 410 | } |
kvn@4001 | 411 | end = System.currentTimeMillis(); |
kvn@4001 | 412 | System.out.println("test_addv: " + (end - start)); |
kvn@4001 | 413 | start = System.currentTimeMillis(); |
kvn@4001 | 414 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 415 | test_adda(a0, a1, a2); |
kvn@4001 | 416 | } |
kvn@4001 | 417 | end = System.currentTimeMillis(); |
kvn@4001 | 418 | System.out.println("test_adda: " + (end - start)); |
kvn@4001 | 419 | |
kvn@4001 | 420 | start = System.currentTimeMillis(); |
kvn@4001 | 421 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 422 | test_subc(a0, a1); |
kvn@4001 | 423 | } |
kvn@4001 | 424 | end = System.currentTimeMillis(); |
kvn@4001 | 425 | System.out.println("test_subc: " + (end - start)); |
kvn@4001 | 426 | start = System.currentTimeMillis(); |
kvn@4001 | 427 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 428 | test_subv(a0, a1, (int)VALUE); |
kvn@4001 | 429 | } |
kvn@4001 | 430 | end = System.currentTimeMillis(); |
kvn@4001 | 431 | System.out.println("test_subv: " + (end - start)); |
kvn@4001 | 432 | start = System.currentTimeMillis(); |
kvn@4001 | 433 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 434 | test_suba(a0, a1, a2); |
kvn@4001 | 435 | } |
kvn@4001 | 436 | end = System.currentTimeMillis(); |
kvn@4001 | 437 | System.out.println("test_suba: " + (end - start)); |
kvn@4001 | 438 | |
kvn@4001 | 439 | start = System.currentTimeMillis(); |
kvn@4001 | 440 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 441 | test_mulc(a0, a1); |
kvn@4001 | 442 | } |
kvn@4001 | 443 | end = System.currentTimeMillis(); |
kvn@4001 | 444 | System.out.println("test_mulc: " + (end - start)); |
kvn@4001 | 445 | start = System.currentTimeMillis(); |
kvn@4001 | 446 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 447 | test_mulv(a0, a1, (int)VALUE); |
kvn@4001 | 448 | } |
kvn@4001 | 449 | end = System.currentTimeMillis(); |
kvn@4001 | 450 | System.out.println("test_mulv: " + (end - start)); |
kvn@4001 | 451 | start = System.currentTimeMillis(); |
kvn@4001 | 452 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 453 | test_mula(a0, a1, a2); |
kvn@4001 | 454 | } |
kvn@4001 | 455 | end = System.currentTimeMillis(); |
kvn@4001 | 456 | System.out.println("test_mula: " + (end - start)); |
kvn@4001 | 457 | |
kvn@4001 | 458 | start = System.currentTimeMillis(); |
kvn@4001 | 459 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 460 | test_divc(a0, a1); |
kvn@4001 | 461 | } |
kvn@4001 | 462 | end = System.currentTimeMillis(); |
kvn@4001 | 463 | System.out.println("test_divc: " + (end - start)); |
kvn@4001 | 464 | start = System.currentTimeMillis(); |
kvn@4001 | 465 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 466 | test_divv(a0, a1, (int)VALUE); |
kvn@4001 | 467 | } |
kvn@4001 | 468 | end = System.currentTimeMillis(); |
kvn@4001 | 469 | System.out.println("test_divv: " + (end - start)); |
kvn@4001 | 470 | start = System.currentTimeMillis(); |
kvn@4001 | 471 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 472 | test_diva(a0, a1, a2); |
kvn@4001 | 473 | } |
kvn@4001 | 474 | end = System.currentTimeMillis(); |
kvn@4001 | 475 | System.out.println("test_diva: " + (end - start)); |
kvn@4001 | 476 | |
kvn@4001 | 477 | start = System.currentTimeMillis(); |
kvn@4001 | 478 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 479 | test_mulc_n(a0, a1); |
kvn@4001 | 480 | } |
kvn@4001 | 481 | end = System.currentTimeMillis(); |
kvn@4001 | 482 | System.out.println("test_mulc_n: " + (end - start)); |
kvn@4001 | 483 | start = System.currentTimeMillis(); |
kvn@4001 | 484 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 485 | test_mulv(a0, a1, (int)-VALUE); |
kvn@4001 | 486 | } |
kvn@4001 | 487 | end = System.currentTimeMillis(); |
kvn@4001 | 488 | System.out.println("test_mulv_n: " + (end - start)); |
kvn@4001 | 489 | start = System.currentTimeMillis(); |
kvn@4001 | 490 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 491 | test_mula(a0, a1, a3); |
kvn@4001 | 492 | } |
kvn@4001 | 493 | end = System.currentTimeMillis(); |
kvn@4001 | 494 | System.out.println("test_mula_n: " + (end - start)); |
kvn@4001 | 495 | |
kvn@4001 | 496 | start = System.currentTimeMillis(); |
kvn@4001 | 497 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 498 | test_divc_n(a0, a1); |
kvn@4001 | 499 | } |
kvn@4001 | 500 | end = System.currentTimeMillis(); |
kvn@4001 | 501 | System.out.println("test_divc_n: " + (end - start)); |
kvn@4001 | 502 | start = System.currentTimeMillis(); |
kvn@4001 | 503 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 504 | test_divv(a0, a1, (int)-VALUE); |
kvn@4001 | 505 | } |
kvn@4001 | 506 | end = System.currentTimeMillis(); |
kvn@4001 | 507 | System.out.println("test_divv_n: " + (end - start)); |
kvn@4001 | 508 | start = System.currentTimeMillis(); |
kvn@4001 | 509 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 510 | test_diva(a0, a1, a3); |
kvn@4001 | 511 | } |
kvn@4001 | 512 | end = System.currentTimeMillis(); |
kvn@4001 | 513 | System.out.println("test_diva_n: " + (end - start)); |
kvn@4001 | 514 | |
kvn@4001 | 515 | start = System.currentTimeMillis(); |
kvn@4001 | 516 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 517 | test_andc(a0, a1); |
kvn@4001 | 518 | } |
kvn@4001 | 519 | end = System.currentTimeMillis(); |
kvn@4001 | 520 | System.out.println("test_andc: " + (end - start)); |
kvn@4001 | 521 | start = System.currentTimeMillis(); |
kvn@4001 | 522 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 523 | test_andv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 524 | } |
kvn@4001 | 525 | end = System.currentTimeMillis(); |
kvn@4001 | 526 | System.out.println("test_andv: " + (end - start)); |
kvn@4001 | 527 | start = System.currentTimeMillis(); |
kvn@4001 | 528 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 529 | test_anda(a0, a1, a4); |
kvn@4001 | 530 | } |
kvn@4001 | 531 | end = System.currentTimeMillis(); |
kvn@4001 | 532 | System.out.println("test_anda: " + (end - start)); |
kvn@4001 | 533 | |
kvn@4001 | 534 | start = System.currentTimeMillis(); |
kvn@4001 | 535 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 536 | test_orc(a0, a1); |
kvn@4001 | 537 | } |
kvn@4001 | 538 | end = System.currentTimeMillis(); |
kvn@4001 | 539 | System.out.println("test_orc: " + (end - start)); |
kvn@4001 | 540 | start = System.currentTimeMillis(); |
kvn@4001 | 541 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 542 | test_orv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 543 | } |
kvn@4001 | 544 | end = System.currentTimeMillis(); |
kvn@4001 | 545 | System.out.println("test_orv: " + (end - start)); |
kvn@4001 | 546 | start = System.currentTimeMillis(); |
kvn@4001 | 547 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 548 | test_ora(a0, a1, a4); |
kvn@4001 | 549 | } |
kvn@4001 | 550 | end = System.currentTimeMillis(); |
kvn@4001 | 551 | System.out.println("test_ora: " + (end - start)); |
kvn@4001 | 552 | |
kvn@4001 | 553 | start = System.currentTimeMillis(); |
kvn@4001 | 554 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 555 | test_xorc(a0, a1); |
kvn@4001 | 556 | } |
kvn@4001 | 557 | end = System.currentTimeMillis(); |
kvn@4001 | 558 | System.out.println("test_xorc: " + (end - start)); |
kvn@4001 | 559 | start = System.currentTimeMillis(); |
kvn@4001 | 560 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 561 | test_xorv(a0, a1, (int)BIT_MASK); |
kvn@4001 | 562 | } |
kvn@4001 | 563 | end = System.currentTimeMillis(); |
kvn@4001 | 564 | System.out.println("test_xorv: " + (end - start)); |
kvn@4001 | 565 | start = System.currentTimeMillis(); |
kvn@4001 | 566 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 567 | test_xora(a0, a1, a4); |
kvn@4001 | 568 | } |
kvn@4001 | 569 | end = System.currentTimeMillis(); |
kvn@4001 | 570 | System.out.println("test_xora: " + (end - start)); |
kvn@4001 | 571 | |
kvn@4001 | 572 | start = System.currentTimeMillis(); |
kvn@4001 | 573 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 574 | test_sllc(a0, a1); |
kvn@4001 | 575 | } |
kvn@4001 | 576 | end = System.currentTimeMillis(); |
kvn@4001 | 577 | System.out.println("test_sllc: " + (end - start)); |
kvn@4001 | 578 | start = System.currentTimeMillis(); |
kvn@4001 | 579 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 580 | test_sllv(a0, a1, VALUE); |
kvn@4001 | 581 | } |
kvn@4001 | 582 | end = System.currentTimeMillis(); |
kvn@4001 | 583 | System.out.println("test_sllv: " + (end - start)); |
kvn@4001 | 584 | |
kvn@4001 | 585 | start = System.currentTimeMillis(); |
kvn@4001 | 586 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 587 | test_srlc(a0, a1); |
kvn@4001 | 588 | } |
kvn@4001 | 589 | end = System.currentTimeMillis(); |
kvn@4001 | 590 | System.out.println("test_srlc: " + (end - start)); |
kvn@4001 | 591 | start = System.currentTimeMillis(); |
kvn@4001 | 592 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 593 | test_srlv(a0, a1, VALUE); |
kvn@4001 | 594 | } |
kvn@4001 | 595 | end = System.currentTimeMillis(); |
kvn@4001 | 596 | System.out.println("test_srlv: " + (end - start)); |
kvn@4001 | 597 | |
kvn@4001 | 598 | start = System.currentTimeMillis(); |
kvn@4001 | 599 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 600 | test_srac(a0, a1); |
kvn@4001 | 601 | } |
kvn@4001 | 602 | end = System.currentTimeMillis(); |
kvn@4001 | 603 | System.out.println("test_srac: " + (end - start)); |
kvn@4001 | 604 | start = System.currentTimeMillis(); |
kvn@4001 | 605 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 606 | test_srav(a0, a1, VALUE); |
kvn@4001 | 607 | } |
kvn@4001 | 608 | end = System.currentTimeMillis(); |
kvn@4001 | 609 | System.out.println("test_srav: " + (end - start)); |
kvn@4001 | 610 | |
kvn@4001 | 611 | start = System.currentTimeMillis(); |
kvn@4001 | 612 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 613 | test_sllc_n(a0, a1); |
kvn@4001 | 614 | } |
kvn@4001 | 615 | end = System.currentTimeMillis(); |
kvn@4001 | 616 | System.out.println("test_sllc_n: " + (end - start)); |
kvn@4001 | 617 | start = System.currentTimeMillis(); |
kvn@4001 | 618 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 619 | test_sllv(a0, a1, -VALUE); |
kvn@4001 | 620 | } |
kvn@4001 | 621 | end = System.currentTimeMillis(); |
kvn@4001 | 622 | System.out.println("test_sllv_n: " + (end - start)); |
kvn@4001 | 623 | |
kvn@4001 | 624 | start = System.currentTimeMillis(); |
kvn@4001 | 625 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 626 | test_srlc_n(a0, a1); |
kvn@4001 | 627 | } |
kvn@4001 | 628 | end = System.currentTimeMillis(); |
kvn@4001 | 629 | System.out.println("test_srlc_n: " + (end - start)); |
kvn@4001 | 630 | start = System.currentTimeMillis(); |
kvn@4001 | 631 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 632 | test_srlv(a0, a1, -VALUE); |
kvn@4001 | 633 | } |
kvn@4001 | 634 | end = System.currentTimeMillis(); |
kvn@4001 | 635 | System.out.println("test_srlv_n: " + (end - start)); |
kvn@4001 | 636 | |
kvn@4001 | 637 | start = System.currentTimeMillis(); |
kvn@4001 | 638 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 639 | test_srac_n(a0, a1); |
kvn@4001 | 640 | } |
kvn@4001 | 641 | end = System.currentTimeMillis(); |
kvn@4001 | 642 | System.out.println("test_srac_n: " + (end - start)); |
kvn@4001 | 643 | start = System.currentTimeMillis(); |
kvn@4001 | 644 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 645 | test_srav(a0, a1, -VALUE); |
kvn@4001 | 646 | } |
kvn@4001 | 647 | end = System.currentTimeMillis(); |
kvn@4001 | 648 | System.out.println("test_srav_n: " + (end - start)); |
kvn@4001 | 649 | |
kvn@4001 | 650 | start = System.currentTimeMillis(); |
kvn@4001 | 651 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 652 | test_sllc_o(a0, a1); |
kvn@4001 | 653 | } |
kvn@4001 | 654 | end = System.currentTimeMillis(); |
kvn@4001 | 655 | System.out.println("test_sllc_o: " + (end - start)); |
kvn@4001 | 656 | start = System.currentTimeMillis(); |
kvn@4001 | 657 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 658 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 659 | } |
kvn@4001 | 660 | end = System.currentTimeMillis(); |
kvn@4001 | 661 | System.out.println("test_sllv_o: " + (end - start)); |
kvn@4001 | 662 | |
kvn@4001 | 663 | start = System.currentTimeMillis(); |
kvn@4001 | 664 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 665 | test_srlc_o(a0, a1); |
kvn@4001 | 666 | } |
kvn@4001 | 667 | end = System.currentTimeMillis(); |
kvn@4001 | 668 | System.out.println("test_srlc_o: " + (end - start)); |
kvn@4001 | 669 | start = System.currentTimeMillis(); |
kvn@4001 | 670 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 671 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 672 | } |
kvn@4001 | 673 | end = System.currentTimeMillis(); |
kvn@4001 | 674 | System.out.println("test_srlv_o: " + (end - start)); |
kvn@4001 | 675 | |
kvn@4001 | 676 | start = System.currentTimeMillis(); |
kvn@4001 | 677 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 678 | test_srac_o(a0, a1); |
kvn@4001 | 679 | } |
kvn@4001 | 680 | end = System.currentTimeMillis(); |
kvn@4001 | 681 | System.out.println("test_srac_o: " + (end - start)); |
kvn@4001 | 682 | start = System.currentTimeMillis(); |
kvn@4001 | 683 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 684 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 685 | } |
kvn@4001 | 686 | end = System.currentTimeMillis(); |
kvn@4001 | 687 | System.out.println("test_srav_o: " + (end - start)); |
kvn@4001 | 688 | |
kvn@4001 | 689 | start = System.currentTimeMillis(); |
kvn@4001 | 690 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 691 | test_sllc_on(a0, a1); |
kvn@4001 | 692 | } |
kvn@4001 | 693 | end = System.currentTimeMillis(); |
kvn@4001 | 694 | System.out.println("test_sllc_on: " + (end - start)); |
kvn@4001 | 695 | start = System.currentTimeMillis(); |
kvn@4001 | 696 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 697 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 698 | } |
kvn@4001 | 699 | end = System.currentTimeMillis(); |
kvn@4001 | 700 | System.out.println("test_sllv_on: " + (end - start)); |
kvn@4001 | 701 | |
kvn@4001 | 702 | start = System.currentTimeMillis(); |
kvn@4001 | 703 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 704 | test_srlc_on(a0, a1); |
kvn@4001 | 705 | } |
kvn@4001 | 706 | end = System.currentTimeMillis(); |
kvn@4001 | 707 | System.out.println("test_srlc_on: " + (end - start)); |
kvn@4001 | 708 | start = System.currentTimeMillis(); |
kvn@4001 | 709 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 710 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 711 | } |
kvn@4001 | 712 | end = System.currentTimeMillis(); |
kvn@4001 | 713 | System.out.println("test_srlv_on: " + (end - start)); |
kvn@4001 | 714 | |
kvn@4001 | 715 | start = System.currentTimeMillis(); |
kvn@4001 | 716 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 717 | test_srac_on(a0, a1); |
kvn@4001 | 718 | } |
kvn@4001 | 719 | end = System.currentTimeMillis(); |
kvn@4001 | 720 | System.out.println("test_srac_on: " + (end - start)); |
kvn@4001 | 721 | start = System.currentTimeMillis(); |
kvn@4001 | 722 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 723 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 724 | } |
kvn@4001 | 725 | end = System.currentTimeMillis(); |
kvn@4001 | 726 | System.out.println("test_srav_on: " + (end - start)); |
kvn@4001 | 727 | |
kvn@4001 | 728 | start = System.currentTimeMillis(); |
kvn@4001 | 729 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 730 | test_pack2(p2, a1); |
kvn@4001 | 731 | } |
kvn@4001 | 732 | end = System.currentTimeMillis(); |
kvn@4001 | 733 | System.out.println("test_pack2: " + (end - start)); |
kvn@4001 | 734 | start = System.currentTimeMillis(); |
kvn@4001 | 735 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 736 | test_unpack2(a0, p2); |
kvn@4001 | 737 | } |
kvn@4001 | 738 | end = System.currentTimeMillis(); |
kvn@4001 | 739 | System.out.println("test_unpack2: " + (end - start)); |
kvn@4001 | 740 | start = System.currentTimeMillis(); |
kvn@4001 | 741 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 742 | test_pack2_swap(p2, a1); |
kvn@4001 | 743 | } |
kvn@4001 | 744 | end = System.currentTimeMillis(); |
kvn@4001 | 745 | System.out.println("test_pack2_swap: " + (end - start)); |
kvn@4001 | 746 | start = System.currentTimeMillis(); |
kvn@4001 | 747 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 748 | test_unpack2_swap(a0, p2); |
kvn@4001 | 749 | } |
kvn@4001 | 750 | end = System.currentTimeMillis(); |
kvn@4001 | 751 | System.out.println("test_unpack2_swap: " + (end - start)); |
kvn@4001 | 752 | |
kvn@4001 | 753 | return errn; |
kvn@4001 | 754 | } |
kvn@4001 | 755 | |
kvn@4001 | 756 | static int test_sum(int[] a1) { |
kvn@4001 | 757 | int sum = 0; |
kvn@4001 | 758 | for (int i = 0; i < a1.length; i+=1) { |
kvn@4001 | 759 | sum += a1[i]; |
kvn@4001 | 760 | } |
kvn@4001 | 761 | return sum; |
kvn@4001 | 762 | } |
kvn@4001 | 763 | |
kvn@4001 | 764 | static void test_addc(int[] a0, int[] a1) { |
kvn@4001 | 765 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 766 | a0[i] = (int)(a1[i]+VALUE); |
kvn@4001 | 767 | } |
kvn@4001 | 768 | } |
kvn@4001 | 769 | static void test_addv(int[] a0, int[] a1, int b) { |
kvn@4001 | 770 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 771 | a0[i] = (int)(a1[i]+b); |
kvn@4001 | 772 | } |
kvn@4001 | 773 | } |
kvn@4001 | 774 | static void test_adda(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 775 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 776 | a0[i] = (int)(a1[i]+a2[i]); |
kvn@4001 | 777 | } |
kvn@4001 | 778 | } |
kvn@4001 | 779 | |
kvn@4001 | 780 | static void test_subc(int[] a0, int[] a1) { |
kvn@4001 | 781 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 782 | a0[i] = (int)(a1[i]-VALUE); |
kvn@4001 | 783 | } |
kvn@4001 | 784 | } |
kvn@4001 | 785 | static void test_subv(int[] a0, int[] a1, int b) { |
kvn@4001 | 786 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 787 | a0[i] = (int)(a1[i]-b); |
kvn@4001 | 788 | } |
kvn@4001 | 789 | } |
kvn@4001 | 790 | static void test_suba(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 791 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 792 | a0[i] = (int)(a1[i]-a2[i]); |
kvn@4001 | 793 | } |
kvn@4001 | 794 | } |
kvn@4001 | 795 | |
kvn@4001 | 796 | static void test_mulc(int[] a0, int[] a1) { |
kvn@4001 | 797 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 798 | a0[i] = (int)(a1[i]*VALUE); |
kvn@4001 | 799 | } |
kvn@4001 | 800 | } |
kvn@4001 | 801 | static void test_mulc_n(int[] a0, int[] a1) { |
kvn@4001 | 802 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 803 | a0[i] = (int)(a1[i]*(-VALUE)); |
kvn@4001 | 804 | } |
kvn@4001 | 805 | } |
kvn@4001 | 806 | static void test_mulv(int[] a0, int[] a1, int b) { |
kvn@4001 | 807 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 808 | a0[i] = (int)(a1[i]*b); |
kvn@4001 | 809 | } |
kvn@4001 | 810 | } |
kvn@4001 | 811 | static void test_mula(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 812 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 813 | a0[i] = (int)(a1[i]*a2[i]); |
kvn@4001 | 814 | } |
kvn@4001 | 815 | } |
kvn@4001 | 816 | |
kvn@4001 | 817 | static void test_divc(int[] a0, int[] a1) { |
kvn@4001 | 818 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 819 | a0[i] = (int)(a1[i]/VALUE); |
kvn@4001 | 820 | } |
kvn@4001 | 821 | } |
kvn@4001 | 822 | static void test_divc_n(int[] a0, int[] a1) { |
kvn@4001 | 823 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 824 | a0[i] = (int)(a1[i]/(-VALUE)); |
kvn@4001 | 825 | } |
kvn@4001 | 826 | } |
kvn@4001 | 827 | static void test_divv(int[] a0, int[] a1, int b) { |
kvn@4001 | 828 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 829 | a0[i] = (int)(a1[i]/b); |
kvn@4001 | 830 | } |
kvn@4001 | 831 | } |
kvn@4001 | 832 | static void test_diva(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 833 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 834 | a0[i] = (int)(a1[i]/a2[i]); |
kvn@4001 | 835 | } |
kvn@4001 | 836 | } |
kvn@4001 | 837 | |
kvn@4001 | 838 | static void test_andc(int[] a0, int[] a1) { |
kvn@4001 | 839 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 840 | a0[i] = (int)(a1[i]&BIT_MASK); |
kvn@4001 | 841 | } |
kvn@4001 | 842 | } |
kvn@4001 | 843 | static void test_andv(int[] a0, int[] a1, int b) { |
kvn@4001 | 844 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 845 | a0[i] = (int)(a1[i]&b); |
kvn@4001 | 846 | } |
kvn@4001 | 847 | } |
kvn@4001 | 848 | static void test_anda(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 849 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 850 | a0[i] = (int)(a1[i]&a2[i]); |
kvn@4001 | 851 | } |
kvn@4001 | 852 | } |
kvn@4001 | 853 | |
kvn@4001 | 854 | static void test_orc(int[] a0, int[] a1) { |
kvn@4001 | 855 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 856 | a0[i] = (int)(a1[i]|BIT_MASK); |
kvn@4001 | 857 | } |
kvn@4001 | 858 | } |
kvn@4001 | 859 | static void test_orv(int[] a0, int[] a1, int b) { |
kvn@4001 | 860 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 861 | a0[i] = (int)(a1[i]|b); |
kvn@4001 | 862 | } |
kvn@4001 | 863 | } |
kvn@4001 | 864 | static void test_ora(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 865 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 866 | a0[i] = (int)(a1[i]|a2[i]); |
kvn@4001 | 867 | } |
kvn@4001 | 868 | } |
kvn@4001 | 869 | |
kvn@4001 | 870 | static void test_xorc(int[] a0, int[] a1) { |
kvn@4001 | 871 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 872 | a0[i] = (int)(a1[i]^BIT_MASK); |
kvn@4001 | 873 | } |
kvn@4001 | 874 | } |
kvn@4001 | 875 | static void test_xorv(int[] a0, int[] a1, int b) { |
kvn@4001 | 876 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 877 | a0[i] = (int)(a1[i]^b); |
kvn@4001 | 878 | } |
kvn@4001 | 879 | } |
kvn@4001 | 880 | static void test_xora(int[] a0, int[] a1, int[] a2) { |
kvn@4001 | 881 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 882 | a0[i] = (int)(a1[i]^a2[i]); |
kvn@4001 | 883 | } |
kvn@4001 | 884 | } |
kvn@4001 | 885 | |
kvn@4001 | 886 | static void test_sllc(int[] a0, int[] a1) { |
kvn@4001 | 887 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 888 | a0[i] = (int)(a1[i]<<VALUE); |
kvn@4001 | 889 | } |
kvn@4001 | 890 | } |
kvn@4001 | 891 | static void test_sllc_n(int[] a0, int[] a1) { |
kvn@4001 | 892 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 893 | a0[i] = (int)(a1[i]<<(-VALUE)); |
kvn@4001 | 894 | } |
kvn@4001 | 895 | } |
kvn@4001 | 896 | static void test_sllc_o(int[] a0, int[] a1) { |
kvn@4001 | 897 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 898 | a0[i] = (int)(a1[i]<<SHIFT); |
kvn@4001 | 899 | } |
kvn@4001 | 900 | } |
kvn@4001 | 901 | static void test_sllc_on(int[] a0, int[] a1) { |
kvn@4001 | 902 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 903 | a0[i] = (int)(a1[i]<<(-SHIFT)); |
kvn@4001 | 904 | } |
kvn@4001 | 905 | } |
kvn@4001 | 906 | static void test_sllv(int[] a0, int[] a1, int b) { |
kvn@4001 | 907 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 908 | a0[i] = (int)(a1[i]<<b); |
kvn@4001 | 909 | } |
kvn@4001 | 910 | } |
kvn@4001 | 911 | |
kvn@4001 | 912 | static void test_srlc(int[] a0, int[] a1) { |
kvn@4001 | 913 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 914 | a0[i] = (int)(a1[i]>>>VALUE); |
kvn@4001 | 915 | } |
kvn@4001 | 916 | } |
kvn@4001 | 917 | static void test_srlc_n(int[] a0, int[] a1) { |
kvn@4001 | 918 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 919 | a0[i] = (int)(a1[i]>>>(-VALUE)); |
kvn@4001 | 920 | } |
kvn@4001 | 921 | } |
kvn@4001 | 922 | static void test_srlc_o(int[] a0, int[] a1) { |
kvn@4001 | 923 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 924 | a0[i] = (int)(a1[i]>>>SHIFT); |
kvn@4001 | 925 | } |
kvn@4001 | 926 | } |
kvn@4001 | 927 | static void test_srlc_on(int[] a0, int[] a1) { |
kvn@4001 | 928 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 929 | a0[i] = (int)(a1[i]>>>(-SHIFT)); |
kvn@4001 | 930 | } |
kvn@4001 | 931 | } |
kvn@4001 | 932 | static void test_srlv(int[] a0, int[] a1, int b) { |
kvn@4001 | 933 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 934 | a0[i] = (int)(a1[i]>>>b); |
kvn@4001 | 935 | } |
kvn@4001 | 936 | } |
kvn@4001 | 937 | |
kvn@4001 | 938 | static void test_srac(int[] a0, int[] a1) { |
kvn@4001 | 939 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 940 | a0[i] = (int)(a1[i]>>VALUE); |
kvn@4001 | 941 | } |
kvn@4001 | 942 | } |
kvn@4001 | 943 | static void test_srac_n(int[] a0, int[] a1) { |
kvn@4001 | 944 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 945 | a0[i] = (int)(a1[i]>>(-VALUE)); |
kvn@4001 | 946 | } |
kvn@4001 | 947 | } |
kvn@4001 | 948 | static void test_srac_o(int[] a0, int[] a1) { |
kvn@4001 | 949 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 950 | a0[i] = (int)(a1[i]>>SHIFT); |
kvn@4001 | 951 | } |
kvn@4001 | 952 | } |
kvn@4001 | 953 | static void test_srac_on(int[] a0, int[] a1) { |
kvn@4001 | 954 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 955 | a0[i] = (int)(a1[i]>>(-SHIFT)); |
kvn@4001 | 956 | } |
kvn@4001 | 957 | } |
kvn@4001 | 958 | static void test_srav(int[] a0, int[] a1, int b) { |
kvn@4001 | 959 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 960 | a0[i] = (int)(a1[i]>>b); |
kvn@4001 | 961 | } |
kvn@4001 | 962 | } |
kvn@4001 | 963 | |
kvn@4001 | 964 | static void test_pack2(long[] p2, int[] a1) { |
kvn@4001 | 965 | if (p2.length*2 > a1.length) return; |
kvn@4001 | 966 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 967 | long l0 = (long)a1[i*2+0]; |
kvn@4001 | 968 | long l1 = (long)a1[i*2+1]; |
kvn@4001 | 969 | p2[i] = (l1 << 32) | (l0 & 0xFFFFFFFFl); |
kvn@4001 | 970 | } |
kvn@4001 | 971 | } |
kvn@4001 | 972 | static void test_unpack2(int[] a0, long[] p2) { |
kvn@4001 | 973 | if (p2.length*2 > a0.length) return; |
kvn@4001 | 974 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 975 | long l = p2[i]; |
kvn@4001 | 976 | a0[i*2+0] = (int)(l & 0xFFFFFFFFl); |
kvn@4001 | 977 | a0[i*2+1] = (int)(l >> 32); |
kvn@4001 | 978 | } |
kvn@4001 | 979 | } |
kvn@4001 | 980 | static void test_pack2_swap(long[] p2, int[] a1) { |
kvn@4001 | 981 | if (p2.length*2 > a1.length) return; |
kvn@4001 | 982 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 983 | long l0 = (long)a1[i*2+0]; |
kvn@4001 | 984 | long l1 = (long)a1[i*2+1]; |
kvn@4001 | 985 | p2[i] = (l0 << 32) | (l1 & 0xFFFFFFFFl); |
kvn@4001 | 986 | } |
kvn@4001 | 987 | } |
kvn@4001 | 988 | static void test_unpack2_swap(int[] a0, long[] p2) { |
kvn@4001 | 989 | if (p2.length*2 > a0.length) return; |
kvn@4001 | 990 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 991 | long l = p2[i]; |
kvn@4001 | 992 | a0[i*2+0] = (int)(l >> 32); |
kvn@4001 | 993 | a0[i*2+1] = (int)(l & 0xFFFFFFFFl); |
kvn@4001 | 994 | } |
kvn@4001 | 995 | } |
kvn@4001 | 996 | |
kvn@4001 | 997 | static int verify(String text, int i, int elem, int val) { |
kvn@4001 | 998 | if (elem != val) { |
kvn@4001 | 999 | System.err.println(text + "[" + i + "] = " + elem + " != " + val); |
kvn@4001 | 1000 | return 1; |
kvn@4001 | 1001 | } |
kvn@4001 | 1002 | return 0; |
kvn@4001 | 1003 | } |
kvn@4001 | 1004 | |
kvn@4001 | 1005 | static int verify(String text, int i, long elem, long val) { |
kvn@4001 | 1006 | if (elem != val) { |
kvn@4001 | 1007 | System.err.println(text + "[" + i + "] = " + Long.toHexString(elem) + " != " + Long.toHexString(val)); |
kvn@4001 | 1008 | return 1; |
kvn@4001 | 1009 | } |
kvn@4001 | 1010 | return 0; |
kvn@4001 | 1011 | } |
kvn@4001 | 1012 | } |