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

/illumos-gate/usr/src/man/man3avl/
H A DMakefile35 AVL_PREV.3avl \
45 AVL_PREV.3avl := LINKSRC = avl_first.3avl
/illumos-gate/usr/src/uts/common/sys/
H A Davl.h84 * AVL_PREV() - given a node go to previous lower one
200 * AVL_PREV() will return NULL if at the first node.
205 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro
226 * less = AVL_PREV(tree, node);
/illumos-gate/usr/src/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);
/illumos-gate/usr/src/uts/common/vm/
H A Das.h257 #define AS_SEGPREV(as, seg) AVL_PREV(&(as)->a_segtree, (seg))
H A Dvm_as.c436 lseg = AVL_PREV(&as->a_segtree, hseg);
/illumos-gate/usr/src/lib/libuutil/common/
H A Duu_avl.c303 return (AVL_PREV(&ap->ua_tree, node));
343 AVL_PREV(t, np);
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Ddsl_deadlist.c240 dle = AVL_PREV(&dl->dl_tree, dle);
285 dle_prev = AVL_PREV(&dl->dl_tree, dle);
H A Dvdev_queue.c543 while ((dio = AVL_PREV(t, first)) != NULL &&
602 last = AVL_PREV(t, last);
/illumos-gate/usr/src/uts/common/os/
H A Dlgrp.c4262 prev = AVL_PREV(tree, newseg);
4308 prev = AVL_PREV(tree, seg);
4360 AVL_PREV(tree, seg), seg);
H A Dkmem.c5174 sp = AVL_PREV(&cp->cache_partial_slabs, sp), i++) {
/illumos-gate/usr/src/man/man9f/
H A DMakefile663 AVL_PREV.9f \
1381 AVL_PREV.9f := LINKSRC = avl.9f

Completed in 85 milliseconds