oxfuse-runtime 0.4.1

Tensors, execution plans and bit-exact CPU backends (reference and fast) for oxfuse graphs.
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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

//! The layout pass only moves bits: optimized graphs must return the
//! unoptimized graph's exact bits on the reference backend.

mod common;

use common::bits;
use oxfuse_core::passes::default_pipeline;
use oxfuse_core::{Graph, GraphBuilder, Limits, Op};
use oxfuse_runtime::{Backend, CpuBackend, ReferenceBackend, ReferenceEvaluator, Tensor};
use std::sync::Arc;

fn run_both(graph: &Graph, input: &Tensor) {
    let optimized = default_pipeline(Limits::default(), Arc::new(ReferenceEvaluator))
        .run(graph)
        .unwrap()
        .graph;
    assert!(
        optimized.values().len() < graph.values().len(),
        "nothing was elided"
    );
    let inputs = std::slice::from_ref(input);
    let want = ReferenceBackend
        .compile(graph)
        .unwrap()
        .run(inputs)
        .unwrap();
    let reference = ReferenceBackend
        .compile(&optimized)
        .unwrap()
        .run(inputs)
        .unwrap();
    let cpu = CpuBackend.compile(&optimized).unwrap().run(inputs).unwrap();
    assert_eq!(bits(&want), bits(&reference));
    assert_eq!(bits(&want), bits(&cpu));
}

/// Distinct values, so any wrong permutation changes the bits.
fn tensor(shape: &[usize]) -> Tensor {
    let len = shape.iter().product::<usize>();
    Tensor::new(
        shape.to_vec(),
        (0..len).map(|i| i as f32 * 0.5 - 7.0).collect(),
    )
    .unwrap()
}

fn transposes(shape: &[usize], perms: &[&[usize]]) -> Graph {
    let mut b = GraphBuilder::new(Limits::default());
    let mut value = b.input("x", shape.to_vec()).unwrap();
    for (i, perm) in perms.iter().enumerate() {
        value = b
            .node(
                &format!("t{i}"),
                Op::Transpose {
                    perm: perm.to_vec(),
                },
                &[value],
            )
            .unwrap();
    }
    b.finish(&[value]).unwrap()
}

#[test]
fn every_pair_of_rank_three_permutations() {
    const PERMS: [[usize; 3]; 6] = [
        [0, 1, 2],
        [0, 2, 1],
        [1, 0, 2],
        [1, 2, 0],
        [2, 0, 1],
        [2, 1, 0],
    ];
    let x = tensor(&[2, 3, 4]);
    for first in &PERMS {
        for second in &PERMS {
            let graph = transposes(&[2, 3, 4], &[first, second]);
            run_both(&graph, &x);
        }
    }
}

#[test]
fn a_chain_of_four_transposes() {
    let graph = transposes(
        &[2, 3, 4],
        &[&[1, 2, 0], &[0, 2, 1], &[2, 1, 0], &[1, 0, 2]],
    );
    run_both(&graph, &tensor(&[2, 3, 4]));
}

#[test]
fn reshape_chains_and_round_trips() {
    let mut b = GraphBuilder::new(Limits::default());
    let x = b.input("x", vec![2, 3, 4]).unwrap();
    let r1 = b
        .node("r1", Op::Reshape { shape: vec![6, 4] }, &[x])
        .unwrap();
    let r2 = b
        .node("r2", Op::Reshape { shape: vec![24] }, &[r1])
        .unwrap();
    let r3 = b
        .node(
            "r3",
            Op::Reshape {
                shape: vec![2, 3, 4],
            },
            &[r2],
        )
        .unwrap();
    let r4 = b
        .node("r4", Op::Reshape { shape: vec![4, 6] }, &[r3])
        .unwrap();
    let graph = b.finish(&[r4]).unwrap();
    run_both(&graph, &tensor(&[2, 3, 4]));
}

#[test]
fn a_transpose_pair_feeding_a_matmul() {
    let mut b = GraphBuilder::new(Limits::default());
    let x = b.input("x", vec![3, 5]).unwrap();
    let w = b
        .constant("w", vec![5, 2], (0..10).map(|i| i as f32 - 4.5).collect())
        .unwrap();
    let t = b
        .node("t", Op::Transpose { perm: vec![1, 0] }, &[x])
        .unwrap();
    let u = b
        .node("u", Op::Transpose { perm: vec![1, 0] }, &[t])
        .unwrap();
    let m = b.node("m", Op::MatMul, &[u, w]).unwrap();
    let graph = b.finish(&[m, t]).unwrap();
    // `t` is also an output, so only the second transpose goes away.
    let optimized = default_pipeline(Limits::default(), Arc::new(ReferenceEvaluator))
        .run(&graph)
        .unwrap()
        .graph;
    let input = tensor(&[3, 5]);
    let inputs = std::slice::from_ref(&input);
    let want = ReferenceBackend
        .compile(&graph)
        .unwrap()
        .run(inputs)
        .unwrap();
    let got = CpuBackend.compile(&optimized).unwrap().run(inputs).unwrap();
    assert_eq!(bits(&want), bits(&got));
    assert_eq!(optimized.values().len(), graph.values().len() - 1);
}