Lines Matching defs:ilt
1430 IdealLoopTree *ilt = new IdealLoopTree( phase, _head, _tail );
1431 phase->set_loop(_tail,ilt); // Adjust tail
1434 ilt->_child = _child; // New guy has my children
1435 _child = ilt; // Self has new guy as only child
1436 ilt->_parent = this; // new guy has self for parent
1437 ilt->_nest = _nest; // Same nesting depth (for now)
1439 // Starting with 'ilt', look for child loop trees using the same shared
1442 while( ilt ) {
1443 if( ilt->_head == _head ) {
1446 if( _head->in(i) == ilt->_tail )
1449 // Flatten ilt. Hang ilt's "_next" list from the end of
1450 // ilt's '_child' list. Move the ilt's _child up to replace ilt.
1451 IdealLoopTree **cp = &ilt->_child;
1453 *cp = ilt->_next; // Hang next list at end of child list
1454 *pilt = ilt->_child; // Move child up to replace ilt
1455 ilt->_head = NULL; // Flag as a loop UNIONED into parent
1456 ilt = ilt->_child; // Repeat using new ilt
1457 continue; // do not advance over ilt->_child
1459 assert( ilt->_tail == hot_tail, "expected to only find the hot inner loop here" );
1460 phase->set_loop(_head,ilt);
1462 pilt = &ilt->_child; // Advance to next
1463 ilt = *pilt;
3033 IdealLoopTree *ilt;
3034 while( !(ilt = get_loop(n))->_head ) {
3038 _nodes.map(n->_idx, (Node*)(ilt->_parent) );
3044 if( !_verify_only && !_verify_me && ilt->_has_sfpt && n->Opcode() == Op_SafePoint &&
3048 if (ilt->_safepts != NULL) {
3049 ilt->_safepts->yank(n);