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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
(* SPDX-License-Identifier: AGPL-3.0-or-later *)
(* Copyright © 2021-2026 OCamlPro *)
(* Written by the Owi programmers *)
open Syntax
let rewrite_heap_type (assigned : Assigned.t) (ht : Text.heap_type) :
Binary.heap_type Result.t =
match ht with
| Text.TypeUse id ->
let* id = Assigned.find_type assigned id in
Ok (Binary.TypeUse id)
| Any_ht -> Ok Any_ht
| Eq_ht -> Ok Eq_ht
| I31_ht -> Ok I31_ht
| Struct_ht -> Ok Struct_ht
| Array_ht -> Ok Array_ht
| None_ht -> Ok None_ht
| Func_ht -> Ok Func_ht
| NoFunc_ht -> Ok NoFunc_ht
| Exn_ht -> Ok Exn_ht
| NoExn_ht -> Ok NoExn_ht
| Extern_ht -> Ok Extern_ht
| NoExtern_ht -> Ok NoExtern_ht
let rewrite_val_type (assigned : Assigned.t) (vt : Text.val_type) :
Binary.val_type Result.t =
match vt with
| Text.Ref_type (n, ht) ->
let* ht = rewrite_heap_type assigned ht in
Ok (Binary.Ref_type (n, ht))
| Num_type nt -> Ok (Num_type nt)
let rewrite_func_type (assigned : Assigned.t) ((param, res) : Text.func_type) :
Binary.func_type Result.t =
let* param' =
list_map
(fun (n, vt) ->
let* vt = rewrite_val_type assigned vt in
Ok (n, vt) )
param
in
let* res' = list_map (rewrite_val_type assigned) res in
Ok (param', res')
let rewrite_block_type (assigned : Assigned.t) (block_type : Text.block_type) :
(Text.param list * Binary.block_type) Result.t =
match block_type with
| Bt_ind id ->
let* idx = Assigned.find_type assigned id in
let* ((params, _) as t) =
match Assigned.get_func_type assigned idx with
| None -> Error (`Unknown_type id)
| Some v -> Ok v
in
let* t = rewrite_func_type assigned t in
Ok (params, (Some idx, t))
| Bt_raw (_, ((params, _) as func_type)) ->
let idx = Assigned.find_raw_func_type assigned func_type in
let* func_type = rewrite_func_type assigned func_type in
Ok (params, (Some idx, func_type))
let rewrite_memarg ({ offset; align } : Text.memarg) : Binary.memarg Result.t =
let* offset =
match offset with
| None -> Ok Int64.zero
| Some offset -> (
match Int64.of_string offset with
| None -> Error (`Msg "offset")
| Some n -> Ok n )
in
let+ align =
match align with
| None -> Ok Int32.zero
| Some align -> (
match Int32.of_string align with
| None -> Error `Alignment_too_large
| Some n ->
if Int32.eq n 0l || Int32.(ne (logand n (sub n 1l)) 0l) then
Error `Alignment_too_large
else Ok (Int32.div n 2l) )
in
Binary.{ offset; align }
let rewrite_i32_instr assigned : Text.i32_instr -> Binary.i32_instr Result.t =
function
| Const i -> Ok (Binary.Const i : Binary.i32_instr)
| Clz -> Ok Clz
| Ctz -> Ok Ctz
| Popcnt -> Ok Popcnt
| Add -> Ok Add
| Sub -> Ok Sub
| Mul -> Ok Mul
| Div_s -> Ok Div_s
| Div_u -> Ok Div_u
| Rem_s -> Ok Rem_s
| Rem_u -> Ok Rem_u
| And -> Ok And
| Or -> Ok Or
| Xor -> Ok Xor
| Shl -> Ok Shl
| Shr_s -> Ok Shr_s
| Shr_u -> Ok Shr_u
| Rotl -> Ok Rotl
| Rotr -> Ok Rotr
| Eqz -> Ok Eqz
| Eq -> Ok Eq
| Ne -> Ok Ne
| Lt_s -> Ok Lt_s
| Lt_u -> Ok Lt_u
| Gt_s -> Ok Gt_s
| Gt_u -> Ok Gt_u
| Le_s -> Ok Le_s
| Le_u -> Ok Le_u
| Ge_s -> Ok Ge_s
| Ge_u -> Ok Ge_u
| Extend8_s -> Ok Extend8_s
| Extend16_s -> Ok Extend16_s
| Wrap_i64 -> Ok Wrap_i64
| Trunc_f_s nn -> Ok (Trunc_f_s nn)
| Trunc_f_u nn -> Ok (Trunc_f_u nn)
| Trunc_sat_f_s nn -> Ok (Trunc_sat_f_s nn)
| Trunc_sat_f_u nn -> Ok (Trunc_sat_f_u nn)
| Reinterpret_f nn -> Ok (Reinterpret_f nn)
| Load (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load (indice, memarg) : Binary.i32_instr)
| Load8_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_s (indice, memarg) : Binary.i32_instr)
| Load8_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_u (indice, memarg) : Binary.i32_instr)
| Load16_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_s (indice, memarg) : Binary.i32_instr)
| Load16_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_u (indice, memarg) : Binary.i32_instr)
| Store (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store (indice, memarg) : Binary.i32_instr)
| Store8 (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store8 (indice, memarg) : Binary.i32_instr)
| Store16 (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store16 (indice, memarg) : Binary.i32_instr)
let rewrite_i64_instr assigned : Text.i64_instr -> Binary.i64_instr Result.t =
function
| Const i -> Ok (Binary.Const i : Binary.i64_instr)
| Clz -> Ok Clz
| Ctz -> Ok Ctz
| Popcnt -> Ok Popcnt
| Add -> Ok Add
| Sub -> Ok Sub
| Mul -> Ok Mul
| Div_s -> Ok Div_s
| Div_u -> Ok Div_u
| Rem_s -> Ok Rem_s
| Rem_u -> Ok Rem_u
| And -> Ok And
| Or -> Ok Or
| Xor -> Ok Xor
| Shl -> Ok Shl
| Shr_s -> Ok Shr_s
| Shr_u -> Ok Shr_u
| Rotl -> Ok Rotl
| Rotr -> Ok Rotr
| Eqz -> Ok Eqz
| Eq -> Ok Eq
| Ne -> Ok Ne
| Lt_s -> Ok Lt_s
| Lt_u -> Ok Lt_u
| Gt_s -> Ok Gt_s
| Gt_u -> Ok Gt_u
| Le_s -> Ok Le_s
| Le_u -> Ok Le_u
| Ge_s -> Ok Ge_s
| Ge_u -> Ok Ge_u
| Extend8_s -> Ok Extend8_s
| Extend16_s -> Ok Extend16_s
| Extend32_s -> Ok Extend32_s
| Extend_i32_s -> Ok Extend_i32_s
| Extend_i32_u -> Ok Extend_i32_u
| Trunc_f_s nn -> Ok (Trunc_f_s nn)
| Trunc_f_u nn -> Ok (Trunc_f_u nn)
| Trunc_sat_f_s nn -> Ok (Trunc_sat_f_s nn)
| Trunc_sat_f_u nn -> Ok (Trunc_sat_f_u nn)
| Reinterpret_f nn -> Ok (Reinterpret_f nn)
| Load (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load (indice, memarg) : Binary.i64_instr)
| Load8_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_s (indice, memarg) : Binary.i64_instr)
| Load8_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_u (indice, memarg) : Binary.i64_instr)
| Load16_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_s (indice, memarg) : Binary.i64_instr)
| Load16_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_u (indice, memarg) : Binary.i64_instr)
| Load32_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32_s (indice, memarg) : Binary.i64_instr)
| Load32_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32_u (indice, memarg) : Binary.i64_instr)
| Store (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store (indice, memarg) : Binary.i64_instr)
| Store8 (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store8 (indice, memarg) : Binary.i64_instr)
| Store16 (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store16 (indice, memarg) : Binary.i64_instr)
| Store32 (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store32 (indice, memarg) : Binary.i64_instr)
let rewrite_f32_instr assigned : Text.f32_instr -> Binary.f32_instr Result.t =
function
| Const f -> Ok (Const f : Binary.f32_instr)
| Abs -> Ok Abs
| Neg -> Ok Neg
| Sqrt -> Ok Sqrt
| Ceil -> Ok Ceil
| Floor -> Ok Floor
| Trunc -> Ok Trunc
| Nearest -> Ok Nearest
| Add -> Ok Add
| Sub -> Ok Sub
| Mul -> Ok Mul
| Div -> Ok Div
| Min -> Ok Min
| Max -> Ok Max
| Copysign -> Ok Copysign
| Eq -> Ok Eq
| Ne -> Ok Ne
| Lt -> Ok Lt
| Gt -> Ok Gt
| Le -> Ok Le
| Ge -> Ok Ge
| Demote_f64 -> Ok Demote_f64
| Convert_i_s nn -> Ok (Convert_i_s nn)
| Convert_i_u nn -> Ok (Convert_i_u nn)
| Reinterpret_i nn -> Ok (Reinterpret_i nn)
| Load (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load (indice, memarg) : Binary.f32_instr)
| Store (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store (indice, memarg) : Binary.f32_instr)
let rewrite_f64_instr assigned : Text.f64_instr -> Binary.f64_instr Result.t =
function
| Const f -> Ok (Const f : Binary.f64_instr)
| Abs -> Ok Abs
| Neg -> Ok Neg
| Sqrt -> Ok Sqrt
| Ceil -> Ok Ceil
| Floor -> Ok Floor
| Trunc -> Ok Trunc
| Nearest -> Ok Nearest
| Add -> Ok Add
| Sub -> Ok Sub
| Mul -> Ok Mul
| Div -> Ok Div
| Min -> Ok Min
| Max -> Ok Max
| Copysign -> Ok Copysign
| Eq -> Ok Eq
| Ne -> Ok Ne
| Lt -> Ok Lt
| Gt -> Ok Gt
| Le -> Ok Le
| Ge -> Ok Ge
| Promote_f32 -> Ok Promote_f32
| Convert_i_s nn -> Ok (Convert_i_s nn)
| Convert_i_u nn -> Ok (Convert_i_u nn)
| Reinterpret_i nn -> Ok (Reinterpret_i nn)
| Load (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load (indice, memarg) : Binary.f64_instr)
| Store (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store (indice, memarg) : Binary.f64_instr)
let rewrite_v128_instr assigned : Text.v128_instr -> Binary.v128_instr Result.t
= function
| Const f -> Ok (Const f : Binary.v128_instr)
| Not -> Ok Not
| And -> Ok And
| Or -> Ok Or
| Any_true -> Ok Any_true
| Load16x4_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16x4_s (indice, memarg) : Binary.v128_instr)
| Load16x4_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16x4_u (indice, memarg) : Binary.v128_instr)
| Load32_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32_lane (indice, memarg, n) : Binary.v128_instr)
| Load64_zero (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load64_zero (indice, memarg) : Binary.v128_instr)
| Load (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load (indice, memarg) : Binary.v128_instr)
| Store (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store (indice, memarg) : Binary.v128_instr)
| Bitselect -> Ok Bitselect
| Xor -> Ok Xor
| Andnot -> Ok Andnot
| Load8_splat (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_splat (indice, memarg) : Binary.v128_instr)
| Load8_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8_lane (indice, memarg, n) : Binary.v128_instr)
| Load8x8_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8x8_s (indice, memarg) : Binary.v128_instr)
| Load8x8_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load8x8_u (indice, memarg) : Binary.v128_instr)
| Load16_splat (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_splat (indice, memarg) : Binary.v128_instr)
| Load16_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load16_lane (indice, memarg, n) : Binary.v128_instr)
| Load32_splat (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32_splat (indice, memarg) : Binary.v128_instr)
| Load32_zero (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32_zero (indice, memarg) : Binary.v128_instr)
| Load64_splat (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load64_splat (indice, memarg) : Binary.v128_instr)
| Load64_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load64_lane (indice, memarg, n) : Binary.v128_instr)
| Store8_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store8_lane (indice, memarg, n) : Binary.v128_instr)
| Store64_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store64_lane (indice, memarg, n) : Binary.v128_instr)
| Store32_zero (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store32_zero (indice, memarg) : Binary.v128_instr)
| Store32_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store32_lane (indice, memarg, n) : Binary.v128_instr)
| Store16_lane (indice, memarg, n) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Store16_lane (indice, memarg, n) : Binary.v128_instr)
| Load32x2_s (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32x2_s (indice, memarg) : Binary.v128_instr)
| Load32x2_u (indice, memarg) ->
let* memarg = rewrite_memarg memarg in
let+ indice = Assigned.find_memory assigned indice in
(Load32x2_u (indice, memarg) : Binary.v128_instr)
let rewrite_ref_instr assigned : Text.ref_instr -> Binary.ref_instr Result.t =
function
| Null heap_type ->
let+ heap_type = rewrite_heap_type assigned heap_type in
Binary.Null heap_type
| Is_null -> Ok Binary.Is_null
| As_non_null -> Ok Binary.As_non_null
| Func indice ->
let+ indice = Assigned.find_func assigned indice in
Binary.Func indice
| Eq -> Ok Eq
| Test (n, ht) ->
let+ ht = rewrite_heap_type assigned ht in
Binary.Test (n, ht)
| Cast (n, ht) ->
let+ ht = rewrite_heap_type assigned ht in
Binary.Cast (n, ht)
let rewrite_global_instr assigned :
Text.global_instr -> Binary.global_instr Result.t = function
| Set id ->
let+ idx = Assigned.find_global assigned id in
(Set idx : Binary.global_instr)
| Get id ->
let+ idx = Assigned.find_global assigned id in
(Get idx : Binary.global_instr)
let rewrite_table_instr assigned :
Text.table_instr -> Binary.table_instr Result.t = function
| Size indice ->
let+ indice = Assigned.find_table assigned indice in
(Size indice : Binary.table_instr)
| Get indice ->
let+ indice = Assigned.find_table assigned indice in
(Binary.Get indice : Binary.table_instr)
| Set indice ->
let+ indice = Assigned.find_table assigned indice in
(Binary.Set indice : Binary.table_instr)
| Grow indice ->
let+ indice = Assigned.find_table assigned indice in
(Grow indice : Binary.table_instr)
| Init (indice, indice') ->
let* table = Assigned.find_table assigned indice in
let+ elem = Assigned.find_elem assigned indice' in
(Init (table, elem) : Binary.table_instr)
| Fill indice ->
let+ indice = Assigned.find_table assigned indice in
(Fill indice : Binary.table_instr)
| Copy (indice, indice') ->
let* table = Assigned.find_table assigned indice in
let+ table' = Assigned.find_table assigned indice' in
(Copy (table, table') : Binary.table_instr)
let rewrite_elem_instr assigned : Text.elem_instr -> Binary.elem_instr Result.t
= function
| Drop id ->
let+ id = Assigned.find_elem assigned id in
(Drop id : Binary.elem_instr)
let rewrite_memory_instr assigned :
Text.memory_instr -> Binary.memory_instr Result.t = function
| Init (mem_indice, data_indice) ->
let* mem_indice = Assigned.find_memory assigned mem_indice in
let+ data_indice = Assigned.find_data assigned data_indice in
Binary.Init (mem_indice, data_indice)
| Copy (indice1, indice2) ->
let* indice1 = Assigned.find_memory assigned indice1 in
let+ indice2 = Assigned.find_memory assigned indice2 in
(Binary.Copy (indice1, indice2) : Binary.memory_instr)
| Size indice ->
let+ indice = Assigned.find_memory assigned indice in
Binary.Size indice
| Fill indice ->
let+ indice = Assigned.find_memory assigned indice in
(Binary.Fill indice : Binary.memory_instr)
| Grow indice ->
let+ indice = Assigned.find_memory assigned indice in
Binary.Grow indice
let rewrite_data_instr assigned : Text.data_instr -> Binary.data_instr Result.t
= function
| Drop id ->
let+ id = Assigned.find_data assigned id in
(Drop id : Binary.data_instr)
let rewrite_expr (assigned : Assigned.t) (locals : Text.param list)
(iexpr : Text.expr) : Binary.expr Annotated.t Result.t =
(* block_ids handling *)
let block_id_to_raw (loop_count, block_ids) id =
let* id =
match id with
| Text.Text id ->
begin match
List.find_index
(function Some id' -> String.equal id id' | None -> false)
block_ids
with
| None -> Error (`Unknown_label (Text.Text id))
| Some id -> Ok id
end
| Raw id -> Ok id
in
(* this is > and not >= because you can `br 0` without any block to target the function *)
if id > List.length block_ids + loop_count then
Error (`Unknown_label (Text.Raw id))
else Ok id
in
(* block_types handling *)
let block_ty_opt_rewrite = function
| Some bt ->
let+ _, bt = rewrite_block_type assigned bt in
Some bt
| None -> Ok None
in
let seen_locals = Hashtbl.create 64 in
(* Fill locals *)
let* (_ : int) =
list_fold_left
(fun next_free_int ((name, _type) : Text.param) ->
match name with
| None -> Ok (next_free_int + 1)
| Some name ->
if Hashtbl.mem seen_locals name then Error (`Duplicate_local name)
else begin
Hashtbl.add seen_locals name next_free_int;
Ok (next_free_int + 1)
end )
0 locals
in
let find_local : Text.indice -> Binary.indice = function
| Raw i -> i
| Text name -> (
match Hashtbl.find_opt seen_locals name with
| Some id -> id
| None -> assert false )
in
let rewrite_local_instr : Text.local_instr -> Binary.local_instr = function
| Set id ->
let id = find_local id in
Set id
| Get id ->
let id = find_local id in
Get id
| Tee id ->
let id = find_local id in
Tee id
in
let rewrite_struct_instr : Text.struct_instr -> Binary.struct_instr Result.t =
function
| New id ->
let+ id = Assigned.find_type assigned id in
(Binary.New id : Binary.struct_instr)
| New_default id ->
let+ id = Assigned.find_type assigned id in
(Binary.New_default id : Binary.struct_instr)
| Get (tid, fid) ->
let* tid = Assigned.find_type assigned tid in
let+ fid = Assigned.find_field assigned tid fid in
(Binary.Get (tid, fid) : Binary.struct_instr)
| Get_s (tid, fid) ->
let* tid = Assigned.find_type assigned tid in
let+ fid = Assigned.find_field assigned tid fid in
(Binary.Get_s (tid, fid) : Binary.struct_instr)
| Get_u (tid, fid) ->
let* tid = Assigned.find_type assigned tid in
let+ fid = Assigned.find_field assigned tid fid in
(Binary.Get_u (tid, fid) : Binary.struct_instr)
| Set (tid, fid) ->
let* tid = Assigned.find_type assigned tid in
let+ fid = Assigned.find_field assigned tid fid in
(Binary.Set (tid, fid) : Binary.struct_instr)
in
let rewrite_array_instr : Text.array_instr -> Binary.array_instr Result.t =
function
| New id ->
let+ id = Assigned.find_type assigned id in
Binary.New id
| New_default id ->
let+ id = Assigned.find_type assigned id in
Binary.New_default id
| New_fixed (id, n) ->
let+ id = Assigned.find_type assigned id in
Binary.New_fixed (id, n)
| New_data (id, did) ->
let* id = Assigned.find_type assigned id in
let+ did = Assigned.find_data assigned did in
Binary.New_data (id, did)
| New_elem (id, eid) ->
let* id = Assigned.find_type assigned id in
let+ eid = Assigned.find_elem assigned eid in
Binary.New_elem (id, eid)
| Get id ->
let+ id = Assigned.find_type assigned id in
Binary.Get id
| Get_s id ->
let+ id = Assigned.find_type assigned id in
Binary.Get_s id
| Get_u id ->
let+ id = Assigned.find_type assigned id in
Binary.Get_u id
| Set id ->
let+ id = Assigned.find_type assigned id in
Binary.Set id
| Len -> Ok Binary.Len
| Fill id ->
let+ id = Assigned.find_type assigned id in
Binary.Fill id
| Copy (dst_id, src_id) ->
let* dst_id = Assigned.find_type assigned dst_id in
let+ src_id = Assigned.find_type assigned src_id in
Binary.Copy (dst_id, src_id)
| Init_data (id, did) ->
let* id = Assigned.find_type assigned id in
let+ did = Assigned.find_data assigned did in
Binary.Init_data (id, did)
| Init_elem (id, eid) ->
let* id = Assigned.find_type assigned id in
let+ eid = Assigned.find_elem assigned eid in
Binary.Init_elem (id, eid)
in
let rec rewrite_instr (loop_count, block_ids) :
Text.instr -> Binary.instr Result.t = function
| Text.I32 i ->
let+ i = rewrite_i32_instr assigned i in
Binary.Simple (I32 i)
| I64 i ->
let+ i = rewrite_i64_instr assigned i in
Binary.Simple (I64 i)
| F32 i ->
let+ i = rewrite_f32_instr assigned i in
Binary.Simple (F32 i)
| F64 i ->
let+ i = rewrite_f64_instr assigned i in
Binary.Simple (F64 i)
| V128 i ->
let+ i = rewrite_v128_instr assigned i in
Binary.Simple (V128 i)
| I8x16 i -> Ok (Simple (I8x16 i))
| I16x8 i -> Ok (Simple (I16x8 i))
| I32x4 i -> Ok (Simple (I32x4 i))
| I64x2 i -> Ok (Simple (I64x2 i))
| F32x4 i -> Ok (Simple (F32x4 i))
| F64x2 i -> Ok (Simple (F64x2 i))
| Ref i ->
let+ i = rewrite_ref_instr assigned i in
Binary.Simple (Ref i)
| Local i ->
let i = rewrite_local_instr i in
Ok (Binary.Simple (Local i))
| Global i ->
let+ i = rewrite_global_instr assigned i in
Binary.Simple (Global i)
| Table i ->
let+ i = rewrite_table_instr assigned i in
Binary.Simple (Table i)
| Elem i ->
let+ i = rewrite_elem_instr assigned i in
Binary.Simple (Elem i)
| Memory i ->
let+ i = rewrite_memory_instr assigned i in
Binary.Simple (Memory i)
| Data i ->
let+ i = rewrite_data_instr assigned i in
Binary.Simple (Data i)
| I31 i -> Ok (Simple (I31 i))
| Struct i ->
let+ i = rewrite_struct_instr i in
Binary.Simple (Struct i)
| Array i ->
let+ i = rewrite_array_instr i in
Binary.Simple (Array i)
| Br_table (ids, id) ->
let block_id_to_raw = block_id_to_raw (loop_count, block_ids) in
let* ids = array_map block_id_to_raw ids in
let+ id = block_id_to_raw id in
Binary.Br_table (ids, id)
| Br_if id ->
let+ id = block_id_to_raw (loop_count, block_ids) id in
Binary.Br_if id
| Br id ->
let+ id = block_id_to_raw (loop_count, block_ids) id in
Binary.Br id
| Br_on_null id ->
let+ id = block_id_to_raw (loop_count, block_ids) id in
Binary.Br_on_null id
| Br_on_non_null id ->
let+ id = block_id_to_raw (loop_count, block_ids) id in
Binary.Br_on_non_null id
| Br_on_cast (id, (n1, ht1), (n2, ht2)) ->
let* id = block_id_to_raw (loop_count, block_ids) id in
let* ht1 = rewrite_heap_type assigned ht1 in
let+ ht2 = rewrite_heap_type assigned ht2 in
Binary.Br_on_cast (id, (n1, ht1), (n2, ht2))
| Br_on_cast_fail (id, (n1, ht1), (n2, ht2)) ->
let* id = block_id_to_raw (loop_count, block_ids) id in
let* ht1 = rewrite_heap_type assigned ht1 in
let+ ht2 = rewrite_heap_type assigned ht2 in
Binary.Br_on_cast_fail (id, (n1, ht1), (n2, ht2))
| Call id ->
let+ id = Assigned.find_func assigned id in
Binary.Call id
| Return_call id ->
let+ id = Assigned.find_func assigned id in
Binary.Return_call id
| If_else (id, bt, e1, e2) ->
let* bt = block_ty_opt_rewrite bt in
let block_ids = id :: block_ids in
let* e1 = expr e1 (loop_count, block_ids) in
let+ e2 = expr e2 (loop_count, block_ids) in
Binary.If_else (id, bt, e1, e2)
| Loop (id, bt, e) ->
let* bt = block_ty_opt_rewrite bt in
let+ e = expr e (loop_count + 1, id :: block_ids) in
Binary.Loop (id, bt, e)
| Block (id, bt, e) ->
let* bt = block_ty_opt_rewrite bt in
let+ e = expr e (loop_count, id :: block_ids) in
Binary.Block (id, bt, e)
| Call_indirect (tbl_i, bt) ->
let* tbl_i = Assigned.find_table assigned tbl_i in
let+ _, bt = rewrite_block_type assigned bt in
Binary.Call_indirect (tbl_i, bt)
| Return_call_indirect (tbl_i, bt) ->
let* tbl_i = Assigned.find_table assigned tbl_i in
let+ _, bt = rewrite_block_type assigned bt in
Binary.Return_call_indirect (tbl_i, bt)
| Call_ref t ->
let+ t = Assigned.find_type assigned t in
Binary.Call_ref t
| Return_call_ref bt ->
let+ _, bt = rewrite_block_type assigned bt in
Binary.Return_call_ref bt
| Select typ ->
begin match typ with
| None -> Ok (Simple (Select None))
| Some [ t ] ->
let+ t = rewrite_val_type assigned t in
Binary.Simple (Select (Some [ t ]))
| Some [] | Some (_ :: _ :: _) -> Error `Invalid_result_arity
end
| Unreachable -> Ok (Simple Unreachable)
| Drop -> Ok (Simple Drop)
| Nop -> Ok (Simple Nop)
| Return -> Ok Binary.Return
| Any_convert_extern -> Ok (Simple Any_convert_extern)
| Extern_convert_any -> Ok (Simple Extern_convert_any)
and expr (e : Text.expr) (loop_count, block_ids) :
Binary.expr Annotated.t Result.t =
let+ e =
list_map
(fun i ->
let+ i = rewrite_instr (loop_count, block_ids) i in
Annotated.dummy i )
e
in
Annotated.dummy e
in
expr iexpr (0, [])
let rewrite_table_limits ({ is_i64; min; max } : Text.limits) :
Binary.Table.Type.limits Result.t =
if is_i64 then
let* min =
try Ok (Int64.of_string_exn min) with Failure _ -> Error `Table_size
in
let* max =
try Ok (Option.map Int64.of_string_exn max)
with Failure _ -> Error `Table_size
in
Ok (Binary.Table.Type.I64 { min; max })
else
let* min =
try Ok (Int32.of_string_exn min) with Failure _ -> Error `Table_size
in
let* max =
try Ok (Option.map Int32.of_string_exn max)
with Failure _ -> Error `Table_size
in
Ok (Binary.Table.Type.I32 { min; max })
let rewrite_table (assigned : Assigned.t)
({ id; typ = limits, (null, ht); init } : Text.Table.t) :
Binary.Table.t Result.t =
match init with
| None ->
let* ht = rewrite_heap_type assigned ht in
let+ limits = rewrite_table_limits limits in
{ Binary.Table.id; typ = (limits, (null, ht)); init = None }
| Some e ->
let* ht = rewrite_heap_type assigned ht in
let* e = rewrite_expr assigned [] e in
let+ limits = rewrite_table_limits limits in
{ Binary.Table.id; typ = (limits, (null, ht)); init = Some e }
let rewrite_memory_limits ({ is_i64; min; max } : Text.limits) :
Binary.Mem.Type.limits Result.t =
if is_i64 then
let* min =
match int_of_string_opt min with
| Some min -> Ok min
| None -> Error `Constant_out_of_range
in
let* max =
match max with
| None -> Ok None
| Some max -> (
match int_of_string_opt max with
| Some max -> Ok (Some max)
| None -> Error `Constant_out_of_range )
in
Ok (Binary.Mem.Type.I64 { min; max })
else
let* min =
try Ok (Int32.of_string_exn min)
with Failure _ -> Error `Constant_out_of_range
in
let* max =
try Ok (Option.map Int32.of_string_exn max)
with Failure _ -> Error `Constant_out_of_range
in
Ok (Binary.Mem.Type.I32 { min; max })
let rewrite_memory ((id, limits) : Text.Mem.t) : Binary.Mem.t Result.t =
let+ limits = rewrite_memory_limits limits in
(id, limits)
let rewrite_global (assigned : Assigned.t) (global : Text.Global.t) :
Binary.Global.t Result.t =
let mut, vt = global.typ in
let* vt = rewrite_val_type assigned vt in
let+ init = rewrite_expr assigned [] global.init in
{ Binary.Global.id = global.id; init; typ = (mut, vt) }
let rewrite_elem (assigned : Assigned.t) (elem : Text.Elem.t) :
Binary.Elem.t Result.t =
let* (mode : Binary.Elem.Mode.t) =
match elem.mode with
| Declarative -> Ok Binary.Elem.Mode.Declarative
| Passive -> Ok Passive
| Active (None, _expr) -> assert false
| Active (Some id, expr) ->
let* indice = Assigned.find_table assigned id in
let+ expr = rewrite_expr assigned [] expr in
Binary.Elem.Mode.Active (indice, expr)
in
let* init = list_map (rewrite_expr assigned []) elem.init in
let nullable, ht = elem.typ in
let+ ht = rewrite_heap_type assigned ht in
{ Binary.Elem.init
; mode
; id = elem.id
; typ = (nullable, ht)
; explicit_typ = elem.explicit_typ
}
let rewrite_data (assigned : Assigned.t) (data : Text.Data.t) :
Binary.Data.t Result.t =
let+ mode =
match data.mode with
| Passive -> Ok Binary.Data.Mode.Passive
| Active (None, _expr) -> assert false
| Active (Some indice, expr) ->
let* indice = Assigned.find_memory assigned indice in
let+ expr = rewrite_expr assigned [] expr in
Binary.Data.Mode.Active (indice, expr)
in
{ Binary.Data.mode; id = data.id; init = data.init }
let rewrite_export find assigned (exports : Grouped.opt_export Array.t) :
Binary.Export.t Array.t Result.t =
array_map
(fun { Grouped.name; id } ->
match find assigned id with
| Error _ -> Error (`Unknown_export id)
| Ok id -> Ok { Binary.Export.name; id } )
exports
let rewrite_exports (modul : Grouped.t) (assigned : Assigned.t) :
Binary.Module.Exports.t Result.t =
let* global =
rewrite_export Assigned.find_global assigned modul.global_exports
in
let* mem = rewrite_export Assigned.find_memory assigned modul.mem_exports in
let* table =
rewrite_export Assigned.find_table assigned modul.table_exports
in
let* func = rewrite_export Assigned.find_func assigned modul.func_exports in
let+ tag = rewrite_export Assigned.find_tag assigned modul.tag_exports in
{ Binary.Module.Exports.global; mem; table; func; tag }
let rewrite_func (assigned : Assigned.t)
({ id; type_f; locals; body; _ } : Text.Func.t) : Binary.Func.t Result.t =
let* params, type_f = rewrite_block_type assigned type_f in
let* body = rewrite_expr assigned (params @ locals) body in
let+ locals : Binary.param_type =
list_map
(fun (_n, vt) ->
let* vt = rewrite_val_type assigned vt in
Ok (None, vt) )
locals
in
{ Binary.Func.body; type_f; id; locals }
let rewrite_tag (assigned : Assigned.t) ({ id; typ } : Text.Tag.t) :
Binary.Tag.t Result.t =
let+ _, typ = rewrite_block_type assigned typ in
Binary.Tag.{ id; typ }
let rewrite_storage_type (assigned : Assigned.t) :
Text.storage_type -> Binary.storage_type Result.t = function
| Text.Val_type vt ->
let+ vt = rewrite_val_type assigned vt in
Binary.Val_type vt
| Text.Pack_type pt -> Ok (Binary.Pack_type pt)
let rewrite_field_type (assigned : Assigned.t) ((mut, st) : Text.field_type) :
Binary.field_type Result.t =
let+ st = rewrite_storage_type assigned st in
(mut, st)
let rewrite_field (assigned : Assigned.t) ((_, ft) : Text.field) :
Binary.field Result.t =
let+ ft = rewrite_field_type assigned ft in
(None, ft)
let rewrite_comp_type (assigned : Assigned.t) :
Text.comp_type -> Binary.comp_type Result.t = function
| Text.Def_func_t ft ->
let+ ft = rewrite_func_type assigned ft in
Binary.Def_func_t ft
| Text.Def_struct_t fields ->
let+ fields = list_map (rewrite_field assigned) fields in
Binary.Def_struct_t fields
| Text.Def_array_t ft ->
let+ ft = rewrite_field_type assigned ft in
Binary.Def_array_t ft
let rewrite_sub_type (assigned : Assigned.t)
({ Text.final; ids; ct } : Text.sub_type) : Binary.sub_type Result.t =
let* ct = rewrite_comp_type assigned ct in
let* ids = list_map (Assigned.find_type assigned) ids in
Ok { Binary.final; ids; ct }
let rewrite_typedef (assigned : Assigned.t) :
Text.Typedef.t -> Binary.Typedef.t Result.t = function
| Text.Typedef.SimpleType (name, st) ->
let+ st = rewrite_sub_type assigned st in
Binary.Typedef.SimpleType (name, st)
| Text.Typedef.RecType members ->
let+ members =
list_map
(fun (name, st) ->
let+ st = rewrite_sub_type assigned st in
(name, st) )
members
in
Binary.Typedef.RecType members
let modul (modul : Grouped.t) (assigned : Assigned.t) : Binary.Module.t Result.t
=
Log.debug (fun m -> m "rewriting ...");
let* global =
let f_local g = rewrite_global assigned g in
let f_imported (m, val_type) =
let+ val_type = rewrite_val_type assigned val_type in
(m, val_type)
in
array_map (Origin.monadic_map ~f_local ~f_imported) modul.global
in
let* table =
let f_local g = rewrite_table assigned g in
let f_imported (l, (n, ht)) =
let* l = rewrite_table_limits l in
let+ ht = rewrite_heap_type assigned ht in
(l, (n, ht))
in
array_map (Origin.monadic_map ~f_local ~f_imported) modul.table
in
let* mem =
let f_local g = rewrite_memory g in
let f_imported = rewrite_memory_limits in
array_map (Origin.monadic_map ~f_local ~f_imported) modul.mem
in
let* elem = array_map (rewrite_elem assigned) modul.elem in
let* data = array_map (rewrite_data assigned) modul.data in
let* exports = rewrite_exports modul assigned in
let* func =
let f_imported bt =
let+ _, rt = rewrite_block_type assigned bt in
rt
in
let f_local = rewrite_func assigned in
let runtime = Origin.monadic_map ~f_local ~f_imported in
array_map runtime modul.func
in
let* tag =
let f_imported bt =
let+ _, rt = rewrite_block_type assigned bt in
rt
in
let f_local = rewrite_tag assigned in
let runtime = Origin.monadic_map ~f_local ~f_imported in
array_map runtime modul.tag
in
(* TODO: should be factorized, we rewrite the types twice, as flat types and
as type definitions, and the implicit types are added manually to
type_defs. *)
let* types =
array_map (rewrite_sub_type assigned) (Assigned.get_types assigned)
in
let explicit_count =
Array.fold_left
(fun acc -> function
| Text.Typedef.SimpleType _ -> acc + 1
| Text.Typedef.RecType members -> acc + List.length members )
0 modul.typ
in
let* explicit_type_defs = array_map (rewrite_typedef assigned) modul.typ in
let implicit_type_defs =
Array.init
(Array.length types - explicit_count)
(fun i -> Binary.Typedef.SimpleType (None, types.(explicit_count + i)))
in
let type_defs = Array.append explicit_type_defs implicit_type_defs in
let+ start =
match modul.start with
| None -> Ok None
| Some id ->
let+ id = Assigned.find_func assigned id in
Some id
in
{ Binary.Module.id = modul.id
; mem
; table
; type_defs
; types
; global
; elem
; data
; exports
; func
; tag
; start
; custom = []
}