Struct PassManager 

pub struct PassManager {
    pub max_iterations: u32,
    /* private fields */
}

Manages a pipeline of optimization passes with dependency ordering.

Passes are executed in topological order based on their declared dependencies. Cycle detection uses Kahn’s algorithm.

Fields

max_iterations: u32

Maximum number of fixed-point iterations.

Implementations

impl PassManager

pub fn new() -> Self

Create a new pass manager.

pub fn add_pass(&mut self, name: impl Into<String>)

Register a pass by name.

pub fn add_dependency( &mut self, pass: impl Into<String>, depends_on: impl Into<String>, )

Add a dependency: pass depends on depends_on.

pub fn record_run(&mut self, name: &str, changes: usize, duration_us: u64)

Record a run of the named pass.

pub fn get_stats(&self, name: &str) -> Option<&PassStats>

Get statistics for a named pass.

pub fn all_stats(&self) -> &HashMap<String, PassStats>

Get all statistics.

pub fn num_passes(&self) -> usize

Number of registered passes.

pub fn topological_order(&self) -> Option<Vec<String>>

Compute topological ordering of passes using Kahn’s algorithm.

Returns None if there is a cycle in the dependency graph.

pub fn has_cycle(&self) -> bool

Check if the dependency graph has a cycle.

pub fn total_changes(&self) -> usize

Total changes across all passes.

pub fn total_runs(&self) -> u32

Total runs across all passes.

Trait Implementations

impl Debug for PassManager

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

Formats the value using the given formatter.

impl Default for PassManager

fn default() -> PassManager

Returns the “default value” for a type.