diff options
| author | Kent Overstreet <kmo@daterainc.com> | 2013-07-25 04:41:08 +0400 |
|---|---|---|
| committer | Kent Overstreet <kmo@daterainc.com> | 2013-11-11 09:56:07 +0400 |
| commit | 2c1953e201a05ddfb1ea53f23d81a492c6513028 (patch) | |
| tree | c1a2d6cfefb094698a38db864d5a5a575cfd835b /drivers/md/bcache/request.h | |
| parent | df8e89701fb02cba6e09c5f46f002778b5b52dd2 (diff) | |
| download | linux-2c1953e201a05ddfb1ea53f23d81a492c6513028.tar.xz | |
bcache: Convert bch_btree_read_async() to bch_btree_map_keys()
This is a fairly straightforward conversion, mostly reshuffling -
op->lookup_done goes away, replaced by MAP_DONE/MAP_CONTINUE. And the
code for handling cache hits and misses wasn't really btree code, so it
gets moved to request.c.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
Diffstat (limited to 'drivers/md/bcache/request.h')
| -rw-r--r-- | drivers/md/bcache/request.h | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/drivers/md/bcache/request.h b/drivers/md/bcache/request.h index 7d02ac5f936e..b0b4b0b5b7e9 100644 --- a/drivers/md/bcache/request.h +++ b/drivers/md/bcache/request.h @@ -31,10 +31,8 @@ struct search { struct keylist insert_keys; }; -void bch_cache_read_endio(struct bio *, int); unsigned bch_get_congested(struct cache_set *); void bch_data_insert(struct closure *cl); -void bch_cache_read_endio(struct bio *, int); void bch_open_buckets_free(struct cache_set *); int bch_open_buckets_alloc(struct cache_set *); |