Lines Matching refs:uint
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 i, Block *n );
85 uint size() const { return _cnt; }
121 uint num_preds() const { return head()->req(); }
122 Node *pred(uint i) const { return head()->in(i); }
130 uint _num_succs;
134 uint _pre_order; // Pre-order DFS number
137 uint _dom_depth; // Depth in dominator tree for fast LCA
141 uint _rpo; // Number in reverse post order walk
144 float succ_prob(uint i); // return probability of i'th successor
147 bool succ_fall_through(uint i); // Is successor "i" is a fall-through candidate
162 uint code_alignment();
163 uint compute_loop_alignment();
171 uint _reg_pressure;
172 uint _ihrp_index;
173 uint _freg_pressure;
174 uint _fhrp_index;
186 uint _first_inst_size;
187 uint first_inst_size() const { return _first_inst_size; }
188 void set_first_inst_size(uint s) { _first_inst_size = s; }
191 uint compute_first_inst_size(uint& sum_size, uint inst_cnt, PhaseRegAlloc* ra);
196 uint alignment_padding(int current_offset) {
203 uint padding = (block_alignment-current_alignment) & max_pad;
205 padding > (uint)MaxLoopPad &&
228 uint _loop_alignment;
230 uint new_alignment = loop_top->compute_loop_alignment();
235 uint loop_alignment() const { return _loop_alignment; }
261 uint end_idx() const {
280 uint find_node( const Node *n ) const;
287 uint sched_call(Matcher &matcher, Block_Array &bbs, uint node_cnt, Node_List &worklist, GrowableArray<int> &ready_cnt, MachCallNode *mcall, VectorSet &next_call);
290 Node *select(PhaseCFG *cfg, Node_List &worklist, GrowableArray<int> &ready_cnt, VectorSet &next_call, uint sched_slot);
316 for (uint i = 0; i < _num_succs; i++ ) {
353 uint build_cfg();
359 uint DFS( Tarjan *tarjan );
381 uint _num_blocks; // Count of basic blocks
386 uint _rpo_ctr;
391 GrowableArray<uint> *_node_latency;
409 void GlobalCodeMotion( Matcher &m, uint unique, Node_List &proj_list );
441 bool move_to_next(Block* bx, uint b_index);
442 void move_to_end(Block* bx, uint b_index);
443 void insert_goto_at(uint block_no, uint succ_no);
455 void insert( Block *b, uint idx, Node *n ) {
478 uint _cnt, _max;
479 uint* _indices;
482 UnionFind( uint max );
483 void reset( uint max ); // Reset to identity map for [0..max]
485 uint lookup( uint nidx ) const {
488 uint operator[] (uint nidx) const { return lookup(nidx); }
490 void map( uint from_idx, uint to_idx ) {
494 void extend( uint from_idx, uint to_idx );
496 uint Size() const { return _cnt; }
498 uint Find( uint idx ) {
499 assert( idx < 65536, "Must fit into uint");
500 uint uf_idx = lookup(idx);
503 uint Find_compress( uint idx );
504 uint Find_const( uint idx ) const;
505 void Union( uint idx1, uint idx2 );
624 uint _id; // Unique Trace id (derived from initial block)
660 uint id() const { return _id; }
661 void set_id(uint id) { _id = id; }