2 * testbn.c: standalone test program for the bignum code.
6 * Accepts input on standard input, in the form generated by
17 void modalfatalbox(const char *p, ...)
20 fprintf(stderr, "FATAL ERROR: ");
22 vfprintf(stderr, p, ap);
30 modalfatalbox("random_byte called in testbn");
34 #define fromxdigit(c) ( (c)>'9' ? ((c)&0xDF) - 'A' + 10 : (c) - '0' )
36 int main(int argc, char **argv)
40 int passes = 0, fails = 0;
42 printf("BIGNUM_INT_BITS = %d\n", (int)BIGNUM_INT_BITS);
44 while ((buf = fgetline(stdin)) != NULL) {
45 int maxlen = strlen(buf);
46 unsigned char *data = snewn(maxlen, unsigned char);
47 unsigned char *ptrs[5], *q;
56 while (*bufp && !isspace((unsigned char)*bufp))
65 while (*bufp && !isxdigit((unsigned char)*bufp))
72 while (*bufp && isxdigit((unsigned char)*bufp))
76 if (ptrnum >= lenof(ptrs))
80 for (i = -((end - start) & 1); i < end-start; i += 2) {
81 unsigned char val = (i < 0 ? 0 : fromxdigit(start[i]));
82 val = val * 16 + fromxdigit(start[i+1]);
89 if (!strcmp(buf, "mul")) {
93 printf("%d: mul with %d parameters, expected 3\n", line, ptrnum);
96 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
97 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
98 c = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
101 if (bignum_cmp(c, p) == 0) {
104 char *as = bignum_decimal(a);
105 char *bs = bignum_decimal(b);
106 char *cs = bignum_decimal(c);
107 char *ps = bignum_decimal(p);
109 printf("%d: fail: %s * %s gave %s expected %s\n",
110 line, as, bs, ps, cs);
122 } else if (!strcmp(buf, "modmul")) {
123 Bignum a, b, m, c, p;
126 printf("%d: modmul with %d parameters, expected 4\n",
130 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
131 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
132 m = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
133 c = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
136 if (bignum_cmp(c, p) == 0) {
139 char *as = bignum_decimal(a);
140 char *bs = bignum_decimal(b);
141 char *ms = bignum_decimal(m);
142 char *cs = bignum_decimal(c);
143 char *ps = bignum_decimal(p);
145 printf("%d: fail: %s * %s mod %s gave %s expected %s\n",
146 line, as, bs, ms, ps, cs);
160 } else if (!strcmp(buf, "pow")) {
161 Bignum base, expt, modulus, expected, answer;
164 printf("%d: pow with %d parameters, expected 4\n", line, ptrnum);
168 base = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
169 expt = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
170 modulus = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
171 expected = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
172 answer = modpow(base, expt, modulus);
174 if (bignum_cmp(expected, answer) == 0) {
177 char *as = bignum_decimal(base);
178 char *bs = bignum_decimal(expt);
179 char *cs = bignum_decimal(modulus);
180 char *ds = bignum_decimal(answer);
181 char *ps = bignum_decimal(expected);
183 printf("%d: fail: %s ^ %s mod %s gave %s expected %s\n",
184 line, as, bs, cs, ds, ps);
198 } else if (!strcmp(buf, "divmod")) {
199 Bignum n, d, expect_q, expect_r, answer_q, answer_r;
203 printf("%d: divmod with %d parameters, expected 4\n", line, ptrnum);
207 n = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
208 d = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
209 expect_q = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
210 expect_r = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
211 answer_q = bigdiv(n, d);
212 answer_r = bigmod(n, d);
215 if (bignum_cmp(expect_q, answer_q) != 0) {
216 char *as = bignum_decimal(n);
217 char *bs = bignum_decimal(d);
218 char *cs = bignum_decimal(answer_q);
219 char *ds = bignum_decimal(expect_q);
221 printf("%d: fail: %s / %s gave %s expected %s\n",
222 line, as, bs, cs, ds);
230 if (bignum_cmp(expect_r, answer_r) != 0) {
231 char *as = bignum_decimal(n);
232 char *bs = bignum_decimal(d);
233 char *cs = bignum_decimal(answer_r);
234 char *ds = bignum_decimal(expect_r);
236 printf("%d: fail: %s mod %s gave %s expected %s\n",
237 line, as, bs, cs, ds);
258 printf("%d: unrecognised test keyword: '%s'\n", line, buf);
266 printf("passed %d failed %d total %d\n", passes, fails, passes+fails);