Struct PDGraph 

pub struct PDGraph {
    pub num_stmts: usize,
    pub data_edges: Vec<BTreeSet<usize>>,
    pub ctrl_edges: Vec<BTreeSet<usize>>,
}

A simplified program dependence graph over statement indices.

Fields

num_stmts: usize

Number of statements.

data_edges: Vec<BTreeSet<usize>>

Data dependence edges: data_edges[s] = set of statements s flows data to.

ctrl_edges: Vec<BTreeSet<usize>>

Control dependence edges: ctrl_edges[s] = statements s controls.

Implementations

impl PDGraph

pub fn new(num_stmts: usize) -> Self

Create a PDG for n statements.

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

Add a data dependence edge from src to dst.

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

Add a control dependence edge from src to dst.

pub fn backward_slice(&self, criterion: usize) -> BTreeSet<usize>

Compute backward slice from a criterion statement. Returns the set of statement indices that can affect criterion.

pub fn forward_slice(&self, criterion: usize) -> BTreeSet<usize>

Compute forward slice from a criterion statement.

Trait Implementations

impl Clone for PDGraph

fn clone(&self) -> PDGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PDGraph

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

Formats the value using the given formatter.

impl Default for PDGraph

fn default() -> PDGraph

Returns the “default value” for a type.