heptagon/compiler/minils/analysis/clocking.ml

169 lines
5.7 KiB
OCaml
Raw Normal View History

2010-06-15 10:49:03 +02:00
(**************************************************************************)
(* *)
(* MiniLustre *)
(* *)
(* Author : Marc Pouzet *)
(* Organization : Demons, LRI, University of Paris-Sud, Orsay *)
(* *)
(**************************************************************************)
(* clock checking *)
2010-06-15 10:49:03 +02:00
open Misc
open Idents
2010-06-15 10:49:03 +02:00
open Minils
2010-06-22 10:08:30 +02:00
open Mls_printer
open Signature
2010-06-18 11:50:35 +02:00
open Types
2010-07-23 22:06:06 +02:00
open Clocks
2010-06-15 10:49:03 +02:00
open Location
open Format
(** Error Kind *)
type error_kind = | Etypeclash of ct * ct
let error_message loc = function
| Etypeclash (actual_ct, expected_ct) ->
Format.eprintf "%aClock Clash: this expression has clock %a,@\n\
but is expected to have clock %a.@."
print_location loc
2010-06-29 11:18:50 +02:00
print_clock actual_ct
print_clock expected_ct;
raise Error
2010-07-23 22:06:06 +02:00
2010-06-15 10:49:03 +02:00
let typ_of_name h x = Env.find x h
2010-06-15 10:49:03 +02:00
let rec typing h e =
2010-07-15 16:20:46 +02:00
let ct = match e.e_desc with
| Econst se -> skeleton (new_var ()) se.se_ty
2010-07-15 16:20:46 +02:00
| Evar x -> Ck (typ_of_name h x)
| Efby (c, e) -> typing h e
| Eapp({a_op = op}, args, r) ->
let ck = match r with
2010-07-23 22:06:06 +02:00
| None -> new_var ()
| Some(reset) -> typ_of_name h reset in
typing_op op args h e ck
| Eiterator (_, _, _, args, r) -> (* Typed exactly as a fun or a node... *)
let ck = match r with
| None -> new_var()
| Some(reset) -> typ_of_name h reset
in (List.iter (expect h (Ck ck)) args; skeleton ck e.e_ty)
2010-07-15 16:20:46 +02:00
| Ewhen (e, c, n) ->
2010-07-23 22:06:06 +02:00
let ck_n = typ_of_name h n in
(expect h (skeleton ck_n e.e_ty) e; skeleton (Con (ck_n, c, n)) e.e_ty)
2010-07-15 16:20:46 +02:00
| Emerge (n, c_e_list) ->
2010-07-23 22:06:06 +02:00
let ck_c = typ_of_name h n in
(typing_c_e_list h ck_c n c_e_list; skeleton ck_c e.e_ty)
2010-07-15 16:20:46 +02:00
| Estruct l ->
let ck = new_var () in
(List.iter
(fun (n, e) -> let ct = skeleton ck e.e_ty in expect h ct e) l;
Ck ck)
2010-06-18 11:50:35 +02:00
in (e.e_ck <- ckofct ct; ct)
2010-07-15 16:20:46 +02:00
and typing_op op args h e ck = match op, args with
| (Eequal | Efun _ | Enode _), e_list ->
2010-07-15 16:20:46 +02:00
(List.iter (expect h (Ck ck)) e_list; skeleton ck e.e_ty)
2010-07-23 22:06:06 +02:00
| Etuple, e_list ->
Cprod (List.map (typing h) e_list)
2010-07-15 16:20:46 +02:00
| Eifthenelse, [e1; e2; e3] ->
let ct = skeleton ck e.e_ty
2010-07-15 16:20:46 +02:00
in (expect h (Ck ck) e1; expect h ct e2; expect h ct e3; ct)
| Efield, [e1] ->
let ct = skeleton ck e1.e_ty in (expect h (Ck ck) e1; ct)
| Efield_update, [e1; e2] ->
let ct = skeleton ck e.e_ty
in (expect h (Ck ck) e1; expect h ct e2; ct)
2010-07-15 16:20:46 +02:00
| Earray, e_list ->
(List.iter (expect h (Ck ck)) e_list; skeleton ck e.e_ty)
| Earray_fill, [e] -> typing h e
| Eselect, [e] -> typing h e
| Eselect_dyn, e1::defe::idx -> (* TODO defe not treated ? *)
let ct = skeleton ck e1.e_ty
in (expect h ct e1; List.iter (expect h ct) idx; ct)
| Eupdate, e1::e2::idx ->
let ct = skeleton ck e.e_ty
in (expect h (Ck ck) e1; expect h ct e2; List.iter (expect h ct) idx; ct)
2010-07-15 16:20:46 +02:00
| Eselect_slice, [e] -> typing h e
| Econcat, [e1; e2] ->
let ct = skeleton ck e.e_ty
in (expect h (Ck ck) e1; expect h ct e2; ct)
| Elambda _, _ -> Format.eprintf "Elambda dans le cloking"; assert false;
2010-07-15 16:20:46 +02:00
2010-06-18 11:50:35 +02:00
2010-06-15 10:49:03 +02:00
and expect h expected_ty e =
2010-07-23 22:06:06 +02:00
let actual_ty = typing h e in
2010-06-29 11:18:50 +02:00
try unify actual_ty expected_ty
with
| Unify -> eprintf "%a : " print_exp e;
error_message e.e_loc (Etypeclash (actual_ty, expected_ty))
2010-06-18 11:50:35 +02:00
2010-06-15 10:49:03 +02:00
and typing_c_e_list h ck_c n c_e_list =
2010-06-18 11:50:35 +02:00
let rec typrec =
function
2010-06-29 11:18:50 +02:00
| [] -> ()
| (c, e) :: c_e_list ->
(expect h (skeleton (Con (ck_c, c, n)) e.e_ty) e; typrec c_e_list)
2010-06-18 11:50:35 +02:00
in typrec c_e_list
2010-06-18 11:50:35 +02:00
let rec typing_pat h =
function
2010-06-29 11:18:50 +02:00
| Evarpat x -> Ck (typ_of_name h x)
| Etuplepat pat_list -> Cprod (List.map (typing_pat h) pat_list)
let typing_eqs h eq_list = (*TODO FIXME*)
let typing_eq { eq_lhs = pat; eq_rhs = e } =
let ty_pat = typing_pat h pat in
(try expect h ty_pat e with
| Error -> (* DEBUG *)
Format.eprintf "Complete expression: %a@\nClock pattern: %a@."
Mls_printer.print_exp e
Mls_printer.print_clock ty_pat;
raise Error)
in List.iter typing_eq eq_list
2010-06-15 10:49:03 +02:00
let build h dec =
List.fold_left (fun h { v_ident = n } -> Env.add n (new_var ()) h) h dec
2010-06-15 10:49:03 +02:00
let sbuild h dec base =
List.fold_left (fun h { v_ident = n } -> Env.add n base h) h dec
2010-06-15 10:49:03 +02:00
let typing_contract h contract base =
match contract with
2010-06-29 11:18:50 +02:00
| None -> h
| Some { c_local = l_list;
c_eq = eq_list;
c_assume = e_a;
2010-07-15 16:20:46 +02:00
c_enforce = e_g; } ->
2010-06-29 11:18:50 +02:00
let h' = build h l_list in
(* assumption *)
(* property *)
(typing_eqs h' eq_list;
expect h' (Ck base) e_a;
expect h' (Ck base) e_g;
h)
let typing_node ({ n_name = f;
2010-06-29 11:18:50 +02:00
n_input = i_list;
n_output = o_list;
n_contract = contract;
n_local = l_list;
n_equs = eq_list
} as node) =
2010-06-15 10:49:03 +02:00
let base = Cbase in
let h = sbuild Env.empty i_list base in
let h = sbuild h o_list base in
let h = typing_contract h contract base in
let h = build h l_list in
(typing_eqs h eq_list;
2010-06-29 11:18:50 +02:00
(*update clock info in variables descriptions *)
2010-07-23 22:06:06 +02:00
let set_clock vd = { vd with v_clock = ck_repr (Env.find vd.v_ident h) } in
2010-06-29 11:18:50 +02:00
{ (node) with
n_input = List.map set_clock i_list;
n_output = List.map set_clock o_list;
n_local = List.map set_clock l_list })
2010-06-18 11:50:35 +02:00
let program (({ p_nodes = p_node_list } as p)) =
{ (p) with p_nodes = List.map typing_node p_node_list; }