forked from ocaml/ocaml
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathclosure.ml
1374 lines (1298 loc) · 51.9 KB
/
closure.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. *)
(* *)
(**************************************************************************)
(* Introduction of closures, uncurrying, recognition of direct calls *)
open Misc
open Asttypes
open Primitive
open Lambda
open Switch
open Clambda
module Storer =
Switch.Store
(struct
type t = lambda
type key = lambda
let make_key = Lambda.make_key
end)
(* Auxiliaries for compiling functions *)
let rec split_list n l =
if n <= 0 then ([], l) else begin
match l with
[] -> fatal_error "Closure.split_list"
| a::l -> let (l1, l2) = split_list (n-1) l in (a::l1, l2)
end
let rec build_closure_env env_param pos = function
[] -> Tbl.empty
| id :: rem ->
Tbl.add id (Uprim(Pfield pos, [Uvar env_param], Debuginfo.none))
(build_closure_env env_param (pos+1) rem)
(* Auxiliary for accessing globals. We change the name of the global
to the name of the corresponding asm symbol. This is done here
and no longer in Cmmgen so that approximations stored in .cmx files
contain the right names if the -for-pack option is active. *)
let getglobal dbg id =
Uprim(Pgetglobal (Ident.create_persistent (Compilenv.symbol_for_global id)),
[], dbg)
(* Check if a variable occurs in a [clambda] term. *)
let occurs_var var u =
let rec occurs = function
Uvar v -> v = var
| Uconst _ -> false
| Udirect_apply(_lbl, args, _) -> List.exists occurs args
| Ugeneric_apply(funct, args, _) -> occurs funct || List.exists occurs args
| Uclosure(_fundecls, clos) -> List.exists occurs clos
| Uoffset(u, _ofs) -> occurs u
| Ulet(_str, _kind, _id, def, body) -> occurs def || occurs body
| Uletrec(decls, body) ->
List.exists (fun (_id, u) -> occurs u) decls || occurs body
| Uprim(_p, args, _) -> List.exists occurs args
| Uswitch(arg, s, _dbg) ->
occurs arg ||
occurs_array s.us_actions_consts || occurs_array s.us_actions_blocks
| Ustringswitch(arg,sw,d) ->
occurs arg ||
List.exists (fun (_,e) -> occurs e) sw ||
(match d with None -> false | Some d -> occurs d)
| Ustaticfail (_, args) -> List.exists occurs args
| Ucatch(_, _, body, hdlr) -> occurs body || occurs hdlr
| Utrywith(body, _exn, hdlr) -> occurs body || occurs hdlr
| Uifthenelse(cond, ifso, ifnot) ->
occurs cond || occurs ifso || occurs ifnot
| Usequence(u1, u2) -> occurs u1 || occurs u2
| Uwhile(cond, body) -> occurs cond || occurs body
| Ufor(_id, lo, hi, _dir, body) -> occurs lo || occurs hi || occurs body
| Uassign(id, u) -> id = var || occurs u
| Usend(_, met, obj, args, _) ->
occurs met || occurs obj || List.exists occurs args
| Uunreachable -> false
and occurs_array a =
try
for i = 0 to Array.length a - 1 do
if occurs a.(i) then raise Exit
done;
false
with Exit ->
true
in occurs u
(* Determine whether the estimated size of a clambda term is below
some threshold *)
let prim_size prim args =
match prim with
Pidentity | Pbytes_to_string | Pbytes_of_string -> 0
| Pgetglobal _ -> 1
| Psetglobal _ -> 1
| Pmakeblock _ -> 5 + List.length args
| Pfield _ -> 1
| Psetfield(_f, isptr, init) ->
begin match init with
| Root_initialization -> 1 (* never causes a write barrier hit *)
| Assignment | Heap_initialization ->
match isptr with
| Pointer -> 4
| Immediate -> 1
end
| Pfloatfield _ -> 1
| Psetfloatfield _ -> 1
| Pduprecord _ -> 10 + List.length args
| Pccall p -> (if p.prim_alloc then 10 else 4) + List.length args
| Praise _ -> 4
| Pstringlength -> 5
| Pbyteslength -> 5
| Pstringrefs -> 6
| Pbytesrefs | Pbytessets -> 6
| Pmakearray _ -> 5 + List.length args
| Parraylength kind -> if kind = Pgenarray then 6 else 2
| Parrayrefu kind -> if kind = Pgenarray then 12 else 2
| Parraysetu kind -> if kind = Pgenarray then 16 else 4
| Parrayrefs kind -> if kind = Pgenarray then 18 else 8
| Parraysets kind -> if kind = Pgenarray then 22 else 10
| Pbittest -> 3
| Pbigarrayref(_, ndims, _, _) -> 4 + ndims * 6
| Pbigarrayset(_, ndims, _, _) -> 4 + ndims * 6
| _ -> 2 (* arithmetic and comparisons *)
(* Very raw approximation of switch cost *)
let lambda_smaller lam threshold =
let size = ref 0 in
let rec lambda_size lam =
if !size > threshold then raise Exit;
match lam with
Uvar _ -> ()
| Uconst _ -> incr size
| Udirect_apply(_, args, _) ->
size := !size + 4; lambda_list_size args
| Ugeneric_apply(fn, args, _) ->
size := !size + 6; lambda_size fn; lambda_list_size args
| Uclosure _ ->
raise Exit (* inlining would duplicate function definitions *)
| Uoffset(lam, _ofs) ->
incr size; lambda_size lam
| Ulet(_str, _kind, _id, lam, body) ->
lambda_size lam; lambda_size body
| Uletrec _ ->
raise Exit (* usually too large *)
| Uprim(prim, args, _) ->
size := !size + prim_size prim args;
lambda_list_size args
| Uswitch(lam, cases, _dbg) ->
if Array.length cases.us_actions_consts > 1 then size := !size + 5 ;
if Array.length cases.us_actions_blocks > 1 then size := !size + 5 ;
lambda_size lam;
lambda_array_size cases.us_actions_consts ;
lambda_array_size cases.us_actions_blocks
| Ustringswitch (lam,sw,d) ->
lambda_size lam ;
(* as ifthenelse *)
List.iter
(fun (_,lam) ->
size := !size+2 ;
lambda_size lam)
sw ;
Misc.may lambda_size d
| Ustaticfail (_,args) -> lambda_list_size args
| Ucatch(_, _, body, handler) ->
incr size; lambda_size body; lambda_size handler
| Utrywith(body, _id, handler) ->
size := !size + 8; lambda_size body; lambda_size handler
| Uifthenelse(cond, ifso, ifnot) ->
size := !size + 2;
lambda_size cond; lambda_size ifso; lambda_size ifnot
| Usequence(lam1, lam2) ->
lambda_size lam1; lambda_size lam2
| Uwhile(cond, body) ->
size := !size + 2; lambda_size cond; lambda_size body
| Ufor(_id, low, high, _dir, body) ->
size := !size + 4; lambda_size low; lambda_size high; lambda_size body
| Uassign(_id, lam) ->
incr size; lambda_size lam
| Usend(_, met, obj, args, _) ->
size := !size + 8;
lambda_size met; lambda_size obj; lambda_list_size args
| Uunreachable -> ()
and lambda_list_size l = List.iter lambda_size l
and lambda_array_size a = Array.iter lambda_size a in
try
lambda_size lam; !size <= threshold
with Exit ->
false
let is_pure_prim p =
let open Semantics_of_primitives in
match Semantics_of_primitives.for_primitive p with
| (No_effects | Only_generative_effects), _ -> true
| Arbitrary_effects, _ -> false
(* Check if a clambda term is ``pure'',
that is without side-effects *and* not containing function definitions *)
let rec is_pure_clambda = function
Uvar _ -> true
| Uconst _ -> true
| Uprim(p, args, _) -> is_pure_prim p && List.for_all is_pure_clambda args
| _ -> false
(* Simplify primitive operations on known arguments *)
let make_const c = (Uconst c, Value_const c)
let make_const_ref c =
make_const(Uconst_ref(Compilenv.new_structured_constant ~shared:true c,
Some c))
let make_const_int n = make_const (Uconst_int n)
let make_const_ptr n = make_const (Uconst_ptr n)
let make_const_bool b = make_const_ptr(if b then 1 else 0)
let make_comparison cmp x y =
make_const_bool
(match cmp with
Ceq -> x = y
| Cneq -> x <> y
| Clt -> x < y
| Cgt -> x > y
| Cle -> x <= y
| Cge -> x >= y)
let make_const_float n = make_const_ref (Uconst_float n)
let make_const_natint n = make_const_ref (Uconst_nativeint n)
let make_const_int32 n = make_const_ref (Uconst_int32 n)
let make_const_int64 n = make_const_ref (Uconst_int64 n)
(* The [fpc] parameter is true if constant propagation of
floating-point computations is allowed *)
let simplif_arith_prim_pure fpc p (args, approxs) dbg =
let default = (Uprim(p, args, dbg), Value_unknown) in
match approxs with
(* int (or enumerated type) *)
| [ Value_const(Uconst_int n1 | Uconst_ptr n1) ] ->
begin match p with
| Pnot -> make_const_bool (n1 = 0)
| Pnegint -> make_const_int (- n1)
| Poffsetint n -> make_const_int (n + n1)
| Pfloatofint when fpc -> make_const_float (float_of_int n1)
| Pbintofint Pnativeint -> make_const_natint (Nativeint.of_int n1)
| Pbintofint Pint32 -> make_const_int32 (Int32.of_int n1)
| Pbintofint Pint64 -> make_const_int64 (Int64.of_int n1)
| Pbswap16 -> make_const_int (((n1 land 0xff) lsl 8)
lor ((n1 land 0xff00) lsr 8))
| _ -> default
end
(* int (or enumerated type), int (or enumerated type) *)
| [ Value_const(Uconst_int n1 | Uconst_ptr n1);
Value_const(Uconst_int n2 | Uconst_ptr n2) ] ->
begin match p with
| Psequand -> make_const_bool (n1 <> 0 && n2 <> 0)
| Psequor -> make_const_bool (n1 <> 0 || n2 <> 0)
| Paddint -> make_const_int (n1 + n2)
| Psubint -> make_const_int (n1 - n2)
| Pmulint -> make_const_int (n1 * n2)
| Pdivint _ when n2 <> 0 -> make_const_int (n1 / n2)
| Pmodint _ when n2 <> 0 -> make_const_int (n1 mod n2)
| Pandint -> make_const_int (n1 land n2)
| Porint -> make_const_int (n1 lor n2)
| Pxorint -> make_const_int (n1 lxor n2)
| Plslint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_int (n1 lsl n2)
| Plsrint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_int (n1 lsr n2)
| Pasrint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_int (n1 asr n2)
| Pintcomp c -> make_comparison c n1 n2
| _ -> default
end
(* float *)
| [Value_const(Uconst_ref(_, Some (Uconst_float n1)))] when fpc ->
begin match p with
| Pintoffloat -> make_const_int (int_of_float n1)
| Pnegfloat -> make_const_float (-. n1)
| Pabsfloat -> make_const_float (abs_float n1)
| _ -> default
end
(* float, float *)
| [Value_const(Uconst_ref(_, Some (Uconst_float n1)));
Value_const(Uconst_ref(_, Some (Uconst_float n2)))] when fpc ->
begin match p with
| Paddfloat -> make_const_float (n1 +. n2)
| Psubfloat -> make_const_float (n1 -. n2)
| Pmulfloat -> make_const_float (n1 *. n2)
| Pdivfloat -> make_const_float (n1 /. n2)
| Pfloatcomp c -> make_comparison c n1 n2
| _ -> default
end
(* nativeint *)
| [Value_const(Uconst_ref(_, Some (Uconst_nativeint n)))] ->
begin match p with
| Pintofbint Pnativeint -> make_const_int (Nativeint.to_int n)
| Pcvtbint(Pnativeint, Pint32) -> make_const_int32 (Nativeint.to_int32 n)
| Pcvtbint(Pnativeint, Pint64) -> make_const_int64 (Int64.of_nativeint n)
| Pnegbint Pnativeint -> make_const_natint (Nativeint.neg n)
| _ -> default
end
(* nativeint, nativeint *)
| [Value_const(Uconst_ref(_, Some (Uconst_nativeint n1)));
Value_const(Uconst_ref(_, Some (Uconst_nativeint n2)))] ->
begin match p with
| Paddbint Pnativeint -> make_const_natint (Nativeint.add n1 n2)
| Psubbint Pnativeint -> make_const_natint (Nativeint.sub n1 n2)
| Pmulbint Pnativeint -> make_const_natint (Nativeint.mul n1 n2)
| Pdivbint {size=Pnativeint} when n2 <> 0n ->
make_const_natint (Nativeint.div n1 n2)
| Pmodbint {size=Pnativeint} when n2 <> 0n ->
make_const_natint (Nativeint.rem n1 n2)
| Pandbint Pnativeint -> make_const_natint (Nativeint.logand n1 n2)
| Porbint Pnativeint -> make_const_natint (Nativeint.logor n1 n2)
| Pxorbint Pnativeint -> make_const_natint (Nativeint.logxor n1 n2)
| Pbintcomp(Pnativeint, c) -> make_comparison c n1 n2
| _ -> default
end
(* nativeint, int *)
| [Value_const(Uconst_ref(_, Some (Uconst_nativeint n1)));
Value_const(Uconst_int n2)] ->
begin match p with
| Plslbint Pnativeint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_natint (Nativeint.shift_left n1 n2)
| Plsrbint Pnativeint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_natint (Nativeint.shift_right_logical n1 n2)
| Pasrbint Pnativeint when 0 <= n2 && n2 < 8 * Arch.size_int ->
make_const_natint (Nativeint.shift_right n1 n2)
| _ -> default
end
(* int32 *)
| [Value_const(Uconst_ref(_, Some (Uconst_int32 n)))] ->
begin match p with
| Pintofbint Pint32 -> make_const_int (Int32.to_int n)
| Pcvtbint(Pint32, Pnativeint) -> make_const_natint (Nativeint.of_int32 n)
| Pcvtbint(Pint32, Pint64) -> make_const_int64 (Int64.of_int32 n)
| Pnegbint Pint32 -> make_const_int32 (Int32.neg n)
| _ -> default
end
(* int32, int32 *)
| [Value_const(Uconst_ref(_, Some (Uconst_int32 n1)));
Value_const(Uconst_ref(_, Some (Uconst_int32 n2)))] ->
begin match p with
| Paddbint Pint32 -> make_const_int32 (Int32.add n1 n2)
| Psubbint Pint32 -> make_const_int32 (Int32.sub n1 n2)
| Pmulbint Pint32 -> make_const_int32 (Int32.mul n1 n2)
| Pdivbint {size=Pint32} when n2 <> 0l ->
make_const_int32 (Int32.div n1 n2)
| Pmodbint {size=Pint32} when n2 <> 0l ->
make_const_int32 (Int32.rem n1 n2)
| Pandbint Pint32 -> make_const_int32 (Int32.logand n1 n2)
| Porbint Pint32 -> make_const_int32 (Int32.logor n1 n2)
| Pxorbint Pint32 -> make_const_int32 (Int32.logxor n1 n2)
| Pbintcomp(Pint32, c) -> make_comparison c n1 n2
| _ -> default
end
(* int32, int *)
| [Value_const(Uconst_ref(_, Some (Uconst_int32 n1)));
Value_const(Uconst_int n2)] ->
begin match p with
| Plslbint Pint32 when 0 <= n2 && n2 < 32 ->
make_const_int32 (Int32.shift_left n1 n2)
| Plsrbint Pint32 when 0 <= n2 && n2 < 32 ->
make_const_int32 (Int32.shift_right_logical n1 n2)
| Pasrbint Pint32 when 0 <= n2 && n2 < 32 ->
make_const_int32 (Int32.shift_right n1 n2)
| _ -> default
end
(* int64 *)
| [Value_const(Uconst_ref(_, Some (Uconst_int64 n)))] ->
begin match p with
| Pintofbint Pint64 -> make_const_int (Int64.to_int n)
| Pcvtbint(Pint64, Pint32) -> make_const_int32 (Int64.to_int32 n)
| Pcvtbint(Pint64, Pnativeint) -> make_const_natint (Int64.to_nativeint n)
| Pnegbint Pint64 -> make_const_int64 (Int64.neg n)
| _ -> default
end
(* int64, int64 *)
| [Value_const(Uconst_ref(_, Some (Uconst_int64 n1)));
Value_const(Uconst_ref(_, Some (Uconst_int64 n2)))] ->
begin match p with
| Paddbint Pint64 -> make_const_int64 (Int64.add n1 n2)
| Psubbint Pint64 -> make_const_int64 (Int64.sub n1 n2)
| Pmulbint Pint64 -> make_const_int64 (Int64.mul n1 n2)
| Pdivbint {size=Pint64} when n2 <> 0L ->
make_const_int64 (Int64.div n1 n2)
| Pmodbint {size=Pint64} when n2 <> 0L ->
make_const_int64 (Int64.rem n1 n2)
| Pandbint Pint64 -> make_const_int64 (Int64.logand n1 n2)
| Porbint Pint64 -> make_const_int64 (Int64.logor n1 n2)
| Pxorbint Pint64 -> make_const_int64 (Int64.logxor n1 n2)
| Pbintcomp(Pint64, c) -> make_comparison c n1 n2
| _ -> default
end
(* int64, int *)
| [Value_const(Uconst_ref(_, Some (Uconst_int64 n1)));
Value_const(Uconst_int n2)] ->
begin match p with
| Plslbint Pint64 when 0 <= n2 && n2 < 64 ->
make_const_int64 (Int64.shift_left n1 n2)
| Plsrbint Pint64 when 0 <= n2 && n2 < 64 ->
make_const_int64 (Int64.shift_right_logical n1 n2)
| Pasrbint Pint64 when 0 <= n2 && n2 < 64 ->
make_const_int64 (Int64.shift_right n1 n2)
| _ -> default
end
(* TODO: Pbbswap *)
(* Catch-all *)
| _ ->
default
let field_approx n = function
| Value_tuple a when n < Array.length a -> a.(n)
| Value_const (Uconst_ref(_, Some (Uconst_block(_, l))))
when n < List.length l ->
Value_const (List.nth l n)
| _ -> Value_unknown
let simplif_prim_pure fpc p (args, approxs) dbg =
match p, args, approxs with
(* Block construction *)
| Pmakeblock(tag, Immutable, _kind), _, _ ->
let field = function
| Value_const c -> c
| _ -> raise Exit
in
begin try
let cst = Uconst_block (tag, List.map field approxs) in
let name =
Compilenv.new_structured_constant cst ~shared:true
in
make_const (Uconst_ref (name, Some cst))
with Exit ->
(Uprim(p, args, dbg), Value_tuple (Array.of_list approxs))
end
(* Field access *)
| Pfield n, _, [ Value_const(Uconst_ref(_, Some (Uconst_block(_, l)))) ]
when n < List.length l ->
make_const (List.nth l n)
| Pfield n, [ Uprim(Pmakeblock _, ul, _) ], [approx]
when n < List.length ul ->
(List.nth ul n, field_approx n approx)
(* Strings *)
| (Pstringlength | Pbyteslength),
_,
[ Value_const(Uconst_ref(_, Some (Uconst_string s))) ] ->
make_const_int (String.length s)
(* Identity *)
| (Pidentity | Pbytes_to_string | Pbytes_of_string), [arg1], [app1] ->
(arg1, app1)
(* Kind test *)
| Pisint, _, [a1] ->
begin match a1 with
| Value_const(Uconst_int _ | Uconst_ptr _) -> make_const_bool true
| Value_const(Uconst_ref _) -> make_const_bool false
| Value_closure _ | Value_tuple _ -> make_const_bool false
| _ -> (Uprim(p, args, dbg), Value_unknown)
end
(* Compile-time constants *)
| Pctconst c, _, _ ->
begin match c with
| Big_endian -> make_const_bool Arch.big_endian
| Word_size -> make_const_int (8*Arch.size_int)
| Int_size -> make_const_int (8*Arch.size_int - 1)
| Max_wosize -> make_const_int ((1 lsl ((8*Arch.size_int) - 10)) - 1 )
| Ostype_unix -> make_const_bool (Sys.os_type = "Unix")
| Ostype_win32 -> make_const_bool (Sys.os_type = "Win32")
| Ostype_cygwin -> make_const_bool (Sys.os_type = "Cygwin")
| Backend_type ->
make_const_ptr 0 (* tag 0 is the same as Native here *)
end
(* Catch-all *)
| _ ->
simplif_arith_prim_pure fpc p (args, approxs) dbg
let simplif_prim fpc p (args, approxs as args_approxs) dbg =
if List.for_all is_pure_clambda args
then simplif_prim_pure fpc p args_approxs dbg
else
(* XXX : always return the same approxs as simplif_prim_pure? *)
let approx =
match p with
| Pmakeblock(_, Immutable, _kind) ->
Value_tuple (Array.of_list approxs)
| _ ->
Value_unknown
in
(Uprim(p, args, dbg), approx)
(* Substitute variables in a [ulambda] term (a body of an inlined function)
and perform some more simplifications on integer primitives.
Also perform alpha-conversion on let-bound identifiers to avoid
clashes with locally-generated identifiers.
The variables must not be assigned in the term.
This is used to substitute "trivial" arguments for parameters
during inline expansion, and also for the translation of let rec
over functions. *)
let approx_ulam = function
Uconst c -> Value_const c
| _ -> Value_unknown
let find_action idxs acts tag =
if 0 <= tag && tag < Array.length idxs then begin
let idx = idxs.(tag) in
assert(0 <= idx && idx < Array.length acts);
Some acts.(idx)
end else
(* Can this happen? *)
None
let subst_debuginfo loc dbg =
if !Clflags.debug then
Debuginfo.inline loc dbg
else
dbg
let rec substitute loc fpc sb ulam =
match ulam with
Uvar v ->
begin try Tbl.find v sb with Not_found -> ulam end
| Uconst _ -> ulam
| Udirect_apply(lbl, args, dbg) ->
let dbg = subst_debuginfo loc dbg in
Udirect_apply(lbl, List.map (substitute loc fpc sb) args, dbg)
| Ugeneric_apply(fn, args, dbg) ->
let dbg = subst_debuginfo loc dbg in
Ugeneric_apply(substitute loc fpc sb fn,
List.map (substitute loc fpc sb) args, dbg)
| Uclosure(defs, env) ->
(* Question: should we rename function labels as well? Otherwise,
there is a risk that function labels are not globally unique.
This should not happen in the current system because:
- Inlined function bodies contain no Uclosure nodes
(cf. function [lambda_smaller])
- When we substitute offsets for idents bound by let rec
in [close], case [Lletrec], we discard the original
let rec body and use only the substituted term. *)
Uclosure(defs, List.map (substitute loc fpc sb) env)
| Uoffset(u, ofs) -> Uoffset(substitute loc fpc sb u, ofs)
| Ulet(str, kind, id, u1, u2) ->
let id' = Ident.rename id in
Ulet(str, kind, id', substitute loc fpc sb u1,
substitute loc fpc (Tbl.add id (Uvar id') sb) u2)
| Uletrec(bindings, body) ->
let bindings1 =
List.map (fun (id, rhs) -> (id, Ident.rename id, rhs)) bindings in
let sb' =
List.fold_right
(fun (id, id', _) s -> Tbl.add id (Uvar id') s)
bindings1 sb in
Uletrec(
List.map
(fun (_id, id', rhs) -> (id', substitute loc fpc sb' rhs))
bindings1,
substitute loc fpc sb' body)
| Uprim(p, args, dbg) ->
let sargs = List.map (substitute loc fpc sb) args in
let dbg = subst_debuginfo loc dbg in
let (res, _) =
simplif_prim fpc p (sargs, List.map approx_ulam sargs) dbg in
res
| Uswitch(arg, sw, dbg) ->
let sarg = substitute loc fpc sb arg in
let action =
(* Unfortunately, we cannot easily deal with the
case of a constructed block (makeblock) bound to a local
identifier. This would require to keep track of
local let bindings (at least their approximations)
in this substitute function.
*)
match sarg with
| Uconst (Uconst_ref (_, Some (Uconst_block (tag, _)))) ->
find_action sw.us_index_blocks sw.us_actions_blocks tag
| Uconst (Uconst_ptr tag) ->
find_action sw.us_index_consts sw.us_actions_consts tag
| _ -> None
in
begin match action with
| Some u -> substitute loc fpc sb u
| None ->
Uswitch(sarg,
{ sw with
us_actions_consts =
Array.map (substitute loc fpc sb) sw.us_actions_consts;
us_actions_blocks =
Array.map (substitute loc fpc sb) sw.us_actions_blocks;
},
dbg)
end
| Ustringswitch(arg,sw,d) ->
Ustringswitch
(substitute loc fpc sb arg,
List.map (fun (s,act) -> s,substitute loc fpc sb act) sw,
Misc.may_map (substitute loc fpc sb) d)
| Ustaticfail (nfail, args) ->
Ustaticfail (nfail, List.map (substitute loc fpc sb) args)
| Ucatch(nfail, ids, u1, u2) ->
let ids' = List.map Ident.rename ids in
let sb' =
List.fold_right2
(fun id id' s -> Tbl.add id (Uvar id') s)
ids ids' sb
in
Ucatch(nfail, ids', substitute loc fpc sb u1, substitute loc fpc sb' u2)
| Utrywith(u1, id, u2) ->
let id' = Ident.rename id in
Utrywith(substitute loc fpc sb u1, id',
substitute loc fpc (Tbl.add id (Uvar id') sb) u2)
| Uifthenelse(u1, u2, u3) ->
begin match substitute loc fpc sb u1 with
Uconst (Uconst_ptr n) ->
if n <> 0 then substitute loc fpc sb u2 else substitute loc fpc sb u3
| Uprim(Pmakeblock _, _, _) ->
substitute loc fpc sb u2
| su1 ->
Uifthenelse(su1, substitute loc fpc sb u2, substitute loc fpc sb u3)
end
| Usequence(u1, u2) ->
Usequence(substitute loc fpc sb u1, substitute loc fpc sb u2)
| Uwhile(u1, u2) ->
Uwhile(substitute loc fpc sb u1, substitute loc fpc sb u2)
| Ufor(id, u1, u2, dir, u3) ->
let id' = Ident.rename id in
Ufor(id', substitute loc fpc sb u1, substitute loc fpc sb u2, dir,
substitute loc fpc (Tbl.add id (Uvar id') sb) u3)
| Uassign(id, u) ->
let id' =
try
match Tbl.find id sb with Uvar i -> i | _ -> assert false
with Not_found ->
id in
Uassign(id', substitute loc fpc sb u)
| Usend(k, u1, u2, ul, dbg) ->
let dbg = subst_debuginfo loc dbg in
Usend(k, substitute loc fpc sb u1, substitute loc fpc sb u2,
List.map (substitute loc fpc sb) ul, dbg)
| Uunreachable ->
Uunreachable
(* Perform an inline expansion *)
let is_simple_argument = function
| Uvar _ | Uconst _ -> true
| _ -> false
let no_effects = function
| Uclosure _ -> true
| u -> is_pure_clambda u
let rec bind_params_rec loc fpc subst params args body =
match (params, args) with
([], []) -> substitute loc fpc subst body
| (p1 :: pl, a1 :: al) ->
if is_simple_argument a1 then
bind_params_rec loc fpc (Tbl.add p1 a1 subst) pl al body
else begin
let p1' = Ident.rename p1 in
let u1, u2 =
match Ident.name p1, a1 with
| "*opt*", Uprim(Pmakeblock(0, Immutable, kind), [a], dbg) ->
a, Uprim(Pmakeblock(0, Immutable, kind), [Uvar p1'], dbg)
| _ ->
a1, Uvar p1'
in
let body' =
bind_params_rec loc fpc (Tbl.add p1 u2 subst) pl al body in
if occurs_var p1 body then Ulet(Immutable, Pgenval, p1', u1, body')
else if no_effects a1 then body'
else Usequence(a1, body')
end
| (_, _) -> assert false
let bind_params loc fpc params args body =
(* Reverse parameters and arguments to preserve right-to-left
evaluation order (PR#2910). *)
bind_params_rec loc fpc Tbl.empty (List.rev params) (List.rev args) body
(* Check if a lambda term is ``pure'',
that is without side-effects *and* not containing function definitions *)
let rec is_pure = function
Lvar _ -> true
| Lconst _ -> true
| Lprim(p, args,_) -> is_pure_prim p && List.for_all is_pure args
| Levent(lam, _ev) -> is_pure lam
| _ -> false
let warning_if_forced_inline ~loc ~attribute warning =
if attribute = Always_inline then
Location.prerr_warning loc
(Warnings.Inlining_impossible warning)
(* Generate a direct application *)
let direct_apply fundesc funct ufunct uargs ~loc ~attribute =
let app_args =
if fundesc.fun_closed then uargs else uargs @ [ufunct] in
let app =
match fundesc.fun_inline, attribute with
| _, Never_inline | None, _ ->
let dbg = Debuginfo.from_location loc in
warning_if_forced_inline ~loc ~attribute
"Function information unavailable";
Udirect_apply(fundesc.fun_label, app_args, dbg)
| Some(params, body), _ ->
bind_params loc fundesc.fun_float_const_prop params app_args body
in
(* If ufunct can contain side-effects or function definitions,
we must make sure that it is evaluated exactly once.
If the function is not closed, we evaluate ufunct as part of the
arguments.
If the function is closed, we force the evaluation of ufunct first. *)
if not fundesc.fun_closed || is_pure funct
then app
else Usequence(ufunct, app)
(* Add [Value_integer] or [Value_constptr] info to the approximation
of an application *)
let strengthen_approx appl approx =
match approx_ulam appl with
(Value_const _) as intapprox ->
intapprox
| _ -> approx
(* If a term has approximation Value_integer or Value_constptr and is pure,
replace it by an integer constant *)
let check_constant_result lam ulam approx =
match approx with
Value_const c when is_pure lam -> make_const c
| Value_global_field (id, i) when is_pure lam ->
begin match ulam with
| Uprim(Pfield _, [Uprim(Pgetglobal _, _, _)], _) -> (ulam, approx)
| _ ->
let glb =
Uprim(Pgetglobal (Ident.create_persistent id), [], Debuginfo.none)
in
Uprim(Pfield i, [glb], Debuginfo.none), approx
end
| _ -> (ulam, approx)
(* Evaluate an expression with known value for its side effects only,
or discard it if it's pure *)
let sequence_constant_expr lam ulam1 (ulam2, approx2 as res2) =
if is_pure lam then res2 else (Usequence(ulam1, ulam2), approx2)
(* Maintain the approximation of the global structure being defined *)
let global_approx = ref([||] : value_approximation array)
(* Maintain the nesting depth for functions *)
let function_nesting_depth = ref 0
let excessive_function_nesting_depth = 5
(* Uncurry an expression and explicitate closures.
Also return the approximation of the expression.
The approximation environment [fenv] maps idents to approximations.
Idents not bound in [fenv] approximate to [Value_unknown].
The closure environment [cenv] maps idents to [ulambda] terms.
It is used to substitute environment accesses for free identifiers. *)
exception NotClosed
let close_approx_var fenv cenv id =
let approx = try Tbl.find id fenv with Not_found -> Value_unknown in
match approx with
Value_const c -> make_const c
| approx ->
let subst = try Tbl.find id cenv with Not_found -> Uvar id in
(subst, approx)
let close_var fenv cenv id =
let (ulam, _app) = close_approx_var fenv cenv id in ulam
let rec close fenv cenv = function
Lvar id ->
close_approx_var fenv cenv id
| Lconst cst ->
let str ?(shared = true) cst =
let name =
Compilenv.new_structured_constant cst ~shared
in
Uconst_ref (name, Some cst)
in
let rec transl = function
| Const_base(Const_int n) -> Uconst_int n
| Const_base(Const_char c) -> Uconst_int (Char.code c)
| Const_pointer n -> Uconst_ptr n
| Const_block (tag, fields) ->
str (Uconst_block (tag, List.map transl fields))
| Const_float_array sl ->
(* constant float arrays are really immutable *)
str (Uconst_float_array (List.map float_of_string sl))
| Const_immstring s ->
str (Uconst_string s)
| Const_base (Const_string (s, _)) ->
(* Strings (even literal ones) must be assumed to be mutable...
except when OCaml has been configured with
-safe-string. Passing -safe-string at compilation
time is not enough, since the unit could be linked
with another one compiled without -safe-string, and
that one could modify our string literal. *)
str ~shared:Config.safe_string (Uconst_string s)
| Const_base(Const_float x) -> str (Uconst_float (float_of_string x))
| Const_base(Const_int32 x) -> str (Uconst_int32 x)
| Const_base(Const_int64 x) -> str (Uconst_int64 x)
| Const_base(Const_nativeint x) -> str (Uconst_nativeint x)
in
make_const (transl cst)
| Lfunction _ as funct ->
close_one_function fenv cenv (Ident.create "fun") funct
(* We convert [f a] to [let a' = a in fun b c -> f a' b c]
when fun_arity > nargs *)
| Lapply{ap_func = funct; ap_args = args; ap_loc = loc;
ap_inlined = attribute} ->
let nargs = List.length args in
begin match (close fenv cenv funct, close_list fenv cenv args) with
((ufunct, Value_closure(fundesc, approx_res)),
[Uprim(Pmakeblock _, uargs, _)])
when List.length uargs = - fundesc.fun_arity ->
let app =
direct_apply ~loc ~attribute fundesc funct ufunct uargs in
(app, strengthen_approx app approx_res)
| ((ufunct, Value_closure(fundesc, approx_res)), uargs)
when nargs = fundesc.fun_arity ->
let app =
direct_apply ~loc ~attribute fundesc funct ufunct uargs in
(app, strengthen_approx app approx_res)
| ((_ufunct, Value_closure(fundesc, _approx_res)), uargs)
when nargs < fundesc.fun_arity ->
let first_args = List.map (fun arg ->
(Ident.create "arg", arg) ) uargs in
let final_args =
Array.to_list (Array.init (fundesc.fun_arity - nargs)
(fun _ -> Ident.create "arg")) in
let rec iter args body =
match args with
[] -> body
| (arg1, arg2) :: args ->
iter args
(Ulet (Immutable, Pgenval, arg1, arg2, body))
in
let internal_args =
(List.map (fun (arg1, _arg2) -> Lvar arg1) first_args)
@ (List.map (fun arg -> Lvar arg ) final_args)
in
let (new_fun, approx) = close fenv cenv
(Lfunction{
kind = Curried;
params = final_args;
body = Lapply{ap_should_be_tailcall=false;
ap_loc=loc;
ap_func=funct;
ap_args=internal_args;
ap_inlined=Default_inline;
ap_specialised=Default_specialise};
loc;
attr = default_function_attribute})
in
let new_fun = iter first_args new_fun in
warning_if_forced_inline ~loc ~attribute "Partial application";
(new_fun, approx)
| ((ufunct, Value_closure(fundesc, _approx_res)), uargs)
when fundesc.fun_arity > 0 && nargs > fundesc.fun_arity ->
let args = List.map (fun arg -> Ident.create "arg", arg) uargs in
let (first_args, rem_args) = split_list fundesc.fun_arity args in
let first_args = List.map (fun (id, _) -> Uvar id) first_args in
let rem_args = List.map (fun (id, _) -> Uvar id) rem_args in
let dbg = Debuginfo.from_location loc in
warning_if_forced_inline ~loc ~attribute "Over-application";
let body =
Ugeneric_apply(direct_apply ~loc ~attribute
fundesc funct ufunct first_args,
rem_args, dbg)
in
let result =
List.fold_left (fun body (id, defining_expr) ->
Ulet (Immutable, Pgenval, id, defining_expr, body))
body
args
in
result, Value_unknown
| ((ufunct, _), uargs) ->
let dbg = Debuginfo.from_location loc in
warning_if_forced_inline ~loc ~attribute "Unknown function";
(Ugeneric_apply(ufunct, uargs, dbg), Value_unknown)
end
| Lsend(kind, met, obj, args, loc) ->
let (umet, _) = close fenv cenv met in
let (uobj, _) = close fenv cenv obj in
let dbg = Debuginfo.from_location loc in
(Usend(kind, umet, uobj, close_list fenv cenv args, dbg),
Value_unknown)
| Llet(str, kind, id, lam, body) ->
let (ulam, alam) = close_named fenv cenv id lam in
begin match (str, alam) with
(Variable, _) ->
let (ubody, abody) = close fenv cenv body in
(Ulet(Mutable, kind, id, ulam, ubody), abody)
| (_, Value_const _)
when str = Alias || is_pure lam ->
close (Tbl.add id alam fenv) cenv body
| (_, _) ->
let (ubody, abody) = close (Tbl.add id alam fenv) cenv body in
(Ulet(Immutable, kind, id, ulam, ubody), abody)
end
| Lletrec(defs, body) ->
if List.for_all
(function (_id, Lfunction _) -> true | _ -> false)
defs
then begin
(* Simple case: only function definitions *)
let (clos, infos) = close_functions fenv cenv defs in
let clos_ident = Ident.create "clos" in
let fenv_body =
List.fold_right
(fun (id, _pos, approx) fenv -> Tbl.add id approx fenv)
infos fenv in
let (ubody, approx) = close fenv_body cenv body in
let sb =
List.fold_right
(fun (id, pos, _approx) sb ->
Tbl.add id (Uoffset(Uvar clos_ident, pos)) sb)
infos Tbl.empty in
(Ulet(Immutable, Pgenval, clos_ident, clos,
substitute Location.none !Clflags.float_const_prop sb ubody),
approx)
end else begin
(* General case: recursive definition of values *)
let rec clos_defs = function
[] -> ([], fenv)
| (id, lam) :: rem ->
let (udefs, fenv_body) = clos_defs rem in
let (ulam, approx) = close_named fenv cenv id lam in
((id, ulam) :: udefs, Tbl.add id approx fenv_body) in
let (udefs, fenv_body) = clos_defs defs in
let (ubody, approx) = close fenv_body cenv body in
(Uletrec(udefs, ubody), approx)
end
| Lprim(Pdirapply,[funct;arg], loc)
| Lprim(Prevapply,[arg;funct], loc) ->
close fenv cenv (Lapply{ap_should_be_tailcall=false;
ap_loc=loc;
ap_func=funct;
ap_args=[arg];
ap_inlined=Default_inline;
ap_specialised=Default_specialise})
| Lprim(Pgetglobal id, [], loc) as lam ->
let dbg = Debuginfo.from_location loc in
check_constant_result lam
(getglobal dbg id)
(Compilenv.global_approx id)
| Lprim(Pfield n, [lam], loc) ->
let (ulam, approx) = close fenv cenv lam in
let dbg = Debuginfo.from_location loc in
check_constant_result lam (Uprim(Pfield n, [ulam], dbg))
(field_approx n approx)
| Lprim(Psetfield(n, is_ptr, init), [Lprim(Pgetglobal id, [], _); lam], loc)->
let (ulam, approx) = close fenv cenv lam in
if approx <> Value_unknown then
(!global_approx).(n) <- approx;
let dbg = Debuginfo.from_location loc in
(Uprim(Psetfield(n, is_ptr, init), [getglobal dbg id; ulam], dbg),
Value_unknown)
| Lprim(Praise k, [arg], loc) ->
let (ulam, _approx) = close fenv cenv arg in
let dbg = Debuginfo.from_location loc in
(Uprim(Praise k, [ulam], dbg),
Value_unknown)
| Lprim(p, args, loc) ->
let dbg = Debuginfo.from_location loc in
simplif_prim !Clflags.float_const_prop
p (close_list_approx fenv cenv args) dbg
| Lswitch(arg, sw, dbg) ->
let fn fail =
let (uarg, _) = close fenv cenv arg in
let const_index, const_actions, fconst =
close_switch fenv cenv sw.sw_consts sw.sw_numconsts fail
and block_index, block_actions, fblock =
close_switch fenv cenv sw.sw_blocks sw.sw_numblocks fail in
let ulam =
Uswitch