pub struct MopGraph<'tcx> {Show 14 fields
    pub def_id: DefId,
    pub tcx: TyCtxt<'tcx>,
    pub span: Span,
    pub values: Vec<ValueNode>,
    pub blocks: Vec<BlockNode<'tcx>>,
    pub arg_size: usize,
    pub scc_indices: Vec<usize>,
    pub constant: FxHashMap<usize, usize>,
    pub ret_alias: MopAAResult,
    pub visit_times: usize,
    pub alias_set: Vec<usize>,
    pub child_scc: FxHashMap<usize, (BlockNode<'tcx>, SwitchTargets, FxHashSet<usize>)>,
    pub disc_map: FxHashMap<usize, usize>,
    pub terms: Vec<TerminatorKind<'tcx>>,
}Fields§
§def_id: DefId§tcx: TyCtxt<'tcx>§span: Span§values: Vec<ValueNode>§blocks: Vec<BlockNode<'tcx>>§arg_size: usize§scc_indices: Vec<usize>§constant: FxHashMap<usize, usize>§ret_alias: MopAAResult§visit_times: usize§alias_set: Vec<usize>§child_scc: FxHashMap<usize, (BlockNode<'tcx>, SwitchTargets, FxHashSet<usize>)>§disc_map: FxHashMap<usize, usize>§terms: Vec<TerminatorKind<'tcx>>Implementations§
Source§impl<'tcx> MopGraph<'tcx>
 
impl<'tcx> MopGraph<'tcx>
pub fn alias_bb(&mut self, bb_index: usize)
pub fn alias_bbcall( &mut self, bb_index: usize, fn_map: &mut MopAAResultMap, recursion_set: &mut HashSet<DefId>, )
pub fn projection(&mut self, is_right: bool, place: Place<'tcx>) -> usize
pub fn merge_alias(&mut self, lv: usize, rv: usize, depth: usize)
pub fn merge(&mut self, ret_alias: &MopAAFact, arg_vec: &[usize])
pub fn merge_results(&mut self, results_nodes: Vec<ValueNode>)
pub fn get_field_seq(&self, value: &ValueNode) -> Vec<usize>
pub fn union_find(&mut self, e: usize) -> usize
pub fn union_merge(&mut self, e1: usize, e2: usize)
pub fn union_is_same(&mut self, e1: usize, e2: usize) -> bool
Source§impl<'tcx> MopGraph<'tcx>
 
impl<'tcx> MopGraph<'tcx>
pub fn new(tcx: TyCtxt<'tcx>, def_id: DefId) -> MopGraph<'tcx>
pub fn tarjan( &mut self, index: usize, stack: &mut Vec<usize>, instack: &mut FxHashSet<usize>, dfn: &mut Vec<usize>, low: &mut Vec<usize>, time: &mut usize, )
pub fn solve_scc(&mut self)
pub fn dfs_on_spanning_tree( &self, index: usize, stack: &mut Vec<usize>, paths: &mut Vec<Vec<usize>>, )
pub fn get_paths(&self) -> Vec<Vec<usize>>
pub fn get_all_branch_sub_blocks_paths(&self) -> Vec<Vec<usize>>
pub fn get_branch_sub_blocks_for_path(&self, path: &[usize]) -> Vec<usize>
pub fn switch_target(&mut self, block_index: usize) -> Option<usize>
Source§impl<'tcx> MopGraph<'tcx>
 
impl<'tcx> MopGraph<'tcx>
pub fn split_check( &mut self, bb_index: usize, fn_map: &mut MopAAResultMap, recursion_set: &mut HashSet<DefId>, )
pub fn split_check_with_cond( &mut self, bb_index: usize, path_discr_id: usize, path_discr_val: usize, fn_map: &mut MopAAResultMap, recursion_set: &mut HashSet<DefId>, )
pub fn check( &mut self, bb_index: usize, fn_map: &mut MopAAResultMap, recursion_set: &mut HashSet<DefId>, )
pub fn calculate_scc_order( &mut self, scc: &Vec<usize>, path: &mut Vec<usize>, ans: &mut Vec<Vec<usize>>, disc_map: &mut HashMap<usize, usize>, idx: usize, root: usize, visit: &mut HashSet<usize>, )
Auto Trait Implementations§
impl<'tcx> Freeze for MopGraph<'tcx>
impl<'tcx> !RefUnwindSafe for MopGraph<'tcx>
impl<'tcx> !Send for MopGraph<'tcx>
impl<'tcx> !Sync for MopGraph<'tcx>
impl<'tcx> Unpin for MopGraph<'tcx>
impl<'tcx> !UnwindSafe for MopGraph<'tcx>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
 
impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
 
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more