Mercurial > repos > rhope
annotate nworker.rhope @ 19:90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
author | Mike Pavone <pavone@retrodev.com> |
---|---|
date | Wed, 27 May 2009 21:29:15 +0000 |
parents | 73e978d590c7 |
children | b715532225c0 |
rev | line source |
---|---|
2 | 1 Import extendlib.rhope |
2 | |
3 Set@Range[range,index,val:out] | |
4 { | |
5 out <- [[()]Concatenate[range] | |
6 ]Set[index,val] | |
7 } | |
8 | |
9 List of Lists[num:out] | |
10 { | |
11 out <- Fold[["Append"]Set Input[1, ()],(), Range[0,num]] | |
12 } | |
13 | |
14 Blueprint Worker Ref | |
15 { | |
16 Name | |
17 Convention | |
18 Inputs | |
19 Outputs | |
20 } | |
21 | |
22 Worker Ref[name,convention,inputs,outputs:out] | |
23 { | |
24 out <- [[[[Build["Worker Ref"]]Name <<[name]]Convention <<[convention]]Inputs <<[inputs]]Outputs <<[outputs] | |
25 } | |
26 | |
27 Blueprint Node Ref | |
28 { | |
29 Index | |
30 IO Num | |
31 } | |
32 | |
33 Node Ref[index,ionum:out] | |
34 { | |
35 out <- [[Build["Node Ref"]]Index <<[index]]IO Num <<[ionum] | |
36 } | |
37 | |
38 =@Node Ref[left,right:out] | |
39 { | |
40 ,out <- If[[[left]Index >>] = [[right]Index >>]] | |
41 { | |
42 out <- [[left]IO Num>>] = [[right]IO Num >>] | |
43 } | |
44 } | |
45 | |
46 Blueprint NWorker Node | |
47 { | |
48 Type | |
49 Data | |
50 Inputs | |
51 Outputs | |
52 Wires From | |
53 Wires To | |
54 } | |
55 | |
56 Wire To@NWorker Node[node,from,output,input:out] | |
57 { | |
58 out <- [node]Wires To <<[ | |
59 [[node]Wires To >>]Set[input, | |
60 [[[node]Wires To >>]Index[input] | |
61 ]Append[Node Ref[from,output]] | |
62 ] | |
63 ] | |
64 } | |
65 | |
66 Wire From@NWorker Node[node,to,input,output:out] | |
67 { | |
68 out <- [node]Wires From <<[ | |
69 [[node]Wires From >>]Set[output, | |
70 [[[node]Wires From >>]Index[output] | |
71 ]Append[Node Ref[to,input]] | |
72 ] | |
73 ] | |
74 } | |
75 | |
76 _Dependency[dlist,ref:out] | |
77 { | |
78 [dlist]Find[ref] | |
79 { | |
80 out <- dlist | |
81 }{ | |
82 out <- [dlist]Append[ref] | |
83 } | |
84 } | |
85 | |
86 Dependencies@NWorker Node[node:out] | |
87 { | |
88 out <- Fold[["Fold"]Set Input[0, "_Dependency"], (), [node]Wires To >>] | |
89 } | |
90 | |
91 | |
92 NWorker Node[type,data,inputs,outputs:out] | |
93 { | |
94 out <- [[[[[[Build["NWorker Node"] | |
95 ]Type <<[type] | |
96 ]Data <<[data] | |
97 ]Inputs <<[inputs] | |
98 ]Outputs <<[outputs] | |
99 ]Wires From <<[List of Lists[outputs]] | |
100 ]Wires To <<[List of Lists[inputs]] | |
101 } | |
102 | |
103 Blueprint NWorker | |
104 { | |
105 Convention | |
106 Nodes | |
107 Inputs | |
108 Outputs | |
19
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
109 NodeResults |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
110 Free Temps |
2 | 111 } |
112 | |
113 NWorker[convention:out] | |
114 { | |
115 out <- [[[[Build["NWorker"]]Convention <<[convention]]Nodes <<[()]]Inputs <<[()]]Outputs <<[()] | |
116 } | |
117 | |
118 Add Node@NWorker[worker,type,data,inputs,outputs:out,node index] | |
119 { | |
120 out <- [worker]Nodes <<[[[worker]Nodes >>]Append[NWorker Node[type,data,inputs,outputs]]] | |
121 node index <- [[worker]Nodes >>]Length | |
122 } | |
123 | |
124 Add Worker Call@NWorker[worker,tocall:out,node index] | |
125 { | |
126 out, node index <- [worker]Add Node["call",tocall,[tocall]Inputs >>,[tocall]Outputs >>] | |
127 } | |
128 | |
129 Add Constant@NWorker[worker,constant:out,node index] | |
130 { | |
131 out, node index <- [worker]Add Node["const",constant,0,1] | |
132 } | |
133 | |
134 Add Input@NWorker[worker,name,number:out,node index] | |
135 { | |
136 ,node index <- [worker]Add Node["input",number,0,1] | |
137 { out <- [~]Inputs <<[[[~]Inputs >>]Set[number,name]] } | |
138 } | |
139 | |
140 Add Output@NWorker[worker,name,number:out,node index] | |
141 { | |
142 ,node index <- [worker]Add Node["output",number,1,0] | |
143 { out <- [~]Outputs <<[[[~]Outputs >>]Set[number,name]] } | |
144 } | |
145 | |
146 Add Wire@NWorker[worker,from,output,to,input:out] | |
147 { | |
148 fromw <- [[[worker]Nodes >>]Index[from]]Wire From[to,input,output] | |
149 tow <- [[[worker]Nodes >>]Index[to]]Wire To[from,output,input] | |
150 nodes <- [[[worker]Nodes >>]Set[from, fromw]]Set[to, tow] | |
151 out <- [worker]Nodes <<[nodes] | |
152 } | |
153 | |
154 _No Dependencies[list,node,index:out] | |
155 { | |
156 [[node]Wires To>>]First | |
157 { | |
158 out <- Val[list] | |
159 }{ | |
160 out <- [list]Append[index] | |
161 } | |
162 } | |
163 | |
164 No Dependencies@NWorker[worker:out] | |
165 { | |
166 out <- Fold["_No Dependencies", (), [worker]Nodes >>] | |
167 } | |
168 | |
169 _Collect Dests[candidates,wire:out] | |
170 { | |
171 out <- [candidates]Set[[wire]Index >>, Yes] | |
172 } | |
173 | |
174 Collect Dests@NWorker[worker,candidates,node index:out] | |
175 { | |
176 out <- Fold[["Fold"]Set Input[0, "_Collect Dests"], candidates, [[[worker]Nodes >>]Index[node index]]Wires From >>] | |
177 } | |
178 | |
179 Check Dependency@NWorker[worker,nodes,wires,wire index:met?] | |
180 { | |
181 ref <- [wires]Index[wire index] | |
182 [nodes]Find[[ref]Index >>] | |
183 { | |
184 [wires]Next[wire index] | |
185 { | |
186 met? <- [worker]Check Dependency[nodes,wires,~] | |
187 }{ | |
188 met? <- Yes | |
189 } | |
190 }{ | |
191 Print[[ref]Index >>] | |
192 met? <- No | |
193 } | |
194 } | |
195 _Check Dependencies@NWorker[worker,nodes,inputs,input index:met?] | |
196 { | |
197 wires <- [inputs]Index[input index] | |
198 [wires]First | |
199 { | |
200 current met? <- [worker]Check Dependency[nodes, wires, ~] | |
201 }{ | |
202 current met? <- Yes | |
203 } | |
204 If[current met?] | |
205 { | |
206 [inputs]Next[input index] | |
207 { | |
208 met? <- [worker]_Check Dependencies[nodes,inputs,~] | |
209 }{ | |
210 met? <- Yes | |
211 } | |
212 }{ | |
213 met? <- No | |
214 } | |
215 } | |
216 | |
217 Check Dependencies@NWorker[worker,nodes,candidate:met?] | |
218 { | |
219 inputs <- [[[worker]Nodes >>]Index[candidate]]Wires To >> | |
220 [inputs]First | |
221 { | |
222 met? <- [worker]_Check Dependencies[nodes, inputs, ~] | |
223 }{ | |
224 met? <- Yes | |
225 } | |
226 } | |
227 | |
228 Dependants@NWorker[worker,direct nodes,nodes:out] | |
229 { | |
230 candidates <- Keys[Fold[["Collect Dests"]Set Input[0,worker], (), direct nodes]] | |
231 out <- Filter[candidates, [["Check Dependencies"]Set Input[0, worker]]Set Input[1, nodes]] | |
232 } | |
233 | |
234 _Dependency Groups@NWorker[worker,last,all,grouped:out] | |
235 { | |
236 current <- [worker]Dependants[last,all] | |
237 [current]First | |
238 { | |
239 out <- [worker]_Dependency Groups[current, [all]Concatenate[current], [grouped]Append[current]] | |
240 }{ | |
241 out <- grouped | |
242 } | |
243 } | |
244 Dependency Groups@NWorker[worker:out] | |
245 { | |
246 no deps <- [worker]No Dependencies | |
247 out <- [worker]_Dependency Groups[no deps, no deps, [()]Append[no deps]] | |
248 } | |
249 | |
19
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
250 Compile Node@NWorker[worker,program,func,nodes,current:out] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
251 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
252 node <- [[worker]Nodes >>]Index[[nodes]Index[current]] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
253 If[[[node]Type >>] = [""]] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
254 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
255 nfunc <- [func]Call[[[node]Data >>]Name >>, ()] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
256 }{ |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
257 nfunc <- Val[func] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
258 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
259 [nodes]Next[current] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
260 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
261 out <- [worker]Compile Node[program,func,nodes,~] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
262 }{ |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
263 out <- Val[nfunc] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
264 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
265 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
266 |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
267 Compile Group@NWorker[worker,program,func,groups,current:out] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
268 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
269 nodes <- [groups]Index[current] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
270 [nodes]First |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
271 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
272 nfunc <- [worker]Compile Node[program,func,nodes,~] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
273 }{ |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
274 nfunc <- Val[func] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
275 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
276 [groups]Next[current] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
277 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
278 out <- [worker]Compile Group[program,func,groups,~] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
279 }{ |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
280 out <- Val[nfunc] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
281 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
282 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
283 |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
284 Compile Worker@NWorker[worker,program,name:out] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
285 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
286 func <- [program]Create Function[name,[worker]Inputs >>, [worker]Outputs >>, [worker]Convention >>] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
287 groups <- [worker]Dependency Groups |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
288 [groups]First |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
289 { |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
290 final func <- [worker]Compile Group[program,func,groups, ~] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
291 }{ |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
292 final func <- Val[func] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
293 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
294 out <- [program]Store Function[func] |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
295 } |
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
296 |
2 | 297 Test[:out] |
298 { | |
299 ref+ <- Worker Ref["+","cdecl",2,1] | |
300 ref* <- Worker Ref["*","cdecl",2,1] | |
301 ,a <- [NWorker["cdecl"] | |
302 ]Add Input["a", 0] { | |
303 ,b <- [~]Add Input["b", 1] { | |
304 ,c <- [~]Add Input["c", 2] { | |
305 ,outref <- [~]Add Output["out", 0] { | |
306 ,call+ <- [~]Add Worker Call[ref+] { | |
307 ,call* <- [~]Add Worker Call[ref*] { | |
308 out <- [[[[[~]Add Wire[a,0,call+,0] | |
309 ]Add Wire[b,0,call+,1] | |
310 ]Add Wire[call+,0,call*,0] | |
311 ]Add Wire[c,0,call*,1] | |
312 ]Add Wire[call*,0,outref,0] | |
313 }}}}}} | |
19
90c20dc3f4e5
Initial work on compiling dataflow graphs to a backend
Mike Pavone <pavone@retrodev.com>
parents:
2
diff
changeset
|
314 } |