1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
// RLX — versatile ML compiler + runtime.
// Copyright (C) 2026 Eugene Hauptmann, Nataliya Kosmyna.
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, version 3.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
//! Shared graph cleanup before the fusion / backend pipeline.
use crate::CompileOptions;
use rlx_ir::Graph;
use rlx_opt::pass::Pass as _;
/// Param specialization, algebraic simplify, DCE, and constant folding.
pub fn precompile_cleanup(graph: Graph, options: &CompileOptions) -> Graph {
let mut graph = graph;
if options
.param_bindings
.as_ref()
.is_some_and(|b| !b.is_empty())
{
let bindings = options.param_bindings.as_ref().unwrap();
graph = rlx_opt::specialize_params(&graph, bindings);
}
post_specialize_cleanup(graph, options)
}
/// DCE / fold after fusion — skips param specialization (already applied pre-fusion).
pub fn post_fusion_cleanup(graph: Graph, options: &CompileOptions) -> Graph {
post_specialize_cleanup(graph, options)
}
fn post_specialize_cleanup(graph: Graph, options: &CompileOptions) -> Graph {
let mut graph = rlx_opt::AlgebraicSimplify.run(graph);
if options.dce {
graph = rlx_opt::DeadCodeElimination.run(graph);
}
if options.constant_folding {
graph = rlx_opt::ConstantFolding.run(graph);
}
graph
}