Struct rupta::pts_set::pt_data::BasePTData

pub struct BasePTData<K, KS, D, DS> { /* private fields */ }

Basic points-to data structure.

Given a key (variable/condition variable), return its points-to data (pts/context-sensitve pts). It is designed flexible for different context, heap and path sensitive analysis.

1. Context Insensitive: Key –> Pointer, DataSet –> PointsTo
2. Context sensitive: Key –> CSPointer, DataSet –> CSPointsTo

• K (Key): “owning” variable of a points-to set.
• KS (KeySet): collection of keys.
• D (Data): elements in points-to sets.
• DS (DataSet): the points-to set; a collection of Data.

Implementations

impl<K, D, DS> BasePTData<K, HashSet<K>, D, DS>

where K: Hash + Eq + Copy, D: Idx, DS: PointsToSet<D>,

pub fn new() -> BasePTData<K, HashSet<K>, D, DS>

pub fn get_pts_map(&self) -> &HashMap<K, DS>

Return Points-to map

pub fn clear(&mut self)

pub fn get_pts(&self, var: K) -> Option<&DS>

Get points-to set of a var.

pub fn get_mut_pts(&mut self, var: K) -> Option<&mut DS>

pub fn get_rev_pts(&self, elem: D) -> Option<&HashSet<K>>

Get reverse points-to set of a elem.

pub fn add_pts(&mut self, var: K, elem: D) -> bool

Adds element to the points-to set associated with var.

pub fn union_pts(&mut self, dst_var: K, src_var: K) -> bool

Performs pts(dst_var) = pts(dst_var) U pts(src_var).

pub fn union_pts_to(&mut self, dst_var: K, src_ds: &DS) -> bool

Performs pts(dst_var) = pts(dst_var) U src_dataset.

pub fn remove_pts_elem(&mut self, var: K, elem: D) -> bool

Removes element from the points-to set of var.

pub fn clear_pts(&mut self, var: K)

Fully clears the points-to set of var.

pub fn dump_pt_data(&self)

Dump stored keys and points-to sets.

Trait Implementations

impl<K, KS, D, DS> Debug for BasePTData<K, KS, D, DS>

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

Formats the value using the given formatter.