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