3 * $Id: mp-arith.c,v 1.16.2.1 2003/06/10 13:21:10 mdw Exp $
5 * Basic arithmetic on multiprecision integers
7 * (c) 1999 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
32 * $Log: mp-arith.c,v $
33 * Revision 1.16.2.1 2003/06/10 13:21:10 mdw
34 * Fix bug dividing small things by large ones.
36 * Revision 1.16 2003/05/16 09:09:24 mdw
37 * Fix @mp_lsl2c@. Turns out to be surprisingly tricky.
39 * Revision 1.15 2002/10/19 17:56:50 mdw
40 * Fix bit operations. Test them (a bit) better.
42 * Revision 1.14 2002/10/15 19:18:31 mdw
43 * New operation to negate numbers.
45 * Revision 1.13 2002/10/15 00:19:40 mdw
46 * Bit setting and clearing functions.
48 * Revision 1.12 2002/10/09 00:36:03 mdw
49 * Fix bounds on workspace for Karatsuba operations.
51 * Revision 1.11 2002/10/06 22:52:50 mdw
52 * Pile of changes for supporting two's complement properly.
54 * Revision 1.10 2001/04/03 19:36:05 mdw
55 * Add some simple bitwise operations so that Perl can use them.
57 * Revision 1.9 2000/10/08 15:48:35 mdw
58 * Rename Karatsuba constants now that we have @gfx_kmul@ too.
60 * Revision 1.8 2000/10/08 12:02:21 mdw
61 * Use @MP_EQ@ instead of @MP_CMP@.
63 * Revision 1.7 2000/06/22 19:02:53 mdw
64 * New function @mp_odd@ to extract powers of two from an integer. This is
65 * common code from the Rabin-Miller test, RSA key recovery and modular
66 * square-root extraction.
68 * Revision 1.6 2000/06/17 11:45:09 mdw
69 * Major memory management overhaul. Added arena support. Use the secure
70 * arena for secret integers. Replace and improve the MP management macros
71 * (e.g., replace MP_MODIFY by MP_DEST).
73 * Revision 1.5 1999/12/22 15:54:41 mdw
74 * Adjust Karatsuba parameters. Calculate destination size better.
76 * Revision 1.4 1999/12/13 15:35:16 mdw
77 * Slightly different rules on memory allocation.
79 * Revision 1.3 1999/12/11 10:57:43 mdw
80 * Karatsuba squaring algorithm.
82 * Revision 1.2 1999/12/10 23:18:39 mdw
83 * Change interface for suggested destinations.
85 * Revision 1.1 1999/11/17 18:02:16 mdw
86 * New multiprecision integer arithmetic suite.
90 /*----- Header files ------------------------------------------------------*/
94 /*----- Macros ------------------------------------------------------------*/
96 #define MAX(x, y) ((x) >= (y) ? (x) : (y))
98 /*----- Main code ---------------------------------------------------------*/
100 /* --- @mp_lsl@, @mp_lslc@, @mp_lsr@ --- *
102 * Arguments: @mp *d@ = destination
104 * @size_t n@ = number of bits to move
106 * Returns: Result, @a@ shifted left or right by @n@.
108 * Use: Bitwise shift operators. @mp_lslc@ fills the bits introduced
109 * on the right with ones instead of zeroes: it's used
110 * internally by @mp_lsl2c@, though it may be useful on its
114 mp
*mp_lsl(mp
*d
, mp
*a
, size_t n
)
116 MP_DEST(d
, MP_LEN(a
) + (n
+ MPW_BITS
- 1) / MPW_BITS
, a
->f
);
117 mpx_lsl(d
->v
, d
->vl
, a
->v
, a
->vl
, n
);
118 d
->f
= a
->f
& (MP_NEG
| MP_BURN
);
123 mp
*mp_lslc(mp
*d
, mp
*a
, size_t n
)
125 MP_DEST(d
, MP_LEN(a
) + (n
+ MPW_BITS
- 1) / MPW_BITS
, a
->f
);
126 mpx_lslc(d
->v
, d
->vl
, a
->v
, a
->vl
, n
);
127 d
->f
= a
->f
& (MP_NEG
| MP_BURN
);
132 mp
*mp_lsr(mp
*d
, mp
*a
, size_t n
)
134 MP_DEST(d
, MP_LEN(a
), a
->f
);
135 mpx_lsr(d
->v
, d
->vl
, a
->v
, a
->vl
, n
);
136 d
->f
= a
->f
& (MP_NEG
| MP_BURN
);
141 /* --- @mp_lsl2c@, @mp_lsr2c@ --- *
143 * Arguments: @mp *d@ = destination
145 * @size_t n@ = number of bits to move
147 * Returns: Result, @a@ shifted left or right by @n@. Handles the
148 * pretence of sign-extension for negative numbers.
151 mp
*mp_lsl2c(mp
*d
, mp
*a
, size_t n
)
153 if (!(a
->f
& MP_NEG
))
154 return (mp_lsl(d
, a
, n
));
156 d
= mp_lslc(d
, d
, n
);
161 mp
*mp_lsr2c(mp
*d
, mp
*a
, size_t n
)
163 if (!(a
->f
& MP_NEG
))
164 return (mp_lsr(d
, a
, n
));
171 /* --- @mp_testbit@ --- *
173 * Arguments: @mp *x@ = a large integer
174 * @unsigned long n@ = which bit to test
176 * Returns: Nonzero if the bit is set, zero if not.
179 int mp_testbit(mp
*x
, unsigned long n
)
181 if (n
> MPW_BITS
* MP_LEN(x
))
183 return ((x
->v
[n
/MPW_BITS
] >> n
%MPW_BITS
) & 1u);
186 /* --- @mp_testbit2c@ --- *
188 * Arguments: @mp *x@ = a large integer
189 * @unsigned long n@ = which bit to test
191 * Returns: Nonzero if the bit is set, zero if not. Fakes up two's
192 * complement representation.
195 int mp_testbit2c(mp
*x
, unsigned long n
)
198 if (!(x
->f
& MP_NEG
))
199 return (mp_testbit(x
, n
));
200 x
= mp_not2c(MP_NEW
, x
);
201 r
= !mp_testbit(x
, n
);
206 /* --- @mp_setbit@, @mp_clearbit@ --- *
208 * Arguments: @mp *d@ = a destination
209 * @mp *x@ = a large integer
210 * @unsigned long n@ = which bit to modify
212 * Returns: The argument @x@, with the appropriate bit set or cleared.
215 mp
*mp_setbit(mp
*d
, mp
*x
, unsigned long n
)
219 rq
= n
+ MPW_BITS
; rq
-= rq
% MPW_BITS
;
224 MP_DEST(d
, rq
, x
->f
& (MP_NEG
| MP_BURN
));
225 d
->v
[n
/MPW_BITS
] |= 1 << n
%MPW_BITS
;
229 mp
*mp_clearbit(mp
*d
, mp
*x
, unsigned long n
)
233 rq
= n
+ MPW_BITS
; rq
-= rq
% MPW_BITS
;
238 MP_DEST(d
, rq
, x
->f
& (MP_NEG
| MP_BURN
));
239 d
->v
[n
/MPW_BITS
] &= ~(1 << n
%MPW_BITS
);
243 /* --- @mp_setbit2c@, @mp_clearbit2c@ --- *
245 * Arguments: @mp *d@ = a destination
246 * @mp *x@ = a large integer
247 * @unsigned long n@ = which bit to modify
249 * Returns: The argument @x@, with the appropriate bit set or cleared.
250 * Fakes up two's complement representation.
253 mp
*mp_setbit2c(mp
*d
, mp
*x
, unsigned long n
)
255 if (!(x
->f
& MP_NEG
))
256 return mp_setbit(d
, x
, n
);
258 d
= mp_clearbit(d
, d
, n
);
263 mp
*mp_clearbit2c(mp
*d
, mp
*x
, unsigned long n
)
265 if (!(x
->f
& MP_NEG
))
266 return mp_clearbit(d
, x
, n
);
268 d
= mp_setbit(d
, d
, n
);
275 * Arguments: @const mp *a, *b@ = two numbers
277 * Returns: Nonzero if the numbers are equal.
280 int mp_eq(const mp
*a
, const mp
*b
) { return (MP_EQ(a
, b
)); }
282 /* --- @mp_cmp@ --- *
284 * Arguments: @const mp *a, *b@ = two numbers
286 * Returns: Less than, equal to or greater than zero, according to
287 * whether @a@ is less than, equal to or greater than @b@.
290 int mp_cmp(const mp
*a
, const mp
*b
)
292 if (!((a
->f
^ b
->f
) & MP_NEG
))
293 return (mpx_ucmp(a
->v
, a
->vl
, b
->v
, b
->vl
));
294 else if (a
->f
& MP_NEG
)
300 /* --- @mp_neg@ --- *
302 * Arguments: @mp *d@ = destination
305 * Returns: The negation of the argument.
307 * Use: Negates its argument.
310 mp
*mp_neg(mp
*d
, mp
*a
)
312 /* --- Surprising amounts of messing about required --- */
320 MP_DEST(a
, MP_LEN(a
), a
->f
);
325 /* --- @mp_bitop@ --- *
327 * Arguments: @mp *d@ = destination
328 * @mp *a, *b@ = sources
330 * Returns: The result of the given bitwise operation. These functions
331 * don't handle negative numbers at all sensibly. For that, use
332 * the @...2c@ variants. The functions are named after the
333 * truth tables they generate:
340 #define MP_BITBINOP(string) \
342 mp *mp_bit##string(mp *d, mp *a, mp *b) \
344 MP_DEST(d, MAX(MP_LEN(a), MP_LEN(b)), (a->f | b->f) & ~MP_NEG); \
345 mpx_bit##string(d->v, d->vl, a->v, a->vl, b->v, b->vl); \
346 d->f = (a->f | b->f) & MP_BURN; \
351 MPX_DOBIN(MP_BITBINOP
)
353 /* --- @mp_not@ --- *
355 * Arguments: @mp *d@ = destination
358 * Returns: The bitwise complement of the source.
361 mp
*mp_not(mp
*d
, mp
*a
)
363 MP_DEST(d
, MP_LEN(a
), a
->f
);
364 mpx_not(d
->v
, d
->vl
, a
->v
, a
->vl
);
365 d
->f
= a
->f
& MP_BURN
;
370 /* --- @mp_bitop2c@ --- *
372 * Arguments: @mp *d@ = destination
373 * @mp *a, *b@ = sources
375 * Returns: The result of the given bitwise operation. Negative numbers
376 * are treated as two's complement, sign-extended infinitely to
377 * the left. The functions are named after the truth tables
385 /* --- How this actually works --- *
387 * The two arguments are inverted (with a sign-swap) if they're currently
388 * negative. This means that we end up using a different function (one which
389 * reinverts as we go) for the main operation. Also, if the sign would be
390 * negative at the end, we preinvert the output and then invert again with a
393 * Start with: wxyz WXYZ
394 * If @a@ negative: yzwx or YZWX
395 * If @b@ negative: xwzy XWZY
396 * If both negative: zyxw ZYXW
399 #define MP_BIT2CBINOP(n, base, an, bn, abn, p_base, p_an, p_bn, p_abn) \
401 mp *mp_bit##n##2c(mp *d, mp *a, mp *b) \
403 if (!((a->f | b->f) & MP_NEG)) { /* Both positive */ \
404 d = mp_bit##base(d, a, b); \
406 } else if (!(b->f & MP_NEG)) { /* Only @b@ positive */ \
408 d = mp_not2c(d, a); \
409 d = mp_bit##an(d, d, b); \
412 } else if (!(a->f & MP_NEG)) { /* Only @a@ positive */ \
414 d = mp_not2c(d, b); \
415 d = mp_bit##bn(d, a, d); \
418 } else { /* Both negative */ \
419 mp *t = mp_not2c(MP_NEW, a); \
420 mp *d = mp_not2c(d, b); \
421 d = mp_bit##abn(d, t, d); \
428 #define NEG d = mp_not2c(d, d);
430 MP_BIT2CBINOP(0000, 0000, 0000, 0000, 0000, POS
, POS
, POS
, POS
)
431 MP_BIT2CBINOP(0001, 0001, 0100, 0010, 0111, POS
, POS
, POS
, NEG
)
432 MP_BIT2CBINOP(0010, 0010, 0111, 0001, 0100, POS
, NEG
, POS
, POS
)
433 MP_BIT2CBINOP(0011, 0011, 0011, 0011, 0011, POS
, NEG
, POS
, NEG
)
434 MP_BIT2CBINOP(0100, 0100, 0001, 0111, 0010, POS
, POS
, NEG
, POS
)
435 MP_BIT2CBINOP(0101, 0101, 0101, 0101, 0101, POS
, POS
, NEG
, NEG
)
436 MP_BIT2CBINOP(0110, 0110, 0110, 0110, 0110, POS
, NEG
, NEG
, POS
)
437 MP_BIT2CBINOP(0111, 0111, 0010, 0100, 0001, POS
, NEG
, NEG
, NEG
)
438 MP_BIT2CBINOP(1000, 0111, 0010, 0100, 0001, NEG
, POS
, POS
, POS
)
439 MP_BIT2CBINOP(1001, 0110, 0110, 0110, 0110, NEG
, POS
, POS
, NEG
)
440 MP_BIT2CBINOP(1010, 0101, 0101, 0101, 0101, NEG
, NEG
, POS
, POS
)
441 MP_BIT2CBINOP(1011, 0100, 0001, 0111, 0010, NEG
, NEG
, POS
, NEG
)
442 MP_BIT2CBINOP(1100, 0011, 0011, 0011, 0011, NEG
, POS
, NEG
, POS
)
443 MP_BIT2CBINOP(1101, 0010, 0111, 0001, 0100, NEG
, POS
, NEG
, NEG
)
444 MP_BIT2CBINOP(1110, 0001, 0100, 0010, 0111, NEG
, NEG
, NEG
, POS
)
445 MP_BIT2CBINOP(1111, 0000, 0000, 0000, 0000, NEG
, NEG
, NEG
, NEG
)
449 /* --- @mp_not2c@ --- *
451 * Arguments: @mp *d@ = destination
454 * Returns: The sign-extended complement of the argument.
457 mp
*mp_not2c(mp
*d
, mp
*a
)
461 MP_DEST(d
, MP_LEN(a
) + 1, a
->f
);
464 MPX_USUBN(d
->v
, d
->vl
, 1);
466 MPX_UADDN(d
->v
, d
->vl
, 1);
469 mpx_usub(d
->v
, d
->vl
, a
->v
, a
->vl
, &one
, &one
+ 1);
471 mpx_uadd(d
->v
, d
->vl
, a
->v
, a
->vl
, &one
, &one
+ 1);
473 d
->f
= (a
->f
& (MP_NEG
| MP_BURN
)) ^ MP_NEG
;
478 /* --- @mp_add@ --- *
480 * Arguments: @mp *d@ = destination
481 * @mp *a, *b@ = sources
483 * Returns: Result, @a@ added to @b@.
486 mp
*mp_add(mp
*d
, mp
*a
, mp
*b
)
488 MP_DEST(d
, MAX(MP_LEN(a
), MP_LEN(b
)) + 1, a
->f
| b
->f
);
489 if (!((a
->f
^ b
->f
) & MP_NEG
))
490 mpx_uadd(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
);
492 if (MPX_UCMP(a
->v
, a
->vl
, <, b
->v
, b
->vl
)) {
493 mp
*t
= a
; a
= b
; b
= t
;
495 mpx_usub(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
);
497 d
->f
= ((a
->f
| b
->f
) & MP_BURN
) | (a
->f
& MP_NEG
);
502 /* --- @mp_sub@ --- *
504 * Arguments: @mp *d@ = destination
505 * @mp *a, *b@ = sources
507 * Returns: Result, @b@ subtracted from @a@.
510 mp
*mp_sub(mp
*d
, mp
*a
, mp
*b
)
513 MP_DEST(d
, MAX(MP_LEN(a
), MP_LEN(b
)) + 1, a
->f
| b
->f
);
514 if ((a
->f
^ b
->f
) & MP_NEG
)
515 mpx_uadd(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
);
517 if (MPX_UCMP(a
->v
, a
->vl
, <, b
->v
, b
->vl
)) {
518 mp
*t
= a
; a
= b
; b
= t
;
521 mpx_usub(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
);
523 d
->f
= ((a
->f
| b
->f
) & MP_BURN
) | ((a
->f
^ sgn
) & MP_NEG
);
528 /* --- @mp_mul@ --- *
530 * Arguments: @mp *d@ = destination
531 * @mp *a, *b@ = sources
533 * Returns: Result, @a@ multiplied by @b@.
536 mp
*mp_mul(mp
*d
, mp
*a
, mp
*b
)
541 if (MP_LEN(a
) <= MPK_THRESH
|| MP_LEN(b
) <= MPK_THRESH
) {
542 MP_DEST(d
, MP_LEN(a
) + MP_LEN(b
), a
->f
| b
->f
| MP_UNDEF
);
543 mpx_umul(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
);
545 size_t m
= MAX(MP_LEN(a
), MP_LEN(b
));
547 MP_DEST(d
, 3 * m
, a
->f
| b
->f
| MP_UNDEF
);
548 s
= mpalloc(d
->a
, 5 * m
);
549 mpx_kmul(d
->v
, d
->vl
, a
->v
, a
->vl
, b
->v
, b
->vl
, s
, s
+ 5 * m
);
553 d
->f
= ((a
->f
| b
->f
) & MP_BURN
) | ((a
->f
^ b
->f
) & MP_NEG
);
560 /* --- @mp_sqr@ --- *
562 * Arguments: @mp *d@ = destination
565 * Returns: Result, @a@ squared.
568 mp
*mp_sqr(mp
*d
, mp
*a
)
570 size_t m
= MP_LEN(a
);
573 if (m
> MPK_THRESH
) {
575 MP_DEST(d
, 3 * m
, a
->f
| MP_UNDEF
);
576 s
= mpalloc(d
->a
, 5 * m
);
577 mpx_ksqr(d
->v
, d
->vl
, a
->v
, a
->vl
, s
, s
+ 5 * m
);
580 MP_DEST(d
, 2 * m
+ 2, a
->f
| MP_UNDEF
);
581 mpx_usqr(d
->v
, d
->vl
, a
->v
, a
->vl
);
583 d
->f
= a
->f
& MP_BURN
;
589 /* --- @mp_div@ --- *
591 * Arguments: @mp **qq, **rr@ = destination, quotient and remainder
592 * @mp *a, *b@ = sources
594 * Use: Calculates the quotient and remainder when @a@ is divided by
595 * @b@. The destinations @*qq@ and @*rr@ must be distinct.
596 * Either of @qq@ or @rr@ may be null to indicate that the
597 * result is irrelevant. (Discarding both results is silly.)
598 * There is a performance advantage if @a == *rr@.
600 * The behaviour when @a@ and @b@ have the same sign is
601 * straightforward. When the signs differ, this implementation
602 * chooses @r@ to have the same sign as @b@, rather than the
603 * more normal choice that the remainder has the same sign as
604 * the dividend. This makes modular arithmetic a little more
608 void mp_div(mp
**qq
, mp
**rr
, mp
*a
, mp
*b
)
610 mp
*r
= rr ?
*rr
: MP_NEW
;
611 mp
*q
= qq ?
*qq
: MP_NEW
;
614 /* --- Set the remainder up right --- *
616 * Just in case the divisor is larger, be able to cope with this. It's not
617 * important in @mpx_udiv@, but it is here because of the sign correction.
625 MP_DEST(r
, MP_LEN(b
) + 2, a
->f
| b
->f
);
627 /* --- Fix up the quotient too --- */
630 MP_DEST(q
, MP_LEN(r
), r
->f
| MP_UNDEF
);
633 /* --- Set up some temporary workspace --- */
636 size_t rq
= MP_LEN(b
) + 1;
637 sv
= mpalloc(r
->a
, rq
);
641 /* --- Perform the calculation --- */
643 mpx_udiv(q
->v
, q
->vl
, r
->v
, r
->vl
, b
->v
, b
->vl
, sv
, svl
);
645 /* --- Sort out the sign of the results --- *
647 * If the signs of the arguments differ, and the remainder is nonzero, I
648 * must add one to the absolute value of the quotient and subtract the
649 * remainder from @b@.
652 q
->f
= ((r
->f
| b
->f
) & MP_BURN
) | ((r
->f
^ b
->f
) & MP_NEG
);
655 for (v
= r
->v
; v
< r
->vl
; v
++) {
657 MPX_UADDN(q
->v
, q
->vl
, 1);
658 mpx_usub(r
->v
, r
->vl
, b
->v
, b
->vl
, r
->v
, r
->vl
);
664 r
->f
= ((r
->f
| b
->f
) & MP_BURN
) | (b
->f
& MP_NEG
);
666 /* --- Store the return values --- */
686 /* --- @mp_odd@ --- *
688 * Arguments: @mp *d@ = pointer to destination integer
689 * @mp *m@ = pointer to source integer
690 * @size_t *s@ = where to store the power of 2
692 * Returns: An odd integer integer %$t$% such that %$m = 2^s t$%.
694 * Use: Computes a power of two and an odd integer which, when
695 * multiplied, give a specified result. This sort of thing is
696 * useful in number theory quite often.
699 mp
*mp_odd(mp
*d
, mp
*m
, size_t *s
)
706 for (; !*v
&& v
< vl
; v
++)
713 unsigned z
= MPW_BITS
/ 2;
726 return (mp_lsr(d
, m
, ss
));
729 /*----- Test rig ----------------------------------------------------------*/
733 static int verify(const char *op
, mp
*expect
, mp
*result
, mp
*a
, mp
*b
)
735 if (!MP_EQ(expect
, result
)) {
736 fprintf(stderr
, "\n*** %s failed", op
);
737 fputs("\n*** a = ", stderr
); mp_writefile(a
, stderr
, 10);
738 fputs("\n*** b = ", stderr
); mp_writefile(b
, stderr
, 10);
739 fputs("\n*** result = ", stderr
); mp_writefile(result
, stderr
, 10);
740 fputs("\n*** expect = ", stderr
); mp_writefile(expect
, stderr
, 10);
747 #define RIG(name, op) \
748 static int t##name(dstr *v) \
750 mp *a = *(mp **)v[0].buf; \
751 mpw n = *(int *)v[1].buf; \
753 mp *r = *(mp **)v[2].buf; \
754 mp *c = op(MP_NEW, a, n); \
756 mp_build(&b, &n, &n + 1); \
757 ok = verify(#name, r, c, a, &b); \
758 mp_drop(a); mp_drop(c); mp_drop(r); \
759 assert(mparena_count(MPARENA_GLOBAL) == 0); \
770 #define RIG(name, op) \
771 static int t##name(dstr *v) \
773 mp *a = *(mp **)v[0].buf; \
774 mp *b = *(mp **)v[1].buf; \
775 mp *r = *(mp **)v[2].buf; \
776 mp *c = op(MP_NEW, a, b); \
777 int ok = verify(#name, r, c, a, b); \
778 mp_drop(a); mp_drop(b); mp_drop(c); mp_drop(r); \
779 assert(mparena_count(MPARENA_GLOBAL) == 0); \
789 static int tdiv(dstr
*v
)
791 mp
*a
= *(mp
**)v
[0].buf
;
792 mp
*b
= *(mp
**)v
[1].buf
;
793 mp
*q
= *(mp
**)v
[2].buf
;
794 mp
*r
= *(mp
**)v
[3].buf
;
795 mp
*c
= MP_NEW
, *d
= MP_NEW
;
797 mp_div(&c
, &d
, a
, b
);
798 ok
&= verify("div(quotient)", q
, c
, a
, b
);
799 ok
&= verify("div(remainder)", r
, d
, a
, b
);
800 mp_drop(a
); mp_drop(b
); mp_drop(c
); mp_drop(d
); mp_drop(r
); mp_drop(q
);
801 assert(mparena_count(MPARENA_GLOBAL
) == 0);
805 static int tbin(dstr
*v
)
807 static mp
*(*fn
[])(mp
*, mp
*, mp
*) = {
808 #define DO(string) mp_bit##string##2c,
814 mp
*a
= *(mp
**)v
[1].buf
;
815 mp
*b
= *(mp
**)v
[2].buf
;
816 mp
*r
= *(mp
**)v
[3].buf
;
819 if (strcmp(v
[0].buf
, "and") == 0) op
= 1;
820 else if (strcmp(v
[0].buf
, "or") == 0) op
= 7;
821 else if (strcmp(v
[0].buf
, "nand") == 0) op
= 14;
822 else if (strcmp(v
[0].buf
, "nor") == 0) op
= 8;
823 else if (strcmp(v
[0].buf
, "xor") == 0) op
= 6;
833 c
= fn
[op
](MP_NEW
, a
, b
);
834 ok
= verify(v
[0].buf
, r
, c
, a
, b
);
835 mp_drop(a
); mp_drop(b
); mp_drop(r
); mp_drop(c
);
836 assert(mparena_count(MPARENA_GLOBAL
) == 0);
840 static int tset(dstr
*v
)
842 mp
*a
= *(mp
**)v
[0].buf
;
843 unsigned long n
= *(unsigned long *)v
[1].buf
;
844 mp
*r
= *(mp
**)v
[2].buf
;
848 c
= mp_setbit2c(MP_NEW
, a
, n
);
851 fprintf(stderr
, "\n***setbit (set) failed");
852 fputs("\n*** a = ", stderr
); mp_writefile(a
, stderr
, 16);
853 fprintf(stderr
, "\n*** n = %lu", n
);
854 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 16);
855 fputs("\n*** c = ", stderr
); mp_writefile(c
, stderr
, 16);
858 if (!mp_testbit2c(r
, n
)) {
860 fprintf(stderr
, "\n***setbit (test) failed");
861 fprintf(stderr
, "\n*** n = %lu", n
);
862 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 16);
868 assert(mparena_count(MPARENA_GLOBAL
) == 0);
872 static int tclr(dstr
*v
)
874 mp
*a
= *(mp
**)v
[0].buf
;
875 unsigned long n
= *(unsigned long *)v
[1].buf
;
876 mp
*r
= *(mp
**)v
[2].buf
;
880 c
= mp_clearbit2c(MP_NEW
, a
, n
);
883 fprintf(stderr
, "\n***clrbit (set) failed");
884 fputs("\n*** a = ", stderr
); mp_writefile(a
, stderr
, 16);
885 fprintf(stderr
, "\n*** n = %lu", n
);
886 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 16);
887 fputs("\n*** c = ", stderr
); mp_writefile(c
, stderr
, 16);
890 if (mp_testbit2c(r
, n
)) {
892 fprintf(stderr
, "\n***clrbit (test) failed");
893 fprintf(stderr
, "\n*** n = %lu", n
);
894 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 16);
900 assert(mparena_count(MPARENA_GLOBAL
) == 0);
904 static int tneg(dstr
*v
)
906 mp
*a
= *(mp
**)v
[0].buf
;
907 mp
*r
= *(mp
**)v
[1].buf
;
909 mp
*n
= mp_neg(MP_NEW
, a
);
912 fprintf(stderr
, "\n*** neg failed\n");
913 fputs("\n*** a = ", stderr
); mp_writefile(a
, stderr
, 10);
914 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 10);
915 fputs("\n*** n = ", stderr
); mp_writefile(n
, stderr
, 10);
922 fprintf(stderr
, "\n*** neg failed\n");
923 fputs("\n*** a* = ", stderr
); mp_writefile(a
, stderr
, 10);
924 fputs("\n*** r = ", stderr
); mp_writefile(r
, stderr
, 10);
925 fputs("\n*** n = ", stderr
); mp_writefile(n
, stderr
, 10);
930 assert(mparena_count(MPARENA_GLOBAL
) == 0);
934 static int todd(dstr
*v
)
936 mp
*a
= *(mp
**)v
[0].buf
;
937 size_t rs
= *(uint32
*)v
[1].buf
;
938 mp
*rt
= *(mp
**)v
[2].buf
;
942 t
= mp_odd(MP_NEW
, a
, &s
);
943 if (s
!= rs
|| !MP_EQ(t
, rt
)) {
945 fprintf(stderr
, "\n*** odd failed");
946 fputs("\n*** a = ", stderr
); mp_writefile(a
, stderr
, 10);
947 fprintf(stderr
, "\n*** s = %lu", (unsigned long)s
);
948 fputs("\n*** t = ", stderr
); mp_writefile(t
, stderr
, 10);
949 fprintf(stderr
, "\n*** rs = %lu", (unsigned long)rs
);
950 fputs("\n*** rt = ", stderr
); mp_writefile(rt
, stderr
, 10);
956 assert(mparena_count(MPARENA_GLOBAL
) == 0);
960 static test_chunk tests
[] = {
961 { "lsl", tlsl
, { &type_mp
, &type_int
, &type_mp
, 0 } },
962 { "lsr", tlsr
, { &type_mp
, &type_int
, &type_mp
, 0 } },
963 { "lsl2c", tlsl2c
, { &type_mp
, &type_int
, &type_mp
, 0 } },
964 { "lsr2c", tlsr2c
, { &type_mp
, &type_int
, &type_mp
, 0 } },
965 { "setbit", tset
, { &type_mp
, &type_ulong
, &type_mp
, 0 } },
966 { "clrbit", tclr
, { &type_mp
, &type_ulong
, &type_mp
, 0 } },
967 { "add", tadd
, { &type_mp
, &type_mp
, &type_mp
, 0 } },
968 { "sub", tsub
, { &type_mp
, &type_mp
, &type_mp
, 0 } },
969 { "mul", tmul
, { &type_mp
, &type_mp
, &type_mp
, 0 } },
970 { "div", tdiv
, { &type_mp
, &type_mp
, &type_mp
, &type_mp
, 0 } },
971 { "bin2c", tbin
, { &type_string
, &type_mp
, &type_mp
, &type_mp
, 0 } },
972 { "odd", todd
, { &type_mp
, &type_uint32
, &type_mp
, 0 } },
973 { "neg", tneg
, { &type_mp
, &type_mp
, 0 } },
977 int main(int argc
, char *argv
[])
980 test_run(argc
, argv
, tests
, SRCDIR
"/tests/mp");
986 /*----- That's all, folks -------------------------------------------------*/