Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/test/hotspot/jtreg/compiler/loopopts/TestLimitLoadBelowLoopLimitCheck.java
41149 views
1
/*
2
* Copyright (c) 2018, Red Hat, Inc. 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 8202123
27
* @summary C2 Crash in Node::in(unsigned int) const+0x14
28
*
29
* @run main/othervm TestLimitLoadBelowLoopLimitCheck
30
*
31
*/
32
33
public class TestLimitLoadBelowLoopLimitCheck {
34
public static int[] run(int[] arr) {
35
int max = 0;
36
for (int i : arr) {
37
if (i > max) {
38
max = i;
39
}
40
}
41
42
int[] counts = new int[10];
43
44
int i = 0;
45
for (i = 0; i < counts.length; i += 1) {
46
for (int j = 0; j < counts[i]; j += 1) {
47
}
48
}
49
50
while (i < max) {
51
for (int j = 0; j < counts[i]; j += 1) {
52
arr[0] = i;
53
}
54
}
55
56
return arr;
57
}
58
59
public static void main(String[] args) {
60
int[] arr = new int[1000 * 1000];
61
62
for (int i = 0; i < 100; i++) {
63
run(arr);
64
}
65
}
66
}
67
68