2 * testbn.c: standalone test program for the bignum code.
6 * Accepts input on standard input, in the form generated by
16 void modalfatalbox(const char *p, ...)
19 fprintf(stderr, "FATAL ERROR: ");
21 vfprintf(stderr, p, ap);
29 modalfatalbox("random_byte called in testbn");
33 #define fromxdigit(c) ( (c)>'9' ? ((c)&0xDF) - 'A' + 10 : (c) - '0' )
35 int main(int argc, char **argv)
39 int passes = 0, fails = 0;
41 while ((buf = fgetline(stdin)) != NULL) {
42 int maxlen = strlen(buf);
43 unsigned char *data = snewn(maxlen, unsigned char);
44 unsigned char *ptrs[5], *q;
53 while (*bufp && !isspace((unsigned char)*bufp))
62 while (*bufp && !isxdigit((unsigned char)*bufp))
69 while (*bufp && isxdigit((unsigned char)*bufp))
73 if (ptrnum >= lenof(ptrs))
77 for (i = -((end - start) & 1); i < end-start; i += 2) {
78 unsigned char val = (i < 0 ? 0 : fromxdigit(start[i]));
79 val = val * 16 + fromxdigit(start[i+1]);
86 if (!strcmp(buf, "mul")) {
90 printf("%d: mul with %d parameters, expected 3\n", line, ptrnum);
93 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
94 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
95 c = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
98 if (bignum_cmp(c, p) == 0) {
101 char *as = bignum_decimal(a);
102 char *bs = bignum_decimal(b);
103 char *cs = bignum_decimal(c);
104 char *ps = bignum_decimal(p);
106 printf("%d: fail: %s * %s gave %s expected %s\n",
107 line, as, bs, ps, cs);
119 } else if (!strcmp(buf, "modmul")) {
120 Bignum a, b, m, c, p;
123 printf("%d: modmul with %d parameters, expected 4\n",
127 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
128 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
129 m = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
130 c = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
133 if (bignum_cmp(c, p) == 0) {
136 char *as = bignum_decimal(a);
137 char *bs = bignum_decimal(b);
138 char *ms = bignum_decimal(m);
139 char *cs = bignum_decimal(c);
140 char *ps = bignum_decimal(p);
142 printf("%d: fail: %s * %s mod %s gave %s expected %s\n",
143 line, as, bs, ms, ps, cs);
157 } else if (!strcmp(buf, "pow")) {
158 Bignum base, expt, modulus, expected, answer;
161 printf("%d: pow with %d parameters, expected 4\n", line, ptrnum);
165 base = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
166 expt = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
167 modulus = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
168 expected = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
169 answer = modpow(base, expt, modulus);
171 if (bignum_cmp(expected, answer) == 0) {
174 char *as = bignum_decimal(base);
175 char *bs = bignum_decimal(expt);
176 char *cs = bignum_decimal(modulus);
177 char *ds = bignum_decimal(answer);
178 char *ps = bignum_decimal(expected);
180 printf("%d: fail: %s ^ %s mod %s gave %s expected %s\n",
181 line, as, bs, cs, ds, ps);
195 } else if (!strcmp(buf, "divmod")) {
196 Bignum n, d, expect_q, expect_r, answer_q, answer_r;
200 printf("%d: divmod with %d parameters, expected 4\n", line, ptrnum);
204 n = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
205 d = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
206 expect_q = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
207 expect_r = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
208 answer_q = bigdiv(n, d);
209 answer_r = bigmod(n, d);
212 if (bignum_cmp(expect_q, answer_q) != 0) {
213 char *as = bignum_decimal(n);
214 char *bs = bignum_decimal(d);
215 char *cs = bignum_decimal(answer_q);
216 char *ds = bignum_decimal(expect_q);
218 printf("%d: fail: %s / %s gave %s expected %s\n",
219 line, as, bs, cs, ds);
227 if (bignum_cmp(expect_r, answer_r) != 0) {
228 char *as = bignum_decimal(n);
229 char *bs = bignum_decimal(d);
230 char *cs = bignum_decimal(answer_r);
231 char *ds = bignum_decimal(expect_r);
233 printf("%d: fail: %s mod %s gave %s expected %s\n",
234 line, as, bs, cs, ds);
255 printf("%d: unrecognised test keyword: '%s'\n", line, buf);
263 printf("passed %d failed %d total %d\n", passes, fails, passes+fails);