Searched refs:_blocks (Results 1 - 25 of 27) sorted by relevance

12

/openjdk7/hotspot/src/os/windows/vm/
H A Dchaitin_windows.cpp36 Block *block = _cfg._blocks[block_num];
61 Block *block = _cfg._blocks[block_num];
/openjdk7/hotspot/src/share/vm/opto/
H A DindexSet.cpp174 // Allocate a new BitBlock and put it into the position in the _blocks array
180 _blocks[bi] = block;
190 BitBlock *block = _blocks[i];
290 _blocks = _preallocated_block_list;
292 _blocks =
296 BitBlock *block = set->_blocks[i];
320 _blocks = _preallocated_block_list;
322 _blocks = (IndexSet::BitBlock**) arena()->Amalloc_4(sizeof(IndexSet::BitBlock**) * _max_blocks);
330 // Prepare an IndexSet for use. If it needs to allocate its _blocks array, it does
344 _blocks
[all...]
H A Dblock.cpp48 _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[
[all...]
H A DindexSet.hpp193 BitBlock **_blocks; member in class:IndexSet
236 return _blocks[get_block_index(element)];
245 _blocks[index] = block;
267 BitBlock *block = _blocks[i];
429 IndexSet::BitBlock **_blocks; member in class:VALUE_OBJ_CLASS_SPEC
H A Dblock.hpp52 Block **_blocks; member in class:Block_Array
60 _blocks = NEW_ARENA_ARRAY( a, Block *, OptoBlockListSize );
62 _blocks[i] = NULL;
66 { return (i<Max()) ? _blocks[i] : (Block*)NULL; }
68 { assert( i < Max(), "oob" ); return _blocks[i]; }
70 void map( uint i, Block *n ) { if( i>=Max() ) grow(i); _blocks[i] = n; }
81 Block *pop() { return _blocks[--_cnt]; }
82 Block *rpop() { Block *b = _blocks[0]; _blocks[0]=_blocks[
382 Block_List _blocks; // List of basic blocks member in class:PhaseCFG
[all...]
H A DidealGraphPrinter.cpp419 print_prop("block", C->cfg()->_blocks[0]->_pre_order);
640 for (uint i = 0; i < C->cfg()->_blocks.size(); i++) {
641 Block *b = C->cfg()->_blocks[i];
701 for (uint i = 0; i < C->cfg()->_blocks.size(); i++) {
702 Block *b = C->cfg()->_blocks[i];
H A Doutput.cpp73 Block *entry = _cfg->_blocks[1];
115 Block *b = _cfg->_blocks[i];
146 Block *bb = _cfg->_blocks[i];
224 Block *b = _cfg->_blocks[i];
311 Block *b = _cfg->_blocks[i];
323 !_cfg->_blocks[i+1]->has_loop_alignment() &&
326 nb = _cfg->_blocks[i];
370 Block *b = _cfg->_blocks[i];
448 Block *nb = _cfg->_blocks[i+1];
479 Block *b = _cfg->_blocks[
[all...]
H A Dgcm.cpp1351 if (!_blocks[i]->schedule_local(this, matcher, ready_cnt, visited)) {
1362 _blocks[i]->call_catch_cleanup(_bbs, C);
1368 _blocks[i]->dump();
1387 Block* root_blk = _blocks[0];
1425 Block* root_blk = _blocks[0];
1446 Block *b = _blocks[i];
1470 assert( _blocks[0] == _broot, "" );
1472 Block *b = _blocks[i];
1475 // Sanity check that the RPO numbering is reflected in the _blocks array.
1490 Block *b = _blocks[
[all...]
H A DbuildOopMap.cpp549 Block *b = cfg->_blocks[i];
565 worklist->push(cfg->_blocks[i]);
596 Block *entry = _cfg->_blocks[1];
H A Ddomgraph.cpp68 _blocks.map(_num_blocks,0);
96 _blocks._cnt = _num_blocks;
285 // Build a reverse post-order in the CFG _blocks array
288 _blocks.map(stack_top->_rpo, stack_top);
H A Dlive.cpp85 Block *b = _cfg._blocks[j-1];
282 Block *b = _cfg._blocks[i];
H A Dparse.hpp326 Block* _blocks; // Array of basic-block structs. member in class:Parse
327 int _block_count; // Number of elements in _blocks.
392 return &_blocks[rpo];
H A Dchaitin.cpp192 if( (j == NUMBUCKS-1) || (_cfg._blocks[i]->_freq > buckval[j]) ) {
194 buckets[j][buckcnt[j]++] = _cfg._blocks[i];
532 Block *b = _cfg._blocks[i];
559 Block *b = _cfg._blocks[i];
1455 Block *b = _cfg._blocks[i];
1640 Block *b = _cfg._blocks[i];
1855 dump(_cfg._blocks[i]);
2092 Block *b = _cfg._blocks[i];
2118 Block *b = _cfg._blocks[i];
H A Dcoalesce.cpp199 Block *b = _phc._cfg._blocks[i];
368 IndexSet *liveout = _phc._live->live(_phc._cfg._blocks[bidx]);
382 Block *b = _phc._cfg._blocks[i];
H A Difg.cpp332 Block *b = _cfg._blocks[i];
482 Block *b = _cfg._blocks[i];
H A Dreg_split.cpp550 b = _cfg._blocks[bidx];
1369 b = _cfg._blocks[bidx];
H A Dparse1.cpp397 debug_only(_blocks = (Block*)-1);
1111 _blocks = NEW_RESOURCE_ARRAY(Block, _block_count);
1112 Copy::zero_to_bytes(_blocks, sizeof(Block)*_block_count);
H A Dpostaloc.cpp415 Block *b = _cfg._blocks[i];
H A DphaseX.cpp1647 Block *block = _cfg._blocks[block_number];
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkFunction.hpp67 SharkTopLevelBlock** _blocks; member in class:SharkFunction
80 return _blocks[i];
H A DsharkFunction.cpp66 _blocks = NEW_RESOURCE_ARRAY(SharkTopLevelBlock*, block_count());
73 // _blocks[i] = new SharkTopLevelBlock(this, b);
74 _blocks[b->pre_order()] = new SharkTopLevelBlock(this, b);
/openjdk7/hotspot/src/share/vm/ci/
H A DciMethodBlocks.cpp56 _blocks->append(new_block);
90 _blocks->append(nb);
258 _blocks = new(_arena) GrowableArray<ciBlock *>(_arena, block_estimate, 0, NULL);
265 _blocks->append(b);
330 for (int i = 0; i < _blocks->length(); i++)
331 _blocks->at(i)->clear_processed();
339 for (int i = 0; i < _blocks->length(); i++) {
340 tty->print(" B%d: ", i); _blocks->at(i)->dump();
H A DciMethodBlocks.hpp41 GrowableArray<ciBlock *> *_blocks; member in class:ciMethodBlocks
51 ciBlock *block(int index) { return _blocks->at(index); }
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_IR.cpp1173 BlockList* _blocks; member in class:PredecessorValidator
1183 _blocks = new BlockList();
1188 assert(hir->code()->length() == _blocks->length(), "must match");
1189 for (i = 0; i < _blocks->length(); i++) {
1190 assert(hir->code()->contains(_blocks->at(i)), "should be in both lists");
1194 for (i = 0; i < _blocks->length(); i++) {
1195 BlockBegin* block = _blocks->at(i);
1221 _blocks->append(block);
H A Dc1_GraphBuilder.cpp46 BlockList _blocks; // internal list of all blocks member in class:VALUE_OBJ_CLASS_SPEC
98 , _blocks(16)
155 _blocks.append(block);
359 _next_block_number = _blocks.length();
453 _blocks.sort(compare_depth_first);
455 for (int i = 0; i < _blocks.length(); i++) {
456 BlockBegin* cur = _blocks.at(i);

Completed in 114 milliseconds

12