hotspot/test/compiler/6636138/Test2.java
author cfang
Mon, 31 Aug 2009 08:31:45 -0700
changeset 3799 6eddf8400cbc
parent 2864 1262819e8925
child 5547 f4b087cbb361
permissions -rw-r--r--
6876276: assert(!is_visited,"visit only once") Summary: schedule the superword loads based on dependence constraints Reviewed-by: kvn, never

/*
 * Copyright 2009 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
 * CA 95054 USA or visit www.sun.com if you need additional information or
 * have any questions.
 */

/**
 * @test
 * @bug 6636138
 * @summary SuperWord::co_locate_pack(Node_List* p) generates memory graph that leads to memory order violation.
 *
 * @run main/othervm -server -Xbatch -XX:CompileOnly=Test2.shift Test2
 */

public class Test2 {

    public static void init(int src[]) {
        // Initialize the array
        for (int i = 0; i < src.length; i++)
            src[i] = i;
    }

   public static void shift(int src[]) {
       //left-shift the array
       for (int i = src.length-1; i > 0; i--){
           int tmp  = src[i];
           src[i]   = src[i-1];
           src[i-1] = tmp;
       }
    }

    public static void verify(int src[]) {
        for (int i = 0; i < src.length; i++){
            int value = (i-1 + src.length)%src.length; // correct value after shifting
                if (src[i] != value) {
                    System.out.println("Error: src["+i+"] should be "+ value + " instead of " + src[i]);
                    System.exit(97);
                }
        }
    }

    public static void test() {
        int[] src = new int[10];
        init(src);
        shift(src);
        verify(src);
    }

    public static void main(String[] args) {
        for (int i=0; i< 2000; i++)
            test();
    }
}