libtommath/mp_div_2.c

43 lines
912 B
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_DIV_2_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
/* b = a/2 */
mp_err mp_div_2(const mp_int *a, mp_int *b)
2003-02-28 16:08:34 +00:00
{
int x, oldused;
mp_digit r;
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
if (b->alloc < a->used) {
mp_err err;
2019-05-19 15:16:13 +00:00
if ((err = mp_grow(b, a->used)) != MP_OKAY) {
return err;
2017-08-29 20:23:48 +00:00
}
}
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
oldused = b->used;
b->used = a->used;
2003-02-28 16:09:08 +00:00
2019-05-25 18:54:49 +00:00
/* carry */
r = 0;
for (x = b->used; x --> 0;) {
2019-05-25 18:54:49 +00:00
/* get the carry for the next iteration */
mp_digit rr = a->dp[x] & 1u;
2003-05-17 12:33:54 +00:00
2019-05-25 18:54:49 +00:00
/* shift the current digit, add in carry and store */
b->dp[x] = (a->dp[x] >> 1) | (r << (MP_DIGIT_BIT - 1));
2003-05-17 12:33:54 +00:00
2019-05-25 18:54:49 +00:00
/* forward carry to next iteration */
r = rr;
2017-08-29 20:23:48 +00:00
}
2019-05-25 18:54:49 +00:00
/* zero excess digits */
s_mp_zero_digs(b->dp + b->used, oldused - b->used);
2019-05-25 18:54:49 +00:00
2017-08-29 20:23:48 +00:00
b->sign = a->sign;
mp_clamp(b);
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif