Index: kernel/test/avltree/avltree1.c
===================================================================
--- kernel/test/avltree/avltree1.c	(revision 7e752b2a0d66c871748e5fa9e8bbe3a27c70a202)
+++ kernel/test/avltree/avltree1.c	(revision e0a4686ebb68dd7d42dd083c5ea6c37d6ced027d)
@@ -56,8 +56,8 @@
 {
 	avltree_node_t *tmp;
-	
+
 	if (!node)
 		return NULL;
-	
+
 	if (node->lft) {
 		tmp = test_tree_parents(node->lft);
@@ -81,15 +81,15 @@
 {
 	int h1, h2, diff;
-	
+
 	if (!node)
 		return 0;
-	
+
 	h1 = test_tree_balance(node->lft);
 	h2 = test_tree_balance(node->rgt);
 	diff = h2 - h1;
-	
+
 	if ((diff != node->balance) || ((diff != -1) && (diff != 0) && (diff != 1)))
 		TPRINTF("Bad balance\n");
-	
+
 	return ((h1 > h2) ? (h1 + 1) : (h2 + 1));
 }
@@ -110,12 +110,12 @@
 		return;
 	}
-	
+
 	if (node == NULL)
 		return;
-	
+
 	TPRINTF("%" PRIu64 "[%" PRIu8 "]", node->key, node->balance);
 	if (node->lft != NULL || node->rgt != NULL) {
 		TPRINTF("(");
-		
+
 		print_tree_structure_flat(node->lft, level + 1);
 		if (node->rgt != NULL) {
@@ -123,5 +123,5 @@
 			print_tree_structure_flat(node->rgt, level + 1);
 		}
-		
+
 		TPRINTF(")");
 	}
@@ -131,25 +131,25 @@
 {
 	int i;
-	
+
 	for (i = 0; i < NODE_COUNT - 1; i++)
 		avltree_nodes[i].par = &avltree_nodes[i + 1];
-	
+
 	avltree_nodes[i].par = NULL;
-	
+
 	/*
 	 * Node keys which will be used for insertion. Up to NODE_COUNT size of
 	 * array.
 	 */
-	
+
 	/* First tree node and same key */
 	avltree_nodes[0].key = 60;
 	avltree_nodes[1].key = 60;
 	avltree_nodes[2].key = 60;
-	
+
 	/* LL rotation */
 	avltree_nodes[3].key = 50;
 	avltree_nodes[4].key = 40;
 	avltree_nodes[5].key = 30;
-	
+
 	/* LR rotation */
 	avltree_nodes[6].key = 20;
@@ -157,20 +157,20 @@
 	avltree_nodes[8].key = 25;
 	avltree_nodes[9].key = 25;
-	
+
 	/* LL rotation in lower floor */
 	avltree_nodes[10].key = 35;
-	
+
 	/* RR rotation */
 	avltree_nodes[11].key = 70;
 	avltree_nodes[12].key = 80;
-	
+
 	/* RL rotation */
 	avltree_nodes[13].key = 90;
 	avltree_nodes[14].key = 85;
-	
+
 	/* Insert 0 key */
 	avltree_nodes[15].key = 0;
 	avltree_nodes[16].key = 0;
-	
+
 	/* Insert reverse */
 	avltree_nodes[17].key = 600;
@@ -178,8 +178,8 @@
 	avltree_nodes[19].key = 400;
 	avltree_nodes[20].key = 300;
-	
+
 	for (i = 21; i < NODE_COUNT; i++)
 		avltree_nodes[i].key = i * 3;
-	
+
 	first_free_node = &avltree_nodes[0];
 }
@@ -188,8 +188,8 @@
 {
 	avltree_node_t *node;
-	
+
 	node = first_free_node;
 	first_free_node = first_free_node->par;
-	
+
 	return node;
 }
@@ -199,17 +199,17 @@
 	unsigned int i;
 	avltree_node_t *newnode;
-	
+
 	avltree_create(tree);
-	
+
 	TPRINTF("Inserting %zu nodes...", node_count);
-	
+
 	for (i = 0; i < node_count; i++) {
 		newnode = alloc_avltree_node();
-		
+
 		avltree_insert(tree, newnode);
 		test_tree_parents(tree->root);
 		test_tree_balance(tree->root);
 	}
-	
+
 	TPRINTF("done.\n");
 }
@@ -220,9 +220,9 @@
 	avltree_node_t *delnode;
 	unsigned int i;
-	
+
 	switch (node_position) {
 	case 0:
 		TPRINTF("Deleting root nodes...");
-		
+
 		while (tree->root != NULL) {
 			delnode = tree->root;
@@ -234,5 +234,5 @@
 	case 1:
 		TPRINTF("Deleting nodes according to creation time...");
-		
+
 		for (i = 0; i < node_count; i++) {
 			avltree_delete(tree, &avltree_nodes[i]);
@@ -242,5 +242,5 @@
 		break;
 	}
-	
+
 	TPRINTF("done.\n");
 }
@@ -249,7 +249,7 @@
 {
 	unsigned int i = 0;
-	
+
 	TPRINTF("Deleting minimum nodes...");
-	
+
 	while (tree->root != NULL) {
 		i++;
@@ -258,8 +258,8 @@
 		test_tree_balance(tree->root);
 	}
-	
+
 	if (i != node_count)
 		TPRINTF("Bad node count. Some nodes have been lost!\n");
-	
+
 	TPRINTF("done.\n");
 }
@@ -270,13 +270,13 @@
 	test_tree_insert(&avltree, NODE_COUNT);
 	test_tree_delete(&avltree, NODE_COUNT, 0);
-	
+
 	alloc_avltree_node_prepare();
 	test_tree_insert(&avltree, NODE_COUNT);
 	test_tree_delete(&avltree, NODE_COUNT, 1);
-	
+
 	alloc_avltree_node_prepare();
 	test_tree_insert(&avltree, NODE_COUNT);
 	test_tree_delmin(&avltree, NODE_COUNT);
-	
+
 	return NULL;
 }