Searched refs:IndexSet (Results 1 - 11 of 11) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.hpp39 class IndexSet;
46 IndexSet *_live;
50 IndexSet *_defs;
53 IndexSet **_deltas;
54 IndexSet *_free_IndexSet; // Free list of same
63 IndexSet *getset( Block *p );
64 IndexSet *getfreeset( );
67 void add_liveout( Block *p, IndexSet *lo, VectorSet &first_pass );
78 IndexSet *live( const Block * b ) { return &_live[b->_pre_order-1]; }
H A DindexSet.cpp32 // This file defines the IndexSet class, a set of sparse integer indices.
38 IndexSet::BitBlock IndexSet::_empty_block = IndexSet::BitBlock();
42 julong IndexSet::_alloc_new = 0;
43 julong IndexSet::_alloc_total = 0;
45 julong IndexSet::_total_bits = 0;
46 julong IndexSet::_total_used_blocks = 0;
47 julong IndexSet::_total_unused_blocks = 0;
50 int IndexSet
280 IndexSet::IndexSet (IndexSet *set) { function in class:IndexSet
[all...]
H A DindexSet.hpp33 // This file defines the IndexSet class, a set of sparse integer indices.
37 //-------------------------------- class IndexSet ----------------------------
38 // An IndexSet is a piece-wise bitvector. At the top level, we have an array
43 class IndexSet : public ResourceObj { class in inherits:ResourceObj
47 // When we allocate an IndexSet, it starts off with an array of top level block
55 // Elements of a IndexSet get decomposed into three fields. The highest order
98 friend class IndexSet;
102 // access to IndexSet and IndexSetIterator.
105 // is not in use by any IndexSet, it is stored on a free list. The next field
106 // is used by IndexSet t
328 IndexSet() {} function in class:IndexSet
[all...]
H A Dlive.cpp56 _live = (IndexSet*)_arena->Amalloc(sizeof(IndexSet)*_cfg._num_blocks);
68 _defs = NEW_RESOURCE_ARRAY(IndexSet,_cfg._num_blocks);
74 _deltas = NEW_RESOURCE_ARRAY(IndexSet*,_cfg._num_blocks);
75 memset( _deltas, 0, sizeof(IndexSet*)* _cfg._num_blocks);
88 IndexSet *use = getset( b );
89 IndexSet *def = &_defs[b->_pre_order-1];
90 DEBUG_ONLY(IndexSet *def_outside = getfreeset();)
141 IndexSet *delta = getset(b);
154 // This allows us to recycle their internal memory into IndexSet'
[all...]
H A Dcoalesce.hpp96 IndexSet _ulr; // Union live range interferences
113 void update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2);
H A Dchaitin.hpp229 IndexSet *_adjs;
253 void add_vector( uint a, IndexSet *vec );
270 IndexSet *remove_node( uint a );
274 IndexSet *neighbors( uint a ) const { return &_adjs[a]; }
419 void interfere_with_live( uint reg, IndexSet *live );
421 uint count_int_pressure( IndexSet *liveout );
422 uint count_float_pressure( IndexSet *liveout );
H A Difg.cpp53 _adjs = (IndexSet*)_arena->Amalloc(sizeof(IndexSet)*maxlrg);
78 void PhaseIFG::add_vector( uint a, IndexSet *vec ) {
81 IndexSet *adjs_a = &_adjs[a];
139 IndexSet *A = &_adjs[a];
154 IndexSet *PhaseIFG::remove_node( uint a ) {
211 IndexSet *s = neighbors(lidx);
286 IndexSet *set = &_adjs[i];
308 void PhaseChaitin::interfere_with_live( uint r, IndexSet *liveout ) {
333 IndexSet *liveou
[all...]
H A Dcoalesce.cpp368 IndexSet *liveout = _phc._live->live(_phc._cfg._blocks[bidx]);
712 void PhaseConservativeCoalesce::update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2) {
850 IndexSet *n_lr1 = _phc._ifg->neighbors(lr1);
851 IndexSet *n_lr2 = _phc._ifg->neighbors(lr2);
H A Dchaitin.cpp260 IndexSet::reset_memory(C, &live_arena);
278 IndexSet::reset_memory(C, &live_arena);
312 IndexSet::reset_memory(C, &live_arena);
342 IndexSet::reset_memory(C, &live_arena);
406 IndexSet::reset_memory(C, &live_arena);
895 IndexSet *s = _ifg->neighbors(i);
971 IndexSet *adj = _ifg->remove_node( lo );
1029 IndexSet *adj = _ifg->remove_node( lo );
1284 IndexSet *s = _ifg->neighbors(lidx);
1643 IndexSet liveou
[all...]
H A Dreg_split.cpp1230 IndexSet *liveout = _live->live(b);
/openjdk7/hotspot/src/share/vm/runtime/
H A Djava.cpp280 IndexSet::print_statistics();

Completed in 51 milliseconds