Remove as much trailing whitespace as possible.

Change-Id: I873c1c6d00f447269bd841494459efccdd2c19c0

utils/db1-ast/hash/README

@@ -6,17 +6,17 @@ Test Programs:
 	All test programs which need key/data pairs expect them entered
 	with key and data on separate lines
 
-	tcreat3.c	
-		Takes 
-			bucketsize (bsize), 
+	tcreat3.c
+		Takes
+			bucketsize (bsize),
 			fill factor (ffactor), and
-			initial number of elements (nelem).  
-		Creates a hash table named hashtest containing the 
+			initial number of elements (nelem).
+		Creates a hash table named hashtest containing the
 		keys/data pairs entered from standard in.
 	thash4.c
 		Takes
-			bucketsize (bsize), 
-			fill factor (ffactor), 
+			bucketsize (bsize),
+			fill factor (ffactor),
 			initial number of elements (nelem)
 			bytes of cache (ncached), and
 			file from which to read data  (fname)
@@ -45,7 +45,7 @@ Test Programs:
 NOTES:
 
 The file search.h is provided for using the hsearch compatible interface
-on BSD systems.  On System V derived systems, search.h should appear in 
+on BSD systems.  On System V derived systems, search.h should appear in
 /usr/include.
 
 The man page ../man/db.3 explains the interface to the hashing system.
@@ -63,7 +63,7 @@ file, you may lose updates since the package buffers all writes.  Also,
 the db interface only creates a single database file.  To avoid overwriting
 the user's original file, the suffix ".db" is appended to the file name
 passed to dbm_open.  Additionally, if your code "knows" about the historic
-.dir and .pag files, it will break.  
+.dir and .pag files, it will break.
 
 There is a fundamental difference between this package and the old hsearch.
 Hsearch requires the user to maintain the keys and data in the application's

utils/db1-ast/hash/hash_page.c

@@ -688,7 +688,7 @@ overflow_page(hashp)
 			in_use_bits = free_bit;
 		else
 			in_use_bits = (hashp->BSIZE << BYTE_SHIFT) - 1;
-		
+
 		if (i == first_page) {
 			bit = hashp->LAST_FREED &
 			    ((hashp->BSIZE << BYTE_SHIFT) - 1);

utils/db1-ast/include/db.h

@@ -182,7 +182,7 @@ typedef struct {
 	int	lorder;		/* byte order */
 	size_t	reclen;		/* record length (fixed-length records) */
 	u_char	bval;		/* delimiting byte (variable-length records */
-	char	*bfname;	/* btree file name */ 
+	char	*bfname;	/* btree file name */
 } RECNOINFO;
 
 #ifdef __DBINTERFACE_PRIVATE

utils/db1-ast/recno/rec_search.c

@@ -92,7 +92,7 @@ __rec_search(t, recno, op)
 		}
 
 		BT_PUSH(t, pg, index - 1);
-		
+
 		pg = r->pgno;
 		switch (op) {
 		case SDELETE:

utils/db1-ast/recno/rec_seq.c

@@ -107,7 +107,7 @@ __rec_seq(dbp, key, data, flags)
 einval:		errno = EINVAL;
 		return (RET_ERROR);
 	}
-	
+
 	if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) {
 		if (!F_ISSET(t, R_EOF | R_INMEM) &&
 		    (status = t->bt_irec(t, nrec)) != RET_SUCCESS)