Struct CallGraphInfo 

pub struct CallGraphInfo<'tcx> {
    pub functions: HashMap<usize, Node>,
    pub fn_calls: HashMap<usize, Vec<(usize, Option<&'tcx Terminator<'tcx>>)>>,
    pub node_registry: HashMap<String, usize>,
}

Fields

functions: HashMap<usize, Node>

fn_calls: HashMap<usize, Vec<(usize, Option<&'tcx Terminator<'tcx>>)>>

node_registry: HashMap<String, usize>

Implementations

impl<'tcx> CallGraphInfo<'tcx>

pub fn new() -> Self

pub fn get_node_num(&self) -> usize

pub fn get_callees_path( &self, caller_def_path: &String, ) -> Option<HashSet<String>>

pub fn add_node(&mut self, def_id: DefId, def_path: &String) -> usize

Add a node and return its id. If node already exists, only return its id.

pub fn add_funciton_call_edge( &mut self, caller_id: usize, callee_id: usize, terminator_stmt: Option<&'tcx Terminator<'tcx>>, )

pub fn get_node_by_path(&self, def_path: &String) -> Option<usize>

pub fn get_callers_map( &self, ) -> HashMap<usize, Vec<(usize, Option<&'tcx Terminator<'tcx>>)>>

pub fn display(&self)

pub fn get_reverse_post_order(&self) -> Vec<DefId>

fn dfs_post_order( &self, node_id: usize, visited: &mut HashSet<usize>, post_order_ids: &mut Vec<usize>, )

Helper function to perform a recursive depth-first search.