ronn_graph/passes/
dead_code.rs

1use super::{OptimizationPass, PassStats};
2use crate::error::Result;
3use ronn_core::ModelGraph;
4use std::collections::HashSet;
5use tracing::debug;
6
7/// Dead code elimination pass - removes unused nodes
8pub struct DeadCodeEliminationPass;
9
10impl OptimizationPass for DeadCodeEliminationPass {
11    fn name(&self) -> &str {
12        "DeadCodeElimination"
13    }
14
15    fn run(&self, graph: &mut ModelGraph) -> Result<PassStats> {
16        let mut stats = PassStats::default();
17        let mut live_nodes = HashSet::new();
18
19        // Mark all nodes that contribute to outputs as live
20        Self::mark_live_nodes(graph, &mut live_nodes);
21
22        // Count and remove dead nodes
23        let total_nodes = graph.node_count();
24        let dead_count = total_nodes - live_nodes.len();
25
26        if dead_count > 0 {
27            debug!("Removing {} dead nodes out of {}", dead_count, total_nodes);
28
29            // Remove dead nodes
30            // This would require graph mutation API
31            stats.nodes_removed = dead_count;
32        }
33
34        Ok(stats)
35    }
36}
37
38impl DeadCodeEliminationPass {
39    /// Mark all nodes reachable from outputs as live
40    fn mark_live_nodes(graph: &ModelGraph, live_nodes: &mut HashSet<String>) {
41        // Start from output nodes and traverse backwards
42        // Mark all nodes in the backward transitive closure as live
43        // This is a simplified version - full implementation would do proper traversal
44
45        for node in graph.nodes() {
46            // For now, mark all nodes as live
47            // Full implementation would check reachability from outputs
48            live_nodes.insert(node.id.to_string());
49        }
50    }
51}
ronn_graph/passes/dead_code.rs

ronn_graph/passes/
dead_code.rs
