stan/jdk-24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

8318889: C2: add bailout after assert Bad graph detected in build_loop_late

Browse Source 
Reviewed-by: shade, thartmann
This commit is contained in:
Emanuel Peter 2023-10-30 07:17:30 +00:00
parent 1183b221c2
commit 83eb20651f
1 changed files with 6 additions and 2 deletions

8
src/hotspot/share/opto/loopnode.cpp

@ -4459,6 +4459,7 @@ void PhaseIdealLoop::build_and_optimize() {
NOT_PRODUCT( C->verify_graph_edges(); )
worklist.push(C->top());
build_loop_late( visited, worklist, nstack );
if (C->failing()) { return; }
if (_verify_only) {
C->restore_major_progress(old_progress);
@ -5991,6 +5992,7 @@ void PhaseIdealLoop::build_loop_late( VectorSet &visited, Node_List &worklist, N
} else {
// All of n's children have been processed, complete post-processing.
build_loop_late_post(n);
if (C->failing()) { return; }
if (nstack.is_empty()) {
// Finished all nodes on stack.
// Process next node on the worklist.
@ -6137,13 +6139,15 @@ void PhaseIdealLoop::build_loop_late_post_work(Node *n, bool pinned) {
Node *legal = LCA; // Walk 'legal' up the IDOM chain
Node *least = legal; // Best legal position so far
while( early != legal ) { // While not at earliest legal
#ifdef ASSERT
if (legal->is_Start() && !early->is_Root()) {
#ifdef ASSERT
// Bad graph. Print idom path and fail.
dump_bad_graph("Bad graph detected in build_loop_late", n, early, LCA);
assert(false, "Bad graph detected in build_loop_late");
}
#endif
C->record_method_not_compilable("Bad graph detected in build_loop_late");
return;
}
// Find least loop nesting depth
legal = idom(legal); // Bump up the IDOM tree
// Check for lower nesting depth