aboutsummaryrefslogtreecommitdiffstats
path: root/drivers/md/bcache/btree.h
diff options
context:
space:
mode:
authorKent Overstreet <kmo@daterainc.com>2013-07-24 20:29:09 -0400
committerKent Overstreet <kmo@daterainc.com>2013-11-11 00:56:04 -0500
commit35fcd848d72683141052aa9880542461577f2dbe (patch)
treef88ebdbc88c9c7eebf33f603a2deb24e39e2bb9a /drivers/md/bcache/btree.h
parente8e1d4682c8cb06dbcb5ef7bb851bf9bcb889c84 (diff)
bcache: Convert bucket_wait to wait_queue_head_t
At one point we did do fancy asynchronous waiting stuff with bucket_wait, but that's all gone (and bucket_wait is used a lot less than it used to be). So use the standard primitives. Signed-off-by: Kent Overstreet <kmo@daterainc.com>
Diffstat (limited to 'drivers/md/bcache/btree.h')
-rw-r--r--drivers/md/bcache/btree.h6
1 files changed, 3 insertions, 3 deletions
diff --git a/drivers/md/bcache/btree.h b/drivers/md/bcache/btree.h
index 72794ab8e8e5..d691d954730e 100644
--- a/drivers/md/bcache/btree.h
+++ b/drivers/md/bcache/btree.h
@@ -355,7 +355,7 @@ static inline void rw_unlock(bool w, struct btree *b)
355 _r = bch_btree_ ## fn(_b, op, ##__VA_ARGS__); \ 355 _r = bch_btree_ ## fn(_b, op, ##__VA_ARGS__); \
356 } \ 356 } \
357 rw_unlock(_w, _b); \ 357 rw_unlock(_w, _b); \
358 bch_cannibalize_unlock(c, &(op)->cl); \ 358 bch_cannibalize_unlock(c); \
359 if (_r == -ENOSPC) { \ 359 if (_r == -ENOSPC) { \
360 wait_event((c)->try_wait, \ 360 wait_event((c)->try_wait, \
361 !(c)->try_harder); \ 361 !(c)->try_harder); \
@@ -377,9 +377,9 @@ static inline bool should_split(struct btree *b)
377void bch_btree_node_read(struct btree *); 377void bch_btree_node_read(struct btree *);
378void bch_btree_node_write(struct btree *, struct closure *); 378void bch_btree_node_write(struct btree *, struct closure *);
379 379
380void bch_cannibalize_unlock(struct cache_set *, struct closure *); 380void bch_cannibalize_unlock(struct cache_set *);
381void bch_btree_set_root(struct btree *); 381void bch_btree_set_root(struct btree *);
382struct btree *bch_btree_node_alloc(struct cache_set *, int, struct closure *); 382struct btree *bch_btree_node_alloc(struct cache_set *, int);
383struct btree *bch_btree_node_get(struct cache_set *, struct bkey *, int, bool); 383struct btree *bch_btree_node_get(struct cache_set *, struct bkey *, int, bool);
384 384
385int bch_btree_insert_check_key(struct btree *, struct btree_op *, 385int bch_btree_insert_check_key(struct btree *, struct btree_op *,