Changes in kernel/test/avltree/avltree1.c [a35b458:9d58539] in mainline

File:

• kernel/test/avltree/avltree1.c (modified) (15 diffs)

kernel/test/avltree/avltree1.c

@@ -56 +56 @@
 {
         avltree_node_t *tmp;
-
+        
         if (!node)
                 return NULL;
-
+        
         if (node->lft) {
                 tmp = test_tree_parents(node->lft);
@@ -81 +81 @@
 {
         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 +110 @@
                 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 +123 @@
                         print_tree_structure_flat(node->rgt, level + 1);
                 }
-
+                
                 TPRINTF(")");
         }
@@ -131 +131 @@
 {
         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 +157 @@
         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 +178 @@
         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 +188 @@
 {
         avltree_node_t *node;
-
+        
         node = first_free_node;
         first_free_node = first_free_node->par;
-
+        
         return node;
 }
@@ -199 +199 @@
         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 +220 @@
         avltree_node_t *delnode;
         unsigned int i;
-
+        
         switch (node_position) {
         case 0:
                 TPRINTF("Deleting root nodes...");
-
+                
                 while (tree->root != NULL) {
                         delnode = tree->root;
@@ -234 +234 @@
         case 1:
                 TPRINTF("Deleting nodes according to creation time...");
-
+                
                 for (i = 0; i < node_count; i++) {
                         avltree_delete(tree, &avltree_nodes[i]);
@@ -242 +242 @@
                 break;
         }
-
+        
         TPRINTF("done.\n");
 }
@@ -249 +249 @@
 {
         unsigned int i = 0;
-
+        
         TPRINTF("Deleting minimum nodes...");
-
+        
         while (tree->root != NULL) {
                 i++;
@@ -258 +258 @@
                 test_tree_balance(tree->root);
         }
-
+        
         if (i != node_count)
                 TPRINTF("Bad node count. Some nodes have been lost!\n");
-
+        
         TPRINTF("done.\n");
 }
@@ -270 +270 @@
         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;
 }