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
#include "jets.h"
#include "secp256k1/secp256k1.h"
#include "secp256k1/util.h"
#ifdef SECP256K1_WIDEMUL_INT128
# include "secp256k1/int128.h"
# include "secp256k1/int128_impl.h"
#else
# include "secp256k1/int128_struct.h"
# include "secp256k1/int128_struct_impl.h"
#endif
static void write128(frameItem* frame, const secp256k1_uint128* x) {
write64(frame, secp256k1_u128_hi_u64(x));
write64(frame, secp256k1_u128_to_u64(x));
}
/* verify : TWO |- ONE */
bool verify(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
(void) dst; /* dst is unused. */
return readBit(&src);
}
/* low_1 : ONE |- TWO */
bool low_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
(void) src; /* src is unused. */
writeBit(dst, 0);
return true;
}
#define LOW_(bits) \
/* low_n : ONE |- TWO^n */ \
bool low_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
(void) src; /* src is unused. */ \
write##bits(dst, 0); \
return true; \
}
LOW_(8)
LOW_(16)
LOW_(32)
LOW_(64)
/* high_1 : ONE |- TWO */
bool high_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
(void) src; /* src is unused. */
writeBit(dst, 1);
return true;
}
#define HIGH_(bits) \
/* high_n : ONE |- TWO^n */ \
bool high_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
(void) src; /* src is unused. */ \
write##bits(dst, UINT##bits##_MAX); \
return true; \
}
HIGH_(8)
HIGH_(16)
HIGH_(32)
HIGH_(64)
/* complement_1 : TWO |- TWO */
bool complement_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
writeBit(dst, !x);
return true;
}
#define COMPLEMENT_(bits) \
/* complement_n : TWO^n |- TWO^n */ \
bool complement_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
write##bits(dst, ~(1U*x)); \
return true; \
}
COMPLEMENT_(8)
COMPLEMENT_(16)
COMPLEMENT_(32)
COMPLEMENT_(64)
/* and_1 : TWO * TWO |- TWO */
bool and_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
writeBit(dst, x && y);
return true;
}
#define AND_(bits) \
/* and_n : TWO^n * TWO^n |- TWO^n */ \
bool and_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, x & y); \
return true; \
}
AND_(8)
AND_(16)
AND_(32)
AND_(64)
/* or_1 : TWO * TWO |- TWO */
bool or_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
writeBit(dst, x || y);
return true;
}
#define OR_(bits) \
/* or_n : TWO^n * TWO^n |- TWO^n */ \
bool or_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, x | y); \
return true; \
}
OR_(8)
OR_(16)
OR_(32)
OR_(64)
/* xor_1 : TWO * TWO |- TWO */
bool xor_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
writeBit(dst, x ^ y);
return true;
}
#define XOR_(bits) \
/* xor_n : TWO^n * TWO^n |- TWO^n */ \
bool xor_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, x ^ y); \
return true; \
}
XOR_(8)
XOR_(16)
XOR_(32)
XOR_(64)
/* maj_1 : TWO * TWO * TWO |- TWO */
bool maj_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
bool z = readBit(&src);
writeBit(dst, (x && y) || (y && z) || (z && x));
return true;
}
#define MAJ_(bits) \
/* maj_n : TWO^n * TWO^n * TWO^n |- TWO^n */ \
bool maj_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
uint_fast##bits##_t z = read##bits(&src); \
write##bits(dst, (x&y) | (y&z) | (z&x)); \
return true; \
}
MAJ_(8)
MAJ_(16)
MAJ_(32)
MAJ_(64)
/* xor_xor_1 : TWO * TWO * TWO |- TWO */
bool xor_xor_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
bool z = readBit(&src);
writeBit(dst, x ^ y ^ z);
return true;
}
#define XOR_XOR_(bits) \
/* xor_xor_n : TWO^n * TWO^n * TWO^n |- TWO^n */ \
bool xor_xor_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
uint_fast##bits##_t z = read##bits(&src); \
write##bits(dst, x ^ y ^ z); \
return true; \
}
XOR_XOR_(8)
XOR_XOR_(16)
XOR_XOR_(32)
XOR_XOR_(64)
/* ch_1 : TWO * TWO * TWO |- TWO */
bool ch_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
bool z = readBit(&src);
writeBit(dst, x ? y : z);
return true;
}
#define CH_(bits) \
/* ch_n : TWO^n * TWO^n * TWO^n |- TWO^n */ \
bool ch_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
uint_fast##bits##_t z = read##bits(&src); \
write##bits(dst, ((x&y) | ((~(1U*x))&z))); \
return true; \
}
CH_(8)
CH_(16)
CH_(32)
CH_(64)
/* some_1 : TWO |- TWO */
bool some_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
writeBit(dst, x);
return true;
}
#define SOME_(bits) \
/* some_n : TWO^n |- TWO */ \
bool some_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x != 0); \
return true; \
}
SOME_(8)
SOME_(16)
SOME_(32)
SOME_(64)
#define ALL_(bits) \
/* all_n : TWO^n |- TWO */ \
bool all_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x == UINT##bits##_MAX); \
return true; \
}
ALL_(8)
ALL_(16)
ALL_(32)
ALL_(64)
/* eq_1 : TWO * TWO |- TWO */
bool eq_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
bool x = readBit(&src);
bool y = readBit(&src);
writeBit(dst, x == y);
return true;
}
#define EQ_(bits) \
/* eq_n : TWO^n * TWO^n |- TWO */ \
bool eq_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, x == y); \
return true; \
}
EQ_(8)
EQ_(16)
EQ_(32)
EQ_(64)
/* eq_256 : TWO^256 * TWO^256 |- TWO */
bool eq_256(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint32_t arr[16];
read32s(arr, 16, &src);
for (int i = 0; i < 8; ++i) {
if (arr[i] != arr[i+8]) {
writeBit(dst, false);
return true;
}
}
writeBit(dst, true);
return true;
}
#define FULL_LEFT_SHIFT_(bitsN, bitsM) \
/* full_left_shift_n_m : TWO^n * TWO^m |- TWO^m * TWO^n */ \
bool full_left_shift_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 <= (bitsM) && (bitsM) <= (bitsN) && (bitsN) <= 64, "Bad arguments for bitsN or bitsM"); \
copyBits(dst, &src, (bitsN) + (bitsM)); \
return true; \
}
FULL_LEFT_SHIFT_(8,1)
FULL_LEFT_SHIFT_(8,2)
FULL_LEFT_SHIFT_(8,4)
FULL_LEFT_SHIFT_(16,1)
FULL_LEFT_SHIFT_(16,2)
FULL_LEFT_SHIFT_(16,4)
FULL_LEFT_SHIFT_(16,8)
FULL_LEFT_SHIFT_(32,1)
FULL_LEFT_SHIFT_(32,2)
FULL_LEFT_SHIFT_(32,4)
FULL_LEFT_SHIFT_(32,8)
FULL_LEFT_SHIFT_(32,16)
FULL_LEFT_SHIFT_(64,1)
FULL_LEFT_SHIFT_(64,2)
FULL_LEFT_SHIFT_(64,4)
FULL_LEFT_SHIFT_(64,8)
FULL_LEFT_SHIFT_(64,16)
FULL_LEFT_SHIFT_(64,32)
#define FULL_RIGHT_SHIFT_(bitsN, bitsM) \
/* full_right_shift_n_m : TWO^m * TWO^n |- TWO^n * TWO^m */ \
bool full_right_shift_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 <= (bitsM) && (bitsM) <= (bitsN) && (bitsN) <= 64, "Bad arguments for bitsN or bitsM"); \
copyBits(dst, &src, (bitsN) + (bitsM)); \
return true; \
}
FULL_RIGHT_SHIFT_(8,1)
FULL_RIGHT_SHIFT_(8,2)
FULL_RIGHT_SHIFT_(8,4)
FULL_RIGHT_SHIFT_(16,1)
FULL_RIGHT_SHIFT_(16,2)
FULL_RIGHT_SHIFT_(16,4)
FULL_RIGHT_SHIFT_(16,8)
FULL_RIGHT_SHIFT_(32,1)
FULL_RIGHT_SHIFT_(32,2)
FULL_RIGHT_SHIFT_(32,4)
FULL_RIGHT_SHIFT_(32,8)
FULL_RIGHT_SHIFT_(32,16)
FULL_RIGHT_SHIFT_(64,1)
FULL_RIGHT_SHIFT_(64,2)
FULL_RIGHT_SHIFT_(64,4)
FULL_RIGHT_SHIFT_(64,8)
FULL_RIGHT_SHIFT_(64,16)
FULL_RIGHT_SHIFT_(64,32)
#define LEFTMOST_(bitsN, bitsM) \
/* leftmost_n_m : TWO^n |- TWO^m */ \
bool leftmost_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 <= (bitsM) && (bitsM) <= (bitsN) && (bitsN) <= 64, "Bad arguments for bitsN or bitsM"); \
copyBits(dst, &src, (bitsM)); \
return true; \
}
LEFTMOST_(8,1)
LEFTMOST_(8,2)
LEFTMOST_(8,4)
LEFTMOST_(16,1)
LEFTMOST_(16,2)
LEFTMOST_(16,4)
LEFTMOST_(16,8)
LEFTMOST_(32,1)
LEFTMOST_(32,2)
LEFTMOST_(32,4)
LEFTMOST_(32,8)
LEFTMOST_(32,16)
LEFTMOST_(64,1)
LEFTMOST_(64,2)
LEFTMOST_(64,4)
LEFTMOST_(64,8)
LEFTMOST_(64,16)
LEFTMOST_(64,32)
#define RIGHTMOST_(bitsN, bitsM) \
/* rightmost_n_m : TWO^n |- TWO^m */ \
bool rightmost_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 <= (bitsM) && (bitsM) <= (bitsN) && (bitsN) <= 64, "Bad arguments for bitsN or bitsM"); \
forwardBits(&src, (bitsN) - (bitsM)); \
copyBits(dst, &src, (bitsM)); \
return true; \
}
RIGHTMOST_(8,1)
RIGHTMOST_(8,2)
RIGHTMOST_(8,4)
RIGHTMOST_(16,1)
RIGHTMOST_(16,2)
RIGHTMOST_(16,4)
RIGHTMOST_(16,8)
RIGHTMOST_(32,1)
RIGHTMOST_(32,2)
RIGHTMOST_(32,4)
RIGHTMOST_(32,8)
RIGHTMOST_(32,16)
RIGHTMOST_(64,1)
RIGHTMOST_(64,2)
RIGHTMOST_(64,4)
RIGHTMOST_(64,8)
RIGHTMOST_(64,16)
RIGHTMOST_(64,32)
#define LEFT_PAD_LOW_1_(bitsM) \
/* left_pad_low_1_m : TWO |- TWO^m */ \
bool left_pad_low_1_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool bit = readBit(&src); \
write##bitsM(dst, bit); \
return true; \
}
LEFT_PAD_LOW_1_(8)
LEFT_PAD_LOW_1_(16)
LEFT_PAD_LOW_1_(32)
LEFT_PAD_LOW_1_(64)
#define LEFT_PAD_LOW_(bitsN, bitsM) \
/* left_pad_low_n_m : TWO^n |- TWO^m */ \
bool left_pad_low_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, 0); } \
copyBits(dst, &src, (bitsN)); \
return true; \
}
LEFT_PAD_LOW_(8,16)
LEFT_PAD_LOW_(8,32)
LEFT_PAD_LOW_(8,64)
LEFT_PAD_LOW_(16,32)
LEFT_PAD_LOW_(16,64)
LEFT_PAD_LOW_(32,64)
#define LEFT_PAD_HIGH_1_(bitsM) \
/* left_pad_high_1_m : TWO |- TWO^m */ \
bool left_pad_high_1_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
for(int i = 0; i < (bitsM) - 1; ++i) { writeBit(dst, true); } \
copyBits(dst, &src, 1); \
return true; \
}
LEFT_PAD_HIGH_1_(8)
LEFT_PAD_HIGH_1_(16)
LEFT_PAD_HIGH_1_(32)
LEFT_PAD_HIGH_1_(64)
#define LEFT_PAD_HIGH_(bitsN, bitsM) \
/* left_pad_high_n_m : TWO^n |- TWO^m */ \
bool left_pad_high_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, UINT##bitsN##_MAX); } \
copyBits(dst, &src, (bitsN)); \
return true; \
}
LEFT_PAD_HIGH_(8,16)
LEFT_PAD_HIGH_(8,32)
LEFT_PAD_HIGH_(8,64)
LEFT_PAD_HIGH_(16,32)
LEFT_PAD_HIGH_(16,64)
LEFT_PAD_HIGH_(32,64)
#define LEFT_EXTEND_1_(bitsM) \
/* left_extend_1_m : TWO |- TWO^m */ \
bool left_extend_1_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool bit = readBit(&src); \
write##bitsM(dst, bit ? UINT##bitsM##_MAX : 0); \
return true; \
}
LEFT_EXTEND_1_(8)
LEFT_EXTEND_1_(16)
LEFT_EXTEND_1_(32)
LEFT_EXTEND_1_(64)
#define LEFT_EXTEND_(bitsN, bitsM) \
/* left_extend_n_m : TWO^n |- TWO^m */ \
bool left_extend_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
uint_fast##bitsN##_t input = read##bitsN(&src); \
bool msb = input >> ((bitsN) - 1); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, msb ? UINT##bitsN##_MAX : 0); } \
write##bitsN(dst, input); \
return true; \
}
LEFT_EXTEND_(8,16)
LEFT_EXTEND_(8,32)
LEFT_EXTEND_(8,64)
LEFT_EXTEND_(16,32)
LEFT_EXTEND_(16,64)
LEFT_EXTEND_(32,64)
#define RIGHT_PAD_LOW_1_(bitsM) \
/* right_pad_low_1_m : TWO |- TWO^m */ \
bool right_pad_low_1_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
bool bit = readBit(&src); \
write##bitsM(dst, (uint_fast##bitsM##_t)((uint_fast##bitsM##_t)bit << ((bitsM) - 1))); \
return true; \
}
RIGHT_PAD_LOW_1_(8)
RIGHT_PAD_LOW_1_(16)
RIGHT_PAD_LOW_1_(32)
RIGHT_PAD_LOW_1_(64)
#define RIGHT_PAD_LOW_(bitsN, bitsM) \
/* right_pad_low_n_m : TWO^n |- TWO^m */ \
bool right_pad_low_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
copyBits(dst, &src, (bitsN)); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, 0); } \
return true; \
}
RIGHT_PAD_LOW_(8,16)
RIGHT_PAD_LOW_(8,32)
RIGHT_PAD_LOW_(8,64)
RIGHT_PAD_LOW_(16,32)
RIGHT_PAD_LOW_(16,64)
RIGHT_PAD_LOW_(32,64)
#define RIGHT_PAD_HIGH_1_(bitsM) \
/* right_pad_high_1_m : TWO |- TWO^m */ \
bool right_pad_high_1_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
copyBits(dst, &src, 1); \
for(int i = 0; i < (bitsM) - 1; ++i) { writeBit(dst, true); } \
return true; \
}
RIGHT_PAD_HIGH_1_(8)
RIGHT_PAD_HIGH_1_(16)
RIGHT_PAD_HIGH_1_(32)
RIGHT_PAD_HIGH_1_(64)
#define RIGHT_PAD_HIGH_(bitsN, bitsM) \
/* right_pad_high_n_m : TWO^n |- TWO^m */ \
bool right_pad_high_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
copyBits(dst, &src, (bitsN)); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, UINT##bitsN##_MAX); } \
return true; \
}
RIGHT_PAD_HIGH_(8,16)
RIGHT_PAD_HIGH_(8,32)
RIGHT_PAD_HIGH_(8,64)
RIGHT_PAD_HIGH_(16,32)
RIGHT_PAD_HIGH_(16,64)
RIGHT_PAD_HIGH_(32,64)
#define RIGHT_EXTEND_(bitsN, bitsM) \
/* right_extend_n_m : TWO^n |- TWO^m */ \
bool right_extend_##bitsN##_##bitsM(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
static_assert(0 < (bitsN) && (bitsN) <= 64, "bitsN is out of range"); \
static_assert(0 < (bitsM) && (bitsM) <= 64, "bitsM is out of range"); \
static_assert(0 == (bitsM) % (bitsN), "bitsM is not a multiple of bitsN"); \
uint_fast##bitsN##_t input = read##bitsN(&src); \
bool lsb = input & 1; \
write##bitsN(dst, input); \
for(int i = 0; i < (bitsM)/(bitsN) - 1; ++i) { write##bitsN(dst, lsb ? UINT##bitsN##_MAX : 0); } \
return true; \
}
RIGHT_EXTEND_(8,16)
RIGHT_EXTEND_(8,32)
RIGHT_EXTEND_(8,64)
RIGHT_EXTEND_(16,32)
RIGHT_EXTEND_(16,64)
RIGHT_EXTEND_(32,64)
#define LEFT_SHIFT_(log, bits) \
static inline void left_shift_helper_##bits(bool with, frameItem* dst, frameItem *src) { \
static_assert(log <= 8, "Only log parameter upto 8 is supported."); \
uint_fast8_t amt = read##log(src); \
uint_fast##bits##_t output = read##bits(src); \
if (with) output = UINT##bits##_MAX ^ output; \
if (amt < bits) { \
output = (uint_fast##bits##_t)((1U * output) << amt); \
} else { \
output = 0; \
} \
if (with) output = UINT##bits##_MAX ^ output; \
write##bits(dst, output); \
} \
\
/* left_shift_with_n : TWO * TWO^l * TWO^n |- TWO^n */ \
bool left_shift_with_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool with = readBit(&src); \
left_shift_helper_##bits(with, dst, &src); \
return true; \
} \
\
/* left_shift_n : TWO^l * TWO^n |- TWO^n */ \
bool left_shift_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
left_shift_helper_##bits(0, dst, &src); \
return true; \
}
LEFT_SHIFT_(4,8)
LEFT_SHIFT_(4,16)
LEFT_SHIFT_(8,32)
LEFT_SHIFT_(8,64)
#define RIGHT_SHIFT_(log, bits) \
static inline void right_shift_helper_##bits(bool with, frameItem* dst, frameItem *src) { \
static_assert(log <= 8, "Only log parameter upto 8 is supported."); \
uint_fast8_t amt = read##log(src); \
uint_fast##bits##_t output = read##bits(src); \
if (with) output = UINT##bits##_MAX ^ output; \
if (amt < bits) { \
output = (uint_fast##bits##_t)(output >> amt); \
} else { \
output = 0; \
} \
if (with) output = UINT##bits##_MAX ^ output; \
write##bits(dst, output); \
} \
\
/* right_shift_with_n : TWO * TWO^l * TWO^n |- TWO^n */ \
bool right_shift_with_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool with = readBit(&src); \
right_shift_helper_##bits(with, dst, &src); \
return true; \
} \
\
/* right_shift_n : TWO^l * TWO^n |- TWO^n */ \
bool right_shift_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
right_shift_helper_##bits(0, dst, &src); \
return true; \
}
RIGHT_SHIFT_(4,8)
RIGHT_SHIFT_(4,16)
RIGHT_SHIFT_(8,32)
RIGHT_SHIFT_(8,64)
#define ROTATE_(log, bits) \
/* Precondition: 0 <= amt < bits */ \
static inline uint_fast##bits##_t rotate_##bits(uint_fast##bits##_t value, uint_fast8_t amt) { \
if (amt) { \
return (uint_fast##bits##_t)((1U * value << amt) | value >> (bits - amt)); \
} else { \
return value; \
} \
} \
\
/* left_rotate_n : TWO^l * TWO^n |- TWO^n */ \
bool left_rotate_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast8_t amt = read##log(&src) % bits; \
uint_fast##bits##_t input = read##bits(&src); \
write##bits(dst, rotate_##bits(input, amt)); \
return true; \
} \
\
/* right_rotate_n : TWO^l * TWO^n |- TWO^n */ \
bool right_rotate_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
static_assert(bits <= UINT8_MAX, "'bits' is too large."); \
(void) env; /* env is unused. */ \
uint_fast8_t amt = read##log(&src) % bits; \
uint_fast##bits##_t input = read##bits(&src); \
write##bits(dst, rotate_##bits(input, (uint_fast8_t)((bits - amt) % bits))); \
return true; \
}
ROTATE_(4,8)
ROTATE_(4,16)
ROTATE_(8,32)
ROTATE_(8,64)
#define ONE_(bits) \
/* one_n : ONE |- TWO^n */ \
bool one_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
(void) src; /* src is unused. */ \
write##bits(dst, 1); \
return true; \
}
ONE_(8)
ONE_(16)
ONE_(32)
ONE_(64)
#define ADD_(bits) \
/* add_n : TWO^n * TWO^n |- TWO * TWO^n */ \
bool add_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, 1U * UINT##bits##_MAX - y < x); \
write##bits(dst, (uint_fast##bits##_t)(1U * x + y)); \
return true; \
}
ADD_(8)
ADD_(16)
ADD_(32)
ADD_(64)
#define FULL_ADD_(bits) \
/* full_add_n : TWO * TWO^n * TWO^n |- TWO * TWO^n */ \
bool full_add_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool z = readBit(&src); \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, 1U * UINT##bits##_MAX - y < x || 1U * UINT##bits##_MAX - z < 1U * x + y); \
write##bits(dst, (uint_fast##bits##_t)(1U * x + y + z)); \
return true; \
}
FULL_ADD_(8)
FULL_ADD_(16)
FULL_ADD_(32)
FULL_ADD_(64)
#define FULL_INCREMENT_(bits) \
/* full_increment_n : TWO * TWO^n |- TWO * TWO^n */ \
bool full_increment_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool z = readBit(&src); \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, 1U * UINT##bits##_MAX - z < x); \
write##bits(dst, (uint_fast##bits##_t)(1U * x + z)); \
return true; \
}
FULL_INCREMENT_(8)
FULL_INCREMENT_(16)
FULL_INCREMENT_(32)
FULL_INCREMENT_(64)
#define INCREMENT_(bits) \
/* increment_n : TWO^n |- TWO * TWO^n */ \
bool increment_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, 1U * UINT##bits##_MAX - 1 < x); \
write##bits(dst, (uint_fast##bits##_t)(1U * x + 1)); \
return true; \
}
INCREMENT_(8)
INCREMENT_(16)
INCREMENT_(32)
INCREMENT_(64)
#define SUBTRACT_(bits) \
/* subtract_n : TWO^n * TWO^n |- TWO * TWO^n */ \
bool subtract_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, x < y); \
write##bits(dst, (uint_fast##bits##_t)(1U * x - y)); \
return true; \
}
SUBTRACT_(8)
SUBTRACT_(16)
SUBTRACT_(32)
SUBTRACT_(64)
#define NEGATE_(bits) \
/* negate_n : TWO^n |- TWO * TWO^n */ \
bool negate_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x != 0); \
write##bits(dst, (uint_fast##bits##_t)(- (1U * x))); \
return true; \
}
NEGATE_(8)
NEGATE_(16)
NEGATE_(32)
NEGATE_(64)
#define FULL_DECREMENT_(bits) \
/* full_decrement_n : TWO * TWO^n |- TWO * TWO^n */ \
bool full_decrement_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool z = readBit(&src); \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x < z); \
write##bits(dst, (uint_fast##bits##_t)(1U * x - z)); \
return true; \
}
FULL_DECREMENT_(8)
FULL_DECREMENT_(16)
FULL_DECREMENT_(32)
FULL_DECREMENT_(64)
#define DECREMENT_(bits) \
/* decrement_n : TWO^n |- TWO * TWO^n */ \
bool decrement_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x < 1); \
write##bits(dst, (uint_fast##bits##_t)(1U * x - 1)); \
return true; \
}
DECREMENT_(8)
DECREMENT_(16)
DECREMENT_(32)
DECREMENT_(64)
#define FULL_SUBTRACT_(bits) \
/* full_subtract_n : TWO * TWO^n * TWO^n |- TWO * TWO^n */ \
bool full_subtract_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
bool z = readBit(&src); \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, x < y || 1U * x - y < z); \
write##bits(dst, (uint_fast##bits##_t)(1U * x - y - z)); \
return true; \
}
FULL_SUBTRACT_(8)
FULL_SUBTRACT_(16)
FULL_SUBTRACT_(32)
FULL_SUBTRACT_(64)
#define MULTIPLY_(bits,bitsx2) \
bool multiply_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bitsx2##_t x = read##bits(&src); \
uint_fast##bitsx2##_t y = read##bits(&src); \
write##bitsx2(dst, x * y); \
return true; \
}
MULTIPLY_(8, 16)
MULTIPLY_(16, 32)
MULTIPLY_(32, 64)
bool multiply_64(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint_fast64_t x = read64(&src);
uint_fast64_t y = read64(&src);
secp256k1_uint128 r;
secp256k1_u128_mul(&r, x, y);
write128(dst, &r);
return true;
}
#define FULL_MULTIPLY_(bits,bitsx2) \
bool full_multiply_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bitsx2##_t x = read##bits(&src); \
uint_fast##bitsx2##_t y = read##bits(&src); \
uint_fast##bitsx2##_t z = read##bits(&src); \
uint_fast##bitsx2##_t w = read##bits(&src); \
write##bitsx2(dst, x * y + z + w); \
return true; \
}
FULL_MULTIPLY_(8, 16)
FULL_MULTIPLY_(16, 32)
FULL_MULTIPLY_(32, 64)
bool full_multiply_64(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint_fast64_t x = read64(&src);
uint_fast64_t y = read64(&src);
uint_fast64_t z = read64(&src);
uint_fast64_t w = read64(&src);
secp256k1_uint128 r;
secp256k1_u128_mul(&r, x, y);
secp256k1_u128_accum_u64(&r, z);
secp256k1_u128_accum_u64(&r, w);
write128(dst, &r);
return true;
}
#define IS_ZERO_(bits) \
/* is_zero_n : TWO^n |- TWO */ \
bool is_zero_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x == 0); \
return true; \
}
IS_ZERO_(8)
IS_ZERO_(16)
IS_ZERO_(32)
IS_ZERO_(64)
#define IS_ONE_(bits) \
/* is_one_n : TWO^n |- TWO */ \
bool is_one_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
writeBit(dst, x == 1); \
return true; \
}
IS_ONE_(8)
IS_ONE_(16)
IS_ONE_(32)
IS_ONE_(64)
#define LE_(bits) \
/* le_n : TWO^n * TWO^n |- TWO */ \
bool le_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, x <= y); \
return true; \
}
LE_(8)
LE_(16)
LE_(32)
LE_(64)
#define LT_(bits) \
/* lt_n : TWO^n * TWO^n |- TWO */ \
bool lt_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, x < y); \
return true; \
}
LT_(8)
LT_(16)
LT_(32)
LT_(64)
#define MIN_(bits) \
/* min_n : TWO^n * TWO^n |- TWO^n */ \
bool min_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, x < y ? x : y); \
return true; \
}
MIN_(8)
MIN_(16)
MIN_(32)
MIN_(64)
#define MAX_(bits) \
/* max_n : TWO^n * TWO^n |- TWO^n */ \
bool max_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, x < y ? y : x); \
return true; \
}
MAX_(8)
MAX_(16)
MAX_(32)
MAX_(64)
#define MEDIAN_(bits) \
/* median_n : TWO^n * TWO^n * TWO^n |- TWO^n */ \
bool median_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
uint_fast##bits##_t z = read##bits(&src); \
write##bits(dst, x < y \
? (y < z ? y : (z < x ? x : z)) \
: (x < z ? x : (z < y ? y : z))); \
return true; \
}
MEDIAN_(8)
MEDIAN_(16)
MEDIAN_(32)
MEDIAN_(64)
#define DIV_MOD_(bits) \
/* div_mod_n : TWO^n * TWO^n |- TWO^n * TWO^n */ \
bool div_mod_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, 0 == y ? 0 : x / y); \
write##bits(dst, 0 == y ? x : x % y); \
return true; \
}
DIV_MOD_(8)
DIV_MOD_(16)
DIV_MOD_(32)
DIV_MOD_(64)
#define DIVIDE_(bits) \
/* divide_n : TWO^n * TWO^n |- TWO^n */ \
bool divide_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, 0 == y ? 0 : x / y); \
return true; \
}
DIVIDE_(8)
DIVIDE_(16)
DIVIDE_(32)
DIVIDE_(64)
#define MODULO_(bits) \
/* modulo_n : TWO^n * TWO^n |- TWO^n */ \
bool modulo_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
write##bits(dst, 0 == y ? x : x % y); \
return true; \
}
MODULO_(8)
MODULO_(16)
MODULO_(32)
MODULO_(64)
#define DIVIDES_(bits) \
/* divides_n : TWO^n * TWO^n |- TWO */ \
bool divides_##bits(frameItem* dst, frameItem src, const txEnv* env) { \
(void) env; /* env is unused. */ \
uint_fast##bits##_t x = read##bits(&src); \
uint_fast##bits##_t y = read##bits(&src); \
writeBit(dst, 0 == (0 == x ? y : y % x)); \
return true; \
}
DIVIDES_(8)
DIVIDES_(16)
DIVIDES_(32)
DIVIDES_(64)
/* sha_256_iv : ONE |- TWO^256 */
bool sha_256_iv(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
(void) src; /* env is unused. */
uint32_t iv[8];
sha256_iv(iv);
write32s(dst, iv, 8);
return true;
}
/* sha_256_block : TWO^256 * TWO^512 |- TWO^256 */
bool sha_256_block(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint32_t h[8];
uint32_t block[16];
read32s(h, 8, &src);
read32s(block, 16, &src);
sha256_compression(h, block);
write32s(dst, h, 8);
return true;
}
/* sha_256_ctx_8_init : ONE |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_init(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
(void) src; /* env is unused. */
uint32_t iv[8];
sha256_context ctx = sha256_init(iv);
return write_sha256_context(dst, &ctx);
}
/* sha_256_ctx_8_add_n : CTX8 * (TWO^8)^n |- CTX8
* where
* n is a power of 2 less than or equal to 512
* and
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
static bool sha_256_ctx_8_add_n(frameItem* dst, frameItem *src, size_t n) {
simplicity_debug_assert(0 < n && n <= 512 && (n & (n - 1)) == 0);
sha256_midstate midstate;
unsigned char buf[512];
sha256_context ctx = {.output = midstate.s};
if (!read_sha256_context(&ctx, src)) return false;
read8s(buf, n, src);
sha256_uchars(&ctx, buf, n);
return write_sha256_context(dst, &ctx);
}
/* sha_256_ctx_8_add_1 : CTX8 * TWO^8 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_1(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 1);
}
/* sha_256_ctx_8_add_2 : CTX8 * (TWO^8)^2 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_2(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 2);
}
/* sha_256_ctx_8_add_4 : CTX8 * (TWO^8)^4 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_4(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 4);
}
/* sha_256_ctx_8_add_8 : CTX8 * (TWO^8)^8 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_8(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 8);
}
/* sha_256_ctx_8_add_16 : CTX8 * (TWO^8)^16 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_16(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 16);
}
/* sha_256_ctx_8_add_32 : CTX8 * (TWO^8)^32 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_32(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 32);
}
/* sha_256_ctx_8_add_64 : CTX8 * (TWO^8)^64 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_64(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 64);
}
/* sha_256_ctx_8_add_128 : CTX8 * (TWO^8)^128 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_128(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 128);
}
/* sha_256_ctx_8_add_256 : CTX8 * (TWO^8)^256 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_256(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 256);
}
/* sha_256_ctx_8_add_512 : CTX8 * (TWO^8)^512 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_512(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
return sha_256_ctx_8_add_n(dst, &src, 512);
}
/* sha_256_ctx_8_add_buffer_511 : CTX8 * (TWO^8)^<512 |- CTX8
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_add_buffer_511(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
sha256_midstate midstate;
unsigned char buf[511];
size_t buf_len;
sha256_context ctx = {.output = midstate.s};
if (!read_sha256_context(&ctx, &src)) return false;
read_buffer8(buf, &buf_len, &src, 8);
sha256_uchars(&ctx, buf, buf_len);
return write_sha256_context(dst, &ctx);
}
/* sha_256_ctx_8_finalize : CTX8 |- TWO^256
* where
* CTX8 = (TWO^8)^<64 * TWO^64 * TWO^256
*/
bool sha_256_ctx_8_finalize(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
sha256_midstate midstate;
sha256_context ctx = {.output = midstate.s};
if (!read_sha256_context(&ctx, &src)) return false;
sha256_finalize(&ctx);
write32s(dst, midstate.s, 8);
return true;
}
/* parse_sequence : TWO^32 |- TWO^32 + TWO^32 */
bool parse_lock(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint_fast32_t nLockTime = read32(&src);
writeBit(dst, 500000000U <= nLockTime);
write32(dst, nLockTime);
return true;
}
/* parse_sequence : TWO^32 |- S (TWO^16 + TWO^16) */
bool parse_sequence(frameItem* dst, frameItem src, const txEnv* env) {
(void) env; /* env is unused. */
uint_fast32_t nSequence = read32(&src);
if (writeBit(dst, nSequence < ((uint_fast32_t)1 << 31))) {
writeBit(dst, nSequence & ((uint_fast32_t)1 << 22));
write16(dst, nSequence & 0xffff);
} else {
skipBits(dst, 17);
}
return true;
}