Home
last modified time | relevance | path

Searched refs:btree_cache (Results 1 – 17 of 17) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_cache.c44 c->btree_cache.nr_reserve = reserve; in bch2_recalc_btree_reserve()
49 struct btree_cache *bc = container_of(list, struct btree_cache, live[list->idx]); in btree_cache_can_free()
57 static void btree_node_to_freedlist(struct btree_cache *bc, struct btree *b) in btree_node_to_freedlist()
67 static void __bch2_btree_node_to_freelist(struct btree_cache *bc, struct btree *b) in __bch2_btree_node_to_freelist()
78 struct btree_cache *bc = &c->btree_cache; in bch2_btree_node_to_freelist()
117 static void btree_node_data_free(struct btree_cache *bc, struct btree *b) in btree_node_data_free()
202 static inline bool __btree_node_pinned(struct btree_cache *bc, struct btree *b) in __btree_node_pinned()
215 struct btree_cache *bc = &c->btree_cache; in bch2_node_pin()
229 struct btree_cache *bc = &c->btree_cache; in bch2_btree_cache_unpin()
233 c->btree_cache.pinned_nodes_mask[0] = 0; in bch2_btree_cache_unpin()
[all …]
H A Dbtree_cache.h17 void __bch2_btree_node_hash_remove(struct btree_cache *, struct btree *);
18 void bch2_btree_node_hash_remove(struct btree_cache *, struct btree *);
20 int __bch2_btree_node_hash_insert(struct btree_cache *, struct btree *);
21 int bch2_btree_node_hash_insert(struct btree_cache *, struct btree *,
51 void bch2_fs_btree_cache_init_early(struct btree_cache *);
83 for ((_tbl) = rht_dereference_rcu((_c)->btree_cache.table.tbl, \
84 &(_c)->btree_cache.table), \
155 void bch2_btree_cache_to_text(struct printbuf *, const struct btree_cache *);
H A Dbtree_update_interior.c243 mutex_lock(&c->btree_cache.lock); in bch2_btree_node_free_inmem()
244 bch2_btree_node_hash_remove(&c->btree_cache, b); in bch2_btree_node_free_inmem()
245 mutex_unlock(&c->btree_cache.lock); in bch2_btree_node_free_inmem()
271 mutex_lock(&c->btree_cache.lock); in bch2_btree_node_free_never_used()
272 __bch2_btree_node_hash_remove(&c->btree_cache, b); in bch2_btree_node_free_never_used()
273 mutex_unlock(&c->btree_cache.lock); in bch2_btree_node_free_never_used()
410 ret = bch2_btree_node_hash_insert(&c->btree_cache, b, level, as->btree_id); in bch2_btree_node_alloc()
1324 mutex_lock(&c->btree_cache.lock); in bch2_btree_set_root_inmem()
1326 mutex_unlock(&c->btree_cache.lock); in bch2_btree_set_root_inmem()
1977 mutex_lock(&c->btree_cache.lock); in __btree_increase_depth()
[all …]
H A Dsysfs.c181 read_attribute(btree_cache);
230 struct btree_cache *bc = &c->btree_cache; in BCH_TIME_STATS()
344 bch2_btree_cache_to_text(out, &c->btree_cache); in SHOW()
414 struct btree_cache *bc = &c->btree_cache; in STORE()
H A Dbtree_io.h21 atomic_long_inc(&c->btree_cache.nr_dirty); in set_btree_node_dirty_acct()
27 atomic_long_dec(&c->btree_cache.nr_dirty); in clear_btree_node_dirty_acct()
H A Dbtree_gc.c208 mutex_lock(&c->btree_cache.lock); in set_node_max()
209 __bch2_btree_node_hash_remove(&c->btree_cache, b); in set_node_max()
212 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b); in set_node_max()
214 mutex_unlock(&c->btree_cache.lock); in set_node_max()
606 mutex_lock(&c->btree_cache.lock); in bch2_check_topology()
607 bch2_btree_node_hash_remove(&c->btree_cache, b); in bch2_check_topology()
608 mutex_unlock(&c->btree_cache.lock); in bch2_check_topology()
H A DMakefile13 btree_cache.o \
H A Dbackpointers.c775 c->btree_cache.pinned_nodes_mask[0] = btree_leaf_mask; in bch2_get_btree_in_memory_pos()
776 c->btree_cache.pinned_nodes_mask[1] = btree_interior_mask; in bch2_get_btree_in_memory_pos()
777 c->btree_cache.pinned_nodes_start = start; in bch2_get_btree_in_memory_pos()
778 c->btree_cache.pinned_nodes_end = *end = BBPOS_MAX; in bch2_get_btree_in_memory_pos()
794 c->btree_cache.pinned_nodes_end = *end = in bch2_get_btree_in_memory_pos()
H A Dbcachefs.h896 struct btree_cache btree_cache; member
H A Djournal_reclaim.c678 struct btree_cache *bc = &c->btree_cache; in __bch2_journal_reclaim()
H A Ddebug.c518 rht_dereference_rcu(c->btree_cache.table.tbl, in bch2_cached_btree_nodes_read()
519 &c->btree_cache.table); in bch2_cached_btree_nodes_read()
H A Dbtree_io.c1900 BUG_ON(bch2_btree_node_hash_insert(&c->btree_cache, b, level, id)); in __bch2_btree_root_read()
1909 mutex_lock(&c->btree_cache.lock); in __bch2_btree_root_read()
1910 bch2_btree_node_hash_remove(&c->btree_cache, b); in __bch2_btree_root_read()
1911 mutex_unlock(&c->btree_cache.lock); in __bch2_btree_root_read()
2389 atomic_long_dec(&c->btree_cache.nr_dirty); in __bch2_btree_node_write()
H A Dbtree_types.h167 struct btree_cache { struct
H A Dsuper.c385 BUG_ON(atomic_long_read(&c->btree_cache.nr_dirty)); in bch2_fs_read_only()
869 bch2_fs_btree_cache_init_early(&c->btree_cache); in bch2_fs_alloc()
/linux/drivers/md/bcache/
H A Dbtree.c555 list_move(&b->list, &b->c->btree_cache); in mca_data_alloc()
712 list_for_each_entry_safe_reverse(b, t, &c->btree_cache, list) { in bch_mca_scan()
759 list_move(&c->verify_data->list, &c->btree_cache); in bch_btree_cache_free()
765 &c->btree_cache); in bch_btree_cache_free()
767 while (!list_empty(&c->btree_cache)) { in bch_btree_cache_free()
768 b = list_first_entry(&c->btree_cache, struct btree, list); in bch_btree_cache_free()
801 list_splice_init(&c->btree_cache, in bch_btree_cache_alloc()
893 list_for_each_entry_reverse(b, &c->btree_cache, list) in mca_cannibalize()
897 list_for_each_entry_reverse(b, &c->btree_cache, list) in mca_cannibalize()
963 list_move(&b->list, &c->btree_cache); in mca_alloc()
H A Dsuper.c1722 list_add(&c->root->list, &c->btree_cache); in CLOSURE_CALLBACK()
1729 list_for_each_entry(b, &c->btree_cache, list) { in CLOSURE_CALLBACK()
1910 INIT_LIST_HEAD(&c->btree_cache); in bch_cache_set_alloc()
H A Djournal.c455 list_for_each_entry_safe_reverse(b, t, &c->btree_cache, list) { in btree_flush_write()