lustrec / src / machine_code.ml @ f7caf067
History  View  Annotate  Download (25.6 KB)
1 
(********************************************************************) 

2 
(* *) 
3 
(* The LustreC compiler toolset / The LustreC Development Team *) 
4 
(* Copyright 2012   ONERA  CNRS  INPT *) 
5 
(* *) 
6 
(* LustreC is free software, distributed WITHOUT ANY WARRANTY *) 
7 
(* under the terms of the GNU Lesser General Public License *) 
8 
(* version 2.1. *) 
9 
(* *) 
10 
(********************************************************************) 
11  
12 
open LustreSpec 
13 
open Corelang 
14 
open Clocks 
15 
open Causality 
16  
17 
let print_statelocaltag = true 
18 

19 
exception NormalizationError 
20  
21 
module OrdVarDecl:Map.OrderedType with type t=var_decl = 
22 
struct type t = var_decl;; let compare = compare end 
23  
24 
module ISet = Set.Make(OrdVarDecl) 
25  
26 
let rec pp_val fmt v = 
27 
match v.value_desc with 
28 
 Cst c > Printers.pp_const fmt c 
29 
 LocalVar v > 
30 
if print_statelocaltag then 
31 
Format.fprintf fmt "%s(L)" v.var_id 
32 
else 
33 
Format.pp_print_string fmt v.var_id 
34 

35 
 StateVar v > 
36 
if print_statelocaltag then 
37 
Format.fprintf fmt "%s(S)" v.var_id 
38 
else 
39 
Format.pp_print_string fmt v.var_id 
40 
 Array vl > Format.fprintf fmt "[%a]" (Utils.fprintf_list ~sep:", " pp_val) vl 
41 
 Access (t, i) > Format.fprintf fmt "%a[%a]" pp_val t pp_val i 
42 
 Power (v, n) > Format.fprintf fmt "(%a^%a)" pp_val v pp_val n 
43 
 Fun (n, vl) > Format.fprintf fmt "%s (%a)" n (Utils.fprintf_list ~sep:", " pp_val) vl 
44  
45 
let rec pp_instr fmt i = 
46 
match i with 
47 
 MLocalAssign (i,v) > Format.fprintf fmt "%s<l %a" i.var_id pp_val v 
48 
 MStateAssign (i,v) > Format.fprintf fmt "%s<s %a" i.var_id pp_val v 
49 
 MReset i > Format.fprintf fmt "reset %s" i 
50 
 MNoReset i > Format.fprintf fmt "noreset %s" i 
51 
 MStep (il, i, vl) > 
52 
Format.fprintf fmt "%a = %s (%a)" 
53 
(Utils.fprintf_list ~sep:", " (fun fmt v > Format.pp_print_string fmt v.var_id)) il 
54 
i 
55 
(Utils.fprintf_list ~sep:", " pp_val) vl 
56 
 MBranch (g,hl) > 
57 
Format.fprintf fmt "@[<v 2>case(%a) {@,%a@,}@]" 
58 
pp_val g 
59 
(Utils.fprintf_list ~sep:"@," pp_branch) hl 
60 
 MComment s > Format.pp_print_string fmt s 
61  
62 
and pp_branch fmt (t, h) = 
63 
Format.fprintf fmt "@[<v 2>%s:@,%a@]" t (Utils.fprintf_list ~sep:"@," pp_instr) h 
64  
65 
and pp_instrs fmt il = 
66 
Format.fprintf fmt "@[<v 2>%a@]" (Utils.fprintf_list ~sep:"@," pp_instr) il 
67  
68 
type step_t = { 
69 
step_checks: (Location.t * value_t) list; 
70 
step_inputs: var_decl list; 
71 
step_outputs: var_decl list; 
72 
step_locals: var_decl list; 
73 
step_instrs: instr_t list; 
74 
step_asserts: value_t list; 
75 
} 
76  
77 
type static_call = top_decl * (Dimension.dim_expr list) 
78  
79 
type machine_t = { 
80 
mname: node_desc; 
81 
mmemory: var_decl list; 
82 
mcalls: (ident * static_call) list; (* map from stateful/stateless instance to node, no internals *) 
83 
minstances: (ident * static_call) list; (* submap of mcalls, from stateful instance to node *) 
84 
minit: instr_t list; 
85 
mstatic: var_decl list; (* static inputs only *) 
86 
mconst: instr_t list; (* assignments of node constant locals *) 
87 
mstep: step_t; 
88 
mspec: node_annot option; 
89 
mannot: expr_annot list; 
90 
} 
91  
92 
(* merge log: get_node_def was in c0f8 *) 
93 
let get_node_def id m = 
94 
try 
95 
let (decl, _) = List.assoc id m.minstances in 
96 
Corelang.node_of_top decl 
97 
with Not_found > raise Not_found 
98 

99 
(* merge log: machine_vars was in 44686 *) 
100 
let machine_vars m = m.mstep.step_inputs @ m.mstep.step_locals @ m.mstep.step_outputs @ m.mmemory 
101  
102 
let pp_step fmt s = 
103 
Format.fprintf fmt "@[<v>inputs : %a@ outputs: %a@ locals : %a@ checks : %a@ instrs : @[%a@]@ asserts : @[%a@]@]@ " 
104 
(Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_inputs 
105 
(Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_outputs 
106 
(Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_locals 
107 
(Utils.fprintf_list ~sep:", " (fun fmt (_, c) > pp_val fmt c)) s.step_checks 
108 
(Utils.fprintf_list ~sep:"@ " pp_instr) s.step_instrs 
109 
(Utils.fprintf_list ~sep:", " pp_val) s.step_asserts 
110  
111  
112 
let pp_static_call fmt (node, args) = 
113 
Format.fprintf fmt "%s<%a>" 
114 
(node_name node) 
115 
(Utils.fprintf_list ~sep:", " Dimension.pp_dimension) args 
116  
117 
let pp_machine fmt m = 
118 
Format.fprintf fmt 
119 
"@[<v 2>machine %s@ mem : %a@ instances: %a@ init : %a@ const : %a@ step :@ @[<v 2>%a@]@ @ spec : @[%t@]@ annot : @[%a@]@]@ " 
120 
m.mname.node_id 
121 
(Utils.fprintf_list ~sep:", " Printers.pp_var) m.mmemory 
122 
(Utils.fprintf_list ~sep:", " (fun fmt (o1, o2) > Format.fprintf fmt "(%s, %a)" o1 pp_static_call o2)) m.minstances 
123 
(Utils.fprintf_list ~sep:"@ " pp_instr) m.minit 
124 
(Utils.fprintf_list ~sep:"@ " pp_instr) m.mconst 
125 
pp_step m.mstep 
126 
(fun fmt > match m.mspec with  None > ()  Some spec > Printers.pp_spec fmt spec) 
127 
(Utils.fprintf_list ~sep:"@ " Printers.pp_expr_annot) m.mannot 
128  
129 
let pp_machines fmt ml = 
130 
Format.fprintf fmt "@[<v 0>%a@]" (Utils.fprintf_list ~sep:"@," pp_machine) ml 
131  
132 

133 
let rec is_const_value v = 
134 
match v.value_desc with 
135 
 Cst _ > true 
136 
 Fun (id, args) > Basic_library.is_value_internal_fun v && List.for_all is_const_value args 
137 
 _ > false 
138  
139 
(* Returns the declared stateless status and the computed one. *) 
140 
let get_stateless_status m = 
141 
(m.mname.node_dec_stateless, Utils.desome m.mname.node_stateless) 
142  
143 
let is_input m id = 
144 
List.exists (fun o > o.var_id = id.var_id) m.mstep.step_inputs 
145  
146 
let is_output m id = 
147 
List.exists (fun o > o.var_id = id.var_id) m.mstep.step_outputs 
148  
149 
let is_memory m id = 
150 
List.exists (fun o > o.var_id = id.var_id) m.mmemory 
151  
152 
let conditional c t e = 
153 
MBranch(c, [ (tag_true, t); (tag_false, e) ]) 
154  
155 
let dummy_var_decl name typ = 
156 
{ 
157 
var_id = name; 
158 
var_orig = false; 
159 
var_dec_type = dummy_type_dec; 
160 
var_dec_clock = dummy_clock_dec; 
161 
var_dec_const = false; 
162 
var_dec_value = None; 
163 
var_type = typ; 
164 
var_clock = Clocks.new_ck Clocks.Cvar true; 
165 
var_loc = Location.dummy_loc 
166 
} 
167  
168 
let arrow_id = "_arrow" 
169  
170 
let arrow_typ = Types.new_ty Types.Tunivar 
171  
172 
let arrow_desc = 
173 
{ 
174 
node_id = arrow_id; 
175 
node_type = Type_predef.type_bin_poly_op; 
176 
node_clock = Clock_predef.ck_bin_univ; 
177 
node_inputs= [dummy_var_decl "_in1" arrow_typ; dummy_var_decl "_in2" arrow_typ]; 
178 
node_outputs= [dummy_var_decl "_out" arrow_typ]; 
179 
node_locals= []; 
180 
node_gencalls = []; 
181 
node_checks = []; 
182 
node_asserts = []; 
183 
node_stmts= []; 
184 
node_dec_stateless = false; 
185 
node_stateless = Some false; 
186 
node_spec = None; 
187 
node_annot = []; } 
188  
189 
let arrow_top_decl = 
190 
{ 
191 
top_decl_desc = Node arrow_desc; 
192 
top_decl_owner = (Options.core_dependency "arrow"); 
193 
top_decl_itf = false; 
194 
top_decl_loc = Location.dummy_loc 
195 
} 
196  
197 
let mk_val v t = { value_desc = v; 
198 
value_type = t; 
199 
value_annot = None } 
200  
201 
let arrow_machine = 
202 
let state = "_first" in 
203 
let var_state = dummy_var_decl state (Types.new_ty Types.Tbool) in 
204 
let var_input1 = List.nth arrow_desc.node_inputs 0 in 
205 
let var_input2 = List.nth arrow_desc.node_inputs 1 in 
206 
let var_output = List.nth arrow_desc.node_outputs 0 in 
207 
let cst b = mk_val (Cst (const_of_bool b)) Type_predef.type_bool in 
208 
let t_arg = Types.new_univar () in (* TODO Xavier: c'est bien la bonne def ? *) 
209 
{ 
210 
mname = arrow_desc; 
211 
mmemory = [var_state]; 
212 
mcalls = []; 
213 
minstances = []; 
214 
minit = [MStateAssign(var_state, cst true)]; 
215 
mstatic = []; 
216 
mconst = []; 
217 
mstep = { 
218 
step_inputs = arrow_desc.node_inputs; 
219 
step_outputs = arrow_desc.node_outputs; 
220 
step_locals = []; 
221 
step_checks = []; 
222 
step_instrs = [conditional (mk_val (StateVar var_state) Type_predef.type_bool) 
223 
[MStateAssign(var_state, cst false); 
224 
MLocalAssign(var_output, mk_val (LocalVar var_input1) t_arg)] 
225 
[MLocalAssign(var_output, mk_val (LocalVar var_input2) t_arg)] ]; 
226 
step_asserts = []; 
227 
}; 
228 
mspec = None; 
229 
mannot = []; 
230 
} 
231  
232 
let empty_desc = 
233 
{ 
234 
node_id = arrow_id; 
235 
node_type = Types.bottom; 
236 
node_clock = Clocks.bottom; 
237 
node_inputs= []; 
238 
node_outputs= []; 
239 
node_locals= []; 
240 
node_gencalls = []; 
241 
node_checks = []; 
242 
node_asserts = []; 
243 
node_stmts= []; 
244 
node_dec_stateless = true; 
245 
node_stateless = Some true; 
246 
node_spec = None; 
247 
node_annot = []; } 
248  
249 
let empty_machine = 
250 
{ 
251 
mname = empty_desc; 
252 
mmemory = []; 
253 
mcalls = []; 
254 
minstances = []; 
255 
minit = []; 
256 
mstatic = []; 
257 
mconst = []; 
258 
mstep = { 
259 
step_inputs = []; 
260 
step_outputs = []; 
261 
step_locals = []; 
262 
step_checks = []; 
263 
step_instrs = []; 
264 
step_asserts = []; 
265 
}; 
266 
mspec = None; 
267 
mannot = []; 
268 
} 
269  
270 
let new_instance = 
271 
let cpt = ref (1) in 
272 
fun caller callee tag > 
273 
begin 
274 
let o = 
275 
if Stateless.check_node callee then 
276 
node_name callee 
277 
else 
278 
Printf.sprintf "ni_%d" (incr cpt; !cpt) in 
279 
let o = 
280 
if !Options.ansi && is_generic_node callee 
281 
then Printf.sprintf "%s_inst_%d" o (Utils.position (fun e > e.expr_tag = tag) caller.node_gencalls) 
282 
else o in 
283 
o 
284 
end 
285  
286  
287 
(* translate_<foo> : node > context > <foo> > machine code/expression *) 
288 
(* the context contains m : state aka memory variables *) 
289 
(* si : initialization instructions *) 
290 
(* j : node aka machine instances *) 
291 
(* d : local variables *) 
292 
(* s : step instructions *) 
293 
let translate_ident node (m, si, j, d, s) id = 
294 
try (* id is a node var *) 
295 
let var_id = get_node_var id node in 
296 
if ISet.exists (fun v > v.var_id = id) m 
297 
then mk_val (StateVar var_id) var_id.var_type 
298 
else mk_val (LocalVar var_id) var_id.var_type 
299 
with Not_found > 
300 
try (* id is a constant *) 
301 
let vdecl = (Corelang.var_decl_of_const (const_of_top (Hashtbl.find Corelang.consts_table id))) in 
302 
mk_val (LocalVar vdecl) vdecl.var_type 
303 
with Not_found > 
304 
(* id is a tag *) 
305 
(* DONE construire une liste des enum declarés et alors chercher dedans la liste 
306 
qui contient id *) 
307 
try 
308 
let typ = (typedef_of_top (Hashtbl.find Corelang.tag_table id)).tydef_id in 
309 
mk_val (Cst (Const_tag id)) (Type_predef.type_const typ) 
310 
with Not_found > (Format.eprintf "internal error: Machine_code.translate_ident %s" id; 
311 
assert false) 
312  
313 
let rec control_on_clock node ((m, si, j, d, s) as args) ck inst = 
314 
match (Clocks.repr ck).cdesc with 
315 
 Con (ck1, cr, l) > 
316 
let id = Clocks.const_of_carrier cr in 
317 
control_on_clock node args ck1 (MBranch (translate_ident node args id, 
318 
[l, [inst]] )) 
319 
 _ > inst 
320  
321 
let rec join_branches hl1 hl2 = 
322 
match hl1, hl2 with 
323 
 [] , _ > hl2 
324 
 _ , [] > hl1 
325 
 (t1, h1)::q1, (t2, h2)::q2 > 
326 
if t1 < t2 then (t1, h1) :: join_branches q1 hl2 else 
327 
if t1 > t2 then (t2, h2) :: join_branches hl1 q2 
328 
else (t1, List.fold_right join_guards h1 h2) :: join_branches q1 q2 
329  
330 
and join_guards inst1 insts2 = 
331 
match inst1, insts2 with 
332 
 _ , [] > 
333 
[inst1] 
334 
 MBranch (x1, hl1), MBranch (x2, hl2) :: q when x1 = x2 > 
335 
MBranch (x1, join_branches (sort_handlers hl1) (sort_handlers hl2)) 
336 
:: q 
337 
 _ > inst1 :: insts2 
338  
339 
let join_guards_list insts = 
340 
List.fold_right join_guards insts [] 
341  
342 
(* specialize predefined (polymorphic) operators 
343 
wrt their instances, so that the C semantics 
344 
is preserved *) 
345 
let specialize_to_c expr = 
346 
match expr.expr_desc with 
347 
 Expr_appl (id, e, r) > 
348 
if List.exists (fun e > Types.is_bool_type e.expr_type) (expr_list_of_expr e) 
349 
then let id = 
350 
match id with 
351 
 "=" > "equi" 
352 
 "!=" > "xor" 
353 
 _ > id in 
354 
{ expr with expr_desc = Expr_appl (id, e, r) } 
355 
else expr 
356 
 _ > expr 
357  
358 
let specialize_op expr = 
359 
match !Options.output with 
360 
 "C" > specialize_to_c expr 
361 
 _ > expr 
362  
363 
let rec translate_expr node ((m, si, j, d, s) as args) expr = 
364 
let expr = specialize_op expr in 
365 
let value_desc = 
366 
match expr.expr_desc with 
367 
 Expr_const v > Cst v 
368 
 Expr_ident x > (translate_ident node args x).value_desc 
369 
 Expr_array el > Array (List.map (translate_expr node args) el) 
370 
 Expr_access (t, i) > Access (translate_expr node args t, translate_expr node args (expr_of_dimension i)) 
371 
 Expr_power (e, n) > Power (translate_expr node args e, translate_expr node args (expr_of_dimension n)) 
372 
 Expr_tuple _ 
373 
 Expr_arrow _ 
374 
 Expr_fby _ 
375 
 Expr_pre _ > (Printers.pp_expr Format.err_formatter expr; Format.pp_print_flush Format.err_formatter (); raise NormalizationError) 
376 
 Expr_when (e1, _, _) > (translate_expr node args e1).value_desc 
377 
 Expr_merge (x, _) > raise NormalizationError 
378 
 Expr_appl (id, e, _) when Basic_library.is_expr_internal_fun expr > 
379 
let nd = node_from_name id in 
380 
Fun (node_name nd, List.map (translate_expr node args) (expr_list_of_expr e)) 
381 
 Expr_ite (g,t,e) > ( 
382 
(* special treatment depending on the active backend. For horn backend, ite 
383 
are preserved in expression. While they are removed for C or Java 
384 
backends. *) 
385 
match !Options.output with 
386 
 "horn" > 
387 
Fun ("ite", [translate_expr node args g; translate_expr node args t; translate_expr node args e]) 
388 
 "C"  "java"  _ > 
389 
(Format.eprintf "Normalization error for backend %s: %a@." 
390 
!Options.output 
391 
Printers.pp_expr expr; 
392 
raise NormalizationError) 
393 
) 
394 
 _ > raise NormalizationError 
395 
in 
396 
mk_val value_desc expr.expr_type 
397  
398 
let translate_guard node args expr = 
399 
match expr.expr_desc with 
400 
 Expr_ident x > translate_ident node args x 
401 
 _ > (Format.eprintf "internal error: translate_guard %s %a@." node.node_id Printers.pp_expr expr;assert false) 
402  
403 
let rec translate_act node ((m, si, j, d, s) as args) (y, expr) = 
404 
match expr.expr_desc with 
405 
 Expr_ite (c, t, e) > let g = translate_guard node args c in 
406 
conditional g 
407 
[translate_act node args (y, t)] 
408 
[translate_act node args (y, e)] 
409 
 Expr_merge (x, hl) > MBranch (translate_ident node args x, 
410 
List.map (fun (t, h) > t, [translate_act node args (y, h)]) hl) 
411 
 _ > MLocalAssign (y, translate_expr node args expr) 
412  
413 
let reset_instance node args i r c = 
414 
match r with 
415 
 None > [] 
416 
 Some r > let g = translate_guard node args r in 
417 
[control_on_clock node args c (conditional g [MReset i] [MNoReset i])] 
418  
419 
let translate_eq node ((m, si, j, d, s) as args) eq = 
420 
(* Format.eprintf "translate_eq %a with clock %a@." Printers.pp_node_eq eq Clocks.print_ck eq.eq_rhs.expr_clock; *) 
421 
match eq.eq_lhs, eq.eq_rhs.expr_desc with 
422 
 [x], Expr_arrow (e1, e2) > 
423 
let var_x = get_node_var x node in 
424 
let o = new_instance node arrow_top_decl eq.eq_rhs.expr_tag in 
425 
let c1 = translate_expr node args e1 in 
426 
let c2 = translate_expr node args e2 in 
427 
(m, 
428 
MReset o :: si, 
429 
Utils.IMap.add o (arrow_top_decl, []) j, 
430 
d, 
431 
(control_on_clock node args eq.eq_rhs.expr_clock (MStep ([var_x], o, [c1;c2]))) :: s) 
432 
 [x], Expr_pre e1 when ISet.mem (get_node_var x node) d > 
433 
let var_x = get_node_var x node in 
434 
(ISet.add var_x m, 
435 
si, 
436 
j, 
437 
d, 
438 
control_on_clock node args eq.eq_rhs.expr_clock (MStateAssign (var_x, translate_expr node args e1)) :: s) 
439 
 [x], Expr_fby (e1, e2) when ISet.mem (get_node_var x node) d > 
440 
let var_x = get_node_var x node in 
441 
(ISet.add var_x m, 
442 
MStateAssign (var_x, translate_expr node args e1) :: si, 
443 
j, 
444 
d, 
445 
control_on_clock node args eq.eq_rhs.expr_clock (MStateAssign (var_x, translate_expr node args e2)) :: s) 
446  
447 
 p , Expr_appl (f, arg, r) when not (Basic_library.is_expr_internal_fun eq.eq_rhs) > 
448 
let var_p = List.map (fun v > get_node_var v node) p in 
449 
let el = expr_list_of_expr arg in 
450 
let vl = List.map (translate_expr node args) el in 
451 
let node_f = node_from_name f in 
452 
let call_f = 
453 
node_f, 
454 
NodeDep.filter_static_inputs (node_inputs node_f) el in 
455 
let o = new_instance node node_f eq.eq_rhs.expr_tag in 
456 
let env_cks = List.fold_right (fun arg cks > arg.expr_clock :: cks) el [eq.eq_rhs.expr_clock] in 
457 
let call_ck = Clock_calculus.compute_root_clock (Clock_predef.ck_tuple env_cks) in 
458 
(*Clocks.new_var true in 
459 
Clock_calculus.unify_imported_clock (Some call_ck) eq.eq_rhs.expr_clock eq.eq_rhs.expr_loc; 
460 
Format.eprintf "call %a: %a: %a@," Printers.pp_expr eq.eq_rhs Clocks.print_ck (Clock_predef.ck_tuple env_cks) Clocks.print_ck call_ck;*) 
461 
(m, 
462 
(if Stateless.check_node node_f then si else MReset o :: si), 
463 
Utils.IMap.add o call_f j, 
464 
d, 
465 
(if Stateless.check_node node_f 
466 
then [] 
467 
else reset_instance node args o r call_ck) @ 
468 
(control_on_clock node args call_ck (MStep (var_p, o, vl))) :: s) 
469 
(* 
470 
(* special treatment depending on the active backend. For horn backend, x = ite (g,t,e) 
471 
are preserved. While they are replaced as if g then x = t else x = e in C or Java 
472 
backends. *) 
473 
 [x], Expr_ite (c, t, e) 
474 
when (match !Options.output with  "horn" > true  "C"  "java"  _ > false) 
475 
> 
476 
let var_x = get_node_var x node in 
477 
(m, 
478 
si, 
479 
j, 
480 
d, 
481 
(control_on_clock node args eq.eq_rhs.expr_clock 
482 
(MLocalAssign (var_x, translate_expr node args eq.eq_rhs))::s) 
483 
) 
484  
485 
*) 
486 
 [x], _ > ( 
487 
let var_x = get_node_var x node in 
488 
(m, si, j, d, 
489 
control_on_clock 
490 
node 
491 
args 
492 
eq.eq_rhs.expr_clock 
493 
(translate_act node args (var_x, eq.eq_rhs)) :: s 
494 
) 
495 
) 
496 
 _ > 
497 
begin 
498 
Format.eprintf "internal error: Machine_code.translate_eq %a@?" Printers.pp_node_eq eq; 
499 
assert false 
500 
end 
501  
502 
let find_eq xl eqs = 
503 
let rec aux accu eqs = 
504 
match eqs with 
505 
 [] > 
506 
begin 
507 
Format.eprintf "Looking for variables %a in the following equations@.%a@." 
508 
(Utils.fprintf_list ~sep:" , " (fun fmt v > Format.fprintf fmt "%s" v)) xl 
509 
Printers.pp_node_eqs eqs; 
510 
assert false 
511 
end 
512 
 hd::tl > 
513 
if List.exists (fun x > List.mem x hd.eq_lhs) xl then hd, accu@tl else aux (hd::accu) tl 
514 
in 
515 
aux [] eqs 
516  
517 
(* Sort the set of equations of node [nd] according 
518 
to the computed schedule [sch] 
519 
*) 
520 
let sort_equations_from_schedule nd sch = 
521 
(* Format.eprintf "%s schedule: %a@." *) 
522 
(* nd.node_id *) 
523 
(* (Utils.fprintf_list ~sep:" ; " Scheduling.pp_eq_schedule) sch; *) 
524 
let split_eqs = Splitting.tuple_split_eq_list (get_node_eqs nd) in 
525 
let eqs_rev, remainder = 
526 
List.fold_left 
527 
(fun (accu, node_eqs_remainder) vl > 
528 
if List.exists (fun eq > List.exists (fun v > List.mem v eq.eq_lhs) vl) accu 
529 
then 
530 
(accu, node_eqs_remainder) 
531 
else 
532 
let eq_v, remainder = find_eq vl node_eqs_remainder in 
533 
eq_v::accu, remainder 
534 
) 
535 
([], split_eqs) 
536 
sch 
537 
in 
538 
begin 
539 
if List.length remainder > 0 then ( 
540 
Format.eprintf "Equations not used are@.%a@.Full equation set is:@.%a@.@?" 
541 
Printers.pp_node_eqs remainder 
542 
Printers.pp_node_eqs (get_node_eqs nd); 
543 
assert false); 
544 
List.rev eqs_rev 
545 
end 
546  
547 
let constant_equations nd = 
548 
List.fold_right (fun vdecl eqs > 
549 
if vdecl.var_dec_const 
550 
then 
551 
{ eq_lhs = [vdecl.var_id]; 
552 
eq_rhs = Utils.desome vdecl.var_dec_value; 
553 
eq_loc = vdecl.var_loc 
554 
} :: eqs 
555 
else eqs) 
556 
nd.node_locals [] 
557  
558 
let translate_eqs node args eqs = 
559 
List.fold_right (fun eq args > translate_eq node args eq) eqs args;; 
560  
561 
let translate_decl nd sch = 
562 
(*Log.report ~level:1 (fun fmt > Printers.pp_node fmt nd);*) 
563  
564 
let sorted_eqs = sort_equations_from_schedule nd sch in 
565 
let constant_eqs = constant_equations nd in 
566  
567 
(* In case of non functional backend (eg. C), additional local variables have 
568 
to be declared for each assert *) 
569 
let new_locals, assert_instrs, nd_node_asserts = 
570 
let exprl = List.map (fun assert_ > assert_.assert_expr ) nd.node_asserts in 
571 
if Corelang.functional_backend () then 
572 
[], [], exprl 
573 
else (* Each assert(e) is associated to a fresh variable v and declared as 
574 
v=e; assert (v); *) 
575 
let _, vars, eql, assertl = 
576 
List.fold_left (fun (i, vars, eqlist, assertlist) expr > 
577 
let loc = expr.expr_loc in 
578 
let var_id = nd.node_id ^ "_assert_" ^ string_of_int i in 
579 
let assert_var = 
580 
mkvar_decl 
581 
loc 
582 
~orig:false (* fresh var *) 
583 
(var_id, 
584 
mktyp loc Tydec_bool, 
585 
mkclock loc Ckdec_any, 
586 
false, (* not a constant *) 
587 
None (* no default value *) 
588 
) 
589 
in 
590 
assert_var.var_type < Types.new_ty (Types.Tbool); 
591 
let eq = mkeq loc ([var_id], expr) in 
592 
(i+1, assert_var::vars, eq::eqlist, {expr with expr_desc = Expr_ident var_id}::assertlist) 
593 
) (1, [], [], []) exprl 
594 
in 
595 
vars, eql, assertl 
596 
in 
597 
let locals_list = nd.node_locals @ new_locals in 
598  
599 
let nd = { nd with node_locals = locals_list } in 
600 
let init_args = ISet.empty, [], Utils.IMap.empty, List.fold_right (fun l > ISet.add l) locals_list ISet.empty, [] in 
601 
(* memories, init instructions, node calls, local variables (including memories), step instrs *) 
602 
let m0, init0, j0, locals0, s0 = translate_eqs nd init_args constant_eqs in 
603 
assert (ISet.is_empty m0); 
604 
assert (init0 = []); 
605 
assert (Utils.IMap.is_empty j0); 
606 
let m, init, j, locals, s = translate_eqs nd (m0, init0, j0, locals0, []) (assert_instrs@sorted_eqs) in 
607 
let mmap = Utils.IMap.fold (fun i n res > (i, n)::res) j [] in 
608 
{ 
609 
mname = nd; 
610 
mmemory = ISet.elements m; 
611 
mcalls = mmap; 
612 
minstances = List.filter (fun (_, (n,_)) > not (Stateless.check_node n)) mmap; 
613 
minit = init; 
614 
mconst = s0; 
615 
mstatic = List.filter (fun v > v.var_dec_const) nd.node_inputs; 
616 
mstep = { 
617 
step_inputs = nd.node_inputs; 
618 
step_outputs = nd.node_outputs; 
619 
step_locals = ISet.elements (ISet.diff locals m); 
620 
step_checks = List.map (fun d > d.Dimension.dim_loc, translate_expr nd init_args (expr_of_dimension d)) nd.node_checks; 
621 
step_instrs = ( 
622 
(* special treatment depending on the active backend. For horn backend, 
623 
common branches are not merged while they are in C or Java 
624 
backends. *) 
625 
(*match !Options.output with 
626 
 "horn" > s 
627 
 "C"  "java"  _ >*) 
628 
if !Backends.join_guards then 
629 
join_guards_list s 
630 
else 
631 
s 
632 
); 
633 
step_asserts = List.map (translate_expr nd init_args) nd_node_asserts; 
634 
}; 
635 
mspec = nd.node_spec; 
636 
mannot = nd.node_annot; 
637 
} 
638  
639 
(** takes the global declarations and the scheduling associated to each node *) 
640 
let translate_prog decls node_schs = 
641 
let nodes = get_nodes decls in 
642 
List.map 
643 
(fun decl > 
644 
let node = node_of_top decl in 
645 
let sch = (Utils.IMap.find node.node_id node_schs).Scheduling.schedule in 
646 
translate_decl node sch 
647 
) nodes 
648  
649 
let get_machine_opt name machines = 
650 
List.fold_left 
651 
(fun res m > 
652 
match res with 
653 
 Some _ > res 
654 
 None > if m.mname.node_id = name then Some m else None) 
655 
None machines 
656  
657 
let get_const_assign m id = 
658 
try 
659 
match (List.find (fun instr > match instr with MLocalAssign (v, _) > v == id  _ > false) m.mconst) with 
660 
 MLocalAssign (_, e) > e 
661 
 _ > assert false 
662 
with Not_found > assert false 
663  
664  
665 
let value_of_ident loc m id = 
666 
(* is is a state var *) 
667 
try 
668 
let v = List.find (fun v > v.var_id = id) m.mmemory 
669 
in mk_val (StateVar v) v.var_type 
670 
with Not_found > 
671 
try (* id is a node var *) 
672 
let v = get_node_var id m.mname 
673 
in mk_val (LocalVar v) v.var_type 
674 
with Not_found > 
675 
try (* id is a constant *) 
676 
let c = Corelang.var_decl_of_const (const_of_top (Hashtbl.find Corelang.consts_table id)) 
677 
in mk_val (LocalVar c) c.var_type 
678 
with Not_found > 
679 
(* id is a tag *) 
680 
let t = Const_tag id 
681 
in mk_val (Cst t) (Typing.type_const loc t) 
682  
683 
(* type of internal fun used in dimension expression *) 
684 
let type_of_value_appl f args = 
685 
if List.mem f Basic_library.arith_funs 
686 
then (List.hd args).value_type 
687 
else Type_predef.type_bool 
688  
689 
let rec value_of_dimension m dim = 
690 
match dim.Dimension.dim_desc with 
691 
 Dimension.Dbool b > 
692 
mk_val (Cst (Const_tag (if b then Corelang.tag_true else Corelang.tag_false))) Type_predef.type_bool 
693 
 Dimension.Dint i > 
694 
mk_val (Cst (Const_int i)) Type_predef.type_int 
695 
 Dimension.Dident v > value_of_ident dim.Dimension.dim_loc m v 
696 
 Dimension.Dappl (f, args) > 
697 
let vargs = List.map (value_of_dimension m) args 
698 
in mk_val (Fun (f, vargs)) (type_of_value_appl f vargs) 
699 
 Dimension.Dite (i, t, e) > 
700 
(match List.map (value_of_dimension m) [i; t; e] with 
701 
 [vi; vt; ve] > mk_val (Fun ("ite", [vi; vt; ve])) vt.value_type 
702 
 _ > assert false) 
703 
 Dimension.Dlink dim' > value_of_dimension m dim' 
704 
 _ > assert false 
705  
706 
let rec dimension_of_value value = 
707 
match value.value_desc with 
708 
 Cst (Const_tag t) when t = Corelang.tag_true > Dimension.mkdim_bool Location.dummy_loc true 
709 
 Cst (Const_tag t) when t = Corelang.tag_false > Dimension.mkdim_bool Location.dummy_loc false 
710 
 Cst (Const_int i) > Dimension.mkdim_int Location.dummy_loc i 
711 
 LocalVar v > Dimension.mkdim_ident Location.dummy_loc v.var_id 
712 
 Fun (f, args) > Dimension.mkdim_appl Location.dummy_loc f (List.map dimension_of_value args) 
713 
 _ > assert false 
714  
715 
(* Local Variables: *) 
716 
(* compilecommand:"make C .." *) 
717 
(* End: *) 