Lines Matching refs:set
21 void bch_dump_bset(struct btree_keys *b, struct bset *i, unsigned int set)
28 pr_err("block %u key %u/%u: ", set,
49 bch_dump_bset(b, b->set[i].data,
50 bset_sector_offset(b, b->set[i].data));
294 struct bset_tree *t = b->set;
319 struct bset_tree *t = b->set;
359 * b->set[0].data is allocated in bch_btree_keys_alloc(), so we
360 * don't have to initiate b->set[].size and b->set[].data here
510 * in one cacheline in t->set (BSET_CACHELINE bytes).
555 * For the write set - the one we're currently inserting keys into - we don't
572 * If most significant bit of f->exponent is not set, then
576 * if most isgnificant bits of f->exponent is set, then
582 * is set or not.
639 if (t != b->set) {
647 while (t < b->set + MAX_BSETS)
660 if (t->tree != b->set->tree + btree_keys_cachelines(b)) {
668 if (i != b->set->data) {
669 b->set[++b->nsets].data = i;
670 i->seq = b->set->data->seq;
702 b->set->tree + btree_keys_cachelines(b) - t->tree);
741 for (t = b->set; t <= bset_tree_last(b); t++)
818 if (t->size == b->set->tree + btree_keys_cachelines(b) - t->tree)
887 * If k has preceding key, preceding_key_p will be set to address
888 * of k's preceding key; otherwise preceding_key_p will be set
1021 * * The set is too small to have a search tree, so we just do a linear
1022 * search over the whole set.
1023 * * The set is the one we're currently inserting into; keeping a full
1037 * of bits, and keys above and below the set it covers might
1125 return __bch_btree_iter_init(b, iter, search, b->set);
1267 out->magic = b->set->data->magic;
1268 out->seq = b->set->data->seq;
1269 out->version = b->set->data->version;
1270 swap(out, b->set->data);
1272 b->set[start].data->keys = out->keys;
1273 memcpy(b->set[start].data->start, out->start,
1295 __bch_btree_iter_init(b, &iter, NULL, &b->set[start]);
1301 keys += b->set[i].data->keys;
1303 order = get_order(__set_bytes(b->set->data, keys));
1326 btree_mergesort(b, new->set->data, &iter, false, true);
1330 new->set->size = 0; // XXX: why?
1347 if (b->set[i].data->keys < crit) {
1368 struct bset_tree *t = &b->set[i];