226 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction)  in avl_nearest()  argument
228 	int child = AVL_INDEX2CHILD(where);  in avl_nearest()
229 	avl_node_t *node = AVL_INDEX2NODE(where);  in avl_nearest()
255 avl_find(avl_tree_t *tree, const void *value, avl_index_t *where)  in avl_find()  argument
272 			if (where != NULL)  in avl_find()
273 				*where = 0;  in avl_find()
281 	if (where != NULL)  in avl_find()
282 		*where = AVL_MKINDEX(prev, child);  in avl_find()
482 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where)  in avl_insert()  argument
485 	avl_node_t *parent = AVL_INDEX2NODE(where);  in avl_insert()
488 	int which_child = AVL_INDEX2CHILD(where);  in avl_insert()
634 	avl_index_t where;  in avl_add()  local
644 	if (avl_find(tree, new_node, &where) != NULL)  in avl_add()
651 	avl_insert(tree, new_node, where);  in avl_add()