| H A D | btree.c | 1 // SPDX-License-Identifier: GPL-2.0 5 * Uses a block device as cache for other block devices; optimized for SSDs. 6 * All allocation is done in buckets, which should match the erase block size 10 * bucket priority is increased on cache hit, and periodically all the buckets 21 * All configuration is done via sysfs; see Documentation/admin-guid 866 mca_cannibalize_lock(struct cache_set * c,struct btree_op * op) mca_cannibalize_lock() argument 883 mca_cannibalize(struct cache_set * c,struct btree_op * op,struct bkey * k) mca_cannibalize() argument 921 mca_alloc(struct cache_set * c,struct btree_op * op,struct bkey * k,int level) mca_alloc() argument 1004 bch_btree_node_get(struct cache_set * c,struct btree_op * op,struct bkey * k,int level,bool write,struct btree * parent) bch_btree_node_get() argument 1118 __bch_btree_node_alloc(struct cache_set * c,struct btree_op * op,int level,bool wait,struct btree * parent) __bch_btree_node_alloc() argument 1162 bch_btree_node_alloc(struct cache_set * c,struct btree_op * op,int level,struct btree * parent) bch_btree_node_alloc() argument 1169 btree_node_alloc_replacement(struct btree * b,struct btree_op * op) btree_node_alloc_replacement() argument 1202 btree_check_reserve(struct btree * b,struct btree_op * op) btree_check_reserve() argument 1358 btree_gc_coalesce(struct btree * b,struct btree_op * op,struct gc_stat * gc,struct gc_merge_info * r) btree_gc_coalesce() argument 1529 btree_gc_rewrite_node(struct btree * b,struct btree_op * op,struct btree * replace) btree_gc_rewrite_node() argument 1605 btree_gc_recurse(struct btree * b,struct btree_op * op,struct closure * writes,struct gc_stat * gc) btree_gc_recurse() argument 1696 bch_btree_gc_root(struct btree * b,struct btree_op * op,struct closure * writes,struct gc_stat * gc) bch_btree_gc_root() argument 1831 struct btree_op op; bch_btree_gc() local 1913 bch_btree_check_recurse(struct btree * b,struct btree_op * op) bch_btree_check_recurse() argument 2005 struct btree_op op; bch_btree_check_thread() local 2195 bch_btree_insert_keys(struct btree * b,struct btree_op * op,struct keylist * insert_keys,struct bkey * replace_key) bch_btree_insert_keys() argument 2237 btree_split(struct btree * b,struct btree_op * op,struct keylist * insert_keys,struct bkey * replace_key) btree_split() argument 2371 bch_btree_insert_node(struct btree * b,struct btree_op * op,struct keylist * insert_keys,atomic_t * journal_ref,struct bkey * replace_key) bch_btree_insert_node() argument 2427 bch_btree_insert_check_key(struct btree * b,struct btree_op * op,struct bkey * check_key) bch_btree_insert_check_key() argument 2466 struct btree_op op; global() member 2474 struct btree_insert_op *op = container_of(b_op, btree_insert_fn() local 2488 struct btree_insert_op op; bch_btree_insert() local 2545 bch_btree_map_nodes_recurse(struct btree * b,struct btree_op * op,struct bkey * from,btree_map_nodes_fn * fn,int flags) bch_btree_map_nodes_recurse() argument 2574 __bch_btree_map_nodes(struct btree_op * op,struct cache_set * c,struct bkey * from,btree_map_nodes_fn * fn,int flags) __bch_btree_map_nodes() argument 2580 bch_btree_map_keys_recurse(struct btree * b,struct btree_op * op,struct bkey * from,btree_map_keys_fn * fn,int flags) bch_btree_map_keys_recurse() argument 2609 bch_btree_map_keys(struct btree_op * op,struct cache_set * c,struct bkey * from,btree_map_keys_fn * fn,int flags) bch_btree_map_keys() argument 2634 struct btree_op op; global() member 2641 refill_keybuf_fn(struct btree_op * op,struct btree * b,struct bkey * k) refill_keybuf_fn() argument [all...] |