D | tree.c | 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() [all …]
|