compile.ml 8.62 KB
Newer Older
1 2 3 4
open Ident
open Lambda

type env = {
5
  cu: Types.CompUnit.t option;  (* None: toplevel *)
6
  vars: var_loc Env.t;
7 8
  stack_size: int;
  global_size: int
9 10
}

11 12
let global_size env = env.global_size

13 14 15 16 17 18 19
let dump ppf env =
  Env.iter 
    (fun id loc ->
       Format.fprintf ppf "Var %a : %a@\n" U.print (Id.value id) Lambda.print_var_loc loc)
    env.vars


20 21 22 23
let mk cu = { cu = cu; vars = Env.empty; stack_size = 0; global_size = 0 }
let empty_toplevel = mk None
let empty x = mk (Some x)

24

25
let serialize s env =
26 27 28 29
  assert (env.stack_size = 0);
  (match env.cu with
    | Some cu -> Types.CompUnit.serialize s cu
    | None -> assert false);
30
  Serialize.Put.env Id.serialize Lambda.Put.var_loc Env.iter s env.vars;
31
  Serialize.Put.int s env.global_size
32 33

let deserialize s =
34
  let cu = Types.CompUnit.deserialize s in
35 36 37
  let vars = 
    Serialize.Get.env Id.deserialize Lambda.Get.var_loc Env.add Env.empty s in
  let size = Serialize.Get.int s in
38
  { cu = Some cu; vars = vars; stack_size = 0; global_size = size }
39 40


41 42 43 44 45
let find x env =
  try Env.find x env.vars
  with Not_found -> 
    failwith ("Compile: cannot find " ^ (Ident.to_string x))

46 47 48 49 50 51
let find_slot x env =
  match find x env with
    | Lambda.Ext (_,slot) -> slot
    | _ -> assert false
 

52 53 54 55
let from_comp_unit = ref (fun cu -> assert false)

let find_ext cu x =
  let env = !from_comp_unit cu in
56 57
  find x env

58

59 60 61 62
let rec compile env tail e = compile_aux env tail e.Typed.exp_descr
and compile_aux env tail = function
  | Typed.Forget (e,_) -> compile env tail e
  | Typed.Var x -> Var (find x env)
63
  | Typed.ExtVar (cu,x) -> Var (find_ext cu x)
64
  | Typed.Apply (e1,e2) -> Apply (tail, compile env false e1, compile env tail e2)
65 66
  | Typed.Abstraction a -> compile_abstr env a
  | Typed.Cst c -> Const c
67
  | Typed.Pair (e1,e2) -> Pair(compile env false e1, compile env tail e2)
68
  | Typed.Xml (e1, { Typed.exp_descr = Typed.Pair (e2,e3) }) -> 
69
      Xml (compile env false e1, compile env false e2, compile env tail e3)
70
  | Typed.Xml (_,_) -> assert false
71 72 73 74 75 76 77
  | Typed.RecordLitt r -> Record (LabelMap.map (compile env false) r)
  | Typed.String (i,j,s,q) -> String (i,j,s,compile env tail q)
  | Typed.Match (e,brs) -> Match (compile env false e, compile_branches env tail brs)
  | Typed.Map (e,brs) -> Map (compile env false e, compile_branches env false brs)
  | Typed.Transform (e,brs) -> Transform 
      (compile env false e, compile_branches env false brs)
  | Typed.Xtrans (e,brs) -> Xtrans (compile env false e, compile_branches env false brs)
78
  | Typed.Validate (e,k,sch,t) -> Validate (compile env tail e, k, sch, t)
79 80 81 82 83 84
  | Typed.RemoveField (e,l) -> RemoveField (compile env tail e,l)
  | Typed.Dot (e,l) -> Dot (compile env tail e, l)
  | Typed.Try (e,brs) -> Try (compile env false e, compile_branches env tail brs)
  | Typed.UnaryOp (op,e) -> UnaryOp (op, compile env tail e)
  | Typed.BinaryOp (op,e1,e2) -> BinaryOp (op, compile env false e1, compile env tail e2)
  | Typed.Ref (e,t) ->  Ref (compile env tail e, t)
85 86

and compile_abstr env a =
87 88 89 90 91
  let fun_env = 
    match a.Typed.fun_name with
      | Some x -> Env.add x (Env 0) Env.empty
      | None -> Env.empty in

92 93 94
  let (slots,nb_slots,fun_env) = 
    List.fold_left 
      (fun (slots,nb_slots,fun_env) x ->
95
	 match find x env with
96 97 98 99
	   | (Stack _ | Env _) as p -> 
	       p::slots,
	       succ nb_slots,
	       Env.add x (Env nb_slots) fun_env;
100
	   | Global _ | Ext _ as p -> 
101 102 103 104 105
	       slots,
	       nb_slots,
	       Env.add x p fun_env
	   | Dummy -> assert false
      )
106
      ([Dummy],1,fun_env) (IdSet.get a.Typed.fun_fv) in
107 108 109


  let slots = Array.of_list (List.rev slots) in  
110
  let env = { env with vars = fun_env; stack_size = 0 } in
111 112
  let body = compile_branches env true a.Typed.fun_body in
  Abstraction (slots, a.Typed.fun_iface, body)
113

114
and compile_branches env tail (brs : Typed.branches) =
115 116 117
  (* Don't compile unused branches, because they have not been
     type checked. *)
  let used = List.filter (fun br -> br.Typed.br_used) brs.Typed.br_branches in
118
  { 
119
    brs = List.map (compile_branch env tail) used;
120 121
    brs_tail = tail;
    brs_accept_chars = not (Types.Char.is_empty brs.Typed.br_accept);
122 123 124 125
    brs_input = brs.Typed.br_typ;
    brs_compiled = None
  }

126
and compile_branch env tail br =
127 128 129
  let env = 
    List.fold_left 
      (fun env x ->
130 131 132
	 { env with 
	     vars = Env.add x (Stack env.stack_size) env.vars;
	     stack_size = env.stack_size + 1 }
133

134
      ) env (Patterns.fv br.Typed.br_pat) in
135 136 137
  (br.Typed.br_pat, compile env tail br.Typed.br_body)


138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164
let enter_globals env n = 
  match env.cu with
    | None ->
	let env = 
	  List.fold_left
	    (fun env x ->
	       { env with
		   vars = Env.add x (Global env.stack_size) env.vars;
		   stack_size = env.stack_size + 1 })
	    env n in
	(env,[])
    | Some cu ->
	List.fold_left
	(fun (env,code) x ->
	 let code = SetGlobal (cu, env.global_size) :: code in
	 let env = 
	   { env with
	       vars = Env.add x (Ext (cu, env.global_size)) env.vars;
	       global_size = env.global_size + 1 } in
	 (env,code)
	)
	(env,[])
	n

let compile_expr env = compile env false

let compile_eval env e = [ Push (compile_expr env e); Pop ]
165

166 167
let compile_let_decl env decl =
  let pat = decl.Typed.let_pat in
168
  let e = compile_expr env decl.Typed.let_body in
169
  let (env,code) = enter_globals env (Patterns.fv pat) in
170
  (env, (Push e) :: (Split pat) :: code)
171 172 173 174 175

let compile_rec_funs env funs =
  let fun_name = function
    | { Typed.exp_descr=Typed.Abstraction{Typed.fun_name = Some x}} -> x
    | _ -> assert false in
176 177 178
  let fun_a env = function
    | { Typed.exp_descr=Typed.Abstraction a } -> 
	Push (compile_abstr env a)
179 180
    | _ -> assert false in
  let names = List.map fun_name funs in
181 182 183
  let (env,code) = enter_globals env names in
  let exprs = List.map (fun_a env) funs in
  (env, exprs @ code)
184 185 186 187 188 189


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

open Location

190 191
let eval ~run ~show (tenv,cenv,codes) e =
  let (e,t) = Typer.type_expr tenv e in
192
  let expr = compile_expr cenv e in
193
  if run then
194
    let v = Eval.expr expr in
195 196 197
    show None t (Some v)
  else
    show None t None;
198
  (tenv,cenv, Pop :: Push expr ::codes)
199

200
let run_show ~run ~show tenv cenv codes ids =
201
  if run then
202
    let () = Eval.code_items codes in
203 204 205 206 207 208 209 210 211
    List.iter 
      (fun (id,_) -> show (Some id) 
	 (Typer.find_value id tenv)
	 (Some (Eval.var (find id cenv)))) ids
  else
    List.iter 
      (fun (id,_) -> show (Some id) 
	 (Typer.find_value id tenv)
	 None) ids
212
  
213 214
let let_decl ~run ~show (tenv,cenv,codes) p e =
  let (tenv,decl,ids) = Typer.type_let_decl tenv p e in
215
  let (cenv,code) = compile_let_decl cenv decl in
216
  run_show ~run ~show tenv cenv code ids;
217
  (tenv,cenv,List.rev_append code codes)
218
  
219 220
let let_funs ~run ~show (tenv,cenv,codes) funs =
  let (tenv,funs,ids) = Typer.type_let_funs tenv funs in
221
  let (cenv,code) = compile_rec_funs cenv funs in
222
  run_show ~run ~show tenv cenv code ids;
223
  (tenv,cenv,List.rev_append code codes)
224 225 226 227 228 229 230 231 232
  
let type_defs (tenv,cenv,codes) typs =
  let tenv = Typer.enter_types (Typer.type_defs tenv typs) tenv in
  (tenv,cenv,codes)

let namespace (tenv,cenv,codes) pr ns =
  let tenv = Typer.enter_ns pr ns tenv in
  (tenv,cenv,codes)

233 234 235
let find_cu (tenv,_,_) cu =
  Typer.find_cu cu tenv

236 237 238 239
let using (tenv,cenv,codes) x cu =
  let tenv = Typer.enter_cu x cu tenv in
  (tenv,cenv,codes)

240 241 242 243 244 245 246 247 248
let rec collect_funs accu = function
  | { descr = Ast.FunDecl e } :: rest -> collect_funs (e::accu) rest
  | rest -> (accu,rest)

let rec collect_types accu = function
  | { descr = Ast.TypeDecl (x,t) } :: rest -> 
      collect_types ((x,t) :: accu) rest
  | rest -> (accu,rest)

249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
let rec phrases ~run ~show ~loading ~directive =
  let rec loop accu phs =
    match phs with
      | { descr = Ast.FunDecl _ } :: _ -> 
	  let (funs,rest) = collect_funs [] phs in
	  loop (let_funs ~run ~show accu funs) rest
      | { descr = Ast.TypeDecl (_,_) } :: _ ->
	  let (typs,rest) = collect_types [] phs in
	  loop (type_defs accu typs) rest
      | { descr = Ast.SchemaDecl (name, schema) } :: rest ->
	  Typer.register_schema name schema;
	  loop accu rest
      | { descr = Ast.Namespace (pr,ns) } :: rest ->
	  loop (namespace accu pr ns) rest
      | { descr = Ast.Using (x,cu) } :: rest ->
264
	  let cu = find_cu accu cu in
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
	  loading cu;
	  loop (using accu x cu) rest
      | { descr = Ast.EvalStatement e } :: rest ->
	  loop (eval ~run ~show accu e) rest
      | { descr = Ast.LetDecl (p,e) } :: rest ->
	  loop (let_decl ~run ~show accu p e) rest
      | { descr = Ast.Directive d } :: rest ->
	  let (tenv,cenv,_) = accu in
	  directive tenv cenv d;
	  loop accu rest
      | [] -> 
	  accu
  in
  loop

let comp_unit ?(run=false) 
  ?(show=fun _ _ _ -> ()) 
  ?(loading=fun _ -> ())
  ?(directive=fun _ _ _ -> ())  tenv cenv phs =
  let (tenv,cenv,codes) = phrases ~run ~show ~loading ~directive (tenv,cenv,[]) phs in
285
  (tenv,cenv,List.rev codes)