2013-03-24 03:11:31 +04:00
|
|
|
#ifndef _BCACHE_DEBUG_H
|
|
|
|
#define _BCACHE_DEBUG_H
|
|
|
|
|
|
|
|
/* Btree/bkey debug printing */
|
|
|
|
|
2013-05-15 07:33:16 +04:00
|
|
|
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);
|
2013-03-24 03:11:31 +04:00
|
|
|
|
|
|
|
#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 search *);
|
|
|
|
|
|
|
|
#else /* DEBUG */
|
|
|
|
|
|
|
|
static inline void bch_btree_verify(struct btree *b, struct bset *i) {}
|
|
|
|
static inline void bch_data_verify(struct search *s) {};
|
|
|
|
|
|
|
|
#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
|