neighbor
struct neighbor *n_next;
static struct neighbor *neighbors;
struct neighbor *np;
struct neighbor *np;
struct neighbor *np2;
np = (struct neighbor *)malloc(sizeof (*np));
void *neighbor;
ASSERT(((neighbor = AVL_NEXT(t, obj)) == NULL) ||
(t->avl_compar(obj, neighbor) <= 0));
neighbor = AVL_PREV(t, obj);
if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) < 0)) {
void *neighbor;
ASSERT(((neighbor = AVL_PREV(t, obj)) == NULL) ||
(t->avl_compar(obj, neighbor) >= 0));
neighbor = AVL_NEXT(t, obj);
if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) > 0)) {
void *neighbor;
neighbor = AVL_PREV(t, obj);
if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) < 0)) {
neighbor = AVL_NEXT(t, obj);
if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) > 0)) {
Freehdr neighbor; /* Node to be coalesced */
neighbor = *np;
while (neighbor != NIL) {
neigh_block = (char *)neighbor->block;
neigh_size = neighbor->size;
np = &neighbor->left;
np = &neighbor->right;
neighbor = *np;
zfs_btree_core_t *neighbor = (zfs_btree_core_t *)l_hdr;
neighbor->btc_children[l_hdr->bth_count];
uint8_t *take_elem = neighbor->btc_elems +
zfs_btree_core_t *neighbor = (zfs_btree_core_t *)r_hdr;
node->btc_children[hdr->bth_count] = neighbor->btc_children[0];
uint8_t *take_elem = neighbor->btc_elems;
bt_shift_core_left(tree, neighbor, 1, r_hdr->bth_count,
zfs_btree_leaf_t *neighbor = (zfs_btree_leaf_t *)l_hdr;
uint8_t *take_elem = neighbor->btl_elems +
bt_shrink_leaf(tree, neighbor, l_hdr->bth_count - 1, 1);
zfs_btree_leaf_t *neighbor = (zfs_btree_leaf_t *)r_hdr;
uint8_t *take_elem = neighbor->btl_elems +
bt_shrink_leaf(tree, neighbor, 0, 1);