kvn@4001: /* kvn@4001: * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. kvn@4001: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. kvn@4001: * kvn@4001: * This code is free software; you can redistribute it and/or modify it kvn@4001: * under the terms of the GNU General Public License version 2 only, as kvn@4001: * published by the Free Software Foundation. kvn@4001: * kvn@4001: * This code is distributed in the hope that it will be useful, but WITHOUT kvn@4001: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or kvn@4001: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License kvn@4001: * version 2 for more details (a copy is included in the LICENSE file that kvn@4001: * accompanied this code). kvn@4001: * kvn@4001: * You should have received a copy of the GNU General Public License version kvn@4001: * 2 along with this work; if not, write to the Free Software Foundation, kvn@4001: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. kvn@4001: * kvn@4001: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA kvn@4001: * or visit www.oracle.com if you need additional information or have any kvn@4001: * questions. kvn@4001: * kvn@4001: */ kvn@4001: kvn@4001: /** kvn@4001: * @test kvn@4001: * @bug 6340864 kvn@4001: * @summary Implement vectorization optimizations in hotspot-server kvn@4001: * kvn@4001: * @run main/othervm/timeout=400 -Xbatch -Xmx64m TestShortVect kvn@4001: */ kvn@4001: kvn@4001: public class TestShortVect { kvn@4001: private static final int ARRLEN = 997; kvn@4001: private static final int ITERS = 11000; kvn@4001: private static final int ADD_INIT = Short.MAX_VALUE-500; kvn@4001: private static final int BIT_MASK = 0xB731; kvn@4001: private static final int VALUE = 7; kvn@4001: private static final int SHIFT = 16; kvn@4001: kvn@4001: public static void main(String args[]) { kvn@4001: System.out.println("Testing Short vectors"); kvn@4001: int errn = test(); kvn@4001: if (errn > 0) { kvn@4001: System.err.println("FAILED: " + errn + " errors"); kvn@4001: System.exit(97); kvn@4001: } kvn@4001: System.out.println("PASSED"); kvn@4001: } kvn@4001: kvn@4001: static int test() { kvn@4001: short[] a0 = new short[ARRLEN]; kvn@4001: short[] a1 = new short[ARRLEN]; kvn@4001: short[] a2 = new short[ARRLEN]; kvn@4001: short[] a3 = new short[ARRLEN]; kvn@4001: short[] a4 = new short[ARRLEN]; kvn@4001: int[] p2 = new int[ARRLEN/2]; kvn@4001: long[] p4 = new long[ARRLEN/4]; kvn@4001: // Initialize kvn@4001: int gold_sum = 0; kvn@4001: for (int i=0; i>>VALUE)); kvn@4001: } kvn@4001: test_srlv(a0, a1, VALUE); kvn@4001: for (int i=0; i>>VALUE)); kvn@4001: } kvn@4001: kvn@4001: test_srac(a0, a1); kvn@4001: for (int i=0; i>VALUE)); kvn@4001: } kvn@4001: test_srav(a0, a1, VALUE); kvn@4001: for (int i=0; i>VALUE)); kvn@4001: } kvn@4001: kvn@4001: test_sllc_n(a0, a1); kvn@4001: for (int i=0; i>>(-VALUE))); kvn@4001: } kvn@4001: test_srlv(a0, a1, -VALUE); kvn@4001: for (int i=0; i>>(-VALUE))); kvn@4001: } kvn@4001: kvn@4001: test_srac_n(a0, a1); kvn@4001: for (int i=0; i>(-VALUE))); kvn@4001: } kvn@4001: test_srav(a0, a1, -VALUE); kvn@4001: for (int i=0; i>(-VALUE))); kvn@4001: } kvn@4001: kvn@4001: test_sllc_o(a0, a1); kvn@4001: for (int i=0; i>>SHIFT)); kvn@4001: } kvn@4001: test_srlv(a0, a1, SHIFT); kvn@4001: for (int i=0; i>>SHIFT)); kvn@4001: } kvn@4001: kvn@4001: test_srac_o(a0, a1); kvn@4001: for (int i=0; i>SHIFT)); kvn@4001: } kvn@4001: test_srav(a0, a1, SHIFT); kvn@4001: for (int i=0; i>SHIFT)); kvn@4001: } kvn@4001: kvn@4001: test_sllc_on(a0, a1); kvn@4001: for (int i=0; i>>(-SHIFT))); kvn@4001: } kvn@4001: test_srlv(a0, a1, -SHIFT); kvn@4001: for (int i=0; i>>(-SHIFT))); kvn@4001: } kvn@4001: kvn@4001: test_srac_on(a0, a1); kvn@4001: for (int i=0; i>(-SHIFT))); kvn@4001: } kvn@4001: test_srav(a0, a1, -SHIFT); kvn@4001: for (int i=0; i>(-SHIFT))); kvn@4001: } kvn@4001: kvn@4204: test_sllc_add(a0, a1); kvn@4204: for (int i=0; i>>VALUE)); kvn@4204: } kvn@4204: test_srlv_add(a0, a1, ADD_INIT); kvn@4204: for (int i=0; i>>VALUE)); kvn@4204: } kvn@4204: kvn@4204: test_srac_add(a0, a1); kvn@4204: for (int i=0; i>VALUE)); kvn@4204: } kvn@4204: test_srav_add(a0, a1, ADD_INIT); kvn@4204: for (int i=0; i>VALUE)); kvn@4204: } kvn@4204: kvn@4204: test_sllc_and(a0, a1); kvn@4204: for (int i=0; i>>VALUE)); kvn@4204: } kvn@4204: test_srlv_and(a0, a1, BIT_MASK); kvn@4204: for (int i=0; i>>VALUE)); kvn@4204: } kvn@4204: kvn@4204: test_srac_and(a0, a1); kvn@4204: for (int i=0; i>VALUE)); kvn@4204: } kvn@4204: test_srav_and(a0, a1, BIT_MASK); kvn@4204: for (int i=0; i>VALUE)); kvn@4204: } kvn@4204: kvn@4001: test_pack2(p2, a1); kvn@4001: for (int i=0; i 0) kvn@4001: return errn; kvn@4001: kvn@4001: System.out.println("Time"); kvn@4001: long start, end; kvn@4001: kvn@4001: start = System.currentTimeMillis(); kvn@4001: for (int i=0; i>>VALUE); kvn@4001: } kvn@4001: } kvn@4001: static void test_srlc_n(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>>(-VALUE)); kvn@4001: } kvn@4001: } kvn@4001: static void test_srlc_o(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>>SHIFT); kvn@4001: } kvn@4001: } kvn@4001: static void test_srlc_on(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>>(-SHIFT)); kvn@4001: } kvn@4001: } kvn@4001: static void test_srlv(short[] a0, short[] a1, int b) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>>b); kvn@4001: } kvn@4001: } kvn@4204: static void test_srlc_add(short[] a0, short[] a1) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] + ADD_INIT)>>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srlv_add(short[] a0, short[] a1, int b) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] + b)>>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srlc_and(short[] a0, short[] a1) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] & BIT_MASK)>>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srlv_and(short[] a0, short[] a1, int b) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] & b)>>>VALUE); kvn@4204: } kvn@4204: } kvn@4001: kvn@4001: static void test_srac(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>VALUE); kvn@4001: } kvn@4001: } kvn@4001: static void test_srac_n(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>(-VALUE)); kvn@4001: } kvn@4001: } kvn@4001: static void test_srac_o(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>SHIFT); kvn@4001: } kvn@4001: } kvn@4001: static void test_srac_on(short[] a0, short[] a1) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>(-SHIFT)); kvn@4001: } kvn@4001: } kvn@4001: static void test_srav(short[] a0, short[] a1, int b) { kvn@4001: for (int i = 0; i < a0.length; i+=1) { kvn@4001: a0[i] = (short)(a1[i]>>b); kvn@4001: } kvn@4001: } kvn@4204: static void test_srac_add(short[] a0, short[] a1) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] + ADD_INIT)>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srav_add(short[] a0, short[] a1, int b) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] + b)>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srac_and(short[] a0, short[] a1) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] & BIT_MASK)>>VALUE); kvn@4204: } kvn@4204: } kvn@4204: static void test_srav_and(short[] a0, short[] a1, int b) { kvn@4204: for (int i = 0; i < a0.length; i+=1) { kvn@4204: a0[i] = (short)((a1[i] & b)>>VALUE); kvn@4204: } kvn@4204: } kvn@4001: kvn@4001: static void test_pack2(int[] p2, short[] a1) { kvn@4001: if (p2.length*2 > a1.length) return; kvn@4001: for (int i = 0; i < p2.length; i+=1) { kvn@4001: int l0 = (int)a1[i*2+0]; kvn@4001: int l1 = (int)a1[i*2+1]; kvn@4001: p2[i] = (l1 << 16) | (l0 & 0xFFFF); kvn@4001: } kvn@4001: } kvn@4001: static void test_unpack2(short[] a0, int[] p2) { kvn@4001: if (p2.length*2 > a0.length) return; kvn@4001: for (int i = 0; i < p2.length; i+=1) { kvn@4001: int l = p2[i]; kvn@4001: a0[i*2+0] = (short)(l & 0xFFFF); kvn@4001: a0[i*2+1] = (short)(l >> 16); kvn@4001: } kvn@4001: } kvn@4001: static void test_pack2_swap(int[] p2, short[] a1) { kvn@4001: if (p2.length*2 > a1.length) return; kvn@4001: for (int i = 0; i < p2.length; i+=1) { kvn@4001: int l0 = (int)a1[i*2+0]; kvn@4001: int l1 = (int)a1[i*2+1]; kvn@4001: p2[i] = (l0 << 16) | (l1 & 0xFFFF); kvn@4001: } kvn@4001: } kvn@4001: static void test_unpack2_swap(short[] a0, int[] p2) { kvn@4001: if (p2.length*2 > a0.length) return; kvn@4001: for (int i = 0; i < p2.length; i+=1) { kvn@4001: int l = p2[i]; kvn@4001: a0[i*2+0] = (short)(l >> 16); kvn@4001: a0[i*2+1] = (short)(l & 0xFFFF); kvn@4001: } kvn@4001: } kvn@4001: kvn@4001: static void test_pack4(long[] p4, short[] a1) { kvn@4001: if (p4.length*4 > a1.length) return; kvn@4001: for (int i = 0; i < p4.length; i+=1) { kvn@4001: long l0 = (long)a1[i*4+0]; kvn@4001: long l1 = (long)a1[i*4+1]; kvn@4001: long l2 = (long)a1[i*4+2]; kvn@4001: long l3 = (long)a1[i*4+3]; kvn@4001: p4[i] = (l0 & 0xFFFFl) | kvn@4001: ((l1 & 0xFFFFl) << 16) | kvn@4001: ((l2 & 0xFFFFl) << 32) | kvn@4001: ((l3 & 0xFFFFl) << 48); kvn@4001: } kvn@4001: } kvn@4001: static void test_unpack4(short[] a0, long[] p4) { kvn@4001: if (p4.length*4 > a0.length) return; kvn@4001: for (int i = 0; i < p4.length; i+=1) { kvn@4001: long l = p4[i]; kvn@4001: a0[i*4+0] = (short)(l & 0xFFFFl); kvn@4001: a0[i*4+1] = (short)(l >> 16); kvn@4001: a0[i*4+2] = (short)(l >> 32); kvn@4001: a0[i*4+3] = (short)(l >> 48); kvn@4001: } kvn@4001: } kvn@4001: static void test_pack4_swap(long[] p4, short[] a1) { kvn@4001: if (p4.length*4 > a1.length) return; kvn@4001: for (int i = 0; i < p4.length; i+=1) { kvn@4001: long l0 = (long)a1[i*4+0]; kvn@4001: long l1 = (long)a1[i*4+1]; kvn@4001: long l2 = (long)a1[i*4+2]; kvn@4001: long l3 = (long)a1[i*4+3]; kvn@4001: p4[i] = (l3 & 0xFFFFl) | kvn@4001: ((l2 & 0xFFFFl) << 16) | kvn@4001: ((l1 & 0xFFFFl) << 32) | kvn@4001: ((l0 & 0xFFFFl) << 48); kvn@4001: } kvn@4001: } kvn@4001: static void test_unpack4_swap(short[] a0, long[] p4) { kvn@4001: if (p4.length*4 > a0.length) return; kvn@4001: for (int i = 0; i < p4.length; i+=1) { kvn@4001: long l = p4[i]; kvn@4001: a0[i*4+0] = (short)(l >> 48); kvn@4001: a0[i*4+1] = (short)(l >> 32); kvn@4001: a0[i*4+2] = (short)(l >> 16); kvn@4001: a0[i*4+3] = (short)(l & 0xFFFFl); kvn@4001: } kvn@4001: } kvn@4001: kvn@4001: static int verify(String text, int i, short elem, short val) { kvn@4001: if (elem != val) { kvn@4001: System.err.println(text + "[" + i + "] = " + elem + " != " + val); kvn@4001: return 1; kvn@4001: } kvn@4001: return 0; kvn@4001: } kvn@4001: kvn@4001: static int verify(String text, int i, int elem, int val) { kvn@4001: if (elem != val) { kvn@4001: System.err.println(text + "[" + i + "] = " + Integer.toHexString(elem) + " != " + Integer.toHexString(val)); kvn@4001: return 1; kvn@4001: } kvn@4001: return 0; kvn@4001: } kvn@4001: kvn@4001: static int verify(String text, int i, long elem, long val) { kvn@4001: if (elem != val) { kvn@4001: System.err.println(text + "[" + i + "] = " + Long.toHexString(elem) + " != " + Long.toHexString(val)); kvn@4001: return 1; kvn@4001: } kvn@4001: return 0; kvn@4001: } kvn@4001: }