tommath/bn_mp_grow.c

54 lines
1.4 KiB
C
Raw Normal View History

2003-02-28 16:08:34 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 16:08:34 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-02-28 16:08:34 +00:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2003-03-13 02:11:11 +00:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 16:08:34 +00:00
*/
#include <tommath.h>
/* grow as required */
int
mp_grow (mp_int * a, int size)
{
2003-05-17 12:33:54 +00:00
int i;
2003-09-19 22:43:07 +00:00
mp_digit *tmp;
2003-02-28 16:08:34 +00:00
/* if the alloc size is smaller alloc more ram */
if (a->alloc < size) {
2003-03-29 18:16:01 +00:00
/* ensure there are always at least MP_PREC digits extra on top */
2003-09-19 22:43:07 +00:00
size += (MP_PREC * 2) - (size % MP_PREC);
2003-02-28 16:08:34 +00:00
2003-09-19 22:43:07 +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 = OPT_CAST realloc (a->dp, sizeof (mp_digit) * size);
if (tmp == NULL) {
/* reallocation failed but "a" is still valid [can be freed] */
2003-02-28 16:08:34 +00:00
return MP_MEM;
}
2003-09-19 22:43:07 +00:00
/* reallocation succeeded so set a->dp */
a->dp = tmp;
2003-03-29 18:16:01 +00:00
/* zero excess digits */
2003-05-17 12:33:54 +00:00
i = a->alloc;
2003-02-28 16:08:34 +00:00
a->alloc = size;
2003-05-17 12:33:54 +00:00
for (; i < a->alloc; i++) {
2003-02-28 16:08:34 +00:00
a->dp[i] = 0;
}
}
return MP_OKAY;
}