Clean up various whitespace and fix one header guard.

headers/private/kernel/file_cache.h

@@ -20,7 +20,7 @@
 #define CACHE_MODULES_NAME	"file_cache"
 
 #define FILE_CACHE_SEQUENTIAL_ACCESS	0x01
-#define FILE_CACHE_LOADED_COMPLETELY 	0x02
+#define FILE_CACHE_LOADED_COMPLETELY	0x02
 #define FILE_CACHE_NO_IO				0x04
 
 struct cache_module_info {

headers/private/kernel/util/BitUtils.h

@@ -56,5 +56,5 @@ log2(uint32 v)
 }
 
 
-#endif	// KERNEL_UTIL_RANDOM_H
+#endif	// KERNEL_UTIL_BITUTIL_H
 

headers/private/kernel/util/OpenHashTable.h

@@ -74,7 +74,7 @@ struct MallocAllocator {
  * stored in a linked list. The table may be made to adjust its number of slots
  * depending on the load factor (this should be enabled unless the object is to
  * be used at times where memory allocations aren't possible, such as code
- * called byt he memory allocator).
+ * called by the memory allocator).
  *
  * The link between entries is part of the ValueType stored items, which makes
  * sure the table can always accept new items and will never fail because it is

headers/private/kernel/util/SplayTree.h

@@ -117,7 +117,7 @@ public:
 		}
 
 		return node;
-    }
+	}
 
 	/*!
 		Remove from the tree.
@@ -143,7 +143,7 @@ public:
 		}
 
 		return true;
-    }
+	}
 
 	/*!
 		Find the smallest item in the tree.
@@ -163,9 +163,9 @@ public:
 		return node;
 	}
 
-    /*!
+	/*!
 		Find the largest item in the tree.
-     */
+	*/
 	Node* FindMax()
 	{
 		if (fRoot == NULL)
@@ -179,9 +179,9 @@ public:
 		_Splay(Definition::GetKey(node));
 
 		return node;
-    }
+	}
 
-    /*!
+	/*!
 		Find an item in the tree.
 	*/
 	Node* Lookup(const Key& key)
@@ -192,14 +192,14 @@ public:
 		_Splay(key);
 
 		return Definition::Compare(key, fRoot) == 0 ? fRoot : NULL;
-    }
+	}
 
 	Node* Root() const
 	{
 		return fRoot;
 	}
 
-    /*!
+	/*!
 		Test if the tree is logically empty.
 		\return true if empty, false otherwise.
 	*/
@@ -267,16 +267,16 @@ private:
 
 		_Splay(key) does the splay operation on the given key.
 		If key is in the tree, then the node containing
-		that key becomes the root.  If key is not in the tree,
+		that key becomes the root. If key is not in the tree,
 		then after the splay, key.root is either the greatest key
 		< key in the tree, or the least key > key in the tree.
 
 		This means, among other things, that if you splay with
 		a key that's larger than any in the tree, the rightmost
-		node of the tree becomes the root.  This property is used
+		node of the tree becomes the root. This property is used
 		in the Remove() method.
 	*/
-    void _Splay(const Key& key) {
+	void _Splay(const Key& key) {
 		Link headerLink;
 		headerLink.left = headerLink.right = NULL;
 
@@ -554,7 +554,7 @@ public:
 		return fTree.Root();
 	}
 
-    /*!
+	/*!
 		Test if the tree is logically empty.
 		\return true if empty, false otherwise.
 	*/

src/system/kernel/lib/Jamfile

@@ -46,12 +46,12 @@ SEARCH_SOURCE += [ FDirName $(posixSources) unistd ] ;
 
 KernelMergeObject kernel_lib_posix.o :
 	# main
- 	kernel_errno.cpp
+	kernel_errno.cpp
- 	dirent.c
+	dirent.c
 	fcntl.cpp
- 	poll.c
+	poll.c
- 	utime.c
+	utime.c
- 	# locale
+	# locale
 	ctype.cpp
 	localeconv.cpp
 	LocaleData.cpp
@@ -76,7 +76,7 @@ KernelMergeObject kernel_lib_posix.o :
 	mkdir.c
 	select.c
 	gettimeofday.c
- 	uio.c
+	uio.c
 	# time
 	time.c
 	# unistd