-
Notifications
You must be signed in to change notification settings - Fork 0
/
nested_expr.rs
326 lines (320 loc) · 12.1 KB
/
nested_expr.rs
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
use crate::ast::parse_ast::*;
use global_counter::global_counter;
/*
This file is used to "flatten" every statement in the program.
Expr can currently be nested. Netlists cannot be nested, so the tree will need to be
flattened at some point. As it makes the tree simpler to process, it is better done
close to the beginning.
The functions in this file transform :
a = 1 + 0 * b + f(0)
in:
x = 0*b
y = 1 + x
z = f(0)
a = y + z
(the names x, y, z are actually generated using the # character,
which is a forbidden character for variables names to avoid conflicts, and a global counter.)
(the $ character will be used instead for funtion and automaton calls,
with tracking information embedded inside the name)
*/
//the global counter
global_counter!(FLATTEN_EXPR_COUNTER, u32, 0);
//wrapper function to call the other functions on every statement in the program
pub fn flatten(prog: &mut Program) {
//statements in functions
for (_, f) in prog.functions.iter_mut() {
f.statements = f
.statements
.drain(..)
.flat_map(|stat| {
let (v, r) = (Some(flatten_statement(stat).into_iter().map(|s| s)), None);
v.into_iter().flatten().chain(r)
})
.collect::<Vec<Statement>>();
}
//statements in automata
for (_, m) in &mut prog.automata {
for (_, state) in &mut m.states {
let State {
name,
weak: _,
statements,
transitions,
} = state;
*statements = statements
.drain(..)
.flat_map(|stat| {
let (v, r) = (Some(flatten_statement(stat).into_iter().map(|s| s)), None);
v.into_iter().flatten().chain(r)
})
.collect::<Vec<Statement>>();
//transition must be handled as well.
//They are flattened into statements in the end of the state body
*transitions = transitions
.drain(..)
.map(|transition| {
//important to avoid creating cycles by taking shared vars out of transitions.
if let Expr::Var(_) = transition.condition.unwrap_ref() {
return transition;
}
let pos = transition.condition.loc;
let (mut v, expr) = flatten_expr(
name,
Loc::new(
transition.condition.loc,
transition.condition.value.unwrap(),
),
);
statements.append(&mut v);
let name = get_name(name);
statements.push(Statement::Assign(vec![VarAssign {
var: Loc::new(pos, name.clone()),
expr: Loc::new(pos, expr),
}]));
Transition {
condition: Loc::new(pos, TrCond::Expr(Expr::Var(Loc::new(pos, name)))),
..transition
}
})
.collect::<Vec<Transition>>();
}
}
}
//transforms a statement with a potentially nested expression inside into multiple statements
fn flatten_statement(statement: Statement) -> Vec<Statement> {
match statement {
Statement::Assign(mut var_assign) => {
let mut res = Vec::new();
for assign in var_assign.drain(..) {
let name = assign.var.value.clone();
let expr_pos = assign.expr.loc;
let (mut statements, expr_out) = flatten_expr(&name, assign.expr);
res.append(&mut statements);
res.push(Statement::Assign(vec![VarAssign {
expr: Loc::new(expr_pos, expr_out),
var: assign.var,
}]))
}
res
}
Statement::If(IfStruct {
condition,
mut if_block,
mut else_block,
}) => {
let v1 = if_block.drain(..).flat_map(|stat| {
let (v, r) = (Some(flatten_statement(stat).into_iter().map(|s| s)), None);
v.into_iter().flatten().chain(r)
});
let v2 = else_block.drain(..).flat_map(|stat| {
let (v, r) = (Some(flatten_statement(stat).into_iter().map(|s| s)), None);
v.into_iter().flatten().chain(r)
});
vec![Statement::If(IfStruct {
condition: condition,
if_block: v1.collect::<Vec<Statement>>(),
else_block: v2.collect::<Vec<Statement>>(),
})]
}
Statement::FnAssign(mut fn_assign) => {
let pos = fn_assign.f.name.loc;
let fn_name = fn_assign.f.name.value.clone();
let mut res = Vec::new();
fn_assign.f.args = Loc::new(
pos,
fn_assign
.f
.args
.drain(..)
.map(|a| {
let (mut stmts, e_out) = flatten_expr(&fn_name, a.clone());
res.append(&mut stmts);
Loc::new(a.loc, e_out)
})
.collect::<Vec<Loc<Expr>>>(),
);
res.push(Statement::FnAssign(fn_assign));
res
}
Statement::ExtAutomaton(_) => {
panic!("Should not happen: nested automaton after they are collapsed")
}
}
}
//generates a name
fn get_name(name: &String) -> String {
let counter = FLATTEN_EXPR_COUNTER.get_cloned();
FLATTEN_EXPR_COUNTER.inc();
format!("{}#flatten#{}", name, counter)
}
//takes a variable name and an expression as an arg, returns a variable and statements,
//such that if the statements are computed first then the variable contains the value of the expr
fn flatten_expr(name: &String, expr: Loc<Expr>) -> (Vec<Statement>, Expr) {
let mut res = Vec::new();
let glob_pos = expr.loc;
let e_ret = match expr.value {
Expr::Const(_) | Expr::Var(_) => expr.value,
Expr::Last(v) => {
let name = Loc::new(v.loc, get_name(&v.value));
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(glob_pos, Expr::Last(v)),
}]));
Expr::Var(name)
}
Expr::FnCall(mut fn_call) => {
let name = Loc::new(glob_pos, get_name(name));
let fn_name = fn_call.name.value.clone();
fn_call.args = Loc::new(
glob_pos,
fn_call
.args
.drain(..)
.map(|a| {
let (mut stmts, e_out) = flatten_expr(&fn_name, a.clone());
res.append(&mut stmts);
Loc::new(a.loc, e_out)
})
.collect::<Vec<Loc<Expr>>>(),
);
res.push(Statement::FnAssign(FnAssign {
vars: vec![name.clone()],
f: fn_call,
}));
Expr::Var(name)
}
Expr::Not(e_in) => {
let (mut v, e_out) = flatten_expr(name, Loc::new(expr.loc, *e_in));
let name = Loc::new(expr.loc, get_name(name));
res.append(&mut v);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(expr.loc, Expr::Not(Box::new(e_out))),
}]));
Expr::Var(name)
}
Expr::Slice(e_in, c1, c2) => {
let pos = e_in.loc;
let (mut v, e_out) = flatten_expr(name, *e_in);
let name = Loc::new(expr.loc, get_name(name));
res.append(&mut v);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(
expr.loc,
Expr::Slice(Box::new(Loc::new(pos, e_out)), c1, c2),
),
}]));
Expr::Var(name)
}
Expr::BiOp(op, e1, e2) => {
let pos1 = e1.loc;
let pos2 = e2.loc;
let (mut v1, e_out1) = flatten_expr(name, *e1);
let (mut v2, e_out2) = flatten_expr(name, *e2);
let name = Loc::new(pos1, get_name(name));
res.append(&mut v1);
res.append(&mut v2);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(
pos1,
Expr::BiOp(
op,
Box::new(Loc::new(pos1, e_out1)),
Box::new(Loc::new(pos2, e_out2)),
),
),
}]));
Expr::Var(name)
}
Expr::Mux(e1, e2, e3) => {
let pos1 = e1.loc;
let pos2 = e2.loc;
let pos3 = e3.loc;
let (mut v1, e_out1) = flatten_expr(name, *e1);
let (mut v2, e_out2) = flatten_expr(name, *e2);
let (mut v3, e_out3) = flatten_expr(name, *e3);
let name = Loc::new(glob_pos, get_name(name));
res.append(&mut v1);
res.append(&mut v2);
res.append(&mut v3);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(
glob_pos,
Expr::Mux(
Box::new(Loc::new(pos1, e_out1)),
Box::new(Loc::new(pos2, e_out2)),
Box::new(Loc::new(pos3, e_out3)),
),
),
}]));
Expr::Var(name)
}
Expr::Reg(c, e_in) => {
let (mut v, e_out) = flatten_expr(name, Loc::new(expr.loc, e_in.value));
let name = Loc::new(e_in.loc, get_name(name));
res.append(&mut v);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(expr.loc, Expr::Reg(c, Box::new(Loc::new(e_in.loc, e_out)))),
}]));
Expr::Var(name)
}
Expr::Ram(RamStruct {
read_addr: e1,
write_enable: e2,
write_addr: e3,
write_data: e4,
}) => {
let pos1 = e1.loc;
let pos2 = e2.loc;
let pos3 = e3.loc;
let pos4 = e4.loc;
let (mut v1, e_out1) = flatten_expr(name, *e1);
let (mut v2, e_out2) = flatten_expr(name, *e2);
let (mut v3, e_out3) = flatten_expr(name, *e3);
let (mut v4, e_out4) = flatten_expr(name, *e4);
let name = Loc::new(pos1, get_name(name));
res.append(&mut v1);
res.append(&mut v2);
res.append(&mut v3);
res.append(&mut v4);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(
pos1,
Expr::Ram(RamStruct {
read_addr: Box::new(Loc::new(pos1, e_out1)),
write_enable: Box::new(Loc::new(pos2, e_out2)),
write_addr: Box::new(Loc::new(pos3, e_out3)),
write_data: Box::new(Loc::new(pos4, e_out4)),
}),
),
}]));
Expr::Var(name)
}
Expr::Rom(RomStruct {
word_size,
read_addr,
}) => {
let pos = read_addr.loc;
let (mut v, e_out) = flatten_expr(name, *read_addr);
let name = Loc::new(pos, get_name(name));
res.append(&mut v);
res.push(Statement::Assign(vec![VarAssign {
var: name.clone(),
expr: Loc::new(
pos,
Expr::Rom(RomStruct {
read_addr: Box::new(Loc::new(pos, e_out)),
word_size,
}),
),
}]));
Expr::Var(name)
}
};
(res, e_ret)
}