Searched refs:AVL_PREV (Results 1 - 9 of 9) sorted by relevance
/freebsd-current/sys/cddl/contrib/opensolaris/uts/common/sys/ |
H A D | avl.h | 89 * AVL_PREV() - given a node go to previous lower one 220 * AVL_PREV() will return NULL if at the first node. 225 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro 246 * less = AVL_PREV(tree, node);
|
/freebsd-current/sys/contrib/openzfs/include/sys/ |
H A D | avl.h | 89 * AVL_PREV() - given a node go to previous lower one 212 * AVL_PREV() will return NULL if at the first node. 217 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) macro 238 * less = AVL_PREV(tree, node);
|
/freebsd-current/sys/contrib/openzfs/module/avl/ |
H A D | avl.c | 552 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since 808 neighbor = AVL_PREV(t, obj); 822 ASSERT(((neighbor = AVL_PREV(t, obj)) == NULL) || 839 neighbor = AVL_PREV(t, obj);
|
/freebsd-current/sys/contrib/openzfs/tests/zfs-tests/cmd/ |
H A D | btree_test.c | 115 node = AVL_PREV(avl, node); 145 if ((inp = AVL_PREV(avl, node)) != NULL) {
|
/freebsd-current/sys/contrib/openzfs/lib/libuutil/ |
H A D | uu_avl.c | 303 return (AVL_PREV(&ap->ua_tree, node)); 343 AVL_PREV(t, np);
|
/freebsd-current/sys/contrib/openzfs/module/zfs/ |
H A D | dsl_bookmark.c | 1038 AVL_PREV(&ds->ds_bookmarks, dbn); 1417 dbn = AVL_PREV(&ds->ds_bookmarks, dbn)) { 1518 dbn = AVL_PREV(&ds->ds_bookmarks, dbn)) { 1564 dbn = AVL_PREV(&ds->ds_bookmarks, dbn)) {
|
H A D | vdev_queue.c | 686 while ((dio = AVL_PREV(t, first)) != NULL && 760 last = AVL_PREV(t, last);
|
H A D | dsl_deadlist.c | 482 dle = AVL_PREV(&dl->dl_tree, dle); 556 dle_prev = AVL_PREV(&dl->dl_tree, dle);
|
H A D | spa_log_spacemap.c | 313 sls = AVL_PREV(&spa->spa_sm_logs_by_txg, sls)) {
|
Completed in 101 milliseconds