Searched refs:cacheline_to_bkey (Results 1 - 2 of 2) sorted by relevance
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| H A D | bset.c | 516 * cacheline_to_bkey() and friends abstract out all the pointer arithmetic to
525 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey() function
541 return (u64 *) k - (u64 *) cacheline_to_bkey(t, cacheline, 0); in bkey_to_cacheline_offset()
546 return cacheline_to_bkey(t, to_inorder(j, t), t->tree[j].m); in tree_to_bkey()
560 return cacheline_to_bkey(t, cacheline, t->prev[cacheline]); in table_to_bkey()
811 while (k < cacheline_to_bkey(t, j, 0)) in bch_bset_fix_lookup_table()
991 l = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
995 r = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
999 r = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
1003 l = cacheline_to_bkey( in bset_search_tree()
[all...] |
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| H A D | bset.c | 516 * cacheline_to_bkey() and friends abstract out all the pointer arithmetic to
525 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey() function
541 return (u64 *) k - (u64 *) cacheline_to_bkey(t, cacheline, 0); in bkey_to_cacheline_offset()
546 return cacheline_to_bkey(t, to_inorder(j, t), t->tree[j].m); in tree_to_bkey()
560 return cacheline_to_bkey(t, cacheline, t->prev[cacheline]); in table_to_bkey()
813 while (k < cacheline_to_bkey(t, j, 0)) in bch_bset_fix_lookup_table()
995 l = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
999 r = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
1003 r = cacheline_to_bkey(t, inorder, f->m); in bset_search_tree()
1007 l = cacheline_to_bkey( in bset_search_tree()
[all...] |
Completed in 3 milliseconds