/src/dropbear/libtommath/bn_mp_mod.c
Line | Count | Source (jump to first uncovered line) |
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 | | |
6 | | /* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */ |
7 | | mp_err mp_mod(const mp_int *a, const mp_int *b, mp_int *c) |
8 | 0 | { |
9 | 0 | mp_int t; |
10 | 0 | mp_err err; |
11 | |
|
12 | 0 | if ((err = mp_init_size(&t, b->used)) != MP_OKAY) { |
13 | 0 | return err; |
14 | 0 | } |
15 | | |
16 | 0 | if ((err = mp_div(a, b, NULL, &t)) != MP_OKAY) { |
17 | 0 | goto LBL_ERR; |
18 | 0 | } |
19 | | |
20 | 0 | if (MP_IS_ZERO(&t) || (t.sign == b->sign)) { |
21 | 0 | err = MP_OKAY; |
22 | 0 | mp_exch(&t, c); |
23 | 0 | } else { |
24 | 0 | err = mp_add(b, &t, c); |
25 | 0 | } |
26 | |
|
27 | 0 | LBL_ERR: |
28 | 0 | mp_clear(&t); |
29 | 0 | return err; |
30 | 0 | } |
31 | | #endif |