Lines Matching defs:keys
3 * Code for working with individual keys, and sorted sets of keys with in a
29 (unsigned int) ((u64 *) k - i->d), i->keys);
82 err = "Overlapping keys";
89 err = "Duplicate keys";
161 struct bkey *k = l->keys;
175 l->top_p -= bkey_u64s(l->keys);
177 memmove(l->keys,
178 bkey_next(l->keys),
267 /* Space required for the btree node keys */
520 * immediately preceding it is: we have to check if the two keys differ in the
555 * For the write set - the one we're currently inserting keys into - we don't
603 ? bset_bkey_idx(t->data, t->data->keys - bkey_u64s(&t->end))
676 i->keys = 0;
864 __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) >
871 t->data->keys += bkey_u64s(insert);
1041 * of bits, and keys above and below the set it covers might
1230 out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;
1232 pr_debug("sorted %i keys\n", out->keys);
1276 b->set[start].data->keys = out->keys;
1295 size_t order = b->page_order, keys = 0;
1305 keys += b->set[i].data->keys;
1307 order = get_order(__set_bytes(b->set->data, keys));
1351 if (b->set[i].data->keys < crit) {
1373 size_t bytes = t->data->keys * sizeof(uint64_t);