Searched refs:bkey_to_cacheline (Results 1 – 2 of 2) sorted by relevance
| /linux/drivers/md/bcache/ |
| H A D | bset.c | 532 static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k) in bkey_to_cacheline() function
701 bkey_to_cacheline(t, bset_bkey_last(t->data)), in bch_bset_build_written_tree()
715 while (bkey_to_cacheline(t, k) < cacheline) { in bch_bset_build_written_tree()
752 inorder = bkey_to_cacheline(t, k); in bch_bset_fix_invalidated_key()
788 unsigned int j = bkey_to_cacheline(t, k); in bch_bset_fix_lookup_table()
828 if (t->size == bkey_to_cacheline(t, k)) { in bch_bset_fix_lookup_table()
1055 t->size < bkey_to_cacheline(t, bset_bkey_last(t->data))); in __bch_bset_search()
1064 inorder_to_tree(bkey_to_cacheline(t, i.l), t)), in __bch_bset_search()
|
| /linux/fs/bcachefs/ |
| H A D | bset.c | 438 static unsigned bkey_to_cacheline(const struct btree *b, in bkey_to_cacheline() function
710 t->size = min(bkey_to_cacheline(b, t, btree_bkey_last(b, t)), in __build_ro_aux_tree()
723 while (bkey_to_cacheline(b, t, k) < cacheline) in __build_ro_aux_tree()
845 j = min_t(unsigned, t->size - 1, bkey_to_cacheline(b, t, k)); in __bkey_prev()
1557 inorder = bkey_to_cacheline(b, t, k); in bch2_bfloat_to_text()
|