Mercurial > jdk8-mips64-public > hotspot / annotate
test/compiler/6659207/Test.java@710a3c8b516e (annotated)
test/compiler/6659207/Test.java
Tue, 08 Aug 2017 15:57:29 +0800
- author
- aoqi
- date
- Tue, 08 Aug 2017 15:57:29 +0800
- changeset 6876
- 710a3c8b516e
- parent 1907
- c18cbe5936b8
- parent 0
- f90c822e73f8
- permissions
- -rw-r--r--
merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1997, 2008, 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 | /* |
| aoqi@0 | 26 | * @test |
| aoqi@0 | 27 | * @bug 6659207 |
| aoqi@0 | 28 | * @summary access violation in CompilerThread0 |
| aoqi@0 | 29 | */ |
| aoqi@0 | 30 | |
| aoqi@0 | 31 | public class Test { |
| aoqi@0 | 32 | static int[] array = new int[12]; |
| aoqi@0 | 33 | |
| aoqi@0 | 34 | static int index(int i) { |
| aoqi@0 | 35 | if (i == 0) return 0; |
| aoqi@0 | 36 | for (int n = 0; n < array.length; n++) |
| aoqi@0 | 37 | if (i < array[n]) return n; |
| aoqi@0 | 38 | return -1; |
| aoqi@0 | 39 | } |
| aoqi@0 | 40 | |
| aoqi@0 | 41 | static int test(int i) { |
| aoqi@0 | 42 | int result = 0; |
| aoqi@0 | 43 | i = index(i); |
| aoqi@0 | 44 | if (i >= 0) |
| aoqi@0 | 45 | if (array[i] != 0) |
| aoqi@0 | 46 | result++; |
| aoqi@0 | 47 | |
| aoqi@0 | 48 | if (i != -1) |
| aoqi@0 | 49 | array[i]++; |
| aoqi@0 | 50 | |
| aoqi@0 | 51 | return result; |
| aoqi@0 | 52 | } |
| aoqi@0 | 53 | |
| aoqi@0 | 54 | public static void main(String[] args) { |
| aoqi@0 | 55 | int total = 0; |
| aoqi@0 | 56 | for (int i = 0; i < 100000; i++) { |
| aoqi@0 | 57 | total += test(10); |
| aoqi@0 | 58 | } |
| aoqi@0 | 59 | System.out.println(total); |
| aoqi@0 | 60 | } |
| aoqi@0 | 61 | } |
