Lines Matching defs:degree
81 uint _eff_degree; // Effective degree: Sum of neighbors _num_regs
83 int degree() const { assert( _degree_valid, "" ); return _eff_degree; }
86 void set_degree( uint degree ) { _eff_degree = degree; debug_only(_degree_valid = 1;) }
87 // Made a change that hammered degree
89 // Incrementally modify degree. If it was correct, it should remain correct
91 // Compute the degree between 2 live ranges
154 // Is this live range of "low-degree"? Trivially colorable?
155 bool lo_degree () const { return degree() <= degrees_of_freedom(); }
156 // Is this live range just barely "low-degree"? Trivially colorable?
157 bool just_lo_degree () const { return degree() == degrees_of_freedom(); }
173 _was_lo:1, // Was lo-degree prior to coalesce
286 // Compute and set effective degree. Might be folded into SquareUp().
289 // Compute effective degree as the sum of neighbors' _sizes.
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
444 // Set the was-lo-degree bit. Conservative coalescing should not change the
445 // colorability of the graph. If any live range was of low-degree before
446 // coalescing, it should Simplify. This call sets the was-lo-degree bit.
454 // Init LRG caching of degree, numregs. Init lo_degree list.
457 // Simplify the IFG by removing LRGs of low degree with no copies
460 // Simplify the IFG by removing LRGs of low degree