Lines Matching refs:next
48 * @param next If next is not NULL, then next[0] will contain the previous
49 * element and next[1] the next element. If either does not exist,
50 * then the corresponding entry in next is unchanged.
54 void *av_tree_find(const struct AVTreeNode *root, void *key, int (*cmp)(void *key, const void *b), void *next[2]);
58 * If *next is NULL, then the supplied element will be removed if it exists.
59 * If *next is not NULL, then the supplied element will be inserted, unless
64 * @param next Used to allocate and free AVTreeNodes. For insertion the user
68 * For deleting elements *next is set to NULL by the user and
75 * void *tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next){
76 * if(!*next) *next= av_mallocz(av_tree_node_size);
77 * return av_tree_insert(rootp, key, cmp, next);
79 * void *tree_remove(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b, AVTreeNode **next)){
80 * av_freep(next);
81 * return av_tree_insert(rootp, key, cmp, next);
89 void *av_tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b), struct AVTreeNode **next);