Searched refs:_num_blocks (Results 1 - 23 of 23) 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++) {
60 for (uint block_num=1; block_num<_cfg._num_blocks; block_num++) {
/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.cpp56 _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-- ) {
156 for( i=0; i<_cfg._num_blocks; i++ ) {
281 for( uint i = 0; i < _cfg._num_blocks;
[all...]
H A Ddomgraph.cpp68 _blocks.map(_num_blocks,0);
73 Tarjan *tarjan = NEW_RESOURCE_ARRAY(Tarjan,_num_blocks+1);
77 _rpo_ctr = _num_blocks;
79 if( dfsnum-1 != _num_blocks ) {// Check for unreachable loops!
96 _blocks._cnt = _num_blocks;
103 for( i=_num_blocks; i>=2; i-- ) { // For all vertices in DFS order
133 for( i=2; i <= _num_blocks; i++ ) {
145 for( i=1; i<=_num_blocks;i++){// For all Tarjan vertices
155 w->setdepth( _num_blocks+1 ); // Set depth in dominator tree
267 // Allocate stack of size _num_blocks
[all...]
H A Dblock.cpp388 _num_blocks = build_cfg();
499 assert(block_no < _num_blocks, "illegal block number");
536 _num_blocks++;
610 while( bx_index < _num_blocks && _blocks[bx_index] != bx ) bx_index++;
651 uint last = _num_blocks;
667 uint last = _num_blocks;
699 last = _num_blocks;
717 for (uint i=0; i < _num_blocks; i++) {
723 assert((i+1) == _num_blocks || _blocks[i+1]->is_connector(),
730 Block *bnext = (i < _num_blocks
[all...]
H A DbuildOopMap.cpp418 int *live = NEW_ARENA_ARRAY(A, int, (cfg->_num_blocks+1) * max_reg_ints);
419 int *tmp_live = &live[cfg->_num_blocks * max_reg_ints];
427 memset( live, 0, cfg->_num_blocks * (max_reg_ints<<LogBytesPerInt) );
548 for( i=1; i<cfg->_num_blocks; i++ ) {
557 if( i == cfg->_num_blocks )
564 for( i=1; i<cfg->_num_blocks; i++ )
591 OopFlow **flows = NEW_ARENA_ARRAY(A, OopFlow*, _cfg->_num_blocks);
592 memset( flows, 0, _cfg->_num_blocks*sizeof(OopFlow*) );
H A Dpostaloc.cpp401 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++ ) {
H A Dchaitin.cpp173 _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++ ) {
207 assert(blkcnt == _cfg._num_blocks, "Block array not totally filled");
531 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
558 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
1454 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
1639 for( uint i=0; i<_cfg._num_blocks; i++ ) {
1854 for( uint i = 0; i < _cfg._num_blocks;
[all...]
H A Dcoalesce.cpp197 for( uint i=0; i<_phc._cfg._num_blocks; i++ ) {
284 for( uint i=0; i<_phc._cfg._num_blocks; i++ )
367 for( uint bidx = 0; bidx < _phc._cfg._num_blocks; bidx++ ) {
381 for( uint i=0; i<_phc._cfg._num_blocks; i++ ) {
H A Dgcm.cpp1350 for (i = 0; i < _num_blocks; i++) {
1361 for( i=0; i < _num_blocks; i++ )
1367 for (uint i = 0; i < _num_blocks; i++) {
1445 for (uint i = 0; i < _num_blocks; i++ ) {
1471 for (uint i = 0; i < _num_blocks; i++ ) {
1489 for(uint i = _num_blocks - 1; i > 0; i-- ) { // skip Root block
1527 for (uint i = 0; i < _num_blocks; i++) {
H A Doutput.cpp114 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
131 uint* blk_starts = NEW_RESOURCE_ARRAY(uint,_cfg->_num_blocks+1);
144 for (uint i = 0; i < _cfg->_num_blocks; i++) {
223 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
309 uint last_block = _cfg->_num_blocks-1;
343 uint nblocks = _cfg->_num_blocks;
1105 for (uint i = 0; i < _cfg->_num_blocks; i++) {
1192 uint nblocks = _cfg->_num_blocks;
1672 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
2419 for( int i=_cfg->_num_blocks
[all...]
H A Dreg_split.cpp518 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++ ) {
1368 for( bidx = 0; bidx < _cfg._num_blocks; bidx++ ) {
H A Difg.cpp331 for( uint i=0; i<_cfg._num_blocks; i++ ) {
481 for( uint i = 0; i < _cfg._num_blocks; i++ ) {
H A Dblock.hpp381 uint _num_blocks; // Count of basic blocks member in class:PhaseCFG
H A DphaseX.cpp1646 for( uint block_number = 1; block_number < _cfg._num_blocks; ++block_number ) {
H A Dcompile.cpp2214 for( uint i=0; i<_cfg->_num_blocks; i++ ) {
/openjdk7/hotspot/src/share/vm/ci/
H A DciMethodBlocks.hpp43 int _num_blocks; member in class:ciMethodBlocks
55 int num_blocks() { return _num_blocks;}
H A DciMethodBlocks.cpp55 ciBlock *new_block = new(_arena) ciBlock(_method, _num_blocks++, former_block->start_bci());
89 ciBlock *nb = new(_arena) ciBlock(_method, _num_blocks++, bci);
255 _arena(arena), _num_blocks(0), _code_size(meth->code_size()) {
264 ciBlock *b = new(arena) ciBlock(_method, _num_blocks++, 0);
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_IR.cpp419 int _num_blocks; // total number of blocks (smaller than _max_block_id) member in class:ComputeLinearScanOrder
489 _num_blocks(0),
512 md->set_compilation_stats(_num_loops, _num_blocks);
572 _num_blocks++;
845 _linear_scan_order = new BlockList(_num_blocks);
1013 assert(_linear_scan_order->length() == _num_blocks, "wrong number of blocks in list");
1072 while (block_idx < _num_blocks && !is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx))) {
1076 while (block_idx < _num_blocks && is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx))) {
1080 while (block_idx < _num_blocks) {
/openjdk7/hotspot/src/share/vm/oops/
H A DmethodDataOop.hpp1240 short _num_blocks;
1381 int num_blocks() const { return _num_blocks; }
1382 void set_num_blocks(int n) { _num_blocks = n; }
H A DmethodDataOop.cpp759 _num_blocks = 0;
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp2613 _num_blocks[i] = 0;
2679 size_t multiple = _num_blocks[word_sz]/(CMSOldPLABToleranceFactor*CMSOldPLABNumRefills*n_blks);
2686 _num_blocks[word_sz] += fl->count();
2725 assert(_num_blocks[i] >= (size_t)_indexedFreeList[i].count(),
2727 if (_num_blocks[i] > 0) {
2729 assert(_num_blocks[i] > num_retire, "Should have used at least one");
2735 _global_num_blocks[i] += (_num_blocks[i] - num_retire);
2747 tid, i, num_retire, _num_blocks[i], (size_t)_blocks_to_claim[i].average());
2750 _num_blocks[i] = 0;
H A DcompactibleFreeListSpace.hpp635 size_t _num_blocks [CompactibleFreeListSpace::IndexSetSize]; member in class:CFLS_LAB
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp1152 c2_nonstatic_field(PhaseCFG, _num_blocks, uint) \

Completed in 145 milliseconds