summaryrefslogtreecommitdiff
path: root/security/nss/lib/freebl/mpi/mpprime.h
diff options
context:
space:
mode:
authornelsonb%netscape.com <devnull@localhost>2000-07-22 05:36:45 +0000
committernelsonb%netscape.com <devnull@localhost>2000-07-22 05:36:45 +0000
commit5733ab82d90525eadcdb8d35b7630365689009c7 (patch)
tree31730887f0b2b60a0f4baa3e59a25b48f1eef124 /security/nss/lib/freebl/mpi/mpprime.h
parent985554e153826d3b2eff22e0e94f1bf8bfdadaf8 (diff)
downloadnss-hg-5733ab82d90525eadcdb8d35b7630365689009c7.tar.gz
Use large prime table for faster prime gen. Make prime table "const".
Change functions that use prime table to use const arguments.
Diffstat (limited to 'security/nss/lib/freebl/mpi/mpprime.h')
-rw-r--r--security/nss/lib/freebl/mpi/mpprime.h5
1 files changed, 3 insertions, 2 deletions
diff --git a/security/nss/lib/freebl/mpi/mpprime.h b/security/nss/lib/freebl/mpi/mpprime.h
index 617334d42..2ded6dcd5 100644
--- a/security/nss/lib/freebl/mpi/mpprime.h
+++ b/security/nss/lib/freebl/mpi/mpprime.h
@@ -42,7 +42,8 @@
#include "mpi.h"
-extern int prime_tab_size; /* number of primes available */
+extern const int prime_tab_size; /* number of primes available */
+extern const mp_digit prime_tab[];
/* Tests for divisibility */
mp_err mpp_divis(mp_int *a, mp_int *b);
@@ -53,7 +54,7 @@ mp_err mpp_random(mp_int *a);
mp_err mpp_random_size(mp_int *a, mp_size prec);
/* Pseudo-primality testing */
-mp_err mpp_divis_vector(mp_int *a, mp_digit *vec, int size, int *which);
+mp_err mpp_divis_vector(mp_int *a, const mp_digit *vec, int size, int *which);
mp_err mpp_divis_primes(mp_int *a, mp_digit *np);
mp_err mpp_fermat(mp_int *a, mp_digit w);
mp_err mpp_pprime(mp_int *a, int nt);