Enum OptimizationPass 

pub enum OptimizationPass {
    TypeInference,
    RedundantCastRemoval,
    AlgebraicSimplification,
    LoopDetection,
    NodeMerging,
    InstructionCounting,
    DeadCodeElimination,
    ConstantPropagation,
}

Individual optimization passes that can be applied to a shader graph.

Variants

TypeInference

Infer types through the graph and insert implicit casts where needed.

RedundantCastRemoval

Remove redundant type casts (e.g., float -> float).

AlgebraicSimplification

Apply algebraic simplifications: x1=x, x+0=x, x0=0, etc.

LoopDetection

Detect cycles/loops in the graph (report errors).

NodeMerging

Merge sequential compatible math operations into single nodes.

InstructionCounting

Estimate instruction count per node and total.

DeadCodeElimination

Dead code elimination (remove nodes not reachable from outputs).

ConstantPropagation

Constant propagation through known-value chains.

Trait Implementations

impl Clone for OptimizationPass

fn clone(&self) -> OptimizationPass

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OptimizationPass

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

Formats the value using the given formatter.

impl Hash for OptimizationPass

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for OptimizationPass

fn eq(&self, other: &OptimizationPass) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for OptimizationPass

impl Eq for OptimizationPass

impl StructuralPartialEq for OptimizationPass