Lines Matching refs:_bb_end
1894 for( uint j=_bb_start; j < _bb_end; j++ ) {
2365 for( uint l = _bb_end; l < bb->_nodes.size(); l++ )
2370 for( uint j = _bb_end-1; j >= _bb_start; j-- ) {
2452 _bb_end = bb->_nodes.size()-1;
2453 for( _bb_start=1; _bb_start <= _bb_end; _bb_start++ ) {
2469 // might schedule. _bb_end points just after last schedulable inst. We
2474 Node *last = bb->_nodes[_bb_end];
2476 while (_bb_end > 0 && last->is_Mach() &&
2478 last = bb->_nodes[--_bb_end];
2483 (_bb_end > 1 && last->is_Mach() && last->as_Mach()->ideal_Opcode() == Op_Halt) ) {
2485 while( !bb->_nodes[--_bb_end]->is_MachCall() ) {
2486 assert( bb->_nodes[_bb_end]->is_MachProj(), "skipping projections after expected call" );
2494 _bb_end--;
2495 } while (mem != bb->_nodes[_bb_end]);
2497 // Set _bb_end to point after last schedulable inst.
2498 _bb_end++;
2501 assert( _bb_start <= _bb_end, "inverted block ends" );
2520 assert( _scheduled.size() == _bb_end - _bb_start, "wrong number of instructions" );
2522 for( uint l = _bb_start; l < _bb_end; l++ ) {
2525 for( m = 0; m < _bb_end-_bb_start; m++ )
2528 assert( m < _bb_end-_bb_start, "instruction missing in schedule" );
2533 for ( uint k = _bb_start; k < _bb_end; k++ )
2534 bb->_nodes.map(k, _scheduled[_bb_end-k-1]);
2741 _bb_end++; // Increase size scheduled region in block
2792 uint last_safept = _bb_end-1;
2793 Node* end_node = (_bb_end-1 >= _bb_start) ? b->_nodes[last_safept] : NULL;
2795 for( uint i = _bb_end-1; i >= _bb_start; i-- ) {