Index: kernel/test/cht/cht1.c
===================================================================
--- kernel/test/cht/cht1.c	(revision 0b7bcb8f7fd2c6a7595e9ab91e34305be0df1d6f)
+++ kernel/test/cht/cht1.c	(revision 85d31de9fb7e4a793a91abe63f006b2fd2e81ece)
@@ -124,6 +124,5 @@
 	set_val(v[4], 2, key[4]);
 	set_val(v[5], 3, key[5]);
-		
-	
+			
 	if (!cht_insert_unique(h, &v[0]->link))
 		return "Duplicates in empty";
@@ -156,5 +155,4 @@
 		return "Found nonexisting duplicate 5";
 	
-	
 	item = cht_find(h, (void*)v[3]->unique_id);
 	if (!item || item != &v[3]->link)
@@ -164,5 +162,4 @@
 	if (item)
 		return "Found nonexisting duplicate 3, same hash as others.";
-	
 	
 	item = cht_find(h, (void*)v[0]->unique_id);
@@ -220,9 +217,9 @@
 		return "Removed incorrect key";
 	
-	for (size_t k = 0; k < sizeof(v)/sizeof(v[0]); ++k) {
+	for (size_t k = 0; k < sizeof(v) / sizeof(v[0]); ++k) {
 		cht_remove_key(h, (void*)key[k]);
 	}
 	
-	for (size_t k = 0; k < sizeof(v)/sizeof(v[0]); ++k) {
+	for (size_t k = 0; k < sizeof(v) / sizeof(v[0]); ++k) {
 		if (cht_find(h, (void*)key[k]))
 			return "Found a key in a cleared table";
@@ -395,5 +392,5 @@
 				}
 				work->elem[elem_idx].inserted = false;
-			} else if (work->elem[elem_idx].deleted){
+			} else if (work->elem[elem_idx].deleted) {
 				work->elem[elem_idx].deleted = false;
 				
@@ -555,4 +552,5 @@
 	if (err)
 		return err;
+	printf("Basic sanity test: ok.\n");
 	
 	if (!do_stress())