2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_GROW_C
|
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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* 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.
|
|
|
|
*/
|
2017-10-15 17:58:35 +00:00
|
|
|
tmp = OPT_CAST(mp_digit) XREALLOC(a->dp, sizeof(mp_digit) * (size_t)size);
|
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
|
2005-08-01 16:37:28 +00:00
|
|
|
|
2017-08-28 14:27:26 +00:00
|
|
|
/* ref: $Format:%D$ */
|
|
|
|
/* git commit: $Format:%H$ */
|
|
|
|
/* commit time: $Format:%ai$ */
|