Project

General

Profile

Download (13.2 KB) Statistics
| Branch: | Tag: | Revision:
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 Graph
13

    
14
type rat = int*int
15
type ident = string
16
type tag = int
17
type longident = (string * tag) list
18

    
19
exception TransposeError of int*int
20

    
21
(** General utility functions. *)
22
let create_hashtable size init =
23
  let tbl = Hashtbl.create size in
24
  List.iter (fun (key, data) -> Hashtbl.add tbl key data) init;
25
  tbl
26

    
27
module IdentModule =
28
struct (* Node module *)
29
  type t = ident
30
  let compare = compare
31
  let hash n = Hashtbl.hash n
32
  let equal n1 n2 = n1 = n2
33
end
34

    
35
module IMap = struct
36
  include Map.Make(IdentModule)
37
  let union_l m1 m2 =
38
    merge (fun _ o1 o2 -> match o1, o2 with
39
        | None, None -> None
40
        | Some _, _ -> o1
41
        | _, Some _ -> o2) m1 m2
42
end
43

    
44
module ISet = Set.Make(IdentModule)
45
module IdentDepGraph = Imperative.Digraph.ConcreteBidirectional (IdentModule)
46
module TopologicalDepGraph = Topological.Make(IdentDepGraph)
47
module ComponentsDepGraph = Components.Make(IdentDepGraph) 
48
                           
49
(*module DotGraph = Graphviz.Dot (IdentDepGraph)*)
50
module Bfs = Traverse.Bfs (IdentDepGraph)
51

    
52
            
53
exception DeSome
54
let desome x = match x with Some x -> x | None -> raise DeSome
55

    
56
let option_map f o =
57
  match o with
58
  | None   -> None
59
  | Some e -> Some (f e)
60

    
61
let add_cons x l =
62
 if List.mem x l then l else x::l
63

    
64
let rec remove_duplicates l =
65
 match l with
66
 | [] -> []
67
 | t::q -> add_cons t (remove_duplicates q)
68

    
69
let position pred l =
70
  let rec pos p l =
71
    match l with
72
    | [] -> assert false
73
    | t::q -> if pred t then p else pos (p+1) q
74
  in pos 0 l
75

    
76
(* TODO: Lélio: why n+1? cf former def below *)
77
(* if n < 0 then [] else x :: duplicate x (n - 1) *)
78
let duplicate x n = List.init (n+1) (fun _ -> x)
79

    
80
let enumerate n = List.init n (fun i -> i)
81

    
82
let rec repeat n f x =
83
 if n <= 0 then x else repeat (n-1) f (f x)
84

    
85
let transpose_list ll =
86
  let rec transpose ll =
87
    match ll with
88
    | []   -> []
89
    | [l]  -> List.map (fun el -> [el]) l
90
    | l::q -> List.map2 (fun el eq -> el::eq) l (transpose q)
91
  in match ll with
92
  | []   -> []
93
  | l::q -> let length_l = List.length l in
94
    List.iter (fun l' -> let length_l' = List.length l'
95
                in if length_l <> length_l' then raise (TransposeError (length_l, length_l'))) q;
96
    transpose ll
97

    
98
let rec filter_upto p n l =
99
 if n = 0 then [] else
100
 match l with
101
 | [] -> []
102
 | t::q -> if p t then t :: filter_upto p (n-1) q else filter_upto p n q
103

    
104
(* Warning: bad complexity *)
105
let list_of_imap imap =
106
  IMap.fold (fun i v (il,vl) -> (i::il,v::vl)) imap ([],[])
107

    
108
(** [gcd a b] returns the greatest common divisor of [a] and [b]. *)
109
let rec gcd a b =
110
  if b = 0 then a
111
  else gcd b (a mod b)
112

    
113
(** [lcm a b] returns the least common multiple of [a] and [b]. *)
114
let lcm a b =
115
  if a = 0 && b = 0 then
116
    0
117
  else a*b/(gcd a b)
118

    
119
(** [sum_rat (a,b) (a',b')] returns the sum of rationals [(a,b)] and
120
    [(a',b')] *)
121
let sum_rat (a,b) (a',b') =
122
  if a = 0 && b = 0 then
123
    (a',b')
124
  else if a'=0 && b'=0 then
125
    (a,b)
126
  else
127
    let lcm_bb' = lcm b b' in
128
    (a*lcm_bb'/b+a'*lcm_bb'/b',lcm_bb')
129

    
130
let simplify_rat (a,b) =
131
  let gcd = gcd a b in
132
  if (gcd =0) then
133
    (a,b)
134
  else (a/gcd,b/gcd)
135

    
136
let max_rat (a,b) (a',b') =
137
  let ratio_ab = (float_of_int a)/.(float_of_int b) in
138
  let ratio_ab' = (float_of_int a')/.(float_of_int b') in
139
  if ratio_ab > ratio_ab' then
140
    (a,b)
141
  else
142
    (a',b')
143

    
144
(** [list_union l1 l2] returns the union of list [l1] and [l2]. The
145
    result contains no duplicates. *)
146
let list_union l1 l2 =
147
  let rec aux l acc =
148
    match l with
149
    | [] -> acc
150
    | x::tl ->
151
        if List.mem x acc then
152
          aux tl acc
153
        else
154
          aux tl (x::acc)
155
  in
156
  let l1' = aux l1 [] in
157
  aux l2 l1'
158

    
159
(** [hashtbl_add h1 h2] adds all the bindings in [h2] to [h1]. If the
160
    intersection is not empty, it replaces the former binding *)
161
let hashtbl_add h1 h2 =
162
  Hashtbl.iter (fun key value -> Hashtbl.replace h1 key value) h2
163

    
164
let hashtbl_iterlast h f1 f2 =
165
  let l = Hashtbl.length h in
166
  ignore(
167
  Hashtbl.fold
168
    (fun k v cpt ->
169
      if cpt = l then
170
        begin f2 k v; cpt+1 end
171
      else
172
        begin f1 k v; cpt+1 end)
173
    h 1)
174

    
175
(** Match types variables to 'a, 'b, ..., for pretty-printing. Type
176
    variables are identified by integers. *)
177
let tnames = ref ([]: (int * string) list)
178
let tname_counter = ref 0
179
(* Same for carriers *)
180
let crnames = ref ([]: (int * string) list)
181
let crname_counter = ref 0
182
(* Same for dimension *)
183
let dnames = ref ([]: (int * string) list)
184
let dname_counter = ref 0
185
(* Same for delays *)
186
let inames = ref ([]: (int * string) list)
187
let iname_counter = ref 0
188

    
189
let reset_names () =
190
  tnames := [];
191
  tname_counter := 0;
192
  crnames := [];
193
  crname_counter := 0;
194
  dnames := [];
195
  dname_counter := 0;
196
  inames := [];
197
  iname_counter := 0
198

    
199
(* From OCaml compiler *)
200
let new_tname () =
201
  let tname =
202
    if !tname_counter < 26
203
    then String.make 1 (Char.chr(97 + !tname_counter))
204
    else String.make 1 (Char.chr(97 + !tname_counter mod 26)) ^
205
      string_of_int(!tname_counter / 26) in
206
  incr tname_counter;
207
  tname
208

    
209
let new_crname () =
210
  incr crname_counter;
211
  Format.sprintf "c%i" (!crname_counter-1)
212

    
213
let name_of_type id =
214
  try List.assoc id !tnames with Not_found ->
215
    let name = new_tname () in
216
    tnames := (id, name) :: !tnames;
217
    name
218

    
219
let name_of_carrier id =
220
  let pp_id =
221
    try List.assoc id !crnames with Not_found ->
222
      let name = new_crname () in
223
      crnames := (id,name) :: !crnames;
224
      name
225
  in
226
  pp_id
227

    
228
let new_dname () =
229
  incr dname_counter;
230
  Format.sprintf "d%i" (!dname_counter-1)
231

    
232
let name_of_dimension id =
233
  try List.assoc id !dnames with Not_found ->
234
    let name = new_dname () in
235
    dnames := (id, name) :: !dnames;
236
    name
237

    
238
let new_iname () =
239
  incr iname_counter;
240
  Format.sprintf "t%i" (!iname_counter-1)
241

    
242
let name_of_delay id =
243
  try List.assoc id !inames with Not_found ->
244
    let name = new_iname () in
245
    inames := (id, name) :: !inames;
246
    name
247

    
248
open Format
249

    
250
let print_rat fmt (a,b) =
251
  if b=1 then
252
    Format.fprintf fmt "%i" a
253
  else
254
    if b < 0 then
255
      Format.fprintf fmt "%i/%i" (-a) (-b)
256
    else
257
      Format.fprintf fmt "%i/%i" a b
258
	
259

    
260
(* Generic pretty printing *)
261

    
262

    
263
let pp_final_char_if_non_empty c l =
264
  (fun fmt -> match l with [] -> () | _ -> Format.fprintf fmt "%(%)" c)
265

    
266
let pp_newline_if_non_empty l =
267
  (fun fmt -> match l with [] -> () | _ -> Format.fprintf fmt "@,")
268

    
269
module Format = struct
270
  include Format
271
  open Format
272

    
273
  let with_out_file file f =
274
    let oc = open_out file in
275
    let fmt = formatter_of_out_channel oc in
276
    f fmt;
277
    close_out oc
278

    
279
  let pp_print_nothing _fmt _ = ()
280

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

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

    
285
  let pp_print_opar fmt () = pp_print_string fmt "("
286
  let pp_print_cpar fmt () = pp_print_string fmt ")"
287
  let pp_print_obracket fmt () = pp_print_string fmt "["
288
  let pp_print_cbracket fmt () = pp_print_string fmt "]"
289
  let pp_print_obrace fmt () = pp_print_string fmt "{"
290
  let pp_print_cbrace fmt () = pp_print_string fmt "}"
291
  let pp_print_opar' fmt () = pp_print_string fmt "( "
292
  let pp_print_cpar' fmt () = pp_print_string fmt " )"
293
  let pp_print_obrace' fmt () = pp_print_string fmt "{ "
294
  let pp_print_cbrace' fmt () = pp_print_string fmt " }"
295

    
296
  let pp_print_comma fmt () = fprintf fmt ",@ "
297
  let pp_print_semicolon fmt () = fprintf fmt ";@ "
298
  let pp_print_comma' fmt () = fprintf fmt ","
299
  let pp_print_semicolon' fmt () = fprintf fmt ";"
300

    
301
  let pp_open_vbox0 fmt () = pp_open_vbox fmt 0
302

    
303
  let pp_print_list
304
      ?(pp_prologue=pp_print_nothing) ?(pp_epilogue=pp_print_nothing)
305
      ?(pp_op=pp_print_nothing) ?(pp_cl=pp_print_nothing)
306
      ?(pp_open_box=fun fmt () -> pp_open_box fmt 0)
307
      ?(pp_eol=pp_print_nothing)
308
      ?(pp_nil=pp_print_nothing)
309
      ?pp_sep pp_v fmt l =
310
    fprintf fmt "%a%a%a%a%a@]%a%a"
311
      (fun fmt l -> if l <> [] then pp_prologue fmt ()) l
312
      pp_op ()
313
      pp_open_box ()
314
      (fun fmt () ->
315
         if l = [] then pp_nil fmt () else pp_print_list ?pp_sep pp_v fmt l) ()
316
      (fun fmt l -> if l <> [] then pp_eol fmt ()) l
317
      pp_cl ()
318
      (fun fmt l -> if l <> [] then pp_epilogue fmt ()) l
319

    
320
  let pp_comma_list = pp_print_list ~pp_sep:pp_print_comma
321

    
322
  let pp_print_list_i
323
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
324
      pp_v =
325
    let i = ref 0 in
326
    pp_print_list
327
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
328
      (fun fmt x -> pp_v fmt !i x; incr i)
329

    
330
  let pp_print_list2
331
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
332
      pp_v fmt (l1, l2) =
333
    pp_print_list
334
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
335
      pp_v fmt (List.combine l1 l2)
336

    
337
  let pp_print_list_i2
338
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
339
      pp_v fmt (l1, l2) =
340
    pp_print_list_i
341
      ?pp_prologue ?pp_epilogue ?pp_op ?pp_cl ?pp_open_box ?pp_eol ?pp_sep
342
      (fun fmt i (x1, x2) -> pp_v fmt i x1 x2) fmt (List.combine l1 l2)
343

    
344
  let pp_print_parenthesized ?(pp_sep=pp_print_comma) =
345
    pp_print_list
346
      ~pp_op:pp_print_opar
347
      ~pp_cl:pp_print_cpar
348
      ~pp_sep
349

    
350
  let pp_print_bracketed ?(pp_sep=pp_print_comma) =
351
    pp_print_list
352
      ~pp_op:pp_print_obracket
353
      ~pp_cl:pp_print_cbracket
354
      ~pp_sep
355

    
356
  let pp_print_braced ?(pp_sep=pp_print_comma) =
357
    pp_print_list
358
      ~pp_op:pp_print_obrace
359
      ~pp_cl:pp_print_cbrace
360
      ~pp_sep
361

    
362
  let pp_print_braced' ?(pp_sep=pp_print_comma) =
363
    pp_print_list
364
      ~pp_op:pp_print_obrace'
365
      ~pp_cl:pp_print_cbrace'
366
      ~pp_sep
367
end
368

    
369
let fprintf_list ?(eol:('a, formatter, unit) format = "") ~sep:sep f fmt l =
370
  Format.(pp_print_list ~pp_sep:(fun fmt () -> fprintf fmt "%(%)" sep) f fmt l);
371
  if l <> [] then Format.fprintf fmt "%(%)" eol
372

    
373
let pp_list l pp_fun beg_str end_str sep_str =
374
  if (beg_str="\n") then
375
    print_newline ()
376
  else
377
    print_string beg_str;
378
  let rec pp_l l =
379
    match l with
380
    | [] -> ()
381
    | [hd] -> 
382
        pp_fun hd
383
    | hd::tl ->
384
        pp_fun hd;
385
        if (sep_str="\n") then
386
          print_newline ()
387
        else
388
          print_string sep_str;
389
        pp_l tl
390
  in
391
  pp_l l;
392
  if (end_str="\n") then
393
    print_newline ()
394
  else
395
    print_string end_str
396

    
397
let pp_array a pp_fun beg_str end_str sep_str =
398
  if (beg_str="\n") then
399
    print_newline ()
400
  else
401
    print_string beg_str;
402
  let n = Array.length a in
403
  if n > 0 then
404
    begin
405
      Array.iter (fun x -> pp_fun x; print_string sep_str) (Array.sub a 0 (n-1));
406
      pp_fun a.(n-1)
407
    end;
408
  if (end_str="\n") then
409
    print_newline ()
410
  else
411
    print_string end_str
412

    
413
let pp_iset fmt t =
414
  Format.fprintf fmt "@[<hv 0>@[<hv 2>{";
415
  ISet.iter (fun s -> Format.fprintf fmt "@ %s" s) t;
416
  Format.fprintf fmt "@]@ }@]"
417

    
418
let pp_imap ?(comment="") pp_val fmt m =
419
  Format.fprintf fmt "@[<hv 0>@[<hv 2>{ %s" comment;
420
  IMap.iter (fun key v -> Format.fprintf fmt "@ %s -> %a" key pp_val v) m;
421
  Format.fprintf fmt "@]@ }@]"
422

    
423
let pp_hashtbl t pp_fun beg_str end_str sep_str =
424
  if (beg_str="\n") then
425
    print_newline ()
426
  else
427
    print_string beg_str;
428
  let pp_fun1 k v =
429
    pp_fun k v;
430
    if (sep_str="\n") then
431
      print_newline ()
432
    else
433
      print_string sep_str
434
  in
435
  hashtbl_iterlast t pp_fun1 pp_fun;
436
  if (end_str="\n") then
437
    print_newline ()
438
  else
439
    print_string end_str
440

    
441
let pp_longident lid =
442
  let pp_fun (nid, tag) =
443
    print_string nid;
444
    print_string "(";
445
    print_int tag;
446
    print_string ")"
447
  in
448
  pp_list lid pp_fun "" "." "."  
449

    
450
let pp_date fmt tm =
451
  let open Unix in
452
  Format.fprintf fmt "%i/%i/%i, %02i:%02i:%02i"
453
    (tm.tm_year + 1900)
454
    tm.tm_mon
455
    tm.tm_mday
456
    tm.tm_hour
457
    tm.tm_min
458
    tm.tm_sec
459

    
460
(* Used for uid in variables *)
461

    
462
let get_new_id =
463
  let var_id_cpt = ref 0 in
464
  fun () -> incr var_id_cpt; !var_id_cpt
465

    
466
let new_tag =
467
  let last_tag = ref (-1) in
468
  fun () -> incr last_tag; !last_tag
469

    
470

    
471
module List = struct
472
  include List 
473
  let iteri2 f l1 l2 =
474
    if List.length l1 <> List.length l2 then
475
      raise (Invalid_argument "iteri2: lists have different lengths")
476
    else
477
      let rec run idx l1 l2 =
478
        match l1, l2 with
479
        | [], [] -> ()
480
        | hd1::tl1, hd2::tl2 ->
481
          f idx hd1 hd2;
482
          run (idx+1) tl1 tl2
483
        | _ -> assert false
484
      in
485
      run 0 l1 l2
486

    
487
  let rec extract l fst last =
488
    if last < fst then assert false else
489
      match l, fst with
490
      | hd::tl, 0 -> if last = 0 then [] else hd::(extract tl 0 (last-1))
491
      | _::tl, _ -> extract tl (fst-1) (last-1)
492
      | [], 0 -> if last=0 then [] else assert false (* List too short *)
493
      | _ -> assert false 
494

    
495
end
496

    
497
let get_date () =
498
  let tm = Unix.localtime (Unix.time ()) in 
499
  let fmt = Format.str_formatter in
500
  pp_date fmt tm;
501
  Format.flush_str_formatter ()
502

    
503
(* Local Variables: *)
504
(* compile-command:"make -C .." *)
505
(* End: *)
(7-7/7)