more constify
This commit is contained in:
parent
f674018a41
commit
d293ab6604
@ -19,7 +19,7 @@
|
||||
* see http://gmplib.org/manual/Integer-Import-and-Export.html
|
||||
*/
|
||||
int mp_export(void *rop, size_t *countp, int order, size_t size,
|
||||
int endian, size_t nails, mp_int *op)
|
||||
int endian, size_t nails, const mp_int *op)
|
||||
{
|
||||
int result;
|
||||
size_t odd_nails, nail_bytes, i, j, bits, count;
|
||||
|
@ -19,7 +19,7 @@
|
||||
* precomputed via mp_reduce_setup.
|
||||
* From HAC pp.604 Algorithm 14.42
|
||||
*/
|
||||
int mp_reduce(mp_int *x, const mp_int *m, mp_int *mu)
|
||||
int mp_reduce(mp_int *x, const mp_int *m, const mp_int *mu)
|
||||
{
|
||||
mp_int q;
|
||||
int res, um = m->used;
|
||||
|
@ -19,7 +19,7 @@
|
||||
This differs from reduce_2k since "d" can be larger
|
||||
than a single digit.
|
||||
*/
|
||||
int mp_reduce_2k_l(mp_int *a, const mp_int *n, mp_int *d)
|
||||
int mp_reduce_2k_l(mp_int *a, const mp_int *n, const mp_int *d)
|
||||
{
|
||||
mp_int q;
|
||||
int p, res;
|
||||
|
@ -25,7 +25,7 @@ int s_mp_exptmod(const mp_int *G, const mp_int *X, const mp_int *P, mp_int *Y, i
|
||||
mp_int M[TAB_SIZE], res, mu;
|
||||
mp_digit buf;
|
||||
int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize;
|
||||
int (*redux)(mp_int *,const mp_int *,mp_int *);
|
||||
int (*redux)(mp_int *, const mp_int *, const mp_int *);
|
||||
|
||||
/* find window size */
|
||||
x = mp_count_bits(X);
|
||||
|
@ -250,7 +250,7 @@ void mp_clamp(mp_int *a);
|
||||
int mp_import(mp_int *rop, size_t count, int order, size_t size, int endian, size_t nails, const void *op);
|
||||
|
||||
/* export binary data */
|
||||
int mp_export(void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, mp_int *op);
|
||||
int mp_export(void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, const mp_int *op);
|
||||
|
||||
/* ---> digit manipulation <--- */
|
||||
|
||||
@ -408,7 +408,7 @@ int mp_reduce_setup(mp_int *a, const mp_int *b);
|
||||
* Assumes that 0 < a <= b*b, note if 0 > a > -(b*b) then you can merely
|
||||
* compute the reduction as -1 * mp_reduce(mp_abs(a)) [pseudo code].
|
||||
*/
|
||||
int mp_reduce(mp_int *a, const mp_int *b, mp_int *c);
|
||||
int mp_reduce(mp_int *a, const mp_int *b, const mp_int *c);
|
||||
|
||||
/* setups the montgomery reduction */
|
||||
int mp_montgomery_setup(const mp_int *a, mp_digit *mp);
|
||||
@ -446,7 +446,7 @@ int mp_reduce_is_2k_l(const mp_int *a);
|
||||
int mp_reduce_2k_setup_l(const mp_int *a, mp_int *d);
|
||||
|
||||
/* reduces a modulo b where b is of the form 2**p - k [0 <= a] */
|
||||
int mp_reduce_2k_l(mp_int *a, const mp_int *n, mp_int *d);
|
||||
int mp_reduce_2k_l(mp_int *a, const mp_int *n, const mp_int *d);
|
||||
|
||||
/* d = a**b (mod c) */
|
||||
int mp_exptmod(const mp_int *a, const mp_int *b, const mp_int *c, mp_int *d);
|
||||
|
Loading…
Reference in New Issue
Block a user