Searched refs:_cfg (Results 1 - 20 of 20) sorted by relevance

/openjdk7/hotspot/src/os/windows/vm/
H A Dchaitin_windows.cpp35 for (uint block_num=1; block_num<_cfg._num_blocks; block_num++) {
36 Block *block = _cfg._blocks[block_num];
60 for (uint block_num=1; block_num<_cfg._num_blocks; block_num++) {
61 Block *block = _cfg._blocks[block_num];
/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.cpp47 PhaseLive::PhaseLive( const PhaseCFG &cfg, LRG_List &names, Arena *arena ) : Phase(LIVE), _cfg(cfg), _names(names), _arena(arena), _live(0) {
56 _live = (IndexSet*)_arena->Amalloc(sizeof(IndexSet)*_cfg._num_blocks);
58 for( i=0; i<_cfg._num_blocks; i++ ) {
68 _defs = NEW_RESOURCE_ARRAY(IndexSet,_cfg._num_blocks);
69 for( i=0; i<_cfg._num_blocks; i++ ) {
74 _deltas = NEW_RESOURCE_ARRAY(IndexSet*,_cfg._num_blocks);
75 memset( _deltas, 0, sizeof(IndexSet*)* _cfg._num_blocks);
83 uint iters = _cfg._num_blocks; // stat counters
84 for( uint j=_cfg._num_blocks; j>0; j-- ) {
85 Block *b = _cfg
[all...]
H A Doutput.cpp62 assert( _cfg->_broot->_nodes.size() == 0, "" );
72 Block_Array& bbs = _cfg->_bbs;
73 Block *entry = _cfg->_blocks[1];
74 Block *broot = _cfg->_broot;
89 _cfg->insert( broot, 0, new (this) MachBreakpointNode() );
94 _cfg->insert( broot, 0, new (this) MachUEPNode() );
110 _cfg->insert( entry, 1, new (this) MachBreakpointNode() );
114 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
115 Block *b = _cfg->_blocks[i];
116 if( !b->is_connector() && b->non_connector_successor(0) == _cfg
[all...]
H A Dcoalesce.cpp139 Block *bcon = _cfg._bbs[con->_idx];
149 _cfg._bbs.map( kills->_idx, b );
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);
284 for( uint i=0; i<_phc._cfg._num_blocks; i++ )
350 _phc._cfg._bbs.map( tmp->_idx, b );
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
[all...]
H A Dlive.hpp58 const PhaseCFG &_cfg; // Basic blocks member in class:PhaseLive
H A Dchaitin.cpp169 _high_frequency_lrg = MIN2(float(OPTO_LRG_HIGH_FREQ), _cfg._outer_loop_freq);
173 _blks = NEW_RESOURCE_ARRAY( Block *, _cfg._num_blocks );
180 buckets[i] = NEW_RESOURCE_ARRAY( Block *, _cfg._num_blocks );
185 for( j = 0; j < _cfg._num_blocks; j++ ) {
190 for( i = 0; i < _cfg._num_blocks; i++ ) {
192 if( (j == NUMBUCKS-1) || (_cfg._blocks[i]->_freq > buckval[j]) ) {
194 buckets[j][buckcnt[j]++] = _cfg._blocks[i];
207 assert(blkcnt == _cfg._num_blocks, "Block array not totally filled");
234 PhaseLive live(_cfg,_names,&live_arena);
531 for( uint i = 0; i < _cfg
[all...]
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];
518 Node ***Reaches = NEW_SPLIT_ARRAY( Node**, _cfg._num_blocks+1 );
519 bool **UP = NEW_SPLIT_ARRAY( bool*, _cfg._num_blocks+1 );
524 for( bidx = 0; bidx < _cfg._num_blocks+1; bidx++ ) {
544 for( bidx = 0; bidx < _cfg._num_blocks; bidx++ ) {
550 b = _cfg._blocks[bidx];
578 Block *pred1 = _cfg
[all...]
H A Dpostaloc.cpp81 Block *oldb = _cfg._bbs[old->_idx];
85 _cfg._bbs.map(old->_idx,NULL);
401 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg._num_blocks+1);
402 memset( blk2value, 0, sizeof(Node_List*)*(_cfg._num_blocks+1) );
405 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg._num_blocks+1);
406 memset( blk2regnd, 0, sizeof(Node_List*)*(_cfg._num_blocks+1) );
413 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
415 Block *b = _cfg._blocks[i];
431 Block *pb = _cfg._bbs[b->pred(j)->_idx];
476 freed = _cfg
[all...]
H A Dblock.cpp1138 for (i = 0; i < _cfg._num_blocks; i++) {
1139 Block *b = _cfg._blocks[i];
1163 assert(n = _cfg._blocks[i], "expecting next block");
1187 for (i++; i < _cfg._num_blocks; i++) {
1188 Block *b = _cfg._blocks[i];
1326 if (src_trace != trace(_cfg._broot)) {
1335 if (targ_trace != trace(_cfg._broot)) {
1363 Trace *tr = trace(_cfg._broot);
1370 _cfg._blocks.reset();
1371 _cfg
[all...]
H A DbuildOopMap.cpp587 do_liveness( _regalloc, _cfg, &worklist, max_reg_ints, A, safehash );
591 OopFlow **flows = NEW_ARENA_ARRAY(A, OopFlow*, _cfg->_num_blocks);
592 memset( flows, 0, _cfg->_num_blocks*sizeof(OopFlow*) );
596 Block *entry = _cfg->_blocks[1];
622 if( b == _cfg->_broot ) continue;
635 Block *p = _cfg->_bbs[b->pred(j)->_idx];
H A Doutput.hpp85 PhaseCFG *_cfg; member in class:Scheduling
H A Dregalloc.cpp40 Phase(Register_Allocation), _cfg(cfg), _matcher(matcher),
H A Dregalloc.hpp56 PhaseCFG &_cfg; // Control flow graph member in class:PhaseRegAlloc
H A Difg.cpp331 for( uint i=0; i<_cfg._num_blocks; i++ ) {
332 Block *b = _cfg._blocks[i];
481 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
482 Block *b = _cfg._blocks[i];
577 _cfg._bbs.map(n->_idx,NULL);
629 && _cfg._bbs[n->unique_out()->_idx] == b ) {
H A DphaseX.hpp557 PhaseCFG &_cfg; member in class:NodeHash::PhasePeephole
H A Dcompile.hpp432 PhaseCFG* _cfg; // Results of CFG finding member in class:Compile
859 PhaseCFG* cfg() { return _cfg; }
H A DphaseX.cpp1624 : PhaseTransform(Peephole), _regalloc(regalloc), _cfg(cfg) {
1646 for( uint block_number = 1; block_number < _cfg._num_blocks; ++block_number ) {
1647 Block *block = _cfg._blocks[block_number];
H A Dblock.hpp715 PhaseCFG &_cfg; // Control flow graph member in class:PhaseBlockLayout
H A Dcompile.cpp1003 _cfg = NULL; // filled in later
2120 _cfg = &cfg;
2194 _cfg = (PhaseCFG*)0xdeadbeef;
2214 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
2216 Block *b = _cfg->_blocks[i];
2223 b->dump_head( &_cfg->_bbs );
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp1100 c2_nonstatic_field(Compile, _cfg, PhaseCFG*) \

Completed in 105 milliseconds