X-Git-Url: https://git.distorted.org.uk/u/mdw/catacomb/blobdiff_plain/fe6657c961b01ec72e9f35f4c3d96b11b31cf09c..45c0fd363937c6e9b05da04a9167e9912c05ca0c:/mpreduce.c

diff --git a/mpreduce.c b/mpreduce.c
index bc41f60..5016f29 100644
--- a/mpreduce.c
+++ b/mpreduce.c
@@ -7,7 +7,7 @@
  * (c) 2004 Straylight/Edgeware
  */
 
-/*----- Licensing notice --------------------------------------------------* 
+/*----- Licensing notice --------------------------------------------------*
  *
  * This file is part of Catacomb.
  *
@@ -15,12 +15,12 @@
  * it under the terms of the GNU Library General Public License as
  * published by the Free Software Foundation; either version 2 of the
  * License, or (at your option) any later version.
- * 
+ *
  * Catacomb is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  * GNU Library General Public License for more details.
- * 
+ *
  * You should have received a copy of the GNU Library General Public
  * License along with Catacomb; if not, write to the Free
  * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
@@ -94,11 +94,11 @@ int mpreduce_create(mpreduce *r, mp *p)
   for (i = 0, mp_scan(&sc, p); mp_step(&sc); i++) {
     switch (st | mp_bit(&sc)) {
       case  Z | 1: st = Z1; break;
-      case Z1 | 0: st =  Z; printf("+ %lu\n", i - 1); break;
-      case Z1 | 1: st =  X; printf("- %lu\n", i - 1); break;
+      case Z1 | 0: st =	 Z; printf("+ %lu\n", i - 1); break;
+      case Z1 | 1: st =	 X; printf("- %lu\n", i - 1); break;
       case  X | 0: st = X0; break;
-      case X0 | 1: st =  X; printf("- %lu\n", i - 1); break;
-      case X0 | 0: st =  Z; printf("+ %lu\n", i - 1); break;
+      case X0 | 1: st =	 X; printf("- %lu\n", i - 1); break;
+      case X0 | 0: st =	 Z; printf("+ %lu\n", i - 1); break;
     }
   }
   if (st >= X) printf("+ %lu\n", i - 1);
@@ -109,11 +109,11 @@ int mpreduce_create(mpreduce *r, mp *p)
   for (i = 0, mp_scan(&sc, p); i < d && mp_step(&sc); i++) {
     switch (st | mp_bit(&sc)) {
       case  Z | 1: st = Z1; break;
-      case Z1 | 0: st =  Z; op = MPRI_SUB; goto instr;
-      case Z1 | 1: st =  X; op = MPRI_ADD; goto instr;
+      case Z1 | 0: st =	 Z; op = MPRI_SUB; goto instr;
+      case Z1 | 1: st =	 X; op = MPRI_ADD; goto instr;
       case  X | 0: st = X0; break;
-      case X0 | 1: st =  X; op = MPRI_ADD; goto instr;
-      case X0 | 0: st =  Z; op = MPRI_SUB; goto instr;
+      case X0 | 1: st =	 X; op = MPRI_ADD; goto instr;
+      case X0 | 0: st =	 Z; op = MPRI_SUB; goto instr;
       instr:
 	w = (d - i)/MPW_BITS + 1;
 	b = (bb + i)%MPW_BITS;
@@ -332,11 +332,11 @@ mp *mpreduce_do(mpreduce *r, mp *d, mp *x)
 /* --- @mpreduce_exp@ --- *
  *
  * Arguments:	@mpreduce *mr@ = pointer to reduction context
- *              @mp *d@ = fake destination
- *              @mp *a@ = base
- *              @mp *e@ = exponent
+ *		@mp *d@ = fake destination
+ *		@mp *a@ = base
+ *		@mp *e@ = exponent
  *
- * Returns:     Result, %$a^e \bmod m$%.
+ * Returns:	Result, %$a^e \bmod m$%.
  */
 
 mp *mpreduce_exp(mpreduce *mr, mp *d, mp *a, mp *e)