-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathpb_grow.c
48 lines (40 loc) · 1.14 KB
/
pb_grow.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/* LibTomPoly, Polynomial Basis Math -- Tom St Denis
*
* LibTomPoly is a public domain library that provides
* polynomial basis arithmetic support. It relies on
* LibTomMath for large integer support.
*
* This library is free for all purposes without any
* express guarantee that it works.
*
* Tom St Denis, [email protected], http://poly.libtomcrypt.org
*/
#include <tompoly.h>
#include <stdlib.h>
#include <string.h>
int pb_grow(pb_poly *a, int size)
{
mp_int *tmp;
int x, err;
if (a->alloc < size) {
/* pad size upwards */
size += (PB_TERMS - (size % PB_TERMS));
/* regrow terms */
tmp = realloc(a->terms, sizeof(mp_int) * size);
if (tmp == NULL) {
return MP_MEM;
}
a->terms = tmp;
/* zero the new stuff (prevents mp_clear from double freeing) */
memset(a->terms + a->alloc, 0, (size - a->alloc) * sizeof(mp_int));
/* now init the terms */
for (x = a->alloc; x < size; x++) {
if ((err = mp_init(&(a->terms[x]))) != MP_OKAY) {
return err;
}
}
/* update info */
a->alloc = size;
}
return MP_OKAY;
}