-
Notifications
You must be signed in to change notification settings - Fork 86
/
Copy pathlambda.ml
1291 lines (1161 loc) · 40.4 KB
/
lambda.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. *)
(* *)
(**************************************************************************)
open Misc
open Asttypes
type mutable_flag = Immutable | Immutable_unique | Mutable
type compile_time_constant =
| Big_endian
| Word_size
| Int_size
| Max_wosize
| Ostype_unix
| Ostype_win32
| Ostype_cygwin
| Backend_type
type immediate_or_pointer =
| Immediate
| Pointer
type is_safe =
| Safe
| Unsafe
type field_read_semantics =
| Reads_agree
| Reads_vary
include (struct
type alloc_mode =
| Alloc_heap
| Alloc_local
let alloc_heap = Alloc_heap
let alloc_local : alloc_mode =
if Config.stack_allocation then Alloc_local
else Alloc_heap
let join_mode a b =
match a, b with
| Alloc_local, _ | _, Alloc_local -> Alloc_local
| Alloc_heap, Alloc_heap -> Alloc_heap
end : sig
type alloc_mode = private
| Alloc_heap
| Alloc_local
val alloc_heap : alloc_mode
val alloc_local : alloc_mode
val join_mode : alloc_mode -> alloc_mode -> alloc_mode
end)
let is_local_mode = function
| Alloc_heap -> false
| Alloc_local -> true
let is_heap_mode = function
| Alloc_heap -> true
| Alloc_local -> false
let sub_mode a b =
match a, b with
| Alloc_heap, _ -> true
| _, Alloc_local -> true
| Alloc_local, Alloc_heap -> false
let eq_mode a b =
match a, b with
| Alloc_heap, Alloc_heap -> true
| Alloc_local, Alloc_local -> true
| Alloc_heap, Alloc_local -> false
| Alloc_local, Alloc_heap -> false
type initialization_or_assignment =
| Assignment of alloc_mode
| Heap_initialization
| Root_initialization
type region_close =
| Rc_normal
| Rc_nontail
| Rc_close_at_apply
type primitive =
| Pbytes_to_string
| Pbytes_of_string
| Pignore
(* Globals *)
| Pgetglobal of Compilation_unit.t
| Psetglobal of Compilation_unit.t
| Pgetpredef of Ident.t
(* Operations on heap blocks *)
| Pmakeblock of int * mutable_flag * block_shape * alloc_mode
| Pmakefloatblock of mutable_flag * alloc_mode
| Pfield of int * field_read_semantics
| Pfield_computed of field_read_semantics
| Psetfield of int * immediate_or_pointer * initialization_or_assignment
| Psetfield_computed of immediate_or_pointer * initialization_or_assignment
| Pfloatfield of int * field_read_semantics * alloc_mode
| Psetfloatfield of int * initialization_or_assignment
| Pduprecord of Types.record_representation * int
(* Force lazy values *)
(* External call *)
| Pccall of Primitive.description
(* Exceptions *)
| Praise of raise_kind
(* Boolean operations *)
| Psequand | Psequor | Pnot
(* Integer operations *)
| Pnegint | Paddint | Psubint | Pmulint
| Pdivint of is_safe | Pmodint of is_safe
| Pandint | Porint | Pxorint
| Plslint | Plsrint | Pasrint
| Pintcomp of integer_comparison
| Pcompare_ints | Pcompare_floats | Pcompare_bints of boxed_integer
| Poffsetint of int
| Poffsetref of int
(* Float operations *)
| Pintoffloat | Pfloatofint of alloc_mode
| Pnegfloat of alloc_mode | Pabsfloat of alloc_mode
| Paddfloat of alloc_mode | Psubfloat of alloc_mode
| Pmulfloat of alloc_mode | Pdivfloat of alloc_mode
| Pfloatcomp of float_comparison
(* String operations *)
| Pstringlength | Pstringrefu | Pstringrefs
| Pbyteslength | Pbytesrefu | Pbytessetu | Pbytesrefs | Pbytessets
(* Array operations *)
| Pmakearray of array_kind * mutable_flag * alloc_mode
| Pduparray of array_kind * mutable_flag
| Parraylength of array_kind
| Parrayrefu of array_kind
| Parraysetu of array_kind
| Parrayrefs of array_kind
| Parraysets of array_kind
(* Test if the argument is a block or an immediate integer *)
| Pisint of { variant_only : bool }
(* Test if the (integer) argument is outside an interval *)
| Pisout
(* Operations on boxed integers (Nativeint.t, Int32.t, Int64.t) *)
| Pbintofint of boxed_integer * alloc_mode
| Pintofbint of boxed_integer
| Pcvtbint of boxed_integer (*source*) * boxed_integer (*destination*)
* alloc_mode
| Pnegbint of boxed_integer * alloc_mode
| Paddbint of boxed_integer * alloc_mode
| Psubbint of boxed_integer * alloc_mode
| Pmulbint of boxed_integer * alloc_mode
| Pdivbint of { size : boxed_integer; is_safe : is_safe; mode: alloc_mode }
| Pmodbint of { size : boxed_integer; is_safe : is_safe; mode: alloc_mode }
| Pandbint of boxed_integer * alloc_mode
| Porbint of boxed_integer * alloc_mode
| Pxorbint of boxed_integer * alloc_mode
| Plslbint of boxed_integer * alloc_mode
| Plsrbint of boxed_integer * alloc_mode
| Pasrbint of boxed_integer * alloc_mode
| Pbintcomp of boxed_integer * integer_comparison
(* Operations on Bigarrays: (unsafe, #dimensions, kind, layout) *)
| Pbigarrayref of bool * int * bigarray_kind * bigarray_layout
| Pbigarrayset of bool * int * bigarray_kind * bigarray_layout
(* size of the nth dimension of a Bigarray *)
| Pbigarraydim of int
(* load/set 16,32,64 bits from a string: (unsafe)*)
| Pstring_load_16 of bool
| Pstring_load_32 of bool * alloc_mode
| Pstring_load_64 of bool * alloc_mode
| Pbytes_load_16 of bool
| Pbytes_load_32 of bool * alloc_mode
| Pbytes_load_64 of bool * alloc_mode
| Pbytes_set_16 of bool
| Pbytes_set_32 of bool
| Pbytes_set_64 of bool
(* load/set 16,32,64 bits from a
(char, int8_unsigned_elt, c_layout) Bigarray.Array1.t : (unsafe) *)
| Pbigstring_load_16 of bool
| Pbigstring_load_32 of bool * alloc_mode
| Pbigstring_load_64 of bool * alloc_mode
| Pbigstring_set_16 of bool
| Pbigstring_set_32 of bool
| Pbigstring_set_64 of bool
(* Compile time constants *)
| Pctconst of compile_time_constant
(* byte swap *)
| Pbswap16
| Pbbswap of boxed_integer * alloc_mode
(* Integer to external pointer *)
| Pint_as_pointer
(* Inhibition of optimisation *)
| Popaque
(* Statically-defined probes *)
| Pprobe_is_enabled of { name: string }
(* Primitives for [Obj] *)
| Pobj_dup
| Pobj_magic
and integer_comparison =
Ceq | Cne | Clt | Cgt | Cle | Cge
and float_comparison =
CFeq | CFneq | CFlt | CFnlt | CFgt | CFngt | CFle | CFnle | CFge | CFnge
and value_kind =
Pgenval | Pfloatval | Pboxedintval of boxed_integer | Pintval
| Pvariant of {
consts : int list;
non_consts : (int * value_kind list) list;
}
| Parrayval of array_kind
and block_shape =
value_kind list option
and array_kind =
Pgenarray | Paddrarray | Pintarray | Pfloatarray
and boxed_integer = Primitive.boxed_integer =
Pnativeint | Pint32 | Pint64
and bigarray_kind =
Pbigarray_unknown
| Pbigarray_float32 | Pbigarray_float64
| Pbigarray_sint8 | Pbigarray_uint8
| Pbigarray_sint16 | Pbigarray_uint16
| Pbigarray_int32 | Pbigarray_int64
| Pbigarray_caml_int | Pbigarray_native_int
| Pbigarray_complex32 | Pbigarray_complex64
and bigarray_layout =
Pbigarray_unknown_layout
| Pbigarray_c_layout
| Pbigarray_fortran_layout
and raise_kind =
| Raise_regular
| Raise_reraise
| Raise_notrace
let equal_boxed_integer = Primitive.equal_boxed_integer
let equal_primitive =
(* Should be implemented like [equal_value_kind] of [equal_boxed_integer],
i.e. by matching over the various constructors but the type has more
than 100 constructors... *)
(=)
let rec equal_value_kind x y =
match x, y with
| Pgenval, Pgenval -> true
| Pfloatval, Pfloatval -> true
| Pboxedintval bi1, Pboxedintval bi2 -> equal_boxed_integer bi1 bi2
| Pintval, Pintval -> true
| Parrayval elt_kind1, Parrayval elt_kind2 -> elt_kind1 = elt_kind2
| Pvariant { consts = consts1; non_consts = non_consts1; },
Pvariant { consts = consts2; non_consts = non_consts2; } ->
let consts1 = List.sort Int.compare consts1 in
let consts2 = List.sort Int.compare consts2 in
let compare_by_tag (tag1, _) (tag2, _) = Int.compare tag1 tag2 in
let non_consts1 = List.sort compare_by_tag non_consts1 in
let non_consts2 = List.sort compare_by_tag non_consts2 in
List.equal Int.equal consts1 consts2
&& List.equal (fun (tag1, fields1) (tag2, fields2) ->
Int.equal tag1 tag2
&& List.length fields1 = List.length fields2
&& List.for_all2 equal_value_kind fields1 fields2)
non_consts1 non_consts2
| (Pgenval | Pfloatval | Pboxedintval _ | Pintval | Pvariant _
| Parrayval _), _ -> false
type structured_constant =
Const_base of constant
| Const_block of int * structured_constant list
| Const_float_array of string list
| Const_immstring of string
| Const_float_block of string list
type tailcall_attribute =
| Tailcall_expectation of bool
(* [@tailcall] and [@tailcall true] have [true],
[@tailcall false] has [false] *)
| Default_tailcall (* no [@tailcall] attribute *)
type inline_attribute =
| Always_inline (* [@inline] or [@inline always] *)
| Never_inline (* [@inline never] *)
| Available_inline (* [@inline available] *)
| Unroll of int (* [@unroll x] *)
| Default_inline (* no [@inline] attribute *)
type inlined_attribute =
| Always_inlined (* [@inlined] or [@inlined always] *)
| Never_inlined (* [@inlined never] *)
| Hint_inlined (* [@inlined hint] *)
| Unroll of int (* [@unroll x] *)
| Default_inlined (* no [@inlined] attribute *)
let equal_inline_attribute (x : inline_attribute) (y : inline_attribute) =
match x, y with
| Always_inline, Always_inline
| Never_inline, Never_inline
| Available_inline, Available_inline
| Default_inline, Default_inline
->
true
| Unroll u, Unroll v ->
u = v
| (Always_inline | Never_inline
| Available_inline | Unroll _ | Default_inline), _ ->
false
let equal_inlined_attribute (x : inlined_attribute) (y : inlined_attribute) =
match x, y with
| Always_inlined, Always_inlined
| Never_inlined, Never_inlined
| Hint_inlined, Hint_inlined
| Default_inlined, Default_inlined
->
true
| Unroll u, Unroll v ->
u = v
| (Always_inlined | Never_inlined
| Hint_inlined | Unroll _ | Default_inlined), _ ->
false
type probe_desc = { name: string }
type probe = probe_desc option
type specialise_attribute =
| Always_specialise (* [@specialise] or [@specialise always] *)
| Never_specialise (* [@specialise never] *)
| Default_specialise (* no [@specialise] attribute *)
let equal_specialise_attribute x y =
match x, y with
| Always_specialise, Always_specialise
| Never_specialise, Never_specialise
| Default_specialise, Default_specialise ->
true
| (Always_specialise | Never_specialise | Default_specialise), _ ->
false
type local_attribute =
| Always_local (* [@local] or [@local always] *)
| Never_local (* [@local never] *)
| Default_local (* [@local maybe] or no [@local] attribute *)
type property =
| Noalloc
type poll_attribute =
| Error_poll (* [@poll error] *)
| Default_poll (* no [@poll] attribute *)
type check_attribute =
| Default_check
| Assert of property
| Assume of property
type loop_attribute =
| Always_loop (* [@loop] or [@loop always] *)
| Never_loop (* [@loop never] *)
| Default_loop (* no [@loop] attribute *)
type function_kind = Curried of {nlocal: int} | Tupled
type let_kind = Strict | Alias | StrictOpt
type meth_kind = Self | Public | Cached
let equal_meth_kind x y =
match x, y with
| Self, Self -> true
| Public, Public -> true
| Cached, Cached -> true
| (Self | Public | Cached), _ -> false
type shared_code = (int * int) list
type function_attribute = {
inline : inline_attribute;
specialise : specialise_attribute;
local: local_attribute;
check : check_attribute;
poll: poll_attribute;
loop: loop_attribute;
is_a_functor: bool;
stub: bool;
tmc_candidate: bool;
}
type scoped_location = Debuginfo.Scoped_location.t
type lambda =
Lvar of Ident.t
| Lmutvar of Ident.t
| Lconst of structured_constant
| Lapply of lambda_apply
| Lfunction of lfunction
| Llet of let_kind * value_kind * Ident.t * lambda * lambda
| Lmutlet of value_kind * Ident.t * lambda * lambda
| Lletrec of (Ident.t * lambda) list * lambda
| Lprim of primitive * lambda list * scoped_location
| Lswitch of lambda * lambda_switch * scoped_location * value_kind
| Lstringswitch of
lambda * (string * lambda) list * lambda option * scoped_location * value_kind
| Lstaticraise of int * lambda list
| Lstaticcatch of lambda * (int * (Ident.t * value_kind) list) * lambda * value_kind
| Ltrywith of lambda * Ident.t * lambda * value_kind
| Lifthenelse of lambda * lambda * lambda * value_kind
| Lsequence of lambda * lambda
| Lwhile of lambda_while
| Lfor of lambda_for
| Lassign of Ident.t * lambda
| Lsend of
meth_kind * lambda * lambda * lambda list
* region_close * alloc_mode * scoped_location
| Levent of lambda * lambda_event
| Lifused of Ident.t * lambda
| Lregion of lambda
and lfunction =
{ kind: function_kind;
params: (Ident.t * value_kind) list;
return: value_kind;
body: lambda;
attr: function_attribute; (* specified with [@inline] attribute *)
loc: scoped_location;
mode: alloc_mode;
region: bool; }
and lambda_while =
{ wh_cond : lambda;
wh_cond_region : bool;
wh_body : lambda;
wh_body_region : bool
}
and lambda_for =
{ for_id : Ident.t;
for_from : lambda;
for_to : lambda;
for_dir : direction_flag;
for_body : lambda;
for_region : bool;
}
and lambda_apply =
{ ap_func : lambda;
ap_args : lambda list;
ap_region_close : region_close;
ap_mode : alloc_mode;
ap_loc : scoped_location;
ap_tailcall : tailcall_attribute;
ap_inlined : inlined_attribute;
ap_specialised : specialise_attribute;
ap_probe : probe;
}
and lambda_switch =
{ sw_numconsts: int;
sw_consts: (int * lambda) list;
sw_numblocks: int;
sw_blocks: (int * lambda) list;
sw_failaction : lambda option}
and lambda_event =
{ lev_loc: scoped_location;
lev_kind: lambda_event_kind;
lev_repr: int ref option;
lev_env: Env.t }
and lambda_event_kind =
Lev_before
| Lev_after of Types.type_expr
| Lev_function
| Lev_pseudo
| Lev_module_definition of Ident.t
type program =
{ compilation_unit : Compilation_unit.t;
main_module_block_size : int;
required_globals : Compilation_unit.Set.t;
code : lambda }
let const_int n = Const_base (Const_int n)
let const_unit = const_int 0
let max_arity () =
if !Clflags.native_code then 126 else max_int
(* 126 = 127 (the maximal number of parameters supported in C--)
- 1 (the hidden parameter containing the environment) *)
let lfunction ~kind ~params ~return ~body ~attr ~loc ~mode ~region =
assert (List.length params <= max_arity ());
(* A curried function type with n parameters has n arrows. Of these,
the first [n-nlocal] have return mode Heap, while the remainder
have return mode Local, except possibly the final one.
That is, after supplying the first [n-nlocal] arguments, further
partial applications must be locally allocated.
A curried function with no local parameters or returns has kind
[Curried {nlocal=0}]. *)
begin match mode, kind with
| Alloc_heap, Tupled -> ()
| Alloc_local, Tupled ->
(* Tupled optimisation does not apply to local functions *)
assert false
| mode, Curried {nlocal} ->
let nparams = List.length params in
assert (0 <= nlocal);
assert (nlocal <= nparams);
if not region then assert (nlocal >= 1);
if is_local_mode mode then assert (nlocal = nparams)
end;
Lfunction { kind; params; return; body; attr; loc; mode; region }
let lambda_unit = Lconst const_unit
let default_function_attribute = {
inline = Default_inline;
specialise = Default_specialise;
local = Default_local;
check = Default_check ;
poll = Default_poll;
loop = Default_loop;
is_a_functor = false;
stub = false;
tmc_candidate = false;
}
let default_stub_attribute =
{ default_function_attribute with stub = true }
(* Build sharing keys *)
(*
Those keys are later compared with Stdlib.compare.
For that reason, they should not include cycles.
*)
let max_raw = 32
let make_key e =
let exception Not_simple in
let count = ref 0 (* Used for controlling size *)
and make_key = Ident.make_key_generator () in
(* make_key is used for normalizing let-bound variables *)
let rec tr_rec env e =
incr count ;
if !count > max_raw then raise Not_simple ; (* Too big ! *)
match e with
| Lvar id
| Lmutvar id ->
begin
try Ident.find_same id env
with Not_found -> e
end
| Lconst (Const_base (Const_string _)) ->
(* Mutable constants are not shared *)
raise Not_simple
| Lconst _ -> e
| Lapply ap ->
Lapply {ap with ap_func = tr_rec env ap.ap_func;
ap_args = tr_recs env ap.ap_args;
ap_loc = Loc_unknown}
| Llet (Alias,_k,x,ex,e) -> (* Ignore aliases -> substitute *)
let ex = tr_rec env ex in
tr_rec (Ident.add x ex env) e
| Llet ((Strict | StrictOpt),_k,x,ex,Lvar v) when Ident.same v x ->
tr_rec env ex
| Llet (str,k,x,ex,e) ->
(* Because of side effects, keep other lets with normalized names *)
let ex = tr_rec env ex in
let y = make_key x in
Llet (str,k,y,ex,tr_rec (Ident.add x (Lvar y) env) e)
| Lmutlet (k,x,ex,e) ->
let ex = tr_rec env ex in
let y = make_key x in
Lmutlet (k,y,ex,tr_rec (Ident.add x (Lmutvar y) env) e)
| Lprim (p,es,_) ->
Lprim (p,tr_recs env es, Loc_unknown)
| Lswitch (e,sw,loc,kind) ->
Lswitch (tr_rec env e,tr_sw env sw,loc,kind)
| Lstringswitch (e,sw,d,_,kind) ->
Lstringswitch
(tr_rec env e,
List.map (fun (s,e) -> s,tr_rec env e) sw,
tr_opt env d,
Loc_unknown,kind)
| Lstaticraise (i,es) ->
Lstaticraise (i,tr_recs env es)
| Lstaticcatch (e1,xs,e2, kind) ->
Lstaticcatch (tr_rec env e1,xs,tr_rec env e2, kind)
| Ltrywith (e1,x,e2,kind) ->
Ltrywith (tr_rec env e1,x,tr_rec env e2,kind)
| Lifthenelse (cond,ifso,ifnot,kind) ->
Lifthenelse (tr_rec env cond,tr_rec env ifso,tr_rec env ifnot,kind)
| Lsequence (e1,e2) ->
Lsequence (tr_rec env e1,tr_rec env e2)
| Lassign (x,e) ->
Lassign (x,tr_rec env e)
| Lsend (m,e1,e2,es,pos,mo,_loc) ->
Lsend (m,tr_rec env e1,tr_rec env e2,tr_recs env es,pos,mo,Loc_unknown)
| Lifused (id,e) -> Lifused (id,tr_rec env e)
| Lregion e -> Lregion (tr_rec env e)
| Lletrec _|Lfunction _
| Lfor _ | Lwhile _
(* Beware: (PR#6412) the event argument to Levent
may include cyclic structure of type Type.typexpr *)
| Levent _ ->
raise Not_simple
and tr_recs env es = List.map (tr_rec env) es
and tr_sw env sw =
{ sw with
sw_consts = List.map (fun (i,e) -> i,tr_rec env e) sw.sw_consts ;
sw_blocks = List.map (fun (i,e) -> i,tr_rec env e) sw.sw_blocks ;
sw_failaction = tr_opt env sw.sw_failaction ; }
and tr_opt env = function
| None -> None
| Some e -> Some (tr_rec env e) in
try
Some (tr_rec Ident.empty e)
with Not_simple -> None
(***************)
let name_lambda strict arg fn =
match arg with
Lvar id -> fn id
| _ ->
let id = Ident.create_local "let" in
Llet(strict, Pgenval, id, arg, fn id)
let name_lambda_list args fn =
let rec name_list names = function
[] -> fn (List.rev names)
| (Lvar _ as arg) :: rem ->
name_list (arg :: names) rem
| arg :: rem ->
let id = Ident.create_local "let" in
Llet(Strict, Pgenval, id, arg, name_list (Lvar id :: names) rem) in
name_list [] args
let iter_opt f = function
| None -> ()
| Some e -> f e
let shallow_iter ~tail ~non_tail:f = function
Lvar _
| Lmutvar _
| Lconst _ -> ()
| Lapply{ap_func = fn; ap_args = args} ->
f fn; List.iter f args
| Lfunction{body} ->
f body
| Llet(_, _k, _id, arg, body)
| Lmutlet(_k, _id, arg, body) ->
f arg; tail body
| Lletrec(decl, body) ->
tail body;
List.iter (fun (_id, exp) -> f exp) decl
| Lprim (Psequand, [l1; l2], _)
| Lprim (Psequor, [l1; l2], _) ->
f l1;
tail l2
| Lprim(_p, args, _loc) ->
List.iter f args
| Lswitch(arg, sw,_,_) ->
f arg;
List.iter (fun (_key, case) -> tail case) sw.sw_consts;
List.iter (fun (_key, case) -> tail case) sw.sw_blocks;
iter_opt tail sw.sw_failaction
| Lstringswitch (arg,cases,default,_,_) ->
f arg ;
List.iter (fun (_,act) -> tail act) cases ;
iter_opt tail default
| Lstaticraise (_,args) ->
List.iter f args
| Lstaticcatch(e1, _, e2, _kind) ->
tail e1; tail e2
| Ltrywith(e1, _, e2,_) ->
f e1; tail e2
| Lifthenelse(e1, e2, e3,_) ->
f e1; tail e2; tail e3
| Lsequence(e1, e2) ->
f e1; tail e2
| Lwhile {wh_cond; wh_body} ->
f wh_cond; f wh_body
| Lfor {for_from; for_to; for_body} ->
f for_from; f for_to; f for_body
| Lassign(_, e) ->
f e
| Lsend (_k, met, obj, args, _, _, _) ->
List.iter f (met::obj::args)
| Levent (e, _evt) ->
tail e
| Lifused (_v, e) ->
tail e
| Lregion e ->
f e
let iter_head_constructor f l =
shallow_iter ~tail:f ~non_tail:f l
let rec free_variables = function
| Lvar id
| Lmutvar id -> Ident.Set.singleton id
| Lconst _ -> Ident.Set.empty
| Lapply{ap_func = fn; ap_args = args} ->
free_variables_list (free_variables fn) args
| Lfunction{body; params} ->
Ident.Set.diff (free_variables body)
(Ident.Set.of_list (List.map fst params))
| Llet(_, _k, id, arg, body)
| Lmutlet(_k, id, arg, body) ->
Ident.Set.union
(free_variables arg)
(Ident.Set.remove id (free_variables body))
| Lletrec(decl, body) ->
let set = free_variables_list (free_variables body) (List.map snd decl) in
Ident.Set.diff set (Ident.Set.of_list (List.map fst decl))
| Lprim(_p, args, _loc) ->
free_variables_list Ident.Set.empty args
| Lswitch(arg, sw,_,_) ->
let set =
free_variables_list
(free_variables_list (free_variables arg)
(List.map snd sw.sw_consts))
(List.map snd sw.sw_blocks)
in
begin match sw.sw_failaction with
| None -> set
| Some failaction -> Ident.Set.union set (free_variables failaction)
end
| Lstringswitch (arg,cases,default,_,_) ->
let set =
free_variables_list (free_variables arg)
(List.map snd cases)
in
begin match default with
| None -> set
| Some default -> Ident.Set.union set (free_variables default)
end
| Lstaticraise (_,args) ->
free_variables_list Ident.Set.empty args
| Lstaticcatch(body, (_, params), handler, _kind) ->
Ident.Set.union
(Ident.Set.diff
(free_variables handler)
(Ident.Set.of_list (List.map fst params)))
(free_variables body)
| Ltrywith(body, param, handler, _) ->
Ident.Set.union
(Ident.Set.remove
param
(free_variables handler))
(free_variables body)
| Lifthenelse(e1, e2, e3, _) ->
Ident.Set.union
(Ident.Set.union (free_variables e1) (free_variables e2))
(free_variables e3)
| Lsequence(e1, e2) ->
Ident.Set.union (free_variables e1) (free_variables e2)
| Lwhile {wh_cond; wh_body} ->
Ident.Set.union (free_variables wh_cond) (free_variables wh_body)
| Lfor {for_id; for_from; for_to; for_body} ->
Ident.Set.union (free_variables for_from)
(Ident.Set.union (free_variables for_to)
(Ident.Set.remove for_id (free_variables for_body)))
| Lassign(id, e) ->
Ident.Set.add id (free_variables e)
| Lsend (_k, met, obj, args, _, _, _) ->
free_variables_list
(Ident.Set.union (free_variables met) (free_variables obj))
args
| Levent (lam, _evt) ->
free_variables lam
| Lifused (_v, e) ->
(* Shouldn't v be considered a free variable ? *)
free_variables e
| Lregion e ->
free_variables e
and free_variables_list set exprs =
List.fold_left (fun set expr -> Ident.Set.union (free_variables expr) set)
set exprs
(* Check if an action has a "when" guard *)
let raise_count = ref 0
let next_raise_count () =
incr raise_count ;
!raise_count
(* Anticipated staticraise, for guards *)
let staticfail = Lstaticraise (0,[])
let rec is_guarded = function
| Lifthenelse(_cond, _body, Lstaticraise (0,[]),_) -> true
| Llet(_str, _k, _id, _lam, body) -> is_guarded body
| Levent(lam, _ev) -> is_guarded lam
| _ -> false
let rec patch_guarded patch = function
| Lifthenelse (cond, body, Lstaticraise (0,[]), kind) ->
Lifthenelse (cond, body, patch, kind)
| Llet(str, k, id, lam, body) ->
Llet (str, k, id, lam, patch_guarded patch body)
| Levent(lam, ev) ->
Levent (patch_guarded patch lam, ev)
| _ -> fatal_error "Lambda.patch_guarded"
(* Translate an access path *)
let rec transl_address loc = function
| Env.Aunit cu -> Lprim(Pgetglobal cu, [], loc)
| Env.Alocal id ->
if Ident.is_predef id
then Lprim (Pgetpredef id, [], loc)
else Lvar id
| Env.Adot(addr, pos) ->
Lprim(Pfield (pos, Reads_agree), [transl_address loc addr], loc)
let transl_path find loc env path =
match find path env with
| exception Not_found ->
fatal_error ("Cannot find address for: " ^ (Path.name path))
| addr -> transl_address loc addr
(* Translation of identifiers *)
let transl_module_path loc env path =
transl_path Env.find_module_address loc env path
let transl_value_path loc env path =
transl_path Env.find_value_address loc env path
let transl_extension_path loc env path =
transl_path Env.find_constructor_address loc env path
let transl_class_path loc env path =
transl_path Env.find_class_address loc env path
let transl_prim mod_name name =
let pers = Ident.create_persistent mod_name in
let env = Env.add_persistent_structure pers Env.empty in
let lid = Longident.Ldot (Longident.Lident mod_name, name) in
match Env.find_value_by_name lid env with
| path, _ -> transl_value_path Loc_unknown env path
| exception Not_found ->
fatal_error ("Primitive " ^ name ^ " not found.")
(* Compile a sequence of expressions *)
let rec make_sequence fn = function
[] -> lambda_unit
| [x] -> fn x
| x::rem ->
let lam = fn x in Lsequence(lam, make_sequence fn rem)
(* Apply a substitution to a lambda-term.
Assumes that the image of the substitution is out of reach
of the bound variables of the lambda-term (no capture). *)
let subst update_env ?(freshen_bound_variables = false) s input_lam =
(* [s] contains a partial substitution for the free variables of the
input term [input_lam].
During our traversal of the term we maintain a second environment
[l] with all the bound variables of [input_lam] in the current
scope, mapped to either themselves or freshened versions of
themselves when [freshen_bound_variables] is set. *)
let bind id l =
let id' = if not freshen_bound_variables then id else Ident.rename id in
id', Ident.Map.add id id' l
in
let bind_many ids l =
List.fold_right (fun (id, rhs) (ids', l) ->
let id', l = bind id l in
((id', rhs) :: ids' , l)
) ids ([], l)
in
let rec subst s l lam =
match lam with
| Lvar id as lam ->
begin match Ident.Map.find id l with
| id' -> Lvar id'
| exception Not_found ->
(* note: as this point we know [id] is not a bound
variable of the input term, otherwise it would belong
to [l]; it is a free variable of the input term. *)
begin try Ident.Map.find id s with Not_found -> lam end
end
| Lmutvar id as lam ->
begin match Ident.Map.find id l with
| id' -> Lmutvar id'
| exception Not_found ->
(* Note: a mutable [id] should not appear in [s].
Keeping the behavior of Lvar case for now. *)
begin try Ident.Map.find id s with Not_found -> lam end
end
| Lconst _ as l -> l
| Lapply ap ->
Lapply{ap with ap_func = subst s l ap.ap_func;
ap_args = subst_list s l ap.ap_args}
| Lfunction lf ->
let params, l' = bind_many lf.params l in
Lfunction {lf with params; body = subst s l' lf.body}
| Llet(str, k, id, arg, body) ->
let id, l' = bind id l in
Llet(str, k, id, subst s l arg, subst s l' body)
| Lmutlet(k, id, arg, body) ->
let id, l' = bind id l in
Lmutlet(k, id, subst s l arg, subst s l' body)
| Lletrec(decl, body) ->
let decl, l' = bind_many decl l in
Lletrec(List.map (subst_decl s l') decl, subst s l' body)
| Lprim(p, args, loc) -> Lprim(p, subst_list s l args, loc)
| Lswitch(arg, sw, loc,kind) ->
Lswitch(subst s l arg,
{sw with sw_consts = List.map (subst_case s l) sw.sw_consts;
sw_blocks = List.map (subst_case s l) sw.sw_blocks;
sw_failaction = subst_opt s l sw.sw_failaction; },
loc,kind)
| Lstringswitch (arg,cases,default,loc,kind) ->
Lstringswitch
(subst s l arg,
List.map (subst_strcase s l) cases,
subst_opt s l default,
loc,kind)
| Lstaticraise (i,args) -> Lstaticraise (i, subst_list s l args)
| Lstaticcatch(body, (id, params), handler, kind) ->
let params, l' = bind_many params l in
Lstaticcatch(subst s l body, (id, params),
subst s l' handler, kind)
| Ltrywith(body, exn, handler,kind) ->
let exn, l' = bind exn l in
Ltrywith(subst s l body, exn, subst s l' handler,kind)
| Lifthenelse(e1, e2, e3,kind) ->
Lifthenelse(subst s l e1, subst s l e2, subst s l e3,kind)
| Lsequence(e1, e2) -> Lsequence(subst s l e1, subst s l e2)
| Lwhile lw -> Lwhile {lw with wh_cond = subst s l lw.wh_cond;
wh_body = subst s l lw.wh_body}
| Lfor lf ->
let for_id, l' = bind lf.for_id l in
Lfor {lf with for_id;
for_from = subst s l lf.for_from;
for_to = subst s l lf.for_to;
for_body = subst s l' lf.for_body}
| Lassign(id, e) ->
assert (not (Ident.Map.mem id s));
let id = try Ident.Map.find id l with Not_found -> id in
Lassign(id, subst s l e)
| Lsend (k, met, obj, args, pos, mode, loc) ->
Lsend (k, subst s l met, subst s l obj, subst_list s l args,
pos, mode, loc)
| Levent (lam, evt) ->
let old_env = evt.lev_env in
let env_updates =
let find_in_old id = Env.find_value (Path.Pident id) old_env in
let rebind id id' new_env =
match find_in_old id with
| exception Not_found -> new_env
| vd -> Env.add_value id' vd new_env
in
let update_free id new_env =
match find_in_old id with
| exception Not_found -> new_env
| vd -> update_env id vd new_env
in
Ident.Map.merge (fun id bound free ->
match bound, free with
| Some id', _ ->
if Ident.equal id id' then None else Some (rebind id id')