Searched refs:AVL_PREV (Results 1 - 6 of 6) sorted by relevance

/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h89 * AVL_PREV() - given a node go to previous lower one
213 * AVL_PREV() will return NULL if at the first node.
218 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro
239 * less = AVL_PREV(tree, node);
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c565 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since
835 neighbor = AVL_PREV(t, obj);
849 ASSERT(((neighbor = AVL_PREV(t, obj)) == NULL) ||
866 neighbor = AVL_PREV(t, obj);
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libuutil/common/
H A Duu_avl.c305 return (AVL_PREV(&ap->ua_tree, node));
345 AVL_PREV(t, np);
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Ddsl_deadlist.c250 dle = AVL_PREV(&dl->dl_tree, dle);
300 dle_prev = AVL_PREV(&dl->dl_tree, dle);
H A Dvdev_queue.c724 while (t != NULL && (dio = AVL_PREV(t, first)) != NULL &&
797 last = AVL_PREV(t, last);
H A Dvdev_removal.c937 rs = AVL_PREV(&segs->rt_root, rs);

Completed in 299 milliseconds