mark all block comments that need format preserving so that

[openssl.git] / crypto / bn / bn_gcd.c

diff --git a/crypto/bn/bn_gcd.c b/crypto/bn/bn_gcd.c
index 85e4b50c10252cd3e9a61f6c9e4248970f859304..8ff0439370f8bbb224771a6d6c179a64f6f575b1 100644 (file)
--- a/crypto/bn/bn_gcd.c
+++ b/crypto/bn/bn_gcd.c
@@ -203,6 +203,8 @@ err:
 
 
 /* solves ax == 1 (mod n) */
+static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
+        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
 BIGNUM *BN_mod_inverse(BIGNUM *in,
        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
        {
@@ -244,7 +246,8 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                if (!BN_nnmod(B, B, A, ctx)) goto err;
                }
        sign = -1;
-       /* From  B = a mod |n|,  A = |n|  it follows that
+       /*-
+        * From  B = a mod |n|,  A = |n|  it follows that
         *
         *      0 <= B < A,
         *     -sign*X*a  ==  B   (mod |n|),
@@ -261,7 +264,7 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                
                while (!BN_is_zero(B))
                        {
-                       /*
+                       /*-
                         *      0 < B < |n|,
                         *      0 < A <= |n|,
                         * (1) -sign*X*a  ==  B   (mod |n|),
@@ -308,7 +311,8 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                                }
 
                        
-                       /* We still have (1) and (2).
+                       /*-
+                        * We still have (1) and (2).
                         * Both  A  and  B  are odd.
                         * The following computations ensure that
                         *
@@ -344,7 +348,7 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                        {
                        BIGNUM *tmp;
                        
-                       /*
+                       /*-
                         *      0 < B < A,
                         * (*) -sign*X*a  ==  B   (mod |n|),
                         *      sign*Y*a  ==  A   (mod |n|)
@@ -391,7 +395,8 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                                if (!BN_div(D,M,A,B,ctx)) goto err;
                                }
                        
-                       /* Now
+                       /*-
+                        * Now
                         *      A = D*B + M;
                         * thus we have
                         * (**)  sign*Y*a  ==  D*B + M   (mod |n|).
@@ -404,7 +409,8 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                        B=M;
                        /* ... so we have  0 <= B < A  again */
                        
-                       /* Since the former  M  is now  B  and the former  B  is now  A,
+                       /*-
+                        * Since the former  M  is now  B  and the former  B  is now  A,
                         * (**) translates into
                         *       sign*Y*a  ==  D*A + B    (mod |n|),
                         * i.e.
@@ -457,7 +463,7 @@ BIGNUM *BN_mod_inverse(BIGNUM *in,
                        }
                }
                
-       /*
+       /*-
         * The while loop (Euclid's algorithm) ends when
         *      A == gcd(a,n);
         * we have
@@ -501,7 +507,7 @@ err:
 /* BN_mod_inverse_no_branch is a special version of BN_mod_inverse. 
  * It does not contain branches that may leak sensitive information.
  */
-BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
+static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
        {
        BIGNUM *A,*B,*X,*Y,*M,*D,*T,*R=NULL;
@@ -545,7 +551,8 @@ BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
                if (!BN_nnmod(B, pB, A, ctx)) goto err;
                }
        sign = -1;
-       /* From  B = a mod |n|,  A = |n|  it follows that
+       /*-
+        * From  B = a mod |n|,  A = |n|  it follows that
         *
         *      0 <= B < A,
         *     -sign*X*a  ==  B   (mod |n|),
@@ -556,7 +563,7 @@ BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
                {
                BIGNUM *tmp;
                
-               /*
+               /*-
                 *      0 < B < A,
                 * (*) -sign*X*a  ==  B   (mod |n|),
                 *      sign*Y*a  ==  A   (mod |n|)
@@ -571,7 +578,8 @@ BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
                /* (D, M) := (A/B, A%B) ... */          
                if (!BN_div(D,M,pA,B,ctx)) goto err;
                
-               /* Now
+               /*-
+                * Now
                 *      A = D*B + M;
                 * thus we have
                 * (**)  sign*Y*a  ==  D*B + M   (mod |n|).
@@ -584,7 +592,8 @@ BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
                B=M;
                /* ... so we have  0 <= B < A  again */
                
-               /* Since the former  M  is now  B  and the former  B  is now  A,
+               /*-
+                * Since the former  M  is now  B  and the former  B  is now  A,
                 * (**) translates into
                 *       sign*Y*a  ==  D*A + B    (mod |n|),
                 * i.e.
@@ -612,7 +621,7 @@ BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
                sign = -sign;
                }
                
-       /*
+       /*-
         * The while loop (Euclid's algorithm) ends when
         *      A == gcd(a,n);
         * we have