Enum AndersenConstraint 

pub enum AndersenConstraint {
    AddressOf {
        lhs: LcnfVarId,
        addr_of: LcnfVarId,
    },
    Copy {
        lhs: LcnfVarId,
        rhs: LcnfVarId,
    },
    Load {
        lhs: LcnfVarId,
        ptr: LcnfVarId,
    },
    Store {
        ptr: LcnfVarId,
        rhs: LcnfVarId,
    },
}

A constraint in Andersen-style points-to analysis.

Variants

AddressOf

AddressOf: x contains the address of y (x ⊇ {&y}).

Fields

lhs: LcnfVarId

addr_of: LcnfVarId

Copy

Copy: x = y — pts(x) ⊇ pts(y).

Fields

lhs: LcnfVarId

rhs: LcnfVarId

Load

Load: x = *y — for each p ∈ pts(y): pts(x) ⊇ pts(p).

Fields

lhs: LcnfVarId

ptr: LcnfVarId

Store

Store: *x = y — for each p ∈ pts(x): pts(p) ⊇ pts(y).

Fields

ptr: LcnfVarId

rhs: LcnfVarId

Trait Implementations

impl Clone for AndersenConstraint

fn clone(&self) -> AndersenConstraint

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AndersenConstraint

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

Formats the value using the given formatter.

impl Hash for AndersenConstraint

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for AndersenConstraint

fn eq(&self, other: &AndersenConstraint) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for AndersenConstraint

impl StructuralPartialEq for AndersenConstraint