Struct come::ir::editor::analyzer::control_flow::ControlFlowGraphContent

pub struct ControlFlowGraphContent {
    graph: DiGraph<(), (), usize>,
    frontiers: HashMap<usize, Vec<usize>>,
    bb_name_index_map: BiMap<usize, String>,
    dominators: Dominators<NodeIndex<usize>>,
    from_to_may_pass_blocks: RefCell<HashMap<(usize, usize), Vec<usize>>>,
}

ControlFlowGraph is the control flow graph and related infomation of a function.

Fields

graph: DiGraph<(), (), usize>

frontiers: HashMap<usize, Vec<usize>>

bb_name_index_map: BiMap<usize, String>

dominators: Dominators<NodeIndex<usize>>

from_to_may_pass_blocks: RefCell<HashMap<(usize, usize), Vec<usize>>>

Implementations

impl ControlFlowGraphContent

pub fn new(function_definition: &FunctionDefinition) -> Self

Create a ControlFlowGraph from a FunctionDefinition.

pub fn dominance_frontier(&self, bb_index: usize) -> &[usize]

Dominance Frontier of basic block indexed by bb_index.

fn dominates_calculate(&self, visiting: usize, visited: &mut Vec<usize>)

fn immediately_dominates(&self, node: usize) -> Vec<usize>

pub fn dominates(&self, node: usize) -> Vec<usize>

pub fn basic_block_index_by_name(&self, name: &str) -> usize

Get the index of basic block named name.

pub fn basic_block_name_by_index(&self, index: usize) -> &str

Get the name of basic block indexed by index.

pub fn may_pass_blocks(&self, from: usize, to: usize) -> Ref<'_, Vec<usize>>

Get all blocks that the control flow may pass from from to to.

Trait Implementations

impl Debug for ControlFlowGraphContent

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

Formats the value using the given formatter.