Source file interp.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
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
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
open Domain
module Mixfix = Domain.Mixfix
open Lib
open Lang
open Xl
open Il
open Al
module Type = Runtime.Type
module Typ = Type.Typ
module CCache = Runtime.Dynamic.Caches.CallCache
open Runtime.Dynamic_Al
open Envs
module Run = Runtime.Dynamic_Runner.Signature
module Dep = Runtime.Testgen_neg.Dep
module Hook = Inst.Hook
open Error
open Backtrack
open Nondet
module F = Format
open Util.Source
module Make (Interface : Run.INTERFACE) (Extern : Run.EXTERN) () :
Run.INTERP_AL = struct
module Ctx = Ctx.Make ()
let func_cache = ref (CCache.create ~size:(256 * 1024))
let rel_cache = ref (CCache.create ~size:(256 * 1024))
let sub_cache = Hashtbl.create 4096
let cache_enabled = ref false
module Cache = struct
let cache_on () =
cache_enabled := true;
Extern.Cache.cache_on ()
let cache_off () =
cache_enabled := false;
Extern.Cache.cache_off ()
end
let check_guard = ref true
let check_rel_inputs (ctx : Ctx.t) (id_rel : id) (values_input : value list) :
unit =
if not !check_guard then ()
else
let nottyp, inputs = Ctx.find_rel_signature ctx id_rel in
let typs = Mixfix.args nottyp.it in
let typs = List.map (fun i -> List.nth typs i) inputs in
check
(Value.Match.subs (Ctx.find_typdef_opt ctx)
(Ctx.find_func_signature ctx)
typs values_input)
id_rel.at
(F.sprintf "relation input of %s does not match the expected type"
id_rel.it)
let check_rel_outputs (ctx : Ctx.t) (id_rel : id) (nottyp : nottyp)
(inputs : Hints.Input.t) (values_output : value list) : unit =
if not !check_guard then ()
else
let typs = Mixfix.args nottyp.it in
let typs =
typs
|> List.mapi (fun idx typ ->
if List.mem idx inputs then None else Some typ)
|> List.filter_map Fun.id
in
check
(Value.Match.subs (Ctx.find_typdef_opt ctx)
(Ctx.find_func_signature ctx)
typs values_output)
id_rel.at
(F.sprintf "relation output of %s does not match the expected type"
id_rel.it)
let check_func_inputs (ctx : Ctx.t) (id_func : id) (targs : targ list)
(values_input : value list) : unit =
if not !check_guard then ()
else
let tparams, typs_params, _ = Ctx.find_func_signature ctx id_func in
let ctx_local = Ctx.localize ctx in
check
(List.length targs = List.length tparams)
id_func.at
(F.sprintf "arity mismatch in type arguments of %s" id_func.it);
let ctx_local =
List.fold_left2
(fun ctx_local tparam targ ->
let td = Type.Typdef.Defined ([], PlainT targ $ targ.at) in
Ctx.add_typdef ctx_local tparam td)
ctx_local tparams targs
in
check
(Value.Match.subs
(Ctx.find_typdef_opt ctx_local)
(Ctx.find_func_signature ctx_local)
typs_params values_input)
id_func.at
(F.sprintf "function argument of %s does not match the parameter type"
id_func.it)
let check_func_output (ctx : Ctx.t) (id_func : id) (tparams : tparam list)
(typ_output : typ) (targs : targ list) (value_output : value) : unit =
if not !check_guard then ()
else
let theta = TIdMap.of_lists tparams targs in
let typ_output = Type.Subst.subst_typ theta typ_output in
check
(Value.Match.sub sub_cache (Ctx.find_typdef_opt ctx)
(Ctx.find_func_signature ctx)
typ_output value_output)
id_func.at
(F.sprintf
"return value of function %s does not match the expected type"
id_func.it)
let rec is_iter_var_exp (exp : exp) : Var.t option =
match exp.it with
| VarE id_exp -> Some (id_exp, [])
| IterE (exp_inner, iterexp) -> (
match is_iter_var_exp exp_inner with
| Some (id_var, iters_var) -> (
match iterexp with
| iter, [ var ] ->
let id_iter, _, iters_iter = var in
if Id.eq id_var id_iter && iters_var = iters_iter then
Some (id_var, iters_var @ [ iter ])
else None
| _ -> None)
| None -> None)
| _ -> None
let rec assign_exp (ctx : Ctx.t) (exp : exp) (value : value) : Ctx.t =
let typ_value = value.note.typ $ exp.at in
match (exp.it, value.it) with
| VarE id, _ -> assign_var_exp ctx id value
| TupleE exps, TupleV values -> assign_tuple_exp ctx exps values
| CaseE notexp, CaseV valuecase -> assign_case_exp ctx notexp valuecase
| StrE expfields, StructV valuefields ->
assign_str_exp ctx expfields valuefields
| OptE exp_opt, OptV value_opt -> assign_opt_exp ctx exp_opt value_opt
| ListE exps, ListV values -> assign_list_exp ctx exps values
| ConsE (exp_h, exp_t), ListV values_inner ->
assign_cons_exp typ_value ctx exp_h exp_t values_inner
| IterE (exp_inner, iterexp), _ ->
assign_iter_exp (exp.note $ exp.at) ctx exp_inner iterexp value
| _ ->
error exp.at
(F.asprintf "match failed %s <- %s"
(Il.Print.string_of_exp exp)
(Il.Print.string_of_value ~short:true value))
and assign_exps (ctx : Ctx.t) (exps : exp list) (values : value list) : Ctx.t
=
check
(List.length exps = List.length values)
(over_region (List.map at exps))
(F.asprintf
"mismatch in number of expressions and values while assigning, \
expected %d value(s) but got %d"
(List.length exps) (List.length values));
List.fold_left2 assign_exp ctx exps values
and assign_var_exp (ctx : Ctx.t) (id : id) (value : value) : Ctx.t =
Ctx.add_value ctx (id, []) value
and assign_tuple_exp (ctx : Ctx.t) (exps : exp list) (values : value list) :
Ctx.t =
assign_exps ctx exps values
and assign_case_exp (ctx : Ctx.t) (notexp : notexp) (valuecase : valuecase) :
Ctx.t =
assign_exps ctx (Mixfix.args notexp) (Mixfix.args valuecase)
and assign_str_exp (ctx : Ctx.t) (expfields : (atom * exp) list)
(valuefields : (atom * value) list) : Ctx.t =
let exps = List.map snd expfields in
let values = List.map snd valuefields in
assign_exps ctx exps values
and assign_opt_exp (ctx : Ctx.t) (exp_opt : exp option)
(value_opt : value option) : Ctx.t =
match (exp_opt, value_opt) with
| Some exp, Some value -> assign_exp ctx exp value
| None, None -> ctx
| _ -> assert false
and assign_list_exp (ctx : Ctx.t) (exps : exp list) (values : value list) :
Ctx.t =
assign_exps ctx exps values
and assign_cons_exp (typ_value : typ) (ctx : Ctx.t) (exp_h : exp)
(exp_t : exp) (values : value list) : Ctx.t =
let value_h = List.hd values in
let value_t = Value.Make.list typ_value (List.tl values) in
let ctx = assign_exp ctx exp_h value_h in
assign_exp ctx exp_t value_t
and assign_iter_exp_opt (ctx : Ctx.t) (exp : exp) (vars : var list)
(value : value) : Ctx.t =
match Value.Get.opt value with
| Some inner_value ->
let ctx = assign_exp ctx exp inner_value in
List.fold_left
(fun ctx (id, typ, iters) ->
let typ = Typ.Make.iterate typ (iters @ [ Opt ]) in
let inner_value = Ctx.find_value ctx (id, iters) in
let value_sub = Value.Make.opt typ (Some inner_value) in
Ctx.add_value ctx (id, iters @ [ Opt ]) value_sub)
ctx vars
| None ->
List.fold_left
(fun ctx (id, typ, iters) ->
let typ = Typ.Make.iterate typ (iters @ [ Opt ]) in
let value_sub = Value.Make.opt typ None in
Ctx.add_value ctx (id, iters @ [ Opt ]) value_sub)
ctx vars
and assign_iter_exp_list (ctx : Ctx.t) (exp : exp) (vars : var list)
(value : value) : Ctx.t =
let values = Value.Get.list value in
let ctx_sub = { ctx with local = { ctx.local with venv = VEnv.empty } } in
let ctxs = List.map (assign_exp ctx_sub exp) values in
List.fold_left
(fun ctx (id, typ, iters) ->
let typ = Typ.Make.iterate typ (iters @ [ List ]) in
let values =
List.map (fun ctx -> Ctx.find_value ctx (id, iters)) ctxs
in
let value_sub = Value.Make.list typ values in
Ctx.add_value ctx (id, iters @ [ List ]) value_sub)
ctx vars
and assign_iter_exp (typ_exp : typ) (ctx : Ctx.t) (exp : exp)
(iterexp : iterexp) (value : value) : Ctx.t =
match
is_iter_var_exp (IterE (exp, iterexp) $$ (typ_exp.at, typ_exp.it))
with
| Some (id_var, iters_var) -> Ctx.add_value ctx (id_var, iters_var) value
| None -> (
let iter, vars = iterexp in
match iter with
| Opt -> assign_iter_exp_opt ctx exp vars value
| List -> assign_iter_exp_list ctx exp vars value)
and assign_arg (ctx_caller : Ctx.t) (ctx_callee : Ctx.t) (arg : arg)
(value : value) : Ctx.t =
match arg.it with
| ExpA exp -> assign_arg_exp ctx_callee exp value
| DefA id -> assign_arg_def ctx_caller ctx_callee id value
and assign_args (ctx_caller : Ctx.t) (ctx_callee : Ctx.t) (args : arg list)
(values : value list) : Ctx.t =
check
(List.length args = List.length values)
(over_region (List.map at args))
(F.asprintf
"mismatch in number of arguments and values while assigning, expected \
%d value(s) but got %d"
(List.length args) (List.length values));
List.fold_left2 (assign_arg ctx_caller) ctx_callee args values
and assign_arg_exp (ctx : Ctx.t) (exp : exp) (value : value) : Ctx.t =
assign_exp ctx exp value
and assign_arg_def (ctx_caller : Ctx.t) (ctx_callee : Ctx.t) (id : id)
(value : value) : Ctx.t =
match value.it with
| FuncV id_f ->
let _, func = Ctx.find_func ctx_caller id_f in
Ctx.add_func ctx_callee id func
| _ ->
error id.at
(F.asprintf "cannot assign a value %s to a definition %s"
(Il.Print.string_of_value ~short:true value)
id.it)
let rec eval_exp (ctx : Ctx.t) (exp : exp) : value backtrack =
let typ_note = exp.note $ exp.at in
match exp.it with
| BoolE b -> eval_bool_exp typ_note b
| NumE n -> eval_num_exp typ_note n
| TextE s -> eval_text_exp typ_note s
| VarE id -> eval_var_exp typ_note ctx id
| UnE (unop, optyp, exp) -> eval_un_exp typ_note ctx unop optyp exp
| BinE (binop, optyp, exp_l, exp_r) ->
eval_bin_exp typ_note ctx binop optyp exp_l exp_r
| CmpE (cmpop, optyp, exp_l, exp_r) ->
eval_cmp_exp typ_note ctx cmpop optyp exp_l exp_r
| UpCastE (typ, exp) -> eval_upcast_exp typ_note ctx typ exp
| DownCastE (typ, exp) -> eval_downcast_exp typ_note ctx typ exp
| SubE (exp, typ) -> eval_sub_exp typ_note ctx exp typ
| MatchE (exp, pattern) -> eval_match_exp typ_note ctx exp pattern
| TupleE exps -> eval_tuple_exp typ_note ctx exps
| CaseE typ_notexp -> eval_case_exp typ_note ctx typ_notexp
| StrE fields -> eval_str_exp typ_note ctx fields
| OptE exp_opt -> eval_opt_exp typ_note ctx exp_opt
| ListE exps -> eval_list_exp typ_note ctx exps
| ConsE (exp_h, exp_t) -> eval_cons_exp typ_note ctx exp_h exp_t
| CatE (exp_l, exp_r) -> eval_cat_exp typ_note ctx exp_l exp_r
| MemE (exp_e, exp_s) -> eval_mem_exp typ_note ctx exp_e exp_s
| LenE exp -> eval_len_exp typ_note ctx exp
| DotE (exp_b, atom) -> eval_dot_exp typ_note ctx exp_b atom
| IdxE (exp_b, exp_i) -> eval_idx_exp typ_note ctx exp_b exp_i
| SliceE (exp_b, exp_l, exp_h) ->
eval_slice_exp typ_note ctx exp_b exp_l exp_h
| UpdE (exp_b, path, exp_f) -> eval_upd_exp typ_note ctx exp_b path exp_f
| CallE (id, targs, args) -> eval_call_exp typ_note ctx id targs args
| IterE (exp, iterexp) -> eval_iter_exp typ_note ctx exp iterexp
and eval_exps (ctx : Ctx.t) (exps : exp list) : value list backtrack =
match exps with
| [] -> Ok []
| exp_h :: exps_t ->
let* value_h = eval_exp ctx exp_h in
let* values_t = eval_exps ctx exps_t in
Ok (value_h :: values_t)
and eval_bool_exp (_typ_note : typ) (b : bool) : value backtrack =
let value_res = Value.Make.bool b in
Ok value_res
and eval_num_exp (_typ_note : typ) (n : Num.t) : value backtrack =
let value_res = Value.Make.num n in
Ok value_res
and eval_text_exp (_typ_note : typ) (s : string) : value backtrack =
let value_res = Value.Make.text s in
Ok value_res
and eval_var_exp (_typ_note : typ) (ctx : Ctx.t) (id : id) : value backtrack =
let value_res = Ctx.find_value ctx (id, []) in
Ok value_res
and eval_un_bool (unop : Bool.unop) (value : value) : value =
match unop with
| `NotOp -> value |> Value.Get.bool |> not |> Value.Make.bool
and eval_un_num (unop : Num.unop) (value : value) : value =
value |> Value.Get.num |> Num.un unop |> Value.Make.num
and eval_un_exp (_typ_note : typ) (ctx : Ctx.t) (unop : unop) (_optyp : optyp)
(exp : exp) : value backtrack =
let* value = eval_exp ctx exp in
let value_res =
match unop with
| #Bool.unop as unop -> eval_un_bool unop value
| #Num.unop as unop -> eval_un_num unop value
in
Ok value_res
and eval_bin_bool (binop : Bool.binop) (value_l : value) (value_r : value) :
value =
let b_l = Value.Get.bool value_l in
let b_r = Value.Get.bool value_r in
match binop with
| `AndOp -> Value.Make.bool (b_l && b_r)
| `OrOp -> Value.Make.bool (b_l || b_r)
| `ImplOp -> Value.Make.bool ((not b_l) || b_r)
| `EquivOp -> Value.Make.bool (b_l = b_r)
and eval_bin_num (binop : Num.binop) (value_l : value) (value_r : value) :
value =
let num_l = Value.Get.num value_l in
let num_r = Value.Get.num value_r in
Value.Make.num (Num.bin binop num_l num_r)
and eval_bin_exp (_typ_note : typ) (ctx : Ctx.t) (binop : binop)
(_optyp : optyp) (exp_l : exp) (exp_r : exp) : value backtrack =
let* value_l = eval_exp ctx exp_l in
let* value_r = eval_exp ctx exp_r in
let value_res =
match binop with
| #Bool.binop as binop -> eval_bin_bool binop value_l value_r
| #Num.binop as binop -> eval_bin_num binop value_l value_r
in
Ok value_res
and eval_cmp_bool (cmpop : Bool.cmpop) (value_l : value) (value_r : value) :
value =
let eq = Value.eq value_l value_r in
match cmpop with
| `EqOp -> Value.Make.bool eq
| `NeOp -> Value.Make.bool (not eq)
and eval_cmp_num (cmpop : Num.cmpop) (value_l : value) (value_r : value) :
value =
let num_l = Value.Get.num value_l in
let num_r = Value.Get.num value_r in
Value.Make.bool (Num.cmp cmpop num_l num_r)
and eval_cmp_exp (_typ_note : typ) (ctx : Ctx.t) (cmpop : cmpop)
(_optyp : optyp) (exp_l : exp) (exp_r : exp) : value backtrack =
let* value_l = eval_exp ctx exp_l in
let* value_r = eval_exp ctx exp_r in
let value_res =
match cmpop with
| #Bool.cmpop as cmpop -> eval_cmp_bool cmpop value_l value_r
| #Num.cmpop as cmpop -> eval_cmp_num cmpop value_l value_r
in
Ok value_res
and upcast (ctx : Ctx.t) (typ : typ) (value : value) : value =
match typ.it with
| NumT `IntT -> (
match value.it with
| NumV (`Nat n) -> Value.Make.int n
| NumV (`Int _) -> value
| _ -> assert false)
| VarT (tid, targs) -> (
let tparams, deftyp = Ctx.find_defined_typdef ctx tid in
let theta = TIdMap.of_lists tparams targs in
match deftyp.it with
| PlainT typ ->
let typ = Type.Subst.subst_typ theta typ in
upcast ctx typ value
| _ -> value)
| TupleT typs -> (
match value.it with
| TupleV values ->
let values =
List.fold_left2
(fun values typ value ->
let value = upcast ctx typ value in
values @ [ value ])
[] typs values
in
Value.Make.tuple typ values
| _ -> assert false)
| IterT (typ, Opt) -> (
match value.it with
| OptV value_opt ->
let value_opt = Option.map (upcast ctx typ) value_opt in
Value.Make.opt typ value_opt
| _ -> assert false)
| IterT (typ, List) -> (
match value.it with
| ListV values ->
let values = List.map (upcast ctx typ) values in
Value.Make.list typ values
| _ -> assert false)
| _ -> value
and eval_upcast_exp (_typ_note : typ) (ctx : Ctx.t) (typ : typ) (exp : exp) :
value backtrack =
let* value = eval_exp ctx exp in
let value_res = upcast ctx typ value in
Ok value_res
and downcast (ctx : Ctx.t) (typ : typ) (value : value) : value =
match typ.it with
| NumT `NatT -> (
match value.it with
| NumV (`Nat _) -> value
| NumV (`Int i) when Bigint.(i >= zero) -> Value.Make.nat i
| _ -> assert false)
| VarT (tid, targs) -> (
let tparams, deftyp = Ctx.find_defined_typdef ctx tid in
let theta = TIdMap.of_lists tparams targs in
match deftyp.it with
| PlainT typ ->
let typ = Type.Subst.subst_typ theta typ in
downcast ctx typ value
| _ -> value)
| TupleT typs -> (
match value.it with
| TupleV values ->
let values =
List.fold_left2
(fun values typ value ->
let value = downcast ctx typ value in
values @ [ value ])
[] typs values
in
Value.Make.tuple typ values
| _ -> assert false)
| IterT (typ, Opt) -> (
match value.it with
| OptV value_opt ->
let value_opt = Option.map (downcast ctx typ) value_opt in
Value.Make.opt typ value_opt
| _ -> assert false)
| IterT (typ, List) -> (
match value.it with
| ListV values ->
let values = List.map (downcast ctx typ) values in
Value.Make.list typ values
| _ -> assert false)
| _ -> value
and eval_downcast_exp (_typ_note : typ) (ctx : Ctx.t) (typ : typ) (exp : exp)
: value backtrack =
let* value = eval_exp ctx exp in
let value_res = downcast ctx typ value in
Ok value_res
and eval_sub_exp (_typ_note : typ) (ctx : Ctx.t) (exp : exp) (typ : typ) :
value backtrack =
let* value = eval_exp ctx exp in
let sub =
Value.Match.sub sub_cache (Ctx.find_typdef_opt ctx)
(Ctx.find_func_signature ctx)
typ value
in
let value_res = Value.Make.bool sub in
Ok value_res
and eval_match_exp (_typ_note : typ) (ctx : Ctx.t) (exp : exp)
(pattern : pattern) : value backtrack =
let* value = eval_exp ctx exp in
let matches =
match (pattern, value.it) with
| CaseP mixop_p, CaseV valuecase -> Mixfix.eq_mixop mixop_p valuecase
| ListP listpattern, ListV values -> (
let len_v = List.length values in
match listpattern with
| `Cons -> len_v > 0
| `Fixed len_p -> len_v = len_p
| `Nil -> len_v = 0)
| OptP `Some, OptV (Some _) -> true
| OptP `None, OptV None -> true
| _ -> false
in
let value_res = Value.Make.bool matches in
Ok value_res
and eval_tuple_exp (typ_note : typ) (ctx : Ctx.t) (exps : exp list) :
value backtrack =
let* values = eval_exps ctx exps in
let value_res = Value.Make.tuple typ_note values in
Ok value_res
and eval_case_exp (typ_note : typ) (ctx : Ctx.t) (notexp : notexp) :
value backtrack =
let mixop, exps = Mixfix.split notexp in
let* values = eval_exps ctx exps in
let value_res = Value.Make.case typ_note (Mixfix.fill mixop values) in
Ok value_res
and eval_str_exp (typ_note : typ) (ctx : Ctx.t) (fields : (atom * exp) list) :
value backtrack =
let atoms, exps = List.split fields in
let* values = eval_exps ctx exps in
let valuefields = List.combine atoms values in
let value_res = Value.Make.str typ_note valuefields in
Ok value_res
and eval_opt_exp (typ_note : typ) (ctx : Ctx.t) (exp_opt : exp option) :
value backtrack =
let* value_opt =
match exp_opt with
| Some exp ->
let* value = eval_exp ctx exp in
Ok (Some value)
| None -> Ok None
in
let value_res = Value.Make.opt typ_note value_opt in
Ok value_res
and eval_list_exp (typ_note : typ) (ctx : Ctx.t) (exps : exp list) :
value backtrack =
let* values = eval_exps ctx exps in
let value_res = Value.Make.list typ_note values in
Ok value_res
and eval_cons_exp (typ_note : typ) (ctx : Ctx.t) (exp_h : exp) (exp_t : exp) :
value backtrack =
let* value_h = eval_exp ctx exp_h in
let* value_t = eval_exp ctx exp_t in
let values_t = Value.Get.list value_t in
let value_res = Value.Make.list typ_note (value_h :: values_t) in
Ok value_res
and eval_cat_exp (typ_note : typ) (ctx : Ctx.t) (exp_l : exp) (exp_r : exp) :
value backtrack =
let* value_l = eval_exp ctx exp_l in
let* value_r = eval_exp ctx exp_r in
let value_res =
match (value_l.it, value_r.it) with
| TextV s_l, TextV s_r -> Value.Make.text (s_l ^ s_r)
| ListV values_l, ListV values_r ->
Value.Make.list typ_note (values_l @ values_r)
| _ ->
error
(over_region [ exp_l.at; exp_r.at ])
"concatenation expects either two texts or two lists"
in
Ok value_res
and eval_mem_exp (_typ_note : typ) (ctx : Ctx.t) (exp_e : exp) (exp_s : exp) :
value backtrack =
let* value_e = eval_exp ctx exp_e in
let* value_s = eval_exp ctx exp_s in
let values_s = Value.Get.list value_s in
let mem = List.exists (Value.eq value_e) values_s in
let value_res = Value.Make.bool mem in
Ok value_res
and eval_len_exp (_typ_note : typ) (ctx : Ctx.t) (exp : exp) : value backtrack
=
let* value = eval_exp ctx exp in
let len =
match value.it with
| TextV s -> s |> String.length |> Bigint.of_int
| ListV values -> values |> List.length |> Bigint.of_int
| _ ->
error exp.at
(F.asprintf
"length operation expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value))
in
let value_res = Value.Make.nat len in
Ok value_res
and eval_dot_exp (_typ_note : typ) (ctx : Ctx.t) (exp_b : exp) (atom : atom) :
value backtrack =
let* value_b = eval_exp ctx exp_b in
let valuefields = Value.Get.str value_b in
let value_res =
valuefields
|> List.find (fun (atom_field, _) -> Atom.eq atom_field.it atom.it)
|> snd
in
Ok value_res
and eval_idx_exp (_typ_note : typ) (ctx : Ctx.t) (exp_b : exp) (exp_i : exp) :
value backtrack =
let* value_b = eval_exp ctx exp_b in
let* value_i = eval_exp ctx exp_i in
let idx = value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn in
let value_res =
match value_b.it with
| TextV s when idx < 0 || idx >= String.length s ->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx (String.length s))
| TextV s ->
let s = String.get s idx |> String.make 1 in
Value.Make.text s
| ListV values when idx < 0 || idx >= List.length values ->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx
(List.length values))
| ListV values -> List.nth values idx
| _ ->
error exp_b.at
(F.asprintf "indexing expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value_b))
in
Ok value_res
and eval_slice_exp (typ_note : typ) (ctx : Ctx.t) (exp_b : exp) (exp_i : exp)
(exp_n : exp) : value backtrack =
let* value_b = eval_exp ctx exp_b in
let* value_i = eval_exp ctx exp_i in
let idx_l = value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn in
let* value_n = eval_exp ctx exp_n in
let idx_n = value_n |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn in
let idx_h = idx_l + idx_n in
let value_res =
match value_b.it with
| TextV s when idx_l < 0 || idx_h > String.length s ->
error exp_i.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(String.length s))
| TextV s ->
let s_slice = String.sub s idx_l (idx_h - idx_l) in
Value.Make.text s_slice
| ListV values when idx_l < 0 || idx_h > List.length values ->
error exp_n.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(List.length values))
| ListV values ->
let values_slice =
List.mapi
(fun idx value ->
if idx_l <= idx && idx < idx_h then Some value else None)
values
|> List.filter_map Fun.id
in
Value.Make.list typ_note values_slice
| _ ->
error exp_b.at
(F.asprintf "slicing expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value_b))
in
Ok value_res
and eval_access_path (ctx : Ctx.t) (value_b : value) (path : path) :
value backtrack =
match path.it with
| RootP -> Ok value_b
| IdxP (path, exp_i) ->
let* value = eval_access_path ctx value_b path in
let* value_i = eval_exp ctx exp_i in
let idx = value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn in
let value_res =
match value.it with
| TextV s when idx < 0 || idx >= String.length s ->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx
(String.length s))
| TextV s ->
let s = String.get s idx |> String.make 1 in
Value.Make.text s
| ListV values when idx < 0 || idx >= List.length values ->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx
(List.length values))
| ListV values -> List.nth values idx
| _ ->
error path.at
(F.asprintf
"indexing expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value))
in
Ok value_res
| SliceP (path, exp_i, exp_n) ->
let typ = path.note $ path.at in
let* value = eval_access_path ctx value_b path in
let* value_i = eval_exp ctx exp_i in
let idx_l =
value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn
in
let* value_n = eval_exp ctx exp_n in
let idx_n =
value_n |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn
in
let idx_h = idx_l + idx_n in
let value_res =
match value.it with
| TextV s when idx_l < 0 || idx_h > String.length s ->
error exp_n.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(String.length s))
| TextV s ->
let s_slice = String.sub s idx_l (idx_h - idx_l) in
Value.Make.text s_slice
| ListV values when idx_l < 0 || idx_h > List.length values ->
error exp_n.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(List.length values))
| ListV values ->
let values_slice =
List.mapi
(fun idx value ->
if idx_l <= idx && idx < idx_h then Some value else None)
values
|> List.filter_map Fun.id
in
Value.Make.list typ values_slice
| _ ->
error path.at
(F.asprintf
"slicing expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value))
in
Ok value_res
| DotP (path, atom) ->
let* value = eval_access_path ctx value_b path in
let valuefields = value |> Value.Get.str in
let value_res =
valuefields
|> List.find (fun (atom_field, _) -> Atom.eq atom_field.it atom.it)
|> snd
in
Ok value_res
and eval_update_path (ctx : Ctx.t) (value_b : value) (path : path)
(value_upd : value) : value backtrack =
match path.it with
| RootP -> Ok value_upd
| IdxP (path, exp_i) -> (
let typ = path.note $ path.at in
let* value = eval_access_path ctx value_b path in
let* value_i = eval_exp ctx exp_i in
let idx_target =
value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn
in
match value.it with
| TextV s when idx_target < 0 || idx_target >= String.length s ->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx_target
(String.length s))
| TextV s ->
let s_n = Value.Get.text value_upd in
if String.length s_n <> 1 then
error exp_i.at
(F.asprintf
"updating a character requires a single-character text, but \
got %s"
(Sl.Print.string_of_value ~short:true value_upd))
else
let s_updated =
String.sub s 0 idx_target ^ s_n
^ String.sub s (idx_target + 1)
(String.length s - idx_target - 1)
in
let value = Value.Make.text s_updated in
eval_update_path ctx value_b path value
| ListV values when idx_target < 0 || idx_target >= List.length values
->
error exp_i.at
(F.asprintf "index %d out of bounds [0, %d)" idx_target
(List.length values))
| ListV values ->
let values_updated =
List.mapi
(fun idx value -> if idx = idx_target then value_upd else value)
values
in
let value = Value.Make.list typ values_updated in
eval_update_path ctx value_b path value
| _ ->
error path.at
(F.asprintf "indexing expects either a text or a list, but got %s"
(Sl.Print.string_of_value ~short:true value)))
| SliceP (path, exp_i, exp_n) -> (
let typ = path.note $ path.at in
let* value = eval_access_path ctx value_b path in
let* value_i = eval_exp ctx exp_i in
let idx_l =
value_i |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn
in
let* value_n = eval_exp ctx exp_n in
let idx_n =
value_n |> Value.Get.num |> Num.to_int |> Bigint.to_int_exn
in
let idx_h = idx_l + idx_n in
match value.it with
| TextV s when idx_l < 0 || idx_h > String.length s ->
error exp_n.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(String.length s))
| TextV s ->
let s_upd = Value.Get.text value_upd in
if String.length s_upd <> idx_n then
error exp_n.at
(F.asprintf
"updating a slice of length %d requires a text of length \
%d, but got %s"
idx_n (String.length s_upd)
(Il.Print.string_of_value ~short:true value_upd))
else
let s_upd =
String.sub s 0 idx_l ^ s_upd
^ String.sub s idx_h (String.length s - idx_h)
in
let value = Value.Make.text s_upd in
eval_update_path ctx value_b path value
| ListV values when idx_l < 0 || idx_h > List.length values ->
error exp_n.at
(F.asprintf "slice [%d, %d) out of bounds [0, %d)" idx_l idx_h
(List.length values))
| ListV values ->
let values_upd = Value.Get.list value_upd in
if List.length values_upd <> idx_n then
error exp_n.at
(F.asprintf
"updating a slice of length %d requires a list of length \
%d, but got %s"
idx_n (List.length values_upd)
(Il.Print.string_of_value ~short:true value_upd))
else
let values_upd =
List.mapi
(fun idx value ->
if idx_l <= idx && idx < idx_h then
List.nth values_upd (idx - idx_l)
else value)
values
in
let value = Value.Make.list typ values_upd in
eval_update_path ctx value_b path value
| _ ->
error path.at
(F.asprintf "slicing expects either a text or a list, but got %s"
(Il.Print.string_of_value ~short:true value)))
| DotP (path, atom) ->
let typ = path.note $ path.at in
let* value = eval_access_path ctx value_b path in
let valuefields = value |> Value.Get.str in
let valuefields =
List.map
(fun (atom_f, value_f) ->
if Atom.eq atom_f.it atom.it then (atom_f, value_upd)
else (atom_f, value_f))
valuefields
in
let value = Value.Make.str typ valuefields in
eval_update_path ctx value_b path value
and eval_upd_exp (_typ_note : typ) (ctx : Ctx.t) (exp_b : exp) (path : path)
(exp_f : exp) : value backtrack =
let* value_b = eval_exp ctx exp_b in
let* value_f = eval_exp ctx exp_f in
eval_update_path ctx value_b path value_f
and eval_call_exp (_typ_note : typ) (ctx : Ctx.t) (id : id)
(targs : targ list) (args : arg list) : value backtrack =
let targs =
match targs with
| [] -> []
| targs ->
let theta =
TDEnv.fold
(fun tid typdef theta ->
match typdef with
| Type.Typdef.Defined ([], { it = Il.PlainT typ; _ }) ->
TIdMap.add tid typ theta
| _ -> theta)
ctx.local.tdenv TIdMap.empty
in
List.map (Type.Subst.subst_typ theta) targs
in
let* values_args = eval_args ctx args in
invoke_func ctx id targs values_args
and eval_iter_exp_opt (typ_note : typ) (ctx : Ctx.t) (exp : exp)
(vars : var list) : value backtrack =
let* ctx_sub_opt = Ctx.sub_opt ctx vars in
match ctx_sub_opt with
| Some ctx_sub ->
let* value = eval_exp ctx_sub exp in
let value_res = Value.Make.opt typ_note (Some value) in
Ok value_res
| None ->
let value_res = Value.Make.opt typ_note None in
Ok value_res
and eval_iter_exp_list (typ_note : typ) (ctx : Ctx.t) (exp : exp)
(vars : var list) : value backtrack =
let* ctxs_sub = Ctx.sub_list ctx vars in
let* values_rev =
List.fold_left
(fun values_rev ctx_sub ->
let* values_rev = values_rev in
let* value = eval_exp ctx_sub exp in
Ok (value :: values_rev))
(Ok []) ctxs_sub
in
let values = List.rev values_rev in
let value_res = Value.Make.list typ_note values in
Ok value_res
and eval_iter_exp (typ_note : typ) (ctx : Ctx.t) (exp : exp)
(iterexp : iterexp) : value backtrack =
match
is_iter_var_exp (IterE (exp, iterexp) $$ (typ_note.at, typ_note.it))
with
| Some var -> Ok (Ctx.find_value ctx var)
| None -> (
let iter, vars = iterexp in
match iter with
| Opt -> eval_iter_exp_opt typ_note ctx exp vars
| List -> eval_iter_exp_list typ_note ctx exp vars)
and eval_arg (ctx : Ctx.t) (arg : arg) : value backtrack =
match arg.it with
| ExpA exp -> eval_exp ctx exp
| DefA id ->
let tparams, typs, typ = Ctx.find_func_signature ctx id in
let value_res = Value.Make.func id tparams typs typ in
Ok value_res
and eval_args (ctx : Ctx.t) (args : arg list) : value list backtrack =
List.fold_left
(fun values arg ->
let* values = values in
let* value = eval_arg ctx arg in
Ok (values @ [ value ]))
(Ok []) args
and eval_prem (ctx : Ctx.t) (prem : prem) : Ctx.t backtrack =
eval_prem' ctx prem
and eval_prem' (ctx : Ctx.t) (prem : prem) : Ctx.t backtrack =
match prem.it with
| RulePr (id, notexp, inputs) -> eval_rule_prem ctx id notexp inputs
| IfPr exp_cond -> eval_if_prem ctx exp_cond
| IfHoldPr (id, notexp) -> eval_if_hold_prem ctx id notexp
| IfNotHoldPr (id, notexp) -> eval_if_not_hold_prem ctx id notexp
| LetPr (exp_l, exp_r) -> eval_let_prem ctx exp_l exp_r
| IterPr (prem, iterprem) -> eval_iter_prem ctx prem iterprem
| DebugPr exp -> eval_debug_prem ctx exp
and eval_prems (ctx : Ctx.t) (prems : prem list) : Ctx.t backtrack =
List.fold_left
(fun ctx prem ->
let* ctx = ctx in
eval_prem ctx prem)
(Ok ctx) prems
and eval_rule_prem (ctx : Ctx.t) (id : id) (notexp : notexp)
(inputs : Hints.Input.t) : Ctx.t backtrack =
let exps = Mixfix.args notexp in
let exps_input, exps_output = Hints.Input.split inputs exps in
let* values_input = eval_exps ctx exps_input in
let* values_output = invoke_rel ctx id values_input in
let ctx = assign_exps ctx exps_output values_output in
Ok ctx
and eval_if_prem (ctx : Ctx.t) (exp_cond : exp) : Ctx.t backtrack =
let* value_cond = eval_exp ctx exp_cond in
let cond = Value.Get.bool value_cond in
if cond then Ok ctx
else
back_unmatch exp_cond.at
(F.asprintf "condition %s was not met"
(Il.Print.string_of_exp exp_cond))
and eval_if_hold_prem (ctx : Ctx.t) (id : id) (notexp : notexp) :
Ctx.t backtrack =
let exps_input = Mixfix.args notexp in
let* values_input = eval_exps ctx exps_input in
match invoke_rel ctx id values_input with
| Ok _ -> Ok ctx
| Err _ as backtrack -> backtrack
| Unmatch _ as backtrack ->
backtrack
|> back_nest id.at (fun () ->
F.asprintf "condition hold %s was not met" id.it)
and eval_if_not_hold_prem (ctx : Ctx.t) (id : id) (notexp : notexp) :
Ctx.t backtrack =
let exps_input = Mixfix.args notexp in
let* values_input = eval_exps ctx exps_input in
match invoke_rel ctx id values_input with
| Ok _ ->
back_unmatch id.at
(F.asprintf "condition not-hold %s was not met" id.it)
| Err _ as backtrack -> backtrack
| Unmatch _ -> Ok ctx
and eval_let_prem (ctx : Ctx.t) (exp_l : exp) (exp_r : exp) : Ctx.t backtrack
=
let* value = eval_exp ctx exp_r in
let ctx = assign_exp ctx exp_l value in
Ok ctx
and eval_iter_prem_opt (ctx : Ctx.t) (prem : prem) (vars_bound : var list)
(vars_bind : var list) : Ctx.t backtrack =
let* ctx_sub_opt = Ctx.sub_opt ctx vars_bound in
match ctx_sub_opt with
| None ->
let ctx =
List.fold_left
(fun ctx (id_binding, typ_binding, iters_binding) ->
let typ =
Typ.Make.iterate typ_binding (iters_binding @ [ Opt ])
in
let value_binding = Value.Make.opt typ None in
Ctx.add_value ctx
(id_binding, iters_binding @ [ Opt ])
value_binding)
ctx vars_bind
in
Ok ctx
| Some ctx_sub ->
let* ctx_sub = eval_prem ctx_sub prem in
let ctx =
List.fold_left
(fun ctx (id_binding, typ_binding, iters_binding) ->
let typ =
Typ.Make.iterate typ_binding (iters_binding @ [ Opt ])
in
let value_binding =
Ctx.find_value ctx_sub (id_binding, iters_binding)
in
let value_binding = Value.Make.opt typ (Some value_binding) in
Ctx.add_value ctx
(id_binding, iters_binding @ [ Opt ])
value_binding)
ctx vars_bind
in
Ok ctx
and eval_iter_prem_list (ctx : Ctx.t) (prem : prem) (vars_bound : var list)
(vars_bind : var list) : Ctx.t backtrack =
let* ctxs_sub = Ctx.sub_list ctx vars_bound in
let* ctx, values_binding =
match ctxs_sub with
| [] ->
let values_binding =
List.init (List.length vars_bind) (fun _ -> [])
in
Ok (ctx, values_binding)
| _ ->
let* ctx, values_binding_batch =
List.fold_left
(fun ctx_values_binding_batch ctx_sub ->
let* ctx, values_binding_batch = ctx_values_binding_batch in
let* ctx_sub = eval_prem ctx_sub prem in
let value_binding_batch =
List.map
(fun (id_binding, _typ_binding, iters_binding) ->
Ctx.find_value ctx_sub (id_binding, iters_binding))
vars_bind
in
let values_binding_batch =
values_binding_batch @ [ value_binding_batch ]
in
Ok (ctx, values_binding_batch))
(Ok (ctx, []))
ctxs_sub
in
let* values_binding = values_binding_batch |> Ctx.transpose in
Ok (ctx, values_binding)
in
let ctx =
List.fold_left2
(fun ctx (id_binding, typ_binding, iters_binding) values_binding ->
let typ = Typ.Make.iterate typ_binding (iters_binding @ [ List ]) in
let value_binding = Value.Make.list typ values_binding in
Ctx.add_value ctx (id_binding, iters_binding @ [ List ]) value_binding)
ctx vars_bind values_binding
in
Ok ctx
and eval_iter_prem (ctx : Ctx.t) (prem : prem) (iterprem : iterprem) :
Ctx.t backtrack =
let iter, vars_bound, vars_bind = iterprem in
match iter with
| Opt -> eval_iter_prem_opt ctx prem vars_bound vars_bind
| List -> eval_iter_prem_list ctx prem vars_bound vars_bind
and eval_debug_prem (ctx : Ctx.t) (exp : exp) : Ctx.t backtrack =
let* value = eval_exp ctx exp in
string_of_region exp.at ^ ": " ^ Il.Print.string_of_exp exp |> print_endline;
let region = string_of_region value.at in
(if region = "" then "" else region ^ ": ") ^ Il.Print.string_of_value value
|> print_endline;
Ok ctx
and is_extern_rel (rel : Rel.t) : bool =
match rel with Rel.Extern _ -> true | Rel.Defined _ -> false
and match_rule (ctx : Ctx.t) (at : region) (rulematch : rulematch)
(values_input : value list) : Ctx.t * prem list =
let _, exps_input, prems_input = rulematch in
check
(List.length exps_input = List.length values_input)
at "arity mismatch in rule";
let ctx = assign_exps ctx exps_input values_input in
(ctx, prems_input)
and invoke_rel ?(internal : bool = true) (ctx : Ctx.t) (id : id)
(values_input : value list) : value list backtrack =
Hook.on_rel_enter id values_input;
let result =
let rel = Ctx.find_rel ctx id in
let dispatch () =
match rel with
| Rel.Extern (nottyp, inputs) ->
invoke_extern_rel ctx id nottyp inputs values_input
| Rel.Defined (_, _, rulegroups, elsegroup_opt) ->
invoke_defined_rel ctx id rulegroups elsegroup_opt values_input
in
if !cache_enabled && not (is_extern_rel rel) then (
let cache_result = CCache.find !rel_cache (id.it, values_input) in
match cache_result with
| Some values_output -> Ok values_output
| None ->
let checkpoint_before = Interface.checkpoint () in
let extern_checkpoint_before = Extern.checkpoint () in
let* values_output = dispatch () in
let checkpoint_after = Interface.checkpoint () in
let extern_checkpoint_after = Extern.checkpoint () in
if
(not (Interface.seff checkpoint_before checkpoint_after))
&& not
(Extern.seff extern_checkpoint_before extern_checkpoint_after)
then CCache.add !rel_cache (id.it, values_input) values_output;
Ok values_output)
else (
if not internal then check_rel_inputs ctx id values_input;
dispatch ())
in
Hook.on_rel_exit id;
result
|> back_nest id.at (fun () ->
F.asprintf "invocation of relation %s failed" id.it)
and invoke_extern_rel (ctx : Ctx.t) (id : id) (nottyp : nottyp)
(inputs : Hints.Input.t) (values_input : value list) :
value list backtrack =
let* values_output =
match Extern.eval_extern_rel id.it values_input with
| Pass values -> Ok values
| Fail (at, msg) -> back_err at msg
in
check_rel_outputs ctx id nottyp inputs values_output;
Ok values_output
and invoke_defined_rel (ctx : Ctx.t) (id : id) (rulegroups : rulegroup list)
(elsegroup_opt : elsegroup option) (values_input : value list) :
value list backtrack =
let do_backtrack_rulepath_inner (ctx : Ctx.t) (_id_rulegroup : id)
(rulematch : rulematch) (id_rulepath : id) (prems : prem list)
(exps_output : exp list) : unit -> value list backtrack =
fun () ->
let ctx_local = Ctx.localize ctx in
let ctx_local, prems_input =
match_rule ctx_local id_rulepath.at rulematch values_input
in
let* ctx_local = eval_prems ctx_local (prems_input @ prems) in
let* values_output = eval_exps ctx_local exps_output in
Ok values_output
in
let do_backtrack_rulepath (ctx : Ctx.t) (id_rulegroup : id)
(rulematch : rulematch) (rulepath : rulepath) :
unit -> value list backtrack =
fun () ->
let id_rulepath, prems, exps_output = rulepath in
do_backtrack_rulepath_inner ctx id_rulegroup rulematch id_rulepath prems
exps_output ()
|> back_nest id.at (fun () ->
F.asprintf "application of rule %s/%s/%s failed" id.it
id_rulegroup.it id_rulepath.it)
in
let do_backtrack_rulegroup (ctx : Ctx.t) (rulegroup : rulegroup) :
(unit -> value list backtrack) list =
let id_rulegroup, rulematch, rulepaths = rulegroup.it in
rulepaths |> List.map (do_backtrack_rulepath ctx id_rulegroup rulematch)
in
let do_backtrack_elsegroup (ctx : Ctx.t) (elsegroup : elsegroup) :
value list backtrack =
let id_rulegroup, rulematch, rulepath = elsegroup.it in
(do_backtrack_rulepath ctx id_rulegroup rulematch rulepath) ()
in
let ids_path =
rulegroups
|> List.concat_map (fun rulegroup ->
let id_rulegroup, _, rulepaths = rulegroup.it in
rulepaths
|> List.map (fun rulepath ->
let id_rulepath, _, _ = rulepath in
F.asprintf "%s/%s" id_rulegroup.it id_rulepath.it))
in
let backtracks_path =
rulegroups |> List.concat_map (do_backtrack_rulegroup ctx)
in
let backtrack_det =
if !Ctx.is_det then backtracks_path |> choose_deterministic ids_path
else backtracks_path |> choose_sequential |> as_det
in
match backtrack_det with
| Ok_det values_output -> Ok values_output
| Err_det failtraces -> Err failtraces
| Unmatch_det failtraces -> (
match elsegroup_opt with
| Some elsegroup -> do_backtrack_elsegroup ctx elsegroup
| None -> Unmatch failtraces)
| Nondet_det (id_path_a, id_path_b) ->
back_err id.at
(F.asprintf "non-deterministic application of relation %s: %s, %s"
id.it id_path_a id_path_b)
and is_extern_func (func : Func.t) : bool =
match func with Func.Extern _ -> true | _ -> false
and is_high_order_func (values_input : value list) : bool =
List.exists
(fun value_input ->
match value_input.it with Il.FuncV _ -> true | _ -> false)
values_input
and invoke_func ?(internal : bool = true) (ctx : Ctx.t) (id : id)
(targs : targ list) (values_input : value list) : value backtrack =
Hook.on_func_enter id values_input;
let cursor, func = Ctx.find_func ctx id in
let anon = cursor = Ctx.Local in
let result =
if
!cache_enabled && (not anon)
&& (not (is_extern_func func))
&& not (is_high_order_func values_input)
then (
let cache_result = CCache.find !func_cache (id.it, values_input) in
match cache_result with
| Some value_output -> Ok value_output
| None ->
let checkpoint_before = Interface.checkpoint () in
let extern_checkpoint_before = Extern.checkpoint () in
let* value_output =
invoke_func_body ctx id func targs values_input
in
let checkpoint_after = Interface.checkpoint () in
let extern_checkpoint_after = Extern.checkpoint () in
if
(not (Interface.seff checkpoint_before checkpoint_after))
&& not
(Extern.seff extern_checkpoint_before extern_checkpoint_after)
then CCache.add !func_cache (id.it, values_input) value_output;
Ok value_output)
else (
if not internal then check_func_inputs ctx id targs values_input;
invoke_func_body ctx id func targs values_input)
in
Hook.on_func_exit id;
result
|> back_nest id.at (fun () ->
F.asprintf "invocation of function %s%s failed"
(Il.Print.string_of_defid id)
(Il.Print.string_of_targs targs))
and invoke_func_body (ctx : Ctx.t) (id : id) (func : Func.t)
(targs : targ list) (values_input : value list) : value backtrack =
match func with
| Func.Extern (tparams, _, typ) ->
invoke_extern_func ctx id tparams targs values_input typ
| Func.Builtin (tparams, _, typ) ->
invoke_builtin_func ctx id tparams targs values_input typ
| Func.Table (_, _, tablerows) ->
invoke_table_func ctx id tablerows values_input
| Func.Defined (tparams, _, _, clauses, elseclause_opt) ->
invoke_defined_func ctx id tparams clauses elseclause_opt targs
values_input
and invoke_extern_func (ctx : Ctx.t) (id : id) (tparams : tparam list)
(targs : targ list) (values_input : value list) (typ_output : typ) :
value backtrack =
let* value_output =
match Extern.eval_extern_func id.it [] values_input with
| Pass value -> Ok value
| Fail (at, msg) -> back_err at msg
in
check_func_output ctx id tparams typ_output targs value_output;
Ok value_output
and invoke_builtin_func (ctx : Ctx.t) (id : id) (tparams : tparam list)
(targs : targ list) (values_input : value list) (typ_output : typ) :
value backtrack =
try
let value_output =
Interface.call_builtin (fun _ -> ()) id targs values_input
in
check_func_output ctx id tparams typ_output targs value_output;
Ok value_output
with Util.Error.BuiltinError (at, msg) -> back_unmatch at msg
and match_tablerow (ctx_caller : Ctx.t) (ctx_callee : Ctx.t)
(tablerow : tablerow) (values_input : value list) :
Ctx.t * arg list * prem list * exp =
let _, args_input, exp_output, prems = tablerow.it in
check
(List.length args_input = List.length values_input)
tablerow.at "arity mismatch while matching table row";
let ctx = assign_args ctx_caller ctx_callee args_input values_input in
(ctx, args_input, prems, exp_output)
and invoke_table_func (ctx : Ctx.t) (id : id) (tablerows : tablerow list)
(values_input : value list) : value backtrack =
let backtrack_tablerow' (ctx_local : Ctx.t) (prems : prem list)
(exp_output : exp) : value backtrack =
let* ctx_local = eval_prems ctx_local prems in
let* value_output = eval_exp ctx_local exp_output in
Ok value_output
in
tablerows
|> List.mapi (fun _idx_row tablerow ->
let backtrack_tablerow () : value backtrack =
let ctx_local = Ctx.localize ctx in
let ctx_local, args_input, prems, exp_output =
match_tablerow ctx ctx_local tablerow values_input
in
backtrack_tablerow' ctx_local prems exp_output
|> back_nest id.at (fun () ->
F.asprintf "application of table row %s%s failed" id.it
(Il.Print.string_of_args args_input))
in
backtrack_tablerow)
|> choose_sequential
and match_clause (ctx_caller : Ctx.t) (ctx_callee : Ctx.t) (clause : clause)
(values_input : value list) : Ctx.t * arg list * prem list * exp =
let args_input, exp_output, prems = clause.it in
check
(List.length args_input = List.length values_input)
clause.at "arity mismatch while matching clause";
let ctx = assign_args ctx_caller ctx_callee args_input values_input in
(ctx, args_input, prems, exp_output)
and invoke_defined_func (ctx : Ctx.t) (id : id) (tparams : tparam list)
(clauses : clause list) (elseclause_opt : elseclause option)
(targs : targ list) (values_input : value list) : value backtrack =
let do_backtrack_clause_inner (ctx : Ctx.t) (_idx_clause : int)
(clause : clause) : unit -> value backtrack =
fun () ->
let ctx_local = Ctx.localize ctx in
check
(List.length targs = List.length tparams)
id.at "arity mismatch in type arguments";
let ctx_local =
List.fold_left2
(fun ctx_local tparam targ ->
let td = Type.Typdef.Defined ([], PlainT targ $ targ.at) in
Ctx.add_typdef ctx_local tparam td)
ctx_local tparams targs
in
let ctx_local, _args_input, prems, exp_output =
match_clause ctx ctx_local clause values_input
in
let* ctx_local = eval_prems ctx_local prems in
let* value_output = eval_exp ctx_local exp_output in
Ok value_output
in
let do_backtrack_clause (ctx : Ctx.t) (idx_clause : int) (clause : clause) :
unit -> value backtrack =
fun () ->
do_backtrack_clause_inner ctx idx_clause clause ()
|> back_nest id.at (fun () ->
F.asprintf "application of clause %s%s failed" id.it
(Il.Print.string_of_args
(let args_input, _, _ = clause.it in
args_input)))
in
let idxs_clause = clauses |> List.mapi (fun idx _ -> idx) in
let backtracks_clause =
clauses
|> List.mapi (fun idx clause -> do_backtrack_clause ctx idx clause)
in
let backtrack_det =
if !Ctx.is_det then backtracks_clause |> choose_deterministic idxs_clause
else backtracks_clause |> choose_sequential |> as_det
in
match backtrack_det with
| Ok_det value_output -> Ok value_output
| Err_det failtraces -> Err failtraces
| Unmatch_det failtraces -> (
match elseclause_opt with
| Some elseclause -> do_backtrack_clause ctx (-1) elseclause ()
| None -> Unmatch failtraces)
| Nondet_det (idx_clause_a, idx_clause_b) ->
back_err id.at
(F.asprintf "non-deterministic application of function %s: %d, %d"
id.it idx_clause_a idx_clause_b)
let clear () : unit =
CCache.empty !func_cache;
CCache.empty !rel_cache;
Hashtbl.clear sub_cache
let do_eval_rel (relname : string) (values_input : value list) :
value list backtrack =
let ctx = Ctx.empty in
invoke_rel ~internal:false ctx (relname $ no_region) values_input
let do_eval_func (funcname : string) (targs : targ list)
(values_input : value list) : value backtrack =
let ctx = Ctx.empty in
invoke_func ~internal:false ctx (funcname $ no_region) targs values_input
let eval_program (relname : string) (includes_p4 : string list)
(path_p4 : string) : Run.program_result =
clear ();
try
let parse_result = Interface.parse_program includes_p4 [ path_p4 ] in
match parse_result with
| Pass value_program ->
Hook.on_program value_program;
let+ values_output = do_eval_rel relname [ value_program ] in
(Run.Pass values_output : Run.program_result)
| Fail (`Syntax (at, msg)) -> Run.Fail (`Syntax (at, msg))
with
| Util.Error.ParseError (at, msg) -> Run.Fail (`Syntax (at, msg))
| Util.Error.InterpError (at, msg) -> Run.Fail (`Runtime (at, msg))
let eval_rel (relname : string) (values_input : value list) : Run.rel_result =
clear ();
try
let+ values_output = do_eval_rel relname values_input in
(Run.Pass values_output : Run.rel_result)
with Util.Error.InterpError (at, msg) -> Run.Fail (at, msg)
let eval_func (funcname : string) (targs : targ list)
(values_input : value list) : Run.func_result =
clear ();
try
let+ value_output = do_eval_func funcname targs values_input in
(Run.Pass value_output : Run.func_result)
with Util.Error.InterpError (at, msg) -> Run.Fail (at, msg)
let init ~(cache : bool) ~(det : bool) ~(guard : bool) (spec : spec) : unit =
if cache then Cache.cache_on () else Cache.cache_off ();
check_guard := guard;
Ctx.init ~det spec
end