Struct AndersenPTA 

pub struct AndersenPTA {
    pub num_vars: usize,
    pub pts: Vec<BTreeSet<usize>>,
    pub copy_edges: Vec<BTreeSet<usize>>,
    pub store: Vec<Vec<(usize, usize)>>,
    pub load: Vec<Vec<(usize, usize)>>,
}

A simplified Andersen points-to analysis using a constraint worklist.

Fields

num_vars: usize

Number of variables.

pts: Vec<BTreeSet<usize>>

Points-to sets: pts[v] = set of allocation sites.

copy_edges: Vec<BTreeSet<usize>>

Copy constraints: copy_edges[a] = {b | pts(a) ⊆ pts(b)}.

store: Vec<Vec<(usize, usize)>>

Store constraints: store[a] = set of (src, field).

load: Vec<Vec<(usize, usize)>>

Load constraints: load[a] = set of (dst, field).

Implementations

impl AndersenPTA

pub fn new(num_vars: usize) -> Self

pub fn add_alloc(&mut self, a: usize, site: usize)

Add: a = alloc() — variable a points to allocation site site.

pub fn add_copy(&mut self, src: usize, dst: usize)

Add copy constraint: b = a (pts(a) ⊆ pts(b)).

pub fn solve(&mut self)

Solve: propagate points-to sets to a fixpoint.

pub fn may_alias(&self, a: usize, b: usize) -> bool

Query: may a and b alias?

Trait Implementations

impl Clone for AndersenPTA

fn clone(&self) -> AndersenPTA

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AndersenPTA

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

Formats the value using the given formatter.

impl Default for AndersenPTA

fn default() -> AndersenPTA

Returns the “default value” for a type.