Struct DeadNodeElimination 

pub struct DeadNodeElimination;

Removes nodes that do not contribute to any graph output.

A node is live if any of its outputs is (transitively) required to compute a value in Graph::outputs. Liveness is found by walking backwards from the graph outputs through producer edges; every node not reached is removed via Graph::remove_nodes, which keeps producer/consumer edges consistent and garbage-collects orphaned values. Graph inputs and initializers are left untouched.

Trait Implementations

impl Clone for DeadNodeElimination

fn clone(&self) -> DeadNodeElimination

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for DeadNodeElimination

impl Debug for DeadNodeElimination

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

Formats the value using the given formatter.

impl Default for DeadNodeElimination

fn default() -> DeadNodeElimination

Returns the “default value” for a type.

impl OptimizationPass for DeadNodeElimination

fn name(&self) -> &str

A short, stable name for logging and error messages.

fn run(&self, graph: &mut Graph, _ctx: &PassContext) -> Result<()>

Apply the rewrite in place.

fn postconditions(&self, graph: &Graph) -> Result<()>

Invariants that must hold after this pass. The default requires the graph to pass full structural validation (Graph::validate).