24
typedef struct AVTreeNode{
24
typedef struct AVTreeNode {
25
25
struct AVTreeNode *child[2];
30
30
const int av_tree_node_size = sizeof(AVTreeNode);
32
void *av_tree_find(const AVTreeNode *t, void *key, int (*cmp)(void *key, const void *b), void *next[2]){
34
unsigned int v= cmp(key, t->elem);
36
if(next) next[v>>31]= t->elem;
37
return av_tree_find(t->child[(v>>31)^1], key, cmp, next);
32
void *av_tree_find(const AVTreeNode *t, void *key,
33
int (*cmp)(void *key, const void *b), void *next[2])
36
unsigned int v = cmp(key, t->elem);
38
if (next) next[v >> 31] = t->elem;
39
return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next);
40
42
av_tree_find(t->child[0], key, cmp, next);
41
43
av_tree_find(t->child[1], key, cmp, next);
49
void *av_tree_insert(AVTreeNode **tp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next){
52
unsigned int v= cmp(t->elem, key);
51
void *av_tree_insert(AVTreeNode **tp, void *key,
52
int (*cmp)(void *key, const void *b), AVTreeNode **next)
56
unsigned int v = cmp(t->elem, key);
57
else if(t->child[0]||t->child[1]){
61
else if (t->child[0] || t->child[1]) {
59
63
void *next_elem[2];
60
64
av_tree_find(t->child[i], key, cmp, next_elem);
61
key= t->elem= next_elem[i];
65
key = t->elem = next_elem[i];
69
ret= av_tree_insert(&t->child[v>>31], key, cmp, next);
71
int i= (v>>31) ^ !!*next;
72
AVTreeNode **child= &t->child[i];
73
ret = av_tree_insert(&t->child[v >> 31], key, cmp, next);
75
int i = (v >> 31) ^ !!*next;
76
AVTreeNode **child = &t->child[i];
77
t->state += 2 * i - 1;
79
if (!(t->state & 1)) {
77
81
/* The following code is equivalent to
78
82
if((*child)->state*2 == -t->state)
79
83
rotate(child, i^1);
83
static void rotate(AVTreeNode **tp, int i){
87
static void rotate(AVTreeNode **tp, int i) {
84
88
AVTreeNode *t= *tp;
93
97
but such a rotate function is both bigger and slower
95
if((*child)->state*2 == -t->state){
96
*tp= (*child)->child[i^1];
97
(*child)->child[i^1]= (*tp)->child[i];
98
(*tp)->child[i]= *child;
99
*child= (*tp)->child[i^1];
100
(*tp)->child[i^1]= t;
99
if (( *child )->state * 2 == -t->state) {
100
*tp = (*child)->child[i ^ 1];
101
(*child)->child[i ^ 1] = (*tp)->child[i];
102
(*tp)->child[i] = *child;
103
*child = ( *tp )->child[i ^ 1];
104
(*tp)->child[i ^ 1] = t;
102
(*tp)->child[0]->state= -((*tp)->state>0);
103
(*tp)->child[1]->state= (*tp)->state<0 ;
107
*child= (*child)->child[i^1];
108
(*tp)->child[i^1]= t;
109
if((*tp)->state) t->state = 0;
111
(*tp)->state= -t->state;
106
(*tp)->child[0]->state = -((*tp)->state > 0);
107
(*tp)->child[1]->state = (*tp)->state < 0;
111
*child = (*child)->child[i ^ 1];
112
(*tp)->child[i ^ 1] = t;
113
if ((*tp)->state) t->state = 0;
115
(*tp)->state = -t->state;
115
if(!(*tp)->state ^ !!*next)
119
if (!(*tp)->state ^ !!*next)
120
*tp= *next; *next= NULL;
129
void av_tree_destroy(AVTreeNode *t){
134
void av_tree_destroy(AVTreeNode *t)
131
137
av_tree_destroy(t->child[0]);
132
138
av_tree_destroy(t->child[1]);
137
void av_tree_enumerate(AVTreeNode *t, void *opaque, int (*cmp)(void *opaque, void *elem), int (*enu)(void *opaque, void *elem)){
139
int v= cmp ? cmp(opaque, t->elem) : 0;
140
if(v>=0) av_tree_enumerate(t->child[0], opaque, cmp, enu);
141
if(v==0) enu(opaque, t->elem);
142
if(v<=0) av_tree_enumerate(t->child[1], opaque, cmp, enu);
143
void av_tree_enumerate(AVTreeNode *t, void *opaque,
144
int (*cmp)(void *opaque, void *elem),
145
int (*enu)(void *opaque, void *elem))
148
int v = cmp ? cmp(opaque, t->elem) : 0;
150
av_tree_enumerate(t->child[0], opaque, cmp, enu);
152
enu(opaque, t->elem);
154
av_tree_enumerate(t->child[1], opaque, cmp, enu);
150
static int check(AVTreeNode *t){
152
int left= check(t->child[0]);
153
int right= check(t->child[1]);
162
static int check(AVTreeNode *t)
165
int left = check(t->child[0]);
166
int right = check(t->child[1]);
155
if(left>999 || right>999)
157
if(right - left != t->state)
159
if(t->state>1 || t->state<-1)
161
return FFMAX(left, right)+1;
168
if (left>999 || right>999)
170
if (right - left != t->state)
172
if (t->state>1 || t->state<-1)
174
return FFMAX(left, right) + 1;
166
static void print(AVTreeNode *t, int depth){
179
static void print(AVTreeNode *t, int depth)
168
for(i=0; i<depth*4; i++) av_log(NULL, AV_LOG_ERROR, " ");
182
for (i = 0; i < depth * 4; i++) av_log(NULL, AV_LOG_ERROR, " ");
170
184
av_log(NULL, AV_LOG_ERROR, "Node %p %2d %p\n", t, t->state, t->elem);
171
print(t->child[0], depth+1);
172
print(t->child[1], depth+1);
185
print(t->child[0], depth + 1);
186
print(t->child[1], depth + 1);
174
188
av_log(NULL, AV_LOG_ERROR, "NULL\n");
177
static int cmp(void *a, const void *b){
178
return (uint8_t*)a-(const uint8_t*)b;
191
static int cmp(void *a, const void *b)
193
return (uint8_t *) a - (const uint8_t *) b;
184
AVTreeNode *root= NULL, *node=NULL;
200
AVTreeNode *root = NULL, *node = NULL;
187
203
av_lfg_init(&prng, 1);
189
for(i=0; i<10000; i++){
205
for (i = 0; i < 10000; i++) {
190
206
int j = av_lfg_get(&prng) % 86294;
191
if(check(root) > 999){
207
if (check(root) > 999) {
192
208
av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
196
212
av_log(NULL, AV_LOG_ERROR, "inserting %4d\n", j);
198
node= av_mallocz(av_tree_node_size);
199
av_tree_insert(&root, (void*)(j+1), cmp, &node);
214
node = av_mallocz(av_tree_node_size);
215
av_tree_insert(&root, (void *) (j + 1), cmp, &node);
201
217
j = av_lfg_get(&prng) % 86294;
203
AVTreeNode *node2=NULL;
219
AVTreeNode *node2 = NULL;
204
220
av_log(NULL, AV_LOG_ERROR, "removing %4d\n", j);
205
av_tree_insert(&root, (void*)(j+1), cmp, &node2);
206
k= av_tree_find(root, (void*)(j+1), cmp, NULL);
221
av_tree_insert(&root, (void *) (j + 1), cmp, &node2);
222
k = av_tree_find(root, (void *) (j + 1), cmp, NULL);
208
224
av_log(NULL, AV_LOG_ERROR, "removal failure %d\n", i);