BTREE_CORE_ELEMS
uintptr_t btc_children[BTREE_CORE_ELEMS + 1];
BTREE_CORE_ELEMS * elem_size;
BTREE_CORE_ELEMS * bwd->bwd_btree.bt_elem_size);
BTREE_CORE_ELEMS * bwd->bwd_btree.bt_elem_size);
ASSERT3U(idx, <=, BTREE_CORE_ELEMS);
ASSERT3U(idx + count, <=, BTREE_CORE_ELEMS);
BTREE_CORE_ELEMS * tree->bt_elem_size);
uint32_t min_count = (BTREE_CORE_ELEMS / 2) - 1;
ASSERT3U(idx, <, BTREE_CORE_ELEMS);
VERIFY3P(hdr->bth_count, >=, BTREE_CORE_ELEMS / 2 - 1);
i < BTREE_CORE_ELEMS * size; i++)
for (uint32_t i = hdr->bth_count + 1; i <= BTREE_CORE_ELEMS;
ASSERT3U(par_hdr->bth_count, <, BTREE_CORE_ELEMS);
kmem_alloc(sizeof (zfs_btree_core_t) + BTREE_CORE_ELEMS *
if (par_hdr->bth_count != BTREE_CORE_ELEMS) {
uint32_t move_count = MAX((BTREE_CORE_ELEMS / (tree->bt_bulk == NULL ?
uint32_t keep_count = BTREE_CORE_ELEMS - move_count - 1;
ASSERT3U(BTREE_CORE_ELEMS - move_count, >=, 2);
BTREE_CORE_ELEMS * size, KM_SLEEP);
for (uint32_t i = hdr->bth_count + 1; i <= BTREE_CORE_ELEMS;
capacity = BTREE_CORE_ELEMS;
(BTREE_CORE_ELEMS - hdr->bth_count) * size);
zfs_btree_hdr_t *btc_children[BTREE_CORE_ELEMS + 1];