rlx-ir 0.2.14

Tensor IR for the RLX ML compiler — standalone, serializable, optimizable
Documentation 
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108

// RLX — versatile ML compiler + runtime.
// Copyright (C) 2026 Eugene Hauptmann, Nataliya Kosmyna.
// SPDX-License-Identifier: MIT OR Apache-2.0

//! Cross-stage node provenance — HIR block → MIR node → fusion pass.

use std::fmt;

use crate::hir::HirNodeId;
use crate::{Graph, NodeId};

/// Where a MIR node came from and how it was produced.
#[cfg_attr(feature = "serialize", derive(serde::Serialize, serde::Deserialize))]
#[derive(Debug, Clone, Default, PartialEq, Eq)]
pub struct NodeOrigin {
    /// Source HIR block node, when lowered from [`HirModule`].
    pub hir: Option<HirNodeId>,
    /// Human label (`layer0.ffn`, `swiglu_ffn`, param name, …).
    pub label: Option<String>,
    /// Optimizer pass that last created or fused this node.
    pub pass: Option<String>,
}

impl NodeOrigin {
    pub fn from_hir(hir: HirNodeId, label: Option<String>) -> Self {
        Self {
            hir: Some(hir),
            label,
            pass: None,
        }
    }

    pub fn inherit_from_graph(graph: &Graph, inputs: &[NodeId], pass: &str) -> Self {
        let mut out = Self::default();
        for &id in inputs {
            let node = graph.node(id);
            if let Some(ref o) = node.origin {
                if out.hir.is_none() {
                    out.hir = o.hir;
                }
                if out.label.is_none() {
                    out.label = o.label.clone();
                }
            }
            if out.label.is_none() {
                out.label = node.name.clone();
            }
            if out.hir.is_some() && out.label.is_some() {
                break;
            }
        }
        out.pass = Some(pass.to_string());
        out
    }
}

impl fmt::Display for NodeOrigin {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        let mut parts = Vec::new();
        if let Some(h) = self.hir {
            parts.push(format!("hir={h}"));
        }
        if let Some(l) = &self.label {
            parts.push(format!("\"{l}\""));
        }
        if let Some(p) = &self.pass {
            parts.push(format!("pass={p}"));
        }
        if parts.is_empty() {
            write!(f, "—")
        } else {
            write!(f, "{}", parts.join(", "))
        }
    }
}

/// Best-effort label for diagnostics (leaf name, origin label, node name, id).
pub fn node_label(graph: &Graph, id: NodeId) -> String {
    let node = graph.node(id);
    // A leaf's declared name is its most meaningful identity — a NaN in a
    // weight or input should say "qkv.weight" / "input_ids", not "h0".
    match &node.op {
        crate::Op::Input { name } | crate::Op::Param { name } => return name.clone(),
        _ => {}
    }
    if let Some(ref o) = node.origin {
        if let Some(ref l) = o.label {
            return l.clone();
        }
        if let Some(h) = o.hir {
            return format!("{h}");
        }
    }
    node.name.clone().unwrap_or_else(|| format!("{id}"))
}

/// Stamp nodes created by a pass (no origin yet) by inheriting from inputs.
pub fn stamp_pass_origins(graph: &mut Graph, pass: &str) {
    let ids: Vec<NodeId> = graph.nodes().iter().map(|n| n.id).collect();
    for id in ids {
        if graph.node(id).origin.is_some() {
            continue;
        }
        let inputs = graph.node(id).inputs.clone();
        let origin = NodeOrigin::inherit_from_graph(graph, &inputs, pass);
        graph.node_mut(id).origin = Some(origin);
    }
}