Skip to content

Commit 22a4752

Browse files
committed
8268360: Missing check for infinite loop during node placement
8268417: Add test from JDK-8268360 Reviewed-by: roland
1 parent 1960a05 commit 22a4752

File tree

2 files changed

+73
-1
lines changed

2 files changed

+73
-1
lines changed

src/hotspot/share/opto/loopopts.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1076,7 +1076,7 @@ static bool merge_point_safe(Node* region) {
10761076
// For inner loop uses move it to the preheader area.
10771077
Node *PhaseIdealLoop::place_near_use(Node *useblock) const {
10781078
IdealLoopTree *u_loop = get_loop( useblock );
1079-
if (u_loop->_irreducible) {
1079+
if (u_loop->_irreducible || !u_loop->_head->is_Loop()) {
10801080
return useblock;
10811081
}
10821082
if (u_loop->_child) {
Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
/*
2+
* Copyright (c) 2021, 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 8268360
28+
* @summary Test node placement when its use is inside infinite loop.
29+
* @library /test/lib
30+
* @run main/othervm -XX:CompileCommand=compileonly,compiler.loopopts.TestInfLoopNearUsePlacement::test
31+
* compiler.loopopts.TestInfLoopNearUsePlacement
32+
*/
33+
34+
package compiler.loopopts;
35+
36+
import jdk.test.lib.Utils;
37+
38+
public class TestInfLoopNearUsePlacement {
39+
40+
static void test() {
41+
long loa[] = new long[42];
42+
43+
try {
44+
for (int i = 0; i < 42; i++) {
45+
Thread.sleep(1);
46+
loa[i] = 42L;
47+
}
48+
} catch (InterruptedException e) {}
49+
50+
loa[0] = 1L;
51+
// Infinite loop: loop's variable is reset on each iteration
52+
for (int i = 0; i < 21; i++) {
53+
loa[0] += 1L;
54+
i = 1;
55+
}
56+
}
57+
58+
public static void main(String[] args) throws Exception {
59+
// Execute test in own thread because it contains an infinite loop
60+
Thread thread = new Thread() {
61+
public void run() {
62+
for (int i = 0; i < 100; ++i) {
63+
test();
64+
}
65+
}
66+
};
67+
thread.setDaemon(true);
68+
thread.start();
69+
// Give thread some time to trigger compilation
70+
Thread.sleep(Utils.adjustTimeout(5000));
71+
}
72+
}

0 commit comments

Comments
 (0)