author | trims |
Thu, 27 May 2010 19:08:38 -0700 | |
changeset 5547 | f4b087cbb361 |
parent 670 | ddf3e9583f2f |
permissions | -rw-r--r-- |
242 | 1 |
/* |
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
670
diff
changeset
|
2 |
* Copyright (c) 1997, 2008, Oracle and/or its affiliates. All rights reserved. |
603 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
242 | 4 |
* |
603 | 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. |
|
242 | 8 |
* |
603 | 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). |
|
242 | 14 |
* |
603 | 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. |
|
242 | 18 |
* |
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
670
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
670
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
670
diff
changeset
|
21 |
* questions. |
242 | 22 |
* |
23 |
*/ |
|
24 |
||
25 |
/* |
|
26 |
* @test |
|
27 |
* @bug 6659207 |
|
28 |
* @summary access violation in CompilerThread0 |
|
29 |
*/ |
|
30 |
||
31 |
public class Test { |
|
32 |
static int[] array = new int[12]; |
|
33 |
||
34 |
static int index(int i) { |
|
35 |
if (i == 0) return 0; |
|
36 |
for (int n = 0; n < array.length; n++) |
|
37 |
if (i < array[n]) return n; |
|
38 |
return -1; |
|
39 |
} |
|
40 |
||
41 |
static int test(int i) { |
|
42 |
int result = 0; |
|
43 |
i = index(i); |
|
44 |
if (i >= 0) |
|
45 |
if (array[i] != 0) |
|
46 |
result++; |
|
47 |
||
48 |
if (i != -1) |
|
49 |
array[i]++; |
|
50 |
||
51 |
return result; |
|
52 |
} |
|
53 |
||
54 |
public static void main(String[] args) { |
|
55 |
int total = 0; |
|
56 |
for (int i = 0; i < 100000; i++) { |
|
57 |
total += test(10); |
|
58 |
} |
|
59 |
System.out.println(total); |
|
60 |
} |
|
61 |
} |