Lines Matching refs:child
26 struct AVTreeNode *child[2];
38 return av_tree_find(t->child[(v>>31)^1], key, cmp, next);
41 av_tree_find(t->child[0], key, cmp, next);
42 av_tree_find(t->child[1], key, cmp, next);
58 else if(t->child[0]||t->child[1]){
59 int i= !t->child[0];
61 av_tree_find(t->child[i], key, cmp, next_elem);
70 ret= av_tree_insert(&t->child[v>>31], key, cmp, next);
73 AVTreeNode **child= &t->child[i];
79 if((*child)->state*2 == -t->state)
80 rotate(child, i^1);
87 *tp= t->child[i];
88 t->child[i]= t->child[i]->child[i^1];
89 (*tp)->child[i^1]= t;
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;
103 (*tp)->child[0]->state= -((*tp)->state>0);
104 (*tp)->child[1]->state= (*tp)->state<0 ;
107 *tp= *child;
108 *child= (*child)->child[i^1];
109 (*tp)->child[i^1]= t;
132 av_tree_destroy(t->child[0]);
133 av_tree_destroy(t->child[1]);
141 if(v>=0) av_tree_enumerate(t->child[0], opaque, f);
142 if(v<=0) av_tree_enumerate(t->child[1], opaque, f);
150 int left= check(t->child[0]);
151 int right= check(t->child[1]);
169 print(t->child[0], depth+1);
170 print(t->child[1], depth+1);