From cbe952418376a25acd872db4281a0b09735001f1 Mon Sep 17 00:00:00 2001 From: FdaSilvaYY Date: Thu, 10 Nov 2016 01:16:27 +0100 Subject: [PATCH] Refomat a few comments on 80 cols Reviewed-by: Andy Polyakov Reviewed-by: Rich Salz (Merged from https://github.com/openssl/openssl/pull/3066) --- crypto/bn/bn_gcd.c | 12 ++++-------- 1 file changed, 4 insertions(+), 8 deletions(-) diff --git a/crypto/bn/bn_gcd.c b/crypto/bn/bn_gcd.c index e1aac131c5..067642644e 100644 --- a/crypto/bn/bn_gcd.c +++ b/crypto/bn/bn_gcd.c @@ -277,8 +277,7 @@ BIGNUM *int_bn_mod_inverse(BIGNUM *in, if (!BN_uadd(Y, Y, X)) goto err; /* - * as above, BN_mod_add_quick(Y, Y, X, n) would slow things - * down + * as above, BN_mod_add_quick(Y, Y, X, n) would slow things down */ if (!BN_usub(A, A, B)) goto err; @@ -348,8 +347,7 @@ BIGNUM *int_bn_mod_inverse(BIGNUM *in, * (**) sign*Y*a == D*B + M (mod |n|). */ - tmp = A; /* keep the BIGNUM object, the value does not - * matter */ + tmp = A; /* keep the BIGNUM object, the value does not matter */ /* (A, B) := (B, A mod B) ... */ A = B; @@ -377,8 +375,7 @@ BIGNUM *int_bn_mod_inverse(BIGNUM *in, */ /* - * most of the time D is very small, so we can optimize tmp := - * D*X+Y + * most of the time D is very small, so we can optimize tmp := D*X+Y */ if (BN_is_one(D)) { if (!BN_add(tmp, X, Y)) @@ -403,8 +400,7 @@ BIGNUM *int_bn_mod_inverse(BIGNUM *in, goto err; } - M = Y; /* keep the BIGNUM object, the value does not - * matter */ + M = Y; /* keep the BIGNUM object, the value does not matter */ Y = X; X = tmp; sign = -sign; -- 2.25.1