Searched refs:AVL_NEXT (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dspace_reftree.c114 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))
131 for (sr = avl_first(t); sr != NULL; sr = AVL_NEXT(t, sr)) {
H A Dzfs_rlock.c293 prev = AVL_NEXT(tree, prev); /* move to rear range */
321 for (prev = NULL; next; prev = next, next = AVL_NEXT(tree, next)) {
393 next = AVL_NEXT(tree, prev);
396 for (; next; next = AVL_NEXT(tree, next)) {
502 next = AVL_NEXT(tree, rl);
H A Dspa_errlog.c204 for (se = avl_first(list); se != NULL; se = AVL_NEXT(list, se)) {
316 for (se = avl_first(t); se != NULL; se = AVL_NEXT(t, se)) {
H A Dvdev_queue.c738 first = AVL_NEXT(t, first);
748 while ((dio = AVL_NEXT(t, last)) != NULL &&
773 while ((dio = AVL_NEXT(t, nio)) != NULL &&
791 dio = AVL_NEXT(t, last);
817 nio = AVL_NEXT(t, dio);
H A Ddsl_deadlist.c357 dle = AVL_NEXT(&dl->dl_tree, dle)) {
423 dle = AVL_NEXT(&dl->dl_tree, dle)) {
554 dle_next = AVL_NEXT(&dl->dl_tree, dle);
H A Drange_tree.c111 rs = AVL_NEXT(&rt->rt_root, rs)) {
586 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))
H A Dvdev_cache.c373 ve = AVL_NEXT(&vc->vc_offset_tree, ve);
H A Ddnode_sync.c457 db_next = AVL_NEXT(&dn->dn_dbufs, &db_marker);
462 db_next = AVL_NEXT(&dn->dn_dbufs, db);
H A Dvdev_initialize.c333 rs = AVL_NEXT(rt, rs)) {
490 rs = AVL_NEXT(&msp->ms_allocatable->rt_root, rs)) {
H A Ddsl_deleg.c605 setnode = AVL_NEXT(&permsets, setnode)) {
H A Dzfs_fuid.c255 domnode = AVL_NEXT(&zfsvfs->z_fuid_domain, domnode)) {
H A Dsa.c443 findtb = AVL_NEXT(&sa->sa_layout_hash_tree, findtb)) {
468 tb = AVL_NEXT(&sa->sa_layout_hash_tree, tb)) {
H A Dzap_micro.c329 for (; mze && mze->mze_hash == zn->zn_hash; mze = AVL_NEXT(avl, mze)) {
353 mze && mze->mze_hash == hash; mze = AVL_NEXT(avl, mze)) {
H A Dspa_misc.c950 return (AVL_NEXT(&spa_namespace_avl, prev));
1522 for (spa = avl_first(t); spa != NULL; spa = AVL_NEXT(t, spa)) {
H A Dspace_map.c679 for (range_seg_t *rs = avl_first(t); rs != NULL; rs = AVL_NEXT(t, rs)) {
H A Ddnode.c1381 db = AVL_NEXT(&dn->dn_dbufs, db)) {
1569 for (; db != NULL; db = AVL_NEXT(&dn->dn_dbufs, db)) {
H A Dddt.c990 rdde_next = AVL_NEXT(t, rdde);
H A Dmetaslab.c1262 rs = AVL_NEXT(t, rs);
2231 for (msp = avl_first(t); msp != NULL; msp = AVL_NEXT(t, msp)) {
3035 for (; msp != NULL; msp = AVL_NEXT(t, msp)) {
H A Dvdev_removal.c974 while ((rs = AVL_NEXT(&segs->rt_root, rs)) != NULL) {
H A Ddsl_scan.c1074 sds != NULL; sds = AVL_NEXT(&scn->scn_queue, sds)) {
2690 next_sio = AVL_NEXT(&queue->q_sios_by_addr, sio);
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h88 * AVL_NEXT() - given a node go to next higher one
212 * AVL_NEXT() will return NULL if at the last node.
217 #define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER) macro
/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
832 ASSERT(((neighbor = AVL_NEXT(t, obj)) == NULL) ||
852 neighbor = AVL_NEXT(t, obj);
872 neighbor = AVL_NEXT(t, obj);
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libuutil/common/
H A Duu_avl.c299 return (AVL_NEXT(&ap->ua_tree, node));
344 wp->uaw_next_result = (wp->uaw_dir > 0)? AVL_NEXT(t, np) :
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libzfs/common/
H A Dlibzfs_iter.c291 for (node = avl_first(&avl); node != NULL; node = AVL_NEXT(&avl, node))
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/acl/
H A Dacl_common.c1135 vals = AVL_NEXT(&list->user, vals)) {
1159 vals = AVL_NEXT(&list->group, vals)) {

Completed in 395 milliseconds

12