Lines Matching refs:live
32 #include "opto/live.hpp"
58 double _area; // Sum of all simultaneously live values
62 Node *_def; // Check for multi-def live ranges
91 // Compute the degree between 2 live ranges
129 // Number of registers this live range uses when it colors
138 // Number of physical registers this live range uses when it colors
145 // How much 'wiggle room' does this live range have?
152 // live range must spill.
154 // Is this live range of "low-degree"? Trivially colorable?
156 // Is this live range just barely "low-degree"? Trivially colorable?
164 _is_bound:1, // live range starts life with no
167 _must_spill:1, // live range has lost all degrees of freedom
168 // If _fat_proj is set, live range does NOT require aligned, adjacent
170 // If _fat_proj is clear, live range requires num_regs() to be a power of
228 // Array of adjacency-lists, indexed by live-range number
238 // Largest live-range number
314 uint _maxlrg; // Max live range number
325 // Indexed by live-range number, it returns the compacted live-range number
332 // Combine the Live Range Indices for these 2 Nodes into a single live
333 // range. Future requests for any Node in either live range will
334 // return the live range index for the combined live range.
339 // Compact live ranges, removing unused ones. Return new maxlrg.
358 // instead. Update high-pressure indices. Create a new live range.
399 // all inputs to a PhiNode, effectively coalescing live ranges. Insert
416 // Same as _ifg->add_vector(reg,live) EXCEPT use the RegMask
419 void interfere_with_live( uint reg, IndexSet *live );
429 // That is, if 2 live ranges are simultaneously alive but in their
445 // colorability of the graph. If any live range was of low-degree before
449 // Split live-ranges that must spill due to register conflicts (as opposed
471 // Split uncolorable live ranges
472 // Return new number of live ranges
487 // Replace the old node with the current live version of that value