Wed, 27 Apr 2016 01:25:04 +0800
Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | */ |
aoqi@0 | 23 | |
aoqi@0 | 24 | /* |
aoqi@0 | 25 | * @test |
aoqi@0 | 26 | * @bug 8011771 |
aoqi@0 | 27 | * @summary Array bound check elimination's in block motion doesn't always reset its data structures from one step to the other. |
aoqi@0 | 28 | * @run main/othervm -XX:-BackgroundCompilation Test8011771 |
aoqi@0 | 29 | * |
aoqi@0 | 30 | */ |
aoqi@0 | 31 | |
aoqi@0 | 32 | public class Test8011771 { |
aoqi@0 | 33 | |
aoqi@0 | 34 | static void m(int[] a, int[] b, int j) { |
aoqi@0 | 35 | // Array bound check elimination inserts a predicate before |
aoqi@0 | 36 | // the loop. We'll have the predicate fail, so the method is |
aoqi@0 | 37 | // recompiled without optimistic optimizations |
aoqi@0 | 38 | for (int i = 0; i < 10; i++) { |
aoqi@0 | 39 | a[i] = i; |
aoqi@0 | 40 | } |
aoqi@0 | 41 | |
aoqi@0 | 42 | // The test itself |
aoqi@0 | 43 | a[j] = 0; |
aoqi@0 | 44 | a[j+5] = 0; |
aoqi@0 | 45 | b[j+4] = 0; // this range check shouldn't be eliminated |
aoqi@0 | 46 | } |
aoqi@0 | 47 | |
aoqi@0 | 48 | static public void main(String[] args) { |
aoqi@0 | 49 | int[] arr1 = new int[10], arr2 = new int[10]; |
aoqi@0 | 50 | // force compilation: |
aoqi@0 | 51 | for (int i = 0; i < 5000; i++) { |
aoqi@0 | 52 | m(arr1, arr2, 0); |
aoqi@0 | 53 | } |
aoqi@0 | 54 | |
aoqi@0 | 55 | try { |
aoqi@0 | 56 | m(new int[1], null, 0); // force predicate failure |
aoqi@0 | 57 | } catch(ArrayIndexOutOfBoundsException e) {} |
aoqi@0 | 58 | |
aoqi@0 | 59 | // force compilation again (no optimistic opts): |
aoqi@0 | 60 | for (int i = 0; i < 5000; i++) { |
aoqi@0 | 61 | m(arr1, arr2, 0); |
aoqi@0 | 62 | } |
aoqi@0 | 63 | |
aoqi@0 | 64 | // Check that the range check on the second array wasn't optimized out |
aoqi@0 | 65 | boolean success = false; |
aoqi@0 | 66 | try { |
aoqi@0 | 67 | m(arr1, new int[1], 0); |
aoqi@0 | 68 | } catch(ArrayIndexOutOfBoundsException e) { |
aoqi@0 | 69 | success = true; |
aoqi@0 | 70 | } |
aoqi@0 | 71 | if (success) { |
aoqi@0 | 72 | System.out.println("TEST PASSED"); |
aoqi@0 | 73 | } else { |
aoqi@0 | 74 | throw new RuntimeException("TEST FAILED: erroneous bound check elimination"); |
aoqi@0 | 75 | } |
aoqi@0 | 76 | } |
aoqi@0 | 77 | } |