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
51
52
53
54
55
56
// 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/>.
//! Pass infrastructure — trait + pipeline runner.
use Graph;
/// A graph-to-graph transformation pass.
/// Run a sequence of passes, printing the graph after each if `verbose`.
///
/// When `RLX_FUSION_REPORT=1`, prints a [`fusion_report::FusionReport`]
/// comparing the input graph to the fused result.
///
/// In debug builds, the verifier (#50 in PLAN.md, lifted from MAX) runs
/// after every pass via [`rlx_ir::debug_assert_valid!`] — so any optimizer
/// bug that introduces a malformed graph is caught at the boundary where it
/// was introduced. In release builds the check is not compiled in.