ec/ecp_nistz256.c: harmonize with latest indent script.

[oweals/openssl.git] / crypto / bn / bn_sqr.c

diff --git a/crypto/bn/bn_sqr.c b/crypto/bn/bn_sqr.c
index 65bbf165d0e2f3bc3de3d662c1c02800dbb33c70..57da1e46ae5d3bfb5d5bdd592b4aa27a8179760b 100644 (file)
--- a/crypto/bn/bn_sqr.c
+++ b/crypto/bn/bn_sqr.c
@@ -56,7 +56,6 @@
  * [including the GNU Public Licence.]
  */
 
-#include <stdio.h>
 #include "cryptlib.h"
 #include "bn_lcl.h"
 
@@ -68,9 +67,6 @@ int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
        int ret = 0;
        BIGNUM *tmp,*rr;
 
-#ifdef BN_COUNT
-       fprintf(stderr,"BN_sqr %d * %d\n",a->top,a->top);
-#endif
        bn_check_top(a);
 
        al=a->top;
@@ -194,7 +190,8 @@ void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
        }
 
 #ifdef BN_RECURSION
-/* r is 2*n words in size,
+/*-
+ * r is 2*n words in size,
  * a and b are both n words in size.    (There's not actually a 'b' here ...)
  * n must be a power of 2.
  * We multiply and return the result.
@@ -210,9 +207,6 @@ void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
        int zero,c1;
        BN_ULONG ln,lo,*p;
 
-#ifdef BN_COUNT
-       fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
-#endif
        if (n2 == 4)
                {
 #ifndef BN_SQR_COMBA
@@ -256,7 +250,8 @@ void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
        bn_sqr_recursive(r,a,n,p);
        bn_sqr_recursive(&(r[n2]),&(a[n]),n,p);
 
-       /* t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero
+       /*-
+        * t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero
         * r[10] holds (a[0]*b[0])
         * r[32] holds (b[1]*b[1])
         */
@@ -266,7 +261,8 @@ void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
        /* t[32] is negative */
        c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
 
-       /* t[32] holds (a[0]-a[1])*(a[1]-a[0])+(a[0]*a[0])+(a[1]*a[1])
+       /*-
+        * t[32] holds (a[0]-a[1])*(a[1]-a[0])+(a[0]*a[0])+(a[1]*a[1])
         * r[10] holds (a[0]*a[0])
         * r[32] holds (a[1]*a[1])
         * c1 holds the carry bits