12594
|
1 |
/*
|
|
2 |
* Copyright (c) 2012, 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 |
/**
|
|
26 |
* @test
|
|
27 |
* @bug 7160610
|
|
28 |
* @summary Unknown Native Code compilation issue.
|
|
29 |
*
|
|
30 |
* @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-OptimizeFill Test7160610
|
|
31 |
*/
|
|
32 |
|
|
33 |
public class Test7160610 {
|
|
34 |
private static final byte[] BYTE_ARRAY = new byte[7];
|
|
35 |
private static int[] anIntArray1190 = new int[32768];
|
|
36 |
private static int[] anIntArray1191 = new int[32768];
|
|
37 |
|
|
38 |
public static void main(String arg[]) {
|
|
39 |
int i = 256;
|
|
40 |
for(int j = BYTE_ARRAY[2]; j < anIntArray1190.length; j++) {
|
|
41 |
anIntArray1190[j] = BYTE_ARRAY[2];
|
|
42 |
}
|
|
43 |
|
|
44 |
for(int k = BYTE_ARRAY[2]; (k ^ BYTE_ARRAY[1]) > -5001; k++) {
|
|
45 |
int i1 = (int)(Math.random() * 128D * (double)i);
|
|
46 |
anIntArray1190[i1] = (int)(Math.random() * 256D);
|
|
47 |
}
|
|
48 |
|
|
49 |
for(int l = BYTE_ARRAY[2]; (l ^ BYTE_ARRAY[1]) > -21; l++) {
|
|
50 |
for(int j1 = BYTE_ARRAY[0]; j1 < i + -BYTE_ARRAY[0]; j1++) {
|
|
51 |
for(int k1 = BYTE_ARRAY[0]; (k1 ^ BYTE_ARRAY[1]) > -128; k1++) {
|
|
52 |
int l1 = k1 - -(j1 << 0x26cb6487);
|
|
53 |
anIntArray1191[l1] = (anIntArray1190[l1 + -BYTE_ARRAY[0]] - -anIntArray1190[l1 - -BYTE_ARRAY[0]] - -anIntArray1190[-128 + l1] - -anIntArray1190[128 + l1]) / BYTE_ARRAY[6];
|
|
54 |
}
|
|
55 |
}
|
|
56 |
int ai[] = anIntArray1190;
|
|
57 |
anIntArray1190 = anIntArray1191;
|
|
58 |
anIntArray1191 = ai;
|
|
59 |
}
|
|
60 |
}
|
|
61 |
|
|
62 |
static {
|
|
63 |
BYTE_ARRAY[6] = 4;
|
|
64 |
BYTE_ARRAY[5] = 5;
|
|
65 |
BYTE_ARRAY[4] = 3;
|
|
66 |
BYTE_ARRAY[3] = 2;
|
|
67 |
BYTE_ARRAY[2] = 0;
|
|
68 |
BYTE_ARRAY[1] = -1;
|
|
69 |
BYTE_ARRAY[0] = 1;
|
|
70 |
}
|
|
71 |
}
|