211 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction)  in avl_nearest()  argument
213 	int child = AVL_INDEX2CHILD(where);  in avl_nearest()
214 	avl_node_t *node = AVL_INDEX2NODE(where);  in avl_nearest()
240 avl_find(avl_tree_t *tree, const void *value, avl_index_t *where)  in avl_find()  argument
257 			if (where != NULL)  in avl_find()
258 				*where = 0;  in avl_find()
265 	if (where != NULL)  in avl_find()
266 		*where = AVL_MKINDEX(prev, child);  in avl_find()
466 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where)  in avl_insert()  argument
469 	avl_node_t *parent = AVL_INDEX2NODE(where);  in avl_insert()
472 	int which_child = AVL_INDEX2CHILD(where);  in avl_insert()
618 	avl_index_t where;  in avl_add()  local
628 	if (avl_find(tree, new_node, &where) != NULL)  in avl_add()
635 	avl_insert(tree, new_node, where);  in avl_add()