Lines Matching defs:where
197 bool __bch_cut_front(const struct bkey *where, struct bkey *k)
201 if (bkey_cmp(where, &START_KEY(k)) <= 0)
204 if (bkey_cmp(where, k) < 0)
205 len = KEY_OFFSET(k) - KEY_OFFSET(where);
207 bkey_copy_key(k, where);
217 bool __bch_cut_back(const struct bkey *where, struct bkey *k)
221 if (bkey_cmp(where, k) >= 0)
224 BUG_ON(KEY_INODE(where) != KEY_INODE(k));
226 if (bkey_cmp(where, &START_KEY(k)) > 0)
227 len = KEY_OFFSET(where) - KEY_START(k);
229 bkey_copy_key(k, where);
434 * Return the cacheline index in bset_tree->data, where j is index
686 * bset_tree->data where the searching bkey might be inside. Then a followed
711 /* First we figure out where the first key in each cacheline is */
855 void bch_bset_insert(struct btree_keys *b, struct bkey *where,
865 memmove((uint64_t *) where + bkey_u64s(insert),
866 where,
867 (void *) bset_bkey_last(t->data) - (void *) where);
870 bkey_copy(where, insert);
871 bch_bset_fix_lookup_table(b, t, where);