--- old/test/compiler/codegen/7119644/TestBooleanVect.java 2016-07-06 19:20:28.191393218 +0300 +++ /dev/null 2016-06-14 14:43:27.230512026 +0300 @@ -1,952 +0,0 @@ -/* - * 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 7119644 - * @summary Increase superword's vector size up to 256 bits - * - * @run main/othervm/timeout=300 -Xbatch -XX:+IgnoreUnrecognizedVMOptions -XX:-TieredCompilation -XX:-OptimizeFill TestBooleanVect - */ - -public class TestBooleanVect { - private static final int ARRLEN = 997; - private static final int ITERS = 11000; - private static final int OFFSET = 3; - private static final int SCALE = 2; - private static final int ALIGN_OFF = 8; - private static final int UNALIGN_OFF = 5; - - public static void main(String args[]) { - System.out.println("Testing Boolean vectors"); - int errn = test(); - if (errn > 0) { - System.err.println("FAILED: " + errn + " errors"); - System.exit(97); - } - System.out.println("PASSED"); - } - - static int test() { - boolean[] a1 = new boolean[ARRLEN]; - boolean[] a2 = new boolean[ARRLEN]; - System.out.println("Warmup"); - for (int i=0; i 0); - } - for (int i=ALIGN_OFF; i 0); - errn += verify("test_cp_alndst_overlap: a1", i, a1[i], v); - } - for (int i=0; i 0); - errn += verify("test_cp_alnsrc_overlap: a1", i, a1[i], v); - } - for (int i=0; i 0); - } - for (int i=UNALIGN_OFF; i 0); - errn += verify("test_cp_unalndst_overlap: a1", i, a1[i], v); - } - for (int i=0; i 0); - errn += verify("test_cp_unalnsrc_overlap: a1", i, a1[i], v); - } - for (int i=0; i 0) - return errn; - - System.out.println("Time"); - long start, end; - start = System.currentTimeMillis(); - for (int i=0; i= 0; i-=1) { - a[i] = false; - } - } - static void test_vi_neg(boolean[] a, boolean b) { - for (int i = a.length-1; i >= 0; i-=1) { - a[i] = b; - } - } - static void test_cp_neg(boolean[] a, boolean[] b) { - for (int i = a.length-1; i >= 0; i-=1) { - a[i] = b[i]; - } - } - static void test_2ci_neg(boolean[] a, boolean[] b) { - for (int i = a.length-1; i >= 0; i-=1) { - a[i] = false; - b[i] = false; - } - } - static void test_2vi_neg(boolean[] a, boolean[] b, boolean c, boolean d) { - for (int i = a.length-1; i >= 0; i-=1) { - a[i] = c; - b[i] = d; - } - } - static void test_ci_oppos(boolean[] a) { - int limit = a.length-1; - for (int i = 0; i < a.length; i+=1) { - a[limit-i] = false; - } - } - static void test_vi_oppos(boolean[] a, boolean b) { - int limit = a.length-1; - for (int i = limit; i >= 0; i-=1) { - a[limit-i] = b; - } - } - static void test_cp_oppos(boolean[] a, boolean[] b) { - int limit = a.length-1; - for (int i = 0; i < a.length; i+=1) { - a[i] = b[limit-i]; - } - } - static void test_2ci_oppos(boolean[] a, boolean[] b) { - int limit = a.length-1; - for (int i = 0; i < a.length; i+=1) { - a[limit-i] = false; - b[i] = false; - } - } - static void test_2vi_oppos(boolean[] a, boolean[] b, boolean c, boolean d) { - int limit = a.length-1; - for (int i = limit; i >= 0; i-=1) { - a[i] = c; - b[limit-i] = d; - } - } - static void test_ci_off(boolean[] a) { - for (int i = 0; i < a.length-OFFSET; i+=1) { - a[i+OFFSET] = false; - } - } - static void test_vi_off(boolean[] a, boolean b) { - for (int i = 0; i < a.length-OFFSET; i+=1) { - a[i+OFFSET] = b; - } - } - static void test_cp_off(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-OFFSET; i+=1) { - a[i+OFFSET] = b[i+OFFSET]; - } - } - static void test_2ci_off(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-OFFSET; i+=1) { - a[i+OFFSET] = false; - b[i+OFFSET] = false; - } - } - static void test_2vi_off(boolean[] a, boolean[] b, boolean c, boolean d) { - for (int i = 0; i < a.length-OFFSET; i+=1) { - a[i+OFFSET] = c; - b[i+OFFSET] = d; - } - } - static void test_ci_inv(boolean[] a, int k) { - for (int i = 0; i < a.length-k; i+=1) { - a[i+k] = false; - } - } - static void test_vi_inv(boolean[] a, boolean b, int k) { - for (int i = 0; i < a.length-k; i+=1) { - a[i+k] = b; - } - } - static void test_cp_inv(boolean[] a, boolean[] b, int k) { - for (int i = 0; i < a.length-k; i+=1) { - a[i+k] = b[i+k]; - } - } - static void test_2ci_inv(boolean[] a, boolean[] b, int k) { - for (int i = 0; i < a.length-k; i+=1) { - a[i+k] = false; - b[i+k] = false; - } - } - static void test_2vi_inv(boolean[] a, boolean[] b, boolean c, boolean d, int k) { - for (int i = 0; i < a.length-k; i+=1) { - a[i+k] = c; - b[i+k] = d; - } - } - static void test_ci_scl(boolean[] a) { - for (int i = 0; i*SCALE < a.length; i+=1) { - a[i*SCALE] = false; - } - } - static void test_vi_scl(boolean[] a, boolean b) { - for (int i = 0; i*SCALE < a.length; i+=1) { - a[i*SCALE] = b; - } - } - static void test_cp_scl(boolean[] a, boolean[] b) { - for (int i = 0; i*SCALE < a.length; i+=1) { - a[i*SCALE] = b[i*SCALE]; - } - } - static void test_2ci_scl(boolean[] a, boolean[] b) { - for (int i = 0; i*SCALE < a.length; i+=1) { - a[i*SCALE] = false; - b[i*SCALE] = false; - } - } - static void test_2vi_scl(boolean[] a, boolean[] b, boolean c, boolean d) { - for (int i = 0; i*SCALE < a.length; i+=1) { - a[i*SCALE] = c; - b[i*SCALE] = d; - } - } - static void test_cp_alndst(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { - a[i+ALIGN_OFF] = b[i]; - } - } - static void test_cp_alnsrc(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { - a[i] = b[i+ALIGN_OFF]; - } - } - static void test_2ci_aln(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { - a[i+ALIGN_OFF] = false; - b[i] = false; - } - } - static void test_2vi_aln(boolean[] a, boolean[] b, boolean c, boolean d) { - for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { - a[i] = c; - b[i+ALIGN_OFF] = d; - } - } - static void test_cp_unalndst(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { - a[i+UNALIGN_OFF] = b[i]; - } - } - static void test_cp_unalnsrc(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { - a[i] = b[i+UNALIGN_OFF]; - } - } - static void test_2ci_unaln(boolean[] a, boolean[] b) { - for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { - a[i+UNALIGN_OFF] = false; - b[i] = false; - } - } - static void test_2vi_unaln(boolean[] a, boolean[] b, boolean c, boolean d) { - for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { - a[i] = c; - b[i+UNALIGN_OFF] = d; - } - } - - static int verify(String text, int i, boolean elem, boolean val) { - if (elem != val) { - System.err.println(text + "[" + i + "] = " + elem + " != " + val); - return 1; - } - return 0; - } -} --- /dev/null 2016-06-14 14:43:27.230512026 +0300 +++ new/test/compiler/codegen/TestBooleanVect.java 2016-07-06 19:20:28.023393213 +0300 @@ -0,0 +1,956 @@ +/* + * 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 7119644 + * @summary Increase superword's vector size up to 256 bits + * + * @run main/othervm/timeout=300 -Xbatch -XX:+IgnoreUnrecognizedVMOptions + * -XX:-TieredCompilation -XX:-OptimizeFill + * compiler.codegen.TestBooleanVect + */ + +package compiler.codegen; + +public class TestBooleanVect { + private static final int ARRLEN = 997; + private static final int ITERS = 11000; + private static final int OFFSET = 3; + private static final int SCALE = 2; + private static final int ALIGN_OFF = 8; + private static final int UNALIGN_OFF = 5; + + public static void main(String args[]) { + System.out.println("Testing Boolean vectors"); + int errn = test(); + if (errn > 0) { + System.err.println("FAILED: " + errn + " errors"); + System.exit(97); + } + System.out.println("PASSED"); + } + + static int test() { + boolean[] a1 = new boolean[ARRLEN]; + boolean[] a2 = new boolean[ARRLEN]; + System.out.println("Warmup"); + for (int i=0; i 0); + } + for (int i=ALIGN_OFF; i 0); + errn += verify("test_cp_alndst_overlap: a1", i, a1[i], v); + } + for (int i=0; i 0); + errn += verify("test_cp_alnsrc_overlap: a1", i, a1[i], v); + } + for (int i=0; i 0); + } + for (int i=UNALIGN_OFF; i 0); + errn += verify("test_cp_unalndst_overlap: a1", i, a1[i], v); + } + for (int i=0; i 0); + errn += verify("test_cp_unalnsrc_overlap: a1", i, a1[i], v); + } + for (int i=0; i 0) + return errn; + + System.out.println("Time"); + long start, end; + start = System.currentTimeMillis(); + for (int i=0; i= 0; i-=1) { + a[i] = false; + } + } + static void test_vi_neg(boolean[] a, boolean b) { + for (int i = a.length-1; i >= 0; i-=1) { + a[i] = b; + } + } + static void test_cp_neg(boolean[] a, boolean[] b) { + for (int i = a.length-1; i >= 0; i-=1) { + a[i] = b[i]; + } + } + static void test_2ci_neg(boolean[] a, boolean[] b) { + for (int i = a.length-1; i >= 0; i-=1) { + a[i] = false; + b[i] = false; + } + } + static void test_2vi_neg(boolean[] a, boolean[] b, boolean c, boolean d) { + for (int i = a.length-1; i >= 0; i-=1) { + a[i] = c; + b[i] = d; + } + } + static void test_ci_oppos(boolean[] a) { + int limit = a.length-1; + for (int i = 0; i < a.length; i+=1) { + a[limit-i] = false; + } + } + static void test_vi_oppos(boolean[] a, boolean b) { + int limit = a.length-1; + for (int i = limit; i >= 0; i-=1) { + a[limit-i] = b; + } + } + static void test_cp_oppos(boolean[] a, boolean[] b) { + int limit = a.length-1; + for (int i = 0; i < a.length; i+=1) { + a[i] = b[limit-i]; + } + } + static void test_2ci_oppos(boolean[] a, boolean[] b) { + int limit = a.length-1; + for (int i = 0; i < a.length; i+=1) { + a[limit-i] = false; + b[i] = false; + } + } + static void test_2vi_oppos(boolean[] a, boolean[] b, boolean c, boolean d) { + int limit = a.length-1; + for (int i = limit; i >= 0; i-=1) { + a[i] = c; + b[limit-i] = d; + } + } + static void test_ci_off(boolean[] a) { + for (int i = 0; i < a.length-OFFSET; i+=1) { + a[i+OFFSET] = false; + } + } + static void test_vi_off(boolean[] a, boolean b) { + for (int i = 0; i < a.length-OFFSET; i+=1) { + a[i+OFFSET] = b; + } + } + static void test_cp_off(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-OFFSET; i+=1) { + a[i+OFFSET] = b[i+OFFSET]; + } + } + static void test_2ci_off(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-OFFSET; i+=1) { + a[i+OFFSET] = false; + b[i+OFFSET] = false; + } + } + static void test_2vi_off(boolean[] a, boolean[] b, boolean c, boolean d) { + for (int i = 0; i < a.length-OFFSET; i+=1) { + a[i+OFFSET] = c; + b[i+OFFSET] = d; + } + } + static void test_ci_inv(boolean[] a, int k) { + for (int i = 0; i < a.length-k; i+=1) { + a[i+k] = false; + } + } + static void test_vi_inv(boolean[] a, boolean b, int k) { + for (int i = 0; i < a.length-k; i+=1) { + a[i+k] = b; + } + } + static void test_cp_inv(boolean[] a, boolean[] b, int k) { + for (int i = 0; i < a.length-k; i+=1) { + a[i+k] = b[i+k]; + } + } + static void test_2ci_inv(boolean[] a, boolean[] b, int k) { + for (int i = 0; i < a.length-k; i+=1) { + a[i+k] = false; + b[i+k] = false; + } + } + static void test_2vi_inv(boolean[] a, boolean[] b, boolean c, boolean d, int k) { + for (int i = 0; i < a.length-k; i+=1) { + a[i+k] = c; + b[i+k] = d; + } + } + static void test_ci_scl(boolean[] a) { + for (int i = 0; i*SCALE < a.length; i+=1) { + a[i*SCALE] = false; + } + } + static void test_vi_scl(boolean[] a, boolean b) { + for (int i = 0; i*SCALE < a.length; i+=1) { + a[i*SCALE] = b; + } + } + static void test_cp_scl(boolean[] a, boolean[] b) { + for (int i = 0; i*SCALE < a.length; i+=1) { + a[i*SCALE] = b[i*SCALE]; + } + } + static void test_2ci_scl(boolean[] a, boolean[] b) { + for (int i = 0; i*SCALE < a.length; i+=1) { + a[i*SCALE] = false; + b[i*SCALE] = false; + } + } + static void test_2vi_scl(boolean[] a, boolean[] b, boolean c, boolean d) { + for (int i = 0; i*SCALE < a.length; i+=1) { + a[i*SCALE] = c; + b[i*SCALE] = d; + } + } + static void test_cp_alndst(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { + a[i+ALIGN_OFF] = b[i]; + } + } + static void test_cp_alnsrc(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { + a[i] = b[i+ALIGN_OFF]; + } + } + static void test_2ci_aln(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { + a[i+ALIGN_OFF] = false; + b[i] = false; + } + } + static void test_2vi_aln(boolean[] a, boolean[] b, boolean c, boolean d) { + for (int i = 0; i < a.length-ALIGN_OFF; i+=1) { + a[i] = c; + b[i+ALIGN_OFF] = d; + } + } + static void test_cp_unalndst(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { + a[i+UNALIGN_OFF] = b[i]; + } + } + static void test_cp_unalnsrc(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { + a[i] = b[i+UNALIGN_OFF]; + } + } + static void test_2ci_unaln(boolean[] a, boolean[] b) { + for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { + a[i+UNALIGN_OFF] = false; + b[i] = false; + } + } + static void test_2vi_unaln(boolean[] a, boolean[] b, boolean c, boolean d) { + for (int i = 0; i < a.length-UNALIGN_OFF; i+=1) { + a[i] = c; + b[i+UNALIGN_OFF] = d; + } + } + + static int verify(String text, int i, boolean elem, boolean val) { + if (elem != val) { + System.err.println(text + "[" + i + "] = " + elem + " != " + val); + return 1; + } + return 0; + } +}