Struct ControlFlowGraph

pub struct ControlFlowGraph {
    pub graph: DiGraph<BasicBlock, EdgeType>,
    pub loops: Vec<LoopInfo>,
    pub dominators: Option<Dominators<NodeIndex>>,
    /* private fields */
}

Control Flow Graph with proper basic block analysis

Fields

graph: DiGraph<BasicBlock, EdgeType>

loops: Vec<LoopInfo>

Detected loops in the CFG

dominators: Option<Dominators<NodeIndex>>

Dominator tree information

Implementations

impl ControlFlowGraph

pub fn new() -> Self

pub fn build_from_analysis(analysis: &BinaryAnalysis) -> Result<Self, String>

Build CFG from binary analysis with Capstone disassembly

pub fn analyze_call_graph(&self, analysis: &BinaryAnalysis) -> CallGraphAnalysis

Analyze call graph relationships

pub fn get_loop_headers(&self) -> Vec<u64>

Get basic blocks that are loop headers

pub fn is_in_loop(&self, address: u64) -> bool

Check if an address is in a loop

pub fn get_dominators(&self, node: NodeIndex) -> Option<Vec<NodeIndex>>

Get dominator information for a block

Trait Implementations

impl Debug for ControlFlowGraph

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

Formats the value using the given formatter.