Mercurial > hg > truffle

comparison src/share/vm/opto/loopnode.cpp @ 222:2a1a77d3458f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6718676: putback for 6604014 is incomplete Reviewed-by: kvn, jrose
author never
date Tue, 24 Jun 2008 16:00:14 -0700
parents 9148c65abefc
children 9c2ecc2ffb12
comparison
equal deleted inserted replaced
221:1e026f8da827 222:2a1a77d3458f
1069 _head = l; 1069 _head = l;
1070 phase->set_loop(_head, this); 1070 phase->set_loop(_head, this);
1071 for (DUIterator_Fast imax, i = l->fast_outs(imax); i < imax; i++) 1071 for (DUIterator_Fast imax, i = l->fast_outs(imax); i < imax; i++)
1072 phase->_igvn.add_users_to_worklist(l->fast_out(i)); 1072 phase->_igvn.add_users_to_worklist(l->fast_out(i));
1073 } 1073 }
1074
1075 phase->C->print_method("After beautify loops", 3);
1076 1074
1077 // Now recursively beautify nested loops 1075 // Now recursively beautify nested loops
1078 if( _child ) result |= _child->beautify_loops( phase ); 1076 if( _child ) result |= _child->beautify_loops( phase );
1079 if( _next ) result |= _next ->beautify_loops( phase ); 1077 if( _next ) result |= _next ->beautify_loops( phase );
1080 return result; 1078 return result;
1468 if (C->failing()) { 1466 if (C->failing()) {
1469 return; 1467 return;
1470 } 1468 }
1471 // Reset loop nesting depth 1469 // Reset loop nesting depth
1472 _ltree_root->set_nest( 0 ); 1470 _ltree_root->set_nest( 0 );
1471
1472 C->print_method("After beautify loops", 3);
1473 } 1473 }
1474 } 1474 }
1475 1475
1476 // Build Dominators for elision of NULL checks & loop finding. 1476 // Build Dominators for elision of NULL checks & loop finding.
1477 // Since nodes do not have a slot for immediate dominator, make 1477 // Since nodes do not have a slot for immediate dominator, make