Mercurial > jdk8-mips64-public > hotspot / file diff

     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/test/compiler/6636138/Test1.java	Tue Mar 24 12:19:47 2009 -0700
     1.3 @@ -0,0 +1,67 @@
     1.4 +/*
     1.5 + * Copyright 2009 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
    1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
    1.24 + * have any 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 -server -Xbatch -XX:CompileOnly=Test1.init -XX:+UseSuperword Test1
    1.33 + */
    1.34 +
    1.35 +class Test1 {
    1.36 +
    1.37 +    public static void init(int src[], int [] dst, int[] ref) {
    1.38 +        // initialize the arrays
    1.39 +        for (int i =0; i<src.length; i++) {
    1.40 +            src[i] =  i;
    1.41 +            dst[i] = 2;      // yes, dst[i] needed(otherwise src[i] will be replaced with i)
    1.42 +            ref[i] = src[i]; // src[i] depends on the store src[i]
    1.43 +        }
    1.44 +    }
    1.45 +
    1.46 +    public static void verify(int src[], int[] ref) {
    1.47 +        // check whether src and ref are equal
    1.48 +        for (int i = 0; i < src.length; i++) {
    1.49 +            if (src[i] != ref[i]) {
    1.50 +                System.out.println("Error: src and ref don't match at " + i);
    1.51 +                System.exit(-1);
    1.52 +            }
    1.53 +        }
    1.54 +    }
    1.55 +
    1.56 +    public static void test() {
    1.57 +        int[] src = new int[34];
    1.58 +        int[] dst = new int[34];
    1.59 +        int[] ref = new int[34];
    1.60 +
    1.61 +        init(src, dst, ref);
    1.62 +        verify(src, ref);
    1.63 +    }
    1.64 +
    1.65 +    public static void main(String[] args) {
    1.66 +        for (int i=0; i< 2000; i++) {
    1.67 +            test();
    1.68 +        }
    1.69 +    }
    1.70 +}