Struct InterferenceGraph 

pub struct InterferenceGraph {
    pub edges: HashMap<LcnfVarId, HashSet<LcnfVarId>>,
    pub nodes: HashSet<LcnfVarId>,
    pub move_pairs: Vec<(LcnfVarId, LcnfVarId)>,
}

An undirected interference graph for register allocation.

Nodes are virtual registers; an edge (u, v) means u and v have overlapping live ranges and therefore cannot share a physical register.

Fields

edges: HashMap<LcnfVarId, HashSet<LcnfVarId>>

Adjacency lists.

nodes: HashSet<LcnfVarId>

All nodes (vregs) in the graph.

move_pairs: Vec<(LcnfVarId, LcnfVarId)>

Move-related pairs: pairs of vregs connected by copy instructions that are candidates for coalescing.

Implementations

impl InterferenceGraph

pub fn new() -> Self

Create an empty interference graph.

pub fn add_node(&mut self, vreg: LcnfVarId)

Add a node to the graph.

pub fn add_edge(&mut self, u: LcnfVarId, v: LcnfVarId)

Add an interference edge between u and v.

pub fn interferes(&self, u: LcnfVarId, v: LcnfVarId) -> bool

Returns true if u and v interfere.

pub fn degree(&self, vreg: LcnfVarId) -> usize

Returns the degree of node vreg.

pub fn remove_node(&mut self, vreg: LcnfVarId)

Remove a node and all its edges.

pub fn add_move_pair(&mut self, u: LcnfVarId, v: LcnfVarId)

Record a move-related pair (candidate for coalescing).

pub fn build_from_intervals(intervals: &[LiveInterval]) -> Self

Build an interference graph from a set of live intervals.

Trait Implementations

impl Clone for InterferenceGraph

fn clone(&self) -> InterferenceGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for InterferenceGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for InterferenceGraph

fn default() -> InterferenceGraph

Returns the “default value” for a type.