summaryrefslogtreecommitdiff
path: root/drivers/md/bcache/btree.h
diff options
context:
space:
mode:
authorKent Overstreet <kmo@daterainc.com>2013-07-25 04:41:08 +0400
committerKent Overstreet <kmo@daterainc.com>2013-11-11 09:56:07 +0400
commit2c1953e201a05ddfb1ea53f23d81a492c6513028 (patch)
treec1a2d6cfefb094698a38db864d5a5a575cfd835b /drivers/md/bcache/btree.h
parentdf8e89701fb02cba6e09c5f46f002778b5b52dd2 (diff)
downloadlinux-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/btree.h')
-rw-r--r--drivers/md/bcache/btree.h3
1 files changed, 0 insertions, 3 deletions
diff --git a/drivers/md/bcache/btree.h b/drivers/md/bcache/btree.h
index 1690f4731c1e..60dadd722ace 100644
--- a/drivers/md/bcache/btree.h
+++ b/drivers/md/bcache/btree.h
@@ -264,7 +264,6 @@ struct btree_op {
unsigned flush_journal:1;
unsigned insert_data_done:1;
- unsigned lookup_done:1;
unsigned insert_collision:1;
BKEY_PADDED(replace);
@@ -306,8 +305,6 @@ int bch_btree_insert_check_key(struct btree *, struct btree_op *,
struct bkey *);
int bch_btree_insert(struct btree_op *, struct cache_set *, struct keylist *);
-void bch_btree_search_async(struct closure *);
-
int bch_gc_thread_start(struct cache_set *);
size_t bch_btree_gc_finish(struct cache_set *);
void bch_moving_gc(struct cache_set *);