Remove trailing whitespace.

2 files changed, 6 insertions, 6 deletions

diff --git a/usr.bin/locate/bigram/locate.bigram.c b/usr.bin/locate/bigram/locate.bigram.c
index b58fac4..149e437 100644
--- a/usr.bin/locate/bigram/locate.bigram.c
+++ b/usr.bin/locate/bigram/locate.bigram.c
@@ -46,7 +46,7 @@ static char sccsid[] = "@(#)locate.bigram.c	8.1 (Berkeley) 6/6/93";
 
 /*
  *  bigram < text > bigrams
- * 
+ *
  * List bigrams for 'updatedb' script.
  * Use 'code' to encode a file using this output.
  */
@@ -54,7 +54,7 @@ static char sccsid[] = "@(#)locate.bigram.c	8.1 (Berkeley) 6/6/93";
 #include <stdio.h>
 #include <sys/param.h>			/* for MAXPATHLEN */
 
-char buf1[MAXPATHLEN] = " ";	
+char buf1[MAXPATHLEN] = " ";
 char buf2[MAXPATHLEN];
 
 main ( )
diff --git a/usr.bin/locate/locate/locate.c b/usr.bin/locate/locate/locate.c
index ea43872..0b33188 100644
--- a/usr.bin/locate/locate/locate.c
+++ b/usr.bin/locate/locate/locate.c
@@ -53,19 +53,19 @@ static char sccsid[] = "@(#)locate.c	8.1 (Berkeley) 6/6/93";
  * bigram coding by a further 20-25%.
  *
  * The codes are:
- * 
+ *
  * 	0-28	likeliest differential counts + offset to make nonnegative
  *	30	switch code for out-of-range count to follow in next word
  *	128-255 bigram codes (128 most common, as determined by 'updatedb')
  *	32-127  single character (printable) ascii residue (ie, literal)
- * 
+ *
  * A novel two-tiered string search technique is employed:
- * 
+ *
  * First, a metacharacter-free subpattern and partial pathname is matched
  * BACKWARDS to avoid full expansion of the pathname list.  The time savings
  * is 40-50% over forward matching, which cannot efficiently handle
  * overlapped search patterns and compressed path residue.
- * 
+ *
  * Then, the actual shell glob-style regular expression (if in this form) is
  * matched against the candidate pathnames using the slower routines provided
  * in the standard 'find'.