Searched refs:bkey_to_cacheline (Results 1 – 3 of 3) sorted by relevance
| /dports/multimedia/v4l_compat/linux-5.13-rc2/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()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/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()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/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()
|