diff options
| author | FdaSilvaYY <fdasilvayy@gmail.com> | 2016-06-28 22:51:01 +0200 |
|---|---|---|
| committer | Rich Salz <rsalz@openssl.org> | 2016-06-29 09:56:39 -0400 |
| commit | 02e112a88579ff2592f34015f73dc85f4ed76ad5 (patch) | |
| tree | e99d5fa28c3dbc7b35eda5bce012dd57f6d86267 /crypto/bn | |
| parent | 0517ffc47c79136ba09fb34400e9e26c539615d1 (diff) | |
| download | openssl-02e112a88579ff2592f34015f73dc85f4ed76ad5.zip openssl-02e112a88579ff2592f34015f73dc85f4ed76ad5.tar.gz openssl-02e112a88579ff2592f34015f73dc85f4ed76ad5.tar.bz2 | |
Whitespace cleanup in crypto
Reviewed-by: Andy Polyakov <appro@openssl.org>
Reviewed-by: Kurt Roeckx <kurt@openssl.org>
Reviewed-by: Rich Salz <rsalz@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/1264)
Diffstat (limited to 'crypto/bn')
| -rw-r--r-- | crypto/bn/bn_div.c | 2 | ||||
| -rw-r--r-- | crypto/bn/bn_exp.c | 2 | ||||
| -rw-r--r-- | crypto/bn/bn_gcd.c | 4 | ||||
| -rw-r--r-- | crypto/bn/bn_prime.c | 2 |
4 files changed, 5 insertions, 5 deletions
diff --git a/crypto/bn/bn_div.c b/crypto/bn/bn_div.c index eef1b87..0bec12b 100644 --- a/crypto/bn/bn_div.c +++ b/crypto/bn/bn_div.c @@ -130,7 +130,7 @@ int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, # endif /* OPENSSL_NO_ASM */ /*- - * BN_div computes dv := num / divisor, rounding towards + * BN_div computes dv := num / divisor, rounding towards * zero, and sets up rm such that dv*divisor + rm = num holds. * Thus: * dv->neg == num->neg ^ divisor->neg (unless the result is zero) diff --git a/crypto/bn/bn_exp.c b/crypto/bn/bn_exp.c index d334cf7..e2f0d5e 100644 --- a/crypto/bn/bn_exp.c +++ b/crypto/bn/bn_exp.c @@ -97,7 +97,7 @@ int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m, bn_check_top(m); /*- - * For even modulus m = 2^k*m_odd, it might make sense to compute + * For even modulus m = 2^k*m_odd, it might make sense to compute * a^p mod m_odd and a^p mod 2^k separately (with Montgomery * exponentiation for the odd part), using appropriate exponent * reductions, and combine the results using the CRT. diff --git a/crypto/bn/bn_gcd.c b/crypto/bn/bn_gcd.c index 1039e76..e1aac13 100644 --- a/crypto/bn/bn_gcd.c +++ b/crypto/bn/bn_gcd.c @@ -370,7 +370,7 @@ BIGNUM *int_bn_mod_inverse(BIGNUM *in, * i.e. * sign*(Y + D*X)*a == B (mod |n|). * - * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at + * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at * -sign*X*a == B (mod |n|), * sign*Y*a == A (mod |n|). * Note that X and Y stay non-negative all the time. @@ -565,7 +565,7 @@ static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in, * i.e. * sign*(Y + D*X)*a == B (mod |n|). * - * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at + * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at * -sign*X*a == B (mod |n|), * sign*Y*a == A (mod |n|). * Note that X and Y stay non-negative all the time. diff --git a/crypto/bn/bn_prime.c b/crypto/bn/bn_prime.c index 1c41938..8e7f4f5 100644 --- a/crypto/bn/bn_prime.c +++ b/crypto/bn/bn_prime.c @@ -430,7 +430,7 @@ static int probable_prime(BIGNUM *rnd, int bits, prime_t *mods) */ if (is_single_word) { BN_ULONG size_limit; - + if (bits == BN_BITS2) { /* * Shifting by this much has undefined behaviour so we do it a |