Struct DeadCodeEliminationPass 

pub struct DeadCodeEliminationPass { /* private fields */ }

Dead code elimination pass Removes nodes that don’t contribute to any output

Implementations

impl DeadCodeEliminationPass

pub fn new() -> Self

pub fn with_outputs(outputs: HashSet<NodeId>) -> Self

Construct a pass that additionally treats outputs as GC roots, so nodes reachable only from these ids are preserved even if nothing else about them would otherwise mark them as reachable.

Trait Implementations

impl Default for DeadCodeEliminationPass

fn default() -> Self

Returns the “default value” for a type.

impl OptimizationPass for DeadCodeEliminationPass

fn apply(&self, graph: &mut Graph) -> Result<bool>

Apply the optimization pass to the graph

fn name(&self) -> &str

Get the name of this optimization pass

fn is_applicable(&self, graph: &Graph) -> bool

Check if this pass can be safely applied

fn priority(&self) -> u32

Get the pass priority (higher = run first)

fn set_outputs(&self, outputs: &HashSet<NodeId>)

Inform this pass which node ids are explicit graph outputs (e.g. pending fetch targets in the eager Session executor) that must keep their identity across optimization, even if the pass would otherwise eliminate or merge them away.