Project

General

Profile

Statistics
| Branch: | Tag: | Revision:

lustrec / src / automata.ml @ 01d48bb0

History | View | Annotate | Download (13.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 Utils
13
open LustreSpec
14
open Corelang
15

    
16

    
17
type aut_state =
18
    {
19
      incoming_r' : var_decl;
20
      incoming_s' : var_decl;
21
      incoming_r : var_decl;
22
      incoming_s : var_decl;
23
      actual_r : var_decl;
24
      actual_s : var_decl
25
    }
26

    
27
let cpvar_decl var_decl =
28
 mkvar_decl var_decl.var_loc ~orig:var_decl.var_orig (var_decl.var_id, var_decl.var_dec_type, var_decl.var_dec_clock, var_decl.var_dec_const, var_decl.var_dec_value)
29

    
30
let as_clock var_decl =
31
  let tydec = var_decl.var_dec_type in
32
  { var_decl with var_dec_type = { ty_dec_desc = Tydec_clock tydec.ty_dec_desc; ty_dec_loc = tydec.ty_dec_loc } }
33

    
34
let mkbool loc b =
35
 mkexpr loc (Expr_const (const_of_bool b))
36

    
37
let mkident loc id =
38
 mkexpr loc (Expr_ident id)
39

    
40
let mkfby loc e1 e2 =
41
 mkexpr loc (Expr_arrow (e1, mkexpr loc (Expr_pre e2)))
42

    
43
let mkidentpair loc restart state =
44
 mkexpr loc (Expr_tuple [mkident loc restart; mkident loc state])
45

    
46
let add_branch (loc, expr, restart, st) cont =
47
 mkexpr loc (Expr_ite (expr, mkexpr loc (Expr_tuple [mkbool loc restart; mkident loc st]), cont))
48

    
49
let mkhandler loc st unless until locals (stmts, asserts, annots) =
50
 {hand_state = st;
51
  hand_unless = unless;
52
  hand_until = until;
53
  hand_locals = locals;
54
  hand_stmts = stmts;
55
  hand_asserts = asserts;
56
  hand_annots = annots;
57
  hand_loc = loc}
58

    
59
let mkautomata loc id handlers =
60
  {aut_id = id;
61
   aut_handlers = handlers;
62
   aut_loc = loc}
63

    
64
let expr_of_exit loc restart state conds tag =
65
  mkexpr loc (Expr_when (List.fold_right add_branch conds (mkidentpair loc restart state), state, tag))
66

    
67
let rec unless_read reads handler =
68
  List.fold_left (fun read (_, c, _, _) -> get_expr_vars read c) reads handler.hand_unless
69

    
70
let rec until_read reads handler =
71
  List.fold_left (fun read (_, c, _, _) -> get_expr_vars read c) reads handler.hand_until
72

    
73
let rec handler_read reads handler =
74
  let locals = List.fold_left (fun locals v -> ISet.add v.var_id locals) ISet.empty handler.hand_locals in
75
  let allvars =
76
    List.fold_left (fun read stmt ->
77
      match stmt with
78
      | Eq eq -> get_expr_vars read eq.eq_rhs
79
      | Aut aut -> List.fold_left handler_read read aut.aut_handlers ) reads handler.hand_stmts
80
  in ISet.diff allvars locals
81

    
82
let rec handler_write writes handler =
83
  let locals = List.fold_left (fun locals v -> ISet.add v.var_id locals) ISet.empty handler.hand_locals in
84
  let allvars =
85
    List.fold_left (fun write stmt ->
86
      match stmt with
87
      | Eq eq -> List.fold_left (fun write v -> ISet.add v write) write eq.eq_lhs
88
      | Aut aut -> List.fold_left handler_write write aut.aut_handlers) writes handler.hand_stmts
89
  in ISet.diff allvars locals
90

    
91
let node_vars_of_idents node iset =
92
  List.fold_right (fun v res -> if ISet.mem v.var_id iset then v :: res else res) (get_node_vars node) []
93

    
94
let mkautomata_state used typedef loc id =
95
  let tydec_bool = { ty_dec_desc = Tydec_bool; ty_dec_loc = loc } in
96
  let tydec_state id = { ty_dec_desc = Tydec_const id; ty_dec_loc = loc } in
97
  let ckdec_any = { ck_dec_desc = Ckdec_any; ck_dec_loc = loc } in
98
  let incoming_r' = mk_new_name used (id ^ "__next_restart_in") in
99
  let incoming_s' = mk_new_name used (id ^ "__next_state_in") in
100
  let incoming_r = mk_new_name used (id ^ "__restart_in") in
101
  let incoming_s = mk_new_name used (id ^ "__state_in") in
102
  let actual_r = mk_new_name used (id ^ "__restart_act") in
103
  let actual_s = mk_new_name used (id ^ "__state_act") in
104
  {
105
    incoming_r' = mkvar_decl loc (incoming_r', tydec_bool, ckdec_any, false, None);
106
    incoming_s' = mkvar_decl loc (incoming_s', tydec_state typedef.tydef_id, ckdec_any, false, None);
107
    incoming_r = mkvar_decl loc (incoming_r, tydec_bool, ckdec_any, false, None);
108
    incoming_s = mkvar_decl loc (incoming_s, tydec_state typedef.tydef_id, ckdec_any, false, None);
109
    actual_r = mkvar_decl loc (actual_r  , tydec_bool, ckdec_any, false, None);
110
    actual_s = mkvar_decl loc (actual_s  , tydec_state typedef.tydef_id, ckdec_any, false, None)
111
  }
112

    
113
let vars_of_aut_state aut_state =
114
  [aut_state.incoming_r'; aut_state.incoming_r; aut_state.actual_r; aut_state.incoming_s'; as_clock aut_state.incoming_s; as_clock aut_state.actual_s]
115

    
116
let node_of_unless nused used node aut_id aut_state handler =
117
  let inputs = unless_read ISet.empty handler in
118
  let var_inputs = aut_state.incoming_r :: aut_state.incoming_s :: (node_vars_of_idents node inputs) in
119
  let var_outputs = aut_state.actual_r :: aut_state.actual_s :: [] in
120
  let expr_outputs = List.fold_right add_branch handler.hand_unless (mkidentpair handler.hand_loc aut_state.incoming_r.var_id aut_state.incoming_s.var_id) in
121
  let eq_outputs = Eq (mkeq handler.hand_loc ([aut_state.actual_r.var_id; aut_state.actual_s.var_id], expr_outputs)) in
122
  let node_id = mk_new_name nused (Format.sprintf "%s__%s_unless" aut_id handler.hand_state) in
123
  let args = List.map (fun v -> mkexpr handler.hand_loc (Expr_when (mkident handler.hand_loc v.var_id, aut_state.incoming_s.var_id, handler.hand_state))) var_inputs in
124
  let reset = Some (mkident handler.hand_loc aut_state.incoming_r.var_id) in
125
  {
126
    node_id = node_id;
127
    node_type = Types.new_var ();
128
    node_clock = Clocks.new_var true;
129
    node_inputs = List.map cpvar_decl var_inputs;
130
    node_outputs = List.map cpvar_decl var_outputs;
131
    node_locals = [];
132
    node_gencalls = [];
133
    node_checks = [];
134
    node_asserts = []; 
135
    node_stmts = [ eq_outputs ];
136
    node_dec_stateless = false;
137
    node_stateless = None;
138
    node_spec = None;
139
    node_annot = []
140
  },
141
  mkexpr handler.hand_loc (Expr_appl (node_id, mkexpr handler.hand_loc (Expr_tuple args), reset))
142

    
143

    
144
let rename_output used name = mk_new_name used (Format.sprintf "%s_out" name)
145

    
146
let rec rename_stmts_outputs frename stmts =
147
  match stmts with
148
  | []           -> []
149
  | (Eq eq) :: q   -> let eq' = Eq { eq with eq_lhs = List.map frename eq.eq_lhs } in
150
		      eq' :: rename_stmts_outputs frename q
151
  | (Aut aut) :: q -> let handlers' = List.map (fun h -> { h with hand_stmts = rename_stmts_outputs frename h.hand_stmts}) aut.aut_handlers in
152
                      let aut' = Aut { aut with aut_handlers = handlers' } in
153
		      aut' :: rename_stmts_outputs frename q
154

    
155
let mk_frename used outputs =
156
  let table = ISet.fold (fun name table -> IMap.add name (rename_output used name) table) outputs IMap.empty in
157
  (fun name -> try IMap.find name table with Not_found -> name)
158

    
159
let node_of_assign_until nused used node aut_id aut_state handler =
160
  let writes = handler_write ISet.empty handler in
161
  let inputs = ISet.diff (handler_read (until_read ISet.empty handler) handler) writes in
162
  let frename = mk_frename used writes in
163
  let var_inputs = node_vars_of_idents node inputs in
164
  let new_var_locals = node_vars_of_idents node writes in
165
  let var_outputs = node_vars_of_idents node writes in
166
  let new_var_outputs = List.map (fun vdecl -> { vdecl with var_id = frename vdecl.var_id }) var_outputs in
167
  let new_output_eqs = List.map2 (fun o o' -> Eq (mkeq handler.hand_loc ([o'.var_id], mkident handler.hand_loc o.var_id))) var_outputs new_var_outputs in
168
  let until_expr = List.fold_right add_branch handler.hand_until (mkidentpair handler.hand_loc aut_state.actual_r.var_id aut_state.actual_s.var_id) in
169
  let until_eq = Eq (mkeq handler.hand_loc ([aut_state.incoming_r.var_id; aut_state.incoming_s.var_id], until_expr)) in
170
  let node_id = mk_new_name nused (Format.sprintf "%s__%s_handler_until" aut_id handler.hand_state) in
171
  let var_inputs = aut_state.actual_r :: aut_state.actual_s :: var_inputs in
172
  let args = List.map (fun v -> mkexpr handler.hand_loc (Expr_when (mkident handler.hand_loc v.var_id, aut_state.actual_s.var_id, handler.hand_state))) var_inputs in
173
  let reset = Some (mkident handler.hand_loc aut_state.actual_r.var_id) in
174
  List.fold_left (fun res v -> ISet.add v.var_id res) ISet.empty var_outputs,
175
  {
176
    node_id = node_id;
177
    node_type = Types.new_var ();
178
    node_clock = Clocks.new_var true;
179
    node_inputs = List.map cpvar_decl var_inputs;
180
    node_outputs = List.map cpvar_decl (aut_state.incoming_r :: aut_state.incoming_s :: new_var_outputs);
181
    node_locals = List.map cpvar_decl (new_var_locals @ handler.hand_locals);
182
    node_gencalls = [];
183
    node_checks = [];
184
    node_asserts = handler.hand_asserts; 
185
    node_stmts = until_eq :: new_output_eqs @ handler.hand_stmts;
186
    node_dec_stateless = false;
187
    node_stateless = None;
188
    node_spec = None;
189
    node_annot = handler.hand_annots
190
  },
191
  mkexpr handler.hand_loc (Expr_appl (node_id, mkexpr handler.hand_loc (Expr_tuple args), reset))
192

    
193
let typedef_of_automata aut =
194
  let tname = Format.sprintf "%s__type" aut.aut_id in
195
  { tydef_id = tname;
196
    tydef_desc = Tydec_enum (List.map (fun h -> h.hand_state) aut.aut_handlers)
197
  }
198

    
199
let expand_automata nused used owner typedef node aut =
200
  let initial = (List.hd aut.aut_handlers).hand_state in
201
  let aut_state = mkautomata_state used typedef aut.aut_loc aut.aut_id in
202
  let unodes = List.map (fun h -> node_of_unless nused used node aut.aut_id aut_state h) aut.aut_handlers in
203
  let aunodes = List.map (fun h -> node_of_assign_until nused used node aut.aut_id aut_state h) aut.aut_handlers in
204
  let all_outputs = List.fold_left (fun all (outputs, _, _) -> ISet.union outputs all) ISet.empty aunodes in
205
  let unless_handlers = List.map2 (fun h (n, c) -> (h.hand_state, c)) aut.aut_handlers unodes in
206
  let unless_expr = mkexpr aut.aut_loc (Expr_merge (aut_state.incoming_s.var_id, unless_handlers)) in
207
  let unless_eq = mkeq aut.aut_loc ([aut_state.actual_r.var_id; aut_state.actual_s.var_id], unless_expr) in
208
  let assign_until_handlers = List.map2 (fun h (_, n, c) -> (h.hand_state, c)) aut.aut_handlers aunodes in
209
  let assign_until_expr = mkexpr aut.aut_loc (Expr_merge (aut_state.actual_s.var_id, assign_until_handlers)) in
210
  let assign_until_vars = [aut_state.incoming_r'.var_id; aut_state.incoming_s'.var_id] @ (ISet.elements all_outputs) in
211
  let assign_until_eq = mkeq aut.aut_loc (assign_until_vars, assign_until_expr) in
212
  let fby_incoming_expr = mkfby aut.aut_loc (mkidentpair aut.aut_loc tag_false initial) (mkidentpair aut.aut_loc aut_state.incoming_r'.var_id aut_state.incoming_s'.var_id) in
213
  let incoming_eq = mkeq aut.aut_loc ([aut_state.incoming_r.var_id; aut_state.incoming_s.var_id], fby_incoming_expr) in
214
  let locals' = vars_of_aut_state aut_state in
215
  let eqs' = [Eq unless_eq; Eq assign_until_eq; Eq incoming_eq] in
216
  (  List.map2 (fun h (n, _) -> mktop_decl h.hand_loc owner false (Node n)) aut.aut_handlers unodes
217
   @ List.map2 (fun h (_, n, _) -> mktop_decl h.hand_loc owner false (Node n)) aut.aut_handlers aunodes,
218
  locals',
219
  eqs')
220

    
221
let expand_node_stmt nused used owner node (top_types, top_nodes, locals, eqs) stmt =
222
  match stmt with
223
  | Eq eq -> (top_types, top_nodes, locals, (Eq eq)::eqs)
224
  | Aut aut ->
225
    let typedef = typedef_of_automata aut in
226
    let used' name = used name || List.exists (fun v -> v.var_id = name) locals in
227
    let nused' name =
228
      nused name ||
229
      List.exists (fun t -> match t.top_decl_desc with
230
      | ImportedNode nd -> nd.nodei_id = name | Node nd -> nd.node_id = name
231
      | _ -> false) top_nodes in
232
    let (top_decls', locals', eqs') = expand_automata nused' used' owner typedef node aut in
233
    let top_typedef = mktop_decl aut.aut_loc owner false (TypeDef typedef) in
234
    (top_typedef :: top_types, top_decls'@top_nodes, locals'@locals, eqs'@eqs)
235

    
236
let expand_node_stmts nused used loc owner node =
237
  let (top_types', top_nodes', locals', eqs') =
238
    List.fold_left (expand_node_stmt nused used owner node) ([], [], [], []) node.node_stmts in
239
  let node' = 
240
    { node with node_locals = locals'@node.node_locals; node_stmts = eqs' } in
241
  let top_node = mktop_decl loc owner false (Node node') in
242
  top_types', top_node, top_nodes'
243

    
244
let rec expand_decls_rec nused top_decls =
245
  match top_decls with
246
  | [] -> []
247
  | top_decl::q ->
248
    match top_decl.top_decl_desc with
249
    | Node nd ->
250
      let used name =
251
	   List.exists (fun v -> v.var_id = name) nd.node_inputs
252
	|| List.exists (fun v -> v.var_id = name) nd.node_outputs
253
	|| List.exists (fun v -> v.var_id = name) nd.node_locals in
254
      let (top_types', top_decl', top_nodes') = expand_node_stmts nused used top_decl.top_decl_loc top_decl.top_decl_owner nd in
255
      top_types' @ (top_decl' :: expand_decls_rec nused (top_nodes'@q))
256
    | _       -> top_decl :: expand_decls_rec nused q
257

    
258
let expand_decls top_decls =
259
  let top_names = List.fold_left (fun names t -> match t.top_decl_desc with
260
    | Node nd         -> ISet.add nd.node_id names
261
    | ImportedNode nd -> ISet.add nd.nodei_id names
262
    | _               -> names) ISet.empty top_decls in
263
  let nused name = ISet.mem name top_names in
264
  expand_decls_rec nused top_decls
265

    
266
(* Local Variables: *)
267
(* compile-command:"make -C .." *)
268
(* End: *)
269