AVL_BEFORE
ix_insert_here(pos, new, AVL_BEFORE);
p = avl_nearest(l, where, AVL_BEFORE);
ASSERT(direction == AVL_BEFORE || direction == AVL_AFTER);
return (avl_nearest(&ap->ua_tree, INDEX_DECODE(idx), AVL_BEFORE));
AVL_BEFORE);
dle = avl_nearest(&dl->dl_tree, where, AVL_BEFORE);
dle = avl_nearest(&dl->dl_tree, where, AVL_BEFORE);
int direction = AVL_BEFORE;
if (direction == AVL_BEFORE) {
lr = (locked_range_t *)avl_nearest(tree, where, AVL_BEFORE);
prev = (locked_range_t *)avl_nearest(tree, where, AVL_BEFORE);
result = avl_nearest(sess_avl, where, AVL_BEFORE);
AVL_BEFORE);
AVL_BEFORE);
wap = avl_nearest(&p->p_warea, real_where, AVL_BEFORE);
#define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE)
walker = avl_nearest(tree, where, AVL_BEFORE);
node = avl_nearest(by_addr, where, AVL_BEFORE);
span = avl_nearest(by_size, where, AVL_BEFORE);
span = avl_nearest(®ion->vr_spans, where, AVL_BEFORE);