Lines Matching refs:set
171 b->written < btree_blocks(b) && i->seq == b->keys.set[0].data->seq;
198 err = "empty set";
199 if (i != b->keys.set[0].data && !i->keys)
211 if (i->seq == b->keys.set[0].data->seq)
216 i = b->keys.set[0].data;
218 if (b->keys.set[0].size &&
219 bkey_cmp(&b->key, &b->keys.set[0].end) < 0)
259 bch_bio_map(bio, b->keys.set[0].data);
419 /* If caller isn't waiting for write, parent refcount is cache set */
443 * do verify if there was more than one set initially (i.e. we did a
444 * sort) and we sorted down to a single set:
508 /* Force write if set is too big */
618 BUG_ON(btree_node_dirty(b) && !b->keys.set[0].data);
825 c->verify_data->keys.set->data)
944 if (!b->keys.set[0].data)
955 if (!b->keys.set->data)
1048 for (; i <= b->keys.nsets && b->keys.set[i].size; i++) {
1049 prefetch(b->keys.set[i].tree);
1050 prefetch(b->keys.set[i].data);
1054 prefetch(b->keys.set[i].data);
1092 pr_debug("bnode %p journal_flush set, retry\n", b);
1144 bch_bset_init_next(&b->keys, b->keys.set->data, bset_magic(&b->c->cache->sb));
1326 for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++)
1379 __set_blocks(b->keys.set[0].data, keys,
1834 /* if CACHE_SET_IO_DISABLE set, gc thread should stop too */
2378 bch_btree_init_next(b); /* just wrote a set */