Struct LoopInfo 

pub struct LoopInfo { /* private fields */ }

Loop nesting information for a single function.

Implementations

impl LoopInfo

pub fn compute(func: &Function, cfg: &Cfg, dom: &DomTree) -> Self

Detect all natural loops in func.

Uses the standard back-edge + reverse-CFG-BFS algorithm, which is correct only for reducible CFGs. On an irreducible CFG, cycles whose strongly-connected component has no single dominating header will not be reported. See the module-level documentation for details and mitigation options.

pub fn loops(&self) -> &[Loop]

All detected loops.

pub fn loop_of(&self, bid: BlockId) -> Option<usize>

Index of the innermost loop containing bid, or None.

pub fn is_loop_header(&self, bid: BlockId) -> bool

true if bid is the header of any detected loop.

pub fn depth(&self, bid: BlockId) -> usize

Nesting depth of bid (0 = not in a loop, 1 = outermost loop, …).