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
use prelude::*;
use std::collections::hash_map::{HashMap, Entry};
use node::{NodeRc, Node};
use func::{Func, Transient};
use vm::Vm;
pub struct Compiler<'a, V: Vm + 'a> {
uses: HashMap<&'a Node, usize>,
storage: HashMap<&'a Node, V::Storage>,
sources: HashMap<&'a str, V::Var>,
vm: &'a mut V
}
impl<'a, V: Vm + 'a> Compiler<'a, V> {
fn visit(&mut self, node: &'a Node) -> Result<Vec<&'a str>, Error> {
let mut vars = vec![];
let mut queue = vec![node];
while let Some(node) = queue.pop() {
match self.uses.entry(node) {
Entry::Vacant(v) => {
v.insert(1);
match *node {
Node::Poly(ref p) => {
for (base, _) in p.factors() {
queue.extend(base.iter().map(|b| &*b.0));
}
},
Node::Apply(ref f, ref g) => match **f {
Node::Op(Func::Transient(_)) => queue.push(g),
_ => bug!("only transients are allowed as left argument of apply"),
}
Node::Var(ref name) => vars.push(name.as_str()),
Node::Tuple(ref parts) => queue.extend(parts.iter().map(|n| &**n)),
Node::Op(_) => bug!("no transients allowd outside of apply")
}
},
Entry::Occupied(mut o) => *o.get_mut() += 1
}
}
Ok(vars)
}
pub fn new(vm: &'a mut V) -> Compiler<'a, V> {
Compiler {
uses: HashMap::new(),
storage: HashMap::new(),
sources: HashMap::new(),
vm: vm
}
}
pub fn run(vm: &'a mut V, root: &'a Node) -> Result<V::Var, Error> {
let mut comp = Compiler::new(vm);
let mut vars = comp.visit(root)?;
vars.sort();
for name in vars {
let var = comp.vm.make_source(name);
comp.sources.insert(name, var);
}
comp.generate(root)
}
pub fn compile(vm: &mut V, nodes: &[NodeRc], vars: &[&str]) -> Result<Vec<V::Var>, Error>
{
let mut comp = Compiler::new(vm);
for n in nodes.iter() {
comp.visit(&**n)?;
}
for &name in vars.iter() {
let var = comp.vm.make_source(name);
println!("source {} @ {:?}", name, var);
comp.sources.insert(name, var);
}
for (n, u) in comp.uses.iter() {
println!("{}: {}", u, n);
}
let mut vars = Vec::with_capacity(nodes.len());
for n in nodes.iter() {
vars.push(comp.generate(&**n)?);
}
Ok(vars)
}
fn generate(&mut self, node: &'a Node) -> Result<V::Var, Error> {
if let Some(stored) = self.storage.get(node) {
return Ok(self.vm.load(stored));
}
println!("{}", node);
let mut var = match *node {
Node::Poly(ref poly) => {
if let Some(i) = poly.as_int() {
return Ok(self.vm.make_int(i));
}
let mut sum = Vec::new();
for (base, &fac) in poly.factors() {
let fac = match fac.as_int() {
Some(1) => None,
Some(i) => Some(self.vm.make_int(i)),
None => Some(self.vm.make_const(fac.to_f64()))
};
let base = match base.len() {
0 => None,
_ => {
let mut prod = Vec::with_capacity(base.len());
for &(ref v, n) in base.iter() {
let v = self.generate(v)?;
prod.push(match n {
0 => continue,
1 => v,
i if i > 0 => self.vm.pow_n(v, i as u32),
i => {
let p = self.vm.pow_n(v, -i as u32);
self.vm.inv(p)
}
});
}
Some(self.vm.make_product(prod))
}
};
sum.push(match (fac, base) {
(None, None) => self.vm.make_int(1),
(Some(f), None) => f,
(None, Some(b)) => b,
(Some(f), Some(b)) => self.vm.mul(f, b)
});
}
match sum.len() {
0 => self.vm.make_int(0),
1 => sum.pop().unwrap(),
_ => self.vm.make_sum(sum)
}
},
Node::Var(ref name) => {
println!("use {}", name);
self.sources.remove(name.as_str()).ok_or(Error::Undefined(name.clone()))?
},
Node::Apply(ref f, ref g) => match **f {
Node::Op(Func::Transient(f)) => {
use self::Transient::*;
let x = self.generate(g)?;
match f {
Sin => self.vm.sin(x),
Cos => self.vm.cos(x),
_ => todo!("implement all functions for avx")
}
},
_ => todo!("implement non-transient apply ops")
},
Node::Op(_) => bug!("operators are not allowed outside apply"),
Node::Tuple(_) => todo!("implement tuples")
};
println!("{} uses for {} (stored in {:?})", self.uses[node], node, var);
match self.uses[node] {
0 => unreachable!(),
1 => {},
n => {
self.storage.insert(node, self.vm.store(&mut var, n-1));
}
}
Ok(var)
}
}