Lines Matching defs:whead
107 Node *whead = w->_block->head();
108 for( uint j=1; j < whead->req(); j++ ) {
109 Block *b = _bbs[whead->in(j)->_idx];
432 Node *whead = w->_control;
433 for( uint j=0; j < whead->req(); j++ ) { // For each predecessor
434 if( whead->in(j) == NULL || !whead->in(j)->is_CFG() )
436 uint b = dfsorder[whead->in(j)->_idx];
462 if( !_verify_only && whead->is_Region() ) {
463 for( uint i = 1; i < whead->req(); i++ ) {
464 if (!has_node(whead->in(i))) {
466 assert( !visited.test(whead->in(i)->_idx),
468 _igvn.delete_input_of(whead, i);
469 for (DUIterator_Fast jmax, j = whead->fast_outs(jmax); j < jmax; j++) {
470 Node* p = whead->fast_out(j);
478 } // End if if whead is a Region