libtommath/bn_mp_grow.c

44 lines
1.2 KiB
C
Raw Normal View History

#include "tommath_private.h"
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_GROW_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
/* grow as required */
2017-08-30 17:07:12 +00:00
int mp_grow(mp_int *a, int size)
2003-02-28 16:08:34 +00:00
{
2017-08-29 20:23:48 +00:00
int i;
mp_digit *tmp;
2003-09-19 22:43:07 +00:00
2017-08-29 20:23:48 +00:00
/* if the alloc size is smaller alloc more ram */
if (a->alloc < size) {
/* ensure there are always at least MP_PREC digits extra on top */
size += (MP_PREC * 2) - (size % MP_PREC);
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
/* reallocate the array a->dp
*
* We store the return in a temporary variable
* in case the operation failed we don't want
* to overwrite the dp member of a.
*/
tmp = (mp_digit *) XREALLOC(a->dp,
2019-04-06 15:37:48 +00:00
(size_t)a->alloc * sizeof(mp_digit),
(size_t)size * sizeof(mp_digit));
2017-08-29 20:23:48 +00:00
if (tmp == NULL) {
/* reallocation failed but "a" is still valid [can be freed] */
return MP_MEM;
}
2003-02-28 16:08:34 +00:00
2017-08-29 20:23:48 +00:00
/* reallocation succeeded so set a->dp */
a->dp = tmp;
2003-09-19 22:43:07 +00:00
2017-08-29 20:23:48 +00:00
/* zero excess digits */
i = a->alloc;
a->alloc = size;
for (; i < a->alloc; i++) {
a->dp[i] = 0;
}
}
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif