Lines Matching refs:_blocks

48     _blocks = (Block**)_arena->Amalloc( _size * sizeof(Block*) );
49 _blocks[0] = NULL;
53 _blocks = (Block**)_arena->Arealloc( _blocks, old*sizeof(Block*),_size*sizeof(Block*));
54 Copy::zero_to_bytes( &_blocks[old], (_size-old)*sizeof(Block*) );
60 Copy::conjoint_words_to_lower((HeapWord*)&_blocks[i+1], (HeapWord*)&_blocks[i], ((_cnt-i-1)*sizeof(Block*)));
66 Copy::conjoint_words_to_higher((HeapWord*)&_blocks[i], (HeapWord*)&_blocks[i+1], ((_cnt-i-1)*sizeof(Block*)));
67 _blocks[i] = b;
73 tty->print("B%d ", _blocks[i]->_pre_order);
500 Block* in = _blocks[block_no];
535 _blocks.insert(block_no + 1, block);
604 if ((bx_index <= b_index) && (_blocks[bx_index] == bx)) {
610 while( bx_index < _num_blocks && _blocks[bx_index] != bx ) bx_index++;
611 assert(_blocks[bx_index] == bx, "block not found");
617 if (pred == _blocks[bx_index-1]) {
625 _blocks.remove(bx_index);
626 _blocks.insert(b_index + 1, bx);
644 _blocks.remove(i);
645 _blocks.push(b);
652 assert( _blocks[0] == _broot, "" );
655 Block *b = _blocks[i];
668 assert( _blocks[0] == _broot, "" );
671 Block *b = _blocks[i];
689 b = _blocks[i]; // Find the fall-thru block
701 Block *b = _blocks[i];
718 Block *b = _blocks[i];
723 assert((i+1) == _num_blocks || _blocks[i+1]->is_connector(),
730 Block *bnext = (i < _num_blocks-1) ? _blocks[i+1] : NULL;
882 if( _blocks.size() ) { // Did we do basic-block layout?
884 _blocks[i]->dump(&_bbs);
893 if( _blocks[i] == NULL ) continue;
894 _blocks[i]->dump_head(&_bbs);
902 Block *b = _blocks[i];
1139 Block *b = _cfg._blocks[i];
1163 assert(n = _cfg._blocks[i], "expecting next block");
1188 Block *b = _cfg._blocks[i];
1370 _cfg._blocks.reset();
1485 cfg._blocks.push(b);