Lines Matching defs:where
86 * adjacent to where a new value would be inserted in the tree. The value
213 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction)
215 int child = AVL_INDEX2CHILD(where);
216 avl_node_t *node = AVL_INDEX2NODE(where);
240 * *where (if not NULL) is set to indicate the insertion point
244 avl_find(avl_tree_t *tree, void *value, avl_index_t *where)
263 if (where != NULL)
264 *where = 0;
272 if (where != NULL)
273 *where = AVL_MKINDEX(prev, child);
473 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where)
476 avl_node_t *parent = AVL_INDEX2NODE(where);
479 int which_child = AVL_INDEX2CHILD(where);
616 avl_index_t where;
621 if (avl_find(tree, new_node, &where) != NULL) {
626 avl_insert(tree, new_node, where);
720 * Put tmp where node used to be (just temporary).