Skip to content

Commit 3354244

Browse files
committed
8271202: C1: assert(false) failed: live_in set of first block must be empty
Backport-of: 54b800d56d6bc86676722ad96e87b8344606bcb7
1 parent e965881 commit 3354244

File tree

2 files changed

+75
-0
lines changed

2 files changed

+75
-0
lines changed

src/hotspot/share/c1/c1_LIRGenerator.cpp

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -979,6 +979,14 @@ void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_v
979979
Phi* phi = sux_val->as_Phi();
980980
// cur_val can be null without phi being null in conjunction with inlining
981981
if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) {
982+
if (phi->is_local()) {
983+
for (int i = 0; i < phi->operand_count(); i++) {
984+
Value op = phi->operand_at(i);
985+
if (op != NULL && op->type()->is_illegal()) {
986+
bailout("illegal phi operand");
987+
}
988+
}
989+
}
982990
Phi* cur_phi = cur_val->as_Phi();
983991
if (cur_phi != NULL && cur_phi->is_illegal()) {
984992
// Phi and local would need to get invalidated
Lines changed: 67 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,67 @@
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+
* @test
26+
* @bug 8271202
27+
* @requires vm.debug == true & vm.compiler1.enabled
28+
* @run main/othervm -Xbatch -XX:TieredStopAtLevel=1 -XX:+DeoptimizeALot
29+
* Test8271202
30+
*/
31+
32+
public class Test8271202 {
33+
public static void main(String[] strArr) {
34+
try {
35+
test();
36+
} catch (Exception e) {
37+
// Expected
38+
}
39+
}
40+
41+
static void test() {
42+
long l6 = 10L;
43+
int counter = 0;
44+
int i2, i26, i29, iArr[] = new int[400];
45+
boolean b3 = true;
46+
for (int smallinvoc = 0; smallinvoc < 139; smallinvoc++) {
47+
}
48+
for (i2 = 13; i2 < 1000; i2++) {
49+
for (i26 = 2; i26 < 114; l6 += 2) {
50+
// Infinite loop
51+
if (b3) {
52+
for (i29 = 1; i29 < 2; i29++) {
53+
try {
54+
iArr[i26] = 0;
55+
} catch (ArithmeticException a_e) {
56+
}
57+
}
58+
}
59+
counter++;
60+
if (counter == 100000) {
61+
throw new RuntimeException("expected");
62+
}
63+
}
64+
}
65+
}
66+
}
67+

0 commit comments

Comments
 (0)