moose 0.2.2

Encrypted learning and data processing framework
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257

use crate::computation::*;
use crate::logical::{TensorDType, TensorShape};
use petgraph::Direction;
use std::collections::HashMap;

/// Updates the operators such that the type information is inferred by one-hop check, without any recursive graph traversal.
pub(crate) fn update_types_one_hop(mut comp: Computation) -> anyhow::Result<Computation> {
    let graph = comp.as_graph();

    for n in graph.node_indices() {
        let new_sig = {
            // Prepare the raw data for the signature computation
            let inputs = &comp.operations[graph[n].index].inputs;
            let types: HashMap<&String, Ty> = graph
                .neighbors_directed(n, Direction::Incoming)
                .map(|i| {
                    (
                        &comp.operations[graph[i].index].name,
                        comp.operations[graph[i].index].kind.sig().ret(),
                    )
                })
                .collect();
            let ret = comp.operations[graph[n].index].kind.sig().ret();

            let find_type = |i: usize| -> anyhow::Result<Ty> {
                match types.get(&inputs[i]) {
                    Some(ty) => Ok(*ty),
                    _ => Err(anyhow::anyhow!(
                        "Could not find type of input {}",
                        inputs[i]
                    )),
                }
            };

            // Compute the new signature from the graph
            match inputs.len() {
                0 => Signature::nullary(ret),
                1 => Signature::unary(find_type(0)?, ret),
                2 => Signature::binary(find_type(0)?, find_type(1)?, ret),
                3 => Signature::ternary(find_type(0)?, find_type(1)?, find_type(2)?, ret),
                n => {
                    assert!((0..n).all(|i| find_type(i).ok() == find_type(0).ok()));
                    Signature::variadic(find_type(0)?, ret)
                }
            }
        };

        // Update the existing signature with it.
        comp.operations[graph[n].index]
            .kind
            .sig_mut()
            .merge(new_sig)?;
    }
    Ok(comp)
}

impl Signature {
    fn merge(&mut self, another: Signature) -> anyhow::Result<()> {
        match (self, &another) {
            (Signature::Nullary(s), Signature::Nullary(o)) => s.merge(o),
            (Signature::Unary(s), Signature::Unary(o)) => s.merge(o),
            (Signature::Binary(s), Signature::Binary(o)) => s.merge(o),
            (Signature::Ternary(s), Signature::Ternary(o)) => s.merge(o),
            (Signature::Variadic(s), o) => s.merge(o),

            (Signature::Nullary(s), o) => Err(anyhow::anyhow!(
                "Cannot merge {:?} with an incompatible signature {:?}",
                s,
                o
            )),
            (Signature::Unary(s), o) => Err(anyhow::anyhow!(
                "Cannot merge {:?} with an incompatible signature {:?}",
                s,
                o
            )),
            (Signature::Binary(s), o) => Err(anyhow::anyhow!(
                "Cannot merge {:?} with an incompatible signature {:?}",
                s,
                o
            )),
            (Signature::Ternary(s), o) => Err(anyhow::anyhow!(
                "Cannot merge {:?} with an incompatible signature {:?}",
                s,
                o
            )),
        }
    }
}

impl NullarySignature {
    fn merge(&mut self, another: &NullarySignature) -> anyhow::Result<()> {
        if let Some(new_type) = self.ret.merge(&another.ret) {
            self.ret = new_type;
        }
        Ok(())
    }
}

impl UnarySignature {
    fn merge(&mut self, another: &UnarySignature) -> anyhow::Result<()> {
        if let Some(new_type) = self.arg0.merge(&another.arg0) {
            self.arg0 = new_type;
        }
        if let Some(new_type) = self.ret.merge(&another.ret) {
            self.ret = new_type;
        }
        Ok(())
    }
}

impl BinarySignature {
    fn merge(&mut self, another: &BinarySignature) -> anyhow::Result<()> {
        if let Some(new_type) = self.arg0.merge(&another.arg0) {
            self.arg0 = new_type;
        }
        if let Some(new_type) = self.arg1.merge(&another.arg1) {
            self.arg1 = new_type;
        }
        if let Some(new_type) = self.ret.merge(&another.ret) {
            self.ret = new_type;
        }
        Ok(())
    }
}

impl TernarySignature {
    fn merge(&mut self, another: &TernarySignature) -> anyhow::Result<()> {
        if let Some(new_type) = self.arg0.merge(&another.arg0) {
            self.arg0 = new_type;
        }
        if let Some(new_type) = self.arg1.merge(&another.arg1) {
            self.arg1 = new_type;
        }
        if let Some(new_type) = self.arg2.merge(&another.arg2) {
            self.arg2 = new_type;
        }
        if let Some(new_type) = self.ret.merge(&another.ret) {
            self.ret = new_type;
        }
        Ok(())
    }
}

impl VariadicSignature {
    fn merge(&mut self, another: &Signature) -> anyhow::Result<()> {
        match another {
            Signature::Variadic(sig) => {
                if let Some(new_type) = self.args.merge(&sig.args) {
                    self.args = new_type;
                }
                if let Some(new_type) = self.ret.merge(&sig.ret) {
                    self.ret = new_type;
                }
                Ok(())
            }
            Signature::Unary(sig) => {
                if self.args == sig.arg0 {
                    if let Some(new_type) = self.args.merge(&sig.arg0) {
                        self.args = new_type;
                    }
                }

                if let Some(new_type) = self.ret.merge(&sig.ret) {
                    self.ret = new_type;
                }
                Ok(())
            }
            Signature::Binary(sig) => {
                if self.args == sig.arg0 && self.args == sig.arg1 {
                    if let Some(new_type) = self.args.merge(&sig.arg0) {
                        self.args = new_type;
                    }

                    if let Some(new_type) = self.args.merge(&sig.arg1) {
                        self.args = new_type;
                    }
                }

                if let Some(new_type) = self.ret.merge(&sig.ret) {
                    self.ret = new_type;
                }

                Ok(())
            }
            Signature::Ternary(sig) => {
                if self.args == sig.arg0 && self.args == sig.arg1 && self.args == sig.arg2 {
                    if let Some(new_type) = self.args.merge(&sig.arg0) {
                        self.args = new_type;
                    }

                    if let Some(new_type) = self.args.merge(&sig.arg1) {
                        self.args = new_type;
                    }

                    if let Some(new_type) = self.args.merge(&sig.arg2) {
                        self.args = new_type;
                    }
                }

                if let Some(new_type) = self.ret.merge(&sig.ret) {
                    self.ret = new_type;
                }

                Ok(())
            }
            o => Err(anyhow::anyhow!(
                "Cannot merge {:?} with an incompatible signature {:?}",
                self,
                o
            )),
        }
    }
}

impl Ty {
    /// Merge type information.
    ///
    /// Returns `Some(new_type)` if a merge produced a new type.
    /// Otherwise returns None
    fn merge(&self, another: &Ty) -> Option<Ty> {
        match self {
            Ty::Unknown => Some(*another),
            // TODO: make sure another dtype is also a tensor
            Ty::Tensor(TensorDType::Unknown) => Some(*another),
            // TODO: make sure another dtype is also a shape
            Ty::Shape(TensorShape::Unknown) => Some(*another),
            _ => None,
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::textual::ToTextual;
    use std::convert::TryInto;

    #[test]
    fn test_all_on_one_host() -> std::result::Result<(), anyhow::Error> {
        let source = r#"
        x = Constant{value=HostFloat32Tensor([[1.0, 2.0], [3.0, 4.0]])}: () -> HostFloat32Tensor @Host(alice)
        y = Constant{value=HostFloat32Tensor([[1.0, 2.0], [3.0, 4.0]])}: () -> HostFloat32Tensor @Host(alice)
        mul = Mul: (HostFloat32Tensor, HostFloat32Tensor) -> HostFloat32Tensor (x, y) @Host(alice)
        dot = Dot: (HostFloat32Tensor, HostFloat32Tensor) -> HostFloat32Tensor (x, y) @Host(alice)
        mean = Mean{}: (HostFloat32Tensor) -> HostFloat32Tensor (dot) @Host(alice)
        constant_0 = Constant{value = HostString("regression_weights")}: () -> HostString () @Host(alice)
        save = Save: (HostString, Unknown) -> HostUnit (constant_0, mean) @Host(alice)
        "#;

        let comp = update_types_one_hop(source.try_into()?)?.to_textual();
        // The computation should now contain the type information
        assert!(comp.contains(
            "save = Save: (HostString, HostFloat32Tensor) -> HostUnit (constant_0, mean) @Host(alice)"
        ));
        Ok(())
    }
}