Cross Reference: /openjdk7/hotspot/src/share/vm/opto/coalesce.cpp

Lines Matching refs:_phc
190   uint r = _phc.Find(n);
197   for( uint i=0; i<_phc._cfg._num_blocks; i++ ) {
199     Block *b = _phc._cfg._blocks[i];
203       tty->print("B%d ", _phc._cfg._bbs[b->pred(j)->_idx]->_pre_order);
239   uint lr1 = _phc.Find(n1);
240   uint lr2 = _phc.Find(n2);
242       !_phc._ifg->test_edge_sq( lr1, lr2 ) ) {  // Do not interfere
243     LRG *lrg1 = &_phc.lrgs(lr1);
244     LRG *lrg2 = &_phc.lrgs(lr2);
267       _phc.Union( n1, n2 );
271       _phc._ifg->Union( lr1, lr2 );
284   for( uint i=0; i<_phc._cfg._num_blocks; i++ )
285     coalesce( _phc._blks[i] );
316     if( idx && _phc.Find(n->in(idx)) == dst_name ) break;
333     if( _phc.Find(n) == src_name ) {
344     _phc.new_lrg(tmp,_phc._maxlrg++);
350     _phc._cfg._bbs.map( tmp->_idx, b );
362   _phc.compress_uf_map_for_nodes();
364   for(uint lrg = 1; lrg < _phc._maxlrg; lrg++ ) {
365     uint compressed_lrg = _phc.Find(lrg);
367       for( uint bidx = 0; bidx < _phc._cfg._num_blocks; bidx++ ) {
368         IndexSet *liveout = _phc._live->live(_phc._cfg._blocks[bidx]);
381   for( uint i=0; i<_phc._cfg._num_blocks; i++ ) {
382     Block *b = _phc._cfg._blocks[i];
395           if( _phc.Find(copy) == _phc.Find(def) )
404         if( _phc.Find(n) == _phc.Find(def) ) {
415         uint phi_name = _phc.Find( n );
421           uint src_name = _phc.Find(m);
423             Block *pred = _phc._cfg._bbs[b->pred(j)->_idx];
433               _phc.clone_projs( pred, pred->end_idx(), m, copy, _phc._maxlrg );
442             _phc._cfg._bbs.map( copy->_idx, pred );
444             _phc._names.extend( copy->_idx, phi_name );
453           uint name = _phc.Find( n );
457           if( _phc.Find(m) != name ) {
467               if( _phc.clone_projs( b, l, m, copy, _phc._maxlrg ) )
478             _phc._names.extend( copy->_idx, name );
479             _phc._cfg._bbs.map( copy->_idx, b );
485         if( b->_freq < OPTO_DEBUG_SPLIT_FREQ || b->is_uncommon(_phc._cfg._bbs) ) {
495             uint nidx = _phc.n2lidx(inp);
499             if( lrg._maxfreq >= _phc.high_frequency_lrg() ) {
510                 if( _phc._live->live(b->_succs[k])->member( nidx ) )
522               _phc.new_lrg( copy, _phc._maxlrg++ );
523               _phc._cfg._bbs.map( copy->_idx, b );
569     while( _phc._cfg._bbs[bs->pred(j)->_idx] != b ) j++;
596   _ulr.initialize(_phc._maxlrg);
602   _phc.set_was_low();
610   _phc.Union( lr1_node, lr2_node );
633   // _phc.free_spillcopy(b->_nodes[bindex]);
642   Block *b2 = _phc._cfg._bbs[src_copy->_idx];
644     b = _phc._cfg._bbs[b->pred(1)->_idx];
645     _phc._live->live(b)->insert(lr1);
664       b2 = _phc._cfg._bbs[b2->pred(1)->_idx];
676       uint lidx = _phc.Find(x);
721       if( _phc._ifg->neighbors(neighbor)->remove(lr1) )
730     if( _phc._ifg->neighbors(neighbor)->remove(lr2) )
737     if( _phc._ifg->neighbors(neighbor)->insert(lr1) )
759   uint lr1 = _phc.Find(dst_copy);
760   uint lr2 = _phc.Find(src_def );
766   if( _phc._ifg->test_edge_sq( lr1, lr2 ) ) return false;
794     Block *dst_b = _phc._cfg._bbs[dst_copy->_idx];
795     Block *src_def_b = _phc._cfg._bbs[src_def->_idx];
808     Block *src_b = _phc._cfg._bbs[src_copy->_idx];
812         _phc._lost_opp_cflow_coalesce++;
816         //record_bias( _phc._lrgs, lr1, lr2 );
819       b2 = _phc._cfg._bbs[b2->pred(1)->_idx];
824   uint reg_degree = _ulr.lrg_union( lr1, lr2, rm_size, _phc._ifg, rm );
827     record_bias( _phc._ifg, lr1, lr2 );
839       record_bias( _phc._ifg, lr1, lr2 );
850   IndexSet *n_lr1 = _phc._ifg->neighbors(lr1);
851   IndexSet *n_lr2 = _phc._ifg->neighbors(lr2);
877   lrgs(lr1).set_degree( _phc._ifg->effective_degree(lr1) );
896   //_phc._ifg->verify( &_phc );
904   if( b->is_uncommon(_phc._cfg._bbs) )