===================================================================
RCS file: /cvsrepo/anoncvs/cvs/src/usr.bin/sort/Attic/fsort.c,v
retrieving revision 1.3
retrieving revision 1.4
diff -u -r1.3 -r1.4
--- src/usr.bin/sort/Attic/fsort.c	1997/01/22 06:43:52	1.3
+++ src/usr.bin/sort/Attic/fsort.c	1997/06/16 02:21:55	1.4
@@ -1,4 +1,4 @@
-/*	$OpenBSD: fsort.c,v 1.3 1997/01/22 06:43:52 millert Exp $	*/
+/*	$OpenBSD: fsort.c,v 1.4 1997/06/16 02:21:55 millert Exp $	*/
 
 /*-
  * Copyright (c) 1993
@@ -40,7 +40,7 @@
 #if 0
 static char sccsid[] = "@(#)fsort.c	8.1 (Berkeley) 6/6/93";
 #else
-static char rcsid[] = "$OpenBSD: fsort.c,v 1.3 1997/01/22 06:43:52 millert Exp $";
+static char rcsid[] = "$OpenBSD: fsort.c,v 1.4 1997/06/16 02:21:55 millert Exp $";
 #endif
 #endif /* not lint */
 
@@ -50,7 +50,7 @@
  * and try again on smaller bins.  Sort the final bin at this level
  * of recursion to keep the head of fstack at 0.
  * After PANIC passes, abort to merge sort.
-*/
+ */
 #include "sort.h"
 #include "fsort.h"
 
@@ -155,7 +155,7 @@
 						fmerge(0, mstart, mfct, geteasy,
 						  fstack[tfiles.top+ntfiles].fp,
 						  putrec, ftbl);
-						++ntfiles;
+						ntfiles++;
 						mfct = 0;
 						memmove(crec->data, tmpbuf,
 						    bufend - crec->data);
@@ -165,7 +165,7 @@
 					fstack[tfiles.top + ntfiles].fp= ftmp();
 					onepass(keylist, depth, nelem, sizes,
 					weights, fstack[tfiles.top+ntfiles].fp);
-					++ntfiles;
+					ntfiles++;
 				}
 			}
 		}
@@ -239,7 +239,7 @@
 }
 
 /*
- This is one pass of radix exchange, dumping the bins to disk.
+ * This is one pass of radix exchange, dumping the bins to disk.
  */
 #define swap(a, b, t) t = a, a = b, b = t
 void
@@ -275,7 +275,7 @@
 		if (c <= 1)
 			continue;
 	}
-	for(aj = a; aj < an; *aj = r, aj = bin[c+1]) 
+	for (aj = a; aj < an; *aj = r, aj = bin[c+1]) 
 		for(r = *aj; aj < (ak = --top[c = tr[r[depth]]]) ;)			
 			swap(*ak, r, t);