tommath/bn_mp_mod.c

49 lines
1.1 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_MOD_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
/* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */
2003-02-28 11:08:34 -05:00
int
mp_mod (mp_int * a, mp_int * b, mp_int * c)
{
2003-02-28 11:09:08 -05:00
mp_int t;
int res;
2003-02-28 11:08:34 -05:00
if ((res = mp_init (&t)) != MP_OKAY) {
return res;
}
if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) {
mp_clear (&t);
return res;
}
if ((mp_iszero(&t) != MP_NO) || (t.sign == b->sign)) {
2003-02-28 11:08:34 -05:00
res = MP_OKAY;
mp_exch (&t, c);
} else {
res = mp_add (b, &t, c);
2003-02-28 11:08:34 -05:00
}
mp_clear (&t);
return res;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */