bn_mp_mod.c 657 B

12345678910111213141516171819202122232425262728293031
  1. #include "tommath_private.h"
  2. #ifdef BN_MP_MOD_C
  3. /* LibTomMath, multiple-precision integer library -- Tom St Denis */
  4. /* SPDX-License-Identifier: Unlicense */
  5. /* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */
  6. mp_err mp_mod(const mp_int *a, const mp_int *b, mp_int *c)
  7. {
  8. mp_int t;
  9. mp_err err;
  10. if ((err = mp_init_size(&t, b->used)) != MP_OKAY) {
  11. return err;
  12. }
  13. if ((err = mp_div(a, b, NULL, &t)) != MP_OKAY) {
  14. goto LBL_ERR;
  15. }
  16. if (MP_IS_ZERO(&t) || (t.sign == b->sign)) {
  17. err = MP_OKAY;
  18. mp_exch(&t, c);
  19. } else {
  20. err = mp_add(b, &t, c);
  21. }
  22. LBL_ERR:
  23. mp_clear(&t);
  24. return err;
  25. }
  26. #endif