Add support to CorePNG P-frames.
[libav.git] / libavutil / tree.c
CommitLineData
9eb88fde
MN
1/*
2 * copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
3 *
4 * This file is part of FFmpeg.
5 *
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.
10 *
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.
15 *
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
19 */
20
21#include "common.h"
22#include "log.h"
23#include "tree.h"
24
25typedef struct AVTreeNode{
26 struct AVTreeNode *child[2];
27 void *elem;
28 int state;
29}AVTreeNode;
30
6e8b982b
MN
31const int av_tree_node_size = sizeof(AVTreeNode);
32
9eb88fde
MN
33void *av_tree_find(const AVTreeNode *t, void *key, int (*cmp)(void *key, const void *b), void *next[2]){
34 if(t){
2e1d2873 35 unsigned int v= cmp(key, t->elem);
9eb88fde 36 if(v){
2e1d2873
MN
37 if(next) next[v>>31]= t->elem;
38 return av_tree_find(t->child[(v>>31)^1], key, cmp, next);
9eb88fde 39 }else{
116d15cc
MN
40 if(next){
41 av_tree_find(t->child[0], key, cmp, next);
42 av_tree_find(t->child[1], key, cmp, next);
43 }
9eb88fde
MN
44 return t->elem;
45 }
46 }
47 return NULL;
48}
49
6e8b982b 50void *av_tree_insert(AVTreeNode **tp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next){
9eb88fde
MN
51 AVTreeNode *t= *tp;
52 if(t){
53 unsigned int v= cmp(t->elem, key);
f05dda3b
MN
54 void *ret;
55 if(!v){
56 if(*next)
57 return t->elem;
58 else if(t->child[0]||t->child[1]){
59 int i= !t->child[0];
f05dda3b 60 void *next_elem[2];
3f161c7e 61 av_tree_find(t->child[i], key, cmp, next_elem);
f05dda3b
MN
62 key= t->elem= next_elem[i];
63 v= -i;
64 }else{
65 *next= t;
66 *tp=NULL;
67 return NULL;
68 }
69 }
a35bf971
MN
70 ret= av_tree_insert(&t->child[v>>31], key, cmp, next);
71 if(!ret){
72 int i= (v>>31) ^ !!*next;
73 AVTreeNode **child= &t->child[i];
74 t->state += 2*i - 1;
f05dda3b 75
a35bf971
MN
76 if(!(t->state&1)){
77 if(t->state){
51198a87
MN
78 /* The following code is equivalent to
79 if((*child)->state*2 == -t->state)
80 rotate(child, i^1);
81 rotate(tp, i);
82
83 with rotate():
84 static void rotate(AVTreeNode **tp, int i){
85 AVTreeNode *t= *tp;
86
87 *tp= t->child[i];
88 t->child[i]= t->child[i]->child[i^1];
89 (*tp)->child[i^1]= t;
90 i= 4*t->state + 2*(*tp)->state + 12;
91 t ->state= ((0x614586 >> i) & 3)-1;
92 (*tp)->state= ((*tp)->state>>1) + ((0x400EEA >> i) & 3)-1;
93 }
94 but such a rotate function is both bigger and slower
95 */
a35bf971
MN
96 if((*child)->state*2 == -t->state){
97 *tp= (*child)->child[i^1];
98 (*child)->child[i^1]= (*tp)->child[i];
99 (*tp)->child[i]= *child;
100 *child= (*tp)->child[i^1];
101 (*tp)->child[i^1]= t;
9eb88fde 102
a35bf971
MN
103 (*tp)->child[0]->state= -((*tp)->state>0);
104 (*tp)->child[1]->state= (*tp)->state<0 ;
105 (*tp)->state=0;
106 }else{
107 *tp= *child;
108 *child= (*child)->child[i^1];
109 (*tp)->child[i^1]= t;
110 if((*tp)->state) t->state = 0;
111 else t->state>>= 1;
112 (*tp)->state= -t->state;
9eb88fde 113 }
9eb88fde
MN
114 }
115 }
a35bf971
MN
116 if(!(*tp)->state ^ !!*next)
117 return key;
118 }
119 return ret;
9eb88fde 120 }else{
6e8b982b 121 *tp= *next; *next= NULL;
eed36075
MN
122 if(*tp){
123 (*tp)->elem= key;
124 return NULL;
125 }else
126 return key;
9eb88fde
MN
127 }
128}
129
130void av_tree_destroy(AVTreeNode *t){
d8bd113e 131 if(t){
045cbba9
AJ
132 av_tree_destroy(t->child[0]);
133 av_tree_destroy(t->child[1]);
134 av_free(t);
d8bd113e 135 }
9eb88fde
MN
136}
137
138#if 0
139void av_tree_enumerate(AVTreeNode *t, void *opaque, int (*f)(void *opaque, void *elem)){
33206876
MN
140 int v= f(opaque, t->elem);
141 if(v>=0) av_tree_enumerate(t->child[0], opaque, f);
142 if(v<=0) av_tree_enumerate(t->child[1], opaque, f);
9eb88fde
MN
143}
144#endif
145
146#ifdef TEST
294eaa26
DB
147
148#include "lfg.h"
149
9eb88fde
MN
150static int check(AVTreeNode *t){
151 if(t){
152 int left= check(t->child[0]);
153 int right= check(t->child[1]);
154
155 if(left>999 || right>999)
156 return 1000;
157 if(right - left != t->state)
158 return 1000;
159 if(t->state>1 || t->state<-1)
160 return 1000;
161 return FFMAX(left, right)+1;
162 }
163 return 0;
164}
165
166static void print(AVTreeNode *t, int depth){
167 int i;
168 for(i=0; i<depth*4; i++) av_log(NULL, AV_LOG_ERROR, " ");
169 if(t){
168fffdf 170 av_log(NULL, AV_LOG_ERROR, "Node %p %2d %p\n", t, t->state, t->elem);
9eb88fde
MN
171 print(t->child[0], depth+1);
172 print(t->child[1], depth+1);
173 }else
174 av_log(NULL, AV_LOG_ERROR, "NULL\n");
175}
176
168fffdf
BF
177static int cmp(void *a, const void *b){
178 return (uint8_t*)a-(const uint8_t*)b;
9eb88fde
MN
179}
180
f8a80fd6 181int main(void){
168fffdf
BF
182 int i;
183 void *k;
f05dda3b 184 AVTreeNode *root= NULL, *node=NULL;
294eaa26
DB
185 AVLFG prn;
186
187 av_lfg_init(&prn, 1);
9eb88fde
MN
188
189 for(i=0; i<10000; i++){
294eaa26 190 int j = av_lfg_get(&prn) % 86294;
9eb88fde
MN
191 if(check(root) > 999){
192 av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
193 print(root, 0);
194 return -1;
195 }
196 av_log(NULL, AV_LOG_ERROR, "inserting %4d\n", j);
f05dda3b
MN
197 if(!node)
198 node= av_mallocz(av_tree_node_size);
199 av_tree_insert(&root, (void*)(j+1), cmp, &node);
200
294eaa26 201 j = av_lfg_get(&prn) % 86294;
eed36075 202 {
f05dda3b 203 AVTreeNode *node2=NULL;
5d1e3d22 204 av_log(NULL, AV_LOG_ERROR, "removing %4d\n", j);
f05dda3b
MN
205 av_tree_insert(&root, (void*)(j+1), cmp, &node2);
206 k= av_tree_find(root, (void*)(j+1), cmp, NULL);
207 if(k)
89c9ff50 208 av_log(NULL, AV_LOG_ERROR, "removal failure %d\n", i);
f05dda3b 209 }
9eb88fde
MN
210 }
211 return 0;
212}
213#endif