Searched refs:degree (Results 1 - 3 of 3) sorted by relevance

/openjdk10/hotspot/src/share/vm/opto/
H A Dchaitin.hpp80 uint _eff_degree; // Effective degree: Sum of neighbors _num_regs
82 int degree() const { assert( _degree_valid , "" ); return _eff_degree; } function in class:LRG
85 void set_degree( uint degree ) {
86 _eff_degree = degree;
90 // Made a change that hammered degree
92 // Incrementally modify degree. If it was correct, it should remain correct
97 // Compute the degree between 2 live ranges
167 // Is this live range of "low-degree"? Trivially colorable?
168 bool lo_degree () const { return degree() <= degrees_of_freedom(); }
169 // Is this live range just barely "low-degree"
[all...]
H A Dchaitin.cpp511 cache_lrg_info(); // Count degree of LRGs
513 // Simplify the InterFerence Graph by removing LRGs of low degree.
514 // LRGs of low degree are trivially colorable.
574 cache_lrg_info(); // Count degree of LRGs
576 // Simplify the InterFerence Graph by removing LRGs of low degree.
577 // LRGs of low degree are trivially colorable.
1078 // Set the was-lo-degree bit. Conservative coalescing should not change the
1079 // colorability of the graph. If any live range was of low-degree before
1080 // coalescing, it should Simplify. This call sets the was-lo-degree bit.
1089 lrgs(i)._was_lo = 1; // Trivially of low degree
[all...]
H A Difg.cpp107 // Compute effective degree in bulk
171 // Compute the degree between 2 live ranges. If both live ranges are
186 // Compute effective degree for this live range. If both live ranges are
279 assert(!lrgs(i)._degree_valid || effective_degree(i) == lrgs(i).degree(), "degree is valid but wrong");

Completed in 61 milliseconds