Struct PointsToNode 

pub struct PointsToNode {
    pub var: LcnfVarId,
    pub label: String,
    pub kind: NodeKind,
}

A node in the points-to graph representing an allocation site or variable.

Fields

var: LcnfVarId

The variable ID this node represents.

label: String

A human-readable label for debugging.

kind: NodeKind

The kind of node.

Implementations

impl PointsToNode

pub fn local(var: LcnfVarId, label: impl Into<String>) -> Self

Create a new local node.

pub fn heap(var: LcnfVarId, label: impl Into<String>) -> Self

Create a new heap node.

pub fn parameter(var: LcnfVarId, label: impl Into<String>) -> Self

Create a new parameter node.

pub fn is_heap(&self) -> bool

Returns true if this node is a heap allocation site.

pub fn is_local(&self) -> bool

Returns true if this node is a local/stack variable.

Trait Implementations

impl Clone for PointsToNode

fn clone(&self) -> PointsToNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PointsToNode

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

Formats the value using the given formatter.

impl Hash for PointsToNode

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 PointsToNode

fn eq(&self, other: &PointsToNode) -> 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 PointsToNode

impl StructuralPartialEq for PointsToNode