libtommath/mp_mod.c

32 lines
654 B
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_MOD_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
/* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */
mp_err mp_mod(const mp_int *a, const mp_int *b, mp_int *c)
2003-02-28 16:08:34 +00:00
{
2017-08-30 17:11:35 +00:00
mp_int t;
2019-05-19 15:16:13 +00:00
mp_err err;
2003-02-28 16:08:34 +00:00
2019-05-19 15:16:13 +00:00
if ((err = mp_init_size(&t, b->used)) != MP_OKAY) {
return err;
2017-08-30 17:11:35 +00:00
}
2003-02-28 16:08:34 +00:00
2019-05-19 15:16:13 +00:00
if ((err = mp_div(a, b, NULL, &t)) != MP_OKAY) {
2019-05-29 10:23:08 +00:00
goto LBL_ERR;
2017-08-30 17:11:35 +00:00
}
2003-02-28 16:08:34 +00:00
if (MP_IS_ZERO(&t) || (t.sign == b->sign)) {
2019-05-19 15:16:13 +00:00
err = MP_OKAY;
2017-08-30 17:11:35 +00:00
mp_exch(&t, c);
} else {
2019-05-19 15:16:13 +00:00
err = mp_add(b, &t, c);
2017-08-30 17:11:35 +00:00
}
2003-02-28 16:08:34 +00:00
2019-05-29 10:23:08 +00:00
LBL_ERR:
2017-08-30 17:11:35 +00:00
mp_clear(&t);
2019-05-19 15:16:13 +00:00
return err;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif