Searched refs:btree (Results 1 – 14 of 14) sorted by relevance
| /drivers/md/bcache/ |
| A D | btree.h | 117 struct btree { struct
127 struct btree *parent; argument
152 static inline bool btree_node_ ## flag(struct btree *b) \ argument
180 static inline struct bset *btree_bset_first(struct btree *b) in btree_bset_first()
185 static inline struct bset *btree_bset_last(struct btree *b) in btree_bset_last()
256 static inline void rw_unlock(bool w, struct btree *b) in rw_unlock()
263 void bch_btree_node_read_done(struct btree *b);
267 void bch_btree_set_root(struct btree *b);
270 struct btree *parent);
273 struct btree *parent);
[all …]
|
| A D | btree.c | 328 struct btree *b = container_of(cl, struct btree, io); in btree_node_write_endio()
587 struct btree *b = kzalloc(sizeof(struct btree), gfp); in mca_bucket_alloc()
747 struct btree *b; in bch_btree_cache_free()
854 struct btree *b; in mca_find()
886 struct btree *b; in mca_cannibalize()
924 struct btree *b; in mca_alloc()
1009 struct btree *b; in bch_btree_node_get()
1063 struct btree *b; in btree_node_prefetch()
1123 struct btree *b; in __bch_btree_node_alloc()
1349 struct btree *b;
[all …]
|
| A D | extents.c | 128 struct btree *b = container_of(keys, struct btree, keys); in bch_bkey_dump()
168 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_invalid()
173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
207 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_bad()
232 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_insert_fixup()
328 struct cache_set *c = container_of(b, struct btree, keys)->c; in bch_extent_insert_fixup()
502 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_invalid()
507 static bool bch_extent_bad_expensive(struct btree *b, const struct bkey *k, in bch_extent_bad_expensive()
539 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_bad()
585 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_merge()
|
| A D | debug.h | 11 void bch_btree_verify(struct btree *b);
20 static inline void bch_btree_verify(struct btree *b) {} in bch_btree_verify()
|
| A D | bcache.h | 223 struct btree;
278 int (*cache_miss)(struct btree *b, struct search *s,
671 struct btree *root;
674 struct btree *verify_data;
|
| A D | Makefile | 5 bcache-y := alloc.o bset.o btree.o debug.o extents.o io.o\
|
| A D | debug.c | 31 void bch_btree_verify(struct btree *b) in bch_btree_verify()
33 struct btree *v = b->c->verify_data; in bch_btree_verify()
|
| A D | Kconfig | 10 a btree for indexing and the layout is optimized for SSDs.
|
| A D | sysfs.c | 622 static int bch_btree_bset_stats(struct btree_op *b_op, struct btree *b) in bch_btree_bset_stats()
662 struct btree *b; in bch_root_usage()
685 struct btree *b; in bch_cache_size()
|
| A D | request.c | 527 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) in cache_lookup_fn()
892 static int cached_dev_cache_miss(struct btree *b, struct search *s, in cached_dev_cache_miss()
1265 static int flash_dev_cache_miss(struct btree *b, struct search *s, in flash_dev_cache_miss()
|
| A D | writeback.c | 853 static int sectors_dirty_init_fn(struct btree_op *_op, struct btree *b, in sectors_dirty_init_fn()
980 struct btree *b = NULL; in bch_sectors_dirty_init()
|
| A D | journal.c | 418 struct btree *b, *t, *btree_nodes[BTREE_FLUSH_NR]; in btree_flush_write()
|
| A D | super.c | 1711 struct btree *b; in CLOSURE_CALLBACK()
|
| /drivers/md/persistent-data/ |
| A D | Makefile | 11 dm-btree.o \
12 dm-btree-remove.o \
13 dm-btree-spine.o
|
Completed in 903 milliseconds