1berry/openjdk
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Addressing review comments

Browse Source
This commit is contained in:
Saranya Natarajan 2025-06-13 00:41:43 +02:00
parent 767326bfc7
commit e4dab5654c
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/hotspot/share/opto/loopTransform.cpp
View File

@ -1399,7 +1399,7 @@ void PhaseIdealLoop::insert_pre_post_loops(IdealLoopTree *loop, Node_List &old_n
CountedLoopNode *post_head = nullptr;
Node* post_incr = incr;
Node* main_exit = insert_post_loop(loop, old_new, main_head, main_end, post_incr, limit, post_head);
C->print_method(PHASE_AFTER_POST_LOOP, 4, main_head);
C->print_method(PHASE_AFTER_POST_LOOP, 4, post_head);
//------------------------------
// Step B: Create Pre-Loop.
@ -1617,7 +1617,7 @@ void PhaseIdealLoop::insert_vector_post_loop(IdealLoopTree *loop, Node_List &old
C->print_method(PHASE_BEFORE_POST_LOOP, 4, main_head);
CountedLoopNode *post_head = nullptr;
insert_post_loop(loop, old_new, main_head, main_end, incr, limit, post_head);
C->print_method(PHASE_AFTER_POST_LOOP, 4, main_head);
C->print_method(PHASE_AFTER_POST_LOOP, 4, post_head);
// It's difficult to be precise about the trip-counts
// for post loops. They are usually very short,
@ -3183,7 +3183,7 @@ bool IdealLoopTree::do_remove_empty_loop(PhaseIdealLoop *phase) {
phase->_igvn.replace_input_of(cl->loopexit(), CountedLoopEndNode::TestValue, zero);
phase->C->set_major_progress();
phase->C->print_method(PHASE_AFTER_REMOVE_EMPTY_LOOP, 4, cl);
phase->C->print_method(PHASE_AFTER_REMOVE_EMPTY_LOOP, 4, final_iv);
return true;
}
@ -3346,7 +3346,7 @@ bool IdealLoopTree::do_one_iteration_loop(PhaseIdealLoop *phase) {
// and all loop-invariant uses of the exit values will be correct.
phase->_igvn.replace_node(cl->phi(), cl->init_trip());
phase->C->set_major_progress();
phase->C->print_method(PHASE_AFTER_ONE_INTERATION_LOOP, 4, cl);
phase->C->print_method(PHASE_AFTER_ONE_INTERATION_LOOP, 4, init_n);
return true;
}