test/compiler/6636138/Test2.java

changeset 0
f90c822e73f8
child 6876
710a3c8b516e
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/test/compiler/6636138/Test2.java	Wed Apr 27 01:25:04 2016 +0800
     1.3 @@ -0,0 +1,70 @@
     1.4 +/*
     1.5 + * Copyright (c) 2009, 2013, Oracle and/or its affiliates. All rights reserved.
     1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 + *
     1.8 + * This code is free software; you can redistribute it and/or modify it
     1.9 + * under the terms of the GNU General Public License version 2 only, as
    1.10 + * published by the Free Software Foundation.
    1.11 + *
    1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.14 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.15 + * version 2 for more details (a copy is included in the LICENSE file that
    1.16 + * accompanied this code).
    1.17 + *
    1.18 + * You should have received a copy of the GNU General Public License version
    1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.21 + *
    1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    1.23 + * or visit www.oracle.com if you need additional information or have any
    1.24 + * questions.
    1.25 + */
    1.26 +
    1.27 +/**
    1.28 + * @test
    1.29 + * @bug 6636138
    1.30 + * @summary SuperWord::co_locate_pack(Node_List* p) generates memory graph that leads to memory order violation.
    1.31 + *
    1.32 + * @run main/othervm -Xbatch -XX:CompileOnly=Test2.shift Test2
    1.33 + */
    1.34 +
    1.35 +public class Test2 {
    1.36 +
    1.37 +    public static void init(int src[]) {
    1.38 +        // Initialize the array
    1.39 +        for (int i = 0; i < src.length; i++)
    1.40 +            src[i] = i;
    1.41 +    }
    1.42 +
    1.43 +   public static void shift(int src[]) {
    1.44 +       //left-shift the array
    1.45 +       for (int i = src.length-1; i > 0; i--){
    1.46 +           int tmp  = src[i];
    1.47 +           src[i]   = src[i-1];
    1.48 +           src[i-1] = tmp;
    1.49 +       }
    1.50 +    }
    1.51 +
    1.52 +    public static void verify(int src[]) {
    1.53 +        for (int i = 0; i < src.length; i++){
    1.54 +            int value = (i-1 + src.length)%src.length; // correct value after shifting
    1.55 +                if (src[i] != value) {
    1.56 +                    System.out.println("Error: src["+i+"] should be "+ value + " instead of " + src[i]);
    1.57 +                    System.exit(97);
    1.58 +                }
    1.59 +        }
    1.60 +    }
    1.61 +
    1.62 +    public static void test() {
    1.63 +        int[] src = new int[10];
    1.64 +        init(src);
    1.65 +        shift(src);
    1.66 +        verify(src);
    1.67 +    }
    1.68 +
    1.69 +    public static void main(String[] args) {
    1.70 +        for (int i=0; i< 2000; i++)
    1.71 +            test();
    1.72 +    }
    1.73 +}

mercurial