Struct GraphColorAllocator 

pub struct GraphColorAllocator;

Greedy graph-coloring register allocator (interference graph from live intervals).

Intervals that overlap cannot share a register. Nodes are colored in descending degree (Welsh–Powell order) to reduce spill pressure compared to arbitrary order. When no color is available among available_regs, the interval is spilled using the same slot layout as LinearScanAllocator::allocate.

Implementations

impl GraphColorAllocator

pub fn allocate<R: Copy + Eq + Hash>( intervals: &[LiveInterval], available_regs: &[R], ) -> HashMap<VirtualReg, Allocation<R>>

Color intervals using at most available_regs.len() registers.

intervals may be in any order; internally sorted by interference degree.