lustrec / src / corelang.ml @ e49b6d55
History | View | Annotate | Download (35.1 KB)
1 | a2d97a3e | ploc | (********************************************************************) |
---|---|---|---|
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 | 22fe1c93 | ploc | open Format |
13 | open LustreSpec |
||
14 | open Dimension |
||
15 | |||
16 | |||
17 | 52cfee34 | xthirioux | exception Error of Location.t * error |
18 | 22fe1c93 | ploc | |
19 | module VDeclModule = |
||
20 | struct (* Node module *) |
||
21 | type t = var_decl |
||
22 | bb2ca5f4 | xthirioux | let compare v1 v2 = compare v1.var_id v2.var_id |
23 | 22fe1c93 | ploc | end |
24 | |||
25 | module VMap = Map.Make(VDeclModule) |
||
26 | |||
27 | module VSet = Set.Make(VDeclModule) |
||
28 | |||
29 | 01c7d5e1 | ploc | 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 | 22fe1c93 | ploc | (************************************************************) |
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 | ec433d69 | xthirioux | let mkvar_decl loc ?(orig=false) (id, ty_dec, ck_dec, is_const, value) = |
45 | assert (value = None || is_const); |
||
46 | 22fe1c93 | ploc | { var_id = id; |
47 | 54d032f5 | xthirioux | var_orig = orig; |
48 | 22fe1c93 | ploc | var_dec_type = ty_dec; |
49 | var_dec_clock = ck_dec; |
||
50 | var_dec_const = is_const; |
||
51 | ec433d69 | xthirioux | var_dec_value = value; |
52 | 22fe1c93 | ploc | 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 | 54d032f5 | xthirioux | var_orig = true; |
68 | 22fe1c93 | ploc | 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 | ec433d69 | xthirioux | var_dec_value = None; |
72 | 22fe1c93 | ploc | var_type = c.const_type; |
73 | var_clock = Clocks.new_var false; |
||
74 | var_loc = c.const_loc } |
||
75 | |||
76 | b08ffca7 | xthirioux | let mk_new_name used id = |
77 | 22fe1c93 | ploc | let rec new_name name cpt = |
78 | b08ffca7 | xthirioux | if used name |
79 | 22fe1c93 | ploc | 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 | ef34b4ae | xthirioux | 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 | 22fe1c93 | ploc | |
96 | let mkpredef_call loc funname args = |
||
97 | mkexpr loc (Expr_appl (funname, mkexpr loc (Expr_tuple args), None)) |
||
98 | |||
99 | ec433d69 | xthirioux | let is_clock_dec_type cty = |
100 | match cty with |
||
101 | | Tydec_clock _ -> true |
||
102 | | _ -> false |
||
103 | ef34b4ae | xthirioux | |
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 | 01c7d5e1 | ploc | (************************************************************) |
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 | 566dbf49 | ploc | 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 | 01c7d5e1 | ploc | { e with expr_annot = merge_expr_annot e.expr_annot (Some annot) } |
182 | |||
183 | |||
184 | 22fe1c93 | ploc | (***********************************************************) |
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 | ef34b4ae | xthirioux | 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 | 22fe1c93 | ploc | 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 | 52cfee34 | xthirioux | |
242 | 22fe1c93 | ploc | (* alias and type definition table *) |
243 | ef34b4ae | xthirioux | |
244 | fc476249 | Teme | let mktop = mktop_decl Location.dummy_loc !Options.include_dir false |
245 | 1e48ef45 | ploc | |
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 | 04a63d25 | xthirioux | (* let top_float_type = mktop (TypeDef {tydef_id = "float"; tydef_desc = Tydec_float}) *) |
249 | 1e48ef45 | ploc | let top_real_type = mktop (TypeDef {tydef_id = "real"; tydef_desc = Tydec_real}) |
250 | ef34b4ae | xthirioux | |
251 | 22fe1c93 | ploc | let type_table = |
252 | Utils.create_hashtable 20 [ |
||
253 | ef34b4ae | xthirioux | Tydec_int , top_int_type; |
254 | Tydec_bool , top_bool_type; |
||
255 | 04a63d25 | xthirioux | (* Tydec_float, top_float_type; *) |
256 | ef34b4ae | xthirioux | Tydec_real , top_real_type |
257 | 22fe1c93 | ploc | ] |
258 | |||
259 | ef34b4ae | xthirioux | 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 | 22fe1c93 | ploc | let rec is_user_type typ = |
271 | match typ with |
||
272 | | Tydec_int | Tydec_bool | Tydec_real |
||
273 | 04a63d25 | xthirioux | (* | Tydec_float *) | Tydec_any | Tydec_const _ -> false |
274 | 22fe1c93 | ploc | | Tydec_clock typ' -> is_user_type typ' |
275 | | _ -> true |
||
276 | |||
277 | let get_repr_type typ = |
||
278 | ef34b4ae | xthirioux | let typ_def = (typedef_of_top (Hashtbl.find type_table typ)).tydef_desc in |
279 | 22fe1c93 | ploc | if is_user_type typ_def then typ else typ_def |
280 | |||
281 | b1655a21 | xthirioux | let rec coretype_equal ty1 ty2 = |
282 | ef34b4ae | xthirioux | let res = |
283 | b1655a21 | xthirioux | match ty1, ty2 with |
284 | ed81df06 | xthirioux | | Tydec_any , _ |
285 | | _ , Tydec_any -> assert false |
||
286 | | Tydec_const _ , Tydec_const _ -> get_repr_type ty1 = get_repr_type ty2 |
||
287 | ef34b4ae | xthirioux | | Tydec_const _ , _ -> let ty1' = (typedef_of_top (Hashtbl.find type_table ty1)).tydef_desc |
288 | ed81df06 | xthirioux | 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 | 04a63d25 | xthirioux | (* | Tydec_float , Tydec_float *) |
293 | ed81df06 | xthirioux | | 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 | b1655a21 | xthirioux | 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 | ef34b4ae | xthirioux | 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 | b1655a21 | xthirioux | |
305 | 22fe1c93 | ploc | let tag_true = "true" |
306 | let tag_false = "false" |
||
307 | 77a61575 | xthirioux | let tag_default = "default" |
308 | 22fe1c93 | ploc | |
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 | ef34b4ae | xthirioux | tag_true, top_bool_type; |
352 | tag_false, top_bool_type |
||
353 | 22fe1c93 | ploc | ] |
354 | |||
355 | fa090c4e | xthirioux | (* To guarantee uniqueness of fields in struct types *) |
356 | let field_table = |
||
357 | Utils.create_hashtable 20 [ |
||
358 | ] |
||
359 | |||
360 | 22fe1c93 | ploc | let get_enum_type_tags cty = |
361 | ef34b4ae | xthirioux | (*Format.eprintf "get_enum_type_tags %a@." Printers.pp_var_type_dec_desc cty;*) |
362 | 22fe1c93 | ploc | match cty with |
363 | | Tydec_bool -> [tag_true; tag_false] |
||
364 | ef34b4ae | xthirioux | | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with |
365 | 22fe1c93 | ploc | | Tydec_enum tl -> tl |
366 | | _ -> assert false) |
||
367 | | _ -> assert false |
||
368 | 6a6abd76 | xthirioux | |
369 | fa090c4e | xthirioux | let get_struct_type_fields cty = |
370 | match cty with |
||
371 | ef34b4ae | xthirioux | | Tydec_const _ -> (match (typedef_of_top (Hashtbl.find type_table cty)).tydef_desc with |
372 | fa090c4e | xthirioux | | Tydec_struct fl -> fl |
373 | | _ -> assert false) |
||
374 | | _ -> assert false |
||
375 | 6a6abd76 | xthirioux | |
376 | 22fe1c93 | ploc | 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 | add75bcb | xthirioux | let ident_of_expr expr = |
382 | match expr.expr_desc with |
||
383 | | Expr_ident id -> id |
||
384 | | _ -> assert false |
||
385 | |||
386 | fc886259 | xthirioux | (* 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 | 22fe1c93 | ploc | (* 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 | b616fe7a | xthirioux | let is_tuple_expr expr = |
407 | match expr.expr_desc with |
||
408 | | Expr_tuple _ -> true |
||
409 | | _ -> false |
||
410 | |||
411 | 22fe1c93 | ploc | let expr_list_of_expr expr = |
412 | match expr.expr_desc with |
||
413 | bb2ca5f4 | xthirioux | | Expr_tuple elist -> elist |
414 | | _ -> [expr] |
||
415 | 22fe1c93 | ploc | |
416 | let expr_of_expr_list loc elist = |
||
417 | match elist with |
||
418 | | [t] -> { t with expr_loc = loc } |
||
419 | 70df2f87 | xthirioux | | 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 | 22fe1c93 | ploc | | _ -> 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 | fc886259 | xthirioux | | Dunivar -> (Format.eprintf "internal error: Corelang.expr_of_dimension %a@." Dimension.pp_dimension dim; |
450 | 22fe1c93 | ploc | 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 | 04a63d25 | xthirioux | | Expr_appl (f, args, None) when Basic_library.is_expr_internal_fun expr -> |
465 | 22fe1c93 | ploc | 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 | e49b6d55 | xavier.thirioux | 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 | 22fe1c93 | ploc | let rec is_eq_expr e1 e2 = match e1.expr_desc, e2.expr_desc with |
490 | e49b6d55 | xavier.thirioux | | Expr_const c1, Expr_const c2 -> is_eq_const c1 c2 |
491 | 22fe1c93 | ploc | | 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 | 01c7d5e1 | ploc | let get_node_vars nd = |
509 | 22fe1c93 | ploc | nd.node_inputs @ nd.node_locals @ nd.node_outputs |
510 | |||
511 | fc886259 | xthirioux | 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 | 01c7d5e1 | ploc | let get_var id var_list = |
517 | 04a63d25 | xthirioux | List.find (fun v -> v.var_id = id) var_list |
518 | 22fe1c93 | ploc | |
519 | df39e35a | xthirioux | let get_node_var id node = |
520 | get_var id (get_node_vars node) |
||
521 | 01c7d5e1 | ploc | |
522 | b08ffca7 | xthirioux | let get_node_eqs = |
523 | let get_eqs stmts = |
||
524 | List.fold_right |
||
525 | (fun stmt res -> |
||
526 | match stmt with |
||
527 | | Eq eq -> eq :: res |
||
528 | | Aut _ -> assert false) |
||
529 | stmts |
||
530 | [] in |
||
531 | let table_eqs = Hashtbl.create 23 in |
||
532 | (fun nd -> |
||
533 | try |
||
534 | let (old, res) = Hashtbl.find table_eqs nd.node_id |
||
535 | in if old == nd.node_stmts then res else raise Not_found |
||
536 | with Not_found -> |
||
537 | let res = get_eqs nd.node_stmts in |
||
538 | begin |
||
539 | Hashtbl.replace table_eqs nd.node_id (nd.node_stmts, res); |
||
540 | res |
||
541 | end) |
||
542 | |||
543 | 01c7d5e1 | ploc | let get_node_eq id node = |
544 | b08ffca7 | xthirioux | List.find (fun eq -> List.mem id eq.eq_lhs) (get_node_eqs node) |
545 | 22fe1c93 | ploc | |
546 | let get_nodes prog = |
||
547 | List.fold_left ( |
||
548 | fun nodes decl -> |
||
549 | match decl.top_decl_desc with |
||
550 | ef34b4ae | xthirioux | | Node _ -> decl::nodes |
551 | | Const _ | ImportedNode _ | Open _ | TypeDef _ -> nodes |
||
552 | 22fe1c93 | ploc | ) [] prog |
553 | |||
554 | ef34b4ae | xthirioux | let get_imported_nodes prog = |
555 | c1adf235 | ploc | List.fold_left ( |
556 | ef34b4ae | xthirioux | fun nodes decl -> |
557 | c1adf235 | ploc | match decl.top_decl_desc with |
558 | ef34b4ae | xthirioux | | ImportedNode _ -> decl::nodes |
559 | | Const _ | Node _ | Open _ | TypeDef _-> nodes |
||
560 | c1adf235 | ploc | ) [] prog |
561 | 22fe1c93 | ploc | |
562 | ef34b4ae | xthirioux | let get_consts prog = |
563 | List.fold_right ( |
||
564 | fun decl consts -> |
||
565 | b1655a21 | xthirioux | match decl.top_decl_desc with |
566 | ef34b4ae | xthirioux | | Const _ -> decl::consts |
567 | | Node _ | ImportedNode _ | Open _ | TypeDef _ -> consts |
||
568 | ) prog [] |
||
569 | |||
570 | let get_typedefs prog = |
||
571 | List.fold_right ( |
||
572 | fun decl types -> |
||
573 | match decl.top_decl_desc with |
||
574 | | TypeDef _ -> decl::types |
||
575 | | Node _ | ImportedNode _ | Open _ | Const _ -> types |
||
576 | ) prog [] |
||
577 | |||
578 | let get_dependencies prog = |
||
579 | List.fold_right ( |
||
580 | fun decl deps -> |
||
581 | match decl.top_decl_desc with |
||
582 | | Open _ -> decl::deps |
||
583 | | Node _ | ImportedNode _ | TypeDef _ | Const _ -> deps |
||
584 | ) prog [] |
||
585 | e2380d4d | ploc | |
586 | ed81df06 | xthirioux | let get_node_interface nd = |
587 | {nodei_id = nd.node_id; |
||
588 | nodei_type = nd.node_type; |
||
589 | nodei_clock = nd.node_clock; |
||
590 | nodei_inputs = nd.node_inputs; |
||
591 | nodei_outputs = nd.node_outputs; |
||
592 | nodei_stateless = nd.node_dec_stateless; |
||
593 | nodei_spec = nd.node_spec; |
||
594 | nodei_prototype = None; |
||
595 | 04a63d25 | xthirioux | nodei_in_lib = []; |
596 | ed81df06 | xthirioux | } |
597 | |||
598 | e2380d4d | ploc | (************************************************************************) |
599 | (* Renaming *) |
||
600 | |||
601 | ec433d69 | xthirioux | let rec rename_static rename cty = |
602 | match cty with |
||
603 | | Tydec_array (d, cty') -> Tydec_array (Dimension.expr_replace_expr rename d, rename_static rename cty') |
||
604 | | Tydec_clock cty -> Tydec_clock (rename_static rename cty) |
||
605 | | Tydec_struct fl -> Tydec_struct (List.map (fun (f, cty) -> f, rename_static rename cty) fl) |
||
606 | | _ -> cty |
||
607 | |||
608 | let rec rename_carrier rename cck = |
||
609 | match cck with |
||
610 | | Ckdec_bool cl -> Ckdec_bool (List.map (fun (c, l) -> rename c, l) cl) |
||
611 | | _ -> cck |
||
612 | |||
613 | (*Format.eprintf "Types.rename_static %a = %a@." print_ty ty print_ty res; res*) |
||
614 | |||
615 | (* applies the renaming function [fvar] to all variables of expression [expr] *) |
||
616 | let rec expr_replace_var fvar expr = |
||
617 | { expr with expr_desc = expr_desc_replace_var fvar expr.expr_desc } |
||
618 | |||
619 | and expr_desc_replace_var fvar expr_desc = |
||
620 | match expr_desc with |
||
621 | | Expr_const _ -> expr_desc |
||
622 | | Expr_ident i -> Expr_ident (fvar i) |
||
623 | | Expr_array el -> Expr_array (List.map (expr_replace_var fvar) el) |
||
624 | | Expr_access (e1, d) -> Expr_access (expr_replace_var fvar e1, d) |
||
625 | | Expr_power (e1, d) -> Expr_power (expr_replace_var fvar e1, d) |
||
626 | | Expr_tuple el -> Expr_tuple (List.map (expr_replace_var fvar) el) |
||
627 | | Expr_ite (c, t, e) -> Expr_ite (expr_replace_var fvar c, expr_replace_var fvar t, expr_replace_var fvar e) |
||
628 | | Expr_arrow (e1, e2)-> Expr_arrow (expr_replace_var fvar e1, expr_replace_var fvar e2) |
||
629 | | Expr_fby (e1, e2) -> Expr_fby (expr_replace_var fvar e1, expr_replace_var fvar e2) |
||
630 | | Expr_pre e' -> Expr_pre (expr_replace_var fvar e') |
||
631 | | Expr_when (e', i, l)-> Expr_when (expr_replace_var fvar e', fvar i, l) |
||
632 | | Expr_merge (i, hl) -> Expr_merge (fvar i, List.map (fun (t, h) -> (t, expr_replace_var fvar h)) hl) |
||
633 | | Expr_appl (i, e', i') -> Expr_appl (i, expr_replace_var fvar e', Utils.option_map (expr_replace_var fvar) i') |
||
634 | |||
635 | (* Applies the renaming function [fvar] to every rhs |
||
636 | only when the corresponding lhs satisfies predicate [pvar] *) |
||
637 | let eq_replace_rhs_var pvar fvar eq = |
||
638 | let pvar l = List.exists pvar l in |
||
639 | let rec replace lhs rhs = |
||
640 | 04a63d25 | xthirioux | { rhs with expr_desc = |
641 | ec433d69 | xthirioux | match lhs with |
642 | | [] -> assert false |
||
643 | 04a63d25 | xthirioux | | [_] -> if pvar lhs then expr_desc_replace_var fvar rhs.expr_desc else rhs.expr_desc |
644 | ec433d69 | xthirioux | | _ -> |
645 | 04a63d25 | xthirioux | (match rhs.expr_desc with |
646 | ec433d69 | xthirioux | | Expr_tuple tl -> |
647 | Expr_tuple (List.map2 (fun v e -> replace [v] e) lhs tl) |
||
648 | 04a63d25 | xthirioux | | Expr_appl (f, arg, None) when Basic_library.is_expr_internal_fun rhs -> |
649 | ec433d69 | xthirioux | let args = expr_list_of_expr arg in |
650 | Expr_appl (f, expr_of_expr_list arg.expr_loc (List.map (replace lhs) args), None) |
||
651 | | Expr_array _ |
||
652 | | Expr_access _ |
||
653 | | Expr_power _ |
||
654 | | Expr_const _ |
||
655 | | Expr_ident _ |
||
656 | | Expr_appl _ -> |
||
657 | if pvar lhs |
||
658 | 04a63d25 | xthirioux | then expr_desc_replace_var fvar rhs.expr_desc |
659 | else rhs.expr_desc |
||
660 | ec433d69 | xthirioux | | Expr_ite (c, t, e) -> Expr_ite (replace lhs c, replace lhs t, replace lhs e) |
661 | | Expr_arrow (e1, e2) -> Expr_arrow (replace lhs e1, replace lhs e2) |
||
662 | | Expr_fby (e1, e2) -> Expr_fby (replace lhs e1, replace lhs e2) |
||
663 | | Expr_pre e' -> Expr_pre (replace lhs e') |
||
664 | | Expr_when (e', i, l) -> let i' = if pvar lhs then fvar i else i |
||
665 | in Expr_when (replace lhs e', i', l) |
||
666 | | Expr_merge (i, hl) -> let i' = if pvar lhs then fvar i else i |
||
667 | in Expr_merge (i', List.map (fun (t, h) -> (t, replace lhs h)) hl) |
||
668 | ) |
||
669 | 04a63d25 | xthirioux | } |
670 | ec433d69 | xthirioux | in { eq with eq_rhs = replace eq.eq_lhs eq.eq_rhs } |
671 | |||
672 | |||
673 | let rec rename_expr f_node f_var f_const expr = |
||
674 | { expr with expr_desc = rename_expr_desc f_node f_var f_const expr.expr_desc } |
||
675 | and rename_expr_desc f_node f_var f_const expr_desc = |
||
676 | let re = rename_expr f_node f_var f_const in |
||
677 | match expr_desc with |
||
678 | | Expr_const _ -> expr_desc |
||
679 | | Expr_ident i -> Expr_ident (f_var i) |
||
680 | | Expr_array el -> Expr_array (List.map re el) |
||
681 | | Expr_access (e1, d) -> Expr_access (re e1, d) |
||
682 | | Expr_power (e1, d) -> Expr_power (re e1, d) |
||
683 | | Expr_tuple el -> Expr_tuple (List.map re el) |
||
684 | | Expr_ite (c, t, e) -> Expr_ite (re c, re t, re e) |
||
685 | | Expr_arrow (e1, e2)-> Expr_arrow (re e1, re e2) |
||
686 | | Expr_fby (e1, e2) -> Expr_fby (re e1, re e2) |
||
687 | | Expr_pre e' -> Expr_pre (re e') |
||
688 | | Expr_when (e', i, l)-> Expr_when (re e', f_var i, l) |
||
689 | | Expr_merge (i, hl) -> |
||
690 | Expr_merge (f_var i, List.map (fun (t, h) -> (t, re h)) hl) |
||
691 | | Expr_appl (i, e', i') -> |
||
692 | Expr_appl (f_node i, re e', Utils.option_map re i') |
||
693 | |||
694 | let rename_node_annot f_node f_var f_const expr = |
||
695 | expr |
||
696 | (* TODO assert false *) |
||
697 | |||
698 | let rename_expr_annot f_node f_var f_const annot = |
||
699 | annot |
||
700 | (* TODO assert false *) |
||
701 | |||
702 | let rename_node f_node f_var f_const nd = |
||
703 | let rename_var v = { v with var_id = f_var v.var_id } in |
||
704 | let rename_eq eq = { eq with |
||
705 | eq_lhs = List.map f_var eq.eq_lhs; |
||
706 | eq_rhs = rename_expr f_node f_var f_const eq.eq_rhs |
||
707 | } |
||
708 | in |
||
709 | let inputs = List.map rename_var nd.node_inputs in |
||
710 | let outputs = List.map rename_var nd.node_outputs in |
||
711 | let locals = List.map rename_var nd.node_locals in |
||
712 | let gen_calls = List.map (rename_expr f_node f_var f_const) nd.node_gencalls in |
||
713 | let node_checks = List.map (Dimension.expr_replace_var f_var) nd.node_checks in |
||
714 | let node_asserts = List.map |
||
715 | (fun a -> |
||
716 | {a with assert_expr = |
||
717 | let expr = a.assert_expr in |
||
718 | rename_expr f_node f_var f_const expr}) |
||
719 | nd.node_asserts |
||
720 | in |
||
721 | let node_stmts = List.map (fun eq -> Eq (rename_eq eq)) (get_node_eqs nd) in |
||
722 | let spec = |
||
723 | Utils.option_map |
||
724 | (fun s -> rename_node_annot f_node f_var f_const s) |
||
725 | nd.node_spec |
||
726 | in |
||
727 | let annot = |
||
728 | List.map |
||
729 | (fun s -> rename_expr_annot f_node f_var f_const s) |
||
730 | nd.node_annot |
||
731 | in |
||
732 | { |
||
733 | node_id = f_node nd.node_id; |
||
734 | node_type = nd.node_type; |
||
735 | node_clock = nd.node_clock; |
||
736 | node_inputs = inputs; |
||
737 | node_outputs = outputs; |
||
738 | node_locals = locals; |
||
739 | node_gencalls = gen_calls; |
||
740 | node_checks = node_checks; |
||
741 | node_asserts = node_asserts; |
||
742 | node_stmts = node_stmts; |
||
743 | node_dec_stateless = nd.node_dec_stateless; |
||
744 | node_stateless = nd.node_stateless; |
||
745 | node_spec = spec; |
||
746 | node_annot = annot; |
||
747 | } |
||
748 | |||
749 | |||
750 | let rename_const f_const c = |
||
751 | { c with const_id = f_const c.const_id } |
||
752 | |||
753 | let rename_typedef f_var t = |
||
754 | match t.tydef_desc with |
||
755 | | Tydec_enum tags -> { t with tydef_desc = Tydec_enum (List.map f_var tags) } |
||
756 | | _ -> t |
||
757 | |||
758 | let rename_prog f_node f_var f_const prog = |
||
759 | List.rev ( |
||
760 | List.fold_left (fun accu top -> |
||
761 | (match top.top_decl_desc with |
||
762 | | Node nd -> |
||
763 | { top with top_decl_desc = Node (rename_node f_node f_var f_const nd) } |
||
764 | | Const c -> |
||
765 | { top with top_decl_desc = Const (rename_const f_const c) } |
||
766 | | TypeDef tdef -> |
||
767 | { top with top_decl_desc = TypeDef (rename_typedef f_var tdef) } |
||
768 | | ImportedNode _ |
||
769 | | Open _ -> top) |
||
770 | ::accu |
||
771 | ) [] prog |
||
772 | ) |
||
773 | |||
774 | (**********************************************************************) |
||
775 | (* Pretty printers *) |
||
776 | |||
777 | let pp_decl_type fmt tdecl = |
||
778 | match tdecl.top_decl_desc with |
||
779 | | Node nd -> |
||
780 | fprintf fmt "%s: " nd.node_id; |
||
781 | Utils.reset_names (); |
||
782 | fprintf fmt "%a@ " Types.print_ty nd.node_type |
||
783 | | ImportedNode ind -> |
||
784 | fprintf fmt "%s: " ind.nodei_id; |
||
785 | Utils.reset_names (); |
||
786 | fprintf fmt "%a@ " Types.print_ty ind.nodei_type |
||
787 | | Const _ | Open _ | TypeDef _ -> () |
||
788 | |||
789 | let pp_prog_type fmt tdecl_list = |
||
790 | Utils.fprintf_list ~sep:"" pp_decl_type fmt tdecl_list |
||
791 | |||
792 | let pp_decl_clock fmt cdecl = |
||
793 | match cdecl.top_decl_desc with |
||
794 | | Node nd -> |
||
795 | fprintf fmt "%s: " nd.node_id; |
||
796 | Utils.reset_names (); |
||
797 | fprintf fmt "%a@ " Clocks.print_ck nd.node_clock |
||
798 | | ImportedNode ind -> |
||
799 | fprintf fmt "%s: " ind.nodei_id; |
||
800 | Utils.reset_names (); |
||
801 | fprintf fmt "%a@ " Clocks.print_ck ind.nodei_clock |
||
802 | | Const _ | Open _ | TypeDef _ -> () |
||
803 | |||
804 | let pp_prog_clock fmt prog = |
||
805 | Utils.fprintf_list ~sep:"" pp_decl_clock fmt prog |
||
806 | |||
807 | let pp_error fmt = function |
||
808 | 04a63d25 | xthirioux | Main_not_found -> |
809 | fprintf fmt "Could not find the definition of main node %s.@." |
||
810 | !Global.main_node |
||
811 | ec433d69 | xthirioux | | Main_wrong_kind -> |
812 | fprintf fmt |
||
813 | 04a63d25 | xthirioux | "Node %s does not correspond to a valid main node definition.@." |
814 | !Global.main_node |
||
815 | ec433d69 | xthirioux | | No_main_specified -> |
816 | 04a63d25 | xthirioux | fprintf fmt "No main node specified (use -node option)@." |
817 | ec433d69 | xthirioux | | Unbound_symbol sym -> |
818 | fprintf fmt |
||
819 | "%s is undefined.@." |
||
820 | sym |
||
821 | | Already_bound_symbol sym -> |
||
822 | fprintf fmt |
||
823 | "%s is already defined.@." |
||
824 | sym |
||
825 | | Unknown_library sym -> |
||
826 | fprintf fmt |
||
827 | a28d1ba7 | xthirioux | "impossible to load library %s.lusic.@.Please compile the corresponding interface or source file.@." |
828 | ec433d69 | xthirioux | sym |
829 | | Wrong_number sym -> |
||
830 | fprintf fmt |
||
831 | a28d1ba7 | xthirioux | "library %s.lusic has a different version number and may crash compiler.@.Please recompile the corresponding interface or source file.@." |
832 | ec433d69 | xthirioux | sym |
833 | |||
834 | (* filling node table with internal functions *) |
||
835 | let vdecls_of_typ_ck cpt ty = |
||
836 | let loc = Location.dummy_loc in |
||
837 | List.map |
||
838 | (fun _ -> incr cpt; |
||
839 | let name = sprintf "_var_%d" !cpt in |
||
840 | mkvar_decl loc (name, mktyp loc Tydec_any, mkclock loc Ckdec_any, false, None)) |
||
841 | (Types.type_list_of_type ty) |
||
842 | |||
843 | let mk_internal_node id = |
||
844 | let spec = None in |
||
845 | let ty = Env.lookup_value Basic_library.type_env id in |
||
846 | let ck = Env.lookup_value Basic_library.clock_env id in |
||
847 | let (tin, tout) = Types.split_arrow ty in |
||
848 | (*eprintf "internal fun %s: %d -> %d@." id (List.length (Types.type_list_of_type tin)) (List.length (Types.type_list_of_type tout));*) |
||
849 | let cpt = ref (-1) in |
||
850 | mktop |
||
851 | (ImportedNode |
||
852 | {nodei_id = id; |
||
853 | nodei_type = ty; |
||
854 | nodei_clock = ck; |
||
855 | nodei_inputs = vdecls_of_typ_ck cpt tin; |
||
856 | nodei_outputs = vdecls_of_typ_ck cpt tout; |
||
857 | nodei_stateless = Types.get_static_value ty <> None; |
||
858 | nodei_spec = spec; |
||
859 | nodei_prototype = None; |
||
860 | 04a63d25 | xthirioux | nodei_in_lib = []; |
861 | ec433d69 | xthirioux | }) |
862 | |||
863 | let add_internal_funs () = |
||
864 | List.iter |
||
865 | (fun id -> let nd = mk_internal_node id in Hashtbl.add node_table id nd) |
||
866 | Basic_library.internal_funs |
||
867 | |||
868 | |||
869 | |||
870 | (* Replace any occurence of a var in vars_to_replace by its associated |
||
871 | expression in defs until e does not contain any such variables *) |
||
872 | let rec substitute_expr vars_to_replace defs e = |
||
873 | let se = substitute_expr vars_to_replace defs in |
||
874 | { e with expr_desc = |
||
875 | let ed = e.expr_desc in |
||
876 | match ed with |
||
877 | | Expr_const _ -> ed |
||
878 | | Expr_array el -> Expr_array (List.map se el) |
||
879 | | Expr_access (e1, d) -> Expr_access (se e1, d) |
||
880 | | Expr_power (e1, d) -> Expr_power (se e1, d) |
||
881 | | Expr_tuple el -> Expr_tuple (List.map se el) |
||
882 | | Expr_ite (c, t, e) -> Expr_ite (se c, se t, se e) |
||
883 | | Expr_arrow (e1, e2)-> Expr_arrow (se e1, se e2) |
||
884 | | Expr_fby (e1, e2) -> Expr_fby (se e1, se e2) |
||
885 | | Expr_pre e' -> Expr_pre (se e') |
||
886 | | Expr_when (e', i, l)-> Expr_when (se e', i, l) |
||
887 | | Expr_merge (i, hl) -> Expr_merge (i, List.map (fun (t, h) -> (t, se h)) hl) |
||
888 | | Expr_appl (i, e', i') -> Expr_appl (i, se e', i') |
||
889 | | Expr_ident i -> |
||
890 | if List.exists (fun v -> v.var_id = i) vars_to_replace then ( |
||
891 | let eq_i eq = eq.eq_lhs = [i] in |
||
892 | if List.exists eq_i defs then |
||
893 | let sub = List.find eq_i defs in |
||
894 | let sub' = se sub.eq_rhs in |
||
895 | sub'.expr_desc |
||
896 | else |
||
897 | assert false |
||
898 | ) |
||
899 | else |
||
900 | ed |
||
901 | |||
902 | } |
||
903 | (* FAUT IL RETIRER ? |
||
904 | |||
905 | let rec expr_to_eexpr expr = |
||
906 | { eexpr_tag = expr.expr_tag; |
||
907 | eexpr_desc = expr_desc_to_eexpr_desc expr.expr_desc; |
||
908 | eexpr_type = expr.expr_type; |
||
909 | eexpr_clock = expr.expr_clock; |
||
910 | eexpr_loc = expr.expr_loc |
||
911 | } |
||
912 | and expr_desc_to_eexpr_desc expr_desc = |
||
913 | let conv = expr_to_eexpr in |
||
914 | match expr_desc with |
||
915 | | Expr_const c -> EExpr_const (match c with |
||
916 | | Const_int x -> EConst_int x |
||
917 | | Const_real x -> EConst_real x |
||
918 | | Const_float x -> EConst_float x |
||
919 | | Const_tag x -> EConst_tag x |
||
920 | | _ -> assert false |
||
921 | |||
922 | ) |
||
923 | | Expr_ident i -> EExpr_ident i |
||
924 | | Expr_tuple el -> EExpr_tuple (List.map conv el) |
||
925 | |||
926 | | Expr_arrow (e1, e2)-> EExpr_arrow (conv e1, conv e2) |
||
927 | | Expr_fby (e1, e2) -> EExpr_fby (conv e1, conv e2) |
||
928 | | Expr_pre e' -> EExpr_pre (conv e') |
||
929 | | Expr_appl (i, e', i') -> |
||
930 | EExpr_appl |
||
931 | (i, conv e', match i' with None -> None | Some(id, _) -> Some id) |
||
932 | |||
933 | | Expr_when _ |
||
934 | | Expr_merge _ -> assert false |
||
935 | | Expr_array _ |
||
936 | | Expr_access _ |
||
937 | | Expr_power _ -> assert false |
||
938 | | Expr_ite (c, t, e) -> assert false |
||
939 | | _ -> assert false |
||
940 | |||
941 | *) |
||
942 | let rec get_expr_calls nodes e = |
||
943 | let get_calls = get_expr_calls nodes in |
||
944 | 04a63d25 | xthirioux | match e.expr_desc with |
945 | ec433d69 | xthirioux | | Expr_const _ |
946 | | Expr_ident _ -> Utils.ISet.empty |
||
947 | | Expr_tuple el |
||
948 | | Expr_array el -> List.fold_left (fun accu e -> Utils.ISet.union accu (get_calls e)) Utils.ISet.empty el |
||
949 | | Expr_pre e1 |
||
950 | | Expr_when (e1, _, _) |
||
951 | | Expr_access (e1, _) |
||
952 | | Expr_power (e1, _) -> get_calls e1 |
||
953 | | Expr_ite (c, t, e) -> Utils.ISet.union (Utils.ISet.union (get_calls c) (get_calls t)) (get_calls e) |
||
954 | | Expr_arrow (e1, e2) |
||
955 | | Expr_fby (e1, e2) -> Utils.ISet.union (get_calls e1) (get_calls e2) |
||
956 | | Expr_merge (_, hl) -> List.fold_left (fun accu (_, h) -> Utils.ISet.union accu (get_calls h)) Utils.ISet.empty hl |
||
957 | | Expr_appl (i, e', i') -> |
||
958 | 04a63d25 | xthirioux | if Basic_library.is_expr_internal_fun e then |
959 | ec433d69 | xthirioux | (get_calls e') |
960 | else |
||
961 | let calls = Utils.ISet.add i (get_calls e') in |
||
962 | let test = (fun n -> match n.top_decl_desc with Node nd -> nd.node_id = i | _ -> false) in |
||
963 | if List.exists test nodes then |
||
964 | match (List.find test nodes).top_decl_desc with |
||
965 | | Node nd -> Utils.ISet.union (get_node_calls nodes nd) calls |
||
966 | | _ -> assert false |
||
967 | else |
||
968 | calls |
||
969 | |||
970 | and get_eq_calls nodes eq = |
||
971 | get_expr_calls nodes eq.eq_rhs |
||
972 | and get_node_calls nodes node = |
||
973 | List.fold_left (fun accu eq -> Utils.ISet.union (get_eq_calls nodes eq) accu) Utils.ISet.empty (get_node_eqs node) |
||
974 | |||
975 | let rec get_expr_vars vars e = |
||
976 | get_expr_desc_vars vars e.expr_desc |
||
977 | and get_expr_desc_vars vars expr_desc = |
||
978 | match expr_desc with |
||
979 | | Expr_const _ -> vars |
||
980 | | Expr_ident x -> Utils.ISet.add x vars |
||
981 | | Expr_tuple el |
||
982 | | Expr_array el -> List.fold_left get_expr_vars vars el |
||
983 | | Expr_pre e1 -> get_expr_vars vars e1 |
||
984 | | Expr_when (e1, c, _) -> get_expr_vars (Utils.ISet.add c vars) e1 |
||
985 | | Expr_access (e1, d) |
||
986 | | Expr_power (e1, d) -> List.fold_left get_expr_vars vars [e1; expr_of_dimension d] |
||
987 | | Expr_ite (c, t, e) -> List.fold_left get_expr_vars vars [c; t; e] |
||
988 | | Expr_arrow (e1, e2) |
||
989 | | Expr_fby (e1, e2) -> List.fold_left get_expr_vars vars [e1; e2] |
||
990 | | Expr_merge (c, hl) -> List.fold_left (fun vars (_, h) -> get_expr_vars vars h) (Utils.ISet.add c vars) hl |
||
991 | | Expr_appl (_, arg, None) -> get_expr_vars vars arg |
||
992 | | Expr_appl (_, arg, Some r) -> List.fold_left get_expr_vars vars [arg; r] |
||
993 | |||
994 | |||
995 | let rec expr_has_arrows e = |
||
996 | expr_desc_has_arrows e.expr_desc |
||
997 | and expr_desc_has_arrows expr_desc = |
||
998 | match expr_desc with |
||
999 | | Expr_const _ |
||
1000 | | Expr_ident _ -> false |
||
1001 | | Expr_tuple el |
||
1002 | | Expr_array el -> List.exists expr_has_arrows el |
||
1003 | | Expr_pre e1 |
||
1004 | | Expr_when (e1, _, _) |
||
1005 | | Expr_access (e1, _) |
||
1006 | | Expr_power (e1, _) -> expr_has_arrows e1 |
||
1007 | | Expr_ite (c, t, e) -> List.exists expr_has_arrows [c; t; e] |
||
1008 | | Expr_arrow (e1, e2) |
||
1009 | | Expr_fby (e1, e2) -> true |
||
1010 | | Expr_merge (_, hl) -> List.exists (fun (_, h) -> expr_has_arrows h) hl |
||
1011 | | Expr_appl (i, e', i') -> expr_has_arrows e' |
||
1012 | |||
1013 | and eq_has_arrows eq = |
||
1014 | expr_has_arrows eq.eq_rhs |
||
1015 | and node_has_arrows node = |
||
1016 | List.exists (fun eq -> eq_has_arrows eq) (get_node_eqs node) |
||
1017 | |||
1018 | 01c7d5e1 | ploc | |
1019 | ec433d69 | xthirioux | let copy_var_decl vdecl = |
1020 | 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) |
||
1021 | |||
1022 | let copy_const cdecl = |
||
1023 | { cdecl with const_type = Types.new_var () } |
||
1024 | |||
1025 | let copy_node nd = |
||
1026 | { nd with |
||
1027 | node_type = Types.new_var (); |
||
1028 | node_clock = Clocks.new_var true; |
||
1029 | node_inputs = List.map copy_var_decl nd.node_inputs; |
||
1030 | node_outputs = List.map copy_var_decl nd.node_outputs; |
||
1031 | node_locals = List.map copy_var_decl nd.node_locals; |
||
1032 | node_gencalls = []; |
||
1033 | node_checks = []; |
||
1034 | node_stateless = None; |
||
1035 | } |
||
1036 | |||
1037 | let copy_top top = |
||
1038 | match top.top_decl_desc with |
||
1039 | | Node nd -> { top with top_decl_desc = Node (copy_node nd) } |
||
1040 | | Const c -> { top with top_decl_desc = Const (copy_const c) } |
||
1041 | | _ -> top |
||
1042 | |||
1043 | let copy_prog top_list = |
||
1044 | List.map copy_top top_list |
||
1045 | |||
1046 | 22fe1c93 | ploc | (* Local Variables: *) |
1047 | (* compile-command:"make -C .." *) |
||
1048 | (* End: *) |