Project

General

Profile

Statistics
| Branch: | Tag: | Revision:

lustrec / src / corelang.ml @ 7dd90f72

History | View | Annotate | Download (32.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 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) =
45
  { var_id = id;
46
    var_orig = orig;
47
    var_dec_type = ty_dec;
48
    var_dec_clock = ck_dec;
49
    var_dec_const = is_const;
50
    var_type = Types.new_var ();
51
    var_clock = Clocks.new_var true;
52
    var_loc = loc }
53

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

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

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

    
80
let mkeq loc (lhs, rhs) =
81
  { eq_lhs = lhs;
82
    eq_rhs = rhs;
83
    eq_loc = loc }
84

    
85
let mkassert loc expr =
86
  { assert_loc = loc;
87
    assert_expr = expr
88
  }
89

    
90
let mktop_decl loc own itf d =
91
  { top_decl_desc = d; top_decl_loc = loc; top_decl_owner = own; top_decl_itf = itf }
92

    
93
let mkpredef_call loc funname args =
94
  mkexpr loc (Expr_appl (funname, mkexpr loc (Expr_tuple args), None))
95

    
96

    
97
let const_of_top top_decl =
98
  match top_decl.top_decl_desc with
99
  | Const c -> c
100
  | _ -> assert false
101

    
102
let node_of_top top_decl =
103
  match top_decl.top_decl_desc with
104
  | Node nd -> nd
105
  | _ -> assert false
106

    
107
let imported_node_of_top top_decl =
108
  match top_decl.top_decl_desc with
109
  | ImportedNode ind -> ind
110
  | _ -> assert false
111

    
112
let typedef_of_top top_decl =
113
  match top_decl.top_decl_desc with
114
  | TypeDef tdef -> tdef
115
  | _ -> assert false
116

    
117
let dependency_of_top top_decl =
118
  match top_decl.top_decl_desc with
119
  | Open (local, dep) -> (local, dep)
120
  | _ -> assert false
121

    
122
let consts_of_enum_type top_decl =
123
  match top_decl.top_decl_desc with
124
  | TypeDef tdef ->
125
    (match tdef.tydef_desc with
126
     | 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
127
     | _               -> [])
128
  | _ -> assert false
129

    
130
(************************************************************)
131
(*   Eexpr functions *)
132
(************************************************************)
133

    
134
let merge_node_annot ann1 ann2 =
135
  { requires = ann1.requires @ ann2.requires;
136
    ensures = ann1.ensures @ ann2.ensures;
137
    behaviors = ann1.behaviors @ ann2.behaviors;
138
    spec_loc = ann1.spec_loc
139
  }
140

    
141
let mkeexpr loc expr =
142
  { eexpr_tag = Utils.new_tag ();
143
    eexpr_qfexpr = expr;
144
    eexpr_quantifiers = [];
145
    eexpr_type = Types.new_var ();
146
    eexpr_clock = Clocks.new_var true;
147
    eexpr_normalized = None;
148
    eexpr_loc = loc }
149

    
150
let extend_eexpr q e = { e with eexpr_quantifiers = q@e.eexpr_quantifiers }
151

    
152
(*
153
let mkepredef_call loc funname args =
154
  mkeexpr loc (EExpr_appl (funname, mkeexpr loc (EExpr_tuple args), None))
155

    
156
let mkepredef_unary_call loc funname arg =
157
  mkeexpr loc (EExpr_appl (funname, arg, None))
158
*)
159

    
160
let merge_expr_annot ann1 ann2 =
161
  match ann1, ann2 with
162
    | None, None -> assert false
163
    | Some _, None -> ann1
164
    | None, Some _ -> ann2
165
    | Some ann1, Some ann2 -> Some {
166
      annots = ann1.annots @ ann2.annots;
167
      annot_loc = ann1.annot_loc
168
    }
169

    
170
let update_expr_annot node_id e annot =
171
  List.iter (fun (key, _) -> 
172
    Annotations.add_expr_ann node_id e.expr_tag key
173
  ) annot.annots;
174
  { e with expr_annot = merge_expr_annot e.expr_annot (Some annot) }
175

    
176

    
177
(***********************************************************)
178
(* Fast access to nodes, by name *)
179
let (node_table : (ident, top_decl) Hashtbl.t) = Hashtbl.create 30
180
let consts_table = Hashtbl.create 30
181

    
182
let print_node_table fmt () =
183
  begin
184
    Format.fprintf fmt "{ /* node table */@.";
185
    Hashtbl.iter (fun id nd ->
186
      Format.fprintf fmt "%s |-> %a"
187
	id
188
	Printers.pp_short_decl nd
189
    ) node_table;
190
    Format.fprintf fmt "}@."
191
  end
192

    
193
let print_consts_table fmt () =
194
  begin
195
    Format.fprintf fmt "{ /* consts table */@.";
196
    Hashtbl.iter (fun id const ->
197
      Format.fprintf fmt "%s |-> %a"
198
	id
199
	Printers.pp_const_decl (const_of_top const)
200
    ) consts_table;
201
    Format.fprintf fmt "}@."
202
  end
203

    
204
let node_name td =
205
    match td.top_decl_desc with 
206
    | Node nd         -> nd.node_id
207
    | ImportedNode nd -> nd.nodei_id
208
    | _ -> assert false
209

    
210
let is_generic_node td =
211
  match td.top_decl_desc with 
212
  | Node nd         -> List.exists (fun v -> v.var_dec_const) nd.node_inputs
213
  | ImportedNode nd -> List.exists (fun v -> v.var_dec_const) nd.nodei_inputs
214
  | _ -> assert false
215

    
216
let node_inputs td =
217
  match td.top_decl_desc with 
218
  | Node nd         -> nd.node_inputs
219
  | ImportedNode nd -> nd.nodei_inputs
220
  | _ -> assert false
221

    
222
let node_from_name id =
223
  try
224
    Hashtbl.find node_table id
225
  with Not_found -> (Format.eprintf "Unable to find any node named %s@ @?" id;
226
		     assert false)
227

    
228
let is_imported_node td =
229
  match td.top_decl_desc with 
230
  | Node nd         -> false
231
  | ImportedNode nd -> true
232
  | _ -> assert false
233

    
234

    
235
(* alias and type definition table *)
236

    
237
let mktop = mktop_decl Location.dummy_loc Version.include_path false 
238

    
239
let top_int_type = mktop (TypeDef {tydef_id = "int"; tydef_desc = Tydec_int})
240
let top_bool_type = mktop (TypeDef {tydef_id = "bool"; tydef_desc = Tydec_bool})
241
let top_float_type = mktop (TypeDef {tydef_id = "float"; tydef_desc = Tydec_float})
242
let top_real_type = mktop (TypeDef {tydef_id = "real"; tydef_desc = Tydec_real})
243

    
244
let type_table =
245
  Utils.create_hashtable 20 [
246
    Tydec_int  , top_int_type;
247
    Tydec_bool , top_bool_type;
248
    Tydec_float, top_float_type;
249
    Tydec_real , top_real_type
250
  ]
251

    
252
let print_type_table fmt () =
253
  begin
254
    Format.fprintf fmt "{ /* type table */@.";
255
    Hashtbl.iter (fun tydec tdef ->
256
      Format.fprintf fmt "%a |-> %a"
257
	Printers.pp_var_type_dec_desc tydec
258
	Printers.pp_typedef (typedef_of_top tdef)
259
    ) type_table;
260
    Format.fprintf fmt "}@."
261
  end
262

    
263
let rec is_user_type typ =
264
  match typ with
265
  | Tydec_int | Tydec_bool | Tydec_real 
266
  | Tydec_float | Tydec_any | Tydec_const _ -> false
267
  | Tydec_clock typ' -> is_user_type typ'
268
  | _ -> true
269

    
270
let get_repr_type typ =
271
  let typ_def = (typedef_of_top (Hashtbl.find type_table typ)).tydef_desc in
272
  if is_user_type typ_def then typ else typ_def
273

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

    
298
let tag_true = "true"
299
let tag_false = "false"
300
let tag_default = "default"
301

    
302
let const_is_bool c =
303
 match c with
304
 | Const_tag t -> t = tag_true || t = tag_false
305
 | _           -> false
306

    
307
(* Computes the negation of a boolean constant *)
308
let const_negation c =
309
  assert (const_is_bool c);
310
  match c with
311
  | Const_tag t when t = tag_true  -> Const_tag tag_false
312
  | _                              -> Const_tag tag_true
313

    
314
let const_or c1 c2 =
315
  assert (const_is_bool c1 && const_is_bool c2);
316
  match c1, c2 with
317
  | Const_tag t1, _            when t1 = tag_true -> c1
318
  | _           , Const_tag t2 when t2 = tag_true -> c2
319
  | _                                             -> Const_tag tag_false
320

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

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

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

    
341
(* To guarantee uniqueness of tags in enum types *)
342
let tag_table =
343
  Utils.create_hashtable 20 [
344
   tag_true, top_bool_type;
345
   tag_false, top_bool_type
346
  ]
347

    
348
(* To guarantee uniqueness of fields in struct types *)
349
let field_table =
350
  Utils.create_hashtable 20 [
351
  ]
352

    
353
let get_enum_type_tags cty =
354
(*Format.eprintf "get_enum_type_tags %a@." Printers.pp_var_type_dec_desc cty;*)
355
 match cty with
356
 | Tydec_bool    -> [tag_true; tag_false]
357
 | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with
358
                     | Tydec_enum tl -> tl
359
                     | _             -> assert false)
360
 | _            -> assert false
361

    
362
let get_struct_type_fields cty =
363
 match cty with
364
 | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with
365
                     | Tydec_struct fl -> fl
366
                     | _               -> assert false)
367
 | _            -> assert false
368

    
369
let const_of_bool b =
370
 Const_tag (if b then tag_true else tag_false)
371

    
372
(* let get_const c = snd (Hashtbl.find consts_table c) *)
373

    
374
let ident_of_expr expr =
375
 match expr.expr_desc with
376
 | Expr_ident id -> id
377
 | _             -> assert false
378

    
379
(* Caution, returns an untyped and unclocked expression *)
380
let expr_of_ident id loc =
381
  {expr_tag = Utils.new_tag ();
382
   expr_desc = Expr_ident id;
383
   expr_type = Types.new_var ();
384
   expr_clock = Clocks.new_var true;
385
   expr_delay = Delay.new_var ();
386
   expr_loc = loc;
387
   expr_annot = None}
388

    
389
let is_tuple_expr expr =
390
 match expr.expr_desc with
391
  | Expr_tuple _ -> true
392
  | _            -> false
393

    
394
let expr_list_of_expr expr =
395
  match expr.expr_desc with
396
  | Expr_tuple elist -> elist
397
  | _                -> [expr]
398

    
399
let expr_of_expr_list loc elist =
400
 match elist with
401
 | [t]  -> { t with expr_loc = loc }
402
 | t::_ ->
403
    let tlist = List.map (fun e -> e.expr_type) elist in
404
    let clist = List.map (fun e -> e.expr_clock) elist in
405
    { t with expr_desc = Expr_tuple elist;
406
	     expr_type = Type_predef.type_tuple tlist;
407
	     expr_clock = Clock_predef.ck_tuple clist;
408
	     expr_tag = Utils.new_tag ();
409
	     expr_loc = loc }
410
 | _    -> assert false
411

    
412
let call_of_expr expr =
413
 match expr.expr_desc with
414
 | Expr_appl (f, args, r) -> (f, expr_list_of_expr args, r)
415
 | _                      -> assert false
416

    
417
(* Conversion from dimension expr to standard expr, for the purpose of printing, typing, etc... *)
418
let rec expr_of_dimension dim =
419
 match dim.dim_desc with
420
 | Dbool b        ->
421
     mkexpr dim.dim_loc (Expr_const (const_of_bool b))
422
 | Dint i         ->
423
     mkexpr dim.dim_loc (Expr_const (Const_int i))
424
 | Dident id      ->
425
     mkexpr dim.dim_loc (Expr_ident id)
426
 | Dite (c, t, e) ->
427
     mkexpr dim.dim_loc (Expr_ite (expr_of_dimension c, expr_of_dimension t, expr_of_dimension e))
428
 | Dappl (id, args) ->
429
     mkexpr dim.dim_loc (Expr_appl (id, expr_of_expr_list dim.dim_loc (List.map expr_of_dimension args), None))
430
 | Dlink dim'       -> expr_of_dimension dim'
431
 | Dvar
432
 | Dunivar          -> (Format.eprintf "internal error: expr_of_dimension %a@." Dimension.pp_dimension dim;
433
			assert false)
434

    
435
let dimension_of_const loc const =
436
 match const with
437
 | Const_int i                                    -> mkdim_int loc i
438
 | Const_tag t when t = tag_true || t = tag_false -> mkdim_bool loc (t = tag_true)
439
 | _                                              -> raise InvalidDimension
440

    
441
(* Conversion from standard expr to dimension expr, for the purpose of injecting static call arguments 
442
   into dimension expressions *)
443
let rec dimension_of_expr expr =
444
  match expr.expr_desc with
445
  | Expr_const c  -> dimension_of_const expr.expr_loc c
446
  | Expr_ident id -> mkdim_ident expr.expr_loc id
447
  | Expr_appl (f, args, None) when Basic_library.is_internal_fun f ->
448
      let k = Types.get_static_value (Env.lookup_value Basic_library.type_env f) in
449
      if k = None then raise InvalidDimension;
450
      mkdim_appl expr.expr_loc f (List.map dimension_of_expr (expr_list_of_expr args))
451
  | Expr_ite (i, t, e)        ->
452
      mkdim_ite expr.expr_loc (dimension_of_expr i) (dimension_of_expr t) (dimension_of_expr e)
453
  | _ -> raise InvalidDimension (* not a simple dimension expression *)
454

    
455

    
456
let sort_handlers hl =
457
 List.sort (fun (t, _) (t', _) -> compare t t') hl
458

    
459
let rec is_eq_expr e1 e2 = match e1.expr_desc, e2.expr_desc with
460
  | Expr_const c1, Expr_const c2 -> c1 = c2
461
  | Expr_ident i1, Expr_ident i2 -> i1 = i2
462
  | Expr_array el1, Expr_array el2 
463
  | Expr_tuple el1, Expr_tuple el2 -> 
464
    List.length el1 = List.length el2 && List.for_all2 is_eq_expr el1 el2 
465
  | Expr_arrow (e1, e2), Expr_arrow (e1', e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2'
466
  | Expr_fby (e1,e2), Expr_fby (e1',e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2'
467
  | 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
468
  (* | Expr_concat (e1,e2), Expr_concat (e1',e2') -> is_eq_expr e1 e1' && is_eq_expr e2 e2' *)
469
  (* | Expr_tail e, Expr_tail e' -> is_eq_expr e e' *)
470
  | Expr_pre e, Expr_pre e' -> is_eq_expr e e'
471
  | Expr_when (e, i, l), Expr_when (e', i', l') -> l=l' && i=i' && is_eq_expr e e'
472
  | 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')
473
  | Expr_appl (i, e, r), Expr_appl (i', e', r') -> i=i' && r=r' && is_eq_expr e e'
474
  | Expr_power (e1, i1), Expr_power (e2, i2)
475
  | Expr_access (e1, i1), Expr_access (e2, i2) -> is_eq_expr e1 e2 && is_eq_expr (expr_of_dimension i1) (expr_of_dimension i2)
476
  | _ -> false
477

    
478
let get_node_vars nd =
479
  nd.node_inputs @ nd.node_locals @ nd.node_outputs
480

    
481
let get_var id var_list =
482
    List.find (fun v -> v.var_id = id) var_list
483

    
484
let get_node_var id node =
485
  get_var id (get_node_vars node)
486

    
487
let get_node_eqs =
488
  let get_eqs stmts =
489
    List.fold_right
490
      (fun stmt res ->
491
	match stmt with
492
	| Eq eq -> eq :: res
493
	| Aut _ -> assert false)
494
      stmts
495
      [] in
496
  let table_eqs = Hashtbl.create 23 in
497
  (fun nd ->
498
    try
499
      let (old, res) = Hashtbl.find table_eqs nd.node_id
500
      in if old == nd.node_stmts then res else raise Not_found
501
    with Not_found -> 
502
      let res = get_eqs nd.node_stmts in
503
      begin
504
	Hashtbl.replace table_eqs nd.node_id (nd.node_stmts, res);
505
	res
506
      end)
507

    
508
let get_node_eq id node =
509
 List.find (fun eq -> List.mem id eq.eq_lhs) (get_node_eqs node)
510

    
511
let get_nodes prog = 
512
  List.fold_left (
513
    fun nodes decl ->
514
      match decl.top_decl_desc with
515
	| Node _ -> decl::nodes
516
	| Const _ | ImportedNode _ | Open _ | TypeDef _ -> nodes  
517
  ) [] prog
518

    
519
let get_imported_nodes prog = 
520
  List.fold_left (
521
    fun nodes decl ->
522
      match decl.top_decl_desc with
523
	| ImportedNode _ -> decl::nodes
524
	| Const _ | Node _ | Open _ | TypeDef _-> nodes  
525
  ) [] prog
526

    
527
let get_consts prog = 
528
  List.fold_right (
529
    fun decl consts ->
530
      match decl.top_decl_desc with
531
	| Const _ -> decl::consts
532
	| Node _ | ImportedNode _ | Open _ | TypeDef _ -> consts  
533
  ) prog []
534

    
535
let get_typedefs prog = 
536
  List.fold_right (
537
    fun decl types ->
538
      match decl.top_decl_desc with
539
	| TypeDef _ -> decl::types
540
	| Node _ | ImportedNode _ | Open _ | Const _ -> types  
541
  ) prog []
542

    
543
let get_dependencies prog =
544
  List.fold_right (
545
    fun decl deps ->
546
      match decl.top_decl_desc with
547
	| Open _ -> decl::deps
548
	| Node _ | ImportedNode _ | TypeDef _ | Const _ -> deps  
549
  ) prog []
550

    
551
let get_node_interface nd =
552
 {nodei_id = nd.node_id;
553
  nodei_type = nd.node_type;
554
  nodei_clock = nd.node_clock;
555
  nodei_inputs = nd.node_inputs;
556
  nodei_outputs = nd.node_outputs;
557
  nodei_stateless = nd.node_dec_stateless;
558
  nodei_spec = nd.node_spec;
559
  nodei_prototype = None;
560
  nodei_in_lib = None;
561
 }
562

    
563
(************************************************************************)
564
(*        Renaming                                                      *)
565

    
566
(* applies the renaming function [fvar] to all variables of expression [expr] *)
567
 let rec expr_replace_var fvar expr =
568
  { expr with expr_desc = expr_desc_replace_var fvar expr.expr_desc }
569

    
570
 and expr_desc_replace_var fvar expr_desc =
571
   match expr_desc with
572
   | Expr_const _ -> expr_desc
573
   | Expr_ident i -> Expr_ident (fvar i)
574
   | Expr_array el -> Expr_array (List.map (expr_replace_var fvar) el)
575
   | Expr_access (e1, d) -> Expr_access (expr_replace_var fvar e1, d)
576
   | Expr_power (e1, d) -> Expr_power (expr_replace_var fvar e1, d)
577
   | Expr_tuple el -> Expr_tuple (List.map (expr_replace_var fvar) el)
578
   | Expr_ite (c, t, e) -> Expr_ite (expr_replace_var fvar c, expr_replace_var fvar t, expr_replace_var fvar e)
579
   | Expr_arrow (e1, e2)-> Expr_arrow (expr_replace_var fvar e1, expr_replace_var fvar e2) 
580
   | Expr_fby (e1, e2) -> Expr_fby (expr_replace_var fvar e1, expr_replace_var fvar e2)
581
   | Expr_pre e' -> Expr_pre (expr_replace_var fvar e')
582
   | Expr_when (e', i, l)-> Expr_when (expr_replace_var fvar e', fvar i, l)
583
   | Expr_merge (i, hl) -> Expr_merge (fvar i, List.map (fun (t, h) -> (t, expr_replace_var fvar h)) hl)
584
   | Expr_appl (i, e', i') -> Expr_appl (i, expr_replace_var fvar e', Utils.option_map (expr_replace_var fvar) i')
585

    
586
(* Applies the renaming function [fvar] to every rhs
587
   only when the corresponding lhs satisfies predicate [pvar] *)
588
 let eq_replace_rhs_var pvar fvar eq =
589
   let pvar l = List.exists pvar l in
590
   let rec replace lhs rhs =
591
     { rhs with expr_desc = replace_desc lhs rhs.expr_desc }
592
   and replace_desc lhs rhs_desc =
593
     match lhs with
594
     | []  -> assert false
595
     | [_] -> if pvar lhs then expr_desc_replace_var fvar rhs_desc else rhs_desc
596
     | _   ->
597
       (match rhs_desc with
598
       | Expr_tuple tl ->
599
	 Expr_tuple (List.map2 (fun v e -> replace [v] e) lhs tl)
600
       | Expr_appl (f, arg, None) when Basic_library.is_internal_fun f ->
601
	 let args = expr_list_of_expr arg in
602
	 Expr_appl (f, expr_of_expr_list arg.expr_loc (List.map (replace lhs) args), None)
603
       | Expr_array _
604
       | Expr_access _
605
       | Expr_power _
606
       | Expr_const _
607
       | Expr_ident _
608
       | Expr_appl _   ->
609
	 if pvar lhs
610
	 then expr_desc_replace_var fvar rhs_desc
611
	 else rhs_desc
612
       | Expr_ite (c, t, e)   -> Expr_ite (replace lhs c, replace lhs t, replace lhs e)
613
       | Expr_arrow (e1, e2)  -> Expr_arrow (replace lhs e1, replace lhs e2) 
614
       | Expr_fby (e1, e2)    -> Expr_fby (replace lhs e1, replace lhs e2)
615
       | Expr_pre e'          -> Expr_pre (replace lhs e')
616
       | Expr_when (e', i, l) -> let i' = if pvar lhs then fvar i else i
617
				 in Expr_when (replace lhs e', i', l)
618
       | Expr_merge (i, hl)   -> let i' = if pvar lhs then fvar i else i
619
				 in Expr_merge (i', List.map (fun (t, h) -> (t, replace lhs h)) hl)
620
       )
621
   in { eq with eq_rhs = replace eq.eq_lhs eq.eq_rhs }
622

    
623

    
624
 let rec rename_expr  f_node f_var f_const expr =
625
   { expr with expr_desc = rename_expr_desc f_node f_var f_const expr.expr_desc }
626
 and rename_expr_desc f_node f_var f_const expr_desc =
627
   let re = rename_expr  f_node f_var f_const in
628
   match expr_desc with
629
   | Expr_const _ -> expr_desc
630
   | Expr_ident i -> Expr_ident (f_var i)
631
   | Expr_array el -> Expr_array (List.map re el)
632
   | Expr_access (e1, d) -> Expr_access (re e1, d)
633
   | Expr_power (e1, d) -> Expr_power (re e1, d)
634
   | Expr_tuple el -> Expr_tuple (List.map re el)
635
   | Expr_ite (c, t, e) -> Expr_ite (re c, re t, re e)
636
   | Expr_arrow (e1, e2)-> Expr_arrow (re e1, re e2) 
637
   | Expr_fby (e1, e2) -> Expr_fby (re e1, re e2)
638
   | Expr_pre e' -> Expr_pre (re e')
639
   | Expr_when (e', i, l)-> Expr_when (re e', f_var i, l)
640
   | Expr_merge (i, hl) -> 
641
     Expr_merge (f_var i, List.map (fun (t, h) -> (t, re h)) hl)
642
   | Expr_appl (i, e', i') -> 
643
     Expr_appl (f_node i, re e', Utils.option_map re i')
644
  
645
 let rename_node_annot f_node f_var f_const expr  =
646
   expr
647
 (* TODO assert false *)
648

    
649
 let rename_expr_annot f_node f_var f_const annot =
650
   annot
651
 (* TODO assert false *)
652

    
653
let rename_node f_node f_var f_const nd =
654
  let rename_var v = { v with var_id = f_var v.var_id } in
655
  let rename_eq eq = { eq with
656
      eq_lhs = List.map f_var eq.eq_lhs; 
657
      eq_rhs = rename_expr f_node f_var f_const eq.eq_rhs
658
    } 
659
  in
660
  let inputs = List.map rename_var nd.node_inputs in
661
  let outputs = List.map rename_var nd.node_outputs in
662
  let locals = List.map rename_var nd.node_locals in
663
  let gen_calls = List.map (rename_expr f_node f_var f_const) nd.node_gencalls in
664
  let node_checks = List.map (Dimension.expr_replace_var f_var)  nd.node_checks in
665
  let node_asserts = List.map 
666
    (fun a -> 
667
      {a with assert_expr = 
668
	  let expr = a.assert_expr in
669
	  rename_expr f_node f_var f_const expr})
670
    nd.node_asserts
671
  in
672
  let node_stmts = List.map (fun eq -> Eq (rename_eq eq)) (get_node_eqs nd) in
673
  let spec = 
674
    Utils.option_map 
675
      (fun s -> rename_node_annot f_node f_var f_const s) 
676
      nd.node_spec 
677
  in
678
  let annot =
679
    List.map 
680
      (fun s -> rename_expr_annot f_node f_var f_const s) 
681
      nd.node_annot
682
  in
683
  {
684
    node_id = f_node nd.node_id;
685
    node_type = nd.node_type;
686
    node_clock = nd.node_clock;
687
    node_inputs = inputs;
688
    node_outputs = outputs;
689
    node_locals = locals;
690
    node_gencalls = gen_calls;
691
    node_checks = node_checks;
692
    node_asserts = node_asserts;
693
    node_stmts = node_stmts;
694
    node_dec_stateless = nd.node_dec_stateless;
695
    node_stateless = nd.node_stateless;
696
    node_spec = spec;
697
    node_annot = annot;
698
  }
699

    
700

    
701
let rename_const f_const c =
702
  { c with const_id = f_const c.const_id }
703

    
704
let rename_typedef f_var t =
705
  match t.tydef_desc with
706
  | Tydec_enum tags -> { t with tydef_desc = Tydec_enum (List.map f_var tags) }
707
  | _               -> t
708

    
709
let rename_prog f_node f_var f_const prog =
710
  List.rev (
711
    List.fold_left (fun accu top ->
712
      (match top.top_decl_desc with
713
      | Node nd -> 
714
	 { top with top_decl_desc = Node (rename_node f_node f_var f_const nd) }
715
      | Const c -> 
716
	 { top with top_decl_desc = Const (rename_const f_const c) }
717
      | TypeDef tdef ->
718
	 { top with top_decl_desc = TypeDef (rename_typedef f_var tdef) }
719
      | ImportedNode _
720
      | Open _       -> top)
721
      ::accu
722
) [] prog
723
		   )
724

    
725
(**********************************************************************)
726
(* Pretty printers *)
727

    
728
let pp_decl_type fmt tdecl =
729
  match tdecl.top_decl_desc with
730
  | Node nd ->
731
    fprintf fmt "%s: " nd.node_id;
732
    Utils.reset_names ();
733
    fprintf fmt "%a@ " Types.print_ty nd.node_type
734
  | ImportedNode ind ->
735
    fprintf fmt "%s: " ind.nodei_id;
736
    Utils.reset_names ();
737
    fprintf fmt "%a@ " Types.print_ty ind.nodei_type
738
  | Const _ | Open _ | TypeDef _ -> ()
739

    
740
let pp_prog_type fmt tdecl_list =
741
  Utils.fprintf_list ~sep:"" pp_decl_type fmt tdecl_list
742

    
743
let pp_decl_clock fmt cdecl =
744
  match cdecl.top_decl_desc with
745
  | Node nd ->
746
    fprintf fmt "%s: " nd.node_id;
747
    Utils.reset_names ();
748
    fprintf fmt "%a@ " Clocks.print_ck nd.node_clock
749
  | ImportedNode ind ->
750
    fprintf fmt "%s: " ind.nodei_id;
751
    Utils.reset_names ();
752
    fprintf fmt "%a@ " Clocks.print_ck ind.nodei_clock
753
  | Const _ | Open _ | TypeDef _ -> ()
754

    
755
let pp_prog_clock fmt prog =
756
  Utils.fprintf_list ~sep:"" pp_decl_clock fmt prog
757

    
758
let pp_error fmt = function
759
    Main_not_found ->
760
      fprintf fmt "Cannot compile node %s: could not find the node definition.@."
761
	!Options.main_node
762
  | Main_wrong_kind ->
763
    fprintf fmt
764
      "Name %s does not correspond to a (non-imported) node definition.@." 
765
      !Options.main_node
766
  | No_main_specified ->
767
    fprintf fmt "No main node specified@."
768
  | Unbound_symbol sym ->
769
    fprintf fmt
770
      "%s is undefined.@."
771
      sym
772
  | Already_bound_symbol sym -> 
773
    fprintf fmt
774
      "%s is already defined.@."
775
      sym
776
  | Unknown_library sym ->
777
    fprintf fmt
778
      "impossible to load library %s.lusic@.Please compile the corresponding interface or source file.@."
779
      sym
780

    
781
(* filling node table with internal functions *)
782
let vdecls_of_typ_ck cpt ty =
783
  let loc = Location.dummy_loc in
784
  List.map
785
    (fun _ -> incr cpt;
786
              let name = sprintf "_var_%d" !cpt in
787
              mkvar_decl loc (name, mktyp loc Tydec_any, mkclock loc Ckdec_any, false))
788
    (Types.type_list_of_type ty)
789

    
790
let mk_internal_node id =
791
  let spec = None in
792
  let ty = Env.lookup_value Basic_library.type_env id in
793
  let ck = Env.lookup_value Basic_library.clock_env id in
794
  let (tin, tout) = Types.split_arrow ty in
795
  (*eprintf "internal fun %s: %d -> %d@." id (List.length (Types.type_list_of_type tin)) (List.length (Types.type_list_of_type tout));*)
796
  let cpt = ref (-1) in
797
  mktop
798
    (ImportedNode
799
       {nodei_id = id;
800
	nodei_type = ty;
801
	nodei_clock = ck;
802
	nodei_inputs = vdecls_of_typ_ck cpt tin;
803
	nodei_outputs = vdecls_of_typ_ck cpt tout;
804
	nodei_stateless = Types.get_static_value ty <> None;
805
	nodei_spec = spec;
806
	nodei_prototype = None;
807
       	nodei_in_lib = None;
808
       })
809

    
810
let add_internal_funs () =
811
  List.iter
812
    (fun id -> let nd = mk_internal_node id in Hashtbl.add node_table id nd)
813
    Basic_library.internal_funs
814

    
815

    
816

    
817
(* Replace any occurence of a var in vars_to_replace by its associated
818
   expression in defs until e does not contain any such variables *)
819
let rec substitute_expr vars_to_replace defs e =
820
  let se = substitute_expr vars_to_replace defs in
821
  { e with expr_desc = 
822
      let ed = e.expr_desc in
823
      match ed with
824
      | Expr_const _ -> ed
825
      | Expr_array el -> Expr_array (List.map se el)
826
      | Expr_access (e1, d) -> Expr_access (se e1, d)
827
      | Expr_power (e1, d) -> Expr_power (se e1, d)
828
      | Expr_tuple el -> Expr_tuple (List.map se el)
829
      | Expr_ite (c, t, e) -> Expr_ite (se c, se t, se e)
830
      | Expr_arrow (e1, e2)-> Expr_arrow (se e1, se e2) 
831
      | Expr_fby (e1, e2) -> Expr_fby (se e1, se e2)
832
      | Expr_pre e' -> Expr_pre (se e')
833
      | Expr_when (e', i, l)-> Expr_when (se e', i, l)
834
      | Expr_merge (i, hl) -> Expr_merge (i, List.map (fun (t, h) -> (t, se h)) hl)
835
      | Expr_appl (i, e', i') -> Expr_appl (i, se e', i')
836
      | Expr_ident i -> 
837
	if List.exists (fun v -> v.var_id = i) vars_to_replace then (
838
	  let eq_i eq = eq.eq_lhs = [i] in
839
	  if List.exists eq_i defs then
840
	    let sub = List.find eq_i defs in
841
	    let sub' = se sub.eq_rhs in
842
	    sub'.expr_desc
843
	  else 
844
	    assert false
845
	)
846
	else
847
	  ed
848

    
849
  }
850
(* FAUT IL RETIRER ?
851
  
852
 let rec expr_to_eexpr  expr =
853
   { eexpr_tag = expr.expr_tag;
854
     eexpr_desc = expr_desc_to_eexpr_desc expr.expr_desc;
855
     eexpr_type = expr.expr_type;
856
     eexpr_clock = expr.expr_clock;
857
     eexpr_loc = expr.expr_loc
858
   }
859
 and expr_desc_to_eexpr_desc expr_desc =
860
   let conv = expr_to_eexpr in
861
   match expr_desc with
862
   | Expr_const c -> EExpr_const (match c with
863
     | Const_int x -> EConst_int x 
864
     | Const_real x -> EConst_real x 
865
     | Const_float x -> EConst_float x 
866
     | Const_tag x -> EConst_tag x 
867
     | _ -> assert false
868

    
869
   )
870
   | Expr_ident i -> EExpr_ident i
871
   | Expr_tuple el -> EExpr_tuple (List.map conv el)
872

    
873
   | Expr_arrow (e1, e2)-> EExpr_arrow (conv e1, conv e2) 
874
   | Expr_fby (e1, e2) -> EExpr_fby (conv e1, conv e2)
875
   | Expr_pre e' -> EExpr_pre (conv e')
876
   | Expr_appl (i, e', i') -> 
877
     EExpr_appl 
878
       (i, conv e', match i' with None -> None | Some(id, _) -> Some id)
879

    
880
   | Expr_when _
881
   | Expr_merge _ -> assert false
882
   | Expr_array _ 
883
   | Expr_access _ 
884
   | Expr_power _  -> assert false
885
   | Expr_ite (c, t, e) -> assert false 
886
   | _ -> assert false
887

    
888
     *)
889
let rec get_expr_calls nodes e =
890
  get_calls_expr_desc nodes e.expr_desc
891
and get_calls_expr_desc nodes expr_desc =
892
  let get_calls = get_expr_calls nodes in
893
  match expr_desc with
894
  | Expr_const _ 
895
   | Expr_ident _ -> Utils.ISet.empty
896
   | Expr_tuple el
897
   | Expr_array el -> List.fold_left (fun accu e -> Utils.ISet.union accu (get_calls e)) Utils.ISet.empty el
898
   | Expr_pre e1 
899
   | Expr_when (e1, _, _) 
900
   | Expr_access (e1, _) 
901
   | Expr_power (e1, _) -> get_calls e1
902
   | Expr_ite (c, t, e) -> Utils.ISet.union (Utils.ISet.union (get_calls c) (get_calls t)) (get_calls e) 
903
   | Expr_arrow (e1, e2) 
904
   | Expr_fby (e1, e2) -> Utils.ISet.union (get_calls e1) (get_calls e2)
905
   | Expr_merge (_, hl) -> List.fold_left (fun accu (_, h) -> Utils.ISet.union accu (get_calls h)) Utils.ISet.empty  hl
906
   | Expr_appl (i, e', i') -> 
907
     if Basic_library.is_internal_fun i then 
908
       (get_calls e') 
909
     else
910
       let calls =  Utils.ISet.add i (get_calls e') in
911
       let test = (fun n -> match n.top_decl_desc with Node nd -> nd.node_id = i | _ -> false) in
912
       if List.exists test nodes then
913
	 match (List.find test nodes).top_decl_desc with
914
	 | Node nd -> Utils.ISet.union (get_node_calls nodes nd) calls
915
	 | _ -> assert false
916
       else 
917
	 calls
918

    
919
and get_eq_calls nodes eq =
920
  get_expr_calls nodes eq.eq_rhs
921
and get_node_calls nodes node =
922
  List.fold_left (fun accu eq -> Utils.ISet.union (get_eq_calls nodes eq) accu) Utils.ISet.empty (get_node_eqs node)
923

    
924
let rec get_expr_vars vars e =
925
  get_expr_desc_vars vars e.expr_desc
926
and get_expr_desc_vars vars expr_desc =
927
  match expr_desc with
928
  | Expr_const _ -> vars
929
  | Expr_ident x -> Utils.ISet.add x vars
930
  | Expr_tuple el
931
  | Expr_array el -> List.fold_left get_expr_vars vars el
932
  | Expr_pre e1 -> get_expr_vars vars e1
933
  | Expr_when (e1, c, _) -> get_expr_vars (Utils.ISet.add c vars) e1 
934
  | Expr_access (e1, d) 
935
  | Expr_power (e1, d)   -> List.fold_left get_expr_vars vars [e1; expr_of_dimension d]
936
  | Expr_ite (c, t, e) -> List.fold_left get_expr_vars vars [c; t; e]
937
  | Expr_arrow (e1, e2) 
938
  | Expr_fby (e1, e2) -> List.fold_left get_expr_vars vars [e1; e2]
939
  | Expr_merge (c, hl) -> List.fold_left (fun vars (_, h) -> get_expr_vars vars h) (Utils.ISet.add c vars) hl
940
  | Expr_appl (_, arg, None)   -> get_expr_vars vars arg
941
  | Expr_appl (_, arg, Some r) -> List.fold_left get_expr_vars vars [arg; r]
942

    
943

    
944
let rec expr_has_arrows e =
945
  expr_desc_has_arrows e.expr_desc
946
and expr_desc_has_arrows expr_desc =
947
  match expr_desc with
948
  | Expr_const _ 
949
  | Expr_ident _ -> false
950
  | Expr_tuple el
951
  | Expr_array el -> List.exists expr_has_arrows el
952
  | Expr_pre e1 
953
  | Expr_when (e1, _, _) 
954
  | Expr_access (e1, _) 
955
  | Expr_power (e1, _) -> expr_has_arrows e1
956
  | Expr_ite (c, t, e) -> List.exists expr_has_arrows [c; t; e]
957
  | Expr_arrow (e1, e2) 
958
  | Expr_fby (e1, e2) -> true
959
  | Expr_merge (_, hl) -> List.exists (fun (_, h) -> expr_has_arrows h) hl
960
  | Expr_appl (i, e', i') -> expr_has_arrows e'
961

    
962
and eq_has_arrows eq =
963
  expr_has_arrows eq.eq_rhs
964
and node_has_arrows node =
965
  List.exists (fun eq -> eq_has_arrows eq) (get_node_eqs node)
966

    
967
(* Local Variables: *)
968
(* compile-command:"make -C .." *)
969
(* End: *)