Lines Matching refs:child
27 struct AVTreeNode *child[2];
47 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next);
50 av_tree_find(t->child[0], key, cmp, next);
51 av_tree_find(t->child[1], key, cmp, next);
69 else if (t->child[0] || t->child[1]) {
70 int i = !t->child[0];
72 av_tree_find(t->child[i], key, cmp, next_elem);
81 ret = av_tree_insert(&t->child[v >> 31], key, cmp, next);
84 AVTreeNode **child = &t->child[i];
90 * if ((*child)->state * 2 == -t->state)
91 * rotate(child, i ^ 1);
99 * *tp = t->child[i];
100 * t->child[i] = t->child[i]->child[i ^ 1];
101 * (*tp)->child[i ^ 1] = t;
109 if ((*child)->state * 2 == -t->state) {
110 *tp = (*child)->child[i ^ 1];
111 (*child)->child[i ^ 1] = (*tp)->child[i];
112 (*tp)->child[i] = *child;
113 *child = (*tp)->child[i ^ 1];
114 (*tp)->child[i ^ 1] = t;
116 (*tp)->child[0]->state = -((*tp)->state > 0);
117 (*tp)->child[1]->state = (*tp)->state < 0;
120 *tp = *child;
121 *child = (*child)->child[i ^ 1];
122 (*tp)->child[i ^ 1] = t;
149 av_tree_destroy(t->child[0]);
150 av_tree_destroy(t->child[1]);
162 av_tree_enumerate(t->child[0], opaque, cmp, enu);
166 av_tree_enumerate(t->child[1], opaque, cmp, enu);