CristalCaveGem » LustreC

(*

open Machine_code_common

*)

(** Return true if its the arrow machine

   @param machine the machine to test

*)

(** Extract a node from an instance.

   @param instance the instance

**)

  let (_, (node, _)) = instance in

  match node.top_decl_desc with

    | Node nd         -> nd

    | _ -> assert false (*TODO*)

      assume that the machine is in the list.

   @param machines list of all machines

   @param instance instance of a machine

   @return the machine corresponding to hte given instance

**)

    let id = (extract_node instance).node_id in

    try

      List.find (function m -> m.mname.node_id=id) machines

    with

      Not_found -> assert false (*TODO*)

(** Extract all the inputs and outputs.

   @param machine the machine

   @return a list of all the var_decl of a macine

**)

  m.mmemory@m.mstep.step_inputs@m.mstep.step_outputs@m.mstatic

(** Check if a type is polymorphic.

   @param typ the type

   @return true if its polymorphic

**)

(** Find all polymorphic type : Types.Tunivar in a machine.

   @param machine the machine

   @return a list of id corresponding to polymorphic type

**)

    List.filter (function x-> is_Tunivar x.var_type) vars in

  List.sort_uniq (-) (List.map extract polymorphic_type_vars)

(** Check if a submachine is statefull.

    @param submachine a submachine

    @return true if the submachine is statefull

**)

    not (snd (snd submachine)).mname.node_dec_stateless

(** Find a submachine step call in a list of instructions.

    @param ident submachine instance ident

    @param instr_list List of instruction sto search

    @return a list of pair containing input types and output types for each step call found

**)

  let search_instr instruction = 

      | MStep (il, i, vl) when String.equal i ident -> [

        (List.map (function x-> x.value_type) vl,

            List.map (function x-> x.var_type) il)]

      | MBranch (_, l) -> List.flatten

          (List.map (function _, y -> find_submachine_step_call ident y) l)

      | _ -> []

   this function chck equality and that it is both basic type.

   This might be a required feature when it used *)

(** Test if two types are the same.

   @param typ1 the first type

   @param typ2 the second type

**)

let pp_eq_type typ1 typ2 = 

  let get_basic typ = match (Types.repr typ).Types.tdesc with

    | Types.Tbasic Types.Basic.Tint -> Types.Basic.Tint

    | Types.Tbasic Types.Basic.Treal -> Types.Basic.Treal

    | Types.Tbasic Types.Basic.Tbool -> Types.Basic.Tbool

    | _ -> assert false (*TODO*)

(** Check that two types are the same.

   @param t1 a type

   @param t2 an other type

   @param return true if the two types are Tbasic or Tunivar and equal

**)

let rec check_type_equal (t1:Types.type_expr) (t2:Types.type_expr) =

    | Types.Tbasic x, Types.Tbasic y -> x = y

    | Types.Tunivar,  Types.Tunivar  -> t1.tid = t2.tid

    | Types.Ttuple l, _ -> assert (List.length l = 1); check_type_equal (List.hd l) t2

    | _, Types.Ttuple l -> assert (List.length l = 1); check_type_equal t1 (List.hd l)

    | Types.Tstatic (_, t), _ -> check_type_equal t t2

    | _, Types.Tstatic (_, t) -> check_type_equal t1 t

    | _ -> assert false

(** Extend a substitution to unify the two given types. Only the

  first type can be polymorphic.

    @param subsitution the base substitution

    @param type_poly the type which can be polymorphic

    @param typ the type to match type_poly with

**)

let unification (substituion:(int*Types.type_expr) list) ((type_poly:Types.type_expr), (typ:Types.type_expr)) =

  assert(not (is_Tunivar typ));

    if List.mem_assoc type_poly.tid substituion then

    begin

      (try

        assert(check_type_equal (List.assoc type_poly.tid substituion) typ)

      with

        Not_found -> assert false);

    end

    (* If type_poly is not in the subsitution *)

    else

      (* We add it to the substituion *)

      (type_poly.tid, typ)::substituion

  (* iftype_poly is not polymorphic *)

  else

  begin

    assert(check_type_equal type_poly typ);

    substituion

  end

(** Check that two calls are equal. A call is

  a pair of list of types, the inputs and the outputs.

   @param calls a list of pair of list of types

   @param return true if the two pairs are equal

**)

  (List.for_all2 check_type_equal i1 i2)

    && (List.for_all2 check_type_equal i1 i2)

(** Check that all the elements of list of calls are equal to one.

  A call is a pair of list of types, the inputs and the outputs.

   @param call a pair of list of types

   @param calls a list of pair of list of types

   @param return true if all the elements are equal

**)

let check_calls call calls =

  List.for_all (check_call_equal call) calls

    the step calls and extract a substitution for all polymorphic type from

    it.

   @param machine the machine which instantiate the subinstance

   @param ident the identifier of the instance which permits to find the step call

   @param submachine the machine corresponding to the subinstance

   @return the correspondance between polymorphic type id and their instantiation

**)

  (* extract the first call  *)

  let call = match calls with

              (* assume that there is always one call to a subinstance *)

              | []    -> assert(false)

              | h::_  -> h in

  assert(check_calls call calls);

  let call_types = (fst call)@(snd call) in

  let machine_vars = submachine.mstep.step_inputs@submachine.mstep.step_outputs in

  let machine_types = List.map (function x-> x.var_type) machine_vars in

      and the call *)

  let substitution = List.fold_left unification [] (List.combine machine_types call_types) in

  (* Assume that our substitution match all the possible

       polymorphic type of the node *)

    assert (List.for_all (fun x -> List.mem_assoc x substitution) polymorphic_types)

  with

    Not_found -> assert false);

(** Extract from a machine the instance corresponding to the identifier,

      assume that the identifier exists in the instances of the machine.

   @param identifier the instance identifier

   @param machine a machine

   @return the instance of machine.minstances corresponding to identifier

**)

  try

    List.assoc identifier typed_submachines

  with Not_found -> assert false

let pp_type_debug fmt typ = 

  (match (Types.repr typ).Types.tdesc with

    | Types.Tbasic Types.Basic.Tint  -> Format.fprintf fmt "INTEGER"

    | Types.Tbasic Types.Basic.Treal -> Format.fprintf fmt "FLOAT"

    | Types.Tbasic Types.Basic.Tbool -> Format.fprintf fmt "BOOLEAN"

    | Types.Tunivar                  -> Format.fprintf fmt "POLY(%i)" typ.Types.tid

    | _ -> assert false

  )

  let neg = c1=tag_false in

  let other = match tl with

    | []         -> None

    | [(_, i2)]  -> Some i2

    | _          -> assert false

    | true, Some x -> (false, g, x, Some i1)

    | _ ->

  (neg, g, i1, other)

  | [] -> []

  | instr::q ->

    (

      match get_instr_desc instr with

        | MBranch (g, (c1, i1)::tl) when c1=tag_false || c1=tag_true ->

            let (_, g, instrs1, instrs2) = build_if g c1 i1 tl in

            let instrs1_pushed = push_if_in_expr instrs1 in

            let get_assign instr = match get_instr_desc instr with

              | MLocalAssign (id, value) -> (false, id, value)

              | MStateAssign (id, value) -> (true, id, value)

              | _ -> assert false

            in

            let gen_eq ident state value1 value2 =

              assert(check_type_equal ident.var_type value1.value_type);

              assert(check_type_equal ident.var_type value2.value_type);

              let value = {

                            value_desc   = Fun ("ite", [g;value1;value2]);

                            value_type   = ident.var_type;

                            value_annot  = None

                          }

              in

              let assign = if state then MStateAssign (ident, value) else MLocalAssign (ident, value) in

              { instr_desc = assign;

                lustre_eq  = None;

                instr_spec = []

              }

            in

            let mkval_var id = {

              value_desc   = Var id;

              value_type   = id.var_type;

              value_annot  = None

            }

            in

            let rec find_split s1 id1 accu = function

              | [] -> [], accu, mkval_var id1

              | (s2, id2, v2)::q when s1 = s2

                                  && id1.var_id = id2.var_id -> accu, q, v2

              | t::q -> find_split s1 id1 (t::accu) q

            in

            let gen_from_else l =

              List.map

                (fun (s2, id2, v2) -> gen_eq id2 s2 (mkval_var id2) v2)

                l

            in

            let rec gen_assigns if_assigns else_assigns =

              let res, accu_else = match if_assigns with

                | (s1, id1, v1)::q ->

                  let accu, remain, v2 = find_split s1 id1 [] else_assigns in

                  (gen_eq id1 s1 v1 v2)::(gen_assigns q remain), accu

                | [] -> [], else_assigns

              in

              (gen_from_else accu_else)@res

            in

            let if_assigns = List.map get_assign instrs1_pushed in

            let else_assigns = match instrs2 with

              | None -> []

              | Some instrs2 -> 

                  let instrs2_pushed = push_if_in_expr instrs2 in

                  List.map get_assign instrs2_pushed

            in

            gen_assigns if_assigns else_assigns

        | _ -> [instr]

      )@(push_if_in_expr q)