summaryrefslogtreecommitdiff
path: root/drivers/md/bcache/request.h
diff options
context:
space:
mode:
authorKent Overstreet <kmo@daterainc.com>2013-07-24 17:41:08 -0700
committerKent Overstreet <kmo@daterainc.com>2013-11-10 21:56:07 -0800
commit2c1953e201a05ddfb1ea53f23d81a492c6513028 (patch)
treec1a2d6cfefb094698a38db864d5a5a575cfd835b /drivers/md/bcache/request.h
parentdf8e89701fb02cba6e09c5f46f002778b5b52dd2 (diff)
downloadlwn-2c1953e201a05ddfb1ea53f23d81a492c6513028.tar.gz
lwn-2c1953e201a05ddfb1ea53f23d81a492c6513028.zip
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.h2
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 *);