/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegionSeq.hpp | 66 uint _length; 75 uint _region_shift; 79 uint _next_search_index; 82 uint _allocated_length; 85 uint _max_length; 89 uint find_contiguous_from(uint from, uint num); 95 void increment_length(uint* length) { 100 void decrement_length(uint* lengt [all...] |
H A D | collectionSetChooser.hpp | 39 uint regions_length() { return (uint) _regions.length(); } 40 HeapRegion* regions_at(uint i) { return _regions.at((int) i); } 41 void regions_at_put(uint i, HeapRegion* hr) { 44 void regions_at_put_grow(uint i, HeapRegion* hr) { 47 void regions_trunc_to(uint i) { _regions.trunc_to((uint) i); } 51 uint _curr_index; 56 uint _length; 60 uint _first_par_unreserved_id [all...] |
H A D | evacuationInfo.hpp | 31 uint _collectionset_regions; 32 uint _allocation_regions; 37 uint _regions_freed; 44 void set_collectionset_regions(uint collectionset_regions) { 48 void set_allocation_regions(uint allocation_regions) { 68 void set_regions_freed(uint freed) { 72 uint collectionset_regions() { return _collectionset_regions; } 73 uint allocation_regions() { return _allocation_regions; } 78 uint regions_freed() { return _regions_freed; }
|
H A D | g1CollectorPolicy.hpp | 133 uint _min_desired_young_length; 134 uint _max_desired_young_length; 136 uint calculate_default_min_length(uint new_number_of_heap_regions); 137 uint calculate_default_max_length(uint new_number_of_heap_regions); 141 void heap_size_changed(uint new_number_of_heap_regions); 142 uint min_desired_young_length() { 145 uint max_desired_young_length() { 180 uint _cur_collection_pause_used_regions_at_star [all...] |
H A D | heapRegionSeq.cpp | 34 uint HeapRegionSeq::find_contiguous_from(uint from, uint num) { 35 uint len = length(); 40 uint curr = from; 41 uint first = G1_NULL_HRS_INDEX; 42 uint num_so_far = 0; 62 for (uint i = first; i < first + num; ++i) { 75 uint max_length) { 107 uint inde [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | chaitin.hpp | 67 uint _risk_bias; // Index of LRG which we want to avoid color 68 uint _copy_bias; // Index of LRG which we want to share color 70 uint _next; // Index of next LRG in linked list 71 uint _prev; // Index of prev LRG in linked list 73 uint _reg; // Chosen register; undefined if mask is plural 81 uint _eff_degree; // Effective degree: Sum of neighbors _num_regs 86 void set_degree( uint degree ) { _eff_degree = degree; debug_only(_degree_valid = 1;) } 90 void inc_degree( uint mod ) { _eff_degree += mod; } 96 uint _mask_size; // cache of _mask.Size(); 159 uint _is_oo [all...] |
H A D | coalesce.hpp | 57 LRG &lrgs( uint lidx ) { return _phc.lrgs(lidx); } 72 uint _unique; 86 void insert_copy_with_overlap( Block *b, Node *copy, uint dst_name, uint src_name ); 107 bool copy_copy( Node *dst_copy, Node *src_copy, Block *b, uint bindex ); 109 void union_helper( Node *lr1_node, Node *lr2_node, uint lr1, uint lr2, Node *src_def, Node *dst_copy, Node *src_copy, Block *b, uint bindex ); 111 uint compute_separating_interferences(Node *dst_copy, Node *src_copy, Block *b, uint binde [all...] |
H A D | indexSet.hpp | 83 static uint get_block_index(uint element) { 86 static uint get_word_index(uint element) { 89 static uint get_bit_index(uint element) { 126 bool member(uint element) { 127 uint word_index = IndexSet::get_word_index(element); 128 uint bit_index = IndexSet::get_bit_index(element); 133 bool insert(uint elemen [all...] |
H A D | multnode.hpp | 38 MultiNode( uint required ) : Node(required) { 44 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash 48 virtual uint ideal_reg() const { return NotAMachineReg; } 49 ProjNode* proj_out(uint which_proj) const; // Get a named projection 59 virtual uint hash() const; 60 virtual uint cmp( const Node &n ) const; 61 virtual uint size_of() const; 65 ProjNode( Node *src, uint con, bool io_use = false ) 74 const uint _con; // The field in the tuple we are projecting 84 virtual uint ideal_re [all...] |
H A D | block.hpp | 49 uint _size; // allocated size, as opposed to formal limit 50 debug_only(uint _limit;) // limit to formal domain 53 void grow( uint i ); // Grow array node to fit 65 Block *lookup( uint i ) const // Lookup, or NULL for not mapped 67 Block *operator[] ( uint i ) const // Lookup, or assert for not mapped 70 void map( uint i, Block *n ) { if( i>=Max() ) grow(i); _blocks[i] = n; } 71 uint Max() const { debug_only(return _limit); return _size; } 78 uint _cnt; 83 void remove( uint i ); 84 void insert( uint [all...] |
H A D | output.hpp | 91 uint _node_bundling_limit; 122 uint _bb_start, _bb_end; 137 uint _bundle_instr_count; 140 uint _bundle_cycle_number; 156 void step(uint i); 217 uint _branches, _unconditional_delays; 219 static uint _total_nop_size, _total_method_size; 220 static uint _total_branches, _total_unconditional_delays; 221 static uint _total_instructions_per_bundle[Pipeline::_max_instrs_per_cycle+1]; 226 static void increment_instructions_per_bundle(uint [all...] |
H A D | callnode.hpp | 64 virtual uint cmp( const Node &n ) const; 65 virtual uint size_of() const; // Size is bigger 79 virtual void calling_convention( BasicType* sig_bt, VMRegPair *parm_reg, uint length ) const; 80 virtual const RegMask &in_RegMask(uint) const; 82 virtual uint ideal_reg() const { return 0; } 103 ParmNode( StartNode *src, uint con ) : ProjNode(src,con) { 108 virtual uint ideal_reg() const; 119 ReturnNode( uint edges, Node *cntrl, Node *i_o, Node *memory, Node *retadr, Node *frameptr ); 122 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash 126 virtual uint ideal_re [all...] |
H A D | phaseX.hpp | 56 uint _max; // Size of table (power of 2) 57 uint _inserts; // For grow and debug, count of hash_inserts 58 uint _insert_limit; // 'grow' when _inserts reaches _insert_limit 63 NodeHash(uint est_max_size); 64 NodeHash(Arena *arena, uint est_max_size); 80 static uint round_up(uint); // Round up to nearest power of 2 83 uint insert_limit() const { return _max - (_max>>2); } 87 uint size() const { return _max; } 89 Node *at(uint table_inde [all...] |
H A D | live.hpp | 60 uint _maxlrg; // Largest live-range number 66 void add_liveout( Block *p, uint r, VectorSet &first_pass ); 73 void compute(uint maxlrg); 82 void stats(uint iters) const;
|
H A D | rootnode.hpp | 61 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash 65 virtual uint ideal_reg() const { return NotAMachineReg; } 66 virtual uint match_edge(uint idx) const { return 0; }
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | workgroup.hpp | 71 virtual void work(uint worker_id) = 0; 152 uint _total_workers; 163 uint _started_workers; 165 uint _finished_workers; 171 uint total_workers() const { 174 virtual uint active_workers() const { 189 uint started_workers() const { 192 uint finished_workers() const { 206 GangWorker* gang_worker(uint i) const; 258 WorkGang(const char* name, uint worker [all...] |
H A D | taskqueue.hpp | 142 volatile uint _bottom; 186 static uint increment_index(uint ind) { 189 static uint decrement_index(uint ind) { 195 uint dirty_size(uint bot, uint top) const { 200 uint size(uint bo [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | gcTaskThread.hpp | 42 const uint _processor_id; // Which processor the worker is on. 45 uint _time_stamp_index; 47 GCTaskTimeStamp* time_stamp_at(uint index); 54 uint which, 55 uint processor_id) { 77 GCTaskThread(GCTaskManager* manager, uint which, uint processor_id); 84 uint which() const { 87 uint processor_id() const {
|
H A D | pcTasks.hpp | 78 virtual void do_it(GCTaskManager* manager, uint which); 110 virtual void do_it(GCTaskManager* manager, uint which); 122 uint _work_id; 124 RefProcTaskProxy(ProcessTask & rp_task, uint work_id) 132 virtual void do_it(GCTaskManager* manager, uint which); 146 uint _work_id; 149 RefEnqueueTaskProxy(EnqueueTask& enq_task, uint work_id) 155 virtual void do_it(GCTaskManager* manager, uint which) 193 virtual void do_it(GCTaskManager* manager, uint which); 211 virtual void do_it(GCTaskManager* manager, uint whic [all...] |
H A D | gcTaskManager.hpp | 76 const uint _affinity; // Which worker should run task. 83 virtual void do_it(GCTaskManager* manager, uint which) = 0; 88 uint affinity() const { 124 GCTask(uint affinity); 126 GCTask(Kind::kind kind, uint affinity); 145 uint _length; // The current length of the queue. 164 uint length() const { 175 GCTask* dequeue(uint affinity); 202 void set_length(uint value) { 260 GCTask* dequeue(uint affinit [all...] |
H A D | psTasks.hpp | 73 virtual void do_it(GCTaskManager* manager, uint which); 93 virtual void do_it(GCTaskManager* manager, uint which); 112 virtual void do_it(GCTaskManager* manager, uint which); 131 virtual void do_it(GCTaskManager* manager, uint which); 183 uint _stripe_number; 184 uint _stripe_total; 189 uint stripe_number, 190 uint stripe_total) : 198 virtual void do_it(GCTaskManager* manager, uint which);
|
/openjdk7/hotspot/src/share/vm/libadt/ |
H A D | vectset.hpp | 49 uint size; // Size of data IN LONGWORDS (32bits) 54 void grow(uint newsize); // Grow vector to required bitsize 65 Set &operator <<=(uint elem); // Add member to set 66 VectorSet operator << (uint elem) // Add member to new set 68 Set &operator >>=(uint elem); // Delete member from set 69 VectorSet operator >> (uint elem) // Delete member from new set 95 int operator [](uint elem) const; // Test for membership 96 uint getelem(void) const; // Return a random element 98 uint Size(void) const; // Number of elements in the Set. 110 uint word_siz [all...] |
H A D | vectset.cpp | 94 void VectorSet::grow( uint newsize ) 97 uint x = size; 106 Set &VectorSet::operator <<= (uint elem) 108 register uint word = elem >> 5; // Get the longword offset 119 Set &VectorSet::operator >>= (uint elem) 121 register uint word = elem >> 5; // Get the longword offset 137 for( uint i=0; i<size; i++) // For data in set 154 register uint cnt = ((size<s.size)?size:s.size); 157 for( uint i=0; i<cnt; i++) // Copy and OR the two sets 179 register uint cn [all...] |
H A D | set.hpp | 136 virtual Set &operator <<=(uint elem)=0; 137 // virtual Set operator << (uint elem); 140 virtual Set &operator >>=(uint elem)=0; 141 // virtual Set operator >> (uint elem); 144 virtual int operator [](uint elem) const=0; 172 virtual uint getelem(void) const=0; 178 virtual uint Size(void) const=0; 212 virtual class SetI_ *iterate(uint&) const=0; 234 virtual uint next(void)=0; 242 uint ele [all...] |
/openjdk7/hotspot/src/share/vm/code/ |
H A D | exceptionHandlerTable.hpp | 139 typedef uint implicit_null_entry; 142 uint _size; 143 uint _len; 145 implicit_null_entry *adr( uint idx ) const { return &_data[2*idx]; } 152 void set_size( uint size ); 153 void append( uint exec_off, uint cont_off ); 154 uint at( uint exec_off ) const; 156 uint le [all...] |