Searched refs:_bbs (Results 1 - 17 of 17) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dgcm.cpp69 _bbs.map(n->_idx, b);
78 Block* buse = _bbs[use->_idx];
82 _bbs.map(use->_idx, b); // Re-insert in this block
100 Block *pb = _bbs[in0->_idx]; // Block-projection already has basic block
130 if( n->pinned() && !_bbs.lookup(n->_idx) ) { // Pinned? Nail it down!
137 Block *b = _bbs[input->_idx]; // Basic block of controlling input
246 if (!_bbs.lookup(in->_idx)) { // Missing block selection?
268 _bbs.map(n->_idx, find_deepest_input(n, _bbs));
270 assert(_bbs[
765 Block_Array &_bbs; member in class:Node_Backward_Iterator
[all...]
H A Dlcm.cpp237 Block *cb = cfg->_bbs[mach->_idx];
262 Block *inb = cfg->_bbs[mach->in(j)->_idx];
272 Block *mb = cfg->_bbs[mach->_idx];
291 b = cfg->_bbs[b->pred(1)->_idx]; // Move up to predecessor block
304 cfg->_bbs[mach->_idx]->_dom_depth < cfg->_bbs[best->_idx]->_dom_depth ) {
319 Block *valb = cfg->_bbs[val->_idx];
324 cfg->_bbs.map(val->_idx,this);
330 cfg->_bbs[n->_idx]->find_remove(n);
332 cfg->_bbs
[all...]
H A Dblock.cpp367 _bbs(a),
389 _broot = _bbs[_root->_idx];
443 Block *bb = new (_bbs._arena) Block(_bbs._arena,p);
444 _bbs.map(p->_idx,bb);
445 _bbs.map(x->_idx,bb);
476 Block *pb = _bbs[x->_idx];
478 if( !_bbs.lookup(proj->_idx) ) {
481 _bbs.map(proj->_idx,pb);
485 pb->_succs.map(pb->_num_succs++, _bbs[n
[all...]
H A Dcoalesce.cpp139 Block *bcon = _cfg._bbs[con->_idx];
149 _cfg._bbs.map( kills->_idx, b );
203 tty->print("B%d ", _phc._cfg._bbs[b->pred(j)->_idx]->_pre_order);
350 _phc._cfg._bbs.map( tmp->_idx, b );
423 Block *pred = _phc._cfg._bbs[b->pred(j)->_idx];
442 _phc._cfg._bbs.map( copy->_idx, pred );
479 _phc._cfg._bbs.map( copy->_idx, b );
485 if( b->_freq < OPTO_DEBUG_SPLIT_FREQ || b->is_uncommon(_phc._cfg._bbs) ) {
523 _phc._cfg._bbs.map( copy->_idx, b );
569 while( _phc._cfg._bbs[b
[all...]
H A Doutput.hpp100 Block_Array& _bbs; member in class:Scheduling
H A Dreg_split.cpp135 _cfg._bbs.map(spill->_idx,b); // Update node->block mapping to reflect
222 Block *b = _cfg._bbs[use->_idx];
273 b = _cfg._bbs[b->pred(useidx)->_idx];
334 Block *b_def = _cfg._bbs[def->_idx];
578 Block *pred1 = _cfg._bbs[b->pred(1)->_idx];
590 pred = _cfg._bbs[n1->_idx];
605 pred = _cfg._bbs[n2->_idx];
690 pred = _cfg._bbs[n1->_idx];
899 _cfg._bbs.map(def->_idx,b);
1271 Block *b = _cfg._bbs[ph
[all...]
H A Dlive.cpp104 if( _cfg._bbs[nkidx] != b ) {
124 Block *p = _cfg._bbs[b->pred(l)->_idx];
146 add_liveout( _cfg._bbs[b->pred(l)->_idx], delta, first_pass );
H A Dpostaloc.cpp81 Block *oldb = _cfg._bbs[old->_idx];
85 _cfg._bbs.map(old->_idx,NULL);
431 Block *pb = _cfg._bbs[b->pred(j)->_idx];
476 freed = _cfg._bbs[b->pred(1)->_idx];
486 Block *pb = _cfg._bbs[b->pred(j)->_idx];
514 _cfg._bbs.map(phi->_idx,NULL);
H A Doutput.cpp72 Block_Array& bbs = _cfg->_bbs;
256 _cfg->_bbs.map( zap->_idx, b );
1254 b->dump_head(&_cfg->_bbs, &st);
1330 _cfg->_bbs.map( nop->_idx, b );
1415 _cfg->_bbs.map(nop->_idx, b);
1569 _cfg->_bbs.map( nop->_idx, b );
1758 _bbs(compile.cfg()->_bbs),
2106 if( _bbs[def->_idx] != bb ) // Ignore if not block-local
2302 // It's possible to have a BoxLock in the graph and in the _bbs mappin
[all...]
H A Dchaitin.cpp808 _cfg._bbs[n->in(k)->_idx]->_freq > 1000*b->_freq ) {
1554 Block *startb = _cfg._bbs[C->top()->_idx];
1556 _cfg._bbs.map( base->_idx, startb );
1563 _cfg._bbs[base->_idx] == _cfg._bbs[C->top()->_idx], "base NULL should be shared");
1599 Block *b = _cfg._bbs[derived->_idx];
1604 _cfg._bbs.map( base->_idx, b );
1660 Block *phi_block = _cfg._bbs[phi->_idx];
1661 if( _cfg._bbs[phi_block->pred(2)->_idx] == b ) {
1712 _cfg._bbs[bas
[all...]
H A Dblock.hpp374 assert(LCA == _bbs[load->_idx], "should already be scheduled");
384 Block_Array _bbs; // Map Nodes to owning Basic Block member in class:PhaseCFG
408 // basic blocks; i.e. _bbs now maps _idx for all Nodes to some Block.
454 // Insert a node into a block, and update the _bbs
457 _bbs.map( n->_idx, b );
H A DbuildOopMap.cpp430 worklist->push(cfg->_bbs[root->in(i)->_idx]);
541 worklist->push(cfg->_bbs[b->pred(l)->_idx]);
635 Block *p = _cfg->_bbs[b->pred(j)->_idx];
H A Difg.cpp577 _cfg._bbs.map(n->_idx,NULL);
629 && _cfg._bbs[n->unique_out()->_idx] == b ) {
H A Ddomgraph.cpp109 Block *b = _bbs[whead->in(j)->_idx];
H A DidealGraphPrinter.cpp417 Block *block = C->cfg()->_bbs[node->_idx];
H A Dcompile.cpp2223 b->dump_head( &_cfg->_bbs );
3457 Block* b = Compile::current()->cfg()->_bbs[n->_idx];
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp1154 c2_nonstatic_field(PhaseCFG, _bbs, Block_Array) \

Completed in 115 milliseconds