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
|
/* stfe.h -- generated by Trunnel v1.5.3.
* https://gitweb.torproject.org/trunnel.git
* You probably shouldn't edit this file.
*/
#ifndef TRUNNEL_STFE_H
#define TRUNNEL_STFE_H
#include <stdint.h>
#include "trunnel.h"
#define MAGIC_V1 6004501466958485041
#define T_GET_ENTRIES_V1 1
#define T_GET_PROOF_BY_HASH_V1 2
#define T_GET_CONSISTENCY_PROOF_V1 3
#define T_ENTRIES_V1 4
#define T_INCLUSION_PROOF_V1 5
#define T_CONSISTENCY_PROOF_V1 6
#define T_SIGNED_TREE_HEAD_V1 7
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_HASH)
struct hash_st {
uint8_t hash[32];
uint8_t trunnel_error_code_;
};
#endif
typedef struct hash_st hash_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_REQ_GET_CONSISTENCY_PROOF_V1)
struct req_get_consistency_proof_v1_st {
uint64_t old_size;
uint64_t new_size;
uint8_t trunnel_error_code_;
};
#endif
typedef struct req_get_consistency_proof_v1_st req_get_consistency_proof_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_REQ_GET_ENTRIES_V1)
struct req_get_entries_v1_st {
uint64_t start_size;
uint64_t end_size;
uint8_t trunnel_error_code_;
};
#endif
typedef struct req_get_entries_v1_st req_get_entries_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_REQ_GET_PROOF_BY_HASH_V1)
struct req_get_proof_by_hash_v1_st {
uint64_t tree_size;
uint8_t leaf_hash[32];
uint8_t trunnel_error_code_;
};
#endif
typedef struct req_get_proof_by_hash_v1_st req_get_proof_by_hash_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_SIGIDENT_ED25519)
struct sigident_ed25519_st {
uint8_t signature[64];
uint8_t identifier[32];
uint8_t trunnel_error_code_;
};
#endif
typedef struct sigident_ed25519_st sigident_ed25519_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_SIGNED_CHECKSUM32_ED25519)
struct signed_checksum32_ed25519_st {
uint8_t checksum[32];
uint64_t length;
TRUNNEL_DYNARRAY_HEAD(, uint8_t) identifier;
uint8_t signature[64];
uint8_t namespace[32];
uint8_t trunnel_error_code_;
};
#endif
typedef struct signed_checksum32_ed25519_st signed_checksum32_ed25519_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_CONSISTENCY_PROOF_V1)
struct consistency_proof_v1_st {
uint64_t magic;
uint64_t format;
uint8_t identifier[32];
uint64_t old_size;
uint64_t new_size;
uint64_t n_items;
TRUNNEL_DYNARRAY_HEAD(, struct hash_st *) hashes;
uint8_t trunnel_error_code_;
};
#endif
typedef struct consistency_proof_v1_st consistency_proof_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_ENTRIES_V1)
struct entries_v1_st {
uint64_t magic;
uint64_t format;
uint64_t n_items;
TRUNNEL_DYNARRAY_HEAD(, struct signed_checksum32_ed25519_st *) checksums;
uint8_t trunnel_error_code_;
};
#endif
typedef struct entries_v1_st entries_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_INCLUSION_PROOF_V1)
struct inclusion_proof_v1_st {
uint64_t magic;
uint64_t format;
uint8_t identifier[32];
uint64_t tree_size;
uint64_t leaf_index;
uint64_t n_items;
TRUNNEL_DYNARRAY_HEAD(, struct hash_st *) hashes;
uint8_t trunnel_error_code_;
};
#endif
typedef struct inclusion_proof_v1_st inclusion_proof_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_REQUEST_V1)
struct request_v1_st {
uint64_t magic;
uint64_t format;
struct req_get_entries_v1_st *request_get_entries;
struct req_get_proof_by_hash_v1_st *request_get_proof_by_hash;
struct req_get_consistency_proof_v1_st *request_get_consistency_proof;
uint8_t trunnel_error_code_;
};
#endif
typedef struct request_v1_st request_v1_t;
#if !defined(TRUNNEL_OPAQUE) && !defined(TRUNNEL_OPAQUE_SIGNED_TREE_HEAD_V1)
struct signed_tree_head_v1_st {
uint64_t magic;
uint64_t format;
uint64_t timestamp;
uint64_t tree_size;
uint8_t root_hash[32];
uint64_t n_items;
TRUNNEL_DYNARRAY_HEAD(, struct sigident_ed25519_st *) signatures;
uint8_t trunnel_error_code_;
};
#endif
typedef struct signed_tree_head_v1_st signed_tree_head_v1_t;
/** Return a newly allocated hash with all elements set to zero.
*/
hash_t *hash_new(void);
/** Release all storage held by the hash in 'victim'. (Do nothing if
* 'victim' is NULL.)
*/
void hash_free(hash_t *victim);
/** Try to parse a hash from the buffer in 'input', using up to
* 'len_in' bytes from the input buffer. On success, return the number
* of bytes consumed and set *output to the newly allocated hash_t. On
* failure, return -2 if the input appears truncated, and -1 if the
* input is otherwise invalid.
*/
ssize_t hash_parse(hash_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the hash in
* 'obj'. On failure, return a negative value. Note that this value
* may be an overestimate, and can even be an underestimate for
* certain unencodeable objects.
*/
ssize_t hash_encoded_len(const hash_t *obj);
/** Try to encode the hash from 'input' into the buffer at 'output',
* using up to 'avail' bytes of the output buffer. On success, return
* the number of bytes used. On failure, return -2 if the buffer was
* not long enough, and -1 if the input was invalid.
*/
ssize_t hash_encode(uint8_t *output, size_t avail, const hash_t *input);
/** Check whether the internal state of the hash in 'obj' is
* consistent. Return NULL if it is, and a short message if it is not.
*/
const char *hash_check(const hash_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int hash_clear_errors(hash_t *obj);
/** Return the (constant) length of the array holding the hash field
* of the hash_t in 'inp'.
*/
size_t hash_getlen_hash(const hash_t *inp);
/** Return the element at position 'idx' of the fixed array field hash
* of the hash_t in 'inp'.
*/
uint8_t hash_get_hash(hash_t *inp, size_t idx);
/** As hash_get_hash, but take and return a const pointer
*/
uint8_t hash_getconst_hash(const hash_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field hash
* of the hash_t in 'inp', so that it will hold the value 'elt'.
*/
int hash_set_hash(hash_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field hash of 'inp'.
*/
uint8_t * hash_getarray_hash(hash_t *inp);
/** As hash_get_hash, but take and return a const pointer
*/
const uint8_t * hash_getconstarray_hash(const hash_t *inp);
/** Return a newly allocated req_get_consistency_proof_v1 with all
* elements set to zero.
*/
req_get_consistency_proof_v1_t *req_get_consistency_proof_v1_new(void);
/** Release all storage held by the req_get_consistency_proof_v1 in
* 'victim'. (Do nothing if 'victim' is NULL.)
*/
void req_get_consistency_proof_v1_free(req_get_consistency_proof_v1_t *victim);
/** Try to parse a req_get_consistency_proof_v1 from the buffer in
* 'input', using up to 'len_in' bytes from the input buffer. On
* success, return the number of bytes consumed and set *output to the
* newly allocated req_get_consistency_proof_v1_t. On failure, return
* -2 if the input appears truncated, and -1 if the input is otherwise
* invalid.
*/
ssize_t req_get_consistency_proof_v1_parse(req_get_consistency_proof_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* req_get_consistency_proof_v1 in 'obj'. On failure, return a
* negative value. Note that this value may be an overestimate, and
* can even be an underestimate for certain unencodeable objects.
*/
ssize_t req_get_consistency_proof_v1_encoded_len(const req_get_consistency_proof_v1_t *obj);
/** Try to encode the req_get_consistency_proof_v1 from 'input' into
* the buffer at 'output', using up to 'avail' bytes of the output
* buffer. On success, return the number of bytes used. On failure,
* return -2 if the buffer was not long enough, and -1 if the input
* was invalid.
*/
ssize_t req_get_consistency_proof_v1_encode(uint8_t *output, size_t avail, const req_get_consistency_proof_v1_t *input);
/** Check whether the internal state of the
* req_get_consistency_proof_v1 in 'obj' is consistent. Return NULL if
* it is, and a short message if it is not.
*/
const char *req_get_consistency_proof_v1_check(const req_get_consistency_proof_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int req_get_consistency_proof_v1_clear_errors(req_get_consistency_proof_v1_t *obj);
/** Return the value of the old_size field of the
* req_get_consistency_proof_v1_t in 'inp'
*/
uint64_t req_get_consistency_proof_v1_get_old_size(const req_get_consistency_proof_v1_t *inp);
/** Set the value of the old_size field of the
* req_get_consistency_proof_v1_t in 'inp' to 'val'. Return 0 on
* success; return -1 and set the error code on 'inp' on failure.
*/
int req_get_consistency_proof_v1_set_old_size(req_get_consistency_proof_v1_t *inp, uint64_t val);
/** Return the value of the new_size field of the
* req_get_consistency_proof_v1_t in 'inp'
*/
uint64_t req_get_consistency_proof_v1_get_new_size(const req_get_consistency_proof_v1_t *inp);
/** Set the value of the new_size field of the
* req_get_consistency_proof_v1_t in 'inp' to 'val'. Return 0 on
* success; return -1 and set the error code on 'inp' on failure.
*/
int req_get_consistency_proof_v1_set_new_size(req_get_consistency_proof_v1_t *inp, uint64_t val);
/** Return a newly allocated req_get_entries_v1 with all elements set
* to zero.
*/
req_get_entries_v1_t *req_get_entries_v1_new(void);
/** Release all storage held by the req_get_entries_v1 in 'victim'.
* (Do nothing if 'victim' is NULL.)
*/
void req_get_entries_v1_free(req_get_entries_v1_t *victim);
/** Try to parse a req_get_entries_v1 from the buffer in 'input',
* using up to 'len_in' bytes from the input buffer. On success,
* return the number of bytes consumed and set *output to the newly
* allocated req_get_entries_v1_t. On failure, return -2 if the input
* appears truncated, and -1 if the input is otherwise invalid.
*/
ssize_t req_get_entries_v1_parse(req_get_entries_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* req_get_entries_v1 in 'obj'. On failure, return a negative value.
* Note that this value may be an overestimate, and can even be an
* underestimate for certain unencodeable objects.
*/
ssize_t req_get_entries_v1_encoded_len(const req_get_entries_v1_t *obj);
/** Try to encode the req_get_entries_v1 from 'input' into the buffer
* at 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t req_get_entries_v1_encode(uint8_t *output, size_t avail, const req_get_entries_v1_t *input);
/** Check whether the internal state of the req_get_entries_v1 in
* 'obj' is consistent. Return NULL if it is, and a short message if
* it is not.
*/
const char *req_get_entries_v1_check(const req_get_entries_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int req_get_entries_v1_clear_errors(req_get_entries_v1_t *obj);
/** Return the value of the start_size field of the
* req_get_entries_v1_t in 'inp'
*/
uint64_t req_get_entries_v1_get_start_size(const req_get_entries_v1_t *inp);
/** Set the value of the start_size field of the req_get_entries_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int req_get_entries_v1_set_start_size(req_get_entries_v1_t *inp, uint64_t val);
/** Return the value of the end_size field of the req_get_entries_v1_t
* in 'inp'
*/
uint64_t req_get_entries_v1_get_end_size(const req_get_entries_v1_t *inp);
/** Set the value of the end_size field of the req_get_entries_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int req_get_entries_v1_set_end_size(req_get_entries_v1_t *inp, uint64_t val);
/** Return a newly allocated req_get_proof_by_hash_v1 with all
* elements set to zero.
*/
req_get_proof_by_hash_v1_t *req_get_proof_by_hash_v1_new(void);
/** Release all storage held by the req_get_proof_by_hash_v1 in
* 'victim'. (Do nothing if 'victim' is NULL.)
*/
void req_get_proof_by_hash_v1_free(req_get_proof_by_hash_v1_t *victim);
/** Try to parse a req_get_proof_by_hash_v1 from the buffer in
* 'input', using up to 'len_in' bytes from the input buffer. On
* success, return the number of bytes consumed and set *output to the
* newly allocated req_get_proof_by_hash_v1_t. On failure, return -2
* if the input appears truncated, and -1 if the input is otherwise
* invalid.
*/
ssize_t req_get_proof_by_hash_v1_parse(req_get_proof_by_hash_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* req_get_proof_by_hash_v1 in 'obj'. On failure, return a negative
* value. Note that this value may be an overestimate, and can even be
* an underestimate for certain unencodeable objects.
*/
ssize_t req_get_proof_by_hash_v1_encoded_len(const req_get_proof_by_hash_v1_t *obj);
/** Try to encode the req_get_proof_by_hash_v1 from 'input' into the
* buffer at 'output', using up to 'avail' bytes of the output buffer.
* On success, return the number of bytes used. On failure, return -2
* if the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t req_get_proof_by_hash_v1_encode(uint8_t *output, size_t avail, const req_get_proof_by_hash_v1_t *input);
/** Check whether the internal state of the req_get_proof_by_hash_v1
* in 'obj' is consistent. Return NULL if it is, and a short message
* if it is not.
*/
const char *req_get_proof_by_hash_v1_check(const req_get_proof_by_hash_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int req_get_proof_by_hash_v1_clear_errors(req_get_proof_by_hash_v1_t *obj);
/** Return the value of the tree_size field of the
* req_get_proof_by_hash_v1_t in 'inp'
*/
uint64_t req_get_proof_by_hash_v1_get_tree_size(const req_get_proof_by_hash_v1_t *inp);
/** Set the value of the tree_size field of the
* req_get_proof_by_hash_v1_t in 'inp' to 'val'. Return 0 on success;
* return -1 and set the error code on 'inp' on failure.
*/
int req_get_proof_by_hash_v1_set_tree_size(req_get_proof_by_hash_v1_t *inp, uint64_t val);
/** Return the (constant) length of the array holding the leaf_hash
* field of the req_get_proof_by_hash_v1_t in 'inp'.
*/
size_t req_get_proof_by_hash_v1_getlen_leaf_hash(const req_get_proof_by_hash_v1_t *inp);
/** Return the element at position 'idx' of the fixed array field
* leaf_hash of the req_get_proof_by_hash_v1_t in 'inp'.
*/
uint8_t req_get_proof_by_hash_v1_get_leaf_hash(req_get_proof_by_hash_v1_t *inp, size_t idx);
/** As req_get_proof_by_hash_v1_get_leaf_hash, but take and return a
* const pointer
*/
uint8_t req_get_proof_by_hash_v1_getconst_leaf_hash(const req_get_proof_by_hash_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* leaf_hash of the req_get_proof_by_hash_v1_t in 'inp', so that it
* will hold the value 'elt'.
*/
int req_get_proof_by_hash_v1_set_leaf_hash(req_get_proof_by_hash_v1_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field leaf_hash of 'inp'.
*/
uint8_t * req_get_proof_by_hash_v1_getarray_leaf_hash(req_get_proof_by_hash_v1_t *inp);
/** As req_get_proof_by_hash_v1_get_leaf_hash, but take and return a
* const pointer
*/
const uint8_t * req_get_proof_by_hash_v1_getconstarray_leaf_hash(const req_get_proof_by_hash_v1_t *inp);
/** Return a newly allocated sigident_ed25519 with all elements set to
* zero.
*/
sigident_ed25519_t *sigident_ed25519_new(void);
/** Release all storage held by the sigident_ed25519 in 'victim'. (Do
* nothing if 'victim' is NULL.)
*/
void sigident_ed25519_free(sigident_ed25519_t *victim);
/** Try to parse a sigident_ed25519 from the buffer in 'input', using
* up to 'len_in' bytes from the input buffer. On success, return the
* number of bytes consumed and set *output to the newly allocated
* sigident_ed25519_t. On failure, return -2 if the input appears
* truncated, and -1 if the input is otherwise invalid.
*/
ssize_t sigident_ed25519_parse(sigident_ed25519_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* sigident_ed25519 in 'obj'. On failure, return a negative value.
* Note that this value may be an overestimate, and can even be an
* underestimate for certain unencodeable objects.
*/
ssize_t sigident_ed25519_encoded_len(const sigident_ed25519_t *obj);
/** Try to encode the sigident_ed25519 from 'input' into the buffer at
* 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t sigident_ed25519_encode(uint8_t *output, size_t avail, const sigident_ed25519_t *input);
/** Check whether the internal state of the sigident_ed25519 in 'obj'
* is consistent. Return NULL if it is, and a short message if it is
* not.
*/
const char *sigident_ed25519_check(const sigident_ed25519_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int sigident_ed25519_clear_errors(sigident_ed25519_t *obj);
/** Return the (constant) length of the array holding the signature
* field of the sigident_ed25519_t in 'inp'.
*/
size_t sigident_ed25519_getlen_signature(const sigident_ed25519_t *inp);
/** Return the element at position 'idx' of the fixed array field
* signature of the sigident_ed25519_t in 'inp'.
*/
uint8_t sigident_ed25519_get_signature(sigident_ed25519_t *inp, size_t idx);
/** As sigident_ed25519_get_signature, but take and return a const
* pointer
*/
uint8_t sigident_ed25519_getconst_signature(const sigident_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* signature of the sigident_ed25519_t in 'inp', so that it will hold
* the value 'elt'.
*/
int sigident_ed25519_set_signature(sigident_ed25519_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 64-element array field signature of 'inp'.
*/
uint8_t * sigident_ed25519_getarray_signature(sigident_ed25519_t *inp);
/** As sigident_ed25519_get_signature, but take and return a const
* pointer
*/
const uint8_t * sigident_ed25519_getconstarray_signature(const sigident_ed25519_t *inp);
/** Return the (constant) length of the array holding the identifier
* field of the sigident_ed25519_t in 'inp'.
*/
size_t sigident_ed25519_getlen_identifier(const sigident_ed25519_t *inp);
/** Return the element at position 'idx' of the fixed array field
* identifier of the sigident_ed25519_t in 'inp'.
*/
uint8_t sigident_ed25519_get_identifier(sigident_ed25519_t *inp, size_t idx);
/** As sigident_ed25519_get_identifier, but take and return a const
* pointer
*/
uint8_t sigident_ed25519_getconst_identifier(const sigident_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* identifier of the sigident_ed25519_t in 'inp', so that it will hold
* the value 'elt'.
*/
int sigident_ed25519_set_identifier(sigident_ed25519_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field identifier of
* 'inp'.
*/
uint8_t * sigident_ed25519_getarray_identifier(sigident_ed25519_t *inp);
/** As sigident_ed25519_get_identifier, but take and return a const
* pointer
*/
const uint8_t * sigident_ed25519_getconstarray_identifier(const sigident_ed25519_t *inp);
/** Return a newly allocated signed_checksum32_ed25519 with all
* elements set to zero.
*/
signed_checksum32_ed25519_t *signed_checksum32_ed25519_new(void);
/** Release all storage held by the signed_checksum32_ed25519 in
* 'victim'. (Do nothing if 'victim' is NULL.)
*/
void signed_checksum32_ed25519_free(signed_checksum32_ed25519_t *victim);
/** Try to parse a signed_checksum32_ed25519 from the buffer in
* 'input', using up to 'len_in' bytes from the input buffer. On
* success, return the number of bytes consumed and set *output to the
* newly allocated signed_checksum32_ed25519_t. On failure, return -2
* if the input appears truncated, and -1 if the input is otherwise
* invalid.
*/
ssize_t signed_checksum32_ed25519_parse(signed_checksum32_ed25519_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* signed_checksum32_ed25519 in 'obj'. On failure, return a negative
* value. Note that this value may be an overestimate, and can even be
* an underestimate for certain unencodeable objects.
*/
ssize_t signed_checksum32_ed25519_encoded_len(const signed_checksum32_ed25519_t *obj);
/** Try to encode the signed_checksum32_ed25519 from 'input' into the
* buffer at 'output', using up to 'avail' bytes of the output buffer.
* On success, return the number of bytes used. On failure, return -2
* if the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t signed_checksum32_ed25519_encode(uint8_t *output, size_t avail, const signed_checksum32_ed25519_t *input);
/** Check whether the internal state of the signed_checksum32_ed25519
* in 'obj' is consistent. Return NULL if it is, and a short message
* if it is not.
*/
const char *signed_checksum32_ed25519_check(const signed_checksum32_ed25519_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int signed_checksum32_ed25519_clear_errors(signed_checksum32_ed25519_t *obj);
/** Return the (constant) length of the array holding the checksum
* field of the signed_checksum32_ed25519_t in 'inp'.
*/
size_t signed_checksum32_ed25519_getlen_checksum(const signed_checksum32_ed25519_t *inp);
/** Return the element at position 'idx' of the fixed array field
* checksum of the signed_checksum32_ed25519_t in 'inp'.
*/
uint8_t signed_checksum32_ed25519_get_checksum(signed_checksum32_ed25519_t *inp, size_t idx);
/** As signed_checksum32_ed25519_get_checksum, but take and return a
* const pointer
*/
uint8_t signed_checksum32_ed25519_getconst_checksum(const signed_checksum32_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* checksum of the signed_checksum32_ed25519_t in 'inp', so that it
* will hold the value 'elt'.
*/
int signed_checksum32_ed25519_set_checksum(signed_checksum32_ed25519_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field checksum of 'inp'.
*/
uint8_t * signed_checksum32_ed25519_getarray_checksum(signed_checksum32_ed25519_t *inp);
/** As signed_checksum32_ed25519_get_checksum, but take and return a
* const pointer
*/
const uint8_t * signed_checksum32_ed25519_getconstarray_checksum(const signed_checksum32_ed25519_t *inp);
/** Return the value of the length field of the
* signed_checksum32_ed25519_t in 'inp'
*/
uint64_t signed_checksum32_ed25519_get_length(const signed_checksum32_ed25519_t *inp);
/** Set the value of the length field of the
* signed_checksum32_ed25519_t in 'inp' to 'val'. Return 0 on success;
* return -1 and set the error code on 'inp' on failure.
*/
int signed_checksum32_ed25519_set_length(signed_checksum32_ed25519_t *inp, uint64_t val);
/** Return the length of the dynamic array holding the identifier
* field of the signed_checksum32_ed25519_t in 'inp'.
*/
size_t signed_checksum32_ed25519_getlen_identifier(const signed_checksum32_ed25519_t *inp);
/** Return the element at position 'idx' of the dynamic array field
* identifier of the signed_checksum32_ed25519_t in 'inp'.
*/
uint8_t signed_checksum32_ed25519_get_identifier(signed_checksum32_ed25519_t *inp, size_t idx);
/** As signed_checksum32_ed25519_get_identifier, but take and return a
* const pointer
*/
uint8_t signed_checksum32_ed25519_getconst_identifier(const signed_checksum32_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the dynamic array field
* identifier of the signed_checksum32_ed25519_t in 'inp', so that it
* will hold the value 'elt'.
*/
int signed_checksum32_ed25519_set_identifier(signed_checksum32_ed25519_t *inp, size_t idx, uint8_t elt);
/** Append a new element 'elt' to the dynamic array field identifier
* of the signed_checksum32_ed25519_t in 'inp'.
*/
int signed_checksum32_ed25519_add_identifier(signed_checksum32_ed25519_t *inp, uint8_t elt);
/** Return a pointer to the variable-length array field identifier of
* 'inp'.
*/
uint8_t * signed_checksum32_ed25519_getarray_identifier(signed_checksum32_ed25519_t *inp);
/** As signed_checksum32_ed25519_get_identifier, but take and return a
* const pointer
*/
const uint8_t * signed_checksum32_ed25519_getconstarray_identifier(const signed_checksum32_ed25519_t *inp);
/** Change the length of the variable-length array field identifier of
* 'inp' to 'newlen'.Fill extra elements with 0. Return 0 on success;
* return -1 and set the error code on 'inp' on failure.
*/
int signed_checksum32_ed25519_setlen_identifier(signed_checksum32_ed25519_t *inp, size_t newlen);
/** Return the (constant) length of the array holding the signature
* field of the signed_checksum32_ed25519_t in 'inp'.
*/
size_t signed_checksum32_ed25519_getlen_signature(const signed_checksum32_ed25519_t *inp);
/** Return the element at position 'idx' of the fixed array field
* signature of the signed_checksum32_ed25519_t in 'inp'.
*/
uint8_t signed_checksum32_ed25519_get_signature(signed_checksum32_ed25519_t *inp, size_t idx);
/** As signed_checksum32_ed25519_get_signature, but take and return a
* const pointer
*/
uint8_t signed_checksum32_ed25519_getconst_signature(const signed_checksum32_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* signature of the signed_checksum32_ed25519_t in 'inp', so that it
* will hold the value 'elt'.
*/
int signed_checksum32_ed25519_set_signature(signed_checksum32_ed25519_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 64-element array field signature of 'inp'.
*/
uint8_t * signed_checksum32_ed25519_getarray_signature(signed_checksum32_ed25519_t *inp);
/** As signed_checksum32_ed25519_get_signature, but take and return a
* const pointer
*/
const uint8_t * signed_checksum32_ed25519_getconstarray_signature(const signed_checksum32_ed25519_t *inp);
/** Return the (constant) length of the array holding the namespace
* field of the signed_checksum32_ed25519_t in 'inp'.
*/
size_t signed_checksum32_ed25519_getlen_namespace(const signed_checksum32_ed25519_t *inp);
/** Return the element at position 'idx' of the fixed array field
* namespace of the signed_checksum32_ed25519_t in 'inp'.
*/
uint8_t signed_checksum32_ed25519_get_namespace(signed_checksum32_ed25519_t *inp, size_t idx);
/** As signed_checksum32_ed25519_get_namespace, but take and return a
* const pointer
*/
uint8_t signed_checksum32_ed25519_getconst_namespace(const signed_checksum32_ed25519_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* namespace of the signed_checksum32_ed25519_t in 'inp', so that it
* will hold the value 'elt'.
*/
int signed_checksum32_ed25519_set_namespace(signed_checksum32_ed25519_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field namespace of 'inp'.
*/
uint8_t * signed_checksum32_ed25519_getarray_namespace(signed_checksum32_ed25519_t *inp);
/** As signed_checksum32_ed25519_get_namespace, but take and return a
* const pointer
*/
const uint8_t * signed_checksum32_ed25519_getconstarray_namespace(const signed_checksum32_ed25519_t *inp);
/** Return a newly allocated consistency_proof_v1 with all elements
* set to zero.
*/
consistency_proof_v1_t *consistency_proof_v1_new(void);
/** Release all storage held by the consistency_proof_v1 in 'victim'.
* (Do nothing if 'victim' is NULL.)
*/
void consistency_proof_v1_free(consistency_proof_v1_t *victim);
/** Try to parse a consistency_proof_v1 from the buffer in 'input',
* using up to 'len_in' bytes from the input buffer. On success,
* return the number of bytes consumed and set *output to the newly
* allocated consistency_proof_v1_t. On failure, return -2 if the
* input appears truncated, and -1 if the input is otherwise invalid.
*/
ssize_t consistency_proof_v1_parse(consistency_proof_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* consistency_proof_v1 in 'obj'. On failure, return a negative value.
* Note that this value may be an overestimate, and can even be an
* underestimate for certain unencodeable objects.
*/
ssize_t consistency_proof_v1_encoded_len(const consistency_proof_v1_t *obj);
/** Try to encode the consistency_proof_v1 from 'input' into the
* buffer at 'output', using up to 'avail' bytes of the output buffer.
* On success, return the number of bytes used. On failure, return -2
* if the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t consistency_proof_v1_encode(uint8_t *output, size_t avail, const consistency_proof_v1_t *input);
/** Check whether the internal state of the consistency_proof_v1 in
* 'obj' is consistent. Return NULL if it is, and a short message if
* it is not.
*/
const char *consistency_proof_v1_check(const consistency_proof_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int consistency_proof_v1_clear_errors(consistency_proof_v1_t *obj);
/** Return the value of the magic field of the consistency_proof_v1_t
* in 'inp'
*/
uint64_t consistency_proof_v1_get_magic(const consistency_proof_v1_t *inp);
/** Set the value of the magic field of the consistency_proof_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int consistency_proof_v1_set_magic(consistency_proof_v1_t *inp, uint64_t val);
/** Return the value of the format field of the consistency_proof_v1_t
* in 'inp'
*/
uint64_t consistency_proof_v1_get_format(const consistency_proof_v1_t *inp);
/** Set the value of the format field of the consistency_proof_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int consistency_proof_v1_set_format(consistency_proof_v1_t *inp, uint64_t val);
/** Return the (constant) length of the array holding the identifier
* field of the consistency_proof_v1_t in 'inp'.
*/
size_t consistency_proof_v1_getlen_identifier(const consistency_proof_v1_t *inp);
/** Return the element at position 'idx' of the fixed array field
* identifier of the consistency_proof_v1_t in 'inp'.
*/
uint8_t consistency_proof_v1_get_identifier(consistency_proof_v1_t *inp, size_t idx);
/** As consistency_proof_v1_get_identifier, but take and return a
* const pointer
*/
uint8_t consistency_proof_v1_getconst_identifier(const consistency_proof_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* identifier of the consistency_proof_v1_t in 'inp', so that it will
* hold the value 'elt'.
*/
int consistency_proof_v1_set_identifier(consistency_proof_v1_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field identifier of
* 'inp'.
*/
uint8_t * consistency_proof_v1_getarray_identifier(consistency_proof_v1_t *inp);
/** As consistency_proof_v1_get_identifier, but take and return a
* const pointer
*/
const uint8_t * consistency_proof_v1_getconstarray_identifier(const consistency_proof_v1_t *inp);
/** Return the value of the old_size field of the
* consistency_proof_v1_t in 'inp'
*/
uint64_t consistency_proof_v1_get_old_size(const consistency_proof_v1_t *inp);
/** Set the value of the old_size field of the consistency_proof_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int consistency_proof_v1_set_old_size(consistency_proof_v1_t *inp, uint64_t val);
/** Return the value of the new_size field of the
* consistency_proof_v1_t in 'inp'
*/
uint64_t consistency_proof_v1_get_new_size(const consistency_proof_v1_t *inp);
/** Set the value of the new_size field of the consistency_proof_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int consistency_proof_v1_set_new_size(consistency_proof_v1_t *inp, uint64_t val);
/** Return the value of the n_items field of the
* consistency_proof_v1_t in 'inp'
*/
uint64_t consistency_proof_v1_get_n_items(const consistency_proof_v1_t *inp);
/** Set the value of the n_items field of the consistency_proof_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int consistency_proof_v1_set_n_items(consistency_proof_v1_t *inp, uint64_t val);
/** Return the length of the dynamic array holding the hashes field of
* the consistency_proof_v1_t in 'inp'.
*/
size_t consistency_proof_v1_getlen_hashes(const consistency_proof_v1_t *inp);
/** Return the element at position 'idx' of the dynamic array field
* hashes of the consistency_proof_v1_t in 'inp'.
*/
struct hash_st * consistency_proof_v1_get_hashes(consistency_proof_v1_t *inp, size_t idx);
/** As consistency_proof_v1_get_hashes, but take and return a const
* pointer
*/
const struct hash_st * consistency_proof_v1_getconst_hashes(const consistency_proof_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the dynamic array field
* hashes of the consistency_proof_v1_t in 'inp', so that it will hold
* the value 'elt'. Free the previous value, if any.
*/
int consistency_proof_v1_set_hashes(consistency_proof_v1_t *inp, size_t idx, struct hash_st * elt);
/** As consistency_proof_v1_set_hashes, but does not free the previous
* value.
*/
int consistency_proof_v1_set0_hashes(consistency_proof_v1_t *inp, size_t idx, struct hash_st * elt);
/** Append a new element 'elt' to the dynamic array field hashes of
* the consistency_proof_v1_t in 'inp'.
*/
int consistency_proof_v1_add_hashes(consistency_proof_v1_t *inp, struct hash_st * elt);
/** Return a pointer to the variable-length array field hashes of
* 'inp'.
*/
struct hash_st * * consistency_proof_v1_getarray_hashes(consistency_proof_v1_t *inp);
/** As consistency_proof_v1_get_hashes, but take and return a const
* pointer
*/
const struct hash_st * const * consistency_proof_v1_getconstarray_hashes(const consistency_proof_v1_t *inp);
/** Change the length of the variable-length array field hashes of
* 'inp' to 'newlen'.Fill extra elements with NULL; free removed
* elements. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int consistency_proof_v1_setlen_hashes(consistency_proof_v1_t *inp, size_t newlen);
/** Return a newly allocated entries_v1 with all elements set to zero.
*/
entries_v1_t *entries_v1_new(void);
/** Release all storage held by the entries_v1 in 'victim'. (Do
* nothing if 'victim' is NULL.)
*/
void entries_v1_free(entries_v1_t *victim);
/** Try to parse a entries_v1 from the buffer in 'input', using up to
* 'len_in' bytes from the input buffer. On success, return the number
* of bytes consumed and set *output to the newly allocated
* entries_v1_t. On failure, return -2 if the input appears truncated,
* and -1 if the input is otherwise invalid.
*/
ssize_t entries_v1_parse(entries_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* entries_v1 in 'obj'. On failure, return a negative value. Note that
* this value may be an overestimate, and can even be an underestimate
* for certain unencodeable objects.
*/
ssize_t entries_v1_encoded_len(const entries_v1_t *obj);
/** Try to encode the entries_v1 from 'input' into the buffer at
* 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t entries_v1_encode(uint8_t *output, size_t avail, const entries_v1_t *input);
/** Check whether the internal state of the entries_v1 in 'obj' is
* consistent. Return NULL if it is, and a short message if it is not.
*/
const char *entries_v1_check(const entries_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int entries_v1_clear_errors(entries_v1_t *obj);
/** Return the value of the magic field of the entries_v1_t in 'inp'
*/
uint64_t entries_v1_get_magic(const entries_v1_t *inp);
/** Set the value of the magic field of the entries_v1_t in 'inp' to
* 'val'. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int entries_v1_set_magic(entries_v1_t *inp, uint64_t val);
/** Return the value of the format field of the entries_v1_t in 'inp'
*/
uint64_t entries_v1_get_format(const entries_v1_t *inp);
/** Set the value of the format field of the entries_v1_t in 'inp' to
* 'val'. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int entries_v1_set_format(entries_v1_t *inp, uint64_t val);
/** Return the value of the n_items field of the entries_v1_t in 'inp'
*/
uint64_t entries_v1_get_n_items(const entries_v1_t *inp);
/** Set the value of the n_items field of the entries_v1_t in 'inp' to
* 'val'. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int entries_v1_set_n_items(entries_v1_t *inp, uint64_t val);
/** Return the length of the dynamic array holding the checksums field
* of the entries_v1_t in 'inp'.
*/
size_t entries_v1_getlen_checksums(const entries_v1_t *inp);
/** Return the element at position 'idx' of the dynamic array field
* checksums of the entries_v1_t in 'inp'.
*/
struct signed_checksum32_ed25519_st * entries_v1_get_checksums(entries_v1_t *inp, size_t idx);
/** As entries_v1_get_checksums, but take and return a const pointer
*/
const struct signed_checksum32_ed25519_st * entries_v1_getconst_checksums(const entries_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the dynamic array field
* checksums of the entries_v1_t in 'inp', so that it will hold the
* value 'elt'. Free the previous value, if any.
*/
int entries_v1_set_checksums(entries_v1_t *inp, size_t idx, struct signed_checksum32_ed25519_st * elt);
/** As entries_v1_set_checksums, but does not free the previous value.
*/
int entries_v1_set0_checksums(entries_v1_t *inp, size_t idx, struct signed_checksum32_ed25519_st * elt);
/** Append a new element 'elt' to the dynamic array field checksums of
* the entries_v1_t in 'inp'.
*/
int entries_v1_add_checksums(entries_v1_t *inp, struct signed_checksum32_ed25519_st * elt);
/** Return a pointer to the variable-length array field checksums of
* 'inp'.
*/
struct signed_checksum32_ed25519_st * * entries_v1_getarray_checksums(entries_v1_t *inp);
/** As entries_v1_get_checksums, but take and return a const pointer
*/
const struct signed_checksum32_ed25519_st * const * entries_v1_getconstarray_checksums(const entries_v1_t *inp);
/** Change the length of the variable-length array field checksums of
* 'inp' to 'newlen'.Fill extra elements with NULL; free removed
* elements. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int entries_v1_setlen_checksums(entries_v1_t *inp, size_t newlen);
/** Return a newly allocated inclusion_proof_v1 with all elements set
* to zero.
*/
inclusion_proof_v1_t *inclusion_proof_v1_new(void);
/** Release all storage held by the inclusion_proof_v1 in 'victim'.
* (Do nothing if 'victim' is NULL.)
*/
void inclusion_proof_v1_free(inclusion_proof_v1_t *victim);
/** Try to parse a inclusion_proof_v1 from the buffer in 'input',
* using up to 'len_in' bytes from the input buffer. On success,
* return the number of bytes consumed and set *output to the newly
* allocated inclusion_proof_v1_t. On failure, return -2 if the input
* appears truncated, and -1 if the input is otherwise invalid.
*/
ssize_t inclusion_proof_v1_parse(inclusion_proof_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* inclusion_proof_v1 in 'obj'. On failure, return a negative value.
* Note that this value may be an overestimate, and can even be an
* underestimate for certain unencodeable objects.
*/
ssize_t inclusion_proof_v1_encoded_len(const inclusion_proof_v1_t *obj);
/** Try to encode the inclusion_proof_v1 from 'input' into the buffer
* at 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t inclusion_proof_v1_encode(uint8_t *output, size_t avail, const inclusion_proof_v1_t *input);
/** Check whether the internal state of the inclusion_proof_v1 in
* 'obj' is consistent. Return NULL if it is, and a short message if
* it is not.
*/
const char *inclusion_proof_v1_check(const inclusion_proof_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int inclusion_proof_v1_clear_errors(inclusion_proof_v1_t *obj);
/** Return the value of the magic field of the inclusion_proof_v1_t in
* 'inp'
*/
uint64_t inclusion_proof_v1_get_magic(const inclusion_proof_v1_t *inp);
/** Set the value of the magic field of the inclusion_proof_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int inclusion_proof_v1_set_magic(inclusion_proof_v1_t *inp, uint64_t val);
/** Return the value of the format field of the inclusion_proof_v1_t
* in 'inp'
*/
uint64_t inclusion_proof_v1_get_format(const inclusion_proof_v1_t *inp);
/** Set the value of the format field of the inclusion_proof_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int inclusion_proof_v1_set_format(inclusion_proof_v1_t *inp, uint64_t val);
/** Return the (constant) length of the array holding the identifier
* field of the inclusion_proof_v1_t in 'inp'.
*/
size_t inclusion_proof_v1_getlen_identifier(const inclusion_proof_v1_t *inp);
/** Return the element at position 'idx' of the fixed array field
* identifier of the inclusion_proof_v1_t in 'inp'.
*/
uint8_t inclusion_proof_v1_get_identifier(inclusion_proof_v1_t *inp, size_t idx);
/** As inclusion_proof_v1_get_identifier, but take and return a const
* pointer
*/
uint8_t inclusion_proof_v1_getconst_identifier(const inclusion_proof_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* identifier of the inclusion_proof_v1_t in 'inp', so that it will
* hold the value 'elt'.
*/
int inclusion_proof_v1_set_identifier(inclusion_proof_v1_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field identifier of
* 'inp'.
*/
uint8_t * inclusion_proof_v1_getarray_identifier(inclusion_proof_v1_t *inp);
/** As inclusion_proof_v1_get_identifier, but take and return a const
* pointer
*/
const uint8_t * inclusion_proof_v1_getconstarray_identifier(const inclusion_proof_v1_t *inp);
/** Return the value of the tree_size field of the
* inclusion_proof_v1_t in 'inp'
*/
uint64_t inclusion_proof_v1_get_tree_size(const inclusion_proof_v1_t *inp);
/** Set the value of the tree_size field of the inclusion_proof_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int inclusion_proof_v1_set_tree_size(inclusion_proof_v1_t *inp, uint64_t val);
/** Return the value of the leaf_index field of the
* inclusion_proof_v1_t in 'inp'
*/
uint64_t inclusion_proof_v1_get_leaf_index(const inclusion_proof_v1_t *inp);
/** Set the value of the leaf_index field of the inclusion_proof_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int inclusion_proof_v1_set_leaf_index(inclusion_proof_v1_t *inp, uint64_t val);
/** Return the value of the n_items field of the inclusion_proof_v1_t
* in 'inp'
*/
uint64_t inclusion_proof_v1_get_n_items(const inclusion_proof_v1_t *inp);
/** Set the value of the n_items field of the inclusion_proof_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int inclusion_proof_v1_set_n_items(inclusion_proof_v1_t *inp, uint64_t val);
/** Return the length of the dynamic array holding the hashes field of
* the inclusion_proof_v1_t in 'inp'.
*/
size_t inclusion_proof_v1_getlen_hashes(const inclusion_proof_v1_t *inp);
/** Return the element at position 'idx' of the dynamic array field
* hashes of the inclusion_proof_v1_t in 'inp'.
*/
struct hash_st * inclusion_proof_v1_get_hashes(inclusion_proof_v1_t *inp, size_t idx);
/** As inclusion_proof_v1_get_hashes, but take and return a const
* pointer
*/
const struct hash_st * inclusion_proof_v1_getconst_hashes(const inclusion_proof_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the dynamic array field
* hashes of the inclusion_proof_v1_t in 'inp', so that it will hold
* the value 'elt'. Free the previous value, if any.
*/
int inclusion_proof_v1_set_hashes(inclusion_proof_v1_t *inp, size_t idx, struct hash_st * elt);
/** As inclusion_proof_v1_set_hashes, but does not free the previous
* value.
*/
int inclusion_proof_v1_set0_hashes(inclusion_proof_v1_t *inp, size_t idx, struct hash_st * elt);
/** Append a new element 'elt' to the dynamic array field hashes of
* the inclusion_proof_v1_t in 'inp'.
*/
int inclusion_proof_v1_add_hashes(inclusion_proof_v1_t *inp, struct hash_st * elt);
/** Return a pointer to the variable-length array field hashes of
* 'inp'.
*/
struct hash_st * * inclusion_proof_v1_getarray_hashes(inclusion_proof_v1_t *inp);
/** As inclusion_proof_v1_get_hashes, but take and return a const
* pointer
*/
const struct hash_st * const * inclusion_proof_v1_getconstarray_hashes(const inclusion_proof_v1_t *inp);
/** Change the length of the variable-length array field hashes of
* 'inp' to 'newlen'.Fill extra elements with NULL; free removed
* elements. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int inclusion_proof_v1_setlen_hashes(inclusion_proof_v1_t *inp, size_t newlen);
/** Return a newly allocated request_v1 with all elements set to zero.
*/
request_v1_t *request_v1_new(void);
/** Release all storage held by the request_v1 in 'victim'. (Do
* nothing if 'victim' is NULL.)
*/
void request_v1_free(request_v1_t *victim);
/** Try to parse a request_v1 from the buffer in 'input', using up to
* 'len_in' bytes from the input buffer. On success, return the number
* of bytes consumed and set *output to the newly allocated
* request_v1_t. On failure, return -2 if the input appears truncated,
* and -1 if the input is otherwise invalid.
*/
ssize_t request_v1_parse(request_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* request_v1 in 'obj'. On failure, return a negative value. Note that
* this value may be an overestimate, and can even be an underestimate
* for certain unencodeable objects.
*/
ssize_t request_v1_encoded_len(const request_v1_t *obj);
/** Try to encode the request_v1 from 'input' into the buffer at
* 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t request_v1_encode(uint8_t *output, size_t avail, const request_v1_t *input);
/** Check whether the internal state of the request_v1 in 'obj' is
* consistent. Return NULL if it is, and a short message if it is not.
*/
const char *request_v1_check(const request_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int request_v1_clear_errors(request_v1_t *obj);
/** Return the value of the magic field of the request_v1_t in 'inp'
*/
uint64_t request_v1_get_magic(const request_v1_t *inp);
/** Set the value of the magic field of the request_v1_t in 'inp' to
* 'val'. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int request_v1_set_magic(request_v1_t *inp, uint64_t val);
/** Return the value of the format field of the request_v1_t in 'inp'
*/
uint64_t request_v1_get_format(const request_v1_t *inp);
/** Set the value of the format field of the request_v1_t in 'inp' to
* 'val'. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int request_v1_set_format(request_v1_t *inp, uint64_t val);
/** Return the value of the request_get_entries field of the
* request_v1_t in 'inp'
*/
struct req_get_entries_v1_st * request_v1_get_request_get_entries(request_v1_t *inp);
/** As request_v1_get_request_get_entries, but take and return a const
* pointer
*/
const struct req_get_entries_v1_st * request_v1_getconst_request_get_entries(const request_v1_t *inp);
/** Set the value of the request_get_entries field of the request_v1_t
* in 'inp' to 'val'. Free the old value if any. Steals the
* referenceto 'val'.Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int request_v1_set_request_get_entries(request_v1_t *inp, struct req_get_entries_v1_st *val);
/** As request_v1_set_request_get_entries, but does not free the
* previous value.
*/
int request_v1_set0_request_get_entries(request_v1_t *inp, struct req_get_entries_v1_st *val);
/** Return the value of the request_get_proof_by_hash field of the
* request_v1_t in 'inp'
*/
struct req_get_proof_by_hash_v1_st * request_v1_get_request_get_proof_by_hash(request_v1_t *inp);
/** As request_v1_get_request_get_proof_by_hash, but take and return a
* const pointer
*/
const struct req_get_proof_by_hash_v1_st * request_v1_getconst_request_get_proof_by_hash(const request_v1_t *inp);
/** Set the value of the request_get_proof_by_hash field of the
* request_v1_t in 'inp' to 'val'. Free the old value if any. Steals
* the referenceto 'val'.Return 0 on success; return -1 and set the
* error code on 'inp' on failure.
*/
int request_v1_set_request_get_proof_by_hash(request_v1_t *inp, struct req_get_proof_by_hash_v1_st *val);
/** As request_v1_set_request_get_proof_by_hash, but does not free the
* previous value.
*/
int request_v1_set0_request_get_proof_by_hash(request_v1_t *inp, struct req_get_proof_by_hash_v1_st *val);
/** Return the value of the request_get_consistency_proof field of the
* request_v1_t in 'inp'
*/
struct req_get_consistency_proof_v1_st * request_v1_get_request_get_consistency_proof(request_v1_t *inp);
/** As request_v1_get_request_get_consistency_proof, but take and
* return a const pointer
*/
const struct req_get_consistency_proof_v1_st * request_v1_getconst_request_get_consistency_proof(const request_v1_t *inp);
/** Set the value of the request_get_consistency_proof field of the
* request_v1_t in 'inp' to 'val'. Free the old value if any. Steals
* the referenceto 'val'.Return 0 on success; return -1 and set the
* error code on 'inp' on failure.
*/
int request_v1_set_request_get_consistency_proof(request_v1_t *inp, struct req_get_consistency_proof_v1_st *val);
/** As request_v1_set_request_get_consistency_proof, but does not free
* the previous value.
*/
int request_v1_set0_request_get_consistency_proof(request_v1_t *inp, struct req_get_consistency_proof_v1_st *val);
/** Return a newly allocated signed_tree_head_v1 with all elements set
* to zero.
*/
signed_tree_head_v1_t *signed_tree_head_v1_new(void);
/** Release all storage held by the signed_tree_head_v1 in 'victim'.
* (Do nothing if 'victim' is NULL.)
*/
void signed_tree_head_v1_free(signed_tree_head_v1_t *victim);
/** Try to parse a signed_tree_head_v1 from the buffer in 'input',
* using up to 'len_in' bytes from the input buffer. On success,
* return the number of bytes consumed and set *output to the newly
* allocated signed_tree_head_v1_t. On failure, return -2 if the input
* appears truncated, and -1 if the input is otherwise invalid.
*/
ssize_t signed_tree_head_v1_parse(signed_tree_head_v1_t **output, const uint8_t *input, const size_t len_in);
/** Return the number of bytes we expect to need to encode the
* signed_tree_head_v1 in 'obj'. On failure, return a negative value.
* Note that this value may be an overestimate, and can even be an
* underestimate for certain unencodeable objects.
*/
ssize_t signed_tree_head_v1_encoded_len(const signed_tree_head_v1_t *obj);
/** Try to encode the signed_tree_head_v1 from 'input' into the buffer
* at 'output', using up to 'avail' bytes of the output buffer. On
* success, return the number of bytes used. On failure, return -2 if
* the buffer was not long enough, and -1 if the input was invalid.
*/
ssize_t signed_tree_head_v1_encode(uint8_t *output, size_t avail, const signed_tree_head_v1_t *input);
/** Check whether the internal state of the signed_tree_head_v1 in
* 'obj' is consistent. Return NULL if it is, and a short message if
* it is not.
*/
const char *signed_tree_head_v1_check(const signed_tree_head_v1_t *obj);
/** Clear any errors that were set on the object 'obj' by its setter
* functions. Return true iff errors were cleared.
*/
int signed_tree_head_v1_clear_errors(signed_tree_head_v1_t *obj);
/** Return the value of the magic field of the signed_tree_head_v1_t
* in 'inp'
*/
uint64_t signed_tree_head_v1_get_magic(const signed_tree_head_v1_t *inp);
/** Set the value of the magic field of the signed_tree_head_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int signed_tree_head_v1_set_magic(signed_tree_head_v1_t *inp, uint64_t val);
/** Return the value of the format field of the signed_tree_head_v1_t
* in 'inp'
*/
uint64_t signed_tree_head_v1_get_format(const signed_tree_head_v1_t *inp);
/** Set the value of the format field of the signed_tree_head_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int signed_tree_head_v1_set_format(signed_tree_head_v1_t *inp, uint64_t val);
/** Return the value of the timestamp field of the
* signed_tree_head_v1_t in 'inp'
*/
uint64_t signed_tree_head_v1_get_timestamp(const signed_tree_head_v1_t *inp);
/** Set the value of the timestamp field of the signed_tree_head_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int signed_tree_head_v1_set_timestamp(signed_tree_head_v1_t *inp, uint64_t val);
/** Return the value of the tree_size field of the
* signed_tree_head_v1_t in 'inp'
*/
uint64_t signed_tree_head_v1_get_tree_size(const signed_tree_head_v1_t *inp);
/** Set the value of the tree_size field of the signed_tree_head_v1_t
* in 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int signed_tree_head_v1_set_tree_size(signed_tree_head_v1_t *inp, uint64_t val);
/** Return the (constant) length of the array holding the root_hash
* field of the signed_tree_head_v1_t in 'inp'.
*/
size_t signed_tree_head_v1_getlen_root_hash(const signed_tree_head_v1_t *inp);
/** Return the element at position 'idx' of the fixed array field
* root_hash of the signed_tree_head_v1_t in 'inp'.
*/
uint8_t signed_tree_head_v1_get_root_hash(signed_tree_head_v1_t *inp, size_t idx);
/** As signed_tree_head_v1_get_root_hash, but take and return a const
* pointer
*/
uint8_t signed_tree_head_v1_getconst_root_hash(const signed_tree_head_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the fixed array field
* root_hash of the signed_tree_head_v1_t in 'inp', so that it will
* hold the value 'elt'.
*/
int signed_tree_head_v1_set_root_hash(signed_tree_head_v1_t *inp, size_t idx, uint8_t elt);
/** Return a pointer to the 32-element array field root_hash of 'inp'.
*/
uint8_t * signed_tree_head_v1_getarray_root_hash(signed_tree_head_v1_t *inp);
/** As signed_tree_head_v1_get_root_hash, but take and return a const
* pointer
*/
const uint8_t * signed_tree_head_v1_getconstarray_root_hash(const signed_tree_head_v1_t *inp);
/** Return the value of the n_items field of the signed_tree_head_v1_t
* in 'inp'
*/
uint64_t signed_tree_head_v1_get_n_items(const signed_tree_head_v1_t *inp);
/** Set the value of the n_items field of the signed_tree_head_v1_t in
* 'inp' to 'val'. Return 0 on success; return -1 and set the error
* code on 'inp' on failure.
*/
int signed_tree_head_v1_set_n_items(signed_tree_head_v1_t *inp, uint64_t val);
/** Return the length of the dynamic array holding the signatures
* field of the signed_tree_head_v1_t in 'inp'.
*/
size_t signed_tree_head_v1_getlen_signatures(const signed_tree_head_v1_t *inp);
/** Return the element at position 'idx' of the dynamic array field
* signatures of the signed_tree_head_v1_t in 'inp'.
*/
struct sigident_ed25519_st * signed_tree_head_v1_get_signatures(signed_tree_head_v1_t *inp, size_t idx);
/** As signed_tree_head_v1_get_signatures, but take and return a const
* pointer
*/
const struct sigident_ed25519_st * signed_tree_head_v1_getconst_signatures(const signed_tree_head_v1_t *inp, size_t idx);
/** Change the element at position 'idx' of the dynamic array field
* signatures of the signed_tree_head_v1_t in 'inp', so that it will
* hold the value 'elt'. Free the previous value, if any.
*/
int signed_tree_head_v1_set_signatures(signed_tree_head_v1_t *inp, size_t idx, struct sigident_ed25519_st * elt);
/** As signed_tree_head_v1_set_signatures, but does not free the
* previous value.
*/
int signed_tree_head_v1_set0_signatures(signed_tree_head_v1_t *inp, size_t idx, struct sigident_ed25519_st * elt);
/** Append a new element 'elt' to the dynamic array field signatures
* of the signed_tree_head_v1_t in 'inp'.
*/
int signed_tree_head_v1_add_signatures(signed_tree_head_v1_t *inp, struct sigident_ed25519_st * elt);
/** Return a pointer to the variable-length array field signatures of
* 'inp'.
*/
struct sigident_ed25519_st * * signed_tree_head_v1_getarray_signatures(signed_tree_head_v1_t *inp);
/** As signed_tree_head_v1_get_signatures, but take and return a const
* pointer
*/
const struct sigident_ed25519_st * const * signed_tree_head_v1_getconstarray_signatures(const signed_tree_head_v1_t *inp);
/** Change the length of the variable-length array field signatures of
* 'inp' to 'newlen'.Fill extra elements with NULL; free removed
* elements. Return 0 on success; return -1 and set the error code on
* 'inp' on failure.
*/
int signed_tree_head_v1_setlen_signatures(signed_tree_head_v1_t *inp, size_t newlen);
#endif
|