Project

General

Profile

Statistics
| Branch: | Tag: | Revision:

lustrec / src / corelang.ml @ 990210f3

History | View | Annotate | Download (35.4 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 Format
13
open LustreSpec
14
open Dimension
15

    
16

    
17
exception Error of Location.t * error
18

    
19
module VDeclModule =
20
struct (* Node module *)
21
  type t = var_decl
22
  let compare v1 v2 = compare v1.var_id v2.var_id
23
end
24

    
25
module VMap = Map.Make(VDeclModule)
26

    
27
module VSet = Set.Make(VDeclModule)
28

    
29
let dummy_type_dec = {ty_dec_desc=Tydec_any; ty_dec_loc=Location.dummy_loc}
30

    
31
let dummy_clock_dec = {ck_dec_desc=Ckdec_any; ck_dec_loc=Location.dummy_loc}
32

    
33

    
34

    
35
(************************************************************)
36
(* *)
37

    
38
let mktyp loc d =
39
  { ty_dec_desc = d; ty_dec_loc = loc }
40

    
41
let mkclock loc d =
42
  { ck_dec_desc = d; ck_dec_loc = loc }
43

    
44
let mkvar_decl loc ?(orig=false) (id, ty_dec, ck_dec, is_const, value) =
45
  assert (value = None || is_const);
46
  { var_id = id;
47
    var_orig = orig;
48
    var_dec_type = ty_dec;
49
    var_dec_clock = ck_dec;
50
    var_dec_const = is_const;
51
    var_dec_value = value;
52
    var_type = Types.new_var ();
53
    var_clock = Clocks.new_var true;
54
    var_loc = loc }
55

    
56
let mkexpr loc d =
57
  { expr_tag = Utils.new_tag ();
58
    expr_desc = d;
59
    expr_type = Types.new_var ();
60
    expr_clock = Clocks.new_var true;
61
    expr_delay = Delay.new_var ();
62
    expr_annot = None;
63
    expr_loc = loc }
64

    
65
let var_decl_of_const c =
66
  { var_id = c.const_id;
67
    var_orig = true;
68
    var_dec_type = { ty_dec_loc = c.const_loc; ty_dec_desc = Tydec_any };
69
    var_dec_clock = { ck_dec_loc = c.const_loc; ck_dec_desc = Ckdec_any };
70
    var_dec_const = true;
71
    var_dec_value = None;
72
    var_type = c.const_type;
73
    var_clock = Clocks.new_var false;
74
    var_loc = c.const_loc }
75

    
76
let mk_new_name used id =
77
  let rec new_name name cpt =
78
    if used name
79
    then new_name (sprintf "_%s_%i" id cpt) (cpt+1)
80
    else name
81
  in new_name id 1
82

    
83
let mkeq loc (lhs, rhs) =
84
  { eq_lhs = lhs;
85
    eq_rhs = rhs;
86
    eq_loc = loc }
87

    
88
let mkassert loc expr =
89
  { assert_loc = loc;
90
    assert_expr = expr
91
  }
92

    
93
let mktop_decl loc own itf d =
94
  { top_decl_desc = d; top_decl_loc = loc; top_decl_owner = own; top_decl_itf = itf }
95

    
96
let mkpredef_call loc funname args =
97
  mkexpr loc (Expr_appl (funname, mkexpr loc (Expr_tuple args), None))
98

    
99
let is_clock_dec_type cty =
100
  match cty with
101
  | Tydec_clock _ -> true
102
  | _             -> false
103

    
104
let const_of_top top_decl =
105
  match top_decl.top_decl_desc with
106
  | Const c -> c
107
  | _ -> assert false
108

    
109
let node_of_top top_decl =
110
  match top_decl.top_decl_desc with
111
  | Node nd -> nd
112
  | _ -> assert false
113

    
114
let imported_node_of_top top_decl =
115
  match top_decl.top_decl_desc with
116
  | ImportedNode ind -> ind
117
  | _ -> assert false
118

    
119
let typedef_of_top top_decl =
120
  match top_decl.top_decl_desc with
121
  | TypeDef tdef -> tdef
122
  | _ -> assert false
123

    
124
let dependency_of_top top_decl =
125
  match top_decl.top_decl_desc with
126
  | Open (local, dep) -> (local, dep)
127
  | _ -> assert false
128

    
129
let consts_of_enum_type top_decl =
130
  match top_decl.top_decl_desc with
131
  | TypeDef tdef ->
132
    (match tdef.tydef_desc with
133
     | Tydec_enum tags -> List.map (fun tag -> let cdecl = { const_id = tag; const_loc = top_decl.top_decl_loc; const_value = Const_tag tag; const_type = Type_predef.type_const tdef.tydef_id } in { top_decl with top_decl_desc = Const cdecl }) tags
134
     | _               -> [])
135
  | _ -> assert false
136

    
137
(************************************************************)
138
(*   Eexpr functions *)
139
(************************************************************)
140

    
141
let merge_node_annot ann1 ann2 =
142
  { requires = ann1.requires @ ann2.requires;
143
    ensures = ann1.ensures @ ann2.ensures;
144
    behaviors = ann1.behaviors @ ann2.behaviors;
145
    spec_loc = ann1.spec_loc
146
  }
147

    
148
let mkeexpr loc expr =
149
  { eexpr_tag = Utils.new_tag ();
150
    eexpr_qfexpr = expr;
151
    eexpr_quantifiers = [];
152
    eexpr_type = Types.new_var ();
153
    eexpr_clock = Clocks.new_var true;
154
    eexpr_normalized = None;
155
    eexpr_loc = loc }
156

    
157
let extend_eexpr q e = { e with eexpr_quantifiers = q@e.eexpr_quantifiers }
158

    
159
(*
160
let mkepredef_call loc funname args =
161
  mkeexpr loc (EExpr_appl (funname, mkeexpr loc (EExpr_tuple args), None))
162

    
163
let mkepredef_unary_call loc funname arg =
164
  mkeexpr loc (EExpr_appl (funname, arg, None))
165
*)
166

    
167
let merge_expr_annot ann1 ann2 =
168
  match ann1, ann2 with
169
    | None, None -> assert false
170
    | Some _, None -> ann1
171
    | None, Some _ -> ann2
172
    | Some ann1, Some ann2 -> Some {
173
      annots = ann1.annots @ ann2.annots;
174
      annot_loc = ann1.annot_loc
175
    }
176

    
177
let update_expr_annot node_id e annot =
178
  List.iter (fun (key, _) -> 
179
    Annotations.add_expr_ann node_id e.expr_tag key
180
  ) annot.annots;
181
  { e with expr_annot = merge_expr_annot e.expr_annot (Some annot) }
182

    
183

    
184
(***********************************************************)
185
(* Fast access to nodes, by name *)
186
let (node_table : (ident, top_decl) Hashtbl.t) = Hashtbl.create 30
187
let consts_table = Hashtbl.create 30
188

    
189
let print_node_table fmt () =
190
  begin
191
    Format.fprintf fmt "{ /* node table */@.";
192
    Hashtbl.iter (fun id nd ->
193
      Format.fprintf fmt "%s |-> %a"
194
	id
195
	Printers.pp_short_decl nd
196
    ) node_table;
197
    Format.fprintf fmt "}@."
198
  end
199

    
200
let print_consts_table fmt () =
201
  begin
202
    Format.fprintf fmt "{ /* consts table */@.";
203
    Hashtbl.iter (fun id const ->
204
      Format.fprintf fmt "%s |-> %a"
205
	id
206
	Printers.pp_const_decl (const_of_top const)
207
    ) consts_table;
208
    Format.fprintf fmt "}@."
209
  end
210

    
211
let node_name td =
212
    match td.top_decl_desc with 
213
    | Node nd         -> nd.node_id
214
    | ImportedNode nd -> nd.nodei_id
215
    | _ -> assert false
216

    
217
let is_generic_node td =
218
  match td.top_decl_desc with 
219
  | Node nd         -> List.exists (fun v -> v.var_dec_const) nd.node_inputs
220
  | ImportedNode nd -> List.exists (fun v -> v.var_dec_const) nd.nodei_inputs
221
  | _ -> assert false
222

    
223
let node_inputs td =
224
  match td.top_decl_desc with 
225
  | Node nd         -> nd.node_inputs
226
  | ImportedNode nd -> nd.nodei_inputs
227
  | _ -> assert false
228

    
229
let node_from_name id =
230
  try
231
    Hashtbl.find node_table id
232
  with Not_found -> (Format.eprintf "Unable to find any node named %s@ @?" id;
233
		     assert false)
234

    
235
let is_imported_node td =
236
  match td.top_decl_desc with 
237
  | Node nd         -> false
238
  | ImportedNode nd -> true
239
  | _ -> assert false
240

    
241

    
242
(* alias and type definition table *)
243

    
244
let mktop = mktop_decl Location.dummy_loc !Options.dest_dir false
245

    
246
let top_int_type = mktop (TypeDef {tydef_id = "int"; tydef_desc = Tydec_int})
247
let top_bool_type = mktop (TypeDef {tydef_id = "bool"; tydef_desc = Tydec_bool})
248
(* let top_float_type = mktop (TypeDef {tydef_id = "float"; tydef_desc = Tydec_float}) *)
249
let top_real_type = mktop (TypeDef {tydef_id = "real"; tydef_desc = Tydec_real})
250

    
251
let type_table =
252
  Utils.create_hashtable 20 [
253
    Tydec_int  , top_int_type;
254
    Tydec_bool , top_bool_type;
255
    (* Tydec_float, top_float_type; *)
256
    Tydec_real , top_real_type
257
  ]
258

    
259
let print_type_table fmt () =
260
  begin
261
    Format.fprintf fmt "{ /* type table */@.";
262
    Hashtbl.iter (fun tydec tdef ->
263
      Format.fprintf fmt "%a |-> %a"
264
	Printers.pp_var_type_dec_desc tydec
265
	Printers.pp_typedef (typedef_of_top tdef)
266
    ) type_table;
267
    Format.fprintf fmt "}@."
268
  end
269

    
270
let rec is_user_type typ =
271
  match typ with
272
  | Tydec_int | Tydec_bool | Tydec_real 
273
  (* | Tydec_float *) | Tydec_any | Tydec_const _ -> false
274
  | Tydec_clock typ' -> is_user_type typ'
275
  | _ -> true
276

    
277
let get_repr_type typ =
278
  let typ_def = (typedef_of_top (Hashtbl.find type_table typ)).tydef_desc in
279
  if is_user_type typ_def then typ else typ_def
280

    
281
let rec coretype_equal ty1 ty2 =
282
  let res =
283
  match ty1, ty2 with
284
  | Tydec_any           , _
285
  | _                   , Tydec_any             -> assert false
286
  | Tydec_const _       , Tydec_const _         -> get_repr_type ty1 = get_repr_type ty2
287
  | Tydec_const _       , _                     -> let ty1' = (typedef_of_top (Hashtbl.find type_table ty1)).tydef_desc
288
	       					   in (not (is_user_type ty1')) && coretype_equal ty1' ty2
289
  | _                   , Tydec_const _         -> coretype_equal ty2 ty1
290
  | Tydec_int           , Tydec_int
291
  | Tydec_real          , Tydec_real
292
  (* | Tydec_float         , Tydec_float *)
293
  | Tydec_bool          , Tydec_bool            -> true
294
  | Tydec_clock ty1     , Tydec_clock ty2       -> coretype_equal ty1 ty2
295
  | Tydec_array (d1,ty1), Tydec_array (d2, ty2) -> Dimension.is_eq_dimension d1 d2 && coretype_equal ty1 ty2
296
  | Tydec_enum tl1      , Tydec_enum tl2        -> List.sort compare tl1 = List.sort compare tl2
297
  | Tydec_struct fl1    , Tydec_struct fl2      ->
298
       List.length fl1 = List.length fl2
299
    && List.for_all2 (fun (f1, t1) (f2, t2) -> f1 = f2 && coretype_equal t1 t2)
300
      (List.sort (fun (f1,_) (f2,_) -> compare f1 f2) fl1)
301
      (List.sort (fun (f1,_) (f2,_) -> compare f1 f2) fl2)
302
  | _                                  -> false
303
  in ((*Format.eprintf "coretype_equal %a %a = %B@." Printers.pp_var_type_dec_desc ty1 Printers.pp_var_type_dec_desc ty2 res;*) res)
304

    
305
let tag_true = "true"
306
let tag_false = "false"
307
let tag_default = "default"
308

    
309
let const_is_bool c =
310
 match c with
311
 | Const_tag t -> t = tag_true || t = tag_false
312
 | _           -> false
313

    
314
(* Computes the negation of a boolean constant *)
315
let const_negation c =
316
  assert (const_is_bool c);
317
  match c with
318
  | Const_tag t when t = tag_true  -> Const_tag tag_false
319
  | _                              -> Const_tag tag_true
320

    
321
let const_or c1 c2 =
322
  assert (const_is_bool c1 && const_is_bool c2);
323
  match c1, c2 with
324
  | Const_tag t1, _            when t1 = tag_true -> c1
325
  | _           , Const_tag t2 when t2 = tag_true -> c2
326
  | _                                             -> Const_tag tag_false
327

    
328
let const_and c1 c2 =
329
  assert (const_is_bool c1 && const_is_bool c2);
330
  match c1, c2 with
331
  | Const_tag t1, _            when t1 = tag_false -> c1
332
  | _           , Const_tag t2 when t2 = tag_false -> c2
333
  | _                                              -> Const_tag tag_true
334

    
335
let const_xor c1 c2 =
336
  assert (const_is_bool c1 && const_is_bool c2);
337
   match c1, c2 with
338
  | Const_tag t1, Const_tag t2 when t1 <> t2  -> Const_tag tag_true
339
  | _                                         -> Const_tag tag_false
340

    
341
let const_impl c1 c2 =
342
  assert (const_is_bool c1 && const_is_bool c2);
343
  match c1, c2 with
344
  | Const_tag t1, _ when t1 = tag_false           -> Const_tag tag_true
345
  | _           , Const_tag t2 when t2 = tag_true -> Const_tag tag_true
346
  | _                                             -> Const_tag tag_false
347

    
348
(* To guarantee uniqueness of tags in enum types *)
349
let tag_table =
350
  Utils.create_hashtable 20 [
351
   tag_true, top_bool_type;
352
   tag_false, top_bool_type
353
  ]
354

    
355
(* To guarantee uniqueness of fields in struct types *)
356
let field_table =
357
  Utils.create_hashtable 20 [
358
  ]
359

    
360
let get_enum_type_tags cty =
361
(*Format.eprintf "get_enum_type_tags %a@." Printers.pp_var_type_dec_desc cty;*)
362
 match cty with
363
 | Tydec_bool    -> [tag_true; tag_false]
364
 | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with
365
                     | Tydec_enum tl -> tl
366
                     | _             -> assert false)
367
 | _            -> assert false
368

    
369
let get_struct_type_fields cty =
370
 match cty with
371
 | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with
372
                     | Tydec_struct fl -> fl
373
                     | _               -> assert false)
374
 | _            -> assert false
375

    
376
let const_of_bool b =
377
 Const_tag (if b then tag_true else tag_false)
378

    
379
(* let get_const c = snd (Hashtbl.find consts_table c) *)
380

    
381
let ident_of_expr expr =
382
 match expr.expr_desc with
383
 | Expr_ident id -> id
384
 | _             -> assert false
385

    
386
(* Generate a new ident expression from a declared variable *)
387
let expr_of_vdecl v =
388
  { expr_tag = Utils.new_tag ();
389
    expr_desc = Expr_ident v.var_id;
390
    expr_type = v.var_type;
391
    expr_clock = v.var_clock;
392
    expr_delay = Delay.new_var ();
393
    expr_annot = None;
394
    expr_loc = v.var_loc }
395

    
396
(* Caution, returns an untyped and unclocked expression *)
397
let expr_of_ident id loc =
398
  {expr_tag = Utils.new_tag ();
399
   expr_desc = Expr_ident id;
400
   expr_type = Types.new_var ();
401
   expr_clock = Clocks.new_var true;
402
   expr_delay = Delay.new_var ();
403
   expr_loc = loc;
404
   expr_annot = None}
405

    
406
let is_tuple_expr expr =
407
 match expr.expr_desc with
408
  | Expr_tuple _ -> true
409
  | _            -> false
410

    
411
let expr_list_of_expr expr =
412
  match expr.expr_desc with
413
  | Expr_tuple elist -> elist
414
  | _                -> [expr]
415

    
416
let expr_of_expr_list loc elist =
417
 match elist with
418
 | [t]  -> { t with expr_loc = loc }
419
 | t::_ ->
420
    let tlist = List.map (fun e -> e.expr_type) elist in
421
    let clist = List.map (fun e -> e.expr_clock) elist in
422
    { t with expr_desc = Expr_tuple elist;
423
	     expr_type = Type_predef.type_tuple tlist;
424
	     expr_clock = Clock_predef.ck_tuple clist;
425
	     expr_tag = Utils.new_tag ();
426
	     expr_loc = loc }
427
 | _    -> assert false
428

    
429
let call_of_expr expr =
430
 match expr.expr_desc with
431
 | Expr_appl (f, args, r) -> (f, expr_list_of_expr args, r)
432
 | _                      -> assert false
433

    
434
(* Conversion from dimension expr to standard expr, for the purpose of printing, typing, etc... *)
435
let rec expr_of_dimension dim =
436
 match dim.dim_desc with
437
 | Dbool b        ->
438
     mkexpr dim.dim_loc (Expr_const (const_of_bool b))
439
 | Dint i         ->
440
     mkexpr dim.dim_loc (Expr_const (Const_int i))
441
 | Dident id      ->
442
     mkexpr dim.dim_loc (Expr_ident id)
443
 | Dite (c, t, e) ->
444
     mkexpr dim.dim_loc (Expr_ite (expr_of_dimension c, expr_of_dimension t, expr_of_dimension e))
445
 | Dappl (id, args) ->
446
     mkexpr dim.dim_loc (Expr_appl (id, expr_of_expr_list dim.dim_loc (List.map expr_of_dimension args), None))
447
 | Dlink dim'       -> expr_of_dimension dim'
448
 | Dvar
449
 | Dunivar          -> (Format.eprintf "internal error: Corelang.expr_of_dimension %a@." Dimension.pp_dimension dim;
450
			assert false)
451

    
452
let dimension_of_const loc const =
453
 match const with
454
 | Const_int i                                    -> mkdim_int loc i
455
 | Const_tag t when t = tag_true || t = tag_false -> mkdim_bool loc (t = tag_true)
456
 | _                                              -> raise InvalidDimension
457

    
458
(* Conversion from standard expr to dimension expr, for the purpose of injecting static call arguments 
459
   into dimension expressions *)
460
let rec dimension_of_expr expr =
461
  match expr.expr_desc with
462
  | Expr_const c  -> dimension_of_const expr.expr_loc c
463
  | Expr_ident id -> mkdim_ident expr.expr_loc id
464
  | Expr_appl (f, args, None) when Basic_library.is_expr_internal_fun expr ->
465
      let k = Types.get_static_value (Env.lookup_value Basic_library.type_env f) in
466
      if k = None then raise InvalidDimension;
467
      mkdim_appl expr.expr_loc f (List.map dimension_of_expr (expr_list_of_expr args))
468
  | Expr_ite (i, t, e)        ->
469
      mkdim_ite expr.expr_loc (dimension_of_expr i) (dimension_of_expr t) (dimension_of_expr e)
470
  | _ -> raise InvalidDimension (* not a simple dimension expression *)
471

    
472

    
473
let sort_handlers hl =
474
 List.sort (fun (t, _) (t', _) -> compare t t') hl
475

    
476
let num_10 = Num.num_of_int 10
477
  
478
let rec is_eq_const c1 c2 =
479
  match c1, c2 with
480
  | Const_real (n1, i1, _), Const_real (n2, i2, _)
481
    -> Num.(let n1 = n1 // (num_10 **/ (num_of_int i1)) in
482
	    let n2 = n2 // (num_10 **/ (num_of_int i2)) in
483
	    eq_num n1 n2)
484
  | Const_struct lcl1, Const_struct lcl2
485
    -> List.length lcl1 = List.length lcl2
486
    && List.for_all2 (fun (l1, c1) (l2, c2) -> l1 = l2 && is_eq_const c1 c2) lcl1 lcl2
487
  | _  -> c1 = c2
488

    
489
let rec is_eq_expr e1 e2 = match e1.expr_desc, e2.expr_desc with
490
  | Expr_const c1, Expr_const c2 -> is_eq_const c1 c2
491
  | Expr_ident i1, Expr_ident i2 -> i1 = i2
492
  | Expr_array el1, Expr_array el2 
493
  | Expr_tuple el1, Expr_tuple el2 -> 
494
    List.length el1 = List.length el2 && List.for_all2 is_eq_expr el1 el2 
495
  | Expr_arrow (e1, e2), Expr_arrow (e1', e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2'
496
  | Expr_fby (e1,e2), Expr_fby (e1',e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2'
497
  | Expr_ite (i1, t1, e1), Expr_ite (i2, t2, e2) -> is_eq_expr i1 i2 && is_eq_expr t1 t2 && is_eq_expr e1 e2
498
  (* | Expr_concat (e1,e2), Expr_concat (e1',e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2' *)
499
  (* | Expr_tail e, Expr_tail e' -> is_eq_expr e e' *)
500
  | Expr_pre e, Expr_pre e' -> is_eq_expr e e'
501
  | Expr_when (e, i, l), Expr_when (e', i', l') -> l=l' && i=i' && is_eq_expr e e'
502
  | Expr_merge(i, hl), Expr_merge(i', hl') -> i=i' && List.for_all2 (fun (t, h) (t', h') -> t=t' && is_eq_expr h h') (sort_handlers hl) (sort_handlers hl')
503
  | Expr_appl (i, e, r), Expr_appl (i', e', r') -> i=i' && r=r' && is_eq_expr e e'
504
  | Expr_power (e1, i1), Expr_power (e2, i2)
505
  | Expr_access (e1, i1), Expr_access (e2, i2) -> is_eq_expr e1 e2 && is_eq_expr (expr_of_dimension i1) (expr_of_dimension i2)
506
  | _ -> false
507

    
508
let get_node_vars nd =
509
  nd.node_inputs @ nd.node_locals @ nd.node_outputs
510

    
511
let mk_new_node_name nd id =
512
  let used_vars = get_node_vars nd in
513
  let used v = List.exists (fun vdecl -> vdecl.var_id = v) used_vars in
514
  mk_new_name used id
515

    
516
let get_var id var_list =
517
  List.find (fun v -> v.var_id = id) var_list
518

    
519
let get_node_var id node =
520
  try
521
    get_var id (get_node_vars node)
522
  with Not_found -> begin
523
    (* Format.eprintf "Unable to find variable %s in node %s@.@?" id node.node_id; *)
524
    raise Not_found
525
  end
526
    
527
let get_node_eqs =
528
  let get_eqs stmts =
529
    List.fold_right
530
      (fun stmt res ->
531
	match stmt with
532
	| Eq eq -> eq :: res
533
	| Aut _ -> assert false)
534
      stmts
535
      [] in
536
  let table_eqs = Hashtbl.create 23 in
537
  (fun nd ->
538
    try
539
      let (old, res) = Hashtbl.find table_eqs nd.node_id
540
      in if old == nd.node_stmts then res else raise Not_found
541
    with Not_found -> 
542
      let res = get_eqs nd.node_stmts in
543
      begin
544
	Hashtbl.replace table_eqs nd.node_id (nd.node_stmts, res);
545
	res
546
      end)
547

    
548
let get_node_eq id node =
549
 List.find (fun eq -> List.mem id eq.eq_lhs) (get_node_eqs node)
550

    
551
let get_nodes prog = 
552
  List.fold_left (
553
    fun nodes decl ->
554
      match decl.top_decl_desc with
555
	| Node _ -> decl::nodes
556
	| Const _ | ImportedNode _ | Open _ | TypeDef _ -> nodes  
557
  ) [] prog
558

    
559
let get_imported_nodes prog = 
560
  List.fold_left (
561
    fun nodes decl ->
562
      match decl.top_decl_desc with
563
	| ImportedNode _ -> decl::nodes
564
	| Const _ | Node _ | Open _ | TypeDef _-> nodes  
565
  ) [] prog
566

    
567
let get_consts prog = 
568
  List.fold_right (
569
    fun decl consts ->
570
      match decl.top_decl_desc with
571
	| Const _ -> decl::consts
572
	| Node _ | ImportedNode _ | Open _ | TypeDef _ -> consts  
573
  ) prog []
574

    
575
let get_typedefs prog = 
576
  List.fold_right (
577
    fun decl types ->
578
      match decl.top_decl_desc with
579
	| TypeDef _ -> decl::types
580
	| Node _ | ImportedNode _ | Open _ | Const _ -> types  
581
  ) prog []
582

    
583
let get_dependencies prog =
584
  List.fold_right (
585
    fun decl deps ->
586
      match decl.top_decl_desc with
587
	| Open _ -> decl::deps
588
	| Node _ | ImportedNode _ | TypeDef _ | Const _ -> deps  
589
  ) prog []
590

    
591
let get_node_interface nd =
592
 {nodei_id = nd.node_id;
593
  nodei_type = nd.node_type;
594
  nodei_clock = nd.node_clock;
595
  nodei_inputs = nd.node_inputs;
596
  nodei_outputs = nd.node_outputs;
597
  nodei_stateless = nd.node_dec_stateless;
598
  nodei_spec = nd.node_spec;
599
  nodei_prototype = None;
600
  nodei_in_lib = [];
601
 }
602

    
603
(************************************************************************)
604
(*        Renaming                                                      *)
605

    
606
let rec rename_static rename cty =
607
 match cty with
608
 | Tydec_array (d, cty') -> Tydec_array (Dimension.expr_replace_expr rename d, rename_static rename cty')
609
 | Tydec_clock cty       -> Tydec_clock (rename_static rename cty)
610
 | Tydec_struct fl       -> Tydec_struct (List.map (fun (f, cty) -> f, rename_static rename cty) fl)
611
 | _                      -> cty
612

    
613
let rec rename_carrier rename cck =
614
 match cck with
615
 | Ckdec_bool cl -> Ckdec_bool (List.map (fun (c, l) -> rename c, l) cl)
616
 | _             -> cck
617

    
618
(*Format.eprintf "Types.rename_static %a = %a@." print_ty ty print_ty res; res*)
619

    
620
(* applies the renaming function [fvar] to all variables of expression [expr] *)
621
 let rec expr_replace_var fvar expr =
622
  { expr with expr_desc = expr_desc_replace_var fvar expr.expr_desc }
623

    
624
 and expr_desc_replace_var fvar expr_desc =
625
   match expr_desc with
626
   | Expr_const _ -> expr_desc
627
   | Expr_ident i -> Expr_ident (fvar i)
628
   | Expr_array el -> Expr_array (List.map (expr_replace_var fvar) el)
629
   | Expr_access (e1, d) -> Expr_access (expr_replace_var fvar e1, d)
630
   | Expr_power (e1, d) -> Expr_power (expr_replace_var fvar e1, d)
631
   | Expr_tuple el -> Expr_tuple (List.map (expr_replace_var fvar) el)
632
   | Expr_ite (c, t, e) -> Expr_ite (expr_replace_var fvar c, expr_replace_var fvar t, expr_replace_var fvar e)
633
   | Expr_arrow (e1, e2)-> Expr_arrow (expr_replace_var fvar e1, expr_replace_var fvar e2) 
634
   | Expr_fby (e1, e2) -> Expr_fby (expr_replace_var fvar e1, expr_replace_var fvar e2)
635
   | Expr_pre e' -> Expr_pre (expr_replace_var fvar e')
636
   | Expr_when (e', i, l)-> Expr_when (expr_replace_var fvar e', fvar i, l)
637
   | Expr_merge (i, hl) -> Expr_merge (fvar i, List.map (fun (t, h) -> (t, expr_replace_var fvar h)) hl)
638
   | Expr_appl (i, e', i') -> Expr_appl (i, expr_replace_var fvar e', Utils.option_map (expr_replace_var fvar) i')
639

    
640
(* Applies the renaming function [fvar] to every rhs
641
   only when the corresponding lhs satisfies predicate [pvar] *)
642
 let eq_replace_rhs_var pvar fvar eq =
643
   let pvar l = List.exists pvar l in
644
   let rec replace lhs rhs =
645
     { rhs with expr_desc =
646
     match lhs with
647
     | []  -> assert false
648
     | [_] -> if pvar lhs then expr_desc_replace_var fvar rhs.expr_desc else rhs.expr_desc
649
     | _   ->
650
       (match rhs.expr_desc with
651
       | Expr_tuple tl ->
652
	 Expr_tuple (List.map2 (fun v e -> replace [v] e) lhs tl)
653
       | Expr_appl (f, arg, None) when Basic_library.is_expr_internal_fun rhs ->
654
	 let args = expr_list_of_expr arg in
655
	 Expr_appl (f, expr_of_expr_list arg.expr_loc (List.map (replace lhs) args), None)
656
       | Expr_array _
657
       | Expr_access _
658
       | Expr_power _
659
       | Expr_const _
660
       | Expr_ident _
661
       | Expr_appl _   ->
662
	 if pvar lhs
663
	 then expr_desc_replace_var fvar rhs.expr_desc
664
	 else rhs.expr_desc
665
       | Expr_ite (c, t, e)   -> Expr_ite (replace lhs c, replace lhs t, replace lhs e)
666
       | Expr_arrow (e1, e2)  -> Expr_arrow (replace lhs e1, replace lhs e2) 
667
       | Expr_fby (e1, e2)    -> Expr_fby (replace lhs e1, replace lhs e2)
668
       | Expr_pre e'          -> Expr_pre (replace lhs e')
669
       | Expr_when (e', i, l) -> let i' = if pvar lhs then fvar i else i
670
				 in Expr_when (replace lhs e', i', l)
671
       | Expr_merge (i, hl)   -> let i' = if pvar lhs then fvar i else i
672
				 in Expr_merge (i', List.map (fun (t, h) -> (t, replace lhs h)) hl)
673
       )
674
     }
675
   in { eq with eq_rhs = replace eq.eq_lhs eq.eq_rhs }
676

    
677

    
678
 let rec rename_expr  f_node f_var f_const expr =
679
   { expr with expr_desc = rename_expr_desc f_node f_var f_const expr.expr_desc }
680
 and rename_expr_desc f_node f_var f_const expr_desc =
681
   let re = rename_expr  f_node f_var f_const in
682
   match expr_desc with
683
   | Expr_const _ -> expr_desc
684
   | Expr_ident i -> Expr_ident (f_var i)
685
   | Expr_array el -> Expr_array (List.map re el)
686
   | Expr_access (e1, d) -> Expr_access (re e1, d)
687
   | Expr_power (e1, d) -> Expr_power (re e1, d)
688
   | Expr_tuple el -> Expr_tuple (List.map re el)
689
   | Expr_ite (c, t, e) -> Expr_ite (re c, re t, re e)
690
   | Expr_arrow (e1, e2)-> Expr_arrow (re e1, re e2) 
691
   | Expr_fby (e1, e2) -> Expr_fby (re e1, re e2)
692
   | Expr_pre e' -> Expr_pre (re e')
693
   | Expr_when (e', i, l)-> Expr_when (re e', f_var i, l)
694
   | Expr_merge (i, hl) -> 
695
     Expr_merge (f_var i, List.map (fun (t, h) -> (t, re h)) hl)
696
   | Expr_appl (i, e', i') -> 
697
     Expr_appl (f_node i, re e', Utils.option_map re i')
698
  
699
 let rename_node_annot f_node f_var f_const expr  =
700
   expr
701
 (* TODO assert false *)
702

    
703
 let rename_expr_annot f_node f_var f_const annot =
704
   annot
705
 (* TODO assert false *)
706

    
707
let rename_node f_node f_var f_const nd =
708
  let rename_var v = { v with var_id = f_var v.var_id } in
709
  let rename_eq eq = { eq with
710
      eq_lhs = List.map f_var eq.eq_lhs; 
711
      eq_rhs = rename_expr f_node f_var f_const eq.eq_rhs
712
    } 
713
  in
714
  let inputs = List.map rename_var nd.node_inputs in
715
  let outputs = List.map rename_var nd.node_outputs in
716
  let locals = List.map rename_var nd.node_locals in
717
  let gen_calls = List.map (rename_expr f_node f_var f_const) nd.node_gencalls in
718
  let node_checks = List.map (Dimension.expr_replace_var f_var)  nd.node_checks in
719
  let node_asserts = List.map 
720
    (fun a -> 
721
      {a with assert_expr = 
722
	  let expr = a.assert_expr in
723
	  rename_expr f_node f_var f_const expr})
724
    nd.node_asserts
725
  in
726
  let node_stmts = List.map (fun eq -> Eq (rename_eq eq)) (get_node_eqs nd) in
727
  let spec = 
728
    Utils.option_map 
729
      (fun s -> rename_node_annot f_node f_var f_const s) 
730
      nd.node_spec 
731
  in
732
  let annot =
733
    List.map 
734
      (fun s -> rename_expr_annot f_node f_var f_const s) 
735
      nd.node_annot
736
  in
737
  {
738
    node_id = f_node nd.node_id;
739
    node_type = nd.node_type;
740
    node_clock = nd.node_clock;
741
    node_inputs = inputs;
742
    node_outputs = outputs;
743
    node_locals = locals;
744
    node_gencalls = gen_calls;
745
    node_checks = node_checks;
746
    node_asserts = node_asserts;
747
    node_stmts = node_stmts;
748
    node_dec_stateless = nd.node_dec_stateless;
749
    node_stateless = nd.node_stateless;
750
    node_spec = spec;
751
    node_annot = annot;
752
  }
753

    
754

    
755
let rename_const f_const c =
756
  { c with const_id = f_const c.const_id }
757

    
758
let rename_typedef f_var t =
759
  match t.tydef_desc with
760
  | Tydec_enum tags -> { t with tydef_desc = Tydec_enum (List.map f_var tags) }
761
  | _               -> t
762

    
763
let rename_prog f_node f_var f_const prog =
764
  List.rev (
765
    List.fold_left (fun accu top ->
766
      (match top.top_decl_desc with
767
      | Node nd -> 
768
	 { top with top_decl_desc = Node (rename_node f_node f_var f_const nd) }
769
      | Const c -> 
770
	 { top with top_decl_desc = Const (rename_const f_const c) }
771
      | TypeDef tdef ->
772
	 { top with top_decl_desc = TypeDef (rename_typedef f_var tdef) }
773
      | ImportedNode _
774
      | Open _       -> top)
775
      ::accu
776
) [] prog
777
		   )
778

    
779
(**********************************************************************)
780
(* Pretty printers *)
781

    
782
let pp_decl_type fmt tdecl =
783
  match tdecl.top_decl_desc with
784
  | Node nd ->
785
    fprintf fmt "%s: " nd.node_id;
786
    Utils.reset_names ();
787
    fprintf fmt "%a@ " Types.print_ty nd.node_type
788
  | ImportedNode ind ->
789
    fprintf fmt "%s: " ind.nodei_id;
790
    Utils.reset_names ();
791
    fprintf fmt "%a@ " Types.print_ty ind.nodei_type
792
  | Const _ | Open _ | TypeDef _ -> ()
793

    
794
let pp_prog_type fmt tdecl_list =
795
  Utils.fprintf_list ~sep:"" pp_decl_type fmt tdecl_list
796

    
797
let pp_decl_clock fmt cdecl =
798
  match cdecl.top_decl_desc with
799
  | Node nd ->
800
    fprintf fmt "%s: " nd.node_id;
801
    Utils.reset_names ();
802
    fprintf fmt "%a@ " Clocks.print_ck nd.node_clock
803
  | ImportedNode ind ->
804
    fprintf fmt "%s: " ind.nodei_id;
805
    Utils.reset_names ();
806
    fprintf fmt "%a@ " Clocks.print_ck ind.nodei_clock
807
  | Const _ | Open _ | TypeDef _ -> ()
808

    
809
let pp_prog_clock fmt prog =
810
  Utils.fprintf_list ~sep:"" pp_decl_clock fmt prog
811

    
812
let pp_error fmt = function
813
    Main_not_found ->
814
      fprintf fmt "Could not find the definition of main node %s.@."
815
	!Global.main_node
816
  | Main_wrong_kind ->
817
    fprintf fmt
818
      "Node %s does not correspond to a valid main node definition.@." 
819
      !Global.main_node 
820
  | No_main_specified ->
821
    fprintf fmt "No main node specified (use -node option)@."
822
  | Unbound_symbol sym ->
823
    fprintf fmt
824
      "%s is undefined.@."
825
      sym
826
  | Already_bound_symbol sym -> 
827
    fprintf fmt
828
      "%s is already defined.@."
829
      sym
830
  | Unknown_library sym ->
831
    fprintf fmt
832
      "impossible to load library %s.lusic.@.Please compile the corresponding interface or source file.@."
833
      sym
834
  | Wrong_number sym ->
835
    fprintf fmt
836
      "library %s.lusic has a different version number and may crash compiler.@.Please recompile the corresponding interface or source file.@."
837
      sym
838

    
839
(* filling node table with internal functions *)
840
let vdecls_of_typ_ck cpt ty =
841
  let loc = Location.dummy_loc in
842
  List.map
843
    (fun _ -> incr cpt;
844
              let name = sprintf "_var_%d" !cpt in
845
              mkvar_decl loc (name, mktyp loc Tydec_any, mkclock loc Ckdec_any, false, None))
846
    (Types.type_list_of_type ty)
847

    
848
let mk_internal_node id =
849
  let spec = None in
850
  let ty = Env.lookup_value Basic_library.type_env id in
851
  let ck = Env.lookup_value Basic_library.clock_env id in
852
  let (tin, tout) = Types.split_arrow ty in
853
  (*eprintf "internal fun %s: %d -> %d@." id (List.length (Types.type_list_of_type tin)) (List.length (Types.type_list_of_type tout));*)
854
  let cpt = ref (-1) in
855
  mktop
856
    (ImportedNode
857
       {nodei_id = id;
858
	nodei_type = ty;
859
	nodei_clock = ck;
860
	nodei_inputs = vdecls_of_typ_ck cpt tin;
861
	nodei_outputs = vdecls_of_typ_ck cpt tout;
862
	nodei_stateless = Types.get_static_value ty <> None;
863
	nodei_spec = spec;
864
	nodei_prototype = None;
865
       	nodei_in_lib = [];
866
       })
867

    
868
let add_internal_funs () =
869
  List.iter
870
    (fun id -> let nd = mk_internal_node id in Hashtbl.add node_table id nd)
871
    Basic_library.internal_funs
872

    
873

    
874

    
875
(* Replace any occurence of a var in vars_to_replace by its associated
876
   expression in defs until e does not contain any such variables *)
877
let rec substitute_expr vars_to_replace defs e =
878
  let se = substitute_expr vars_to_replace defs in
879
  { e with expr_desc = 
880
      let ed = e.expr_desc in
881
      match ed with
882
      | Expr_const _ -> ed
883
      | Expr_array el -> Expr_array (List.map se el)
884
      | Expr_access (e1, d) -> Expr_access (se e1, d)
885
      | Expr_power (e1, d) -> Expr_power (se e1, d)
886
      | Expr_tuple el -> Expr_tuple (List.map se el)
887
      | Expr_ite (c, t, e) -> Expr_ite (se c, se t, se e)
888
      | Expr_arrow (e1, e2)-> Expr_arrow (se e1, se e2) 
889
      | Expr_fby (e1, e2) -> Expr_fby (se e1, se e2)
890
      | Expr_pre e' -> Expr_pre (se e')
891
      | Expr_when (e', i, l)-> Expr_when (se e', i, l)
892
      | Expr_merge (i, hl) -> Expr_merge (i, List.map (fun (t, h) -> (t, se h)) hl)
893
      | Expr_appl (i, e', i') -> Expr_appl (i, se e', i')
894
      | Expr_ident i -> 
895
	if List.exists (fun v -> v.var_id = i) vars_to_replace then (
896
	  let eq_i eq = eq.eq_lhs = [i] in
897
	  if List.exists eq_i defs then
898
	    let sub = List.find eq_i defs in
899
	    let sub' = se sub.eq_rhs in
900
	    sub'.expr_desc
901
	  else 
902
	    assert false
903
	)
904
	else
905
	  ed
906

    
907
  }
908
(* FAUT IL RETIRER ?
909
  
910
 let rec expr_to_eexpr  expr =
911
   { eexpr_tag = expr.expr_tag;
912
     eexpr_desc = expr_desc_to_eexpr_desc expr.expr_desc;
913
     eexpr_type = expr.expr_type;
914
     eexpr_clock = expr.expr_clock;
915
     eexpr_loc = expr.expr_loc
916
   }
917
 and expr_desc_to_eexpr_desc expr_desc =
918
   let conv = expr_to_eexpr in
919
   match expr_desc with
920
   | Expr_const c -> EExpr_const (match c with
921
     | Const_int x -> EConst_int x 
922
     | Const_real x -> EConst_real x 
923
     | Const_float x -> EConst_float x 
924
     | Const_tag x -> EConst_tag x 
925
     | _ -> assert false
926

    
927
   )
928
   | Expr_ident i -> EExpr_ident i
929
   | Expr_tuple el -> EExpr_tuple (List.map conv el)
930

    
931
   | Expr_arrow (e1, e2)-> EExpr_arrow (conv e1, conv e2) 
932
   | Expr_fby (e1, e2) -> EExpr_fby (conv e1, conv e2)
933
   | Expr_pre e' -> EExpr_pre (conv e')
934
   | Expr_appl (i, e', i') -> 
935
     EExpr_appl 
936
       (i, conv e', match i' with None -> None | Some(id, _) -> Some id)
937

    
938
   | Expr_when _
939
   | Expr_merge _ -> assert false
940
   | Expr_array _ 
941
   | Expr_access _ 
942
   | Expr_power _  -> assert false
943
   | Expr_ite (c, t, e) -> assert false 
944
   | _ -> assert false
945

    
946
     *)
947
let rec get_expr_calls nodes e =
948
  let get_calls = get_expr_calls nodes in
949
  match e.expr_desc with
950
  | Expr_const _ 
951
   | Expr_ident _ -> Utils.ISet.empty
952
   | Expr_tuple el
953
   | Expr_array el -> List.fold_left (fun accu e -> Utils.ISet.union accu (get_calls e)) Utils.ISet.empty el
954
   | Expr_pre e1 
955
   | Expr_when (e1, _, _) 
956
   | Expr_access (e1, _) 
957
   | Expr_power (e1, _) -> get_calls e1
958
   | Expr_ite (c, t, e) -> Utils.ISet.union (Utils.ISet.union (get_calls c) (get_calls t)) (get_calls e) 
959
   | Expr_arrow (e1, e2) 
960
   | Expr_fby (e1, e2) -> Utils.ISet.union (get_calls e1) (get_calls e2)
961
   | Expr_merge (_, hl) -> List.fold_left (fun accu (_, h) -> Utils.ISet.union accu (get_calls h)) Utils.ISet.empty  hl
962
   | Expr_appl (i, e', i') -> 
963
     if Basic_library.is_expr_internal_fun e then 
964
       (get_calls e') 
965
     else
966
       let calls =  Utils.ISet.add i (get_calls e') in
967
       let test = (fun n -> match n.top_decl_desc with Node nd -> nd.node_id = i | _ -> false) in
968
       if List.exists test nodes then
969
	 match (List.find test nodes).top_decl_desc with
970
	 | Node nd -> Utils.ISet.union (get_node_calls nodes nd) calls
971
	 | _ -> assert false
972
       else 
973
	 calls
974

    
975
and get_eq_calls nodes eq =
976
  get_expr_calls nodes eq.eq_rhs
977
and get_node_calls nodes node =
978
  List.fold_left (fun accu eq -> Utils.ISet.union (get_eq_calls nodes eq) accu) Utils.ISet.empty (get_node_eqs node)
979

    
980
let rec get_expr_vars vars e =
981
  get_expr_desc_vars vars e.expr_desc
982
and get_expr_desc_vars vars expr_desc =
983
  match expr_desc with
984
  | Expr_const _ -> vars
985
  | Expr_ident x -> Utils.ISet.add x vars
986
  | Expr_tuple el
987
  | Expr_array el -> List.fold_left get_expr_vars vars el
988
  | Expr_pre e1 -> get_expr_vars vars e1
989
  | Expr_when (e1, c, _) -> get_expr_vars (Utils.ISet.add c vars) e1 
990
  | Expr_access (e1, d) 
991
  | Expr_power (e1, d)   -> List.fold_left get_expr_vars vars [e1; expr_of_dimension d]
992
  | Expr_ite (c, t, e) -> List.fold_left get_expr_vars vars [c; t; e]
993
  | Expr_arrow (e1, e2) 
994
  | Expr_fby (e1, e2) -> List.fold_left get_expr_vars vars [e1; e2]
995
  | Expr_merge (c, hl) -> List.fold_left (fun vars (_, h) -> get_expr_vars vars h) (Utils.ISet.add c vars) hl
996
  | Expr_appl (_, arg, None)   -> get_expr_vars vars arg
997
  | Expr_appl (_, arg, Some r) -> List.fold_left get_expr_vars vars [arg; r]
998

    
999

    
1000
let rec expr_has_arrows e =
1001
  expr_desc_has_arrows e.expr_desc
1002
and expr_desc_has_arrows expr_desc =
1003
  match expr_desc with
1004
  | Expr_const _ 
1005
  | Expr_ident _ -> false
1006
  | Expr_tuple el
1007
  | Expr_array el -> List.exists expr_has_arrows el
1008
  | Expr_pre e1 
1009
  | Expr_when (e1, _, _) 
1010
  | Expr_access (e1, _) 
1011
  | Expr_power (e1, _) -> expr_has_arrows e1
1012
  | Expr_ite (c, t, e) -> List.exists expr_has_arrows [c; t; e]
1013
  | Expr_arrow (e1, e2) 
1014
  | Expr_fby (e1, e2) -> true
1015
  | Expr_merge (_, hl) -> List.exists (fun (_, h) -> expr_has_arrows h) hl
1016
  | Expr_appl (i, e', i') -> expr_has_arrows e'
1017

    
1018
and eq_has_arrows eq =
1019
  expr_has_arrows eq.eq_rhs
1020
and node_has_arrows node =
1021
  List.exists (fun eq -> eq_has_arrows eq) (get_node_eqs node)
1022

    
1023

    
1024
let copy_var_decl vdecl =
1025
  mkvar_decl vdecl.var_loc ~orig:vdecl.var_orig (vdecl.var_id, vdecl.var_dec_type, vdecl.var_dec_clock, vdecl.var_dec_const, vdecl.var_dec_value)
1026

    
1027
let copy_const cdecl =
1028
  { cdecl with const_type = Types.new_var () }
1029

    
1030
let copy_node nd =
1031
  { nd with
1032
    node_type     = Types.new_var ();
1033
    node_clock    = Clocks.new_var true;
1034
    node_inputs   = List.map copy_var_decl nd.node_inputs;
1035
    node_outputs  = List.map copy_var_decl nd.node_outputs;
1036
    node_locals   = List.map copy_var_decl nd.node_locals;
1037
    node_gencalls = [];
1038
    node_checks   = [];
1039
    node_stateless = None;
1040
  }
1041

    
1042
let copy_top top =
1043
  match top.top_decl_desc with
1044
  | Node nd -> { top with top_decl_desc = Node (copy_node nd)  }
1045
  | Const c -> { top with top_decl_desc = Const (copy_const c) }
1046
  | _       -> top
1047

    
1048
let copy_prog top_list =
1049
  List.map copy_top top_list
1050

    
1051
let functional_backend () = 
1052
  match !Options.output with
1053
  | "horn" | "lustre" | "acsl" -> true
1054
  | _ -> false
1055

    
1056
(* Local Variables: *)
1057
(* compile-command:"make -C .." *)
1058
(* End: *)