avl_tree
GET_OFFSET(avl_tr_off, smb_avl_t, avl_tree);
uu_avl_t *avl_tree;
if ((avl_tree = uu_avl_create(avl_pool, NULL, UU_DEFAULT)) == NULL)
cb.cb_avl = avl_tree;
if ((node = uu_avl_first(avl_tree)) == NULL)
node = uu_avl_next(avl_tree, node);
uu_avl_remove(avl_tree, rmnode);
if (uu_avl_find(avl_tree, node, &sortinfo, &idx) == NULL)
uu_avl_insert(avl_tree, node, idx);
uu_avl_destroy(avl_tree);
struct avl_tree ua_tree;
quota = avl_find(avl_tree, &key, &where);
avl_insert(avl_tree, (void *)quota, where);
avl_tree_t *avl_tree = &qtree->qt_avl;
quota = avl_find(avl_tree, &key, &where);
quota = avl_first(avl_tree);
quota = avl_find(avl_tree, &key, &where);
quota = AVL_NEXT(avl_tree, quota);
quota = AVL_NEXT(avl_tree, quota);
avl_tree_t *avl_tree = &qtree->qt_avl;
quota = avl_find(avl_tree, &key, &where);
avl_tree_t *avl_tree = qarg->qa_avl;
avl_create(&avl->avl_tree, ops->avln_cmp, size, offset);
while ((node = avl_destroy_nodes(&avl->avl_tree, &cookie)) != NULL)
avl_destroy(&avl->avl_tree);
if (avl_find(&avl->avl_tree, item, &where) != NULL) {
avl_insert(&avl->avl_tree, item, where);
if ((rm_item = avl_find(&avl->avl_tree, item, &where)) == NULL) {
avl_remove(&avl->avl_tree, rm_item);
node = avl_find(&avl->avl_tree, item, NULL);
node = avl_first(&avl->avl_tree);
node = AVL_NEXT(&avl->avl_tree, cursor->avlc_next);
struct avl_tree *drc_guid_to_ds_map;
struct avl_tree;
struct avl_tree tree;
avl_tree_t *avl_tree;
avl_tree = &ifp->illif_avl_by_ppa;
for (ill = avl_first(avl_tree); ill != NULL;
ill = avl_walk(avl_tree, ill, AVL_AFTER)) {
avl_tree_t *avl_tree;
avl_tree = &ifp->illif_avl_by_ppa;
for (ill = avl_first(avl_tree); ill != NULL;
ill = avl_walk(avl_tree, ill, AVL_AFTER)) {
avl_tree_t *avl_tree;
avl_tree = &ifp->illif_avl_by_ppa;
ill = avl_first(avl_tree);
static struct avl_tree rdsv3_cong_tree;
extern struct avl_tree rdsv3_conn_hash;
struct avl_tree rdsv3_conn_hash;
rdsv3_mr_tree_walk(struct avl_tree *root, uint32_t key,
avl_tree_t *avl_tree;
avl_tree = &hcap->hca_active_tree;
for (sp = avl_first(avl_tree); sp != NULL;
sp = avl_walk(avl_tree, sp, AVL_AFTER)) {
avl_tree_t *avl_tree = &ibcm_svc_avl_tree;
for (svcp = avl_first(avl_tree); svcp != NULL;
svcp = avl_walk(avl_tree, svcp, AVL_AFTER)) {
for (svcp = avl_first(avl_tree); svcp != NULL;
svcp = avl_walk(avl_tree, svcp, AVL_AFTER)) {
avl_tree_t avl_tree;
rcas = avl_first(&hca->avl_tree);
avl_remove(&hca->avl_tree, rcas);
rcas = avl_first(&hca->avl_tree);
avl_remove(&hca->avl_tree, rcas);
rcas = avl_last(&hca->avl_tree);
avl_remove(&hca->avl_tree, rcas);
rcas = avl_last(&hca->avl_tree);
avl_remove(&hca->avl_tree, rcas);
avl_destroy(&hca->avl_tree);
if ((rcas = (cache_avl_struct_t *)avl_find(&hca->avl_tree, &cas,
if ((rcas = (cache_avl_struct_t *)avl_find(&hca->avl_tree,
avl_insert(&hca->avl_tree, rcas, where);
avl_find(&hca->avl_tree, &cas, &where)) == NULL) {
avl_create(&hca->avl_tree,
avl_tree_t avl_tree;
typedef struct avl_tree avl_tree_t;
extern void *avl_walk(struct avl_tree *, void *, int);
struct avl_tree rs_rdma_keys;