forked from WebAssembly/spec
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvalid.ml
More file actions
1180 lines (978 loc) · 37.9 KB
/
Copy pathvalid.ml
File metadata and controls
1180 lines (978 loc) · 37.9 KB
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
open Ast
open Source
open Types
open Match
(* Errors *)
module Invalid = Error.Make ()
exception Invalid = Invalid.Error
let error = Invalid.error
let require b at s = if not b then error at s
(* Context *)
type context =
{
types : deftype list;
tags : tagtype list;
globals : globaltype list;
memories : memorytype list;
tables : tabletype list;
funcs : deftype list;
datas : unit list;
elems : reftype list;
locals : localtype list;
labels : resulttype list;
results : valtype list;
refs : Free.t;
}
let empty_context =
{ types = []; tags = []; globals = []; memories = []; tables = [];
funcs = []; datas = []; elems = []; locals = []; labels = []; results = [];
refs = Free.empty
}
let lookup category list x =
try Lib.List32.nth list x.it with Failure _ ->
error x.at ("unknown " ^ category ^ " " ^ I32.to_string_u x.it)
let type_ (c : context) x = lookup "type" c.types x
let tag (c : context) x = lookup "tag" c.tags x
let global (c : context) x = lookup "global" c.globals x
let memory (c : context) x = lookup "memory" c.memories x
let table (c : context) x = lookup "table" c.tables x
let func (c : context) x = lookup "function" c.funcs x
let data (c : context) x = lookup "data segment" c.datas x
let elem (c : context) x = lookup "elem segment" c.elems x
let local (c : context) x = lookup "local" c.locals x
let label (c : context) x = lookup "label" c.labels x
let replace category list x y =
try Lib.List32.replace list x.it y with Failure _ ->
error x.at ("unknown " ^ category ^ " " ^ I32.to_string_u x.it)
let init_local (c : context) x =
let LocalT (_init, t) = local c x in
{c with locals = replace "local" c.locals x (LocalT (Set, t))}
let init_locals (c : context) xs =
List.fold_left init_local c xs
let struct_type (c : context) x =
match expand_deftype (type_ c x) with
| StructT fts -> fts
| _ -> error x.at ("non-structure type " ^ I32.to_string_u x.it)
let array_type (c : context) x =
match expand_deftype (type_ c x) with
| ArrayT ft -> ft
| _ -> error x.at ("non-array type " ^ I32.to_string_u x.it)
let func_type (c : context) x =
match expand_deftype (type_ c x) with
| FuncT (ts1, ts2) -> ts1, ts2
| _ -> error x.at ("non-function type " ^ I32.to_string_u x.it)
let refer category (s : Free.Set.t) x =
if not (Free.Set.mem x.it s) then
error x.at
("undeclared " ^ category ^ " reference " ^ I32.to_string_u x.it)
let refer_func (c : context) x = refer "function" c.refs.Free.funcs x
let clos (c : context) subst t =
let dts =
List.fold_left (fun dts dt -> dts @ [subst_deftype (subst_of dts) dt])
[] c.types
in subst (subst_of dts) t
(* Types *)
let check_limits {min; max} range at msg =
require (I64.le_u min range) at msg;
match max with
| None -> ()
| Some max ->
require (I64.le_u max range) at msg;
require (I64.le_u min max) at
"size minimum must not be greater than maximum"
let check_numtype (c : context) (t : numtype) at =
()
let check_vectype (c : context) (t : vectype) at =
()
let check_typeuse (c : context) (ut : typeuse) at =
match ut with
| Idx x -> let _dt = type_ c (x @@ at) in ()
| _ -> assert false
let check_heaptype (c : context) (t : heaptype) at =
match t with
| AnyHT | NoneHT | EqHT | I31HT | StructHT | ArrayHT
| FuncHT | NoFuncHT
| ExnHT | NoExnHT
| ExternHT | NoExternHT -> ()
| UseHT ut -> check_typeuse c ut at
| BotHT -> ()
let check_reftype (c : context) (t : reftype) at =
match t with
| (_nul, ht) -> check_heaptype c ht at
let check_valtype (c : context) (t : valtype) at =
match t with
| NumT t' -> check_numtype c t' at
| VecT t' -> check_vectype c t' at
| RefT t' -> check_reftype c t' at
| BotT -> assert false
let check_resulttype (c : context) (ts : resulttype) at =
List.iter (fun t -> check_valtype c t at) ts
let check_storagetype (c : context) (st : storagetype) at =
match st with
| ValStorageT t -> check_valtype c t at
| PackStorageT pt -> ()
let check_fieldtype (c : context) (ft : fieldtype) at =
match ft with
| FieldT (_mut, st) -> check_storagetype c st at
let check_comptype (c : context) (ct : comptype) at =
match ct with
| StructT fts ->
List.iter (fun ft -> check_fieldtype c ft at) fts
| ArrayT ft ->
check_fieldtype c ft at
| FuncT (ts1, ts2) ->
check_resulttype c ts1 at;
check_resulttype c ts2 at
let check_subtype (c : context) (sut : subtype) at =
let SubT (_fin, uts, ct) = sut in
List.iter (fun ut -> check_typeuse c ut at) uts;
check_comptype c ct at
let check_subtype_sub (c : context) (sut : subtype) x at =
let SubT (_fin, uts, ct) = sut in
List.iter (fun uti ->
let xi = idx_of_typeuse uti in
let SubT (fini, _, cti) = unroll_deftype (type_ c (xi @@ at)) in
require (xi < x) at ("forward use of type " ^ I32.to_string_u xi ^
" in sub type definition");
require (fini = NoFinal) at ("sub type " ^ I32.to_string_u x ^
" has final super type " ^ I32.to_string_u xi);
require (match_comptype c.types ct cti) at ("sub type " ^ I32.to_string_u x ^
" does not match super type " ^ I32.to_string_u xi)
) uts
let check_rectype (c : context) (rt : rectype) at : context =
let RecT sts = rt in
let x = Lib.List32.length c.types in
let c' = {c with types = c.types @ roll_deftypes x rt} in
List.iter (fun st -> check_subtype c' st at) sts;
Lib.List32.iteri
(fun i st -> check_subtype_sub c' st (Int32.add x i) at) sts;
c'
let check_tagtype (c : context) (tt : tagtype) at =
let TagT ut = tt in
let (ts1, ts2) = func_type c (idx_of_typeuse ut @@ at) in
require (ts2 = []) at "non-empty tag result type";
()
let check_globaltype (c : context) (gt : globaltype) at =
let GlobalT (_mut, t) = gt in
check_valtype c t at
let check_memorytype (c : context) (mt : memorytype) at =
let MemoryT (at_, lim) = mt in
let sz, s =
match at_ with
| I32AT -> 0x1_0000L, "2^16 pages (4 GiB) for i32"
| I64AT -> 0x1_0000_0000_0000L, "2^48 pages (256 TiB) for i64"
in
check_limits lim sz at ("memory size must be at most " ^ s)
let check_tabletype (c : context) (tt : tabletype) at =
let TableT (at_, lim, t) = tt in
check_reftype c t at;
let sz, s =
match at_ with
| I32AT -> 0xffff_ffffL, "2^32-1 for i32"
| I64AT -> 0xffff_ffff_ffff_ffffL, "2^64-1 for i64"
in
check_limits lim sz at ("table size must be at most " ^ s)
let check_externtype (c : context) (xt : externtype) at =
match xt with
| ExternTagT tt ->
check_tagtype c tt at
| ExternGlobalT gt ->
check_globaltype c gt at
| ExternMemoryT mt ->
check_memorytype c mt at
| ExternTableT tt ->
check_tabletype c tt at
| ExternFuncT ut ->
let _ft = func_type c (idx_of_typeuse ut @@ at) in ()
let diff_reftype (nul1, ht1) (nul2, ht2) =
match nul2 with
| Null -> (NoNull, ht1)
| NoNull -> (nul1, ht1)
(* Stack typing *)
(*
* Note: The declarative typing rules are non-deterministic, that is, they
* have the liberty to locally "guess" the right types implied by the context.
* In the algorithmic formulation required here, stack types may hence pick
* `BotT` as the principal choice for a locally unknown type.
* Furthermore, an ellipses flag represents arbitrary sequences
* of unknown types, in order to handle stack polymorphism algorithmically.
*)
type ellipses = NoEllipses | Ellipses
type infer_resulttype = ellipses * valtype list
type infer_functype = {ins : infer_resulttype; outs : infer_resulttype}
type infer_instrtype = infer_functype * idx list
let stack ts = (NoEllipses, ts)
let (-->) ts1 ts2 = {ins = NoEllipses, ts1; outs = NoEllipses, ts2}
let (-->...) ts1 ts2 = {ins = Ellipses, ts1; outs = Ellipses, ts2}
let match_result_type s1 s2 (c : context) ts1 ts2 at =
require
( List.length ts1 = List.length ts2 &&
List.for_all2 (match_valtype c.types) ts1 ts2 ) at
("type mismatch: " ^ s2 ^ " requires " ^ string_of_resulttype ts2 ^
" but " ^ s1 ^ " has " ^ string_of_resulttype ts1)
let match_stack (c : context) ts1 ts2 at =
match_result_type "stack" "instruction" c ts1 ts2 at
let pop c (ell1, ts1) (ell2, ts2) at =
let n1 = List.length ts1 in
let n2 = List.length ts2 in
let n = min n1 n2 in
let n3 = if ell2 = Ellipses then (n1 - n) else 0 in
match_stack c (Lib.List.make n3 (BotT : valtype) @ Lib.List.drop (n2 - n) ts2) ts1 at;
(ell2, if ell1 = Ellipses then [] else Lib.List.take (n2 - n) ts2)
let push c (ell1, ts1) (ell2, ts2) =
assert (ell1 = NoEllipses || ts2 = []);
(if ell1 = Ellipses || ell2 = Ellipses then Ellipses else NoEllipses),
ts2 @ ts1
let peek i (ell, ts) : valtype =
try List.nth (List.rev ts) i with Failure _ -> BotT
let peek_ref i (ell, ts) at : reftype =
match peek i (ell, ts) with
| RefT rt -> rt
| BotT -> (NoNull, BotHT)
| t ->
error at
("type mismatch: instruction requires reference type" ^
" but stack has " ^ string_of_valtype t)
(* Type Synthesis *)
let type_num = Value.type_of_op
let type_vec = Value.type_of_vecop
let type_vec_lane = function
| Value.V128 laneop -> V128.type_of_lane laneop
let type_cvtop at = function
| Value.I32 cvtop ->
let open I32Op in
(match cvtop with
| ExtendI32 _ -> error at "invalid conversion"
| WrapI64 -> I64T
| TruncF32 _ | TruncSatF32 _ | ReinterpretFloat -> F32T
| TruncF64 _ | TruncSatF64 _ -> F64T
), I32T
| Value.I64 cvtop ->
let open I64Op in
(match cvtop with
| ExtendI32 _ -> I32T
| WrapI64 -> error at "invalid conversion"
| TruncF32 _ | TruncSatF32 _ -> F32T
| TruncF64 _ | TruncSatF64 _ | ReinterpretFloat -> F64T
), I64T
| Value.F32 cvtop ->
let open F32Op in
(match cvtop with
| ConvertI32 _ | ReinterpretInt -> I32T
| ConvertI64 _ -> I64T
| PromoteF32 -> error at "invalid conversion"
| DemoteF64 -> F64T
), F32T
| Value.F64 cvtop ->
let open F64Op in
(match cvtop with
| ConvertI32 _ -> I32T
| ConvertI64 _ | ReinterpretInt -> I64T
| PromoteF32 -> F32T
| DemoteF64 -> error at "invalid conversion"
), F64T
let num_lanes = function
| Value.V128 laneop -> V128.num_lanes laneop
let lane_extractop = function
| Value.V128 extractop ->
let open V128 in let open V128Op in
match extractop with
| I8x16 (Extract (i, _)) | I16x8 (Extract (i, _))
| I32x4 (Extract (i, _)) | I64x2 (Extract (i, _))
| F32x4 (Extract (i, _)) | F64x2 (Extract (i, _)) -> i
let lane_replaceop = function
| Value.V128 replaceop ->
let open V128 in let open V128Op in
match replaceop with
| I8x16 (Replace i) | I16x8 (Replace i)
| I32x4 (Replace i) | I64x2 (Replace i)
| F32x4 (Replace i) | F64x2 (Replace i) -> i
let type_externop op =
match op with
| Internalize -> ExternHT, AnyHT
| Externalize -> AnyHT, ExternHT
(* Expressions *)
let check_pack sz t_sz at =
require (Pack.packed_size sz < t_sz) at "invalid sign extension"
let check_unop unop at =
match unop with
| Value.I32 (IntOp.ExtendS sz) | Value.I64 (IntOp.ExtendS sz) ->
check_pack sz (num_size (Value.type_of_op unop)) at
| _ -> ()
let check_vec_binop binop at =
match binop with
| Value.(V128 (V128.I8x16 (V128Op.Shuffle is))) ->
if List.exists (fun i -> I8.to_int_u i >= 32) is then
error at "invalid lane index"
| _ -> ()
let check_memop (c : context) (memop : ('t, 's) memop) ty_size get_sz at =
let size =
match get_sz memop.pack with
| None -> ty_size memop.ty
| Some sz ->
check_pack sz (ty_size memop.ty) at;
Pack.packed_size sz
in
require (1 lsl memop.align >= 1 && 1 lsl memop.align <= size) at
"alignment must not be larger than natural";
let MemoryT (at_, _lim) = memory c (0l @@ at) in
if at_ = I32AT then
require (I64.lt_u memop.offset 0x1_0000_0000L) at
"offset out of range";
memop.ty
(*
* Conventions:
* c : context
* e : instr
* es : instr list
* v : value
* t : valtype
* ts : resulttype
* x : variable
*
* Note: To deal with the non-determinism in some of the declarative rules,
* the function takes the current stack `s` as an additional argument, allowing
* it to "peek" when it would otherwise have to guess an input type.
*
* Furthermore, stack-polymorphic types are given with the `-->...` operator:
* a type `ts1 -->... ts2` expresses any type `(ts1' @ ts1) -> (ts2' @ ts2)`
* where `ts1'` and `ts2'` would be chosen non-deterministically in the
* declarative typing rules.
*)
let check_blocktype (c : context) (bt : blocktype) at : instrtype =
match bt with
| ValBlockType None -> InstrT ([], [], [])
| ValBlockType (Some t) -> check_valtype c t at; InstrT ([], [t], [])
| VarBlockType x ->
let (ts1, ts2) = func_type c x in InstrT (ts1, ts2, [])
let rec check_instr (c : context) (e : instr) (s : infer_resulttype) : infer_instrtype =
match e.it with
| Unreachable ->
[] -->... [], []
| Nop ->
[] --> [], []
| Drop ->
[peek 0 s] --> [], []
| Select None ->
let t = peek 1 s in
require (is_numtype t || is_vectype t) e.at
("type mismatch: instruction requires numeric or vector type" ^
" but stack has " ^ string_of_valtype t);
[t; t; NumT I32T] --> [t], []
| Select (Some ts) ->
require (List.length ts = 1) e.at
"invalid result arity other than 1 is not (yet) allowed";
check_resulttype c ts e.at;
(ts @ ts @ [NumT I32T]) --> ts, []
| Block (bt, es) ->
let InstrT (ts1, ts2, xs) as it = check_blocktype c bt e.at in
check_block {c with labels = ts2 :: c.labels} es it e.at;
ts1 --> ts2, List.map (fun x -> x @@ e.at) xs
| Loop (bt, es) ->
let InstrT (ts1, ts2, xs) as it = check_blocktype c bt e.at in
check_block {c with labels = ts1 :: c.labels} es it e.at;
ts1 --> ts2, List.map (fun x -> x @@ e.at) xs
| If (bt, es1, es2) ->
let InstrT (ts1, ts2, xs) as it = check_blocktype c bt e.at in
check_block {c with labels = ts2 :: c.labels} es1 it e.at;
check_block {c with labels = ts2 :: c.labels} es2 it e.at;
(ts1 @ [NumT I32T]) --> ts2, List.map (fun x -> x @@ e.at) xs
| Br x ->
label c x -->... [], []
| BrIf x ->
(label c x @ [NumT I32T]) --> label c x, []
| BrTable (xs, x) ->
let n = List.length (label c x) in
let ts = List.init n (fun i -> peek (n - i) s) in
match_stack c ts (label c x) x.at;
List.iter (fun x' -> match_stack c ts (label c x') x'.at) xs;
(ts @ [NumT I32T]) -->... [], []
| BrOnNull x ->
let (_nul, ht) = peek_ref 0 s e.at in
(label c x @ [RefT (Null, ht)]) --> (label c x @ [RefT (NoNull, ht)]), []
| BrOnNonNull x ->
require (label c x <> []) e.at
("type mismatch: instruction requires reference type" ^
" but label has " ^ string_of_resulttype (label c x));
let ts0, t1 = Lib.List.split_last (label c x) in
require (is_reftype t1) e.at
("type mismatch: instruction requires reference type" ^
" but label has " ^ string_of_valtype t1);
let ht = match t1 with RefT (_nul, ht) -> ht | _ -> assert false in
(ts0 @ [RefT (Null, ht)]) --> ts0, []
| BrOnCast (x, rt1, rt2) ->
check_reftype c rt1 e.at;
check_reftype c rt2 e.at;
require
(match_reftype c.types rt2 rt1) e.at
("type mismatch on cast: type " ^ string_of_reftype rt2 ^
" does not match " ^ string_of_reftype rt1);
require (label c x <> []) e.at
("type mismatch: instruction requires type " ^ string_of_reftype rt2 ^
" but label has " ^ string_of_resulttype (label c x));
let ts0, t1 = Lib.List.split_last (label c x) in
require (match_valtype c.types (RefT rt2) t1) e.at
("type mismatch: instruction requires type " ^ string_of_reftype rt2 ^
" but label has " ^ string_of_resulttype (label c x));
(ts0 @ [RefT rt1]) --> (ts0 @ [RefT (diff_reftype rt1 rt2)]), []
| BrOnCastFail (x, rt1, rt2) ->
check_reftype c rt1 e.at;
check_reftype c rt2 e.at;
let rt1' = diff_reftype rt1 rt2 in
require
(match_reftype c.types rt2 rt1) e.at
("type mismatch on cast: type " ^ string_of_reftype rt2 ^
" does not match " ^ string_of_reftype rt1);
require (label c x <> []) e.at
("type mismatch: instruction requires type " ^ string_of_reftype rt1' ^
" but label has " ^ string_of_resulttype (label c x));
let ts0, t1 = Lib.List.split_last (label c x) in
require (match_valtype c.types (RefT rt1') t1) e.at
("type mismatch: instruction requires type " ^ string_of_reftype rt1' ^
" but label has " ^ string_of_resulttype (label c x));
(ts0 @ [RefT rt1]) --> (ts0 @ [RefT rt2]), []
| Return ->
c.results -->... [], []
| Call x ->
let (ts1, ts2) = functype_of_comptype (expand_deftype (func c x)) in
ts1 --> ts2, []
| CallRef x ->
let (ts1, ts2) = func_type c x in
(ts1 @ [RefT (Null, UseHT (Def (type_ c x)))]) --> ts2, []
| CallIndirect (x, y) ->
let TableT (at, _lim, t) = table c x in
let (ts1, ts2) = func_type c y in
require (match_reftype c.types t (Null, FuncHT)) x.at
("type mismatch: instruction requires table of function type" ^
" but table has element type " ^ string_of_reftype t);
(ts1 @ [NumT (numtype_of_addrtype at)]) --> ts2, []
| ReturnCall x ->
let (ts1, ts2) = functype_of_comptype (expand_deftype (func c x)) in
require (match_resulttype c.types ts2 c.results) e.at
("type mismatch: current function requires result type " ^
string_of_resulttype c.results ^
" but callee returns " ^ string_of_resulttype ts2);
ts1 -->... [], []
| ReturnCallRef x ->
let (ts1, ts2) = func_type c x in
require (match_resulttype c.types ts2 c.results) e.at
("type mismatch: current function requires result type " ^
string_of_resulttype c.results ^
" but callee returns " ^ string_of_resulttype ts2);
(ts1 @ [RefT (Null, UseHT (Def (type_ c x)))]) -->... [], []
| ReturnCallIndirect (x, y) ->
let TableT (at, _lim, t) = table c x in
let (ts1, ts2) = func_type c y in
require (match_reftype c.types t (Null, FuncHT)) x.at
("type mismatch: instruction requires table of function type" ^
" but table has element type " ^ string_of_reftype t);
require (match_resulttype c.types ts2 c.results) e.at
("type mismatch: current function requires result type " ^
string_of_resulttype c.results ^
" but callee returns " ^ string_of_resulttype ts2);
(ts1 @ [NumT (numtype_of_addrtype at)]) -->... [], []
| Throw x ->
let TagT ut = tag c x in
let dt = deftype_of_typeuse ut in
let (ts1, ts2) = functype_of_comptype (expand_deftype dt) in
ts1 -->... [], []
| ThrowRef ->
[RefT (Null, ExnHT)] -->... [], []
| TryTable (bt, cs, es) ->
let InstrT (ts1, ts2, xs) as it = check_blocktype c bt e.at in
let c' = {c with labels = ts2 :: c.labels} in
List.iter (fun ct -> check_catch c ct ts2 e.at) cs;
check_block c' es it e.at;
ts1 --> ts2, List.map (fun x -> x @@ e.at) xs
| LocalGet x ->
let LocalT (init, t) = local c x in
require (init = Set) x.at "uninitialized local";
[] --> [t], []
| LocalSet x ->
let LocalT (_init, t) = local c x in
[t] --> [], [x]
| LocalTee x ->
let LocalT (_init, t) = local c x in
[t] --> [t], [x]
| GlobalGet x ->
let GlobalT (_mut, t) = global c x in
[] --> [t], []
| GlobalSet x ->
let GlobalT (mut, t) = global c x in
require (mut = Var) x.at "immutable global";
[t] --> [], []
| TableGet x ->
let TableT (at, _lim, rt) = table c x in
[NumT (numtype_of_addrtype at)] --> [RefT rt], []
| TableSet x ->
let TableT (at, _lim, rt) = table c x in
[NumT (numtype_of_addrtype at); RefT rt] --> [], []
| TableSize x ->
let TableT (at, _lim, _rt) = table c x in
[] --> [NumT (numtype_of_addrtype at)], []
| TableGrow x ->
let TableT (at, _lim, rt) = table c x in
[RefT rt; NumT (numtype_of_addrtype at)] -->
[NumT (numtype_of_addrtype at)], []
| TableFill x ->
let TableT (at, _lim, rt) = table c x in
[NumT (numtype_of_addrtype at); RefT rt;
NumT (numtype_of_addrtype at)] --> [], []
| TableCopy (x, y) ->
let TableT (at1, _lim1, t1) = table c x in
let TableT (at2, _lim2, t2) = table c y in
require (match_reftype c.types t2 t1) x.at
("type mismatch: source element type " ^ string_of_reftype t1 ^
" does not match destination element type " ^ string_of_reftype t2);
[NumT (numtype_of_addrtype at1); NumT (numtype_of_addrtype at2);
NumT (numtype_of_addrtype (min at1 at2))] --> [], []
| TableInit (x, y) ->
let TableT (at, _lim1, t1) = table c x in
let t2 = elem c y in
require (match_reftype c.types t2 t1) x.at
("type mismatch: element segment's type " ^ string_of_reftype t1 ^
" does not match table's element type " ^ string_of_reftype t2);
[NumT (numtype_of_addrtype at); NumT I32T; NumT I32T] --> [], []
| ElemDrop x ->
ignore (elem c x);
[] --> [], []
| Load (x, memop) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop num_size (Lib.Option.map fst) e.at in
[NumT (numtype_of_addrtype at)] --> [NumT t], []
| Store (x, memop) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop num_size (fun sz -> sz) e.at in
[NumT (numtype_of_addrtype at); NumT t] --> [], []
| VecLoad (x, memop) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop vec_size (Lib.Option.map fst) e.at in
[NumT (numtype_of_addrtype at)] --> [VecT t], []
| VecStore (x, memop) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop vec_size (fun _ -> None) e.at in
[NumT (numtype_of_addrtype at); VecT t] --> [], []
| VecLoadLane (x, memop, i) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop vec_size (fun sz -> Some sz) e.at in
require (I8.to_int_u i < vec_size t / Pack.packed_size memop.pack) e.at
"invalid lane index";
[NumT (numtype_of_addrtype at); VecT t] --> [VecT t], []
| VecStoreLane (x, memop, i) ->
let MemoryT (at, _lim) = memory c x in
let t = check_memop c memop vec_size (fun sz -> Some sz) e.at in
require (I8.to_int_u i < vec_size t / Pack.packed_size memop.pack) e.at
"invalid lane index";
[NumT (numtype_of_addrtype at); VecT t] --> [], []
| MemorySize x ->
let MemoryT (at, _lim) = memory c x in
[] --> [NumT (numtype_of_addrtype at)], []
| MemoryGrow x ->
let MemoryT (at, _lim) = memory c x in
[NumT (numtype_of_addrtype at)] --> [NumT (numtype_of_addrtype at)], []
| MemoryFill x ->
let MemoryT (at, _lim) = memory c x in
[NumT (numtype_of_addrtype at); NumT I32T;
NumT (numtype_of_addrtype at)] --> [], []
| MemoryCopy (x, y)->
let MemoryT (at1, _lib1) = memory c x in
let MemoryT (at2, _lib2) = memory c y in
[NumT (numtype_of_addrtype at1); NumT (numtype_of_addrtype at2);
NumT (numtype_of_addrtype (min at1 at2))] --> [], []
| MemoryInit (x, y) ->
let MemoryT (at, _lib) = memory c x in
let () = data c y in
[NumT (numtype_of_addrtype at); NumT I32T; NumT I32T] --> [], []
| DataDrop x ->
let () = data c x in
[] --> [], []
| RefNull ht ->
check_heaptype c ht e.at;
[] --> [RefT (Null, ht)], []
| RefFunc x ->
let dt = func c x in
refer_func c x;
[] --> [RefT (NoNull, UseHT (Def dt))], []
| RefIsNull ->
let (_nul, ht) = peek_ref 0 s e.at in
[RefT (Null, ht)] --> [NumT I32T], []
| RefAsNonNull ->
let (_nul, ht) = peek_ref 0 s e.at in
[RefT (Null, ht)] --> [RefT (NoNull, ht)], []
| RefTest rt ->
let (_nul, ht) = rt in
check_reftype c rt e.at;
[RefT (Null, top_of_heaptype c.types ht)] --> [NumT I32T], []
| RefCast rt ->
let (nul, ht) = rt in
check_reftype c rt e.at;
[RefT (Null, top_of_heaptype c.types ht)] --> [RefT (nul, ht)], []
| RefEq ->
[RefT (Null, EqHT); RefT (Null, EqHT)] --> [NumT I32T], []
| RefI31 ->
[NumT I32T] --> [RefT (NoNull, I31HT)], []
| I31Get ext ->
[RefT (Null, I31HT)] --> [NumT I32T], []
| StructNew (x, initop) ->
let fts = struct_type c x in
require
( initop = Explicit || List.for_all (fun ft ->
defaultable (unpacked_fieldtype ft)) fts ) x.at
"field type is not defaultable";
let ts = if initop = Implicit then [] else List.map unpacked_fieldtype fts in
ts --> [RefT (NoNull, UseHT (Def (type_ c x)))], []
| StructGet (x, i, exto) ->
let fts = struct_type c x in
require (i < Lib.List32.length fts) e.at
("unknown field " ^ I32.to_string_u i);
let FieldT (_mut, st) = Lib.List32.nth fts i in
require ((exto <> None) == is_packed_storagetype st) e.at
("field is " ^ (if exto = None then "packed" else "unpacked"));
let t = unpacked_storagetype st in
[RefT (Null, UseHT (Def (type_ c x)))] --> [t], []
| StructSet (x, i) ->
let fts = struct_type c x in
require (i < Lib.List32.length fts) e.at
("unknown field " ^ I32.to_string_u i);
let FieldT (mut, st) = Lib.List32.nth fts i in
require (mut == Var) e.at "immutable field";
let t = unpacked_storagetype st in
[RefT (Null, UseHT (Def (type_ c x))); t] --> [], []
| ArrayNew (x, initop) ->
let ft = array_type c x in
require
(initop = Explicit || defaultable (unpacked_fieldtype ft)) x.at
"array type is not defaultable";
let ts = if initop = Implicit then [] else [unpacked_fieldtype ft] in
(ts @ [NumT I32T]) --> [RefT (NoNull, UseHT (Def (type_ c x)))], []
| ArrayNewFixed (x, n) ->
let ft = array_type c x in
let ts = Lib.List32.make n (unpacked_fieldtype ft) in
ts --> [RefT (NoNull, UseHT (Def (type_ c x)))], []
| ArrayNewElem (x, y) ->
let ft = array_type c x in
let rt = elem c y in
require (match_valtype c.types (RefT rt) (unpacked_fieldtype ft)) x.at
("type mismatch: element segment's type " ^ string_of_reftype rt ^
" does not match array's field type " ^ string_of_fieldtype ft);
[NumT I32T; NumT I32T] --> [RefT (NoNull, UseHT (Def (type_ c x)))], []
| ArrayNewData (x, y) ->
let ft = array_type c x in
let () = data c y in
let t = unpacked_fieldtype ft in
require (is_numtype t || is_vectype t) x.at
"array type is not numeric or vector";
[NumT I32T; NumT I32T] --> [RefT (NoNull, UseHT (Def (type_ c x)))], []
| ArrayGet (x, exto) ->
let FieldT (_mut, st) = array_type c x in
require ((exto <> None) == is_packed_storagetype st) e.at
("array is " ^ (if exto = None then "packed" else "unpacked"));
let t = unpacked_storagetype st in
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T] --> [t], []
| ArraySet x ->
let FieldT (mut, st) = array_type c x in
require (mut == Var) e.at "immutable array";
let t = unpacked_storagetype st in
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T; t] --> [], []
| ArrayLen ->
[RefT (Null, ArrayHT)] --> [NumT I32T], []
| ArrayCopy (x, y) ->
let FieldT (mutd, std) = array_type c x in
let FieldT (_muts, sts) = array_type c y in
require (mutd = Var) e.at "immutable array";
require (match_storagetype c.types sts std) e.at "array types do not match";
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T; RefT (Null, UseHT (Def (type_ c y))); NumT I32T; NumT I32T] --> [], []
| ArrayFill x ->
let FieldT (mut, st) = array_type c x in
require (mut = Var) e.at "immutable array";
let t = unpacked_storagetype st in
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T; t; NumT I32T] --> [], []
| ArrayInitData (x, y) ->
let FieldT (mut, st) = array_type c x in
require (mut = Var) e.at "immutable array";
let () = data c y in
let t = unpacked_storagetype st in
require (is_numtype t || is_vectype t) x.at
"array type is not numeric or vector";
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T; NumT I32T; NumT I32T] --> [], []
| ArrayInitElem (x, y) ->
let FieldT (mut, st) = array_type c x in
require (mut = Var) e.at "immutable array";
let rt = elem c y in
require (match_valtype c.types (RefT rt) (unpacked_storagetype st)) x.at
("type mismatch: element segment's type " ^ string_of_reftype rt ^
" does not match array's field type " ^ string_of_fieldtype (FieldT (mut, st)));
[RefT (Null, UseHT (Def (type_ c x))); NumT I32T; NumT I32T; NumT I32T] --> [], []
| ExternConvert op ->
let ht1, ht2 = type_externop op in
let (nul, _ht) = peek_ref 0 s e.at in
[RefT (nul, ht1)] --> [RefT (nul, ht2)], []
| FuncNew (x, y, z) -> (* TODO: validate scope index z *)
let MemoryT (at, _lim) = memory c x in
let _ft = func_type c y in
[NumT (numtype_of_addrtype at);
NumT (numtype_of_addrtype at)] --> [RefT (Null, UseHT (Def (type_ c y)))], []
| Const v ->
let t = NumT (type_num v.it) in
[] --> [t], []
| Test testop ->
let t = NumT (type_num testop) in
[t] --> [NumT I32T], []
| Compare relop ->
let t = NumT (type_num relop) in
[t; t] --> [NumT I32T], []
| Unary unop ->
check_unop unop e.at;
let t = NumT (type_num unop) in
[t] --> [t], []
| Binary binop ->
let t = NumT (type_num binop) in
[t; t] --> [t], []
| Convert cvtop ->
let t1, t2 = type_cvtop e.at cvtop in
[NumT t1] --> [NumT t2], []
| VecConst v ->
let t = VecT (type_vec v.it) in
[] --> [t], []
| VecTest testop ->
let t = VecT (type_vec testop) in
[t] --> [NumT I32T], []
| VecUnary unop ->
let t = VecT (type_vec unop) in
[t] --> [t], []
| VecBinary binop ->
check_vec_binop binop e.at;
let t = VecT (type_vec binop) in
[t; t] --> [t], []
| VecTernary ternop ->
let t = VecT (type_vec ternop) in
[t; t; t] --> [t], []
| VecCompare relop ->
let t = VecT (type_vec relop) in
[t; t] --> [t], []
| VecConvert cvtop ->
let t = VecT (type_vec cvtop) in
[t] --> [t], []
| VecShift shiftop ->
let t = VecT (type_vec shiftop) in
[t; NumT I32T] --> [t], []
| VecBitmask bitmaskop ->
let t = VecT (type_vec bitmaskop) in
[t] --> [NumT I32T], []
| VecTestBits vtestop ->
let t = VecT (type_vec vtestop) in
[t] --> [NumT I32T], []
| VecUnaryBits vunop ->
let t = VecT (type_vec vunop) in
[t] --> [t], []
| VecBinaryBits vbinop ->
let t = VecT (type_vec vbinop) in
[t; t] --> [t], []
| VecTernaryBits vternop ->
let t = VecT (type_vec vternop) in
[t; t; t] --> [t], []
| VecSplat splatop ->
let t1 = NumT (type_vec_lane splatop) in
let t2 = VecT (type_vec splatop) in
[t1] --> [t2], []
| VecExtract extractop ->
let t1 = VecT (type_vec extractop) in
let t2 = NumT (type_vec_lane extractop) in
require (I8.to_int_u (lane_extractop extractop) < num_lanes extractop) e.at
"invalid lane index";
[t1] --> [t2], []
| VecReplace replaceop ->
let t1 = VecT (type_vec replaceop) in
let t2 = NumT (type_vec_lane replaceop) in
require (I8.to_int_u (lane_replaceop replaceop) < num_lanes replaceop) e.at
"invalid lane index";
[t1; t2] --> [t1], []
and check_instrs (c : context) (s : infer_resulttype) (es : instr list)
: infer_resulttype * idx list =
match es with
| [] ->
s, []
| e::es' ->
let {ins; outs}, xs = check_instr c e s in
check_instrs (init_locals c xs) (push c outs (pop c ins s e.at)) es'
and check_block (c : context) (es : instr list) (it : instrtype) at =
let InstrT (ts1, ts2, _xs) = it in
let s, xs' = check_instrs c (stack ts1) es in
let s' = pop c (stack ts2) s at in
require (snd s' = []) at
("type mismatch: block requires " ^ string_of_resulttype ts2 ^
" but stack has " ^ string_of_resulttype (snd s))
and check_catch (c : context) (cc : catch) (ts : valtype list) at =
let match_target = match_result_type "label" "catch handler" in
match cc.it with
| Catch (x1, x2) ->
let TagT ut = tag c x1 in
let dt = deftype_of_typeuse ut in
let (ts1, ts2) = functype_of_comptype (expand_deftype dt) in
match_target c ts1 (label c x2) cc.at
| CatchRef (x1, x2) ->
let TagT ut = tag c x1 in
let dt = deftype_of_typeuse ut in
let (ts1, ts2) = functype_of_comptype (expand_deftype dt) in
match_target c (ts1 @ [RefT (NoNull, ExnHT)]) (label c x2) cc.at
| CatchAll x ->
match_target c [] (label c x) cc.at
| CatchAllRef x ->
match_target c [RefT (NoNull, ExnHT)] (label c x) cc.at
(* Functions & Constants *)
(*
* Conventions:
* c : context