Struct AndersenSolver 

pub struct AndersenSolver {
    pub constraints: Vec<AndersenConstraint>,
    pub graph: PointsToGraph,
    pub field_sensitive: bool,
    pub iterations: u32,
}

Inclusion-based (Andersen) points-to solver.

Processes constraints until a fixed point is reached. Optionally field-sensitive.

Fields

constraints: Vec<AndersenConstraint>

Accumulated constraints.

graph: PointsToGraph

Current points-to graph.

field_sensitive: bool

Whether to use field-sensitive analysis.

iterations: u32

Number of solver iterations performed.

Implementations

impl AndersenSolver

pub fn new() -> Self

Create a new solver.

pub fn field_sensitive() -> Self

Create a field-sensitive solver.

pub fn add_address_of(&mut self, lhs: LcnfVarId, addr_of: LcnfVarId)

Add an AddressOf constraint: lhs ⊇ {&addr_of}.

pub fn add_copy(&mut self, lhs: LcnfVarId, rhs: LcnfVarId)

Add a Copy constraint: pts(lhs) ⊇ pts(rhs).

pub fn add_load(&mut self, lhs: LcnfVarId, ptr: LcnfVarId)

Add a Load constraint: lhs = *ptr.

pub fn add_store(&mut self, ptr: LcnfVarId, rhs: LcnfVarId)

Add a Store constraint: *ptr = rhs.

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

Register a variable in the underlying points-to graph.

pub fn solve(&mut self)

Solve constraints to a fixed point.

Uses a worklist algorithm for efficiency.

pub fn query(&self, a: LcnfVarId, b: LcnfVarId) -> AliasResult

Query alias relationship between two variables after solving.

Trait Implementations

impl Clone for AndersenSolver

fn clone(&self) -> AndersenSolver

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AndersenSolver

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

Formats the value using the given formatter.

impl Default for AndersenSolver

fn default() -> AndersenSolver

Returns the “default value” for a type.