Struct circomspect_program_structure::static_single_assignment::dominator_tree::DominatorTree

pub struct DominatorTree<T: DirectedGraphNode> { /* private fields */ }

Implementations

impl<T: DirectedGraphNode> DominatorTree<T>

pub fn new(basic_blocks: &[T]) -> DominatorTree<T>

pub fn entry_block(&self) -> usize

pub fn get_dominators(&self, i: usize) -> HashSet<usize>

pub fn get_immediate_dominator(&self, i: usize) -> Option<usize>

pub fn get_dominator_successors(&self, i: usize) -> HashSet<usize>

pub fn get_dominance_frontier(&self, i: usize) -> HashSet<usize>