Home
last modified time | relevance | path

Searched refs:btree_cache_freeable (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbtree.c540 list_move(&b->list, &b->c->btree_cache_freeable); in mca_bucket_free()
681 list_for_each_entry_safe_reverse(b, t, &c->btree_cache_freeable, list) { in bch_mca_scan()
746 list_splice(&c->btree_cache_freeable, in bch_btree_cache_free()
784 &c->btree_cache_freeable); in bch_btree_cache_alloc()
913 list_for_each_entry(b, &c->btree_cache_freeable, list) in mca_alloc()
H A Dbcache.h567 * btree_cache_freeable effectively is a small cache - we use it because
573 struct list_head btree_cache_freeable; member
576 /* Number of elements in btree_cache + btree_cache_freeable lists */
H A Dsuper.c1938 INIT_LIST_HEAD(&c->btree_cache_freeable); in bch_cache_set_alloc()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbtree.c540 list_move(&b->list, &b->c->btree_cache_freeable); in mca_bucket_free()
702 list_for_each_entry_safe_reverse(b, t, &c->btree_cache_freeable, list) { in bch_mca_scan()
767 list_splice(&c->btree_cache_freeable, in bch_btree_cache_free()
805 &c->btree_cache_freeable); in bch_btree_cache_alloc()
934 list_for_each_entry(b, &c->btree_cache_freeable, list) in mca_alloc()
H A Dbcache.h573 * btree_cache_freeable effectively is a small cache - we use it because
579 struct list_head btree_cache_freeable; member
582 /* Number of elements in btree_cache + btree_cache_freeable lists */
H A Dsuper.c1912 INIT_LIST_HEAD(&c->btree_cache_freeable); in bch_cache_set_alloc()

Completed in 17 milliseconds