1 /* 2 * Copyright 2009 Sun Microsystems, Inc. All Rights Reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 20 * CA 95054 USA or visit www.sun.com if you need additional information or 21 * have any questions. 22 */ 23 24 /** 25 * @test 26 * @bug 6636138 27 * @summary SuperWord::co_locate_pack(Node_List* p) generates memory graph that leads to memory order violation. 28 * 29 * @run main/othervm -server -Xbatch -XX:CompileOnly=Test2.shift Test2 30 */ 31 32 class Test2 { 33 34 public static void init(int src[]) { 35 // Initialize the array 36 for (int i = 0; i < src.length; i++) 37 src[i] = i; 38 } 39 40 public static void shift(int src[]) { 41 //left-shift the array 42 for (int i = src.length-1; i > 0; i--){ 43 int tmp = src[i]; 44 src[i] = src[i-1]; 45 src[i-1] = tmp; 46 } 47 } 48 49 public static void verify(int src[]) { 50 for (int i = 0; i < src.length; i++){ 51 int value = (i-1 + src.length)%src.length; // correct value after shifting 52 if (src[i] != value) { 53 System.out.println("Error: src["+i+"] should be "+ value + " instead of " + src[i]); 54 System.exit(-1); 55 } 56 } 57 } 58 59 public static void test() { 60 int[] src = new int[10]; 61 init(src); 62 shift(src); 63 verify(src); 64 } 65 66 public static void main(String[] args) { 67 for (int i=0; i< 2000; i++) 68 test(); 69 } 70 }