mirror of
https://github.com/torvalds/linux
synced 2024-09-21 19:47:35 +00:00
220bb38c21
With all the recent refactoring around struct btree op struct search has gotten rather large. But we can now easily break it up in a different way - we break out struct btree_insert_op which is for inserting data into the cache, and that's now what the copying gc code uses - struct search is now specific to request.c Signed-off-by: Kent Overstreet <kmo@daterainc.com>
48 lines
1.3 KiB
C
48 lines
1.3 KiB
C
#ifndef _BCACHE_DEBUG_H
|
|
#define _BCACHE_DEBUG_H
|
|
|
|
/* Btree/bkey debug printing */
|
|
|
|
int bch_bkey_to_text(char *buf, size_t size, const struct bkey *k);
|
|
int bch_btree_to_text(char *buf, size_t size, const struct btree *b);
|
|
|
|
#ifdef CONFIG_BCACHE_EDEBUG
|
|
|
|
unsigned bch_count_data(struct btree *);
|
|
void bch_check_key_order_msg(struct btree *, struct bset *, const char *, ...);
|
|
void bch_check_keys(struct btree *, const char *, ...);
|
|
|
|
#define bch_check_key_order(b, i) \
|
|
bch_check_key_order_msg(b, i, "keys out of order")
|
|
#define EBUG_ON(cond) BUG_ON(cond)
|
|
|
|
#else /* EDEBUG */
|
|
|
|
#define bch_count_data(b) 0
|
|
#define bch_check_key_order(b, i) do {} while (0)
|
|
#define bch_check_key_order_msg(b, i, ...) do {} while (0)
|
|
#define bch_check_keys(b, ...) do {} while (0)
|
|
#define EBUG_ON(cond) do {} while (0)
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_BCACHE_DEBUG
|
|
|
|
void bch_btree_verify(struct btree *, struct bset *);
|
|
void bch_data_verify(struct cached_dev *, struct bio *);
|
|
|
|
#else /* DEBUG */
|
|
|
|
static inline void bch_btree_verify(struct btree *b, struct bset *i) {}
|
|
static inline void bch_data_verify(struct cached_dev *dc, struct bio *bio) {};
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
void bch_debug_init_cache_set(struct cache_set *);
|
|
#else
|
|
static inline void bch_debug_init_cache_set(struct cache_set *c) {}
|
|
#endif
|
|
|
|
#endif
|