CristalCaveGem » LustreC

(********************************************************************)

(*                                                                  *)

(*  The LustreC compiler toolset   /  The LustreC Development Team  *)

(*  Copyright 2012 -    --   ONERA - CNRS - INPT                    *)

(*                                                                  *)

(*  LustreC is free software, distributed WITHOUT ANY WARRANTY      *)

(*  under the terms of the GNU Lesser General Public License        *)

(*  version 2.1.                                                    *)

(*                                                                  *)

(********************************************************************)

let create_hashtable size init =

  let tbl = Hashtbl.create size in

  List.iter (fun (key, data) -> Hashtbl.add tbl key data) init;

  tbl

  (* Node module *)

end

      (fun _ o1 o2 ->

        match o1, o2 with

        | None, None ->

          None

        | Some _, _ ->

          o1

        | _, Some _ ->

          o2)

      m1 m2

module ComponentsDepGraph = Components.Make (IdentDepGraph)

module Bfs = Traverse.Bfs (IdentDepGraph)

  let rec pos p l =

    match l with

      assert false

    | t :: q ->

      if pred t then p else pos (p + 1) q

  in

  pos 0 l

(* if n < 0 then [] else x :: duplicate x (n - 1) *)

  let rec transpose ll =

    match ll with

      []

    | [ l ] ->

      List.map (fun el -> [ el ]) l

    | l :: q ->

      List.map2 (fun el eq -> el :: eq) l (transpose q)

  in

  match ll with

  | [] ->

    []

  | l :: q ->

    let length_l = List.length l in

    List.iter

      (fun l' ->

        let length_l' = List.length l' in

        if length_l <> length_l' then

          raise (TransposeError (length_l, length_l')))

      q;

let rec filter_upto p n l =

  else

    match l with

    | [] ->

      []

    | t :: q ->

      if p t then t :: filter_upto p (n - 1) q else filter_upto p n q

(* Warning: bad complexity *)

let list_of_imap imap =

(** [gcd a b] returns the greatest common divisor of [a] and [b]. *)

(** [lcm a b] returns the least common multiple of [a] and [b]. *)

(** [sum_rat (a,b) (a',b')] returns the sum of rationals [(a,b)] and [(a',b')] *)

let sum_rat (a, b) (a', b') =

  if a = 0 && b = 0 then a', b'

  else if a' = 0 && b' = 0 then a, b

    let lcm_bb' = lcm b b' in

  let ratio_ab = float_of_int a /. float_of_int b in

  let ratio_ab' = float_of_int a' /. float_of_int b' in

  if ratio_ab > ratio_ab' then a, b else a', b'

(** [list_union l1 l2] returns the union of list [l1] and [l2]. The result

    contains no duplicates. *)

  let rec aux l acc =

    match l with

      acc

    | x :: tl ->

      if List.mem x acc then aux tl acc else aux tl (x :: acc)

  let l1' = aux l1 [] in

  aux l2 l1'

(** [hashtbl_add h1 h2] adds all the bindings in [h2] to [h1]. If the

    intersection is not empty, it replaces the former binding *)

let hashtbl_add h1 h2 =

  Hashtbl.iter (fun key value -> Hashtbl.replace h1 key value) h2

let hashtbl_iterlast h f1 f2 =

  let l = Hashtbl.length h in

    (Hashtbl.fold

       (fun k v cpt ->

         if cpt = l then (

           f2 k v;

           cpt + 1)

         else (

           f1 k v;

           cpt + 1))

       h 1)

(** Match types variables to 'a, 'b, ..., for pretty-printing. Type variables

    are identified by integers. *)

let tnames = ref ([] : (int * string) list)

let reset_names () =

  tname_counter := 0;

  crnames := [];

  crname_counter := 0;

  dnames := [];

  dname_counter := 0;

  inames := [];

  iname_counter := 0

(* From OCaml compiler *)

let new_tname () =

  let tname =

    else

      String.make 1 (Char.chr (97 + (!tname_counter mod 26)))

      ^ string_of_int (!tname_counter / 26)

  in

  tname

let new_crname () =

  incr crname_counter;

let name_of_type id =

  with Not_found ->

    tnames := (id, name) :: !tnames;

    name

let name_of_carrier id =

  let pp_id =

    with Not_found ->

  in

  pp_id

let new_dname () =

  incr dname_counter;

let name_of_dimension id =

  with Not_found ->

    dnames := (id, name) :: !dnames;

    name

let new_iname () =

  incr iname_counter;

let name_of_delay id =

  with Not_found ->

    inames := (id, name) :: !inames;

    name

open Format

  if b = 1 then Format.fprintf fmt "%i" a

  else if b < 0 then Format.fprintf fmt "%i/%i" (-a) (-b)

  else Format.fprintf fmt "%i/%i" a b

(* Generic pretty printing *)

  match l with [] -> () | _ -> Format.fprintf fmt "%(%)" c

  match l with [] -> () | _ -> Format.fprintf fmt "@,"

  include Format

  open Format

  let with_out_file file f =

    let oc = open_out file in

    let fmt = formatter_of_out_channel oc in

    f fmt;

    close_out oc

  let pp_print_nothing _fmt _ = ()

  let pp_print_cutcut fmt () = fprintf fmt "@,@,"

  let pp_print_endcut s fmt () = fprintf fmt "%s@," s

  let pp_print_opar fmt () = pp_print_string fmt "("

  let pp_print_comma fmt () = fprintf fmt ",@ "

  let pp_open_vbox0 fmt () = pp_open_vbox fmt 0

      ?(pp_epilogue = pp_print_nothing) ?(pp_op = pp_print_nothing)

      ?(pp_cl = pp_print_nothing)

      ?(pp_open_box = fun fmt () -> pp_open_box fmt 0)

      ?(pp_eol = pp_print_nothing) ?(pp_nil = pp_print_nothing) ?pp_sep pp_v fmt

      l =

      l pp_op () pp_open_box ()

      ()

      (fun fmt l -> if l <> [] then pp_eol fmt ())

      l pp_cl ()

      (fun fmt l -> if l <> [] then pp_epilogue fmt ())

      l

      ?pp_eol ?pp_sep pp_v =

      ?pp_sep (fun fmt x ->

        pp_v fmt !i x;

        incr i)

  let pp_print_list2 ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box

      ?pp_eol ?pp_sep pp_v fmt (l1, l2) =

    pp_print_list ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol

      ?pp_sep pp_v fmt (List.combine l1 l2)

  let pp_print_list_i2 ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box

      ?pp_eol ?pp_sep pp_v fmt (l1, l2) =

    pp_print_list_i ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol

      ?pp_sep

      (fun fmt i (x1, x2) -> pp_v fmt i x1 x2)

      fmt (List.combine l1 l2)

  let pp_print_parenthesized ?(pp_sep = pp_print_comma) =

    pp_print_list ~pp_op:pp_print_opar ~pp_cl:pp_print_cpar ~pp_sep

  let pp_print_bracketed ?(pp_sep = pp_print_comma) =

    pp_print_list ~pp_op:pp_print_obracket ~pp_cl:pp_print_cbracket ~pp_sep

  let pp_print_braced ?(pp_sep = pp_print_comma) =

    pp_print_list ~pp_op:pp_print_obrace ~pp_cl:pp_print_cbrace ~pp_sep

  let pp_print_braced' ?(pp_sep = pp_print_comma) =

    pp_print_list ~pp_op:pp_print_obrace' ~pp_cl:pp_print_cbrace' ~pp_sep

  if l <> [] then Format.fprintf fmt "%(%)" eol

    match l with

      ()

    | [ hd ] ->

      pp_fun hd

    | hd :: tl ->

      pp_fun hd;

      if sep_str = "\n" then print_newline () else print_string sep_str;

      pp_l tl

  pp_l l;

let pp_array a pp_fun beg_str end_str sep_str =

    Array.iter

      (fun x ->

        pp_fun x;

        print_string sep_str)

      (Array.sub a 0 (n - 1));

    pp_fun a.(n - 1));

  if end_str = "\n" then print_newline () else print_string end_str

  ISet.iter (fun s -> Format.fprintf fmt "@ %s" s) t;

  Format.fprintf fmt "@]@ }@]"

  IMap.iter (fun key v -> Format.fprintf fmt "@ %s -> %a" key pp_val v) m;

  Format.fprintf fmt "@]@ }@]"

    pp_fun k v;

  hashtbl_iterlast t pp_fun1 pp_fun;

let pp_longident lid =

  let pp_fun (nid, tag) =

    print_string nid;

    print_string "(";

    print_int tag;

    print_string ")"

  in

    tm.tm_mday tm.tm_hour tm.tm_min tm.tm_sec

(* Used for uid in variables *)

  let var_id_cpt = ref 0 in

    incr var_id_cpt;

    !var_id_cpt

  let last_tag = ref (-1) in

    incr last_tag;

    !last_tag

    if List.length l1 <> List.length l2 then

      raise (Invalid_argument "iteri2: lists have different lengths")

    else

      let rec run idx l1 l2 =

          ()

        | hd1 :: tl1, hd2 :: tl2 ->

        | _ ->

          assert false

      run 0 l1 l2

  let rec extract l fst last =

    else

        if last = 0 then [] else hd :: extract tl 0 (last - 1)

      | _ :: tl, _ ->

        extract tl (fst - 1) (last - 1)

      | [], 0 ->

        if last = 0 then [] else assert false (* List too short *)

      | _ ->

        assert false

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

(* End: *)