Searched refs:nsets (Results 1 – 4 of 4) sorted by relevance
212 uint8_t nsets; member228 return b->set + b->nsets; in bset_tree_last()233 return t <= b->set + b->nsets - b->last_set_unwritten; in bset_written()238 return !b->last_set_unwritten || k < b->set[b->nsets].data->start; in bkey_written()
46 for (i = 0; i <= b->nsets; i++) in bch_dump_bucket()350 b->nsets = 0; in bch_btree_keys_init()621 b->set[++b->nsets].data = i; in bch_bset_init_next()991 BUG_ON(!b->nsets && in __bch_bset_search()1201 b->nsets = start; in __btree_sort()1243 for (i = start; i <= b->nsets; i++) in bch_btree_sort_partial()1285 if (!b->nsets) in bch_btree_sort_lazy()1288 for (i = b->nsets - 1; i >= 0; --i) { in bch_btree_sort_lazy()1298 if (b->nsets + 1 == MAX_BSETS) { in bch_btree_sort_lazy()1312 for (i = 0; i <= b->nsets; i++) { in bch_btree_keys_stats()
165 if (b->level && b->keys.nsets) in bch_btree_init_next()479 unsigned nsets = b->keys.nsets; in bch_btree_node_write() local489 if (nsets && !b->keys.nsets) in bch_btree_node_write()1008 for (; i <= b->keys.nsets && b->keys.set[i].size; i++) { in bch_btree_node_get()1013 for (; i <= b->keys.nsets; i++) in bch_btree_node_get()1269 for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++) in btree_gc_mark_node()
253 __entry->keys = b->keys.set[b->keys.nsets].data->keys;