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