infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-02-09 18:08:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

8330469: C2: Remove or change "PrintOpto && VerifyLoopOptimizations" as printing code condition

Browse Source 
Reviewed-by: chagedorn, rcastanedalo
This commit is contained in:
Saranya Natarajan 2025-03-13 11:02:44 +00:00 committed by Roberto Castañeda Lozano
parent c18494d3c9
commit 9c00331465
3 changed files with 4 additions and 38 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -751,9 +751,8 @@ void PhaseIdealLoop::do_peeling(IdealLoopTree *loop, Node_List &old_new) {
cl->set_no_multiversion();
}
#ifndef PRODUCT
if (PrintOpto && VerifyLoopOptimizations) {
if (TraceLoopOpts) {
tty->print("Peeling a 'main' loop; resetting to 'normal' ");
loop->dump_head();
}
#endif
}
@ -1809,10 +1808,7 @@ void PhaseIdealLoop::do_unroll(IdealLoopTree *loop, Node_List &old_new, bool adj
C->print_method(PHASE_BEFORE_LOOP_UNROLLING, 4, loop_head);
#ifndef PRODUCT
if (PrintOpto && VerifyLoopOptimizations) {
tty->print("Unrolling ");
loop->dump_head();
} else if (TraceLoopOpts) {
if (TraceLoopOpts) {
if (loop_head->trip_count() < (uint)LoopUnrollLimit) {
tty->print("Unroll %d(%2d) ", loop_head->unrolled_count()*2, loop_head->trip_count());
} else {
@ -2488,10 +2484,7 @@ bool PhaseIdealLoop::is_scaled_iv_plus_extra_offset(Node* exp1, Node* offset3, N
// Eliminate range-checks and other trip-counter vs loop-invariant tests.
void PhaseIdealLoop::do_range_check(IdealLoopTree* loop) {
#ifndef PRODUCT
if (PrintOpto && VerifyLoopOptimizations) {
tty->print("Range Check Elimination ");
loop->dump_head();
} else if (TraceLoopOpts) {
if (TraceLoopOpts) {
tty->print("RangeCheck ");
loop->dump_head();
}

9
src/hotspot/share/opto/loopopts.cpp
View File

@ -846,7 +846,6 @@ Node *PhaseIdealLoop::conditional_move( Node *region ) {
if (phi == nullptr || _igvn.type(phi) == Type::TOP) {
break;
}
if (PrintOpto && VerifyLoopOptimizations) { tty->print_cr("CMOV"); }
// Move speculative ops
wq.push(phi);
while (wq.size() > 0) {
@ -854,12 +853,6 @@ Node *PhaseIdealLoop::conditional_move( Node *region ) {
for (uint j = 1; j < n->req(); j++) {
Node* m = n->in(j);
if (m != nullptr && !is_dominator(get_ctrl(m), cmov_ctrl)) {
#ifndef PRODUCT
if (PrintOpto && VerifyLoopOptimizations) {
tty->print(" speculate: ");
m->dump();
}
#endif
set_ctrl(m, cmov_ctrl);
wq.push(m);
}
@ -1491,7 +1484,7 @@ void PhaseIdealLoop::split_if_with_blocks_post(Node *n) {
// Now split the IF
C->print_method(PHASE_BEFORE_SPLIT_IF, 4, iff);
if ((PrintOpto && VerifyLoopOptimizations) || TraceLoopOpts) {
if (TraceLoopOpts) {
tty->print_cr("Split-If");
}
do_split_if(iff);

20
src/hotspot/share/opto/split_if.cpp
View File

@ -135,14 +135,6 @@ bool PhaseIdealLoop::split_up( Node *n, Node *blk1, Node *blk2 ) {
}
}
// Found some other Node; must clone it up
#ifndef PRODUCT
if( PrintOpto && VerifyLoopOptimizations ) {
tty->print("Cloning up: ");
n->dump();
}
#endif
// ConvI2L may have type information on it which becomes invalid if
// it moves up in the graph so change any clones so widen the type
// to TypeLong::INT when pushing it up.
@ -308,12 +300,6 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
at_relevant_ctrl(cmov, blk1, blk2)))) {
// Must clone down
#ifndef PRODUCT
if( PrintOpto && VerifyLoopOptimizations ) {
tty->print("Cloning down: ");
n->dump();
}
#endif
if (!n->is_FastLock()) {
// Clone down any block-local BoolNode uses of this CmpNode
for (DUIterator i = n->outs(); n->has_out(i); i++) {
@ -343,12 +329,6 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
}
if (at_relevant_ctrl(bol, blk1, blk2)) {
// Recursively sink any BoolNode
#ifndef PRODUCT
if( PrintOpto && VerifyLoopOptimizations ) {
tty->print("Cloning down: ");
bol->dump();
}
#endif
for (DUIterator j = bol->outs(); bol->has_out(j); j++) {
Node* u = bol->out(j);
// Uses are either IfNodes, CMoves, OpaqueNotNull, or Opaque*AssertionPredicate