2 * copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
4 * This file is part of FFmpeg.
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 typedef struct AVTreeNode {
26 struct AVTreeNode *child[2];
31 const int av_tree_node_size = sizeof(AVTreeNode);
33 void *av_tree_find(const AVTreeNode *t, void *key,
34 int (*cmp)(void *key, const void *b), void *next[2])
37 unsigned int v = cmp(key, t->elem);
39 if (next) next[v >> 31] = t->elem;
40 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next);
43 av_tree_find(t->child[0], key, cmp, next);
44 av_tree_find(t->child[1], key, cmp, next);
52 void *av_tree_insert(AVTreeNode **tp, void *key,
53 int (*cmp)(void *key, const void *b), AVTreeNode **next)
57 unsigned int v = cmp(t->elem, key);
62 else if (t->child[0] || t->child[1]) {
65 av_tree_find(t->child[i], key, cmp, next_elem);
66 key = t->elem = next_elem[i];
74 ret = av_tree_insert(&t->child[v >> 31], key, cmp, next);
76 int i = (v >> 31) ^ !!*next;
77 AVTreeNode **child = &t->child[i];
78 t->state += 2 * i - 1;
80 if (!(t->state & 1)) {
82 /* The following code is equivalent to
83 if((*child)->state*2 == -t->state)
88 static void rotate(AVTreeNode **tp, int i) {
92 t->child[i]= t->child[i]->child[i^1];
94 i= 4*t->state + 2*(*tp)->state + 12;
95 t ->state= ((0x614586 >> i) & 3)-1;
96 (*tp)->state= ((*tp)->state>>1) + ((0x400EEA >> i) & 3)-1;
98 but such a rotate function is both bigger and slower
100 if (( *child )->state * 2 == -t->state) {
101 *tp = (*child)->child[i ^ 1];
102 (*child)->child[i ^ 1] = (*tp)->child[i];
103 (*tp)->child[i] = *child;
104 *child = ( *tp )->child[i ^ 1];
105 (*tp)->child[i ^ 1] = t;
107 (*tp)->child[0]->state = -((*tp)->state > 0);
108 (*tp)->child[1]->state = (*tp)->state < 0;
112 *child = (*child)->child[i ^ 1];
113 (*tp)->child[i ^ 1] = t;
114 if ((*tp)->state) t->state = 0;
116 (*tp)->state = -t->state;
120 if (!(*tp)->state ^ !!*next)
135 void av_tree_destroy(AVTreeNode *t)
138 av_tree_destroy(t->child[0]);
139 av_tree_destroy(t->child[1]);
144 void av_tree_enumerate(AVTreeNode *t, void *opaque,
145 int (*cmp)(void *opaque, void *elem),
146 int (*enu)(void *opaque, void *elem))
149 int v = cmp ? cmp(opaque, t->elem) : 0;
151 av_tree_enumerate(t->child[0], opaque, cmp, enu);
153 enu(opaque, t->elem);
155 av_tree_enumerate(t->child[1], opaque, cmp, enu);
164 static int check(AVTreeNode *t)
167 int left = check(t->child[0]);
168 int right = check(t->child[1]);
170 if (left>999 || right>999)
172 if (right - left != t->state)
174 if (t->state>1 || t->state<-1)
176 return FFMAX(left, right) + 1;
181 static void print(AVTreeNode *t, int depth)
184 for (i = 0; i < depth * 4; i++) av_log(NULL, AV_LOG_ERROR, " ");
186 av_log(NULL, AV_LOG_ERROR, "Node %p %2d %p\n", t, t->state, t->elem);
187 print(t->child[0], depth + 1);
188 print(t->child[1], depth + 1);
190 av_log(NULL, AV_LOG_ERROR, "NULL\n");
193 static int cmp(void *a, const void *b)
195 return (uint8_t *) a - (const uint8_t *) b;
202 AVTreeNode *root = NULL, *node = NULL;
205 av_lfg_init(&prng, 1);
207 for (i = 0; i < 10000; i++) {
208 int j = av_lfg_get(&prng) % 86294;
209 if (check(root) > 999) {
210 av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
214 av_log(NULL, AV_LOG_ERROR, "inserting %4d\n", j);
216 node = av_mallocz(av_tree_node_size);
217 av_tree_insert(&root, (void *) (j + 1), cmp, &node);
219 j = av_lfg_get(&prng) % 86294;
221 AVTreeNode *node2 = NULL;
222 av_log(NULL, AV_LOG_ERROR, "removing %4d\n", j);
223 av_tree_insert(&root, (void *) (j + 1), cmp, &node2);
224 k = av_tree_find(root, (void *) (j + 1), cmp, NULL);
226 av_log(NULL, AV_LOG_ERROR, "removal failure %d\n", i);