|
10388
|
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 8011771
|
|
|
27 * @summary Array bound check elimination's in block motion doesn't always reset its data structures from one step to the other.
|
|
|
28 * @run main/othervm -XX:-BackgroundCompilation Test8011771
|
|
|
29 *
|
|
|
30 */
|
|
|
31
|
|
|
32 public class Test8011771 {
|
|
|
33
|
|
|
34 static void m(int[] a, int[] b, int j) {
|
|
|
35 // Array bound check elimination inserts a predicate before
|
|
|
36 // the loop. We'll have the predicate fail, so the method is
|
|
|
37 // recompiled without optimistic optimizations
|
|
|
38 for (int i = 0; i < 10; i++) {
|
|
|
39 a[i] = i;
|
|
|
40 }
|
|
|
41
|
|
|
42 // The test itself
|
|
|
43 a[j] = 0;
|
|
|
44 a[j+5] = 0;
|
|
|
45 b[j+4] = 0; // this range check shouldn't be eliminated
|
|
|
46 }
|
|
|
47
|
|
|
48 static public void main(String[] args) {
|
|
|
49 int[] arr1 = new int[10], arr2 = new int[10];
|
|
|
50 // force compilation:
|
|
|
51 for (int i = 0; i < 5000; i++) {
|
|
|
52 m(arr1, arr2, 0);
|
|
|
53 }
|
|
|
54
|
|
|
55 try {
|
|
|
56 m(new int[1], null, 0); // force predicate failure
|
|
|
57 } catch(ArrayIndexOutOfBoundsException e) {}
|
|
|
58
|
|
|
59 // force compilation again (no optimistic opts):
|
|
|
60 for (int i = 0; i < 5000; i++) {
|
|
|
61 m(arr1, arr2, 0);
|
|
|
62 }
|
|
|
63
|
|
|
64 // Check that the range check on the second array wasn't optimized out
|
|
|
65 boolean success = false;
|
|
|
66 try {
|
|
|
67 m(arr1, new int[1], 0);
|
|
|
68 } catch(ArrayIndexOutOfBoundsException e) {
|
|
|
69 success = true;
|
|
|
70 }
|
|
|
71 if (success) {
|
|
|
72 System.out.println("TEST PASSED");
|
|
|
73 } else {
|
|
|
74 throw new RuntimeException("TEST FAILED: erroneous bound check elimination");
|
|
|
75 }
|
|
|
76 }
|
|
|
77 }
|
