source: mainline/kernel/test/avltree/avltree1.c@ 0e9463df

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 0e9463df was 358ec13, checked in by Jakub Jermar <jakub@…>, 18 years ago

Import the AVL tree implementation from the RCU branch.
  • Property mode set to 100644
File size: 6.8 KB
RevLine 
[358ec13]1/*
2 * Copyright (c) 2007 Vojtech Mencl
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include <test.h>
30#include <print.h>
31#include <adt/avl.h>
32#include <debug.h>
33#include <arch/types.h>
34
35#define NODE_COUNT 100
36
37static avltree_t avltree;
38
39/*
40 * avl tree nodes in array for faster allocation
41 */
42static avltree_node_t avltree_nodes[NODE_COUNT];
43
44/*
45 * head of free nodes' list:
46 */
47static avltree_node_t *first_free_node = NULL;
48
49static int test_tree_balance(avltree_node_t *node);
50static avltree_node_t *test_tree_parents(avltree_node_t *node);
51static void print_tree_structure_flat (avltree_node_t *node, int level);
52static avltree_node_t *alloc_avltree_node(void);
53
54static avltree_node_t *test_tree_parents(avltree_node_t *node)
55{
56 avltree_node_t *tmp;
57
58 if (!node)
59 return NULL;
60
61 if (node->lft) {
62 tmp = test_tree_parents(node->lft);
63 if (tmp != node) {
64 printf("Bad parent pointer key: %d, address: %p\n",
65 tmp->key, node->lft);
66 }
67 }
68 if (node->rgt) {
69 tmp = test_tree_parents(node->rgt);
70 if (tmp != node) {
71 printf("Bad parent pointer key: %d, address: %p\n",
72 tmp->key,node->rgt);
73 }
74 }
75 return node->par;
76}
77
78int test_tree_balance(avltree_node_t *node)
79{
80 int h1, h2, diff;
81
82 if (!node)
83 return 0;
84 h1 = test_tree_balance(node->lft);
85 h2 = test_tree_balance(node->rgt);
86 diff = h2 - h1;
87 if (diff != node->balance || (diff != -1 && diff != 0 && diff != 1)) {
88 printf("Bad balance\n");
89 }
90 return h1 > h2 ? h1 + 1 : h2 + 1;
91}
92
93/**
94 * Prints the structure of the node, which is level levels from the top of the
95 * tree.
96 */
97static void print_tree_structure_flat(avltree_node_t *node, int level)
98{
99 /*
100 * You can set the maximum level as high as you like.
101 * Most of the time, you'll want to debug code using small trees,
102 * so that a large level indicates a loop, which is a bug.
103 */
104 if (level > 16) {
105 printf("[...]");
106 return;
107 }
108
109 if (node == NULL)
110 return;
111
112 printf("%d[%d]", node->key, node->balance);
113 if (node->lft != NULL || node->rgt != NULL) {
114 printf("(");
115
116 print_tree_structure_flat(node->lft, level + 1);
117 if (node->rgt != NULL) {
118 printf(",");
119 print_tree_structure_flat(node->rgt, level + 1);
120 }
121
122 printf(")");
123 }
124}
125
126static void alloc_avltree_node_prepare(void)
127{
128 int i;
129
130 for (i = 0; i < NODE_COUNT - 1; i++) {
131 avltree_nodes[i].par = &avltree_nodes[i + 1];
132 }
133
134 /*
135 * Node keys which will be used for insertion. Up to NODE_COUNT size of
136 * array.
137 */
138
139 /* First tree node and same key */
140 avltree_nodes[0].key = 60;
141 avltree_nodes[1].key = 60;
142 avltree_nodes[2].key = 60;
143 /* LL rotation */
144 avltree_nodes[3].key = 50;
145 avltree_nodes[4].key = 40;
146 avltree_nodes[5].key = 30;
147 /* LR rotation */
148 avltree_nodes[6].key = 20;
149 avltree_nodes[7].key = 20;
150 avltree_nodes[8].key = 25;
151 avltree_nodes[9].key = 25;
152 /* LL rotation in lower floor */
153 avltree_nodes[10].key = 35;
154 /* RR rotation */
155 avltree_nodes[11].key = 70;
156 avltree_nodes[12].key = 80;
157 /* RL rotation */
158 avltree_nodes[13].key = 90;
159 avltree_nodes[14].key = 85;
160 /* Insert 0 key */
161 avltree_nodes[15].key = 0;
162 avltree_nodes[16].key = 0;
163 /* Insert reverse */
164 avltree_nodes[17].key = 600;
165 avltree_nodes[18].key = 500;
166 avltree_nodes[19].key = 400;
167 avltree_nodes[20].key = 300;
168
169 for (i = 21; i < NODE_COUNT; i++)
170 avltree_nodes[i].key = i * 3;
171
172 avltree_nodes[i].par = NULL;
173 first_free_node = &avltree_nodes[0];
174}
175
176static avltree_node_t *alloc_avltree_node(void)
177{
178 avltree_node_t *node;
179
180 node = first_free_node;
181 first_free_node = first_free_node->par;
182
183 return node;
184}
185
186static void test_tree_insert(avltree_t *tree, count_t node_count, bool quiet)
187{
188 unsigned int i;
189 avltree_node_t *newnode;
190
191 avltree_create(tree);
192
193 if (!quiet)
194 printf("Inserting %d nodes...", node_count);
195
196 for (i = 0; i < node_count; i++) {
197 newnode = alloc_avltree_node();
198
199 avltree_insert(tree, newnode);
200 if (!quiet) {
201 test_tree_parents(tree->root);
202 test_tree_balance(tree->root);
203 }
204 }
205
206 if (!quiet)
207 printf("done.\n");
208}
209
210
211static void test_tree_delete(avltree_t *tree, count_t node_count,
212 int node_position, bool quiet)
213{
214 avltree_node_t *delnode;
215 unsigned int i;
216
217 switch (node_position) {
218 case 0:
219 if (!quiet)
220 printf("Deleting root nodes...");
221 while (tree->root != NULL) {
222 delnode = tree->root;
223 avltree_delete(tree, delnode);
224 if (!quiet) {
225 test_tree_parents(tree->root);
226 test_tree_balance(tree->root);
227 }
228 }
229 break;
230 case 1:
231 if (!quiet)
232 printf("Deleting nodes according to creation time...");
233 for (i = 0; i < node_count; i++) {
234 avltree_delete(tree, &avltree_nodes[i]);
235 if (!quiet) {
236 test_tree_parents(tree->root);
237 test_tree_balance(tree->root);
238 }
239 }
240 break;
241 }
242
243 if (!quiet)
244 printf("done.\n");
245}
246
247static void test_tree_delmin(avltree_t *tree, count_t node_count, bool quiet)
248{
249 int i = 0;
250
251 if (!quiet)
252 printf("Deleting minimum nodes...");
253
254 while (tree->root != NULL) {
255 i++;
256 avltree_delete_min(tree);
257 if (!quiet) {
258 test_tree_parents(tree->root);
259 test_tree_balance(tree->root);
260 }
261 }
262
263 if (!quiet && (i != node_count))
264 printf("Bad node count. Some nodes have been lost!\n");
265
266 if (!quiet)
267 printf("done.\n");
268}
269
270char *test_avltree1(bool quiet)
271{
272 alloc_avltree_node_prepare();
273 test_tree_insert(&avltree, NODE_COUNT, quiet);
274 test_tree_delete(&avltree, NODE_COUNT, 0, quiet);
275
276 alloc_avltree_node_prepare();
277 test_tree_insert(&avltree, NODE_COUNT, quiet);
278 test_tree_delete(&avltree, NODE_COUNT, 1, quiet);
279
280 alloc_avltree_node_prepare();
281 test_tree_insert(&avltree, NODE_COUNT, quiet);
282 test_tree_delmin(&avltree, NODE_COUNT, quiet);
283
284 return NULL;
285}
286
Note: See TracBrowser for help on using the repository browser.