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]);
87 if (!strcmp(buf, "mul")) {
91 printf("%d: mul with %d parameters, expected 3\n", line, ptrnum);
94 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
95 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
96 c = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
99 if (bignum_cmp(c, p) == 0) {
102 char *as = bignum_decimal(a);
103 char *bs = bignum_decimal(b);
104 char *cs = bignum_decimal(c);
105 char *ps = bignum_decimal(p);
107 printf("%d: fail: %s * %s gave %s expected %s\n",
108 line, as, bs, ps, cs);
120 } else if (!strcmp(buf, "modmul")) {
121 Bignum a, b, m, c, p;
124 printf("%d: modmul with %d parameters, expected 4\n",
128 a = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
129 b = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
130 m = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
131 c = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
134 if (bignum_cmp(c, p) == 0) {
137 char *as = bignum_decimal(a);
138 char *bs = bignum_decimal(b);
139 char *ms = bignum_decimal(m);
140 char *cs = bignum_decimal(c);
141 char *ps = bignum_decimal(p);
143 printf("%d: fail: %s * %s mod %s gave %s expected %s\n",
144 line, as, bs, ms, ps, cs);
158 } else if (!strcmp(buf, "pow")) {
159 Bignum base, expt, modulus, expected, answer;
162 printf("%d: pow with %d parameters, expected 4\n", line, ptrnum);
166 base = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
167 expt = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
168 modulus = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
169 expected = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
170 answer = modpow(base, expt, modulus);
172 if (bignum_cmp(expected, answer) == 0) {
175 char *as = bignum_decimal(base);
176 char *bs = bignum_decimal(expt);
177 char *cs = bignum_decimal(modulus);
178 char *ds = bignum_decimal(answer);
179 char *ps = bignum_decimal(expected);
181 printf("%d: fail: %s ^ %s mod %s gave %s expected %s\n",
182 line, as, bs, cs, ds, ps);
196 } else if (!strcmp(buf, "divmod")) {
197 Bignum n, d, expect_q, expect_r, answer_q, answer_r;
201 printf("%d: divmod with %d parameters, expected 4\n", line, ptrnum);
205 n = bignum_from_bytes(ptrs[0], ptrs[1]-ptrs[0]);
206 d = bignum_from_bytes(ptrs[1], ptrs[2]-ptrs[1]);
207 expect_q = bignum_from_bytes(ptrs[2], ptrs[3]-ptrs[2]);
208 expect_r = bignum_from_bytes(ptrs[3], ptrs[4]-ptrs[3]);
209 answer_q = bigdiv(n, d);
210 answer_r = bigmod(n, d);
213 if (bignum_cmp(expect_q, answer_q) != 0) {
214 char *as = bignum_decimal(n);
215 char *bs = bignum_decimal(d);
216 char *cs = bignum_decimal(answer_q);
217 char *ds = bignum_decimal(expect_q);
219 printf("%d: fail: %s / %s gave %s expected %s\n",
220 line, as, bs, cs, ds);
228 if (bignum_cmp(expect_r, answer_r) != 0) {
229 char *as = bignum_decimal(n);
230 char *bs = bignum_decimal(d);
231 char *cs = bignum_decimal(answer_r);
232 char *ds = bignum_decimal(expect_r);
234 printf("%d: fail: %s mod %s gave %s expected %s\n",
235 line, as, bs, cs, ds);
256 printf("%d: unrecognised test keyword: '%s'\n", line, buf);
264 printf("passed %d failed %d total %d\n", passes, fails, passes+fails);