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
|
open Netlist_ast
type t = program -> (arg * program)
let id =
let cnt = ref 0 in
fun s ->
let res = s ^ "_l_" ^ (string_of_int !cnt) in
incr cnt; res
let get_size p arg = match arg with
| Avar(id) -> Env.find id p.p_vars
| Aconst(k) -> Array.length k
let add p id eq size =
assert (not (Env.mem id p.p_vars)
|| (Env.find id p.p_vars = size));
assert (not (List.mem_assoc id p.p_eqs));
{ p with
p_eqs = (id, eq)::p.p_eqs;
p_vars = Env.add id size p.p_vars }
let get id =
fun p ->
assert (Env.mem id p.p_vars);
(Avar id, p)
let loop s =
let i = id "" in
(fun p ->
(Avar i),
{ p_eqs = p.p_eqs;
p_inputs = p.p_inputs;
p_outputs = p.p_outputs;
p_vars = Env.add i s p.p_vars }),
(fun v1 ->
fun p ->
(Avar i),
(if List.mem_assoc i p.p_eqs then p else
let x, p = v1 p in
add p i (Earg x) s))
let ignore v1 v2 =
fun p ->
let v1, p = v1 p in
v2 p
let ( ^. ) v1 v2 = ignore v1 v2
let const n =
let l = String.length n in
let v = Array.init l (fun i -> n.[i] = '1') in
fun p ->
(Aconst v, p)
let ( ++ ) v1 v2 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let sz1, sz2 = get_size p x1, get_size p x2 in
if sz1 = 0 then
(x2), p
else if sz2 = 0 then
(x1), p
else
(Avar i), add p i (Econcat (x1, x2)) (sz1 + sz2)
let ( ^| ) v1 v2 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let sz = get_size p x1 in
assert (sz = get_size p x2);
(Avar i), add p i (Ebinop (Or, x1, x2)) sz
let ( ^^ ) v1 v2 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let sz = get_size p x1 in
assert (sz = get_size p x2);
(Avar i), add p i (Ebinop (Xor, x1, x2)) sz
let ( ^& ) v1 v2 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let sz = get_size p x1 in
assert (sz = get_size p x2);
(Avar i), add p i (Ebinop (And, x1, x2)) sz
let ( ^$ ) v1 v2 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let sz = get_size p x1 in
assert (sz = get_size p x2);
(Avar i), add p i (Ebinop (Nand, x1, x2)) sz
let not v1 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x, p = v1 p in
(Avar i), add p i (Enot (x)) (get_size p x)
let mux v1 v2 v3 =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x1, p = v1 p in
let x2, p = v2 p in
let x3, p = v3 p in
let sz = get_size p x2 in
assert (get_size p x3 = sz);
assert (get_size p x1 = 1);
(Avar i), add p i (Emux (x1, x2, x3)) sz
let ( ** ) v s =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x, p = v p in
let sz = get_size p x in
assert (s >= 0 && s < sz);
(Avar i), add p i (Eselect (s, x)) 1
let ( % ) v (s1, s2) =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let x, p = v p in
let sz = get_size p x in
assert (s1 >= 0 && s2 >= s1 && sz > s2);
(Avar i), add p i (Eslice (s1, s2, x)) (s2 - s1 + 1)
let rom i a_s w_s ra =
let i = id i in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let ra, p = ra p in
assert ((get_size p ra) = a_s);
(Avar i), add p i (Erom (a_s, w_s, ra)) w_s
let ram a_s w_s ra we wa d =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let ra, p = ra p in
let we, p = we p in
let wa, p = wa p in
let d, p = d p in
assert ((get_size p ra) = a_s);
assert ((get_size p wa) = a_s);
assert ((get_size p we) = 1);
assert ((get_size p d) = w_s);
(Avar i), add p i (Eram (a_s, w_s, ra, we, wa, d)) w_s
let reg n v =
let i = id "" in
fun p ->
if List.mem_assoc i p.p_eqs then Avar i, p else
let v, p = v p in
assert (get_size p v = n);
match v with
| Avar j ->
(Avar i), add p i (Ereg j) n
| Aconst k ->
(Avar i), add p i (Earg v) n
let program entries outputs =
let p =
{ p_eqs = [];
p_inputs = (List.map fst entries);
p_outputs = [];
p_vars = List.fold_left
(fun k (e, s) -> Env.add e s k) Env.empty entries }
in
let p, outputs = List.fold_left
(fun (p, outputs) (name, size, x) ->
let x, p = x p in
assert (get_size p x = size);
if x = Avar(name) then
p, name::outputs
else if name <> "" then
add p name (Earg x) size, name::outputs
else
p, outputs)
(p, []) outputs
in
{ p with
p_outputs = List.rev outputs }
|
