cprinter.ml 25.2 KB
Newer Older
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
1
open Ident
2

3 4
exception Unsupported of string

Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
5
module C = struct
6

Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
7 8
  type ty =
    | Tvoid
9
    | Tsyntax of string * ty list
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
10 11 12 13 14
    | Tptr of ty
    | Tarray of ty * expr
    | Tstruct of ident * (ident * ty) list
    | Tunion of ident * (ident * ty) list
    | Tnamed of ident (* alias from typedef *)
15
    | Tnosyntax (* types that do not have a syntax, can't be printed *)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
    (* enum, const could be added *)

  (* int x=2, *y ... *)
  and names = ty * (ident * expr) list

  (* names with a single declaration *)
  and name = ty * ident * expr

  (* return type, parameter list. Variadic functions not handled. *)
  and proto = ty * (ty * ident) list

  and binop = Band | Bor | Beq | Bne | Bassign (* += and co. maybe to add *)

  and unop = Unot | Ustar | Uaddr (* (pre|post)(incr|decr) maybe to add *)

  and expr =
    | Enothing
    | Eunop of unop * expr
    | Ebinop of binop * expr * expr
35
    | Equestion of expr * expr * expr (* c ? t : e *)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
36 37 38
    | Ecast of ty * expr
    | Ecall of expr * expr list
    | Econst of constant
39
    | Evar of ident
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
40 41 42
    | Esize_expr of expr
    | Esize_type of ty
    | Eindex of expr * expr (* Array access *)
43 44
    | Edot of expr * ident (* Field access with dot *)
    | Earrow of expr * ident (* Pointer access with arrow *)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
45 46 47
    | Esyntax of string * ty * (ty array) * (expr*ty) list * bool
  (* template, type and type arguments of result, typed arguments,
     is/is not converter*)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

  and constant =
    | Cint of string
    | Cfloat of string
    | Cchar of string
    | Cstring of string

  type stmt =
    | Snop
    | Sexpr of expr
    | Sblock of body
    | Sseq of stmt * stmt
    | Sif of expr * stmt * stmt
    | Swhile of expr * stmt
    | Sfor of expr * expr * expr * stmt
    | Sbreak
    | Sreturn of expr

  and definition =
67
    | Dfun of ident * proto * body
68
    | Dinclude of ident
69
    | Dproto of ident * proto
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
70 71 72 73 74 75 76
    | Ddecl of names
    | Dtypedef of ty * ident

  and body = definition list * stmt

  type file = definition list

77 78
  exception NotAValue

79 80 81 82 83 84 85 86 87 88 89 90 91
  let rec is_nop = function
    | Snop -> true
    | Sblock ([], s) -> is_nop s
    | Sseq (s1,s2) -> is_nop s1 && is_nop s2
    | _ -> false

  let rec one_stmt = function
    | Snop -> true
    | Sexpr _ -> true
    | Sblock (d,s) -> d = [] && one_stmt s
    | _ -> false

  (** [assignify id] transforms a statement that computes a value into
92
     a statement that assigns that value to id *)
93 94
  let rec assignify id = function
    | Snop -> raise NotAValue
95 96
    | Sexpr e -> Sexpr (Ebinop (Bassign, Evar id, e))
    | Sblock (ds, s) -> Sblock (ds, assignify id s)
97 98
    | Sseq (s1, s2) when not (is_nop s2) -> Sseq (s1, assignify id s2)
    | Sseq (s1,_) -> assignify id s1
99 100 101 102 103 104
    | Sif (c,t,e) -> Sif (c, assignify id t, assignify id e)
    | Swhile (c,s) -> Swhile (c, assignify id s) (* can this be a value ?*)
    | Sfor (e0,e1,e2,s) -> Sfor (e0,e1,e2, assignify id s)
    | Sbreak -> raise NotAValue
    | Sreturn _ -> raise NotAValue

105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128

  (** [get_last_expr] extracts the expression computed by the given statement.
     This is needed when loop conditions are more complex than a simple expression. *)
  let rec get_last_expr = function
    | Snop -> raise NotAValue
    | Sexpr e -> Snop, e
    | Sblock (ds,s) ->
      let s',e = get_last_expr s in
      Sblock(ds,s'), e
    | Sseq (s1,s2) when not (is_nop s2) ->
      let s', e = get_last_expr s2 in
      Sseq(s1,s'), e
    | Sseq (s1,_) -> get_last_expr s1
    | Sif (c,Sexpr t,Sexpr e) -> Snop, Equestion(c,t,e)
    | Sif _ -> raise (Unsupported "while (complex if)")
    | Swhile (_c,_s) -> raise (Unsupported "while (while) {}")
    | Sfor _ -> raise (Unsupported "while (for)")
    | Sbreak -> raise NotAValue
    | Sreturn _ -> raise NotAValue

  (** [propagate_in_expr id v] and the associated functions replace
      all instances of [id] by [v] in an
      expression/statement/definition/block. It is used for constant
      propagation to reduce the number of variables. *)
129 130 131 132 133 134 135
  let rec propagate_in_expr id (v:expr) = function
    | Evar i when Ident.id_equal i id -> v
    | Evar i -> Evar i
    | Eunop (u,e) -> Eunop (u, propagate_in_expr id v e)
    | Ebinop (b,e1,e2) -> Ebinop (b,
                                  propagate_in_expr id v e1,
                                  propagate_in_expr id v e2)
136 137 138
    | Equestion (c,t,e) -> Equestion(propagate_in_expr id v c,
                                     propagate_in_expr id v t,
                                     propagate_in_expr id v e)
139 140 141 142 143 144 145 146
    | Ecast (ty,e) -> Ecast (ty, propagate_in_expr id v e)
    | Ecall (e, l) -> Ecall (propagate_in_expr id v e,
                             List.map (propagate_in_expr id v) l)
    | Esize_expr e -> Esize_expr (propagate_in_expr id v e)
    | Eindex (e1,e2) -> Eindex (propagate_in_expr id v e1,
                                propagate_in_expr id v e2)
    | Edot (e,i) -> Edot (propagate_in_expr id v e, i)
    | Earrow (e,i) -> Earrow (propagate_in_expr id v e, i)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
147 148
    | Esyntax (s,t,ta,l,b) ->
      Esyntax (s,t,ta,List.map (fun (e,t) -> (propagate_in_expr id v e),t) l,b)
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
    | Enothing -> Enothing
    | Econst c -> Econst c
    | Esize_type ty -> Esize_type ty

  let rec propagate_in_stmt id v = function
    | Sexpr e -> Sexpr (propagate_in_expr id v e)
    | Sblock b -> Sblock(propagate_in_block id v b)
    | Sseq (s1,s2) -> Sseq (propagate_in_stmt id v s1,
                            propagate_in_stmt id v s2)
    | Sif (e,s1,s2) -> Sif (propagate_in_expr id v e,
                            propagate_in_stmt id v s1,
                            propagate_in_stmt id v s2)
    | Swhile (e, s) -> Swhile (propagate_in_expr id v e,
                               propagate_in_stmt id v s)
    | Sfor (e1,e2,e3,s) -> Sfor (propagate_in_expr id v e1,
                                 propagate_in_expr id v e2,
                                 propagate_in_expr id v e3,
                                 propagate_in_stmt id v s)
    | Sreturn e -> Sreturn (propagate_in_expr id v e)
    | Snop -> Snop
    | Sbreak -> Sbreak

  and propagate_in_def id v d =
    let rec aux = function
      | [] -> [], true
      | (i,e)::t ->
        if Ident.id_equal i id then (i,e)::t, false
        else let t,b = aux t in ((i,propagate_in_expr id v e)::t), b
    in
    match d with
    | Ddecl (ty,l) ->
      let l,b = aux l in
      Ddecl (ty, l), b
    | Dinclude i -> Dinclude i, true
    | Dfun _ -> raise (Unsupported "nested function")
184 185
    | Dtypedef _ -> raise (Unsupported "typedef inside function")
    | Dproto _ -> raise (Unsupported "prototype inside function")
186 187 188 189 190 191 192 193 194 195 196 197

  and propagate_in_block id v (dl, s) =
    let dl, b = List.fold_left
      (fun (dl, acc) d ->
        if acc
        then
          let d, b = propagate_in_def id v d in
          (d::dl, b)
        else (d::dl, false))
      ([],true) dl in
    (List.rev dl, if b then propagate_in_stmt id v s else s)

198 199
  let is_empty_block s = s = Sblock([], Snop)
  let block_of_expr e = [], Sexpr e
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
200

201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252
(** [flatten_defs d s] appends all definitions in the statement [s] to d. *)
  (* TODO check ident unicity ? *)
  let rec flatten_defs d = function
    | Sseq (s1,s2) ->
      let d, s1' = flatten_defs d s1 in
      let d, s2' = flatten_defs d s2 in
      d, Sseq(s1',s2')
    | Sblock (d',s) ->
      let d',s' = flatten_defs d' s in
      d@d', s'
    | Sif (c,t,e) ->
      let d, t' = flatten_defs d t in
      let d, e' = flatten_defs d e in
      d,Sif(c,t',e')
    | Swhile (c,s) ->
      let d, s' = flatten_defs d s in
      d, Swhile (c, s')
    | Sfor (e1,e2,e3,s) ->
      let d, s' = flatten_defs d s in
      d, Sfor(e1,e2,e3,s')
    | s -> d,s

  let rec elim_nop = function
    | Sseq (s1,s2) ->
      let s1 = elim_nop s1 in
      let s2 = elim_nop s2 in
      begin match s1,s2 with
      | Snop, Snop -> Snop
      | Snop, s | s, Snop -> s
      | _ -> Sseq(s1,s2)
      end
    | Sblock (d,s) ->
      let s = elim_nop s in
      begin match d, s with
      | [], Snop -> Snop
      | _ -> Sblock(d,s)
      end
    | Sif (c,t,e) -> Sif(c, elim_nop t, elim_nop e)
    | Swhile (c,s) -> Swhile (c, elim_nop s)
    | Sfor(e1,e2,e3,s) -> Sfor(e1,e2,e3,elim_nop s)
    | s -> s

  let rec add_to_last_call params = function
    | Sblock (d,s) -> Sblock (d, add_to_last_call params s)
    | Sseq (s1,s2) when not (is_nop s2) ->
      Sseq (s1, add_to_last_call params s2)
    | Sseq (s1,_) -> add_to_last_call params s1
    | Sexpr (Ecall(fname, args)) ->
      Sexpr (Ecall(fname, params@args)) (*change name to ensure no renaming ?*)
    | Sreturn (Ecall (fname, args)) ->
      Sreturn (Ecall(fname, params@args))
    | _ -> raise (Unsupported "tuple pattern matching with too complex def")
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
253

254 255 256 257 258 259 260 261 262 263 264
end

type info = Pdriver.printer_args = private {
  env         : Env.env;
  prelude     : Printer.prelude;
  thprelude   : Printer.prelude_map;
  blacklist   : Printer.blacklist;
  syntax      : Printer.syntax_map;
  converter   : Printer.syntax_map;
}

Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
module Print = struct

  open C
  open Format
  open Printer
  open Pp

  exception Unprinted of string

  let c_keywords = ["auto"; "break"; "case"; "char"; "const"; "continue"; "default"; "do"; "double"; "else"; "enum"; "extern"; "float"; "for"; "goto"; "if"; "int"; "long"; "register"; "return"; "short"; "signed"; "sizeof"; "static"; "struct"; "switch"; "typedef"; "union"; "unsigned"; "void"; "volatile"; "while" ]

  let () = assert (List.length c_keywords = 32)

  let sanitizer = sanitizer char_to_lalpha char_to_alnumus
  let printer = create_ident_printer c_keywords ~sanitizer

  let print_ident fmt id = fprintf fmt "%s" (id_unique printer id)

  let protect_on x s = if x then "(" ^^ s ^^ ")" else s

  let rec print_ty ?(paren=false) fmt = function
    | Tvoid -> fprintf fmt "void"
    | Tsyntax (s, tl) ->
      syntax_arguments
        (if paren then ("("^s^")") else s)
        (print_ty ~paren:false) fmt tl
    | Tptr ty -> fprintf fmt "(%a)*" (print_ty ~paren:true) ty
    | Tarray (ty, expr) ->
      fprintf fmt (protect_on paren "%a[%a]")
        (print_ty ~paren:true) ty (print_expr ~paren:false) expr
    | Tstruct _ -> raise (Unprinted "structs")
    | Tunion _ -> raise (Unprinted "unions")
    | Tnamed id -> print_ident fmt id
    | Tnosyntax -> raise (Unprinted "type without syntax")

  and print_unop fmt = function
    | Unot -> fprintf fmt "!"
    | Ustar -> fprintf fmt "*"
    | Uaddr -> fprintf fmt "&"

  and print_binop fmt = function
    | Band -> fprintf fmt "&&"
    | Bor -> fprintf fmt "||"
    | Beq -> fprintf fmt "=="
    | Bne -> fprintf fmt "!="
    | Bassign -> fprintf fmt "="

  and print_expr ~paren fmt = function
    | Enothing -> Format.printf "enothing"; ()
    | Eunop(u,e) -> fprintf fmt (protect_on paren "%a %a")
      print_unop u (print_expr ~paren:true) e
    | Ebinop(b,e1,e2) ->
      fprintf fmt (protect_on paren "%a %a %a")
        (print_expr ~paren:true) e1 print_binop b (print_expr ~paren:true) e2
319 320 321 322 323
    | Equestion(c,t,e) ->
      fprintf fmt (protect_on paren "%a ? %a : %a")
        (print_expr ~paren:true) c
        (print_expr ~paren:true) t
        (print_expr ~paren:true) e
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351
    | Ecast(ty, e) ->
      fprintf fmt (protect_on paren "(%a)%a")
        (print_ty ~paren:false) ty (print_expr ~paren:true) e
    | Ecall (e,l) -> fprintf fmt (protect_on paren "%a(%a)")
      (print_expr ~paren:true) e (print_list comma (print_expr ~paren:false)) l
    | Econst c -> print_const fmt c
    | Evar id -> print_ident fmt id
    | Esize_expr e ->
      fprintf fmt (protect_on paren "sizeof(%a)") (print_expr ~paren:false) e
    | Esize_type ty ->
      fprintf fmt (protect_on paren "sizeof(%a)") (print_ty ~paren:false) ty
    | Eindex _ | Edot _ | Earrow _ -> raise (Unprinted "struct/array access")
    | Esyntax (s, t, args, lte,_) ->
      gen_syntax_arguments_typed snd (fun _ -> args)
        (if paren then ("("^s^")") else s)
        (fun fmt (e,_t) -> print_expr ~paren:false fmt e)
        (print_ty ~paren:false) (C.Enothing,t) fmt lte

  and print_const  fmt = function
    | Cint s | Cfloat s | Cchar s | Cstring s -> fprintf fmt "%s" s

  let print_id_init fmt = function
    | id, Enothing -> print_ident fmt id
    | id,e -> fprintf fmt "%a = %a" print_ident id (print_expr ~paren:false) e

  let rec print_stmt ~braces fmt = function
    | Snop -> Format.printf "snop"; ()
    | Sexpr e -> fprintf fmt "%a;" (print_expr ~paren:false) e;
352 353
    | Sblock ([] ,s) when (not braces || one_stmt s) ->
      (print_stmt ~braces:false) fmt s
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
354 355 356 357
    | Sblock b -> fprintf fmt "@[<hov>{@\n  @[<hov>%a@]@\n}@]" print_body b
    | Sseq (s1,s2) -> fprintf fmt "%a@\n%a"
      (print_stmt ~braces:false) s1
      (print_stmt ~braces:false) s2
358
    | Sif(c,t,e) when is_nop e ->
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
359
       fprintf fmt "if(%a)@\n%a" (print_expr ~paren:false) c
360
         (print_stmt ~braces:true) (Sblock([],t))
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
361 362
    | Sif (c,t,e) -> fprintf fmt "if(%a)@\n%a@\nelse@\n%a"
      (print_expr ~paren:false) c
363 364 365 366
      (print_stmt ~braces:true) (Sblock([],t))
      (print_stmt ~braces:true) (Sblock([],e))
    | Swhile (e,b) -> fprintf fmt "while (%a)@;<1 2>%a"
      (print_expr ~paren:false) e (print_stmt ~braces:true) (Sblock([],b))
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
367 368 369 370
    | Sfor _ -> raise (Unprinted "for loops")
    | Sbreak -> fprintf fmt "break;"
    | Sreturn e -> fprintf fmt "return %a;" (print_expr ~paren:true) e

371 372
  and print_def fmt def =
    try match def with
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
    | Dfun (id,(rt,args),body) ->
       fprintf fmt "%a %a(@[%a@])@ @[<hov>{@;<1 2>@[<hov>%a@]@\n}@\n@]"
               (print_ty ~paren:false) rt
               print_ident id
               (print_list comma
			   (print_pair_delim nothing space nothing
					     (print_ty ~paren:false) print_ident))
	       args
               print_body body
    | Dproto (id, (rt, args)) ->
      fprintf fmt "%a %a(@[%a@]);@;"
        (print_ty ~paren:false) rt
        print_ident id
        (print_list comma
           (print_pair_delim nothing space nothing
			     (print_ty ~paren:false) print_ident))
	args
    | Ddecl (ty, lie) ->
391
       fprintf fmt "%a @[<hov>%a@];"
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
392 393 394 395 396
	       (print_ty ~paren:false) ty
	       (print_list comma print_id_init) lie
    | Dinclude id ->
       fprintf fmt "#include<%a.h>@;" print_ident id
    | Dtypedef (ty,id) ->
397
       fprintf fmt "@[<hov>typedef@ %a@;%a;@]"
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
398
	       (print_ty ~paren:false) ty print_ident id
399
    with Unprinted s -> Format.printf "Missed a def because : %s@." s
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
400 401

  and print_body fmt body =
402 403 404 405 406 407 408
    if fst body = []
    then print_stmt ~braces:true fmt (snd body)
    else
      print_pair_delim nothing newline nothing
        (print_list newline print_def)
        (print_stmt ~braces:true)
        fmt body
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
409 410 411 412 413 414 415 416

  let print_file fmt info ast =
    Mid.iter (fun _ sl -> List.iter (fprintf fmt "%s\n") sl) info.thprelude;
    newline fmt ();
    fprintf fmt "@[<v>%a@]@." (print_list newline print_def) ast

end

417 418 419 420 421 422 423
module Translate = struct
  open Pdecl
  open Ity
  open Ty
  open Expr
  open Term
  open Printer
424
  open Pmodule
425

426
  let rec ty_of_ty info ty =
427 428 429 430
    match ty.ty_node with
    | Tyvar v ->
      begin match query_syntax info.syntax v.tv_name
        with
431
        | Some s -> C.Tsyntax (s, [])
432 433
        | None -> C.Tnamed (v.tv_name)
      end
434
    | Tyapp (ts, tl) ->
435 436
       begin match query_syntax info.syntax ts.ts_name
        with
437
        | Some s -> C.Tsyntax (s, List.map (ty_of_ty info) tl)
438
        | None -> C.Tnosyntax
439 440 441 442
       end

  let pv_name pv = pv.pv_vs.vs_name

443 444 445 446 447 448
  type syntax_env = { in_unguarded_loop : bool;
                      computes_return_value : bool;
                      breaks : Sid.t;
                      returns : Sid.t; }

  let rec expr info env (e:expr) : C.body =
449 450
    if e_ghost e then (Format.printf "translating ghost expr@."; C.([], Snop))
    else if is_e_void e then C.([], Snop)
451 452
    else if is_e_true e then expr info env (e_nat_const 1)
    else if is_e_false e then expr info env (e_nat_const 0)
453 454 455
    else match e.e_node with
    | Evar pv ->
       let e = C.Evar(pv_name pv) in
456
       C.([], if env.computes_return_value then Sreturn e else Sexpr e)
457 458
    | Econst (Number.ConstInt ic) ->
      let n = Number.compute_int ic in
459
      let e = C.(Econst (Cint (BigInt.to_string n))) in
460
      C.([], if env.computes_return_value then Sreturn e else Sexpr e)
461
    | Econst _ -> raise (Unsupported "real constants")
462
    | Eexec (ce, _cty) ->
463
      begin match ce.c_node with
464
      | Cfun e -> expr info env e
465
      | Capp (rs, pvsl) ->
466 467 468
         let e =  match query_syntax info.syntax rs.rs_name with
           | Some s ->
              let params =
469 470
		List.map (fun pv -> (C.Evar(pv_name pv),
                                     ty_of_ty info (ty_of_ity pv.pv_ity)))
471
			 pvsl in
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
472
              let rty = ty_of_ity e.e_ity in
473 474 475 476
              let rtyargs = match rty.ty_node with
		| Tyvar _ -> [||]
		| Tyapp (_,args) -> Array.of_list (List.map (ty_of_ty info) args)
              in
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
477 478
              C.Esyntax(s,ty_of_ty info rty, rtyargs, params,
                        Mid.mem rs.rs_name info.converter)
479
           | None ->
480 481 482 483 484 485
             let args = List.filter
               (fun pv -> not (pv.pv_ghost
                               || ity_equal pv.pv_ity ity_unit))
               pvsl in
              C.(Ecall(Evar(rs.rs_name),
                       List.map (fun pv -> Evar(pv_name pv)) args))
486
         in
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
487
	 C.([],
488 489
            if env.computes_return_value
              && not (ity_equal rs.rs_cty.cty_result ity_unit)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
490 491
            then Sreturn e
            else Sexpr e)
492
      | _ -> raise (Unsupported "Cpur/Cany") (*TODO clarify*)
493
      end
494
    | Eassign _ -> raise (Unsupported "mutable field assign")
495 496 497
    | Elet (ld,e) ->
      begin match ld with
      | LDvar (pv,le) ->
498
        Format.printf "let %s@." pv.pv_vs.vs_name.id_string;
499
        if pv.pv_ghost then expr info env e
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
500
        else if ity_equal pv.pv_ity ity_unit
501 502 503
        then let env' = {env with computes_return_value = false} in
             ([], C.Sseq (C.Sblock(expr info env' le),
		          C.Sblock(expr info env e)))
504 505 506 507
        else begin
          match le.e_node with
          | Econst (Number.ConstInt ic) ->
            let n = Number.compute_int ic in
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
508
            let ce = C.(Econst (Cint (BigInt.to_string n))) in
509 510
	    Format.printf "propagate constant %s for var %s@."
			  (BigInt.to_string n) (pv_name pv).id_string;
511
            C.propagate_in_block (pv_name pv) ce (expr info env e)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
512 513
          | Eexec ({c_node = Capp(rs,_); _},_)
              when Mid.mem rs.rs_name info.converter ->
514 515
            begin match expr info {env with computes_return_value = false} le
              with
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
516
            | [], C.Sexpr(se) ->
517
              C.propagate_in_block (pv_name pv) se (expr info env e)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
518 519
            | _ -> assert false
            end
520
          | _->
521
            let t = ty_of_ty info (ty_of_ity pv.pv_ity) in
522
            match expr info {env with computes_return_value = false} le with
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
523 524 525 526
            | [], C.Sexpr((C.Esyntax(_,_,_,_,b) as se))
                when b (* converter *) ->
              Format.printf "propagate converter for var %s@."
                (pv_name pv).id_string;
527
              C.propagate_in_block (pv_name pv) se (expr info env e)
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
528 529 530
            | d,s ->
              let initblock = d, C.assignify (pv_name pv) s in
              [ C.Ddecl (t, [pv_name pv, C.Enothing]) ],
531
              C.Sseq (C.Sblock initblock, C.Sblock (expr info env e))
532
        end
533
      | _ -> raise (Unsupported "LDsym/LDrec") (* TODO for rec at least*)
534
      end
535
    | Eif (cond, th, el) ->
536 537 538
       let c = expr info {env with computes_return_value = false} cond in
       let t = expr info env th in
       let e = expr info env el in
539 540 541 542 543 544 545 546
       begin match c with
	     | [], C.Sexpr c ->
		if is_e_false th && is_e_true el
		then C.([], Sexpr(Eunop(Unot, c)))
		else [], C.Sif(c,C.Sblock t, C.Sblock e)
	     | cdef, cs ->
		let cid = id_register (id_fresh "cond") in (* ? *)
		C.Ddecl (C.Tsyntax ("int",[]), [cid, C.Enothing])::cdef,
547 548
		C.Sseq (C.assignify cid cs,
                        C.Sif (C.Evar cid, C.Sblock t, C.Sblock e))
549 550
       (* TODO detect empty branches and replace with Snop, detect and/or*)
       end
551 552 553
    | Ewhile (c,_,_,b) ->
      Format.printf "while@.";
      let cd, cs = expr info {env with computes_return_value = false} c in
554 555 556
      (* this is needed so that the extracted expression has all
         needed variables in its scope *)
      let cd, cs = C.flatten_defs cd cs in
557 558 559 560 561 562 563
      let env' = { computes_return_value = false;
                   in_unguarded_loop = true;
                   returns = env.returns;
                   breaks =
                     if env.in_unguarded_loop
                     then Sid.empty else env.breaks } in
      let b = expr info  env' b in
564 565 566
      begin match cs with
      | C.Sexpr ce -> cd, C.Swhile (ce, C.Sblock b)
      | _ ->
567 568
        let s,e = C.get_last_expr cs in
        cd, C.Sseq (s, C.Swhile (e, C.Sblock b))
569
      end
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596
    | Etry (b, exm) ->
      Format.printf "TRY@.";
      let is_while = match b.e_node with Ewhile _ -> true | _-> false in
      let breaks,returns = Mexn.fold
        (fun xs (pvsl,r) (bs,rs) ->
          let id = xs.xs_name in
          match pvsl, r.e_node with
          | [pv], Evar pv' when pv_equal pv pv' && env.computes_return_value ->
            (bs, Sid.add id rs)
          | [], _ when is_e_void r && is_while ->
            (Sid.add id bs, rs)
          |_ -> raise (Unsupported "non break/return exception in try"))
        exm (Sid.empty, env.returns)
      in
      let env' = { computes_return_value = env.computes_return_value;
                   in_unguarded_loop = false;
                   breaks = breaks;
                   returns = returns;
                 } in
      expr info env' b
    | Eraise (xs,_) when Sid.mem xs.xs_name env.breaks ->
      Format.printf "BREAK@.";
      ([], C.Sbreak)
    | Eraise (xs,r) when Sid.mem xs.xs_name env.returns ->
      Format.printf "RETURN@.";
      expr info {env with computes_return_value = true} r
    | Eraise _ -> raise (Unsupported "non break/return exception raised")
597
    | Efor _ -> raise (Unsupported "for loops")  (*TODO*)
598
    | Eassert _ -> [], C.Snop
599 600 601 602 603 604 605 606 607 608 609 610 611 612 613
      (* let (a,b) = f(...) in *)
    | Ecase (e1,[{pp_pat = {pat_node = Papp(ls,rets)}}, e2])
        when is_fs_tuple ls
          && List.for_all (fun p ->
            match p.pat_node with Pvar _ -> true |_-> false)
            rets
          ->
      let rets = List.map
        (fun p -> match p.pat_node with
        | Pvar vs -> C.(Eunop(Uaddr,Evar(vs.vs_name)))
        | _ -> assert false )
        rets in
      let d,s = expr info {env with computes_return_value = false} e1 in
      let b = expr info env e2 in
      d, C.(Sseq(add_to_last_call rets s, Sblock b))
614 615
    | Ecase _ -> raise (Unsupported "pattern matching")
    | Eghost _ | Epure _ | Eabsurd -> assert false
616 617 618 619

  let pdecl info (pd:Pdecl.pdecl) : C.definition list =
    match pd.pd_node with
    | PDlet (LDsym (rs, ce)) ->
620 621
      let fname = rs.rs_name in
      Format.printf "PDlet rsymbol %s@." fname.id_string;
622 623 624 625 626 627 628 629 630 631 632 633 634 635
      begin try
              if Mid.mem fname info.syntax
              then (Format.printf "has syntax@."; [])
              else
                let params = List.map
		  (fun pv -> ty_of_ty info pv.pv_vs.vs_ty, pv_name pv)
		  (List.filter
		     (fun pv -> not pv.pv_ghost
                       && not (ity_equal pv.pv_ity ity_unit))
		     rs.rs_cty.cty_args) in
                begin match ce.c_node with
                | Cfun e ->
                  let rity = rs.rs_cty.cty_result in
                  let rtype =
636 637
                    if ity_equal rity ity_unit
                    then C.Tvoid
638 639 640 641 642
                    else ty_of_ty info (ty_of_ity rity) in
                  let env = { computes_return_value = true;
                              in_unguarded_loop = false;
                              returns = Sid.empty;
                              breaks = Sid.empty; } in
643 644 645 646
                  let d,s = expr info env e in
                  let d,s = C.flatten_defs d s in
                  let s = C.elim_nop s in
                  [C.Dfun (fname, (rtype,params), (d,s))]
647 648 649 650 651
                | _ -> raise (Unsupported
                                "Non-function with no syntax in toplevel let")
	        end
        with Unsupported s -> Format.printf "Unsupported : %s@." s; []
      end
652 653
    | PDtype [{itd_its = its}] ->
      let id = its.its_ts.ts_name in
654
      Format.printf "PDtype %s@." id.id_string;
655 656 657
      begin
        match its.its_ts.ts_def with
        | Some def -> [C.Dtypedef (ty_of_ty info def, id)]
658 659
        | None ->
          begin match query_syntax info.syntax id with
660
          | Some _ -> []
661 662 663
          | None ->
            raise (Unsupported "type declaration without syntax or alias")
          end
664 665
      end

666 667 668 669
    | _ -> [] (*TODO exn ? *)

  let munit info = function
    | Udecl pd -> pdecl info pd
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
670
    | Uuse _m -> (*[C.Dinclude m.mod_theory.Theory.th_name]*) []
671 672 673 674 675 676 677 678 679 680 681
    | Uclone _ -> raise (Unsupported "clone")
    | Umeta _ -> raise (Unsupported "meta")
    | Uscope _ -> []

  let translate (info:info) (m:pmodule) : C.file =
    Format.printf "Translating module %s@."
      m.mod_theory.Theory.th_name.id_string;
    try List.flatten (List.map (munit info) m.mod_units)
    with
    | Unsupported s ->
      Format.printf "Failed because of unsupported construct: %s@." s; []
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
682
end
683
(*TODO simplifications : propagate constants, collapse blocks with only a statement and no def*)
684

685 686


687 688 689 690 691 692 693 694
let fg ?fname m =
  let n = m.Pmodule.mod_theory.Theory.th_name.Ident.id_string in
  match fname with
  | None -> n ^ ".c"
  | Some f -> f ^ "__" ^ n ^ ".c"

let pr args ?old fmt m =
  ignore(old);
695
  let ast = Translate.translate args m in
Raphaël Rieu-Helft's avatar
Raphaël Rieu-Helft committed
696
  try Print.print_file fmt args ast
697 698
  with Print.Unprinted s -> (Format.printf "Could not print: %s@." s;
		       Format.fprintf fmt "/* Dummy file */@.")
699 700

let () = Pdriver.register_printer "c" ~desc:"printer for C code" fg pr