diff options
| author | Kent Overstreet <kmo@daterainc.com> | 2013-09-11 06:02:45 +0400 |
|---|---|---|
| committer | Kent Overstreet <kmo@daterainc.com> | 2013-11-11 09:56:32 +0400 |
| commit | 220bb38c21b83e2f7b842f33220bf727093eca89 (patch) | |
| tree | 7388a855ca920ca88c0b9a4d66839946ba4cd848 /drivers/md/bcache/debug.h | |
| parent | cc7b8819212f437fc82f0f9cdc24deb0fb5d775f (diff) | |
| download | linux-220bb38c21b83e2f7b842f33220bf727093eca89.tar.xz | |
bcache: Break up struct search
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>
Diffstat (limited to 'drivers/md/bcache/debug.h')
| -rw-r--r-- | drivers/md/bcache/debug.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/drivers/md/bcache/debug.h b/drivers/md/bcache/debug.h index 1c39b5a2489b..0f4b3440512c 100644 --- a/drivers/md/bcache/debug.h +++ b/drivers/md/bcache/debug.h @@ -29,12 +29,12 @@ void bch_check_keys(struct btree *, const char *, ...); #ifdef CONFIG_BCACHE_DEBUG void bch_btree_verify(struct btree *, struct bset *); -void bch_data_verify(struct search *); +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 search *s) {}; +static inline void bch_data_verify(struct cached_dev *dc, struct bio *bio) {}; #endif |