Source file storage_functors.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
open Storage_sigs
module Registered = struct
let ghost = false
end
module Ghost = struct
let ghost = true
end
module type ENCODER = sig
type t
val of_bytes : key:(unit -> string list) -> bytes -> t tzresult
val to_bytes : t -> bytes
end
module Make_encoder (V : VALUE) : ENCODER with type t := V.t = struct
let of_bytes ~key b =
let open Result_syntax in
match Data_encoding.Binary.of_bytes_opt V.encoding b with
| None -> tzfail (Raw_context.Storage_error (Corrupted_data (key ())))
| Some v -> return v
let to_bytes v =
match Data_encoding.Binary.to_bytes_opt V.encoding v with
| Some b -> b
| None -> Bytes.empty
end
let len_name = "len"
let data_name = "data"
let encode_len_value bytes =
let length = Bytes.length bytes in
Data_encoding.(Binary.to_bytes_exn int31) length
let decode_len_value key len =
let open Result_syntax in
match Data_encoding.(Binary.of_bytes_opt int31) len with
| None -> tzfail (Raw_context.Storage_error (Corrupted_data key))
| Some len -> return len
module Make_subcontext (R : REGISTER) (C : Raw_context.T) (N : NAME) :
Raw_context.T with type t = C.t and type local_context = C.local_context =
struct
type t = C.t
type local_context = C.local_context
let to_key k = N.name @ k
let mem t k = C.mem t (to_key k)
let mem_tree t k = C.mem_tree t (to_key k)
let get t k = C.get t (to_key k)
let get_tree t k = C.get_tree t (to_key k)
let find t k = C.find t (to_key k)
let find_tree t k = C.find_tree t (to_key k)
let add t k v = C.add t (to_key k) v
let add_tree t k v = C.add_tree t (to_key k) v
let init t k v = C.init t (to_key k) v
let init_tree t k v = C.init_tree t (to_key k) v
let update t k v = C.update t (to_key k) v
let update_tree t k v = C.update_tree t (to_key k) v
let add_or_remove t k v = C.add_or_remove t (to_key k) v
let add_or_remove_tree t k v = C.add_or_remove_tree t (to_key k) v
let remove_existing t k = C.remove_existing t (to_key k)
let remove_existing_tree t k = C.remove_existing_tree t (to_key k)
let remove t k = C.remove t (to_key k)
let list t ?offset ?length k = C.list t ?offset ?length (to_key k)
let fold ?depth t k ~order ~init ~f =
C.fold ?depth t (to_key k) ~order ~init ~f
let config t = C.config t
module Tree = C.Tree
module Proof = C.Proof
let verify_tree_proof = C.verify_tree_proof
let verify_stream_proof = C.verify_stream_proof
let equal_config = C.equal_config
let project = C.project
let absolute_key c k = C.absolute_key c (to_key k)
type error += Block_quota_exceeded = C.Block_quota_exceeded
type error += Operation_quota_exceeded = C.Operation_quota_exceeded
let consume_gas = C.consume_gas
let check_enough_gas = C.check_enough_gas
let description =
let description =
if R.ghost then Storage_description.create () else C.description
in
Storage_description.register_named_subcontext description N.name
let length = C.length
let with_local_context ctxt k f = C.with_local_context ctxt (to_key k) f
module Local_context = C.Local_context
end
module Make_single_data_storage
(R : REGISTER)
(C : Raw_context.T)
(N : NAME)
(V : VALUE) : Single_data_storage with type t = C.t and type value = V.t =
struct
type t = C.t
type context = t
type value = V.t
let mem t = C.mem t N.name
include Make_encoder (V)
let get t =
let open Lwt_result_syntax in
let* b = C.get t N.name in
let key () = C.absolute_key t N.name in
let*? v = of_bytes ~key b in
return v
let find t =
let open Lwt_result_syntax in
let*! bytes_opt = C.find t N.name in
match bytes_opt with
| None -> return_none
| Some b ->
let key () = C.absolute_key t N.name in
let*? v = of_bytes ~key b in
return_some v
let init t v =
let open Lwt_result_syntax in
let+ t = C.init t N.name (to_bytes v) in
C.project t
let update t v =
let open Lwt_result_syntax in
let+ t = C.update t N.name (to_bytes v) in
C.project t
let add t v =
let open Lwt_syntax in
let+ t = C.add t N.name (to_bytes v) in
C.project t
let add_or_remove t v =
let open Lwt_syntax in
let+ t = C.add_or_remove t N.name (Option.map to_bytes v) in
C.project t
let remove t =
let open Lwt_syntax in
let+ t = C.remove t N.name in
C.project t
let remove_existing t =
let open Lwt_result_syntax in
let+ t = C.remove_existing t N.name in
C.project t
let () =
let open Storage_description in
let description =
if R.ghost then Storage_description.create () else C.description
in
register_value
~get:find
(register_named_subcontext description N.name)
V.encoding
end
module type INDEX = sig
type t
include Path_encoding.S with type t := t
type 'a ipath
val args : ('a, t, 'a ipath) Storage_description.args
end
module Pair (I1 : INDEX) (I2 : INDEX) : INDEX with type t = I1.t * I2.t = struct
type t = I1.t * I2.t
let path_length = I1.path_length + I2.path_length
let to_path (x, y) l = I1.to_path x (I2.to_path y l)
let of_path l =
match Misc.take I1.path_length l with
| None -> None
| Some (l1, l2) -> (
match (I1.of_path l1, I2.of_path l2) with
| Some x, Some y -> Some (x, y)
| _ -> None)
type 'a ipath = 'a I1.ipath I2.ipath
let args = Storage_description.Pair (I1.args, I2.args)
end
module Make_data_set_storage (C : Raw_context.T) (I : INDEX) :
Data_set_storage with type t = C.t and type elt = I.t = struct
type t = C.t
type context = t
type elt = I.t
let inited = Bytes.of_string "inited"
let mem s i = C.mem s (I.to_path i [])
let add s i =
let open Lwt_syntax in
let+ t = C.add s (I.to_path i []) inited in
C.project t
let remove s i =
let open Lwt_syntax in
let+ t = C.remove s (I.to_path i []) in
C.project t
let clear s =
let open Lwt_syntax in
let+ t = C.remove s [] in
C.project t
let fold s ~order ~init ~f =
C.fold ~depth:(`Eq I.path_length) s [] ~order ~init ~f:(fun file tree acc ->
match C.Tree.kind tree with
| `Value -> (
match I.of_path file with None -> assert false | Some p -> f p acc)
| `Tree -> Lwt.return acc)
let elements s =
fold s ~order:`Sorted ~init:[] ~f:(fun p acc -> Lwt.return (p :: acc))
let () =
let open Lwt_result_syntax in
let open Storage_description in
let unpack = unpack I.args in
register_value
~get:(fun c ->
let c, k = unpack c in
let*! result = mem c k in
match result with true -> return_some true | false -> return_none)
(register_indexed_subcontext
~list:(fun c ->
let*! result = elements c in
return result)
C.description
I.args)
Data_encoding.bool
end
module Make_indexed_data_storage (C : Raw_context.T) (I : INDEX) (V : VALUE) :
Indexed_data_storage with type t = C.t and type key = I.t and type value = V.t =
struct
type t = C.t
type context = t
type key = I.t
type value = V.t
include Make_encoder (V)
let mem s i = C.mem s (I.to_path i [])
let is_empty i =
let open Lwt_syntax in
let* root = C.find_tree i [] in
match root with
| None -> return_true
| Some root -> return @@ C.Tree.is_empty root
let get s i =
let open Lwt_result_syntax in
let* b = C.get s (I.to_path i []) in
let key () = C.absolute_key s (I.to_path i []) in
let*? v = of_bytes ~key b in
return v
let find s i =
let open Lwt_result_syntax in
let*! bytes_opt = C.find s (I.to_path i []) in
match bytes_opt with
| None -> return_none
| Some b ->
let key () = C.absolute_key s (I.to_path i []) in
let*? v = of_bytes ~key b in
return_some v
let update s i v =
let open Lwt_result_syntax in
let+ t = C.update s (I.to_path i []) (to_bytes v) in
C.project t
let init s i v =
let open Lwt_result_syntax in
let+ t = C.init s (I.to_path i []) (to_bytes v) in
C.project t
let add s i v =
let open Lwt_syntax in
let+ t = C.add s (I.to_path i []) (to_bytes v) in
C.project t
let add_or_remove s i v =
let open Lwt_syntax in
let+ t = C.add_or_remove s (I.to_path i []) (Option.map to_bytes v) in
C.project t
let remove s i =
let open Lwt_syntax in
let+ t = C.remove s (I.to_path i []) in
C.project t
let remove_existing s i =
let open Lwt_result_syntax in
let+ t = C.remove_existing s (I.to_path i []) in
C.project t
let clear s =
let open Lwt_syntax in
let+ t = C.remove s [] in
C.project t
let fold s ~order ~init ~f =
let open Lwt_syntax in
C.fold ~depth:(`Eq I.path_length) s [] ~order ~init ~f:(fun file tree acc ->
let* bytes_opt = C.Tree.to_value tree in
match bytes_opt with
| Some v -> (
match I.of_path file with
| None -> assert false
| Some path -> (
let key () = C.absolute_key s file in
match of_bytes ~key v with
| Ok v -> f path v acc
| Error _ -> return acc))
| None -> return acc)
let fold_keys s ~order ~init ~f =
fold s ~order ~init ~f:(fun k _ acc -> f k acc)
let bindings s =
fold s ~order:`Sorted ~init:[] ~f:(fun p v acc ->
Lwt.return ((p, v) :: acc))
let keys s =
fold_keys s ~order:`Sorted ~init:[] ~f:(fun p acc -> Lwt.return (p :: acc))
let () =
let open Lwt_result_syntax in
let open Storage_description in
let unpack = unpack I.args in
register_value
~get:(fun c ->
let c, k = unpack c in
find c k)
(register_indexed_subcontext
~list:(fun c ->
let*! result = keys c in
return result)
C.description
I.args)
V.encoding
end
module Make_indexed_carbonated_data_storage_INTERNAL
(C : Raw_context.T)
(I : INDEX)
(V : VALUE) :
Indexed_carbonated_data_storage_INTERNAL
with type t = C.t
and type key = I.t
and type value = V.t = struct
type t = C.t
type context = t
type key = I.t
type value = V.t
include Make_encoder (V)
let data_key i = I.to_path i [data_name]
let len_key i = I.to_path i [len_name]
let consume_mem_gas c key =
let path_length = List.length @@ C.absolute_key c key in
C.consume_gas c (Storage_costs.read_access ~path_length ~read_bytes:0)
let existing_size c i =
let open Lwt_result_syntax in
let*! bytes_opt = C.find c (len_key i) in
match bytes_opt with
| None -> return (0, false)
| Some len ->
let*? len = decode_len_value (len_key i) len in
return (len, true)
let consume_read_gas get c i =
let open Lwt_result_syntax in
let len_key = len_key i in
let* len = get c len_key in
let path_length = List.length @@ C.absolute_key c len_key in
let*? read_bytes = decode_len_value len_key len in
let cost = Storage_costs.read_access ~path_length ~read_bytes in
let*? t = C.consume_gas c cost in
return t
let consume_serialize_write_gas set c i v =
let open Lwt_result_syntax in
let bytes = to_bytes v in
let len = Bytes.length bytes in
let*? c = C.consume_gas c (Gas_limit_repr.alloc_mbytes_cost len) in
let cost = Storage_costs.write_access ~written_bytes:len in
let*? c = C.consume_gas c cost in
let+ c = set c (len_key i) (encode_len_value bytes) in
(c, bytes)
let consume_remove_gas del c i =
let open Lwt_result_syntax in
let*? c = C.consume_gas c (Storage_costs.write_access ~written_bytes:0) in
del c (len_key i)
let mem s i =
let open Lwt_result_syntax in
let key = data_key i in
let*? s = consume_mem_gas s key in
let*! exists = C.mem s key in
return (C.project s, exists)
let is_empty s =
let open Lwt_result_syntax in
let root_key = [] in
let*? s = consume_mem_gas s root_key in
let*! root_opt = C.find_tree s root_key in
match root_opt with
| None -> return @@ (C.project s, true)
| Some root ->
let is_empty = C.Tree.is_empty root in
return @@ (C.project s, is_empty)
let get_unprojected s i =
let open Lwt_result_syntax in
let* s = consume_read_gas C.get s i in
let* b = C.get s (data_key i) in
let key () = C.absolute_key s (data_key i) in
let*? v = of_bytes ~key b in
return (s, v)
let get s i =
let open Lwt_result_syntax in
let+ s, v = get_unprojected s i in
(C.project s, v)
let find s i =
let open Lwt_result_syntax in
let key = data_key i in
let*? s = consume_mem_gas s key in
let*! exists = C.mem s key in
if exists then
let+ s, v = get s i in
(s, Some v)
else return (C.project s, None)
let update s i v =
let open Lwt_result_syntax in
let* prev_size, _ = existing_size s i in
let* s, bytes = consume_serialize_write_gas C.update s i v in
let+ t = C.update s (data_key i) bytes in
let size_diff = Bytes.length bytes - prev_size in
(C.project t, size_diff)
let init s i v =
let open Lwt_result_syntax in
let* s, bytes = consume_serialize_write_gas C.init s i v in
let+ t = C.init s (data_key i) bytes in
let size = Bytes.length bytes in
(C.project t, size)
let add s i v =
let open Lwt_result_syntax in
let add s i v =
let*! ctxt = C.add s i v in
return ctxt
in
let* prev_size, existed = existing_size s i in
let* s, bytes = consume_serialize_write_gas add s i v in
let+ t = add s (data_key i) bytes in
let size_diff = Bytes.length bytes - prev_size in
(C.project t, size_diff, existed)
let remove s i =
let open Lwt_result_syntax in
let remove s i =
let*! ctxt = C.remove s i in
return ctxt
in
let* prev_size, existed = existing_size s i in
let* s = consume_remove_gas remove s i in
let+ t = remove s (data_key i) in
(C.project t, prev_size, existed)
let clear s =
let open Lwt_result_syntax in
let*? s = C.consume_gas s (Storage_costs.write_access ~written_bytes:0) in
let*! t = C.remove s [] in
return (C.project t)
let remove_existing s i =
let open Lwt_result_syntax in
let* prev_size, _ = existing_size s i in
let* s = consume_remove_gas C.remove_existing s i in
let+ t = C.remove_existing s (data_key i) in
(C.project t, prev_size)
let add_or_remove s i v =
match v with None -> remove s i | Some v -> add s i v
let list_key_values ?(offset = 0) ?(length = max_int) s =
let open Lwt_result_syntax in
let root = [] in
let depth = `Eq I.path_length in
let*! size = C.length s root in
let*? s = C.consume_gas s (Storage_costs.list_key_values_traverse ~size) in
let+ s, rev_values, _offset, _length =
C.fold
s
root
~depth
~order:`Sorted
~init:(Ok (s, [], offset, length))
~f:(fun file tree acc ->
match (C.Tree.kind tree, acc) with
| `Tree, Ok (s, rev_values, offset, length) -> (
if Compare.Int.(length <= 0) then
Lwt.return acc
else if Compare.Int.(offset > 0) then
let offset = pred offset in
Lwt.return (Ok (s, rev_values, offset, length))
else
match I.of_path file with
| None -> assert false
| Some key ->
let+ s, value = get_unprojected s key in
(s, (key, value) :: rev_values, 0, pred length))
| _ ->
Lwt.return acc)
in
(C.project s, List.rev rev_values)
let fold_keys_unaccounted s ~order ~init ~f =
C.fold
~depth:(`Eq (1 + I.path_length))
s
[]
~order
~init
~f:(fun file tree acc ->
match C.Tree.kind tree with
| `Value -> (
match List.rev file with
| last :: _ when Compare.String.(last = len_name) -> Lwt.return acc
| last :: rest when Compare.String.(last = data_name) -> (
let file = List.rev rest in
match I.of_path file with
| None -> assert false
| Some path -> f path acc)
| _ -> assert false)
| `Tree -> Lwt.return acc)
let keys_unaccounted s =
fold_keys_unaccounted s ~order:`Sorted ~init:[] ~f:(fun p acc ->
Lwt.return (p :: acc))
let () =
let open Storage_description in
let open Lwt_result_syntax in
let unpack = unpack I.args in
register_value
~get:(fun c ->
let c, k = unpack c in
let+ _, v = find c k in
v)
(register_indexed_subcontext
~list:(fun c ->
let*! result = keys_unaccounted c in
return result)
C.description
I.args)
V.encoding
end
module Make_indexed_carbonated_data_storage : functor
(C : Raw_context.T)
(I : INDEX)
(V : VALUE)
->
Indexed_carbonated_data_storage
with type t = C.t
and type key = I.t
and type value = V.t =
Make_indexed_carbonated_data_storage_INTERNAL
module Make_carbonated_data_set_storage (C : Raw_context.T) (I : INDEX) :
Carbonated_data_set_storage with type t = C.t and type elt = I.t = struct
module V = struct
type t = unit
let encoding = Data_encoding.unit
end
module M = Make_indexed_carbonated_data_storage_INTERNAL (C) (I) (V)
type t = M.t
type context = t
type elt = I.t
let mem = M.mem
let is_empty = M.is_empty
let clear = M.clear
let init s i = M.init s i ()
let add s i = M.add s i ()
let remove s i = M.remove s i
let fold_keys_unaccounted = M.fold_keys_unaccounted
end
module Make_indexed_data_snapshotable_storage
(C : Raw_context.T)
(Snapshot_index : INDEX)
(I : INDEX)
(V : VALUE) :
Indexed_data_snapshotable_storage
with type t = C.t
and type snapshot = Snapshot_index.t
and type key = I.t
and type value = V.t = struct
type snapshot = Snapshot_index.t
let data_name = ["current"]
let snapshot_name = ["snapshot"]
module C_data =
Make_subcontext (Registered) (C)
(struct
let name = data_name
end)
module C_snapshot =
Make_subcontext (Registered) (C)
(struct
let name = snapshot_name
end)
module V_encoder = Make_encoder (V)
include Make_indexed_data_storage (C_data) (I) (V)
module Snapshot =
Make_indexed_data_storage (C_snapshot) (Pair (Snapshot_index) (I)) (V)
let snapshot_path id = snapshot_name @ Snapshot_index.to_path id []
let snapshot_exists s id = C.mem_tree s (snapshot_path id)
let err_missing_key key = Raw_context.storage_error (Missing_key (key, Copy))
let snapshot s id =
let open Lwt_result_syntax in
let*! tree_opt = C.find_tree s data_name in
match tree_opt with
| None -> Lwt.return (err_missing_key data_name)
| Some tree ->
let*! t = C.add_tree s (snapshot_path id) tree in
return (C.project t)
let fold_snapshot s id ~order ~init ~f =
let open Lwt_result_syntax in
let*! tree_opt = C.find_tree s (snapshot_path id) in
match tree_opt with
| None -> Lwt.return (err_missing_key data_name)
| Some tree ->
C_data.Tree.fold
tree
~depth:(`Eq I.path_length)
[]
~order
~init:(Ok init)
~f:(fun file tree acc ->
let*? acc in
let*! bytes_opt = C.Tree.to_value tree in
match bytes_opt with
| Some v -> (
match I.of_path file with
| None -> assert false
| Some path -> (
let key () = C.absolute_key s file in
match V_encoder.of_bytes ~key v with
| Ok v -> f path v acc
| Error _ -> return acc))
| None -> return acc)
let delete_snapshot s id =
let open Lwt_syntax in
let+ t = C.remove s (snapshot_path id) in
C.project t
end
module Make_indexed_subcontext (C : Raw_context.T) (I : INDEX) :
Indexed_raw_context
with type t = C.t
and type key = I.t
and type 'a ipath = 'a I.ipath
and type local_context = C.local_context = struct
type t = C.t
type context = t
type key = I.t
type 'a ipath = 'a I.ipath
type local_context = C.local_context
let clear t =
let open Lwt_syntax in
let+ t = C.remove t [] in
C.project t
let is_empty i =
let open Lwt_syntax in
let* root = C.find_tree i [] in
match root with
| None -> return_true
| Some root -> return @@ C.Tree.is_empty root
let fold_keys t ~order ~init ~f =
C.fold ~depth:(`Eq I.path_length) t [] ~order ~init ~f:(fun path tree acc ->
match C.Tree.kind tree with
| `Tree -> (
match I.of_path path with
| None -> assert false
| Some path -> f path acc)
| `Value -> Lwt.return acc)
let keys t =
fold_keys t ~order:`Sorted ~init:[] ~f:(fun i acc -> Lwt.return (i :: acc))
let err_missing_key key = Raw_context.storage_error (Missing_key (key, Copy))
let copy t ~from ~to_ =
let open Lwt_result_syntax in
let from = I.to_path from [] in
let to_ = I.to_path to_ [] in
let*! tree_opt = C.find_tree t from in
match tree_opt with
| None -> Lwt.return (err_missing_key from)
| Some tree ->
let*! ctxt = C.add_tree t to_ tree in
return ctxt
let remove t k = C.remove t (I.to_path k [])
let description =
let open Lwt_result_syntax in
Storage_description.register_indexed_subcontext
~list:(fun c ->
let*! result = keys c in
return result)
C.description
I.args
let unpack = Storage_description.unpack I.args
let pack = Storage_description.pack I.args
module Raw_context :
Raw_context.T
with type t = C.t I.ipath
and type local_context = C.local_context = struct
type t = C.t I.ipath
type local_context = C.local_context
let to_key i k = I.to_path i k
let mem c k =
let t, i = unpack c in
C.mem t (to_key i k)
let mem_tree c k =
let t, i = unpack c in
C.mem_tree t (to_key i k)
let get c k =
let t, i = unpack c in
C.get t (to_key i k)
let get_tree c k =
let t, i = unpack c in
C.get_tree t (to_key i k)
let find c k =
let t, i = unpack c in
C.find t (to_key i k)
let find_tree c k =
let t, i = unpack c in
C.find_tree t (to_key i k)
let list c ?offset ?length k =
let t, i = unpack c in
C.list t ?offset ?length (to_key i k)
let init c k v =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.init t (to_key i k) v in
pack t i
let init_tree c k v =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.init_tree t (to_key i k) v in
pack t i
let update c k v =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.update t (to_key i k) v in
pack t i
let update_tree c k v =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.update_tree t (to_key i k) v in
pack t i
let add c k v =
let open Lwt_syntax in
let t, i = unpack c in
let+ t = C.add t (to_key i k) v in
pack t i
let add_tree c k v =
let open Lwt_syntax in
let t, i = unpack c in
let+ t = C.add_tree t (to_key i k) v in
pack t i
let add_or_remove c k v =
let open Lwt_syntax in
let t, i = unpack c in
let+ t = C.add_or_remove t (to_key i k) v in
pack t i
let add_or_remove_tree c k v =
let open Lwt_syntax in
let t, i = unpack c in
let+ t = C.add_or_remove_tree t (to_key i k) v in
pack t i
let remove_existing c k =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.remove_existing t (to_key i k) in
pack t i
let remove_existing_tree c k =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t = C.remove_existing_tree t (to_key i k) in
pack t i
let remove c k =
let open Lwt_syntax in
let t, i = unpack c in
let+ t = C.remove t (to_key i k) in
pack t i
let fold ?depth c k ~order ~init ~f =
let t, i = unpack c in
C.fold ?depth t (to_key i k) ~order ~init ~f
let config c =
let t, _ = unpack c in
C.config t
module Tree = struct
include C.Tree
let empty c =
let t, _ = unpack c in
C.Tree.empty t
end
module Proof = C.Proof
let verify_tree_proof = C.verify_tree_proof
let verify_stream_proof = C.verify_stream_proof
let equal_config = C.equal_config
let project c =
let t, _ = unpack c in
C.project t
let absolute_key c k =
let t, i = unpack c in
C.absolute_key t (to_key i k)
type error += Block_quota_exceeded = C.Block_quota_exceeded
type error += Operation_quota_exceeded = C.Operation_quota_exceeded
let consume_gas c g =
let open Result_syntax in
let t, i = unpack c in
let* t = C.consume_gas t g in
return (pack t i)
let check_enough_gas c g =
let t, _i = unpack c in
C.check_enough_gas t g
let description = description
let length c =
let t, _i = unpack c in
C.length t
let with_local_context c k f =
let open Lwt_result_syntax in
let t, i = unpack c in
let+ t, res = C.with_local_context t (to_key i k) f in
(pack t i, res)
module Local_context = C.Local_context
end
let with_local_context s i f =
let open Lwt_result_syntax in
let+ c, x = Raw_context.with_local_context (pack s i) [] f in
let s, _ = unpack c in
(s, x)
module Make_set (R : REGISTER) (N : NAME) :
Data_set_storage with type t = t and type elt = key = struct
type t = C.t
type context = t
type elt = I.t
let inited = Bytes.of_string "inited"
let mem s i = Raw_context.mem (pack s i) N.name
let add s i =
let open Lwt_syntax in
let+ c = Raw_context.add (pack s i) N.name inited in
let s, _ = unpack c in
C.project s
let remove s i =
let open Lwt_syntax in
let+ c = Raw_context.remove (pack s i) N.name in
let s, _ = unpack c in
C.project s
let clear s =
let open Lwt_syntax in
let+ t =
fold_keys s ~init:s ~order:`Sorted ~f:(fun i s ->
let+ c = Raw_context.remove (pack s i) N.name in
let s, _ = unpack c in
s)
in
C.project t
let fold s ~order ~init ~f =
let open Lwt_syntax in
fold_keys s ~order ~init ~f:(fun i acc ->
let* result = mem s i in
match result with true -> f i acc | false -> Lwt.return acc)
let elements s =
fold s ~order:`Sorted ~init:[] ~f:(fun p acc -> Lwt.return (p :: acc))
let () =
let open Lwt_result_syntax in
let open Storage_description in
let unpack = unpack I.args in
let description =
if R.ghost then Storage_description.create ()
else Raw_context.description
in
register_value
~get:(fun c ->
let c, k = unpack c in
let*! result = mem c k in
match result with true -> return_some true | false -> return_none)
(register_named_subcontext description N.name)
Data_encoding.bool
end
module Make_map (R : REGISTER) (N : NAME) (V : VALUE) :
Indexed_data_storage_with_local_context
with type t = t
and type key = key
and type value = V.t
and type local_context = local_context = struct
type t = C.t
type context = t
type key = I.t
type value = V.t
type nonrec local_context = local_context
include Make_encoder (V)
let is_empty i =
let open Lwt_syntax in
let* root = C.find_tree i [] in
match root with
| None -> return_true
| Some root -> return @@ C.Tree.is_empty root
let mem s i = Raw_context.mem (pack s i) N.name
let get s i =
let open Lwt_result_syntax in
let* b = Raw_context.get (pack s i) N.name in
let key () = Raw_context.absolute_key (pack s i) N.name in
let*? v = of_bytes ~key b in
return v
let find s i =
let open Lwt_result_syntax in
let*! bytes_opt = Raw_context.find (pack s i) N.name in
match bytes_opt with
| None -> return_none
| Some b ->
let key () = Raw_context.absolute_key (pack s i) N.name in
let*? v = of_bytes ~key b in
return_some v
let update s i v =
let open Lwt_result_syntax in
let+ c = Raw_context.update (pack s i) N.name (to_bytes v) in
let s, _ = unpack c in
C.project s
let init s i v =
let open Lwt_result_syntax in
let+ c = Raw_context.init (pack s i) N.name (to_bytes v) in
let s, _ = unpack c in
C.project s
let add s i v =
let open Lwt_syntax in
let+ c = Raw_context.add (pack s i) N.name (to_bytes v) in
let s, _ = unpack c in
C.project s
let add_or_remove s i v =
let open Lwt_syntax in
let+ c =
Raw_context.add_or_remove (pack s i) N.name (Option.map to_bytes v)
in
let s, _ = unpack c in
C.project s
let remove s i =
let open Lwt_syntax in
let+ c = Raw_context.remove (pack s i) N.name in
let s, _ = unpack c in
C.project s
let remove_existing s i =
let open Lwt_result_syntax in
let+ c = Raw_context.remove_existing (pack s i) N.name in
let s, _ = unpack c in
C.project s
let clear s =
let open Lwt_syntax in
let+ t =
fold_keys s ~order:`Sorted ~init:s ~f:(fun i s ->
let+ c = Raw_context.remove (pack s i) N.name in
let s, _ = unpack c in
s)
in
C.project t
let fold s ~order ~init ~f =
let open Lwt_syntax in
fold_keys s ~order ~init ~f:(fun i acc ->
let* value_opt = get s i in
match value_opt with Error _ -> return acc | Ok v -> f i v acc)
let bindings s =
fold s ~order:`Sorted ~init:[] ~f:(fun p v acc ->
Lwt.return ((p, v) :: acc))
let fold_keys s ~order ~init ~f =
let open Lwt_syntax in
fold_keys s ~order ~init ~f:(fun i acc ->
let* result = mem s i in
match result with false -> return acc | true -> f i acc)
let keys s =
fold_keys s ~order:`Sorted ~init:[] ~f:(fun p acc ->
Lwt.return (p :: acc))
let () =
let open Storage_description in
let unpack = unpack I.args in
let description =
if R.ghost then Storage_description.create ()
else Raw_context.description
in
register_value
~get:(fun c ->
let c, k = unpack c in
find c k)
(register_named_subcontext description N.name)
V.encoding
module Local = struct
type context = Raw_context.Local_context.t
let mem local = Raw_context.Local_context.mem local N.name
let get local =
let open Lwt_result_syntax in
let* r = Raw_context.Local_context.get local N.name in
let key () = Raw_context.Local_context.absolute_key local N.name in
let*? v = of_bytes ~key r in
return v
let find local =
let open Lwt_result_syntax in
let*! bytes_opt = Raw_context.Local_context.find local N.name in
match bytes_opt with
| None -> return_none
| Some b ->
let key () = Raw_context.Local_context.absolute_key local N.name in
let*? v = of_bytes ~key b in
return_some v
let init local v =
Raw_context.Local_context.init local N.name (to_bytes v)
let update local v =
Raw_context.Local_context.update local N.name (to_bytes v)
let add local v = Raw_context.Local_context.add local N.name (to_bytes v)
let add_or_remove local vo =
Raw_context.Local_context.add_or_remove
local
N.name
(Option.map to_bytes vo)
let remove_existing local =
Raw_context.Local_context.remove_existing local N.name
let remove local = Raw_context.Local_context.remove local N.name
end
end
module Make_carbonated_map (R : REGISTER) (N : NAME) (V : VALUE) :
Non_iterable_indexed_carbonated_data_storage
with type t = t
and type key = key
and type value = V.t = struct
type t = C.t
type context = t
type key = I.t
type value = V.t
include Make_encoder (V)
let len_name = len_name :: N.name
let data_name = data_name :: N.name
let consume_mem_gas c =
let path_length = List.length (Raw_context.absolute_key c N.name) + 1 in
Raw_context.consume_gas
c
(Storage_costs.read_access ~path_length ~read_bytes:0)
let existing_size c =
let open Lwt_result_syntax in
let*! bytes_opt = Raw_context.find c len_name in
match bytes_opt with
| None -> return (0, false)
| Some len ->
let*? len = decode_len_value len_name len in
return (len, true)
let consume_read_gas get c =
let open Lwt_result_syntax in
let path_length = List.length (Raw_context.absolute_key c N.name) + 1 in
let* len = get c len_name in
let*? read_bytes = decode_len_value len_name len in
let*? c =
Raw_context.consume_gas
c
(Storage_costs.read_access ~path_length ~read_bytes)
in
return c
let consume_write_gas set c v =
let open Lwt_result_syntax in
let bytes = to_bytes v in
let len = Bytes.length bytes in
let*? c =
Raw_context.consume_gas
c
(Storage_costs.write_access ~written_bytes:len)
in
let+ c = set c len_name (encode_len_value bytes) in
(c, bytes)
let consume_remove_gas del c =
let open Lwt_result_syntax in
let*? c =
Raw_context.consume_gas c (Storage_costs.write_access ~written_bytes:0)
in
del c len_name
let mem s i =
let open Lwt_result_syntax in
let*? c = consume_mem_gas (pack s i) in
let*! res = Raw_context.mem c data_name in
return (Raw_context.project c, res)
let get s i =
let open Lwt_result_syntax in
let* c = consume_read_gas Raw_context.get (pack s i) in
let* b = Raw_context.get c data_name in
let key () = Raw_context.absolute_key c data_name in
let*? v = of_bytes ~key b in
return (Raw_context.project c, v)
let find s i =
let open Lwt_result_syntax in
let*? c = consume_mem_gas (pack s i) in
let s, _ = unpack c in
let*! exists = Raw_context.mem (pack s i) data_name in
if exists then
let+ s, v = get s i in
(s, Some v)
else return (C.project s, None)
let update s i v =
let open Lwt_result_syntax in
let* prev_size, _ = existing_size (pack s i) in
let* c, bytes = consume_write_gas Raw_context.update (pack s i) v in
let+ c = Raw_context.update c data_name bytes in
let size_diff = Bytes.length bytes - prev_size in
(Raw_context.project c, size_diff)
let init s i v =
let open Lwt_result_syntax in
let* c, bytes = consume_write_gas Raw_context.init (pack s i) v in
let+ c = Raw_context.init c data_name bytes in
let size = Bytes.length bytes in
(Raw_context.project c, size)
let add s i v =
let open Lwt_result_syntax in
let add c k v =
let*! ctxt = Raw_context.add c k v in
return ctxt
in
let* prev_size, existed = existing_size (pack s i) in
let* c, bytes = consume_write_gas add (pack s i) v in
let+ c = add c data_name bytes in
let size_diff = Bytes.length bytes - prev_size in
(Raw_context.project c, size_diff, existed)
let remove s i =
let open Lwt_result_syntax in
let remove c k =
let*! ctxt = Raw_context.remove c k in
return ctxt
in
let* prev_size, existed = existing_size (pack s i) in
let* c = consume_remove_gas remove (pack s i) in
let+ c = remove c data_name in
(Raw_context.project c, prev_size, existed)
let remove_existing s i =
let open Lwt_result_syntax in
let* prev_size, _ = existing_size (pack s i) in
let* c = consume_remove_gas Raw_context.remove_existing (pack s i) in
let+ c = Raw_context.remove_existing c data_name in
(Raw_context.project c, prev_size)
let add_or_remove s i v =
match v with None -> remove s i | Some v -> add s i v
let mem_unaccounted s i = Raw_context.mem (pack s i) data_name
let fold_keys_unaccounted s ~order ~init ~f =
let open Lwt_syntax in
fold_keys s ~order ~init ~f:(fun i acc ->
let* result = mem_unaccounted s i in
match result with false -> return acc | true -> f i acc)
let keys_unaccounted s =
fold_keys_unaccounted s ~order:`Sorted ~init:[] ~f:(fun p acc ->
Lwt.return (p :: acc))
let () =
let open Storage_description in
let open Lwt_result_syntax in
let unpack = unpack I.args in
let description =
if R.ghost then Storage_description.create ()
else Raw_context.description
in
register_value
~get:(fun c ->
let c, k = unpack c in
let+ _, v = find c k in
v)
(register_named_subcontext description N.name)
V.encoding
end
end
module type WRAPPER = sig
type t
type key
val wrap : t -> key
val unwrap : key -> t option
end
module Wrap_indexed_data_storage
(C : Indexed_data_storage)
(K : WRAPPER with type key := C.key) :
Indexed_data_storage
with type t = C.t
and type key = K.t
and type value = C.value = struct
type t = C.t
type context = C.t
type key = K.t
type value = C.value
let is_empty ctxt = C.is_empty ctxt
let mem ctxt k = C.mem ctxt (K.wrap k)
let get ctxt k = C.get ctxt (K.wrap k)
let find ctxt k = C.find ctxt (K.wrap k)
let update ctxt k v = C.update ctxt (K.wrap k) v
let init ctxt k v = C.init ctxt (K.wrap k) v
let add ctxt k v = C.add ctxt (K.wrap k) v
let add_or_remove ctxt k v = C.add_or_remove ctxt (K.wrap k) v
let remove_existing ctxt k = C.remove_existing ctxt (K.wrap k)
let remove ctxt k = C.remove ctxt (K.wrap k)
let clear ctxt = C.clear ctxt
let fold ctxt ~order ~init ~f =
C.fold ctxt ~order ~init ~f:(fun k v acc ->
match K.unwrap k with None -> Lwt.return acc | Some k -> f k v acc)
let bindings s =
fold s ~order:`Sorted ~init:[] ~f:(fun p v acc ->
Lwt.return ((p, v) :: acc))
let fold_keys s ~order ~init ~f =
C.fold_keys s ~order ~init ~f:(fun k acc ->
match K.unwrap k with None -> Lwt.return acc | Some k -> f k acc)
let keys s =
fold_keys s ~order:`Sorted ~init:[] ~f:(fun p acc -> Lwt.return (p :: acc))
end