Searched refs:AVL_PREV (Results 1 - 11 of 11) sorted by relevance
/opensolaris-onvv-gate/usr/src/uts/common/sys/ |
H A D | avl.h | 85 * AVL_PREV() - given a node go to previous lower one 201 * AVL_PREV() will return NULL if at the first node. 206 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro 227 * less = AVL_PREV(tree, node);
|
/opensolaris-onvv-gate/usr/src/cmd/filebench/common/ |
H A D | fb_avl.h | 174 * This will only by used via AVL_NEXT() or AVL_PREV() 199 * AVL_PREV() - given a node go to previous lower one 315 * AVL_PREV() will return NULL if at the first node. 320 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro 341 * less = AVL_PREV(tree, node);
|
H A D | fb_avl.c | 568 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since 822 neighbor = AVL_PREV(t, obj); 836 if (!(((neighbor = AVL_PREV(t, obj)) == NULL) || 857 neighbor = AVL_PREV(t, obj);
|
/opensolaris-onvv-gate/usr/src/uts/common/fs/zfs/ |
H A D | vdev_queue.c | 217 while ((dio = AVL_PREV(t, fio)) != NULL && 277 lio = AVL_PREV(t, lio);
|
H A D | dsl_deadlist.c | 178 dle = AVL_PREV(&dl->dl_tree, dle); 223 dle_prev = AVL_PREV(&dl->dl_tree, dle);
|
/opensolaris-onvv-gate/usr/src/common/avl/ |
H A D | avl.c | 553 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since 820 neighbor = AVL_PREV(t, obj); 834 ASSERT(((neighbor = AVL_PREV(t, obj)) == NULL) || 851 neighbor = AVL_PREV(t, obj);
|
/opensolaris-onvv-gate/usr/src/uts/common/vm/ |
H A D | as.h | 246 #define AS_SEGPREV(as, seg) AVL_PREV(&(as)->a_segtree, (seg))
|
H A D | vm_as.c | 435 lseg = AVL_PREV(&as->a_segtree, hseg);
|
/opensolaris-onvv-gate/usr/src/lib/libuutil/common/ |
H A D | uu_avl.c | 304 return (AVL_PREV(&ap->ua_tree, node)); 344 AVL_PREV(t, np);
|
/opensolaris-onvv-gate/usr/src/uts/common/os/ |
H A D | lgrp.c | 4262 prev = AVL_PREV(tree, newseg); 4308 prev = AVL_PREV(tree, seg); 4360 AVL_PREV(tree, seg), seg);
|
H A D | kmem.c | 5150 sp = AVL_PREV(&cp->cache_partial_slabs, sp), i++) {
|
Completed in 209 milliseconds