Crate llvm_analysis 

Analysis passes: CFG, dominator tree, use-def chains, and loop detection.

Re-exports

pub use call_graph::CallEdge;

pub use call_graph::CallEdgeKind;

pub use call_graph::CallGraph;

pub use cfg::Cfg;

pub use dominators::DomTree;

pub use loops::Loop;

pub use loops::LoopInfo;

pub use use_def::UseDefInfo;

Modules

call_graph

Module-level call graph with edge kinds and SCC traversal.

cfg

Public API for cfg. Control-flow graph: predecessor and successor maps over basic blocks.

dominators

Public API for dominators. Dominator tree computed with the iterative dataflow algorithm from Cooper, Harvey & Kennedy — “A Simple, Fast Dominance Algorithm” (2001).

loops

Public API for loops. Natural loop detection built on the dominator tree.

use_def

Public API for use_def. Use-def and def-use chains.