bcache: Move some stuff to btree.c

With the new btree_map() functions, we don't need to export the stuff
needed for traversing the btree anymore.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>

1 files changed, 2 insertions, 14 deletions

diff --git a/drivers/md/bcache/request.c b/drivers/md/bcache/request.c
index f779eb420d69..a16872541038 100644
--- a/drivers/md/bcache/request.c
+++ b/drivers/md/bcache/request.c
@@ -754,18 +754,6 @@ static struct search *search_alloc(struct bio *bio, struct bcache_device *d)
         return s;
 }
 
-static void btree_read_async(struct closure *cl)
-{
-        struct btree_op *op = container_of(cl, struct btree_op, cl);
-
-        int ret = btree_root(search_recurse, op->c, op);
-
-        if (ret == -EAGAIN)
-                continue_at(cl, btree_read_async, bcache_wq);
-
-        closure_return(cl);
-}
-
 /* Cached devices */
 
 static void cached_dev_bio_complete(struct closure *cl)
@@ -1087,7 +1075,7 @@ static void cached_dev_read(struct cached_dev *dc, struct search *s)
 {
         struct closure *cl = &s->cl;
 
-        closure_call(&s->op.cl, btree_read_async, NULL, cl);
+        closure_call(&s->op.cl, bch_btree_search_async, NULL, cl);
         continue_at(cl, cached_dev_read_done_bh, NULL);
 }
 
@@ -1351,7 +1339,7 @@ static void flash_dev_make_request(struct request_queue *q, struct bio *bio)
 
                 closure_call(&s->op.cl, bch_data_insert, NULL, cl);
         } else {
-                closure_call(&s->op.cl, btree_read_async, NULL, cl);
+                closure_call(&s->op.cl, bch_btree_search_async, NULL, cl);
         }
 
         continue_at(cl, search_free, NULL);