Index: kernel/test/avltree/avltree1.c
===================================================================
--- kernel/test/avltree/avltree1.c	(revision a4dfcd254204a5c6eb82c79d5a30340d83296b72)
+++ kernel/test/avltree/avltree1.c	(revision deaf8d550ca13cfcdab1e6faa67f3aaba90355a9)
@@ -49,5 +49,6 @@
 static int test_tree_balance(avltree_node_t *node);
 static avltree_node_t *test_tree_parents(avltree_node_t *node);
-static void print_tree_structure_flat (avltree_node_t *node, int level);
+static void print_tree_structure_flat (avltree_node_t *node, int level)
+    __attribute__ ((used));
 static avltree_node_t *alloc_avltree_node(void);
 
@@ -62,6 +63,6 @@
 		tmp = test_tree_parents(node->lft);
 		if (tmp != node) {
-			printf("Bad parent pointer key: %" PRIu64 ", address: %p\n",
-			    tmp->key, node->lft);
+			printf("Bad parent pointer key: %" PRIu64
+			    ", address: %p\n", tmp->key, node->lft);
 		}
 	}
@@ -69,5 +70,6 @@
 		tmp = test_tree_parents(node->rgt);
 		if (tmp != node) {
-			printf("Bad parent pointer key: %" PRIu64 ", address: %p\n",
+			printf("Bad parent pointer key: %" PRIu64
+			    ", address: %p\n",
 			    tmp->key,node->rgt);
 		}
@@ -95,5 +97,6 @@
  * tree. 
  */
-static void print_tree_structure_flat(avltree_node_t *node, int level)
+static void
+print_tree_structure_flat(avltree_node_t *node, int level)
 {
 	/*
@@ -131,4 +134,5 @@
 		avltree_nodes[i].par = &avltree_nodes[i + 1];
 	}
+	avltree_nodes[i].par = NULL;
 	
 	/*
@@ -170,5 +174,4 @@
 		avltree_nodes[i].key = i * 3;
 	
-	avltree_nodes[i].par = NULL;
 	first_free_node = &avltree_nodes[0];
 }