forked from ocaml/ocaml
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtranslcore.ml
1048 lines (996 loc) · 39.8 KB
/
translcore.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
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
253
254
255
256
257
258
259
260
261
262
263
264
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
319
320
321
322
323
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
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
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
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
(* Translation from typed abstract syntax to lambda terms,
for the core language *)
open Misc
open Asttypes
open Primitive
open Types
open Typedtree
open Typeopt
open Lambda
type error =
Free_super_var
| Unreachable_reached
exception Error of Location.t * error
let use_dup_for_constant_arrays_bigger_than = 4
(* Forward declaration -- to be filled in by Translmod.transl_module *)
let transl_module =
ref((fun _cc _rootpath _modl -> assert false) :
module_coercion -> Path.t option -> module_expr -> lambda)
let transl_object =
ref (fun _id _s _cl -> assert false :
Ident.t -> string list -> class_expr -> lambda)
(* Compile an exception/extension definition *)
let prim_fresh_oo_id =
Pccall (Primitive.simple ~name:"caml_fresh_oo_id" ~arity:1 ~alloc:false)
let transl_extension_constructor env path ext =
let path =
Printtyp.wrap_printing_env env ~error:true (fun () ->
Option.map (Printtyp.rewrite_double_underscore_paths env) path)
in
let name =
match path, !Clflags.for_package with
None, _ -> Ident.name ext.ext_id
| Some p, None -> Path.name p
| Some p, Some pack -> Printf.sprintf "%s.%s" pack (Path.name p)
in
let loc = ext.ext_loc in
match ext.ext_kind with
Text_decl _ ->
Lprim (Pmakeblock (Obj.object_tag, Immutable, None),
[Lconst (Const_base (Const_string (name, None)));
Lprim (prim_fresh_oo_id, [Lconst (Const_base (Const_int 0))], loc)],
loc)
| Text_rebind(path, _lid) ->
transl_extension_path loc env path
(* To propagate structured constants *)
exception Not_constant
let extract_constant = function
Lconst sc -> sc
| _ -> raise Not_constant
let extract_float = function
Const_base(Const_float f) -> f
| _ -> fatal_error "Translcore.extract_float"
(* Push the default values under the functional abstractions *)
(* Also push bindings of module patterns, since this sound *)
type binding =
| Bind_value of value_binding list
| Bind_module of Ident.t * string loc * module_presence * module_expr
let rec push_defaults loc bindings cases partial =
match cases with
[{c_lhs=pat; c_guard=None;
c_rhs={exp_desc = Texp_function { arg_label; param; cases; partial; } }
as exp}] ->
let cases = push_defaults exp.exp_loc bindings cases partial in
[{c_lhs=pat; c_guard=None;
c_rhs={exp with exp_desc = Texp_function { arg_label; param; cases;
partial; }}}]
| [{c_lhs=pat; c_guard=None;
c_rhs={exp_attributes=[{Parsetree.attr_name = {txt="#default"};_}];
exp_desc = Texp_let
(Nonrecursive, binds, ({exp_desc = Texp_function _} as e2))}}] ->
push_defaults loc (Bind_value binds :: bindings)
[{c_lhs=pat;c_guard=None;c_rhs=e2}]
partial
| [{c_lhs=pat; c_guard=None;
c_rhs={exp_attributes=[{Parsetree.attr_name = {txt="#modulepat"};_}];
exp_desc = Texp_letmodule
(id, name, pres, mexpr,
({exp_desc = Texp_function _} as e2))}}] ->
push_defaults loc (Bind_module (id, name, pres, mexpr) :: bindings)
[{c_lhs=pat;c_guard=None;c_rhs=e2}]
partial
| [case] ->
let exp =
List.fold_left
(fun exp binds ->
{exp with exp_desc =
match binds with
| Bind_value binds -> Texp_let(Nonrecursive, binds, exp)
| Bind_module (id, name, pres, mexpr) ->
Texp_letmodule (id, name, pres, mexpr, exp)})
case.c_rhs bindings
in
[{case with c_rhs=exp}]
| {c_lhs=pat; c_rhs=exp; c_guard=_} :: _ when bindings <> [] ->
let param = Typecore.name_cases "param" cases in
let desc =
{val_type = pat.pat_type; val_kind = Val_reg;
val_attributes = []; Types.val_loc = Location.none; }
in
let env = Env.add_value param desc exp.exp_env in
let name = Ident.name param in
let exp =
{ exp with exp_loc = loc; exp_env = env; exp_desc =
Texp_match
({exp with exp_type = pat.pat_type; exp_env = env; exp_desc =
Texp_ident
(Path.Pident param, mknoloc (Longident.Lident name), desc)},
cases, partial) }
in
push_defaults loc bindings
[{c_lhs={pat with pat_desc = Tpat_var (param, mknoloc name)};
c_guard=None; c_rhs=exp}]
Total
| _ ->
cases
(* Insertion of debugging events *)
let event_before = Translprim.event_before
let event_after = Translprim.event_after
let event_function exp lam =
if !Clflags.debug && not !Clflags.native_code then
let repr = Some (ref 0) in
let (info, body) = lam repr in
(info,
Levent(body, {lev_loc = exp.exp_loc;
lev_kind = Lev_function;
lev_repr = repr;
lev_env = exp.exp_env}))
else
lam None
(* Assertions *)
let assert_failed exp =
let slot =
transl_extension_path Location.none
Env.initial_safe_string Predef.path_assert_failure
in
let (fname, line, char) =
Location.get_pos_info exp.exp_loc.Location.loc_start
in
Lprim(Praise Raise_regular, [event_after exp
(Lprim(Pmakeblock(0, Immutable, None),
[slot;
Lconst(Const_block(0,
[Const_base(Const_string (fname, None));
Const_base(Const_int line);
Const_base(Const_int char)]))], exp.exp_loc))], exp.exp_loc)
;;
let rec cut n l =
if n = 0 then ([],l) else
match l with [] -> failwith "Translcore.cut"
| a::l -> let (l1,l2) = cut (n-1) l in (a::l1,l2)
(* Translation of expressions *)
let rec iter_exn_names f pat =
match pat.pat_desc with
| Tpat_var (id, _) -> f id
| Tpat_alias (p, id, _) ->
f id;
iter_exn_names f p
| _ -> ()
let transl_ident loc env ty path desc =
match desc.val_kind with
| Val_prim p ->
Translprim.transl_primitive loc p env ty (Some path)
| Val_anc _ ->
raise(Error(loc, Free_super_var))
| Val_reg | Val_self _ ->
transl_value_path loc env path
| _ -> fatal_error "Translcore.transl_exp: bad Texp_ident"
let rec transl_exp e =
List.iter (Translattribute.check_attribute e) e.exp_attributes;
let eval_once =
(* Whether classes for immediate objects must be cached *)
match e.exp_desc with
Texp_function _ | Texp_for _ | Texp_while _ -> false
| _ -> true
in
if eval_once then transl_exp0 e else
Translobj.oo_wrap e.exp_env true transl_exp0 e
and transl_exp0 e =
match e.exp_desc with
| Texp_ident(path, _, desc) ->
transl_ident e.exp_loc e.exp_env e.exp_type path desc
| Texp_constant cst ->
Lconst(Const_base cst)
| Texp_let(rec_flag, pat_expr_list, body) ->
transl_let rec_flag pat_expr_list (event_before body (transl_exp body))
| Texp_function { arg_label = _; param; cases; partial; } ->
let ((kind, params, return), body) =
event_function e
(function repr ->
let pl = push_defaults e.exp_loc [] cases partial in
let return_kind = function_return_value_kind e.exp_env e.exp_type in
transl_function e.exp_loc return_kind !Clflags.native_code repr
partial param pl)
in
let attr = default_function_attribute in
let loc = e.exp_loc in
let lam = Lfunction{kind; params; return; body; attr; loc} in
Translattribute.add_function_attributes lam loc e.exp_attributes
| Texp_apply({ exp_desc = Texp_ident(path, _, {val_kind = Val_prim p});
exp_type = prim_type } as funct, oargs)
when List.length oargs >= p.prim_arity
&& List.for_all (fun (_, arg) -> arg <> None) oargs ->
let argl, extra_args = cut p.prim_arity oargs in
let arg_exps =
List.map (function _, Some x -> x | _ -> assert false) argl
in
let args = transl_list arg_exps in
let prim_exp = if extra_args = [] then Some e else None in
let lam =
Translprim.transl_primitive_application
e.exp_loc p e.exp_env prim_type path
prim_exp args arg_exps
in
if extra_args = [] then lam
else begin
let should_be_tailcall, funct =
Translattribute.get_tailcall_attribute funct
in
let inlined, funct =
Translattribute.get_and_remove_inlined_attribute funct
in
let specialised, funct =
Translattribute.get_and_remove_specialised_attribute funct
in
let e = { e with exp_desc = Texp_apply(funct, oargs) } in
event_after e
(transl_apply ~should_be_tailcall ~inlined ~specialised
lam extra_args e.exp_loc)
end
| Texp_apply(funct, oargs) ->
let should_be_tailcall, funct =
Translattribute.get_tailcall_attribute funct
in
let inlined, funct =
Translattribute.get_and_remove_inlined_attribute funct
in
let specialised, funct =
Translattribute.get_and_remove_specialised_attribute funct
in
let e = { e with exp_desc = Texp_apply(funct, oargs) } in
event_after e
(transl_apply ~should_be_tailcall ~inlined ~specialised
(transl_exp funct) oargs e.exp_loc)
| Texp_match(arg, pat_expr_list, partial) ->
transl_match e arg pat_expr_list partial
| Texp_try(body, pat_expr_list) ->
let id = Typecore.name_cases "exn" pat_expr_list in
Ltrywith(transl_exp body, id,
Matching.for_trywith (Lvar id) (transl_cases_try pat_expr_list))
| Texp_tuple el ->
let ll, shape = transl_list_with_shape el in
begin try
Lconst(Const_block(0, List.map extract_constant ll))
with Not_constant ->
Lprim(Pmakeblock(0, Immutable, Some shape), ll, e.exp_loc)
end
| Texp_construct(_, cstr, args) ->
let ll, shape = transl_list_with_shape args in
if cstr.cstr_inlined <> None then begin match ll with
| [x] -> x
| _ -> assert false
end else begin match cstr.cstr_tag with
Cstr_constant n ->
Lconst(Const_pointer n)
| Cstr_unboxed ->
(match ll with [v] -> v | _ -> assert false)
| Cstr_block n ->
begin try
Lconst(Const_block(n, List.map extract_constant ll))
with Not_constant ->
Lprim(Pmakeblock(n, Immutable, Some shape), ll, e.exp_loc)
end
| Cstr_extension(path, is_const) ->
let lam = transl_extension_path e.exp_loc e.exp_env path in
if is_const then lam
else
Lprim(Pmakeblock(0, Immutable, Some (Pgenval :: shape)),
lam :: ll, e.exp_loc)
end
| Texp_extension_constructor (_, path) ->
transl_extension_path e.exp_loc e.exp_env path
| Texp_variant(l, arg) ->
let tag = Btype.hash_variant l in
begin match arg with
None -> Lconst(Const_pointer tag)
| Some arg ->
let lam = transl_exp arg in
try
Lconst(Const_block(0, [Const_base(Const_int tag);
extract_constant lam]))
with Not_constant ->
Lprim(Pmakeblock(0, Immutable, None),
[Lconst(Const_base(Const_int tag)); lam], e.exp_loc)
end
| Texp_record {fields; representation; extended_expression} ->
transl_record e.exp_loc e.exp_env fields representation
extended_expression
| Texp_field(arg, _, lbl) ->
let targ = transl_exp arg in
begin match lbl.lbl_repres with
Record_regular | Record_inlined _ ->
Lprim (Pfield lbl.lbl_pos, [targ], e.exp_loc)
| Record_unboxed _ -> targ
| Record_float -> Lprim (Pfloatfield lbl.lbl_pos, [targ], e.exp_loc)
| Record_extension _ ->
Lprim (Pfield (lbl.lbl_pos + 1), [targ], e.exp_loc)
end
| Texp_setfield(arg, _, lbl, newval) ->
let access =
match lbl.lbl_repres with
Record_regular
| Record_inlined _ ->
Psetfield(lbl.lbl_pos, maybe_pointer newval, Assignment)
| Record_unboxed _ -> assert false
| Record_float -> Psetfloatfield (lbl.lbl_pos, Assignment)
| Record_extension _ ->
Psetfield (lbl.lbl_pos + 1, maybe_pointer newval, Assignment)
in
Lprim(access, [transl_exp arg; transl_exp newval], e.exp_loc)
| Texp_array expr_list ->
let kind = array_kind e in
let ll = transl_list expr_list in
begin try
(* For native code the decision as to which compilation strategy to
use is made later. This enables the Flambda passes to lift certain
kinds of array definitions to symbols. *)
(* Deactivate constant optimization if array is small enough *)
if List.length ll <= use_dup_for_constant_arrays_bigger_than
then begin
raise Not_constant
end;
begin match List.map extract_constant ll with
| exception Not_constant when kind = Pfloatarray ->
(* We cannot currently lift [Pintarray] arrays safely in Flambda
because [caml_modify] might be called upon them (e.g. from
code operating on polymorphic arrays, or functions such as
[caml_array_blit].
To avoid having different Lambda code for
bytecode/Closure vs. Flambda, we always generate
[Pduparray] here, and deal with it in [Bytegen] (or in
the case of Closure, in [Cmmgen], which already has to
handle [Pduparray Pmakearray Pfloatarray] in the case
where the array turned out to be inconstant).
When not [Pfloatarray], the exception propagates to the handler
below. *)
let imm_array =
Lprim (Pmakearray (kind, Immutable), ll, e.exp_loc)
in
Lprim (Pduparray (kind, Mutable), [imm_array], e.exp_loc)
| cl ->
let imm_array =
match kind with
| Paddrarray | Pintarray ->
Lconst(Const_block(0, cl))
| Pfloatarray ->
Lconst(Const_float_array(List.map extract_float cl))
| Pgenarray ->
raise Not_constant (* can this really happen? *)
in
Lprim (Pduparray (kind, Mutable), [imm_array], e.exp_loc)
end
with Not_constant ->
Lprim(Pmakearray (kind, Mutable), ll, e.exp_loc)
end
| Texp_ifthenelse(cond, ifso, Some ifnot) ->
Lifthenelse(transl_exp cond,
event_before ifso (transl_exp ifso),
event_before ifnot (transl_exp ifnot))
| Texp_ifthenelse(cond, ifso, None) ->
Lifthenelse(transl_exp cond,
event_before ifso (transl_exp ifso),
lambda_unit)
| Texp_sequence(expr1, expr2) ->
Lsequence(transl_exp expr1, event_before expr2 (transl_exp expr2))
| Texp_while(cond, body) ->
Lwhile(transl_exp cond, event_before body (transl_exp body))
| Texp_for(param, _, low, high, dir, body) ->
Lfor(param, transl_exp low, transl_exp high, dir,
event_before body (transl_exp body))
| Texp_send(_, _, Some exp) -> transl_exp exp
| Texp_send(expr, met, None) ->
let obj = transl_exp expr in
let lam =
match met with
Tmeth_val id -> Lsend (Self, Lvar id, obj, [], e.exp_loc)
| Tmeth_name nm ->
let (tag, cache) = Translobj.meth obj nm in
let kind = if cache = [] then Public else Cached in
Lsend (kind, tag, obj, cache, e.exp_loc)
in
event_after e lam
| Texp_new (cl, {Location.loc=loc}, _) ->
Lapply{ap_should_be_tailcall=false;
ap_loc=loc;
ap_func=
Lprim(Pfield 0, [transl_class_path loc e.exp_env cl], loc);
ap_args=[lambda_unit];
ap_inlined=Default_inline;
ap_specialised=Default_specialise}
| Texp_instvar(path_self, path, _) ->
let self = transl_value_path e.exp_loc e.exp_env path_self in
let var = transl_value_path e.exp_loc e.exp_env path in
Lprim(Pfield_computed, [self; var], e.exp_loc)
| Texp_setinstvar(path_self, path, _, expr) ->
let self = transl_value_path e.exp_loc e.exp_env path_self in
let var = transl_value_path e.exp_loc e.exp_env path in
transl_setinstvar e.exp_loc self var expr
| Texp_override(path_self, modifs) ->
let self = transl_value_path e.exp_loc e.exp_env path_self in
let cpy = Ident.create_local "copy" in
Llet(Strict, Pgenval, cpy,
Lapply{ap_should_be_tailcall=false;
ap_loc=Location.none;
ap_func=Translobj.oo_prim "copy";
ap_args=[self];
ap_inlined=Default_inline;
ap_specialised=Default_specialise},
List.fold_right
(fun (path, _, expr) rem ->
let var = transl_value_path e.exp_loc e.exp_env path in
Lsequence(transl_setinstvar Location.none
(Lvar cpy) var expr, rem))
modifs
(Lvar cpy))
| Texp_letmodule(id, loc, Mp_present, modl, body) ->
let defining_expr =
Levent (!transl_module Tcoerce_none None modl, {
lev_loc = loc.loc;
lev_kind = Lev_module_definition id;
lev_repr = None;
lev_env = Env.empty;
})
in
Llet(Strict, Pgenval, id, defining_expr, transl_exp body)
| Texp_letmodule(_, _, Mp_absent, _, body) ->
transl_exp body
| Texp_letexception(cd, body) ->
Llet(Strict, Pgenval,
cd.ext_id, transl_extension_constructor e.exp_env None cd,
transl_exp body)
| Texp_pack modl ->
!transl_module Tcoerce_none None modl
| Texp_assert {exp_desc=Texp_construct(_, {cstr_name="false"}, _)} ->
assert_failed e
| Texp_assert (cond) ->
if !Clflags.noassert
then lambda_unit
else Lifthenelse (transl_exp cond, lambda_unit, assert_failed e)
| Texp_lazy e ->
(* when e needs no computation (constants, identifiers, ...), we
optimize the translation just as Lazy.lazy_from_val would
do *)
begin match Typeopt.classify_lazy_argument e with
| `Constant_or_function ->
(* A constant expr (of type <> float if [Config.flat_float_array] is
true) gets compiled as itself. *)
transl_exp e
| `Float_that_cannot_be_shortcut ->
(* We don't need to wrap with Popaque: this forward
block will never be shortcutted since it points to a float
and Config.flat_float_array is true. *)
Lprim(Pmakeblock(Obj.forward_tag, Immutable, None),
[transl_exp e], e.exp_loc)
| `Identifier `Forward_value ->
(* CR-someday mshinwell: Consider adding a new primitive
that expresses the construction of forward_tag blocks.
We need to use [Popaque] here to prevent unsound
optimisation in Flambda, but the concept of a mutable
block doesn't really match what is going on here. This
value may subsequently turn into an immediate... *)
Lprim (Popaque,
[Lprim(Pmakeblock(Obj.forward_tag, Immutable, None),
[transl_exp e], e.exp_loc)],
e.exp_loc)
| `Identifier `Other ->
transl_exp e
| `Other ->
(* other cases compile to a lazy block holding a function *)
let fn = Lfunction {kind = Curried;
params= [Ident.create_local "param", Pgenval];
return = Pgenval;
attr = default_function_attribute;
loc = e.exp_loc;
body = transl_exp e} in
Lprim(Pmakeblock(Config.lazy_tag, Mutable, None), [fn], e.exp_loc)
end
| Texp_object (cs, meths) ->
let cty = cs.cstr_type in
let cl = Ident.create_local "class" in
!transl_object cl meths
{ cl_desc = Tcl_structure cs;
cl_loc = e.exp_loc;
cl_type = Cty_signature cty;
cl_env = e.exp_env;
cl_attributes = [];
}
| Texp_letop{let_; ands; param; body; partial} ->
event_after e
(transl_letop e.exp_loc e.exp_env let_ ands param body partial)
| Texp_unreachable ->
raise (Error (e.exp_loc, Unreachable_reached))
| Texp_open (od, e) ->
let pure = pure_module od.open_expr in
(* this optimization shouldn't be needed because Simplif would
actually remove the [Llet] when it's not used.
But since [scan_used_globals] runs before Simplif, we need to
do it. *)
begin match od.open_bound_items with
| [] when pure = Alias -> transl_exp e
| _ ->
let oid = Ident.create_local "open" in
let body, _ =
List.fold_left (fun (body, pos) id ->
Llet(Alias, Pgenval, id,
Lprim(Pfield pos, [Lvar oid], od.open_loc), body),
pos + 1
) (transl_exp e, 0) (bound_value_identifiers od.open_bound_items)
in
Llet(pure, Pgenval, oid,
!transl_module Tcoerce_none None od.open_expr, body)
end
and pure_module m =
match m.mod_desc with
Tmod_ident _ -> Alias
| Tmod_constraint (m,_,_,_) -> pure_module m
| _ -> Strict
and transl_list expr_list =
List.map transl_exp expr_list
and transl_list_with_shape expr_list =
let transl_with_shape e =
let shape = Typeopt.value_kind e.exp_env e.exp_type in
transl_exp e, shape
in
List.split (List.map transl_with_shape expr_list)
and transl_guard guard rhs =
let expr = event_before rhs (transl_exp rhs) in
match guard with
| None -> expr
| Some cond ->
event_before cond (Lifthenelse(transl_exp cond, expr, staticfail))
and transl_case {c_lhs; c_guard; c_rhs} =
c_lhs, transl_guard c_guard c_rhs
and transl_cases cases =
let cases =
List.filter (fun c -> c.c_rhs.exp_desc <> Texp_unreachable) cases in
List.map transl_case cases
and transl_case_try {c_lhs; c_guard; c_rhs} =
iter_exn_names Translprim.add_exception_ident c_lhs;
Misc.try_finally
(fun () -> c_lhs, transl_guard c_guard c_rhs)
~always:(fun () ->
iter_exn_names Translprim.remove_exception_ident c_lhs)
and transl_cases_try cases =
let cases =
List.filter (fun c -> c.c_rhs.exp_desc <> Texp_unreachable) cases in
List.map transl_case_try cases
and transl_tupled_cases patl_expr_list =
let patl_expr_list =
List.filter (fun (_,_,e) -> e.exp_desc <> Texp_unreachable)
patl_expr_list in
List.map (fun (patl, guard, expr) -> (patl, transl_guard guard expr))
patl_expr_list
and transl_apply ?(should_be_tailcall=false) ?(inlined = Default_inline)
?(specialised = Default_specialise) lam sargs loc =
let lapply funct args =
match funct with
Lsend(k, lmet, lobj, largs, loc) ->
Lsend(k, lmet, lobj, largs @ args, loc)
| Levent(Lsend(k, lmet, lobj, largs, loc), _) ->
Lsend(k, lmet, lobj, largs @ args, loc)
| Lapply ap ->
Lapply {ap with ap_args = ap.ap_args @ args; ap_loc = loc}
| lexp ->
Lapply {ap_should_be_tailcall=should_be_tailcall;
ap_loc=loc;
ap_func=lexp;
ap_args=args;
ap_inlined=inlined;
ap_specialised=specialised;}
in
let rec build_apply lam args = function
(None, optional) :: l ->
let defs = ref [] in
let protect name lam =
match lam with
Lvar _ | Lconst _ -> lam
| _ ->
let id = Ident.create_local name in
defs := (id, lam) :: !defs;
Lvar id
in
let args, args' =
if List.for_all (fun (_,opt) -> opt) args then [], args
else args, [] in
let lam =
if args = [] then lam else lapply lam (List.rev_map fst args) in
let handle = protect "func" lam
and l = List.map (fun (arg, opt) -> may_map (protect "arg") arg, opt) l
and id_arg = Ident.create_local "param" in
let body =
match build_apply handle ((Lvar id_arg, optional)::args') l with
Lfunction{kind = Curried; params = ids; return;
body = lam; attr; loc} ->
Lfunction{kind = Curried;
params = (id_arg, Pgenval)::ids;
return;
body = lam; attr;
loc}
| Levent(Lfunction{kind = Curried; params = ids; return;
body = lam; attr; loc}, _) ->
Lfunction{kind = Curried; params = (id_arg, Pgenval)::ids;
return;
body = lam; attr;
loc}
| lam ->
Lfunction{kind = Curried; params = [id_arg, Pgenval];
return = Pgenval; body = lam;
attr = default_stub_attribute; loc = loc}
in
List.fold_left
(fun body (id, lam) -> Llet(Strict, Pgenval, id, lam, body))
body !defs
| (Some arg, optional) :: l ->
build_apply lam ((arg, optional) :: args) l
| [] ->
lapply lam (List.rev_map fst args)
in
(build_apply lam [] (List.map (fun (l, x) ->
may_map transl_exp x, Btype.is_optional l)
sargs)
: Lambda.lambda)
and transl_function loc return untuplify_fn repr partial (param:Ident.t) cases =
match cases with
[{c_lhs=pat; c_guard=None;
c_rhs={exp_desc = Texp_function { arg_label = _; param = param'; cases;
partial = partial'; }; exp_env; exp_type} as exp}]
when Parmatch.inactive ~partial pat ->
let kind = value_kind pat.pat_env pat.pat_type in
let return_kind = function_return_value_kind exp_env exp_type in
let ((_, params, return), body) =
transl_function exp.exp_loc return_kind false repr partial' param' cases
in
((Curried, (param, kind) :: params, return),
Matching.for_function loc None (Lvar param) [pat, body] partial)
| {c_lhs={pat_desc = Tpat_tuple pl}} :: _ when untuplify_fn ->
begin try
let size = List.length pl in
let pats_expr_list =
List.map
(fun {c_lhs; c_guard; c_rhs} ->
(Matching.flatten_pattern size c_lhs, c_guard, c_rhs))
cases in
let kinds =
(* All the patterns might not share the same types. We must take the
union of the patterns types *)
match pats_expr_list with
| [] -> assert false
| (pats, _, _) :: cases ->
let first_case_kinds =
List.map (fun pat -> value_kind pat.pat_env pat.pat_type) pats
in
List.fold_left
(fun kinds (pats, _, _) ->
List.map2 (fun kind pat ->
value_kind_union kind
(value_kind pat.pat_env pat.pat_type))
kinds pats)
first_case_kinds cases
in
let tparams =
List.map (fun kind -> Ident.create_local "param", kind) kinds
in
let params = List.map fst tparams in
((Tupled, tparams, return),
Matching.for_tupled_function loc params
(transl_tupled_cases pats_expr_list) partial)
with Matching.Cannot_flatten ->
((Curried, [param, Pgenval], return),
Matching.for_function loc repr (Lvar param)
(transl_cases cases) partial)
end
| {c_lhs=pat} :: other_cases ->
let kind =
(* All the patterns might not share the same types. We must take the
union of the patterns types *)
List.fold_left (fun k {c_lhs=pat} ->
Typeopt.value_kind_union k
(value_kind pat.pat_env pat.pat_type))
(value_kind pat.pat_env pat.pat_type) other_cases
in
((Curried, [param, kind], return),
Matching.for_function loc repr (Lvar param)
(transl_cases cases) partial)
| [] ->
(* With Camlp4, a pattern matching might be empty *)
((Curried, [param, Pgenval], return),
Matching.for_function loc repr (Lvar param)
(transl_cases cases) partial)
(*
Notice: transl_let consumes (ie compiles) its pat_expr_list argument,
and returns a function that will take the body of the lambda-let construct.
This complication allows choosing any compilation order for the
bindings and body of let constructs.
*)
and transl_let rec_flag pat_expr_list =
match rec_flag with
Nonrecursive ->
let rec transl = function
[] ->
fun body -> body
| {vb_pat=pat; vb_expr=expr; vb_attributes=attr; vb_loc} :: rem ->
let lam = transl_exp expr in
let lam = Translattribute.add_function_attributes lam vb_loc attr in
let mk_body = transl rem in
fun body -> Matching.for_let pat.pat_loc lam pat (mk_body body)
in transl pat_expr_list
| Recursive ->
let idlist =
List.map
(fun {vb_pat=pat} -> match pat.pat_desc with
Tpat_var (id,_) -> id
| Tpat_alias ({pat_desc=Tpat_any}, id,_) -> id
| _ -> assert false)
pat_expr_list in
let transl_case {vb_expr=expr; vb_attributes; vb_loc} id =
let lam = transl_exp expr in
let lam =
Translattribute.add_function_attributes lam vb_loc vb_attributes
in
(id, lam) in
let lam_bds = List.map2 transl_case pat_expr_list idlist in
fun body -> Lletrec(lam_bds, body)
and transl_setinstvar loc self var expr =
Lprim(Psetfield_computed (maybe_pointer expr, Assignment),
[self; var; transl_exp expr], loc)
and transl_record loc env fields repres opt_init_expr =
let size = Array.length fields in
(* Determine if there are "enough" fields (only relevant if this is a
functional-style record update *)
let no_init = match opt_init_expr with None -> true | _ -> false in
if no_init || size < Config.max_young_wosize
then begin
(* Allocate new record with given fields (and remaining fields
taken from init_expr if any *)
let init_id = Ident.create_local "init" in
let lv =
Array.mapi
(fun i (_, definition) ->
match definition with
| Kept typ ->
let field_kind = value_kind env typ in
let access =
match repres with
Record_regular | Record_inlined _ -> Pfield i
| Record_unboxed _ -> assert false
| Record_extension _ -> Pfield (i + 1)
| Record_float -> Pfloatfield i in
Lprim(access, [Lvar init_id], loc), field_kind
| Overridden (_lid, expr) ->
let field_kind = value_kind expr.exp_env expr.exp_type in
transl_exp expr, field_kind)
fields
in
let ll, shape = List.split (Array.to_list lv) in
let mut =
if Array.exists (fun (lbl, _) -> lbl.lbl_mut = Mutable) fields
then Mutable
else Immutable in
let lam =
try
if mut = Mutable then raise Not_constant;
let cl = List.map extract_constant ll in
match repres with
| Record_regular -> Lconst(Const_block(0, cl))
| Record_inlined tag -> Lconst(Const_block(tag, cl))
| Record_unboxed _ -> Lconst(match cl with [v] -> v | _ -> assert false)
| Record_float ->
Lconst(Const_float_array(List.map extract_float cl))
| Record_extension _ ->
raise Not_constant
with Not_constant ->
match repres with
Record_regular ->
Lprim(Pmakeblock(0, mut, Some shape), ll, loc)
| Record_inlined tag ->
Lprim(Pmakeblock(tag, mut, Some shape), ll, loc)
| Record_unboxed _ -> (match ll with [v] -> v | _ -> assert false)
| Record_float ->
Lprim(Pmakearray (Pfloatarray, mut), ll, loc)
| Record_extension path ->
let slot = transl_extension_path loc env path in
Lprim(Pmakeblock(0, mut, Some (Pgenval :: shape)), slot :: ll, loc)
in
begin match opt_init_expr with
None -> lam
| Some init_expr -> Llet(Strict, Pgenval, init_id,
transl_exp init_expr, lam)
end
end else begin
(* Take a shallow copy of the init record, then mutate the fields
of the copy *)
let copy_id = Ident.create_local "newrecord" in
let update_field cont (lbl, definition) =
match definition with
| Kept _type -> cont
| Overridden (_lid, expr) ->
let upd =
match repres with
Record_regular
| Record_inlined _ ->
Psetfield(lbl.lbl_pos, maybe_pointer expr, Assignment)
| Record_unboxed _ -> assert false
| Record_float -> Psetfloatfield (lbl.lbl_pos, Assignment)
| Record_extension _ ->
Psetfield(lbl.lbl_pos + 1, maybe_pointer expr, Assignment)
in
Lsequence(Lprim(upd, [Lvar copy_id; transl_exp expr], loc), cont)
in
begin match opt_init_expr with
None -> assert false
| Some init_expr ->
Llet(Strict, Pgenval, copy_id,
Lprim(Pduprecord (repres, size), [transl_exp init_expr], loc),
Array.fold_left update_field (Lvar copy_id) fields)
end
end
and transl_match e arg pat_expr_list partial =
let rewrite_case (val_cases, exn_cases, static_handlers as acc)
({ c_lhs; c_guard; c_rhs } as case) =
if c_rhs.exp_desc = Texp_unreachable then acc else
let val_pat, exn_pat = split_pattern c_lhs in
match val_pat, exn_pat with
| None, None -> assert false
| Some pv, None ->
let val_case =
transl_case { case with c_lhs = pv }
in
val_case :: val_cases, exn_cases, static_handlers
| None, Some pe ->
let exn_case = transl_case_try { case with c_lhs = pe } in
val_cases, exn_case :: exn_cases, static_handlers
| Some pv, Some pe ->
assert (c_guard = None);
let lbl = next_raise_count () in
let static_raise ids =
Lstaticraise (lbl, List.map (fun id -> Lvar id) ids)
in
(* Simplif doesn't like it if binders are not uniq, so we make sure to
use different names in the value and the exception branches. *)
let ids_full = Typedtree.pat_bound_idents_full pv in
let ids = List.map (fun (id, _, _) -> id) ids_full in
let ids_kinds =
List.map (fun (id, _, ty) -> id, Typeopt.value_kind pv.pat_env ty)
ids_full
in
let vids = List.map Ident.rename ids in
let pv = alpha_pat (List.combine ids vids) pv in
(* Also register the names of the exception so Re-raise happens. *)
iter_exn_names Translprim.add_exception_ident pe;
let rhs =
Misc.try_finally
(fun () -> event_before c_rhs (transl_exp c_rhs))
~always:(fun () ->
iter_exn_names Translprim.remove_exception_ident pe)
in
(pv, static_raise vids) :: val_cases,
(pe, static_raise ids) :: exn_cases,
(lbl, ids_kinds, rhs) :: static_handlers
in
let val_cases, exn_cases, static_handlers =
let x, y, z = List.fold_left rewrite_case ([], [], []) pat_expr_list in
List.rev x, List.rev y, List.rev z
in
let static_catch body val_ids handler =
let id = Typecore.name_pattern "exn" (List.map fst exn_cases) in
let static_exception_id = next_raise_count () in
Lstaticcatch
(Ltrywith (Lstaticraise (static_exception_id, body), id,
Matching.for_trywith (Lvar id) exn_cases),
(static_exception_id, val_ids),
handler)
in
let classic =
match arg, exn_cases with
| {exp_desc = Texp_tuple argl}, [] ->
assert (static_handlers = []);
Matching.for_multiple_match e.exp_loc (transl_list argl) val_cases partial
| {exp_desc = Texp_tuple argl}, _ :: _ ->
let val_ids =
List.map
(fun arg ->
Typecore.name_pattern "val" [],
Typeopt.value_kind arg.exp_env arg.exp_type
)
argl
in
let lvars = List.map (fun (id, _) -> Lvar id) val_ids in
static_catch (transl_list argl) val_ids
(Matching.for_multiple_match e.exp_loc lvars val_cases partial)
| arg, [] ->
assert (static_handlers = []);
Matching.for_function e.exp_loc None (transl_exp arg) val_cases partial
| arg, _ :: _ ->
let val_id = Typecore.name_cases "val" pat_expr_list in
let k = Typeopt.value_kind arg.exp_env arg.exp_type in
static_catch [transl_exp arg] [val_id, k]
(Matching.for_function e.exp_loc None (Lvar val_id) val_cases partial)
in
List.fold_left (fun body (static_exception_id, val_ids, handler) ->
Lstaticcatch (body, (static_exception_id, val_ids), handler)
) classic static_handlers
and transl_letop loc env let_ ands param case partial =
let rec loop prev_lam = function
| [] -> prev_lam
| and_ :: rest ->
let left_id = Ident.create_local "left" in
let right_id = Ident.create_local "right" in
let op =
transl_ident and_.bop_op_name.loc env
and_.bop_op_type and_.bop_op_path and_.bop_op_val
in
let exp = transl_exp and_.bop_exp in
let lam =
bind Strict right_id exp
(Lapply{ap_should_be_tailcall = false;
ap_loc = and_.bop_loc;
ap_func = op;
ap_args=[Lvar left_id; Lvar right_id];
ap_inlined=Default_inline;
ap_specialised=Default_specialise})
in
bind Strict left_id prev_lam (loop lam rest)
in
let op =
transl_ident let_.bop_op_name.loc env
let_.bop_op_type let_.bop_op_path let_.bop_op_val
in
let exp = loop (transl_exp let_.bop_exp) ands in
let func =
let return_kind = value_kind case.c_rhs.exp_env case.c_rhs.exp_type in
let (kind, params, return), body =