Mercurial > hg > truffle
comparison test/compiler/6636138/Test1.java @ 667:78af5ae8e731
6636138: UseSuperWord enabled failure
Summary: Fixed SuperWord scheduling of memory operations.
Reviewed-by: kvn, never
author | cfang |
---|---|
date | Tue, 24 Mar 2009 12:19:47 -0700 |
parents | |
children | 9610b2a8ab4e |
comparison
equal
deleted
inserted
replaced
666:ebebd376f657 | 667:78af5ae8e731 |
---|---|
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=Test1.init -XX:+UseSuperword Test1 | |
30 */ | |
31 | |
32 class Test1 { | |
33 | |
34 public static void init(int src[], int [] dst, int[] ref) { | |
35 // initialize the arrays | |
36 for (int i =0; i<src.length; i++) { | |
37 src[i] = i; | |
38 dst[i] = 2; // yes, dst[i] needed(otherwise src[i] will be replaced with i) | |
39 ref[i] = src[i]; // src[i] depends on the store src[i] | |
40 } | |
41 } | |
42 | |
43 public static void verify(int src[], int[] ref) { | |
44 // check whether src and ref are equal | |
45 for (int i = 0; i < src.length; i++) { | |
46 if (src[i] != ref[i]) { | |
47 System.out.println("Error: src and ref don't match at " + i); | |
48 System.exit(-1); | |
49 } | |
50 } | |
51 } | |
52 | |
53 public static void test() { | |
54 int[] src = new int[34]; | |
55 int[] dst = new int[34]; | |
56 int[] ref = new int[34]; | |
57 | |
58 init(src, dst, ref); | |
59 verify(src, ref); | |
60 } | |
61 | |
62 public static void main(String[] args) { | |
63 for (int i=0; i< 2000; i++) { | |
64 test(); | |
65 } | |
66 } | |
67 } |