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

/linux-4.1.27/drivers/md/bcache/
H A Dbtree.h24 * struct btree_op is a central interface to the btree code. It's used for
48 * time, so there's a lock, implemented by a pointer to the btree_op closure -
67 * though - but it takes a refcount on the closure in struct btree_op you passed
80 * This is specified with the lock field in struct btree_op; lock = 0 means we
208 struct btree_op { struct
218 static inline void bch_btree_op_init(struct btree_op *op, int write_lock_level) bch_btree_op_init()
220 memset(op, 0, sizeof(struct btree_op)); bch_btree_op_init()
245 struct btree *__bch_btree_node_alloc(struct cache_set *, struct btree_op *,
247 struct btree *bch_btree_node_get(struct cache_set *, struct btree_op *,
250 int bch_btree_insert_check_key(struct btree *, struct btree_op *,
275 typedef int (btree_map_nodes_fn)(struct btree_op *, struct btree *);
276 int __bch_btree_map_nodes(struct btree_op *, struct cache_set *,
279 static inline int bch_btree_map_nodes(struct btree_op *op, struct cache_set *c, bch_btree_map_nodes()
285 static inline int bch_btree_map_leaf_nodes(struct btree_op *op, bch_btree_map_leaf_nodes()
293 typedef int (btree_map_keys_fn)(struct btree_op *, struct btree *,
295 int bch_btree_map_keys(struct btree_op *, struct cache_set *,
H A Dbtree.c114 * @op: pointer to struct btree_op
134 * @op: pointer to struct btree_op
837 static int mca_cannibalize_lock(struct cache_set *c, struct btree_op *op) mca_cannibalize_lock()
852 static struct btree *mca_cannibalize(struct cache_set *c, struct btree_op *op, mca_cannibalize()
888 static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op, mca_alloc()
968 struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op, bch_btree_node_get()
1065 struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op, __bch_btree_node_alloc()
1108 struct btree_op *op, int level, bch_btree_node_alloc()
1115 struct btree_op *op) btree_node_alloc_replacement()
1147 static int btree_check_reserve(struct btree *b, struct btree_op *op) btree_check_reserve()
1294 static int bch_btree_insert_node(struct btree *, struct btree_op *,
1297 static int btree_gc_coalesce(struct btree *b, struct btree_op *op, btree_gc_coalesce()
1464 static int btree_gc_rewrite_node(struct btree *b, struct btree_op *op, btree_gc_rewrite_node()
1512 static int btree_gc_recurse(struct btree *b, struct btree_op *op, btree_gc_recurse()
1595 static int bch_btree_gc_root(struct btree *b, struct btree_op *op, bch_btree_gc_root()
1730 struct btree_op op; bch_btree_gc()
1809 static int bch_btree_check_recurse(struct btree *b, struct btree_op *op) bch_btree_check_recurse()
1841 struct btree_op op; bch_btree_check()
1918 static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op, bch_btree_insert_keys()
1960 static int btree_split(struct btree *b, struct btree_op *op, btree_split()
2094 static int bch_btree_insert_node(struct btree *b, struct btree_op *op, bch_btree_insert_node()
2150 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op, bch_btree_insert_check_key()
2189 struct btree_op op;
2195 static int btree_insert_fn(struct btree_op *b_op, struct btree *b) btree_insert_fn()
2268 static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op, bch_btree_map_nodes_recurse()
2297 int __bch_btree_map_nodes(struct btree_op *op, struct cache_set *c, __bch_btree_map_nodes()
2303 static int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op, bch_btree_map_keys_recurse()
2330 int bch_btree_map_keys(struct btree_op *op, struct cache_set *c, bch_btree_map_keys()
2355 struct btree_op op;
2362 static int refill_keybuf_fn(struct btree_op *op, struct btree *b, refill_keybuf_fn()
H A Djournal.h41 * entry that we're going to insert (held by struct btree_op), and then when we
166 struct btree_op;
H A Dwriteback.c472 struct btree_op op;
476 static int sectors_dirty_init_fn(struct btree_op *_op, struct btree *b, sectors_dirty_init_fn()
H A Dsysfs.c403 struct btree_op op;
408 static int bch_btree_bset_stats(struct btree_op *b_op, struct btree *b) bch_btree_bset_stats()
H A Drequest.c470 struct btree_op op;
502 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) cache_lookup_fn()

Completed in 199 milliseconds