Mercurial > hg > truffle
comparison test/compiler/8011706/Test8011706.java @ 9081:84ab5667f290
8011706: specjvm2008 test xml.transform gets array bound exception with c1
Summary: loop invariant code motion may move load before store to the same field
Reviewed-by: kvn
author | roland |
---|---|
date | Wed, 10 Apr 2013 09:52:49 +0200 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
9080:b84fd7d73702 | 9081:84ab5667f290 |
---|---|
1 /* | |
2 * Copyright (c) 2013, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | |
20 * or visit www.oracle.com if you need additional information or have any | |
21 * questions. | |
22 */ | |
23 | |
24 /* | |
25 * @test | |
26 * @bug 8011706 | |
27 * @summary loop invariant code motion may move load before store to the same field | |
28 * @run main/othervm -XX:-UseOnStackReplacement -XX:-BackgroundCompilation Test8011706 | |
29 * | |
30 */ | |
31 | |
32 public class Test8011706 { | |
33 int[] array; | |
34 | |
35 void m(boolean test, int[] array1, int[] array2) { | |
36 int i = 0; | |
37 if (test) { | |
38 array = array1; | |
39 } else { | |
40 array = array2; | |
41 } | |
42 | |
43 while(true) { | |
44 int v = array[i]; | |
45 i++; | |
46 if (i >= 10) return; | |
47 } | |
48 } | |
49 | |
50 static public void main(String[] args) { | |
51 int[] new_array = new int[10]; | |
52 Test8011706 ti = new Test8011706(); | |
53 boolean failed = false; | |
54 try { | |
55 for (int i = 0; i < 10000; i++) { | |
56 ti.array = null; | |
57 ti.m(true, new_array, new_array); | |
58 } | |
59 } catch(NullPointerException ex) { | |
60 throw new RuntimeException("TEST FAILED", ex); | |
61 } | |
62 System.out.println("TEST PASSED"); | |
63 } | |
64 | |
65 } |