CristalCaveGem » LustreC

      (fun td ->

	match td.top_decl_desc with 

	| Node nd ->

	   nd.node_gencalls <- get_calls prednode nd

	| _ -> ()

  (* Importing source *)

  let prog, dependencies, (typ_env, clk_env) = Modules.load ~is_header:(extension = ".lusi") prog in

  (* Registering types and clocks for future checks *)

  Global.type_env := Env.overwrite !Global.type_env typ_env;

  Global.clock_env := Env.overwrite !Global.clock_env clk_env;

  | _ -> assert false

let node_from_name id =

let is_imported_node td =

  match td.top_decl_desc with 

let reset_cpt_fresh () =

    cpt_fresh := 0

  let rec aux () =

  incr cpt_fresh;

  {

    var_id = s;

    var_orig = false;

    var_dec_clock = dummy_clock_dec;

    var_dec_const = false;

    var_dec_value = None;

    var_type = ty;

    var_clock = ck;

    var_loc = loc

val get_instr_desc: Machine_code_types.instr_t -> Machine_code_types.instr_t_desc

val update_instr_desc: Machine_code_types.instr_t -> Machine_code_types.instr_t_desc -> Machine_code_types.instr_t

val print_node_table:  Format.formatter -> unit -> unit

val node_name: top_decl -> ident

val node_inputs: top_decl -> var_decl list

val node_from_name: ident -> top_decl

val is_generic_node: top_decl -> bool

val is_imported_node: top_decl -> bool

val expr_contains_expr: tag -> expr -> bool

val reset_cpt_fresh: unit -> unit

val find_eq: ident list -> eq list -> eq * eq list

val get_expr_calls: top_decl list -> expr -> Utils.ISet.t

  in

  typing_env := env

  let init_env = !typing_env in

  (* Format.eprintf "Init env: %a@." (Env.pp_env MTypes.print_ty) init_env; *)

  (* Rebuilding the variables environment from accumulated knowledge *)

  let env,vars = (* First, we add non specified variables *)

    List.fold_left (fun (env, vars) v ->

  (* Then declared ones *)

  let env, vars =

    Hashtbl.fold (fun vdecl machine_type (env, vds) ->

	 (* Format.eprintf "Adding variable %a to the environement@.@?" Printers.pp_var vdecl;  *)

	let env = Env.add_value env vdecl.var_id machine_type in

	env, vdecl::vds

let add_imported_node name value =

(*Format.eprintf "add_imported_node %s %a (owner=%s)@." name Printers.pp_imported_node (imported_node_of_top value) value.top_decl_owner;*)

  try

    let owner' = value'.top_decl_owner in

    let itf' = value'.top_decl_itf in

    let owner = value.top_decl_owner in

    let itf = value.top_decl_itf in

    match value'.top_decl_desc, value.top_decl_desc with

    | ImportedNode _, ImportedNode _            -> raise (Error (value.top_decl_loc, Error.Already_bound_symbol ("node " ^ name)))

    | _                                         -> assert false

  with

let add_node name value =

(*Format.eprintf "add_node %s %a (owner=%s)@." name Printers.pp_imported_node (get_node_interface (node_of_top value)) value.top_decl_owner;*)

  try

    let owner' = value'.top_decl_owner in

    let itf' = value'.top_decl_itf in

    let owner = value.top_decl_owner in

    | Node _        , Node _                    -> raise (Error (value.top_decl_loc, Error.Already_bound_symbol ("node " ^ name)))

    | _                                         -> assert false

  with

let add_tag loc name typ =

                 force_alias_internal_fun =false;

               }

let expr_true loc ck =

{ expr_tag = Utils.new_tag ();

  expr_desc = Expr_const (Const_tag tag_true);

  in

 List.fold_left add_offset e offsets

(* Create an alias for [expr], if none exists yet *)

(*Format.eprintf "mk_expr_alias %a %a %a@." Printers.pp_expr expr Types.print_ty expr.expr_type Clocks.print_ck expr.expr_clock;*)

  match get_expr_alias defs expr with

  | Some eq ->

  | None    ->

    let new_aliases =

      List.map2

	(Types.type_list_of_type expr.expr_type)

	(Clocks.clock_list_of_clock expr.expr_clock) in

    let new_def =

    in

    (* Format.eprintf "Checking def of alias: %a -> %a@." (fprintf_list ~sep:", " (fun fmt v -> Format.pp_print_string fmt v.var_id)) new_aliases Printers.pp_expr expr; *)

    (new_def::defs, new_aliases@vars), replace_expr new_aliases expr

(* Create an alias for [expr], if [expr] is not already an alias (i.e. an ident)

   and [opt] is true *)

(*Format.eprintf "mk_expr_alias_opt %B %a %a %a@." opt Printers.pp_expr expr Types.print_ty expr.expr_type Clocks.print_ck expr.expr_clock;*)

  match expr.expr_desc with

  | Expr_ident alias ->

      then

	let new_aliases =

	  List.map2

	    (Types.type_list_of_type expr.expr_type)

	    (Clocks.clock_list_of_clock expr.expr_clock) in

	let new_def =

	  mkeq expr.expr_loc (List.map (fun v -> v.var_id) new_aliases, expr)

	in

	(* Typing and Registering machine type *) 

	(new_def::defs, new_aliases@vars), replace_expr new_aliases expr

      else

	(defs, vars), expr

    expr_type = Utils.repeat (List.length offsets) drop_array_type ref_e.expr_type }

(* normalize_<foo> : defs * used vars -> <foo> -> (updated defs * updated vars) * normalized <foo> *)

  List.fold_right

    (fun t (defvars, qlist) ->

      (defvars, norm_t :: qlist)

    ) elist (defvars, [])

  (*Format.eprintf "normalize %B %a:%a [%a]@." alias Printers.pp_expr expr Types.print_ty expr.expr_type (Utils.fprintf_list ~sep:"," Dimension.pp_dimension) offsets;*)

  match expr.expr_desc with

  | Expr_const _

  | Expr_ident _ -> defvars, unfold_offsets expr offsets

  | Expr_array elist ->

     let norm_expr = mk_norm_expr offsets expr (Expr_array norm_elist) in

  | Expr_power (e1, d) when offsets = [] ->

     let norm_expr = mk_norm_expr offsets expr (Expr_power (norm_e1, d)) in

  | Expr_power (e1, d) ->

  | Expr_access (e1, d) ->

  | Expr_tuple elist ->

     let defvars, norm_elist =

     defvars, mk_norm_expr offsets expr (Expr_tuple norm_elist)

  | Expr_appl (id, args, None)

      when Basic_library.is_homomorphic_fun id 

     let defvars, norm_args =

       normalize_list

	 alias

	 offsets

	 (fun _ -> normalize_array_expr ~alias:true)

	 defvars

     defvars, mk_norm_expr offsets expr (Expr_appl (id, expr_of_expr_list args.expr_loc norm_args, None))

  | Expr_appl (id, args, None) when Basic_library.is_expr_internal_fun expr

      && not (!params.force_alias_internal_fun || alias_basic) ->

     defvars, mk_norm_expr offsets expr (Expr_appl (id, norm_args, None))

  | Expr_appl (id, args, r) ->

     let defvars, r =

       match r with

       | None -> defvars, None

       | Some r ->

	  defvars, Some norm_r

     in

     let norm_expr = mk_norm_expr [] expr (Expr_appl (id, norm_args, r)) in

     if offsets <> []

     then

     else

       mk_expr_alias_opt (alias && (!params.force_alias_internal_fun || alias_basic

				    || not (Basic_library.is_expr_internal_fun expr)))

  | Expr_arrow (e1,e2) when !params.unfold_arrow_active && not (is_expr_once expr) ->

     (* Here we differ from Colaco paper: arrows are pushed to the top *)

  | Expr_arrow (e1,e2) ->

     let norm_expr = mk_norm_expr offsets expr (Expr_arrow (norm_e1, norm_e2)) in

  | Expr_pre e ->

     let norm_expr = mk_norm_expr offsets expr (Expr_pre norm_e) in

  | Expr_fby (e1, e2) ->

     let norm_expr = mk_norm_expr offsets expr (Expr_fby (norm_e1, norm_e2)) in

  | Expr_when (e, c, l) ->

     defvars, mk_norm_expr offsets expr (Expr_when (norm_e, c, l))

  | Expr_ite (c, t, e) ->

     let norm_expr = mk_norm_expr offsets expr (Expr_ite (norm_c, norm_t, norm_e)) in

  | Expr_merge (c, hl) ->

     let norm_expr = mk_norm_expr offsets expr (Expr_merge (c, norm_hl)) in

(* Creates a conditional with a merge construct, which is more lazy *)

(*

  let defvars, norm_t = norm_expr (alias node offsets defvars t in

  | _ -> assert false

*)

  List.fold_right

    (fun (t, h) (defvars, norm_q) ->

      defvars, (t, norm_h) :: norm_q

    )

    hl (defvars, [])

  (*Format.eprintf "normalize_array %B %a [%a]@." alias Printers.pp_expr expr (Utils.fprintf_list ~sep:"," Dimension.pp_dimension) offsets;*)

  match expr.expr_desc with

  | Expr_power (e1, d) when offsets = [] ->

     defvars, mk_norm_expr offsets expr (Expr_power (norm_e1, d))

  | Expr_power (e1, d) ->

  | Expr_array elist when offsets = [] ->

     defvars, mk_norm_expr offsets expr (Expr_array norm_elist)

  | Expr_appl (id, args, None) when Basic_library.is_expr_internal_fun expr ->

     defvars, mk_norm_expr offsets expr (Expr_appl (id, expr_of_expr_list args.expr_loc norm_args, None))

  (*Format.eprintf "normalize_cond %B %a [%a]@." alias Printers.pp_expr expr (Utils.fprintf_list ~sep:"," Dimension.pp_dimension) offsets;*)

  match expr.expr_desc with

  | Expr_access (e1, d) ->

  | Expr_ite (c, t, e) ->

     defvars, mk_norm_expr offsets expr (Expr_ite (norm_c, norm_t, norm_e))

  | Expr_merge (c, hl) ->

     defvars, mk_norm_expr offsets expr (Expr_merge (c, norm_hl))

  | _ when !params.force_alias_ite ->

     (* Forcing alias creation for then/else expressions *)

     let defvars, norm_expr =

     in

  | _ -> (* default case without the force_alias_ite option *)

(* outputs cannot be memories as well. If so, introduce new local variable.

*)

  let rec fold_lhs defvars lhs tys cks =

    match lhs, tys, cks with

    | [], [], []          -> defvars, []

    | v::qv, t::qt, c::qc -> let (defs_q, vars_q), lhs_q = fold_lhs defvars qv qt qc in

			     then

			       let neweq  = mkeq eq.eq_loc ([v], expr_of_vdecl newvar) in

			       (neweq :: defs_q, newvar :: vars_q), newvar.var_id :: lhs_q

			     else

      (Clocks.clock_list_of_clock eq.eq_rhs.expr_clock) in

  defvars', {eq with eq_lhs = lhs' }

(*Format.eprintf "normalize_eq %a@." Types.print_ty eq.eq_rhs.expr_type;*)

  match eq.eq_rhs.expr_desc with

  | Expr_pre _

  | Expr_fby _  ->

    let norm_eq = { eq' with eq_rhs = norm_rhs } in

    (norm_eq::defs', vars')

  | Expr_array _ ->

    let norm_eq = { eq with eq_rhs = norm_rhs } in

    (norm_eq::defs', vars')

  | Expr_appl (id, _, None) when Basic_library.is_homomorphic_fun id && Types.is_array_type eq.eq_rhs.expr_type ->

    let norm_eq = { eq with eq_rhs = norm_rhs } in

    (norm_eq::defs', vars')

  | Expr_appl _ ->

    let norm_eq = { eq with eq_rhs = norm_rhs } in

    (norm_eq::defs', vars')

  | _ ->

    let norm_eq = { eq with eq_rhs = norm_rhs } in

    norm_eq::defs', vars'

  try

  List.fold_right (fun eq (def, vars) -> 

    let eq_defs = Splitting.tuple_split_eq eq in

    if eq_defs = [eq] then

      eq::def, vars 

    else

  ) defs ([], vars)  

  with _ -> (

    assert false

  )

  (* New output variable *)

  let output_id = "spec" ^ string_of_int ee.eexpr_tag in

  let output_var = 

    ;

    raise exc

  List.iter nee s.assume;

  List.iter nee s.guarantees;

  List.iter (fun m -> 

      List.iter nee m.require;

    List.iter nee m.ensure

(* The normalization phase introduces new local variables

   - output cannot be memories. If this happen, new local variables acting as

  let orig_vars = inputs_outputs@node.node_locals in

  let not_is_orig_var v =

    List.for_all ((!=) v) orig_vars in

  let defs, vars =

    let eqs, auts = get_node_eqs node in

    if auts != [] then assert false; (* Automata should be expanded by now. *)

  (* Normalize the asserts *)

  let vars, assert_defs, asserts =

    List.fold_left (

	let (defs, vars'), expr = 

	  normalize_expr 

	    ~alias:true (* forcing introduction of new equations for fcn calls *) 

	    [] (* empty offset for arrays *)

	    ([], vars) (* defvar only contains vars *)

	    assert_expr

	annots

    ) new_annots new_locals

  in

    begin

      (* Update mutable fields of eexpr to perform normalization of

	 specification.

	 Careful: we do not normalize annotations, since they can have the form

	 x = (a, b, c) *)

  let node =

    { node with

      node_locals = all_locals;

      node_stmts = List.map (fun eq -> Eq eq) (defs @ assert_defs);

      node_asserts = asserts;

      node_annot = new_annots;

    }

  in ((*Printers.pp_node Format.err_formatter node;*)

    node

  )

let normalize_decl (decls: program_t) (decl: top_decl) : top_decl =

  match decl.top_decl_desc with

  | Node nd ->

let normalize_prog p decls =

  (* Backend specific configurations for normalization *)

  (* Main algorithm: iterates over nodes *)

  List.map (normalize_decl decls) decls

           (* Local Variables: *)

           (* compile-command:"make -C .." *)

type param_t =

  {

    unfold_arrow_active: bool;

  }

let inject_node node = 

  cpt_fresh := 0;

  let inputs_outputs = node.node_inputs@node.node_outputs in

  let is_local v =

    List.for_all ((!=) v) inputs_outputs in

  let orig_vars = inputs_outputs@node.node_locals in

  let defs, vars =

    let eqs, auts = get_node_eqs node in

    if auts != [] then assert false; (* Automata should be expanded by now. *)

  (* Normalize the asserts *)

  let vars, assert_defs, asserts = 

    List.fold_left (

      let (defs, vars'), expr = 

	inject_expr 

	  ~alias:false 

	  ([], vars) (* defvar only contains vars *)

	  assert_expr

      in