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 TestByteVect |
kvn@4001 | 31 | */ |
kvn@4001 | 32 | |
kvn@4001 | 33 | public class TestByteVect { |
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 = 0; |
kvn@4001 | 37 | private static final int BIT_MASK = 0xB7; |
kvn@4001 | 38 | private static final int VALUE = 3; |
kvn@4001 | 39 | private static final int SHIFT = 8; |
kvn@4001 | 40 | |
kvn@4001 | 41 | public static void main(String args[]) { |
kvn@4001 | 42 | System.out.println("Testing Byte 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 | byte[] a0 = new byte[ARRLEN]; |
kvn@4001 | 53 | byte[] a1 = new byte[ARRLEN]; |
kvn@4001 | 54 | byte[] a2 = new byte[ARRLEN]; |
kvn@4001 | 55 | byte[] a3 = new byte[ARRLEN]; |
kvn@4001 | 56 | byte[] a4 = new byte[ARRLEN]; |
kvn@4001 | 57 | short[] p2 = new short[ARRLEN/2]; |
kvn@4001 | 58 | int[] p4 = new int[ARRLEN/4]; |
kvn@4001 | 59 | long[] p8 = new long[ARRLEN/8]; |
kvn@4001 | 60 | // Initialize |
kvn@4001 | 61 | int gold_sum = 0; |
kvn@4001 | 62 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 63 | byte val = (byte)(ADD_INIT+i); |
kvn@4001 | 64 | gold_sum += val; |
kvn@4001 | 65 | a1[i] = val; |
kvn@4001 | 66 | a2[i] = (byte)VALUE; |
kvn@4001 | 67 | a3[i] = (byte)-VALUE; |
kvn@4001 | 68 | a4[i] = (byte)BIT_MASK; |
kvn@4001 | 69 | } |
kvn@4001 | 70 | System.out.println("Warmup"); |
kvn@4001 | 71 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 72 | test_sum(a1); |
kvn@4001 | 73 | test_addc(a0, a1); |
kvn@4001 | 74 | test_addv(a0, a1, (byte)VALUE); |
kvn@4001 | 75 | test_adda(a0, a1, a2); |
kvn@4001 | 76 | test_subc(a0, a1); |
kvn@4001 | 77 | test_subv(a0, a1, (byte)VALUE); |
kvn@4001 | 78 | test_suba(a0, a1, a2); |
kvn@4001 | 79 | test_mulc(a0, a1); |
kvn@4001 | 80 | test_mulv(a0, a1, (byte)VALUE); |
kvn@4001 | 81 | test_mula(a0, a1, a2); |
kvn@4001 | 82 | test_divc(a0, a1); |
kvn@4001 | 83 | test_divv(a0, a1, (byte)VALUE); |
kvn@4001 | 84 | test_diva(a0, a1, a2); |
kvn@4001 | 85 | test_mulc_n(a0, a1); |
kvn@4001 | 86 | test_mulv(a0, a1, (byte)-VALUE); |
kvn@4001 | 87 | test_mula(a0, a1, a3); |
kvn@4001 | 88 | test_divc_n(a0, a1); |
kvn@4001 | 89 | test_divv(a0, a1, (byte)-VALUE); |
kvn@4001 | 90 | test_diva(a0, a1, a3); |
kvn@4001 | 91 | test_andc(a0, a1); |
kvn@4001 | 92 | test_andv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 93 | test_anda(a0, a1, a4); |
kvn@4001 | 94 | test_orc(a0, a1); |
kvn@4001 | 95 | test_orv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 96 | test_ora(a0, a1, a4); |
kvn@4001 | 97 | test_xorc(a0, a1); |
kvn@4001 | 98 | test_xorv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 99 | test_xora(a0, a1, a4); |
kvn@4001 | 100 | test_sllc(a0, a1); |
kvn@4001 | 101 | test_sllv(a0, a1, VALUE); |
kvn@4001 | 102 | test_srlc(a0, a1); |
kvn@4001 | 103 | test_srlv(a0, a1, VALUE); |
kvn@4001 | 104 | test_srac(a0, a1); |
kvn@4001 | 105 | test_srav(a0, a1, VALUE); |
kvn@4001 | 106 | test_sllc_n(a0, a1); |
kvn@4001 | 107 | test_sllv(a0, a1, -VALUE); |
kvn@4001 | 108 | test_srlc_n(a0, a1); |
kvn@4001 | 109 | test_srlv(a0, a1, -VALUE); |
kvn@4001 | 110 | test_srac_n(a0, a1); |
kvn@4001 | 111 | test_srav(a0, a1, -VALUE); |
kvn@4001 | 112 | test_sllc_o(a0, a1); |
kvn@4001 | 113 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 114 | test_srlc_o(a0, a1); |
kvn@4001 | 115 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 116 | test_srac_o(a0, a1); |
kvn@4001 | 117 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 118 | test_sllc_on(a0, a1); |
kvn@4001 | 119 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 120 | test_srlc_on(a0, a1); |
kvn@4001 | 121 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 122 | test_srac_on(a0, a1); |
kvn@4001 | 123 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 124 | test_pack2(p2, a1); |
kvn@4001 | 125 | test_unpack2(a0, p2); |
kvn@4001 | 126 | test_pack2_swap(p2, a1); |
kvn@4001 | 127 | test_unpack2_swap(a0, p2); |
kvn@4001 | 128 | test_pack4(p4, a1); |
kvn@4001 | 129 | test_unpack4(a0, p4); |
kvn@4001 | 130 | test_pack4_swap(p4, a1); |
kvn@4001 | 131 | test_unpack4_swap(a0, p4); |
kvn@4001 | 132 | test_pack8(p8, a1); |
kvn@4001 | 133 | test_unpack8(a0, p8); |
kvn@4001 | 134 | test_pack8_swap(p8, a1); |
kvn@4001 | 135 | test_unpack8_swap(a0, p8); |
kvn@4001 | 136 | } |
kvn@4001 | 137 | // Test and verify results |
kvn@4001 | 138 | System.out.println("Verification"); |
kvn@4001 | 139 | int errn = 0; |
kvn@4001 | 140 | { |
kvn@4001 | 141 | int sum = test_sum(a1); |
kvn@4001 | 142 | if (sum != gold_sum) { |
kvn@4001 | 143 | System.err.println("test_sum: " + sum + " != " + gold_sum); |
kvn@4001 | 144 | errn++; |
kvn@4001 | 145 | } |
kvn@4001 | 146 | |
kvn@4001 | 147 | test_addc(a0, a1); |
kvn@4001 | 148 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 149 | errn += verify("test_addc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 150 | } |
kvn@4001 | 151 | test_addv(a0, a1, (byte)VALUE); |
kvn@4001 | 152 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 153 | errn += verify("test_addv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 154 | } |
kvn@4001 | 155 | test_adda(a0, a1, a2); |
kvn@4001 | 156 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 157 | errn += verify("test_adda: ", i, a0[i], (byte)((byte)(ADD_INIT+i)+VALUE)); |
kvn@4001 | 158 | } |
kvn@4001 | 159 | |
kvn@4001 | 160 | test_subc(a0, a1); |
kvn@4001 | 161 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 162 | errn += verify("test_subc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 163 | } |
kvn@4001 | 164 | test_subv(a0, a1, (byte)VALUE); |
kvn@4001 | 165 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 166 | errn += verify("test_subv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 167 | } |
kvn@4001 | 168 | test_suba(a0, a1, a2); |
kvn@4001 | 169 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 170 | errn += verify("test_suba: ", i, a0[i], (byte)((byte)(ADD_INIT+i)-VALUE)); |
kvn@4001 | 171 | } |
kvn@4001 | 172 | |
kvn@4001 | 173 | test_mulc(a0, a1); |
kvn@4001 | 174 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 175 | errn += verify("test_mulc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 176 | } |
kvn@4001 | 177 | test_mulv(a0, a1, (byte)VALUE); |
kvn@4001 | 178 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 179 | errn += verify("test_mulv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 180 | } |
kvn@4001 | 181 | test_mula(a0, a1, a2); |
kvn@4001 | 182 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 183 | errn += verify("test_mula: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*VALUE)); |
kvn@4001 | 184 | } |
kvn@4001 | 185 | |
kvn@4001 | 186 | test_divc(a0, a1); |
kvn@4001 | 187 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 188 | errn += verify("test_divc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 189 | } |
kvn@4001 | 190 | test_divv(a0, a1, (byte)VALUE); |
kvn@4001 | 191 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 192 | errn += verify("test_divv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 193 | } |
kvn@4001 | 194 | test_diva(a0, a1, a2); |
kvn@4001 | 195 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 196 | errn += verify("test_diva: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/VALUE)); |
kvn@4001 | 197 | } |
kvn@4001 | 198 | |
kvn@4001 | 199 | test_mulc_n(a0, a1); |
kvn@4001 | 200 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 201 | errn += verify("test_mulc_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 202 | } |
kvn@4001 | 203 | test_mulv(a0, a1, (byte)-VALUE); |
kvn@4001 | 204 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 205 | errn += verify("test_mulv_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 206 | } |
kvn@4001 | 207 | test_mula(a0, a1, a3); |
kvn@4001 | 208 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 209 | errn += verify("test_mula_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)*(-VALUE))); |
kvn@4001 | 210 | } |
kvn@4001 | 211 | |
kvn@4001 | 212 | test_divc_n(a0, a1); |
kvn@4001 | 213 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 214 | errn += verify("test_divc_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 215 | } |
kvn@4001 | 216 | test_divv(a0, a1, (byte)-VALUE); |
kvn@4001 | 217 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 218 | errn += verify("test_divv_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 219 | } |
kvn@4001 | 220 | test_diva(a0, a1, a3); |
kvn@4001 | 221 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 222 | errn += verify("test_diva_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)/(-VALUE))); |
kvn@4001 | 223 | } |
kvn@4001 | 224 | |
kvn@4001 | 225 | test_andc(a0, a1); |
kvn@4001 | 226 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 227 | errn += verify("test_andc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 228 | } |
kvn@4001 | 229 | test_andv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 230 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 231 | errn += verify("test_andv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 232 | } |
kvn@4001 | 233 | test_anda(a0, a1, a4); |
kvn@4001 | 234 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 235 | errn += verify("test_anda: ", i, a0[i], (byte)((byte)(ADD_INIT+i)&BIT_MASK)); |
kvn@4001 | 236 | } |
kvn@4001 | 237 | |
kvn@4001 | 238 | test_orc(a0, a1); |
kvn@4001 | 239 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 240 | errn += verify("test_orc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 241 | } |
kvn@4001 | 242 | test_orv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 243 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 244 | errn += verify("test_orv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 245 | } |
kvn@4001 | 246 | test_ora(a0, a1, a4); |
kvn@4001 | 247 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 248 | errn += verify("test_ora: ", i, a0[i], (byte)((byte)(ADD_INIT+i)|BIT_MASK)); |
kvn@4001 | 249 | } |
kvn@4001 | 250 | |
kvn@4001 | 251 | test_xorc(a0, a1); |
kvn@4001 | 252 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 253 | errn += verify("test_xorc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 254 | } |
kvn@4001 | 255 | test_xorv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 256 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 257 | errn += verify("test_xorv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 258 | } |
kvn@4001 | 259 | test_xora(a0, a1, a4); |
kvn@4001 | 260 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 261 | errn += verify("test_xora: ", i, a0[i], (byte)((byte)(ADD_INIT+i)^BIT_MASK)); |
kvn@4001 | 262 | } |
kvn@4001 | 263 | |
kvn@4001 | 264 | test_sllc(a0, a1); |
kvn@4001 | 265 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 266 | errn += verify("test_sllc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<VALUE)); |
kvn@4001 | 267 | } |
kvn@4001 | 268 | test_sllv(a0, a1, VALUE); |
kvn@4001 | 269 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 270 | errn += verify("test_sllv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<VALUE)); |
kvn@4001 | 271 | } |
kvn@4001 | 272 | |
kvn@4001 | 273 | test_srlc(a0, a1); |
kvn@4001 | 274 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 275 | errn += verify("test_srlc: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>VALUE)); |
kvn@4001 | 276 | } |
kvn@4001 | 277 | test_srlv(a0, a1, VALUE); |
kvn@4001 | 278 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 279 | errn += verify("test_srlv: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>VALUE)); |
kvn@4001 | 280 | } |
kvn@4001 | 281 | |
kvn@4001 | 282 | test_srac(a0, a1); |
kvn@4001 | 283 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 284 | errn += verify("test_srac: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>VALUE)); |
kvn@4001 | 285 | } |
kvn@4001 | 286 | test_srav(a0, a1, VALUE); |
kvn@4001 | 287 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 288 | errn += verify("test_srav: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>VALUE)); |
kvn@4001 | 289 | } |
kvn@4001 | 290 | |
kvn@4001 | 291 | test_sllc_n(a0, a1); |
kvn@4001 | 292 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 293 | errn += verify("test_sllc_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<(-VALUE))); |
kvn@4001 | 294 | } |
kvn@4001 | 295 | test_sllv(a0, a1, -VALUE); |
kvn@4001 | 296 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 297 | errn += verify("test_sllv_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<(-VALUE))); |
kvn@4001 | 298 | } |
kvn@4001 | 299 | |
kvn@4001 | 300 | test_srlc_n(a0, a1); |
kvn@4001 | 301 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 302 | errn += verify("test_srlc_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>(-VALUE))); |
kvn@4001 | 303 | } |
kvn@4001 | 304 | test_srlv(a0, a1, -VALUE); |
kvn@4001 | 305 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 306 | errn += verify("test_srlv_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>(-VALUE))); |
kvn@4001 | 307 | } |
kvn@4001 | 308 | |
kvn@4001 | 309 | test_srac_n(a0, a1); |
kvn@4001 | 310 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 311 | errn += verify("test_srac_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>(-VALUE))); |
kvn@4001 | 312 | } |
kvn@4001 | 313 | test_srav(a0, a1, -VALUE); |
kvn@4001 | 314 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 315 | errn += verify("test_srav_n: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>(-VALUE))); |
kvn@4001 | 316 | } |
kvn@4001 | 317 | |
kvn@4001 | 318 | test_sllc_o(a0, a1); |
kvn@4001 | 319 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 320 | errn += verify("test_sllc_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<SHIFT)); |
kvn@4001 | 321 | } |
kvn@4001 | 322 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 323 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 324 | errn += verify("test_sllv_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<SHIFT)); |
kvn@4001 | 325 | } |
kvn@4001 | 326 | |
kvn@4001 | 327 | test_srlc_o(a0, a1); |
kvn@4001 | 328 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 329 | errn += verify("test_srlc_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>SHIFT)); |
kvn@4001 | 330 | } |
kvn@4001 | 331 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 332 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 333 | errn += verify("test_srlv_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>SHIFT)); |
kvn@4001 | 334 | } |
kvn@4001 | 335 | |
kvn@4001 | 336 | test_srac_o(a0, a1); |
kvn@4001 | 337 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 338 | errn += verify("test_srac_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>SHIFT)); |
kvn@4001 | 339 | } |
kvn@4001 | 340 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 341 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 342 | errn += verify("test_srav_o: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>SHIFT)); |
kvn@4001 | 343 | } |
kvn@4001 | 344 | |
kvn@4001 | 345 | test_sllc_on(a0, a1); |
kvn@4001 | 346 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 347 | errn += verify("test_sllc_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<(-SHIFT))); |
kvn@4001 | 348 | } |
kvn@4001 | 349 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 350 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 351 | errn += verify("test_sllv_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)<<(-SHIFT))); |
kvn@4001 | 352 | } |
kvn@4001 | 353 | |
kvn@4001 | 354 | test_srlc_on(a0, a1); |
kvn@4001 | 355 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 356 | errn += verify("test_srlc_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>(-SHIFT))); |
kvn@4001 | 357 | } |
kvn@4001 | 358 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 359 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 360 | errn += verify("test_srlv_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>>(-SHIFT))); |
kvn@4001 | 361 | } |
kvn@4001 | 362 | |
kvn@4001 | 363 | test_srac_on(a0, a1); |
kvn@4001 | 364 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 365 | errn += verify("test_srac_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>(-SHIFT))); |
kvn@4001 | 366 | } |
kvn@4001 | 367 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 368 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 369 | errn += verify("test_srav_on: ", i, a0[i], (byte)((byte)(ADD_INIT+i)>>(-SHIFT))); |
kvn@4001 | 370 | } |
kvn@4001 | 371 | |
kvn@4001 | 372 | test_pack2(p2, a1); |
kvn@4001 | 373 | for (int i=0; i<ARRLEN/2; i++) { |
kvn@4001 | 374 | errn += verify("test_pack2: ", i, p2[i], (short)(((short)(ADD_INIT+2*i) & 0xFF) | ((short)(ADD_INIT+2*i+1) << 8))); |
kvn@4001 | 375 | } |
kvn@4001 | 376 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 377 | a0[i] = -1; |
kvn@4001 | 378 | } |
kvn@4001 | 379 | test_unpack2(a0, p2); |
kvn@4001 | 380 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
kvn@4001 | 381 | errn += verify("test_unpack2: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 382 | } |
kvn@4001 | 383 | |
kvn@4001 | 384 | test_pack2_swap(p2, a1); |
kvn@4001 | 385 | for (int i=0; i<ARRLEN/2; i++) { |
kvn@4001 | 386 | errn += verify("test_pack2_swap: ", i, p2[i], (short)(((short)(ADD_INIT+2*i+1) & 0xFF) | ((short)(ADD_INIT+2*i) << 8))); |
kvn@4001 | 387 | } |
kvn@4001 | 388 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 389 | a0[i] = -1; |
kvn@4001 | 390 | } |
kvn@4001 | 391 | test_unpack2_swap(a0, p2); |
kvn@4001 | 392 | for (int i=0; i<(ARRLEN&(-2)); i++) { |
kvn@4001 | 393 | errn += verify("test_unpack2_swap: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 394 | } |
kvn@4001 | 395 | |
kvn@4001 | 396 | test_pack4(p4, a1); |
kvn@4001 | 397 | for (int i=0; i<ARRLEN/4; i++) { |
kvn@4001 | 398 | errn += verify("test_pack4: ", i, p4[i], ((int)(ADD_INIT+4*i+0) & 0xFF) | |
kvn@4001 | 399 | (((int)(ADD_INIT+4*i+1) & 0xFF) << 8) | |
kvn@4001 | 400 | (((int)(ADD_INIT+4*i+2) & 0xFF) << 16) | |
kvn@4001 | 401 | (((int)(ADD_INIT+4*i+3) & 0xFF) << 24)); |
kvn@4001 | 402 | } |
kvn@4001 | 403 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 404 | a0[i] = -1; |
kvn@4001 | 405 | } |
kvn@4001 | 406 | test_unpack4(a0, p4); |
kvn@4001 | 407 | for (int i=0; i<(ARRLEN&(-4)); i++) { |
kvn@4001 | 408 | errn += verify("test_unpack4: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 409 | } |
kvn@4001 | 410 | |
kvn@4001 | 411 | test_pack4_swap(p4, a1); |
kvn@4001 | 412 | for (int i=0; i<ARRLEN/4; i++) { |
kvn@4001 | 413 | errn += verify("test_pack4_swap: ", i, p4[i], ((int)(ADD_INIT+4*i+3) & 0xFF) | |
kvn@4001 | 414 | (((int)(ADD_INIT+4*i+2) & 0xFF) << 8) | |
kvn@4001 | 415 | (((int)(ADD_INIT+4*i+1) & 0xFF) << 16) | |
kvn@4001 | 416 | (((int)(ADD_INIT+4*i+0) & 0xFF) << 24)); |
kvn@4001 | 417 | } |
kvn@4001 | 418 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 419 | a0[i] = -1; |
kvn@4001 | 420 | } |
kvn@4001 | 421 | test_unpack4_swap(a0, p4); |
kvn@4001 | 422 | for (int i=0; i<(ARRLEN&(-4)); i++) { |
kvn@4001 | 423 | errn += verify("test_unpack4_swap: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 424 | } |
kvn@4001 | 425 | |
kvn@4001 | 426 | test_pack8(p8, a1); |
kvn@4001 | 427 | for (int i=0; i<ARRLEN/8; i++) { |
kvn@4001 | 428 | errn += verify("test_pack8: ", i, p8[i], ((long)(ADD_INIT+8*i+0) & 0xFFl) | |
kvn@4001 | 429 | (((long)(ADD_INIT+8*i+1) & 0xFFl) << 8) | |
kvn@4001 | 430 | (((long)(ADD_INIT+8*i+2) & 0xFFl) << 16) | |
kvn@4001 | 431 | (((long)(ADD_INIT+8*i+3) & 0xFFl) << 24) | |
kvn@4001 | 432 | (((long)(ADD_INIT+8*i+4) & 0xFFl) << 32) | |
kvn@4001 | 433 | (((long)(ADD_INIT+8*i+5) & 0xFFl) << 40) | |
kvn@4001 | 434 | (((long)(ADD_INIT+8*i+6) & 0xFFl) << 48) | |
kvn@4001 | 435 | (((long)(ADD_INIT+8*i+7) & 0xFFl) << 56)); |
kvn@4001 | 436 | } |
kvn@4001 | 437 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 438 | a0[i] = -1; |
kvn@4001 | 439 | } |
kvn@4001 | 440 | test_unpack8(a0, p8); |
kvn@4001 | 441 | for (int i=0; i<(ARRLEN&(-8)); i++) { |
kvn@4001 | 442 | errn += verify("test_unpack8: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 443 | } |
kvn@4001 | 444 | |
kvn@4001 | 445 | test_pack8_swap(p8, a1); |
kvn@4001 | 446 | for (int i=0; i<ARRLEN/8; i++) { |
kvn@4001 | 447 | errn += verify("test_pack8_swap: ", i, p8[i], ((long)(ADD_INIT+8*i+7) & 0xFFl) | |
kvn@4001 | 448 | (((long)(ADD_INIT+8*i+6) & 0xFFl) << 8) | |
kvn@4001 | 449 | (((long)(ADD_INIT+8*i+5) & 0xFFl) << 16) | |
kvn@4001 | 450 | (((long)(ADD_INIT+8*i+4) & 0xFFl) << 24) | |
kvn@4001 | 451 | (((long)(ADD_INIT+8*i+3) & 0xFFl) << 32) | |
kvn@4001 | 452 | (((long)(ADD_INIT+8*i+2) & 0xFFl) << 40) | |
kvn@4001 | 453 | (((long)(ADD_INIT+8*i+1) & 0xFFl) << 48) | |
kvn@4001 | 454 | (((long)(ADD_INIT+8*i+0) & 0xFFl) << 56)); |
kvn@4001 | 455 | } |
kvn@4001 | 456 | for (int i=0; i<ARRLEN; i++) { |
kvn@4001 | 457 | a0[i] = -1; |
kvn@4001 | 458 | } |
kvn@4001 | 459 | test_unpack8_swap(a0, p8); |
kvn@4001 | 460 | for (int i=0; i<(ARRLEN&(-8)); i++) { |
kvn@4001 | 461 | errn += verify("test_unpack8_swap: ", i, a0[i], (byte)(ADD_INIT+i)); |
kvn@4001 | 462 | } |
kvn@4001 | 463 | |
kvn@4001 | 464 | } |
kvn@4001 | 465 | |
kvn@4001 | 466 | if (errn > 0) |
kvn@4001 | 467 | return errn; |
kvn@4001 | 468 | |
kvn@4001 | 469 | System.out.println("Time"); |
kvn@4001 | 470 | long start, end; |
kvn@4001 | 471 | |
kvn@4001 | 472 | start = System.currentTimeMillis(); |
kvn@4001 | 473 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 474 | test_sum(a1); |
kvn@4001 | 475 | } |
kvn@4001 | 476 | end = System.currentTimeMillis(); |
kvn@4001 | 477 | System.out.println("test_sum: " + (end - start)); |
kvn@4001 | 478 | |
kvn@4001 | 479 | start = System.currentTimeMillis(); |
kvn@4001 | 480 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 481 | test_addc(a0, a1); |
kvn@4001 | 482 | } |
kvn@4001 | 483 | end = System.currentTimeMillis(); |
kvn@4001 | 484 | System.out.println("test_addc: " + (end - start)); |
kvn@4001 | 485 | start = System.currentTimeMillis(); |
kvn@4001 | 486 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 487 | test_addv(a0, a1, (byte)VALUE); |
kvn@4001 | 488 | } |
kvn@4001 | 489 | end = System.currentTimeMillis(); |
kvn@4001 | 490 | System.out.println("test_addv: " + (end - start)); |
kvn@4001 | 491 | start = System.currentTimeMillis(); |
kvn@4001 | 492 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 493 | test_adda(a0, a1, a2); |
kvn@4001 | 494 | } |
kvn@4001 | 495 | end = System.currentTimeMillis(); |
kvn@4001 | 496 | System.out.println("test_adda: " + (end - start)); |
kvn@4001 | 497 | |
kvn@4001 | 498 | start = System.currentTimeMillis(); |
kvn@4001 | 499 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 500 | test_subc(a0, a1); |
kvn@4001 | 501 | } |
kvn@4001 | 502 | end = System.currentTimeMillis(); |
kvn@4001 | 503 | System.out.println("test_subc: " + (end - start)); |
kvn@4001 | 504 | start = System.currentTimeMillis(); |
kvn@4001 | 505 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 506 | test_subv(a0, a1, (byte)VALUE); |
kvn@4001 | 507 | } |
kvn@4001 | 508 | end = System.currentTimeMillis(); |
kvn@4001 | 509 | System.out.println("test_subv: " + (end - start)); |
kvn@4001 | 510 | start = System.currentTimeMillis(); |
kvn@4001 | 511 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 512 | test_suba(a0, a1, a2); |
kvn@4001 | 513 | } |
kvn@4001 | 514 | end = System.currentTimeMillis(); |
kvn@4001 | 515 | System.out.println("test_suba: " + (end - start)); |
kvn@4001 | 516 | |
kvn@4001 | 517 | start = System.currentTimeMillis(); |
kvn@4001 | 518 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 519 | test_mulc(a0, a1); |
kvn@4001 | 520 | } |
kvn@4001 | 521 | end = System.currentTimeMillis(); |
kvn@4001 | 522 | System.out.println("test_mulc: " + (end - start)); |
kvn@4001 | 523 | start = System.currentTimeMillis(); |
kvn@4001 | 524 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 525 | test_mulv(a0, a1, (byte)VALUE); |
kvn@4001 | 526 | } |
kvn@4001 | 527 | end = System.currentTimeMillis(); |
kvn@4001 | 528 | System.out.println("test_mulv: " + (end - start)); |
kvn@4001 | 529 | start = System.currentTimeMillis(); |
kvn@4001 | 530 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 531 | test_mula(a0, a1, a2); |
kvn@4001 | 532 | } |
kvn@4001 | 533 | end = System.currentTimeMillis(); |
kvn@4001 | 534 | System.out.println("test_mula: " + (end - start)); |
kvn@4001 | 535 | |
kvn@4001 | 536 | start = System.currentTimeMillis(); |
kvn@4001 | 537 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 538 | test_divc(a0, a1); |
kvn@4001 | 539 | } |
kvn@4001 | 540 | end = System.currentTimeMillis(); |
kvn@4001 | 541 | System.out.println("test_divc: " + (end - start)); |
kvn@4001 | 542 | start = System.currentTimeMillis(); |
kvn@4001 | 543 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 544 | test_divv(a0, a1, (byte)VALUE); |
kvn@4001 | 545 | } |
kvn@4001 | 546 | end = System.currentTimeMillis(); |
kvn@4001 | 547 | System.out.println("test_divv: " + (end - start)); |
kvn@4001 | 548 | start = System.currentTimeMillis(); |
kvn@4001 | 549 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 550 | test_diva(a0, a1, a2); |
kvn@4001 | 551 | } |
kvn@4001 | 552 | end = System.currentTimeMillis(); |
kvn@4001 | 553 | System.out.println("test_diva: " + (end - start)); |
kvn@4001 | 554 | |
kvn@4001 | 555 | start = System.currentTimeMillis(); |
kvn@4001 | 556 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 557 | test_mulc_n(a0, a1); |
kvn@4001 | 558 | } |
kvn@4001 | 559 | end = System.currentTimeMillis(); |
kvn@4001 | 560 | System.out.println("test_mulc_n: " + (end - start)); |
kvn@4001 | 561 | start = System.currentTimeMillis(); |
kvn@4001 | 562 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 563 | test_mulv(a0, a1, (byte)-VALUE); |
kvn@4001 | 564 | } |
kvn@4001 | 565 | end = System.currentTimeMillis(); |
kvn@4001 | 566 | System.out.println("test_mulv_n: " + (end - start)); |
kvn@4001 | 567 | start = System.currentTimeMillis(); |
kvn@4001 | 568 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 569 | test_mula(a0, a1, a3); |
kvn@4001 | 570 | } |
kvn@4001 | 571 | end = System.currentTimeMillis(); |
kvn@4001 | 572 | System.out.println("test_mula_n: " + (end - start)); |
kvn@4001 | 573 | |
kvn@4001 | 574 | start = System.currentTimeMillis(); |
kvn@4001 | 575 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 576 | test_divc_n(a0, a1); |
kvn@4001 | 577 | } |
kvn@4001 | 578 | end = System.currentTimeMillis(); |
kvn@4001 | 579 | System.out.println("test_divc_n: " + (end - start)); |
kvn@4001 | 580 | start = System.currentTimeMillis(); |
kvn@4001 | 581 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 582 | test_divv(a0, a1, (byte)-VALUE); |
kvn@4001 | 583 | } |
kvn@4001 | 584 | end = System.currentTimeMillis(); |
kvn@4001 | 585 | System.out.println("test_divv_n: " + (end - start)); |
kvn@4001 | 586 | start = System.currentTimeMillis(); |
kvn@4001 | 587 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 588 | test_diva(a0, a1, a3); |
kvn@4001 | 589 | } |
kvn@4001 | 590 | end = System.currentTimeMillis(); |
kvn@4001 | 591 | System.out.println("test_diva_n: " + (end - start)); |
kvn@4001 | 592 | |
kvn@4001 | 593 | start = System.currentTimeMillis(); |
kvn@4001 | 594 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 595 | test_andc(a0, a1); |
kvn@4001 | 596 | } |
kvn@4001 | 597 | end = System.currentTimeMillis(); |
kvn@4001 | 598 | System.out.println("test_andc: " + (end - start)); |
kvn@4001 | 599 | start = System.currentTimeMillis(); |
kvn@4001 | 600 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 601 | test_andv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 602 | } |
kvn@4001 | 603 | end = System.currentTimeMillis(); |
kvn@4001 | 604 | System.out.println("test_andv: " + (end - start)); |
kvn@4001 | 605 | start = System.currentTimeMillis(); |
kvn@4001 | 606 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 607 | test_anda(a0, a1, a4); |
kvn@4001 | 608 | } |
kvn@4001 | 609 | end = System.currentTimeMillis(); |
kvn@4001 | 610 | System.out.println("test_anda: " + (end - start)); |
kvn@4001 | 611 | |
kvn@4001 | 612 | start = System.currentTimeMillis(); |
kvn@4001 | 613 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 614 | test_orc(a0, a1); |
kvn@4001 | 615 | } |
kvn@4001 | 616 | end = System.currentTimeMillis(); |
kvn@4001 | 617 | System.out.println("test_orc: " + (end - start)); |
kvn@4001 | 618 | start = System.currentTimeMillis(); |
kvn@4001 | 619 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 620 | test_orv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 621 | } |
kvn@4001 | 622 | end = System.currentTimeMillis(); |
kvn@4001 | 623 | System.out.println("test_orv: " + (end - start)); |
kvn@4001 | 624 | start = System.currentTimeMillis(); |
kvn@4001 | 625 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 626 | test_ora(a0, a1, a4); |
kvn@4001 | 627 | } |
kvn@4001 | 628 | end = System.currentTimeMillis(); |
kvn@4001 | 629 | System.out.println("test_ora: " + (end - start)); |
kvn@4001 | 630 | |
kvn@4001 | 631 | start = System.currentTimeMillis(); |
kvn@4001 | 632 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 633 | test_xorc(a0, a1); |
kvn@4001 | 634 | } |
kvn@4001 | 635 | end = System.currentTimeMillis(); |
kvn@4001 | 636 | System.out.println("test_xorc: " + (end - start)); |
kvn@4001 | 637 | start = System.currentTimeMillis(); |
kvn@4001 | 638 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 639 | test_xorv(a0, a1, (byte)BIT_MASK); |
kvn@4001 | 640 | } |
kvn@4001 | 641 | end = System.currentTimeMillis(); |
kvn@4001 | 642 | System.out.println("test_xorv: " + (end - start)); |
kvn@4001 | 643 | start = System.currentTimeMillis(); |
kvn@4001 | 644 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 645 | test_xora(a0, a1, a4); |
kvn@4001 | 646 | } |
kvn@4001 | 647 | end = System.currentTimeMillis(); |
kvn@4001 | 648 | System.out.println("test_xora: " + (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(a0, a1); |
kvn@4001 | 653 | } |
kvn@4001 | 654 | end = System.currentTimeMillis(); |
kvn@4001 | 655 | System.out.println("test_sllc: " + (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, VALUE); |
kvn@4001 | 659 | } |
kvn@4001 | 660 | end = System.currentTimeMillis(); |
kvn@4001 | 661 | System.out.println("test_sllv: " + (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(a0, a1); |
kvn@4001 | 666 | } |
kvn@4001 | 667 | end = System.currentTimeMillis(); |
kvn@4001 | 668 | System.out.println("test_srlc: " + (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, VALUE); |
kvn@4001 | 672 | } |
kvn@4001 | 673 | end = System.currentTimeMillis(); |
kvn@4001 | 674 | System.out.println("test_srlv: " + (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(a0, a1); |
kvn@4001 | 679 | } |
kvn@4001 | 680 | end = System.currentTimeMillis(); |
kvn@4001 | 681 | System.out.println("test_srac: " + (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, VALUE); |
kvn@4001 | 685 | } |
kvn@4001 | 686 | end = System.currentTimeMillis(); |
kvn@4001 | 687 | System.out.println("test_srav: " + (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_n(a0, a1); |
kvn@4001 | 692 | } |
kvn@4001 | 693 | end = System.currentTimeMillis(); |
kvn@4001 | 694 | System.out.println("test_sllc_n: " + (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, -VALUE); |
kvn@4001 | 698 | } |
kvn@4001 | 699 | end = System.currentTimeMillis(); |
kvn@4001 | 700 | System.out.println("test_sllv_n: " + (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_n(a0, a1); |
kvn@4001 | 705 | } |
kvn@4001 | 706 | end = System.currentTimeMillis(); |
kvn@4001 | 707 | System.out.println("test_srlc_n: " + (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, -VALUE); |
kvn@4001 | 711 | } |
kvn@4001 | 712 | end = System.currentTimeMillis(); |
kvn@4001 | 713 | System.out.println("test_srlv_n: " + (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_n(a0, a1); |
kvn@4001 | 718 | } |
kvn@4001 | 719 | end = System.currentTimeMillis(); |
kvn@4001 | 720 | System.out.println("test_srac_n: " + (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, -VALUE); |
kvn@4001 | 724 | } |
kvn@4001 | 725 | end = System.currentTimeMillis(); |
kvn@4001 | 726 | System.out.println("test_srav_n: " + (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_sllc_o(a0, a1); |
kvn@4001 | 731 | } |
kvn@4001 | 732 | end = System.currentTimeMillis(); |
kvn@4001 | 733 | System.out.println("test_sllc_o: " + (end - start)); |
kvn@4001 | 734 | start = System.currentTimeMillis(); |
kvn@4001 | 735 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 736 | test_sllv(a0, a1, SHIFT); |
kvn@4001 | 737 | } |
kvn@4001 | 738 | end = System.currentTimeMillis(); |
kvn@4001 | 739 | System.out.println("test_sllv_o: " + (end - start)); |
kvn@4001 | 740 | |
kvn@4001 | 741 | start = System.currentTimeMillis(); |
kvn@4001 | 742 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 743 | test_srlc_o(a0, a1); |
kvn@4001 | 744 | } |
kvn@4001 | 745 | end = System.currentTimeMillis(); |
kvn@4001 | 746 | System.out.println("test_srlc_o: " + (end - start)); |
kvn@4001 | 747 | start = System.currentTimeMillis(); |
kvn@4001 | 748 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 749 | test_srlv(a0, a1, SHIFT); |
kvn@4001 | 750 | } |
kvn@4001 | 751 | end = System.currentTimeMillis(); |
kvn@4001 | 752 | System.out.println("test_srlv_o: " + (end - start)); |
kvn@4001 | 753 | |
kvn@4001 | 754 | start = System.currentTimeMillis(); |
kvn@4001 | 755 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 756 | test_srac_o(a0, a1); |
kvn@4001 | 757 | } |
kvn@4001 | 758 | end = System.currentTimeMillis(); |
kvn@4001 | 759 | System.out.println("test_srac_o: " + (end - start)); |
kvn@4001 | 760 | start = System.currentTimeMillis(); |
kvn@4001 | 761 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 762 | test_srav(a0, a1, SHIFT); |
kvn@4001 | 763 | } |
kvn@4001 | 764 | end = System.currentTimeMillis(); |
kvn@4001 | 765 | System.out.println("test_srav_o: " + (end - start)); |
kvn@4001 | 766 | |
kvn@4001 | 767 | start = System.currentTimeMillis(); |
kvn@4001 | 768 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 769 | test_sllc_on(a0, a1); |
kvn@4001 | 770 | } |
kvn@4001 | 771 | end = System.currentTimeMillis(); |
kvn@4001 | 772 | System.out.println("test_sllc_on: " + (end - start)); |
kvn@4001 | 773 | start = System.currentTimeMillis(); |
kvn@4001 | 774 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 775 | test_sllv(a0, a1, -SHIFT); |
kvn@4001 | 776 | } |
kvn@4001 | 777 | end = System.currentTimeMillis(); |
kvn@4001 | 778 | System.out.println("test_sllv_on: " + (end - start)); |
kvn@4001 | 779 | |
kvn@4001 | 780 | start = System.currentTimeMillis(); |
kvn@4001 | 781 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 782 | test_srlc_on(a0, a1); |
kvn@4001 | 783 | } |
kvn@4001 | 784 | end = System.currentTimeMillis(); |
kvn@4001 | 785 | System.out.println("test_srlc_on: " + (end - start)); |
kvn@4001 | 786 | start = System.currentTimeMillis(); |
kvn@4001 | 787 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 788 | test_srlv(a0, a1, -SHIFT); |
kvn@4001 | 789 | } |
kvn@4001 | 790 | end = System.currentTimeMillis(); |
kvn@4001 | 791 | System.out.println("test_srlv_on: " + (end - start)); |
kvn@4001 | 792 | |
kvn@4001 | 793 | start = System.currentTimeMillis(); |
kvn@4001 | 794 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 795 | test_srac_on(a0, a1); |
kvn@4001 | 796 | } |
kvn@4001 | 797 | end = System.currentTimeMillis(); |
kvn@4001 | 798 | System.out.println("test_srac_on: " + (end - start)); |
kvn@4001 | 799 | start = System.currentTimeMillis(); |
kvn@4001 | 800 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 801 | test_srav(a0, a1, -SHIFT); |
kvn@4001 | 802 | } |
kvn@4001 | 803 | end = System.currentTimeMillis(); |
kvn@4001 | 804 | System.out.println("test_srav_on: " + (end - start)); |
kvn@4001 | 805 | |
kvn@4001 | 806 | start = System.currentTimeMillis(); |
kvn@4001 | 807 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 808 | test_pack2(p2, a1); |
kvn@4001 | 809 | } |
kvn@4001 | 810 | end = System.currentTimeMillis(); |
kvn@4001 | 811 | System.out.println("test_pack2: " + (end - start)); |
kvn@4001 | 812 | start = System.currentTimeMillis(); |
kvn@4001 | 813 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 814 | test_unpack2(a0, p2); |
kvn@4001 | 815 | } |
kvn@4001 | 816 | end = System.currentTimeMillis(); |
kvn@4001 | 817 | System.out.println("test_unpack2: " + (end - start)); |
kvn@4001 | 818 | start = System.currentTimeMillis(); |
kvn@4001 | 819 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 820 | test_pack2_swap(p2, a1); |
kvn@4001 | 821 | } |
kvn@4001 | 822 | end = System.currentTimeMillis(); |
kvn@4001 | 823 | System.out.println("test_pack2_swap: " + (end - start)); |
kvn@4001 | 824 | start = System.currentTimeMillis(); |
kvn@4001 | 825 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 826 | test_unpack2_swap(a0, p2); |
kvn@4001 | 827 | } |
kvn@4001 | 828 | end = System.currentTimeMillis(); |
kvn@4001 | 829 | System.out.println("test_unpack2_swap: " + (end - start)); |
kvn@4001 | 830 | |
kvn@4001 | 831 | start = System.currentTimeMillis(); |
kvn@4001 | 832 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 833 | test_pack4(p4, a1); |
kvn@4001 | 834 | } |
kvn@4001 | 835 | end = System.currentTimeMillis(); |
kvn@4001 | 836 | System.out.println("test_pack4: " + (end - start)); |
kvn@4001 | 837 | start = System.currentTimeMillis(); |
kvn@4001 | 838 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 839 | test_unpack4(a0, p4); |
kvn@4001 | 840 | } |
kvn@4001 | 841 | end = System.currentTimeMillis(); |
kvn@4001 | 842 | System.out.println("test_unpack4: " + (end - start)); |
kvn@4001 | 843 | start = System.currentTimeMillis(); |
kvn@4001 | 844 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 845 | test_pack4_swap(p4, a1); |
kvn@4001 | 846 | } |
kvn@4001 | 847 | end = System.currentTimeMillis(); |
kvn@4001 | 848 | System.out.println("test_pack4_swap: " + (end - start)); |
kvn@4001 | 849 | start = System.currentTimeMillis(); |
kvn@4001 | 850 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 851 | test_unpack4_swap(a0, p4); |
kvn@4001 | 852 | } |
kvn@4001 | 853 | end = System.currentTimeMillis(); |
kvn@4001 | 854 | System.out.println("test_unpack4_swap: " + (end - start)); |
kvn@4001 | 855 | |
kvn@4001 | 856 | start = System.currentTimeMillis(); |
kvn@4001 | 857 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 858 | test_pack8(p8, a1); |
kvn@4001 | 859 | } |
kvn@4001 | 860 | end = System.currentTimeMillis(); |
kvn@4001 | 861 | System.out.println("test_pack8: " + (end - start)); |
kvn@4001 | 862 | start = System.currentTimeMillis(); |
kvn@4001 | 863 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 864 | test_unpack8(a0, p8); |
kvn@4001 | 865 | } |
kvn@4001 | 866 | end = System.currentTimeMillis(); |
kvn@4001 | 867 | System.out.println("test_unpack8: " + (end - start)); |
kvn@4001 | 868 | start = System.currentTimeMillis(); |
kvn@4001 | 869 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 870 | test_pack8_swap(p8, a1); |
kvn@4001 | 871 | } |
kvn@4001 | 872 | end = System.currentTimeMillis(); |
kvn@4001 | 873 | System.out.println("test_pack8_swap: " + (end - start)); |
kvn@4001 | 874 | start = System.currentTimeMillis(); |
kvn@4001 | 875 | for (int i=0; i<ITERS; i++) { |
kvn@4001 | 876 | test_unpack8_swap(a0, p8); |
kvn@4001 | 877 | } |
kvn@4001 | 878 | end = System.currentTimeMillis(); |
kvn@4001 | 879 | System.out.println("test_unpack8_swap: " + (end - start)); |
kvn@4001 | 880 | |
kvn@4001 | 881 | return errn; |
kvn@4001 | 882 | } |
kvn@4001 | 883 | |
kvn@4001 | 884 | static int test_sum(byte[] a1) { |
kvn@4001 | 885 | int sum = 0; |
kvn@4001 | 886 | for (int i = 0; i < a1.length; i+=1) { |
kvn@4001 | 887 | sum += a1[i]; |
kvn@4001 | 888 | } |
kvn@4001 | 889 | return sum; |
kvn@4001 | 890 | } |
kvn@4001 | 891 | |
kvn@4001 | 892 | static void test_addc(byte[] a0, byte[] a1) { |
kvn@4001 | 893 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 894 | a0[i] = (byte)(a1[i]+VALUE); |
kvn@4001 | 895 | } |
kvn@4001 | 896 | } |
kvn@4001 | 897 | static void test_addv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 898 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 899 | a0[i] = (byte)(a1[i]+b); |
kvn@4001 | 900 | } |
kvn@4001 | 901 | } |
kvn@4001 | 902 | static void test_adda(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 903 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 904 | a0[i] = (byte)(a1[i]+a2[i]); |
kvn@4001 | 905 | } |
kvn@4001 | 906 | } |
kvn@4001 | 907 | |
kvn@4001 | 908 | static void test_subc(byte[] a0, byte[] a1) { |
kvn@4001 | 909 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 910 | a0[i] = (byte)(a1[i]-VALUE); |
kvn@4001 | 911 | } |
kvn@4001 | 912 | } |
kvn@4001 | 913 | static void test_subv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 914 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 915 | a0[i] = (byte)(a1[i]-b); |
kvn@4001 | 916 | } |
kvn@4001 | 917 | } |
kvn@4001 | 918 | static void test_suba(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 919 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 920 | a0[i] = (byte)(a1[i]-a2[i]); |
kvn@4001 | 921 | } |
kvn@4001 | 922 | } |
kvn@4001 | 923 | |
kvn@4001 | 924 | static void test_mulc(byte[] a0, byte[] a1) { |
kvn@4001 | 925 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 926 | a0[i] = (byte)(a1[i]*VALUE); |
kvn@4001 | 927 | } |
kvn@4001 | 928 | } |
kvn@4001 | 929 | static void test_mulc_n(byte[] a0, byte[] a1) { |
kvn@4001 | 930 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 931 | a0[i] = (byte)(a1[i]*(-VALUE)); |
kvn@4001 | 932 | } |
kvn@4001 | 933 | } |
kvn@4001 | 934 | static void test_mulv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 935 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 936 | a0[i] = (byte)(a1[i]*b); |
kvn@4001 | 937 | } |
kvn@4001 | 938 | } |
kvn@4001 | 939 | static void test_mula(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 940 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 941 | a0[i] = (byte)(a1[i]*a2[i]); |
kvn@4001 | 942 | } |
kvn@4001 | 943 | } |
kvn@4001 | 944 | |
kvn@4001 | 945 | static void test_divc(byte[] a0, byte[] a1) { |
kvn@4001 | 946 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 947 | a0[i] = (byte)(a1[i]/VALUE); |
kvn@4001 | 948 | } |
kvn@4001 | 949 | } |
kvn@4001 | 950 | static void test_divc_n(byte[] a0, byte[] a1) { |
kvn@4001 | 951 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 952 | a0[i] = (byte)(a1[i]/(-VALUE)); |
kvn@4001 | 953 | } |
kvn@4001 | 954 | } |
kvn@4001 | 955 | static void test_divv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 956 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 957 | a0[i] = (byte)(a1[i]/b); |
kvn@4001 | 958 | } |
kvn@4001 | 959 | } |
kvn@4001 | 960 | static void test_diva(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 961 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 962 | a0[i] = (byte)(a1[i]/a2[i]); |
kvn@4001 | 963 | } |
kvn@4001 | 964 | } |
kvn@4001 | 965 | |
kvn@4001 | 966 | static void test_andc(byte[] a0, byte[] a1) { |
kvn@4001 | 967 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 968 | a0[i] = (byte)(a1[i]&BIT_MASK); |
kvn@4001 | 969 | } |
kvn@4001 | 970 | } |
kvn@4001 | 971 | static void test_andv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 972 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 973 | a0[i] = (byte)(a1[i]&b); |
kvn@4001 | 974 | } |
kvn@4001 | 975 | } |
kvn@4001 | 976 | static void test_anda(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 977 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 978 | a0[i] = (byte)(a1[i]&a2[i]); |
kvn@4001 | 979 | } |
kvn@4001 | 980 | } |
kvn@4001 | 981 | |
kvn@4001 | 982 | static void test_orc(byte[] a0, byte[] a1) { |
kvn@4001 | 983 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 984 | a0[i] = (byte)(a1[i]|BIT_MASK); |
kvn@4001 | 985 | } |
kvn@4001 | 986 | } |
kvn@4001 | 987 | static void test_orv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 988 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 989 | a0[i] = (byte)(a1[i]|b); |
kvn@4001 | 990 | } |
kvn@4001 | 991 | } |
kvn@4001 | 992 | static void test_ora(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 993 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 994 | a0[i] = (byte)(a1[i]|a2[i]); |
kvn@4001 | 995 | } |
kvn@4001 | 996 | } |
kvn@4001 | 997 | |
kvn@4001 | 998 | static void test_xorc(byte[] a0, byte[] a1) { |
kvn@4001 | 999 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1000 | a0[i] = (byte)(a1[i]^BIT_MASK); |
kvn@4001 | 1001 | } |
kvn@4001 | 1002 | } |
kvn@4001 | 1003 | static void test_xorv(byte[] a0, byte[] a1, byte b) { |
kvn@4001 | 1004 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1005 | a0[i] = (byte)(a1[i]^b); |
kvn@4001 | 1006 | } |
kvn@4001 | 1007 | } |
kvn@4001 | 1008 | static void test_xora(byte[] a0, byte[] a1, byte[] a2) { |
kvn@4001 | 1009 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1010 | a0[i] = (byte)(a1[i]^a2[i]); |
kvn@4001 | 1011 | } |
kvn@4001 | 1012 | } |
kvn@4001 | 1013 | |
kvn@4001 | 1014 | static void test_sllc(byte[] a0, byte[] a1) { |
kvn@4001 | 1015 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1016 | a0[i] = (byte)(a1[i]<<VALUE); |
kvn@4001 | 1017 | } |
kvn@4001 | 1018 | } |
kvn@4001 | 1019 | static void test_sllc_n(byte[] a0, byte[] a1) { |
kvn@4001 | 1020 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1021 | a0[i] = (byte)(a1[i]<<(-VALUE)); |
kvn@4001 | 1022 | } |
kvn@4001 | 1023 | } |
kvn@4001 | 1024 | static void test_sllc_o(byte[] a0, byte[] a1) { |
kvn@4001 | 1025 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1026 | a0[i] = (byte)(a1[i]<<SHIFT); |
kvn@4001 | 1027 | } |
kvn@4001 | 1028 | } |
kvn@4001 | 1029 | static void test_sllc_on(byte[] a0, byte[] a1) { |
kvn@4001 | 1030 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1031 | a0[i] = (byte)(a1[i]<<(-SHIFT)); |
kvn@4001 | 1032 | } |
kvn@4001 | 1033 | } |
kvn@4001 | 1034 | static void test_sllv(byte[] a0, byte[] a1, int b) { |
kvn@4001 | 1035 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1036 | a0[i] = (byte)(a1[i]<<b); |
kvn@4001 | 1037 | } |
kvn@4001 | 1038 | } |
kvn@4001 | 1039 | |
kvn@4001 | 1040 | static void test_srlc(byte[] a0, byte[] a1) { |
kvn@4001 | 1041 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1042 | a0[i] = (byte)(a1[i]>>>VALUE); |
kvn@4001 | 1043 | } |
kvn@4001 | 1044 | } |
kvn@4001 | 1045 | static void test_srlc_n(byte[] a0, byte[] a1) { |
kvn@4001 | 1046 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1047 | a0[i] = (byte)(a1[i]>>>(-VALUE)); |
kvn@4001 | 1048 | } |
kvn@4001 | 1049 | } |
kvn@4001 | 1050 | static void test_srlc_o(byte[] a0, byte[] a1) { |
kvn@4001 | 1051 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1052 | a0[i] = (byte)(a1[i]>>>SHIFT); |
kvn@4001 | 1053 | } |
kvn@4001 | 1054 | } |
kvn@4001 | 1055 | static void test_srlc_on(byte[] a0, byte[] a1) { |
kvn@4001 | 1056 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1057 | a0[i] = (byte)(a1[i]>>>(-SHIFT)); |
kvn@4001 | 1058 | } |
kvn@4001 | 1059 | } |
kvn@4001 | 1060 | static void test_srlv(byte[] a0, byte[] a1, int b) { |
kvn@4001 | 1061 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1062 | a0[i] = (byte)(a1[i]>>>b); |
kvn@4001 | 1063 | } |
kvn@4001 | 1064 | } |
kvn@4001 | 1065 | |
kvn@4001 | 1066 | static void test_srac(byte[] a0, byte[] a1) { |
kvn@4001 | 1067 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1068 | a0[i] = (byte)(a1[i]>>VALUE); |
kvn@4001 | 1069 | } |
kvn@4001 | 1070 | } |
kvn@4001 | 1071 | static void test_srac_n(byte[] a0, byte[] a1) { |
kvn@4001 | 1072 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1073 | a0[i] = (byte)(a1[i]>>(-VALUE)); |
kvn@4001 | 1074 | } |
kvn@4001 | 1075 | } |
kvn@4001 | 1076 | static void test_srac_o(byte[] a0, byte[] a1) { |
kvn@4001 | 1077 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1078 | a0[i] = (byte)(a1[i]>>SHIFT); |
kvn@4001 | 1079 | } |
kvn@4001 | 1080 | } |
kvn@4001 | 1081 | static void test_srac_on(byte[] a0, byte[] a1) { |
kvn@4001 | 1082 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1083 | a0[i] = (byte)(a1[i]>>(-SHIFT)); |
kvn@4001 | 1084 | } |
kvn@4001 | 1085 | } |
kvn@4001 | 1086 | static void test_srav(byte[] a0, byte[] a1, int b) { |
kvn@4001 | 1087 | for (int i = 0; i < a0.length; i+=1) { |
kvn@4001 | 1088 | a0[i] = (byte)(a1[i]>>b); |
kvn@4001 | 1089 | } |
kvn@4001 | 1090 | } |
kvn@4001 | 1091 | |
kvn@4001 | 1092 | static void test_pack2(short[] p2, byte[] a1) { |
kvn@4001 | 1093 | if (p2.length*2 > a1.length) return; |
kvn@4001 | 1094 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 1095 | short l0 = (short)a1[i*2+0]; |
kvn@4001 | 1096 | short l1 = (short)a1[i*2+1]; |
kvn@4001 | 1097 | p2[i] = (short)((l1 << 8) | (l0 & 0xFF)); |
kvn@4001 | 1098 | } |
kvn@4001 | 1099 | } |
kvn@4001 | 1100 | static void test_unpack2(byte[] a0, short[] p2) { |
kvn@4001 | 1101 | if (p2.length*2 > a0.length) return; |
kvn@4001 | 1102 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 1103 | short l = p2[i]; |
kvn@4001 | 1104 | a0[i*2+0] = (byte)(l & 0xFF); |
kvn@4001 | 1105 | a0[i*2+1] = (byte)(l >> 8); |
kvn@4001 | 1106 | } |
kvn@4001 | 1107 | } |
kvn@4001 | 1108 | static void test_pack2_swap(short[] p2, byte[] a1) { |
kvn@4001 | 1109 | if (p2.length*2 > a1.length) return; |
kvn@4001 | 1110 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 1111 | short l0 = (short)a1[i*2+0]; |
kvn@4001 | 1112 | short l1 = (short)a1[i*2+1]; |
kvn@4001 | 1113 | p2[i] = (short)((l0 << 8) | (l1 & 0xFF)); |
kvn@4001 | 1114 | } |
kvn@4001 | 1115 | } |
kvn@4001 | 1116 | static void test_unpack2_swap(byte[] a0, short[] p2) { |
kvn@4001 | 1117 | if (p2.length*2 > a0.length) return; |
kvn@4001 | 1118 | for (int i = 0; i < p2.length; i+=1) { |
kvn@4001 | 1119 | short l = p2[i]; |
kvn@4001 | 1120 | a0[i*2+0] = (byte)(l >> 8); |
kvn@4001 | 1121 | a0[i*2+1] = (byte)(l & 0xFF); |
kvn@4001 | 1122 | } |
kvn@4001 | 1123 | } |
kvn@4001 | 1124 | |
kvn@4001 | 1125 | static void test_pack4(int[] p4, byte[] a1) { |
kvn@4001 | 1126 | if (p4.length*4 > a1.length) return; |
kvn@4001 | 1127 | for (int i = 0; i < p4.length; i+=1) { |
kvn@4001 | 1128 | int l0 = (int)a1[i*4+0]; |
kvn@4001 | 1129 | int l1 = (int)a1[i*4+1]; |
kvn@4001 | 1130 | int l2 = (int)a1[i*4+2]; |
kvn@4001 | 1131 | int l3 = (int)a1[i*4+3]; |
kvn@4001 | 1132 | p4[i] = (l0 & 0xFF) | |
kvn@4001 | 1133 | ((l1 & 0xFF) << 8) | |
kvn@4001 | 1134 | ((l2 & 0xFF) << 16) | |
kvn@4001 | 1135 | ((l3 & 0xFF) << 24); |
kvn@4001 | 1136 | } |
kvn@4001 | 1137 | } |
kvn@4001 | 1138 | static void test_unpack4(byte[] a0, int[] p4) { |
kvn@4001 | 1139 | if (p4.length*4 > a0.length) return; |
kvn@4001 | 1140 | for (int i = 0; i < p4.length; i+=1) { |
kvn@4001 | 1141 | int l = p4[i]; |
kvn@4001 | 1142 | a0[i*4+0] = (byte)(l & 0xFF); |
kvn@4001 | 1143 | a0[i*4+1] = (byte)(l >> 8); |
kvn@4001 | 1144 | a0[i*4+2] = (byte)(l >> 16); |
kvn@4001 | 1145 | a0[i*4+3] = (byte)(l >> 24); |
kvn@4001 | 1146 | } |
kvn@4001 | 1147 | } |
kvn@4001 | 1148 | static void test_pack4_swap(int[] p4, byte[] a1) { |
kvn@4001 | 1149 | if (p4.length*4 > a1.length) return; |
kvn@4001 | 1150 | for (int i = 0; i < p4.length; i+=1) { |
kvn@4001 | 1151 | int l0 = (int)a1[i*4+0]; |
kvn@4001 | 1152 | int l1 = (int)a1[i*4+1]; |
kvn@4001 | 1153 | int l2 = (int)a1[i*4+2]; |
kvn@4001 | 1154 | int l3 = (int)a1[i*4+3]; |
kvn@4001 | 1155 | p4[i] = (l3 & 0xFF) | |
kvn@4001 | 1156 | ((l2 & 0xFF) << 8) | |
kvn@4001 | 1157 | ((l1 & 0xFF) << 16) | |
kvn@4001 | 1158 | ((l0 & 0xFF) << 24); |
kvn@4001 | 1159 | } |
kvn@4001 | 1160 | } |
kvn@4001 | 1161 | static void test_unpack4_swap(byte[] a0, int[] p4) { |
kvn@4001 | 1162 | if (p4.length*4 > a0.length) return; |
kvn@4001 | 1163 | for (int i = 0; i < p4.length; i+=1) { |
kvn@4001 | 1164 | int l = p4[i]; |
kvn@4001 | 1165 | a0[i*4+0] = (byte)(l >> 24); |
kvn@4001 | 1166 | a0[i*4+1] = (byte)(l >> 16); |
kvn@4001 | 1167 | a0[i*4+2] = (byte)(l >> 8); |
kvn@4001 | 1168 | a0[i*4+3] = (byte)(l & 0xFF); |
kvn@4001 | 1169 | } |
kvn@4001 | 1170 | } |
kvn@4001 | 1171 | |
kvn@4001 | 1172 | static void test_pack8(long[] p8, byte[] a1) { |
kvn@4001 | 1173 | if (p8.length*8 > a1.length) return; |
kvn@4001 | 1174 | for (int i = 0; i < p8.length; i+=1) { |
kvn@4001 | 1175 | long l0 = (long)a1[i*8+0]; |
kvn@4001 | 1176 | long l1 = (long)a1[i*8+1]; |
kvn@4001 | 1177 | long l2 = (long)a1[i*8+2]; |
kvn@4001 | 1178 | long l3 = (long)a1[i*8+3]; |
kvn@4001 | 1179 | long l4 = (long)a1[i*8+4]; |
kvn@4001 | 1180 | long l5 = (long)a1[i*8+5]; |
kvn@4001 | 1181 | long l6 = (long)a1[i*8+6]; |
kvn@4001 | 1182 | long l7 = (long)a1[i*8+7]; |
kvn@4001 | 1183 | p8[i] = (l0 & 0xFFl) | |
kvn@4001 | 1184 | ((l1 & 0xFFl) << 8) | |
kvn@4001 | 1185 | ((l2 & 0xFFl) << 16) | |
kvn@4001 | 1186 | ((l3 & 0xFFl) << 24) | |
kvn@4001 | 1187 | ((l4 & 0xFFl) << 32) | |
kvn@4001 | 1188 | ((l5 & 0xFFl) << 40) | |
kvn@4001 | 1189 | ((l6 & 0xFFl) << 48) | |
kvn@4001 | 1190 | ((l7 & 0xFFl) << 56); |
kvn@4001 | 1191 | } |
kvn@4001 | 1192 | } |
kvn@4001 | 1193 | static void test_unpack8(byte[] a0, long[] p8) { |
kvn@4001 | 1194 | if (p8.length*8 > a0.length) return; |
kvn@4001 | 1195 | for (int i = 0; i < p8.length; i+=1) { |
kvn@4001 | 1196 | long l = p8[i]; |
kvn@4001 | 1197 | a0[i*8+0] = (byte)(l & 0xFFl); |
kvn@4001 | 1198 | a0[i*8+1] = (byte)(l >> 8); |
kvn@4001 | 1199 | a0[i*8+2] = (byte)(l >> 16); |
kvn@4001 | 1200 | a0[i*8+3] = (byte)(l >> 24); |
kvn@4001 | 1201 | a0[i*8+4] = (byte)(l >> 32); |
kvn@4001 | 1202 | a0[i*8+5] = (byte)(l >> 40); |
kvn@4001 | 1203 | a0[i*8+6] = (byte)(l >> 48); |
kvn@4001 | 1204 | a0[i*8+7] = (byte)(l >> 56); |
kvn@4001 | 1205 | } |
kvn@4001 | 1206 | } |
kvn@4001 | 1207 | static void test_pack8_swap(long[] p8, byte[] a1) { |
kvn@4001 | 1208 | if (p8.length*8 > a1.length) return; |
kvn@4001 | 1209 | for (int i = 0; i < p8.length; i+=1) { |
kvn@4001 | 1210 | long l0 = (long)a1[i*8+0]; |
kvn@4001 | 1211 | long l1 = (long)a1[i*8+1]; |
kvn@4001 | 1212 | long l2 = (long)a1[i*8+2]; |
kvn@4001 | 1213 | long l3 = (long)a1[i*8+3]; |
kvn@4001 | 1214 | long l4 = (long)a1[i*8+4]; |
kvn@4001 | 1215 | long l5 = (long)a1[i*8+5]; |
kvn@4001 | 1216 | long l6 = (long)a1[i*8+6]; |
kvn@4001 | 1217 | long l7 = (long)a1[i*8+7]; |
kvn@4001 | 1218 | p8[i] = (l7 & 0xFFl) | |
kvn@4001 | 1219 | ((l6 & 0xFFl) << 8) | |
kvn@4001 | 1220 | ((l5 & 0xFFl) << 16) | |
kvn@4001 | 1221 | ((l4 & 0xFFl) << 24) | |
kvn@4001 | 1222 | ((l3 & 0xFFl) << 32) | |
kvn@4001 | 1223 | ((l2 & 0xFFl) << 40) | |
kvn@4001 | 1224 | ((l1 & 0xFFl) << 48) | |
kvn@4001 | 1225 | ((l0 & 0xFFl) << 56); |
kvn@4001 | 1226 | } |
kvn@4001 | 1227 | } |
kvn@4001 | 1228 | static void test_unpack8_swap(byte[] a0, long[] p8) { |
kvn@4001 | 1229 | if (p8.length*8 > a0.length) return; |
kvn@4001 | 1230 | for (int i = 0; i < p8.length; i+=1) { |
kvn@4001 | 1231 | long l = p8[i]; |
kvn@4001 | 1232 | a0[i*8+0] = (byte)(l >> 56); |
kvn@4001 | 1233 | a0[i*8+1] = (byte)(l >> 48); |
kvn@4001 | 1234 | a0[i*8+2] = (byte)(l >> 40); |
kvn@4001 | 1235 | a0[i*8+3] = (byte)(l >> 32); |
kvn@4001 | 1236 | a0[i*8+4] = (byte)(l >> 24); |
kvn@4001 | 1237 | a0[i*8+5] = (byte)(l >> 16); |
kvn@4001 | 1238 | a0[i*8+6] = (byte)(l >> 8); |
kvn@4001 | 1239 | a0[i*8+7] = (byte)(l & 0xFFl); |
kvn@4001 | 1240 | } |
kvn@4001 | 1241 | } |
kvn@4001 | 1242 | |
kvn@4001 | 1243 | static int verify(String text, int i, byte elem, byte val) { |
kvn@4001 | 1244 | if (elem != val) { |
kvn@4001 | 1245 | System.err.println(text + "[" + i + "] = " + elem + " != " + val); |
kvn@4001 | 1246 | return 1; |
kvn@4001 | 1247 | } |
kvn@4001 | 1248 | return 0; |
kvn@4001 | 1249 | } |
kvn@4001 | 1250 | |
kvn@4001 | 1251 | static int verify(String text, int i, short elem, short val) { |
kvn@4001 | 1252 | if (elem != val) { |
kvn@4001 | 1253 | System.err.println(text + "[" + i + "] = " + elem + " != " + val); |
kvn@4001 | 1254 | return 1; |
kvn@4001 | 1255 | } |
kvn@4001 | 1256 | return 0; |
kvn@4001 | 1257 | } |
kvn@4001 | 1258 | |
kvn@4001 | 1259 | static int verify(String text, int i, int elem, int val) { |
kvn@4001 | 1260 | if (elem != val) { |
kvn@4001 | 1261 | System.err.println(text + "[" + i + "] = " + Integer.toHexString(elem) + " != " + Integer.toHexString(val)); |
kvn@4001 | 1262 | return 1; |
kvn@4001 | 1263 | } |
kvn@4001 | 1264 | return 0; |
kvn@4001 | 1265 | } |
kvn@4001 | 1266 | |
kvn@4001 | 1267 | static int verify(String text, int i, long elem, long val) { |
kvn@4001 | 1268 | if (elem != val) { |
kvn@4001 | 1269 | System.err.println(text + "[" + i + "] = " + Long.toHexString(elem) + " != " + Long.toHexString(val)); |
kvn@4001 | 1270 | return 1; |
kvn@4001 | 1271 | } |
kvn@4001 | 1272 | return 0; |
kvn@4001 | 1273 | } |
kvn@4001 | 1274 | } |