Lines Matching refs:uint
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_oop:1, // Live-range holds an oop
195 uint _cnt, _max;
196 uint* _lidxs;
199 LRG_List( uint max );
201 uint lookup( uint nidx ) const {
204 uint operator[] (uint nidx) const { return lookup(nidx); }
206 void map( uint nidx, uint lidx ) {
210 void extend( uint nidx, uint lidx );
212 uint Size() const { return _cnt; }
239 uint _maxlrg;
247 void init( uint maxlrg );
250 int add_edge( uint a, uint b );
253 void add_vector( uint a, IndexSet *vec );
256 int test_edge( uint a, uint b ) const;
262 uint neighbor_cnt( uint a ) const { return _adjs[a].count(); }
264 void Union( uint a, uint b );
266 int test_edge_sq( uint a, uint b ) const;
270 IndexSet *remove_node( uint a );
272 void re_insert( uint a );
274 IndexSet *neighbors( uint a ) const { return &_adjs[a]; }
284 LRG &lrgs(uint idx) const { assert(idx < _maxlrg, "oob"); return _lrgs[idx]; }
290 int effective_degree( uint lidx ) const;
314 uint _maxlrg; // Max live range number
315 LRG &lrgs(uint idx) const { return _ifg->lrgs(idx); }
328 void reset_uf_map( uint maxlrg );
337 void new_lrg( const Node *x, uint lrg );
342 uint _lo_degree; // Head of lo-degree LRGs list
343 uint _lo_stk_degree; // Head of lo-stk-degree LRGs list
344 uint _hi_degree; // Head of hi-degree LRGs list
345 uint _simplified; // Linked list head of simplified LRGs
348 uint split_DEF( Node *def, Block *b, int loc, uint max, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx );
349 uint split_USE( Node *def, Block *b, Node *use, uint useidx, uint max, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx );
350 int clone_projs( Block *b, uint idx, Node *con, Node *copy, uint &maxlrg );
351 Node *split_Rematerialize(Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits,
352 int slidx, uint *lrg2reach, Node **Reachblock, bool walkThru);
354 bool prompt_use( Block *b, uint lidx );
355 Node *get_spillcopy_wide( Node *def, Node *use, uint uidx );
359 void insert_proj( Block *b, uint i, Node *spill, uint maxlrg );
361 bool is_high_pressure( Block *b, LRG *lrg, uint insidx );
363 uint _oldphi; // Node index which separates pre-allocation nodes
374 PhaseChaitin( uint unique, PhaseCFG &cfg, Matcher &matcher );
378 uint Find( const Node *n ) {
379 uint lidx = n2lidx(n);
380 uint uf_lidx = _uf_map[lidx];
383 uint Find_const( uint lrg ) const;
384 uint Find_const( const Node *n ) const;
389 uint n2lidx( const Node *n ) const { return _names[n->_idx]; }
402 uint Find_compress( const Node *n );
403 uint Find( uint lidx ) {
404 uint uf_lidx = _uf_map[lidx];
407 uint Find_compress( uint lidx );
409 uint Find_id( const Node *n ) {
410 uint retval = n2lidx(n);
419 void interfere_with_live( uint reg, IndexSet *live );
421 uint count_int_pressure( IndexSet *liveout );
422 uint count_float_pressure( IndexSet *liveout );
431 uint build_ifg_physical( ResourceArea *a );
442 Node *find_base_for_derived( Node **derived_base_map, Node *derived, uint &maxlrg );
465 uint Select( );
473 uint Split(uint maxlrg, ResourceArea* split_arena);
504 int use_prior_register( Node *copy, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd );
526 static uint _high_pressure, _low_pressure;
533 void dump_lrg( uint lidx, bool defs_only) const;
534 void dump_lrg( uint lidx) const {
538 void dump_bb( uint pre_order ) const;