vm/opto/loopnode.cpp

1549 //  B) innermost loops are okay (only an inner loop can delete
2699 // Insert 'loop' into the existing loop tree.  'innermost' is a leaf of the
2701 IdealLoopTree *PhaseIdealLoop::sort( IdealLoopTree *loop, IdealLoopTree *innermost ) {
2702   if( !innermost ) return loop; // New innermost loop
2706   IdealLoopTree **pp = &innermost;      // Pointer to previous next-pointer
2711     if( l == loop ) return innermost; // Already on list!
2734   if( p ) sort( p, innermost ); // Insert my parents into list as well
2735   return innermost;
2840   IdealLoopTree *innermost = NULL;
2953     innermost = sort( l, innermost );
2960   if( innermost && innermost->_head == n ) {
2961     assert( get_loop(n) == innermost, "" );
2962     IdealLoopTree *p = innermost->_parent;
2963     IdealLoopTree *l = innermost;
2976     set_loop(n, innermost);
2978     if( innermost ) {
2988             innermost->_has_call = 1;
2994         innermost->_allow_optimizations = false;
2995         innermost->_has_call = 1; // = true
2998         if (innermost->_safepts == NULL) innermost->_safepts = new Node_List();
2999         innermost->_safepts->push(n);