Project

General

Profile

Statistics
| Branch: | Tag: | Revision:

lustrec / src / machine_code.ml @ 66359a5e

History | View | Annotate | Download (27.5 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 VSet = 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
  let _ =
47
    match i.instr_desc with
48
    | MLocalAssign (i,v) -> Format.fprintf fmt "%s<-l- %a" i.var_id pp_val v
49
    | MStateAssign (i,v) -> Format.fprintf fmt "%s<-s- %a" i.var_id pp_val v
50
    | MReset i           -> Format.fprintf fmt "reset %s" i
51
    | MNoReset i         -> Format.fprintf fmt "noreset %s" i
52
    | MStep (il, i, vl)  ->
53
       Format.fprintf fmt "%a = %s (%a)"
54
	 (Utils.fprintf_list ~sep:", " (fun fmt v -> Format.pp_print_string fmt v.var_id)) il
55
	 i
56
	 (Utils.fprintf_list ~sep:", " pp_val) vl
57
    | MBranch (g,hl)     ->
58
       Format.fprintf fmt "@[<v 2>case(%a) {@,%a@,}@]"
59
	 pp_val g
60
	 (Utils.fprintf_list ~sep:"@," pp_branch) hl
61
    | MComment s -> Format.pp_print_string fmt s
62
       
63
  in
64
  (* Annotation *)
65
  (* let _ = *)
66
  (*   match i.lustre_expr with None -> () | Some e -> Format.fprintf fmt " -- original expr: %a" Printers.pp_expr e *)
67
  (* in *)
68
  let _ = 
69
    match i.lustre_eq with None -> () | Some eq -> Format.fprintf fmt " -- original eq: %a" Printers.pp_node_eq eq
70
  in
71
  ()
72
    
73
and pp_branch fmt (t, h) =
74
  Format.fprintf fmt "@[<v 2>%s:@,%a@]" t (Utils.fprintf_list ~sep:"@," pp_instr) h
75

    
76
and pp_instrs fmt il =
77
  Format.fprintf fmt "@[<v 2>%a@]" (Utils.fprintf_list ~sep:"@," pp_instr) il
78

    
79
type step_t = {
80
  step_checks: (Location.t * value_t) list;
81
  step_inputs: var_decl list;
82
  step_outputs: var_decl list;
83
  step_locals: var_decl list;
84
  step_instrs: instr_t list;
85
  step_asserts: value_t list;
86
}
87

    
88
type static_call = top_decl * (Dimension.dim_expr list)
89

    
90
type machine_t = {
91
  mname: node_desc;
92
  mmemory: var_decl list;
93
  mcalls: (ident * static_call) list; (* map from stateful/stateless instance to node, no internals *)
94
  minstances: (ident * static_call) list; (* sub-map of mcalls, from stateful instance to node *)
95
  minit: instr_t list;
96
  mstatic: var_decl list; (* static inputs only *)
97
  mconst: instr_t list; (* assignments of node constant locals *)
98
  mstep: step_t;
99
  mspec: node_annot option;
100
  mannot: expr_annot list;
101
}
102

    
103
(* merge log: get_node_def was in c0f8 *)
104
(* Returns the node/machine associated to id in m calls *)
105
let get_node_def id m =
106
  try
107
    let (decl, _) = List.assoc id m.mcalls in
108
    Corelang.node_of_top decl
109
  with Not_found -> ( 
110
    (* Format.eprintf "Unable to find node %s in list [%a]@.@?" *)
111
    (*   id *)
112
    (*   (Utils.fprintf_list ~sep:", " (fun fmt (n,_) -> Format.fprintf fmt "%s" n)) m.mcalls *)
113
    (* ; *)
114
    raise Not_found
115
  )
116
    
117
(* merge log: machine_vars was in 44686 *)
118
let machine_vars m = m.mstep.step_inputs @ m.mstep.step_locals @ m.mstep.step_outputs @ m.mmemory
119

    
120
let pp_step fmt s =
121
  Format.fprintf fmt "@[<v>inputs : %a@ outputs: %a@ locals : %a@ checks : %a@ instrs : @[%a@]@ asserts : @[%a@]@]@ "
122
    (Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_inputs
123
    (Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_outputs
124
    (Utils.fprintf_list ~sep:", " Printers.pp_var) s.step_locals
125
    (Utils.fprintf_list ~sep:", " (fun fmt (_, c) -> pp_val fmt c)) s.step_checks
126
    (Utils.fprintf_list ~sep:"@ " pp_instr) s.step_instrs
127
    (Utils.fprintf_list ~sep:", " pp_val) s.step_asserts
128

    
129

    
130
let pp_static_call fmt (node, args) =
131
 Format.fprintf fmt "%s<%a>"
132
   (node_name node)
133
   (Utils.fprintf_list ~sep:", " Dimension.pp_dimension) args
134

    
135
let pp_machine fmt m =
136
  Format.fprintf fmt
137
    "@[<v 2>machine %s@ mem      : %a@ instances: %a@ init     : %a@ const    : %a@ step     :@   @[<v 2>%a@]@ @  spec : @[%t@]@  annot : @[%a@]@]@ "
138
    m.mname.node_id
139
    (Utils.fprintf_list ~sep:", " Printers.pp_var) m.mmemory
140
    (Utils.fprintf_list ~sep:", " (fun fmt (o1, o2) -> Format.fprintf fmt "(%s, %a)" o1 pp_static_call o2)) m.minstances
141
    (Utils.fprintf_list ~sep:"@ " pp_instr) m.minit
142
    (Utils.fprintf_list ~sep:"@ " pp_instr) m.mconst
143
    pp_step m.mstep
144
    (fun fmt -> match m.mspec with | None -> () | Some spec -> Printers.pp_spec fmt spec)
145
    (Utils.fprintf_list ~sep:"@ " Printers.pp_expr_annot) m.mannot
146

    
147
let pp_machines fmt ml =
148
  Format.fprintf fmt "@[<v 0>%a@]" (Utils.fprintf_list ~sep:"@," pp_machine) ml
149

    
150
  
151
let rec is_const_value v =
152
  match v.value_desc with
153
  | Cst _          -> true
154
  | Fun (id, args) -> Basic_library.is_value_internal_fun v && List.for_all is_const_value args
155
  | _              -> false
156

    
157
(* Returns the declared stateless status and the computed one. *)
158
let get_stateless_status m =
159
 (m.mname.node_dec_stateless, try Utils.desome m.mname.node_stateless with _ -> failwith ("stateless status of machine " ^ m.mname.node_id ^ " not computed"))
160

    
161
let is_input m id =
162
  List.exists (fun o -> o.var_id = id.var_id) m.mstep.step_inputs
163

    
164
let is_output m id =
165
  List.exists (fun o -> o.var_id = id.var_id) m.mstep.step_outputs
166

    
167
let is_memory m id =
168
  List.exists (fun o -> o.var_id = id.var_id) m.mmemory
169

    
170
let conditional ?lustre_eq c t e =
171
  mkinstr ?lustre_eq:lustre_eq  (MBranch(c, [ (tag_true, t); (tag_false, e) ]))
172

    
173
let dummy_var_decl name typ =
174
  {
175
    var_id = name;
176
    var_orig = false;
177
    var_dec_type = dummy_type_dec;
178
    var_dec_clock = dummy_clock_dec;
179
    var_dec_const = false;
180
    var_dec_value = None;
181
    var_parent_nodeid = None;
182
    var_type =  typ;
183
    var_clock = Clocks.new_ck Clocks.Cvar true;
184
    var_loc = Location.dummy_loc
185
  }
186

    
187
let arrow_id = "_arrow"
188

    
189
let arrow_typ = Types.new_ty Types.Tunivar
190

    
191
let arrow_desc =
192
  {
193
    node_id = arrow_id;
194
    node_type = Type_predef.type_bin_poly_op;
195
    node_clock = Clock_predef.ck_bin_univ;
196
    node_inputs= [dummy_var_decl "_in1" arrow_typ; dummy_var_decl "_in2" arrow_typ];
197
    node_outputs= [dummy_var_decl "_out" arrow_typ];
198
    node_locals= [];
199
    node_gencalls = [];
200
    node_checks = [];
201
    node_asserts = [];
202
    node_stmts= [];
203
    node_dec_stateless = false;
204
    node_stateless = Some false;
205
    node_spec = None;
206
    node_annot = [];  }
207

    
208
let arrow_top_decl =
209
  {
210
    top_decl_desc = Node arrow_desc;
211
    top_decl_owner = (Options_management.core_dependency "arrow");
212
    top_decl_itf = false;
213
    top_decl_loc = Location.dummy_loc
214
  }
215

    
216
let mk_val v t = { value_desc = v; 
217
		   value_type = t; 
218
		   value_annot = None }
219

    
220
let arrow_machine =
221
  let state = "_first" in
222
  let var_state = dummy_var_decl state Type_predef.type_bool(* (Types.new_ty Types.Tbool) *) in
223
  let var_input1 = List.nth arrow_desc.node_inputs 0 in
224
  let var_input2 = List.nth arrow_desc.node_inputs 1 in
225
  let var_output = List.nth arrow_desc.node_outputs 0 in
226
  let cst b = mk_val (Cst (const_of_bool b)) Type_predef.type_bool in
227
  let t_arg = Types.new_univar () in (* TODO Xavier: c'est bien la bonne def ? *)
228
  {
229
    mname = arrow_desc;
230
    mmemory = [var_state];
231
    mcalls = [];
232
    minstances = [];
233
    minit = [mkinstr (MStateAssign(var_state, cst true))];
234
    mstatic = [];
235
    mconst = [];
236
    mstep = {
237
      step_inputs = arrow_desc.node_inputs;
238
      step_outputs = arrow_desc.node_outputs;
239
      step_locals = [];
240
      step_checks = [];
241
      step_instrs = [conditional (mk_val (StateVar var_state) Type_predef.type_bool)
242
			(List.map mkinstr
243
			[MStateAssign(var_state, cst false);
244
			 MLocalAssign(var_output, mk_val (LocalVar var_input1) t_arg)])
245
                        (List.map mkinstr
246
			[MLocalAssign(var_output, mk_val (LocalVar var_input2) t_arg)]) ];
247
      step_asserts = [];
248
    };
249
    mspec = None;
250
    mannot = [];
251
  }
252

    
253
let empty_desc =
254
  {
255
    node_id = arrow_id;
256
    node_type = Types.bottom;
257
    node_clock = Clocks.bottom;
258
    node_inputs= [];
259
    node_outputs= [];
260
    node_locals= [];
261
    node_gencalls = [];
262
    node_checks = [];
263
    node_asserts = [];
264
    node_stmts= [];
265
    node_dec_stateless = true;
266
    node_stateless = Some true;
267
    node_spec = None;
268
    node_annot = [];  }
269

    
270
let empty_machine =
271
  {
272
    mname = empty_desc;
273
    mmemory = [];
274
    mcalls = [];
275
    minstances = [];
276
    minit = [];
277
    mstatic = [];
278
    mconst = [];
279
    mstep = {
280
      step_inputs = [];
281
      step_outputs = [];
282
      step_locals = [];
283
      step_checks = [];
284
      step_instrs = [];
285
      step_asserts = [];
286
    };
287
    mspec = None;
288
    mannot = [];
289
  }
290

    
291
let new_instance =
292
  let cpt = ref (-1) in
293
  fun caller callee tag ->
294
    begin
295
      let o =
296
	if Stateless.check_node callee then
297
	  node_name callee
298
	else
299
	  Printf.sprintf "ni_%d" (incr cpt; !cpt) in
300
      let o =
301
	if !Options.ansi && is_generic_node callee
302
	then Printf.sprintf "%s_inst_%d" o (Utils.position (fun e -> e.expr_tag = tag) caller.node_gencalls)
303
	else o in
304
      o
305
    end
306

    
307

    
308
(* translate_<foo> : node -> context -> <foo> -> machine code/expression *)
309
(* the context contains  m : state aka memory variables  *)
310
(*                      si : initialization instructions *)
311
(*                       j : node aka machine instances  *)
312
(*                       d : local variables             *)
313
(*                       s : step instructions           *)
314
let translate_ident node (m, si, j, d, s) id =
315
  (* Format.eprintf "trnaslating ident: %s@." id; *)
316
  try (* id is a node var *)
317
    let var_id = get_node_var id node in
318
    if VSet.exists (fun v -> v.var_id = id) m
319
    then (
320
      (* Format.eprintf "a STATE VAR@."; *)
321
      mk_val (StateVar var_id) var_id.var_type
322
    )
323
    else (
324
      (* Format.eprintf "a LOCAL VAR@."; *)
325
      mk_val (LocalVar var_id) var_id.var_type
326
    )
327
  with Not_found ->
328
    try (* id is a constant *)
329
      let vdecl = (Corelang.var_decl_of_const (const_of_top (Hashtbl.find Corelang.consts_table id))) in
330
      mk_val (LocalVar vdecl) vdecl.var_type
331
    with Not_found ->
332
      (* id is a tag *)
333
      (* DONE construire une liste des enum declarés et alors chercher dedans la liste
334
	 qui contient id *)
335
      try
336
        let typ = (typedef_of_top (Hashtbl.find Corelang.tag_table id)).tydef_id in
337
        mk_val (Cst (Const_tag id)) (Type_predef.type_const typ)
338
      with Not_found -> (Format.eprintf "internal error: Machine_code.translate_ident %s" id;
339
                         assert false)
340

    
341
let rec control_on_clock node ((m, si, j, d, s) as args) ck inst =
342
 match (Clocks.repr ck).cdesc with
343
 | Con    (ck1, cr, l) ->
344
   let id  = Clocks.const_of_carrier cr in
345
   control_on_clock node args ck1 (mkinstr
346
				     (* TODO il faudrait prendre le lustre
347
					associé à instr et rajouter print_ck_suffix
348
					ck) de clocks.ml *)
349
				     (MBranch (translate_ident node args id,
350
					       [l, [inst]] )))
351
 | _                   -> inst
352

    
353
let rec join_branches hl1 hl2 =
354
 match hl1, hl2 with
355
 | []          , _            -> hl2
356
 | _           , []           -> hl1
357
 | (t1, h1)::q1, (t2, h2)::q2 ->
358
   if t1 < t2 then (t1, h1) :: join_branches q1 hl2 else
359
   if t1 > t2 then (t2, h2) :: join_branches hl1 q2
360
   else (t1, List.fold_right join_guards h1 h2) :: join_branches q1 q2
361

    
362
and join_guards inst1 insts2 =
363
 match get_instr_desc inst1, List.map get_instr_desc insts2 with
364
 | _                   , []                               ->
365
   [inst1]
366
 | MBranch (x1, hl1), MBranch (x2, hl2) :: q when x1 = x2 ->
367
    mkinstr
368
      (* TODO on pourrait uniquement concatener les lustres de inst1 et hd(inst2) *)
369
      (MBranch (x1, join_branches (sort_handlers hl1) (sort_handlers hl2)))
370
   :: (List.tl insts2)
371
 | _ -> inst1 :: insts2
372

    
373
let join_guards_list insts =
374
 List.fold_right join_guards insts []
375

    
376
(* specialize predefined (polymorphic) operators
377
   wrt their instances, so that the C semantics
378
   is preserved *)
379
let specialize_to_c expr =
380
 match expr.expr_desc with
381
 | Expr_appl (id, e, r) ->
382
   if List.exists (fun e -> Types.is_bool_type e.expr_type) (expr_list_of_expr e)
383
   then let id =
384
	  match id with
385
	  | "="  -> "equi"
386
	  | "!=" -> "xor"
387
	  | _    -> id in
388
	{ expr with expr_desc = Expr_appl (id, e, r) }
389
   else expr
390
 | _ -> expr
391

    
392
let specialize_op expr =
393
  match !Options.output with
394
  | "C" -> specialize_to_c expr
395
  | _   -> expr
396

    
397
let rec translate_expr node ((m, si, j, d, s) as args) expr =
398
  let expr = specialize_op expr in
399
  let value_desc = 
400
    match expr.expr_desc with
401
    | Expr_const v                     -> Cst v
402
    | Expr_ident x                     -> (translate_ident node args x).value_desc
403
    | Expr_array el                    -> Array (List.map (translate_expr node args) el)
404
    | Expr_access (t, i)               -> Access (translate_expr node args t, translate_expr node args (expr_of_dimension i))
405
    | Expr_power  (e, n)               -> Power  (translate_expr node args e, translate_expr node args (expr_of_dimension n))
406
    | Expr_tuple _
407
    | Expr_arrow _ 
408
    | Expr_fby _
409
    | Expr_pre _                       -> (Printers.pp_expr Format.err_formatter expr; Format.pp_print_flush Format.err_formatter (); raise NormalizationError)
410
    | Expr_when    (e1, _, _)          -> (translate_expr node args e1).value_desc
411
    | Expr_merge   (x, _)              -> raise NormalizationError
412
    | Expr_appl (id, e, _) when Basic_library.is_expr_internal_fun expr ->
413
      let nd = node_from_name id in
414
      Fun (node_name nd, List.map (translate_expr node args) (expr_list_of_expr e))
415
    | Expr_ite (g,t,e) -> (
416
      (* special treatment depending on the active backend. For horn backend, ite
417
	 are preserved in expression. While they are removed for C or Java
418
	 backends. *)
419
      match !Options.output with
420
      | "horn" -> 
421
	 Fun ("ite", [translate_expr node args g; translate_expr node args t; translate_expr node args e])
422
      | "C" | "java" | _ -> 
423
	 (Format.eprintf "Normalization error for backend %s: %a@."
424
	    !Options.output
425
	    Printers.pp_expr expr;
426
	  raise NormalizationError)
427
    )
428
    | _                   -> raise NormalizationError
429
  in
430
  mk_val value_desc expr.expr_type
431

    
432
let translate_guard node args expr =
433
  match expr.expr_desc with
434
  | Expr_ident x  -> translate_ident node args x
435
  | _ -> (Format.eprintf "internal error: translate_guard %s %a@." node.node_id Printers.pp_expr expr;assert false)
436

    
437
let rec translate_act node ((m, si, j, d, s) as args) (y, expr) =
438
  let eq = Corelang.mkeq Location.dummy_loc ([y.var_id], expr) in
439
  match expr.expr_desc with
440
  | Expr_ite   (c, t, e) -> let g = translate_guard node args c in
441
			    conditional ?lustre_eq:(Some eq) g
442
                              [translate_act node args (y, t)]
443
                              [translate_act node args (y, e)]
444
  | Expr_merge (x, hl)   -> mkinstr ?lustre_eq:(Some eq) (MBranch (translate_ident node args x,
445
                                     List.map (fun (t,  h) -> t, [translate_act node args (y, h)]) hl))
446
  | _                    -> mkinstr ?lustre_eq:(Some eq)  (MLocalAssign (y, translate_expr node args expr))
447

    
448
let reset_instance node args i r c =
449
  match r with
450
  | None        -> []
451
  | Some r      -> let g = translate_guard node args r in
452
                   [control_on_clock node args c (conditional g [mkinstr (MReset i)] [mkinstr (MNoReset i)])]
453

    
454
let translate_eq node ((m, si, j, d, s) as args) eq =
455
  (* Format.eprintf "translate_eq %a with clock %a@." Printers.pp_node_eq eq Clocks.print_ck eq.eq_rhs.expr_clock;  *)
456
  match eq.eq_lhs, eq.eq_rhs.expr_desc with
457
  | [x], Expr_arrow (e1, e2)                     ->
458
     let var_x = get_node_var x node in
459
     let o = new_instance node arrow_top_decl eq.eq_rhs.expr_tag in
460
     let c1 = translate_expr node args e1 in
461
     let c2 = translate_expr node args e2 in
462
     (m,
463
      mkinstr (MReset o) :: si,
464
      Utils.IMap.add o (arrow_top_decl, []) j,
465
      d,
466
      (control_on_clock node args eq.eq_rhs.expr_clock (mkinstr ?lustre_eq:(Some eq) (MStep ([var_x], o, [c1;c2])))) :: s)
467
  | [x], Expr_pre e1 when VSet.mem (get_node_var x node) d     ->
468
     let var_x = get_node_var x node in
469
     (VSet.add var_x m,
470
      si,
471
      j,
472
      d,
473
      control_on_clock node args eq.eq_rhs.expr_clock (mkinstr ?lustre_eq:(Some eq) (MStateAssign (var_x, translate_expr node args e1))) :: s)
474
  | [x], Expr_fby (e1, e2) when VSet.mem (get_node_var x node) d ->
475
     let var_x = get_node_var x node in
476
     (VSet.add var_x m,
477
      mkinstr ?lustre_eq:(Some eq) (MStateAssign (var_x, translate_expr node args e1)) :: si,
478
      j,
479
      d,
480
      control_on_clock node args eq.eq_rhs.expr_clock (mkinstr ?lustre_eq:(Some eq) (MStateAssign (var_x, translate_expr node args e2))) :: s)
481

    
482
  | p  , Expr_appl (f, arg, r) when not (Basic_library.is_expr_internal_fun eq.eq_rhs) ->
483
     let var_p = List.map (fun v -> get_node_var v node) p in
484
     let el = expr_list_of_expr arg in
485
     let vl = List.map (translate_expr node args) el in
486
     let node_f = node_from_name f in
487
     let call_f =
488
       node_f,
489
       NodeDep.filter_static_inputs (node_inputs node_f) el in
490
     let o = new_instance node node_f eq.eq_rhs.expr_tag in
491
     let env_cks = List.fold_right (fun arg cks -> arg.expr_clock :: cks) el [eq.eq_rhs.expr_clock] in
492
     let call_ck = Clock_calculus.compute_root_clock (Clock_predef.ck_tuple env_cks) in
493
     (*Clocks.new_var true in
494
       Clock_calculus.unify_imported_clock (Some call_ck) eq.eq_rhs.expr_clock eq.eq_rhs.expr_loc;
495
       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;*)
496
     (m,
497
      (if Stateless.check_node node_f then si else mkinstr (MReset o) :: si),
498
      Utils.IMap.add o call_f j,
499
      d,
500
      (if Stateless.check_node node_f
501
       then []
502
       else reset_instance node args o r call_ck) @
503
	(control_on_clock node args call_ck (mkinstr ?lustre_eq:(Some eq) (MStep (var_p, o, vl)))) :: s)
504
  (*
505
    (* special treatment depending on the active backend. For horn backend, x = ite (g,t,e)
506
    are preserved. While they are replaced as if g then x = t else x = e in  C or Java
507
    backends. *)
508
    | [x], Expr_ite   (c, t, e)
509
    when (match !Options.output with | "horn" -> true | "C" | "java" | _ -> false)
510
    ->
511
    let var_x = get_node_var x node in
512
    (m,
513
    si,
514
    j,
515
    d,
516
    (control_on_clock node args eq.eq_rhs.expr_clock
517
    (MLocalAssign (var_x, translate_expr node args eq.eq_rhs))::s)
518
    )
519

    
520
  *)
521
  | [x], _                                       -> (
522
    let var_x = get_node_var x node in
523
    (m, si, j, d,
524
     control_on_clock
525
       node
526
       args
527
       eq.eq_rhs.expr_clock
528
       (translate_act node args (var_x, eq.eq_rhs)) :: s
529
    )
530
  )
531
  | _                                            ->
532
     begin
533
       Format.eprintf "internal error: Machine_code.translate_eq %a@?" Printers.pp_node_eq eq;
534
       assert false
535
     end
536

    
537
let find_eq xl eqs =
538
  let rec aux accu eqs =
539
      match eqs with
540
	| [] ->
541
	  begin
542
	    Format.eprintf "Looking for variables %a in the following equations@.%a@."
543
	      (Utils.fprintf_list ~sep:" , " (fun fmt v -> Format.fprintf fmt "%s" v)) xl
544
	      Printers.pp_node_eqs eqs;
545
	    assert false
546
	  end
547
	| hd::tl ->
548
	  if List.exists (fun x -> List.mem x hd.eq_lhs) xl then hd, accu@tl else aux (hd::accu) tl
549
    in
550
    aux [] eqs
551

    
552
(* Sort the set of equations of node [nd] according
553
   to the computed schedule [sch]
554
*)
555
let sort_equations_from_schedule nd sch =
556
  (* Format.eprintf "%s schedule: %a@." *)
557
  (* 		 nd.node_id *)
558
  (* 		 (Utils.fprintf_list ~sep:" ; " Scheduling.pp_eq_schedule) sch; *)
559
  let eqs, auts = get_node_eqs nd in
560
  assert (auts = []); (* Automata should be expanded by now *)
561
  let split_eqs = Splitting.tuple_split_eq_list eqs in
562
  let eqs_rev, remainder =
563
    List.fold_left
564
      (fun (accu, node_eqs_remainder) vl ->
565
       if List.exists (fun eq -> List.exists (fun v -> List.mem v eq.eq_lhs) vl) accu
566
       then
567
	 (accu, node_eqs_remainder)
568
       else
569
	 let eq_v, remainder = find_eq vl node_eqs_remainder in
570
	 eq_v::accu, remainder
571
      )
572
      ([], split_eqs)
573
      sch
574
  in
575
  begin
576
    if List.length remainder > 0 then (
577
      let eqs, auts = get_node_eqs nd in
578
      assert (auts = []); (* Automata should be expanded by now *)
579
      Format.eprintf "Equations not used are@.%a@.Full equation set is:@.%a@.@?"
580
		     Printers.pp_node_eqs remainder
581
      		     Printers.pp_node_eqs eqs;
582
      assert false);
583
    List.rev eqs_rev
584
  end
585

    
586
let constant_equations nd =
587
 List.fold_right (fun vdecl eqs ->
588
   if vdecl.var_dec_const
589
   then
590
     { eq_lhs = [vdecl.var_id];
591
       eq_rhs = Utils.desome vdecl.var_dec_value;
592
       eq_loc = vdecl.var_loc
593
     } :: eqs
594
   else eqs)
595
   nd.node_locals []
596

    
597
let translate_eqs node args eqs =
598
  List.fold_right (fun eq args -> translate_eq node args eq) eqs args;;
599

    
600
let translate_decl nd sch =
601
  (*Log.report ~level:1 (fun fmt -> Printers.pp_node fmt nd);*)
602

    
603
  let sorted_eqs = sort_equations_from_schedule nd sch in
604
  let constant_eqs = constant_equations nd in
605

    
606
  (* In case of non functional backend (eg. C), additional local variables have
607
     to be declared for each assert *)
608
  let new_locals, assert_instrs, nd_node_asserts =
609
    let exprl = List.map (fun assert_ -> assert_.assert_expr ) nd.node_asserts in
610
    if Backends.is_functional () then
611
      [], [], exprl  
612
    else (* Each assert(e) is associated to a fresh variable v and declared as
613
	    v=e; assert (v); *)
614
      let _, vars, eql, assertl =
615
	List.fold_left (fun (i, vars, eqlist, assertlist) expr ->
616
	  let loc = expr.expr_loc in
617
	  let var_id = nd.node_id ^ "_assert_" ^ string_of_int i in
618
	  let assert_var =
619
	    mkvar_decl
620
	      loc
621
	      ~orig:false (* fresh var *)
622
	      (var_id,
623
	       mktyp loc Tydec_bool,
624
	       mkclock loc Ckdec_any,
625
	       false, (* not a constant *)
626
	       None, (* no default value *)
627
	       Some nd.node_id
628
	      )
629
	  in
630
	  assert_var.var_type <- Type_predef.type_bool (* Types.new_ty (Types.Tbool) *); 
631
	  let eq = mkeq loc ([var_id], expr) in
632
	  (i+1, assert_var::vars, eq::eqlist, {expr with expr_desc = Expr_ident var_id}::assertlist)
633
	) (1, [], [], []) exprl
634
      in
635
      vars, eql, assertl
636
  in
637
  let locals_list = nd.node_locals @ new_locals in
638

    
639
  let nd = { nd with node_locals = locals_list } in
640
  let init_args = VSet.empty, [], Utils.IMap.empty, List.fold_right (fun l -> VSet.add l) locals_list VSet.empty, [] in
641
  (* memories, init instructions, node calls, local variables (including memories), step instrs *)
642
  let m0, init0, j0, locals0, s0 = translate_eqs nd init_args constant_eqs in
643
  assert (VSet.is_empty m0);
644
  assert (init0 = []);
645
  assert (Utils.IMap.is_empty j0);
646
  let m, init, j, locals, s as context_with_asserts = translate_eqs nd (m0, init0, j0, locals0, []) (assert_instrs@sorted_eqs) in
647
  let mmap = Utils.IMap.fold (fun i n res -> (i, n)::res) j [] in
648
  {
649
    mname = nd;
650
    mmemory = VSet.elements m;
651
    mcalls = mmap;
652
    minstances = List.filter (fun (_, (n,_)) -> not (Stateless.check_node n)) mmap;
653
    minit = init;
654
    mconst = s0;
655
    mstatic = List.filter (fun v -> v.var_dec_const) nd.node_inputs;
656
    mstep = {
657
      step_inputs = nd.node_inputs;
658
      step_outputs = nd.node_outputs;
659
      step_locals = VSet.elements (VSet.diff locals m);
660
      step_checks = List.map (fun d -> d.Dimension.dim_loc, translate_expr nd init_args (expr_of_dimension d)) nd.node_checks;
661
      step_instrs = (
662
	(* special treatment depending on the active backend. For horn backend,
663
	   common branches are not merged while they are in C or Java
664
	   backends. *)
665
	(*match !Options.output with
666
	| "horn" -> s
667
	  | "C" | "java" | _ ->*)
668
	if !Backends.join_guards then
669
	  join_guards_list s
670
	else
671
	  s
672
      );
673
      step_asserts = List.map (translate_expr nd context_with_asserts) nd_node_asserts;
674
    };
675
    mspec = nd.node_spec;
676
    mannot = nd.node_annot;
677
  }
678

    
679
(** takes the global declarations and the scheduling associated to each node *)
680
let translate_prog decls node_schs =
681
  let nodes = get_nodes decls in
682
  List.map
683
    (fun decl ->
684
     let node = node_of_top decl in
685
      let sch = (Utils.IMap.find node.node_id node_schs).Scheduling.schedule in
686
      translate_decl node sch
687
    ) nodes
688

    
689
let get_machine_opt name machines =
690
  List.fold_left
691
    (fun res m ->
692
      match res with
693
      | Some _ -> res
694
      | None -> if m.mname.node_id = name then Some m else None)
695
    None machines
696

    
697
let get_const_assign m id =
698
  try
699
    match get_instr_desc (List.find
700
	     (fun instr -> match get_instr_desc instr with
701
	     | MLocalAssign (v, _) -> v == id
702
	     | _ -> false)
703
	     m.mconst
704
    ) with
705
    | MLocalAssign (_, e) -> e
706
    | _                   -> assert false
707
  with Not_found -> assert false
708

    
709

    
710
let value_of_ident loc m id =
711
  (* is is a state var *)
712
  try
713
    let v = List.find (fun v -> v.var_id = id) m.mmemory
714
    in mk_val (StateVar v) v.var_type 
715
  with Not_found ->
716
    try (* id is a node var *)
717
      let v = get_node_var id m.mname
718
      in mk_val (LocalVar v) v.var_type
719
  with Not_found ->
720
    try (* id is a constant *)
721
      let c = Corelang.var_decl_of_const (const_of_top (Hashtbl.find Corelang.consts_table id))
722
      in mk_val (LocalVar c) c.var_type
723
    with Not_found ->
724
      (* id is a tag *)
725
      let t = Const_tag id
726
      in mk_val (Cst t) (Typing.type_const loc t)
727

    
728
(* type of internal fun used in dimension expression *)
729
let type_of_value_appl f args =
730
  if List.mem f Basic_library.arith_funs
731
  then (List.hd args).value_type
732
  else Type_predef.type_bool
733

    
734
let rec value_of_dimension m dim =
735
  match dim.Dimension.dim_desc with
736
  | Dimension.Dbool b         ->
737
     mk_val (Cst (Const_tag (if b then Corelang.tag_true else Corelang.tag_false))) Type_predef.type_bool
738
  | Dimension.Dint i          ->
739
     mk_val (Cst (Const_int i)) Type_predef.type_int
740
  | Dimension.Dident v        -> value_of_ident dim.Dimension.dim_loc m v
741
  | Dimension.Dappl (f, args) ->
742
     let vargs = List.map (value_of_dimension m) args
743
     in mk_val (Fun (f, vargs)) (type_of_value_appl f vargs) 
744
  | Dimension.Dite (i, t, e)  ->
745
     (match List.map (value_of_dimension m) [i; t; e] with
746
     | [vi; vt; ve] -> mk_val (Fun ("ite", [vi; vt; ve])) vt.value_type
747
     | _            -> assert false)
748
  | Dimension.Dlink dim'      -> value_of_dimension m dim'
749
  | _                         -> assert false
750

    
751
let rec dimension_of_value value =
752
  match value.value_desc with
753
  | Cst (Const_tag t) when t = Corelang.tag_true  -> Dimension.mkdim_bool  Location.dummy_loc true
754
  | Cst (Const_tag t) when t = Corelang.tag_false -> Dimension.mkdim_bool  Location.dummy_loc false
755
  | Cst (Const_int i)                             -> Dimension.mkdim_int   Location.dummy_loc i
756
  | LocalVar v                                    -> Dimension.mkdim_ident Location.dummy_loc v.var_id
757
  | Fun (f, args)                                 -> Dimension.mkdim_appl  Location.dummy_loc f (List.map dimension_of_value args)
758
  | _                                             -> assert false
759

    
760
(* Local Variables: *)
761
(* compile-command:"make -C .." *)
762
(* End: *)