Struct PointsToGraph 

pub struct PointsToGraph {
    pub nodes: HashMap<LcnfVarId, PointsToNode>,
    pub pts: HashMap<LcnfVarId, HashSet<LcnfVarId>>,
    pub is_steensgaard: bool,
}

A points-to graph mapping each variable to the set of nodes it may point to.

This implements a simplified Andersen / Steensgaard style analysis.

Fields

nodes: HashMap<LcnfVarId, PointsToNode>

All known nodes in the graph.

pts: HashMap<LcnfVarId, HashSet<LcnfVarId>>

pts[x] = set of node IDs that variable x may point to.

is_steensgaard: bool

Whether this graph was built with Steensgaard (union-find) or Andersen style.

Implementations

impl PointsToGraph

pub fn new() -> Self

Create a new empty points-to graph.

pub fn add_node(&mut self, node: PointsToNode)

Register a node in the graph.

pub fn add_pts(&mut self, src: LcnfVarId, tgt: LcnfVarId)

Add a points-to edge: src may point to tgt.

pub fn pts_of(&self, var: LcnfVarId) -> &HashSet<LcnfVarId>

Retrieve the points-to set for var.

pub fn intersects(&self, a: LcnfVarId, b: LcnfVarId) -> bool

Check whether two variables share a common points-to target.

pub fn propagate(&mut self, from: LcnfVarId, to: LcnfVarId)

Propagate points-to sets: if from ⊆ to, propagate pts(from) → pts(to).

Trait Implementations

impl Clone for PointsToGraph

fn clone(&self) -> PointsToGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PointsToGraph

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

Formats the value using the given formatter.

impl Default for PointsToGraph

fn default() -> PointsToGraph

Returns the “default value” for a type.