Lines Matching refs:bkey
23 struct bkey *k, *next;
58 struct bkey *k;
69 struct bkey *k, *p = NULL;
113 struct bkey *k = iter->data->k, *next = bkey_next(k);
159 struct bkey *bch_keylist_pop(struct keylist *l)
161 struct bkey *k = l->keys;
184 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,
197 bool __bch_cut_front(const struct bkey *where, struct bkey *k)
217 bool __bch_cut_back(const struct bkey *where, struct bkey *k)
507 * Cacheline/offset <-> bkey pointer arithmetic:
525 static struct bkey *cacheline_to_bkey(struct bset_tree *t,
532 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k)
539 struct bkey *k)
544 static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j)
549 static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j)
558 static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline)
574 * - p[0] points to bkey->low
575 * - p[-1] borrows bits from KEY_INODE() of bkey->high
578 * - p[0] points to bits from KEY_INODE() of bkey->high
580 * bkey->high too.
584 static inline unsigned int bfloat_mantissa(const struct bkey *k,
595 struct bkey *m = tree_to_bkey(t, j);
596 struct bkey *p = tree_to_prev_bkey(t, j);
598 struct bkey *l = is_power_of_2(j)
602 struct bkey *r = is_power_of_2(j + 1)
615 * how many different bits in least significant bits of bkey->low.
683 * accelerate bkey search in a btree node (pointed by bset_tree->data in
686 * bset_tree->data where the searching bkey might be inside. Then a followed
693 struct bkey *prev = NULL, *k = t->data->start;
738 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k)
785 struct bkey *k)
840 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r)
857 void bch_bset_insert(struct btree_keys *b, struct bkey *where,
858 struct bkey *insert)
876 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k,
877 struct bkey *replace_key)
881 struct bkey *m, *prev = NULL;
883 struct bkey preceding_key_on_stack = ZERO_KEY;
884 struct bkey *preceding_key_p = &preceding_key_on_stack;
936 struct bkey *l, *r;
940 const struct bkey *search)
960 const struct bkey *search)
962 struct bkey *l, *r;
1015 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,
1016 const struct bkey *search)
1094 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,
1095 struct bkey *end)
1103 static struct bkey *__bch_btree_iter_init(struct btree_keys *b,
1105 struct bkey *search,
1108 struct bkey *ret = NULL;
1125 struct bkey *bch_btree_iter_init(struct btree_keys *b,
1127 struct bkey *search)
1132 static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter,
1136 struct bkey *ret = NULL;
1158 struct bkey *bch_btree_iter_next(struct btree_iter *iter)
1164 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,
1167 struct bkey *ret;
1199 struct bkey *k, *last = NULL;
1201 bool (*bad)(struct btree_keys *, const struct bkey *) = remove_stale