AVL_AFTER
linkp = avl_nearest(&dlmgmt_id_avl, where, AVL_AFTER);
cm = avl_nearest(&cmap_mbs, where, AVL_AFTER);
entry = avl_walk(&nscdb->tree, entry, AVL_AFTER)) {
ix_insert_here(pos, new, AVL_AFTER);
avl_insert_here(list, ent, lastentry, AVL_AFTER);
ASSERT(direction == AVL_BEFORE || direction == AVL_AFTER);
return (avl_nearest(&ap->ua_tree, INDEX_DECODE(idx), AVL_AFTER));
AVL_AFTER)))
pwp = avl_nearest(tree, where, AVL_AFTER);
np = avl_walk(&mi->smi_hash_avl, np, AVL_AFTER)) {
np = avl_walk(&mi->smi_hash_avl, np, AVL_AFTER);
np = avl_walk(&mi->smi_hash_avl, np, AVL_AFTER)) {
db = avl_nearest(&dn->dn_dbufs, where, AVL_AFTER);
db = avl_nearest(&dn->dn_dbufs, where, AVL_AFTER);
db = avl_nearest(&dn->dn_dbufs, where, AVL_AFTER);
avl_nearest(&dl->dl_tree, where, AVL_AFTER) == NULL);
dle = avl_nearest(&dl->dl_tree, where, AVL_AFTER);
sio = avl_nearest(&queue->q_sios_by_addr, idx, AVL_AFTER);
msp = avl_nearest(t, idx, AVL_AFTER);
ref = avl_nearest(&rc->rc_tree, idx, AVL_AFTER);
ref = avl_nearest(&rc->rc_tree, idx, AVL_AFTER);
ve = avl_nearest(&vc->vc_offset_tree, where, AVL_AFTER);
zio = avl_nearest(tree, idx, AVL_AFTER);
idx, AVL_AFTER);
mze = avl_nearest(avl, idx, AVL_AFTER);
direction = AVL_AFTER;
lr = (locked_range_t *)avl_nearest(tree, where, AVL_AFTER);
avl_insert_here(tree, rear, front, AVL_AFTER);
next = avl_nearest(tree, where, AVL_AFTER);
next = (locked_range_t *)avl_nearest(tree, where, AVL_AFTER);
ill = avl_walk(avl_tree, ill, AVL_AFTER)) {
ill = avl_walk(avl_tree, ill, AVL_AFTER)) {
AVL_AFTER)) != NULL) {
tmp_ill, AVL_AFTER)) {
tmp_ill = avl_walk(&ifp->illif_avl_by_ppa, tmp_ill, AVL_AFTER);
phyi, AVL_AFTER)) {
ip = avl_nearest(&php->iph_rulebyid, where, AVL_AFTER);
ipnetif = avl_walk(tree, ipnetif, AVL_AFTER)) {
ipnetif = avl_walk(&ips->ips_avl_by_index, ipnetif, AVL_AFTER)) {
bfp = avl_nearest(&bip->bi_fwd, where, AVL_AFTER);
result = avl_nearest(sess_avl, where, AVL_AFTER);
sp = avl_walk(avl_tree, sp, AVL_AFTER)) {
svcp = avl_walk(avl_tree, svcp, AVL_AFTER)) {
svcp = avl_walk(avl_tree, svcp, AVL_AFTER)) {
txn = avl_walk(&mcip->mci_v6_pending_txn, txn, AVL_AFTER)) {
txn = avl_walk(&mcip->mci_v4_pending_txn, txn, AVL_AFTER)) {
ent = avl_nearest(avl, where, AVL_AFTER);
ct = avl_nearest(tree, where, AVL_AFTER);
ct = avl_nearest(&contract_avl, where, AVL_AFTER);
ct = avl_nearest(&p->p_ct_held, where, AVL_AFTER);
for (e = avl_first(t); e != NULL; e = avl_walk(t, e, AVL_AFTER))
for (e = avl_first(t); e != NULL; e = avl_walk(t, e, AVL_AFTER)) {
for (e = avl_first(t); e != NULL; e = avl_walk(t, e, AVL_AFTER)) {
wap = avl_nearest(&p->p_warea, real_where, AVL_AFTER);
pwp = avl_nearest(&as->a_wpage, where, AVL_AFTER);
#define smb_lavl_next(la, obj) avl_walk(&(la)->la_tree, obj, AVL_AFTER)
#define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER)
pwp = avl_nearest(&as->a_wpage, where, AVL_AFTER);
pwp = avl_nearest(&as->a_wpage, where, AVL_AFTER);
seg = avl_nearest(&as->a_segtree, where, AVL_AFTER);
AVL_AFTER);
seg = avl_nearest(&as->a_segtree, where, AVL_AFTER);
avl_insert_here(tree, tmp, next, AVL_AFTER);
walker = avl_nearest(tree, where, AVL_AFTER);
avl_insert_here(tree, tmp, *last, AVL_AFTER);
avl_insert_here(tree, tmp, *last, AVL_AFTER);
avl_insert_here(tree, tmp, next, AVL_AFTER);
avl_insert_here(tree, tmp, next, AVL_AFTER);
node = avl_nearest(by_addr, where, AVL_AFTER);
span = avl_nearest(by_size, where, AVL_AFTER);