sa_lot_t
sizeof (sa_lot_t), offsetof(sa_lot_t, lot_num_node));
sizeof (sa_lot_t), offsetof(sa_lot_t, lot_hash_node));
sa_lot_t *layout;
kmem_free(layout, sizeof (sa_lot_t));
sa_iterfunc_t func, sa_lot_t *tab, void *userp)
sa_lot_t *tb = tab;
sa_lot_t search;
sa_lot_t *tb, search;
const sa_lot_t *node1 = (const sa_lot_t *)arg1;
const sa_lot_t *node2 = (const sa_lot_t *)arg2;
const sa_lot_t *node1 = (const sa_lot_t *)arg1;
const sa_lot_t *node2 = (const sa_lot_t *)arg2;
sa_layout_equal(sa_lot_t *tbf, sa_attr_type_t *attrs, int count)
static sa_lot_t *
sa_lot_t *tb, *findtb;
tb = kmem_zalloc(sizeof (sa_lot_t), KM_SLEEP);
int count, dmu_tx_t *tx, sa_lot_t **lot)
sa_lot_t *tb, tbsearch;
sa_lot_t *lot;
sa_lot_t *sa_layout;