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