diff options
| author | Rich Salz <rsalz@akamai.com> | 2016-01-23 13:23:25 -0500 |
|---|---|---|
| committer | Rich Salz <rsalz@openssl.org> | 2016-01-27 19:10:13 -0500 |
| commit | b4f35e5e07afa2df7125b814b45242648b33e39e (patch) | |
| tree | b34236be3ec44cd00d7ae3b2e27f9f254e91a011 /crypto/bn/bn_prime.c | |
| parent | 3e9e810f2e047effb1056211794d2d12ec2b04e7 (diff) | |
Remove EIGHT_BIT and SIXTEEN_BIT
Also cleaned up bn_prime.pl to current coding style.
Reviewed-by: Andy Polyakov <appro@openssl.org>
Diffstat (limited to 'crypto/bn/bn_prime.c')
| -rw-r--r-- | crypto/bn/bn_prime.c | 8 |
1 files changed, 2 insertions, 6 deletions
diff --git a/crypto/bn/bn_prime.c b/crypto/bn/bn_prime.c index 7d210d37cf..8d1294fcfc 100644 --- a/crypto/bn/bn_prime.c +++ b/crypto/bn/bn_prime.c @@ -115,18 +115,14 @@ #include <openssl/rand.h> /* - * NB: these functions have been "upgraded", the deprecated versions (which - * are compatibility wrappers using these functions) are in bn_depr.c. - - * Geoff - */ - -/* * The quick sieve algorithm approach to weeding out primes is Philip * Zimmermann's, as implemented in PGP. I have had a read of his comments * and implemented my own version. */ #include "bn_prime.h" +#define NUMPRIMES OSSL_NELEM(primes) + static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1, const BIGNUM *a1_odd, int k, BN_CTX *ctx, BN_MONT_CTX *mont); |