diff options
| author | Kent Overstreet <kmo@daterainc.com> | 2013-09-11 01:39:16 (GMT) |
|---|---|---|
| committer | Kent Overstreet <kmo@daterainc.com> | 2013-11-11 05:55:59 (GMT) |
| commit | e7c590eb63509c5d5f48a390d23aa25f4417ac96 (patch) | |
| tree | 22accb493ac9f36b5bf005d5a19080ab67a96cf2 /drivers/md/bcache/bcache.h | |
| parent | 403b6cdeb1a38d896ffcb1f99ddcfd4e343b5d69 (diff) | |
| download | linux-e7c590eb63509c5d5f48a390d23aa25f4417ac96.tar.xz | |
bcache: Convert btree_insert_check_key() to btree_insert_node()
This was the main point of all this refactoring - now,
btree_insert_check_key() won't fail just because the leaf node happened
to be full.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
Diffstat (limited to 'drivers/md/bcache/bcache.h')
| -rw-r--r-- | drivers/md/bcache/bcache.h | 8 |
1 files changed, 0 insertions, 8 deletions
diff --git a/drivers/md/bcache/bcache.h b/drivers/md/bcache/bcache.h index 6e836f2..10ce0c8 100644 --- a/drivers/md/bcache/bcache.h +++ b/drivers/md/bcache/bcache.h @@ -1091,14 +1091,6 @@ do { \ for (b = (ca)->buckets + (ca)->sb.first_bucket; \ b < (ca)->buckets + (ca)->sb.nbuckets; b++) -static inline void __bkey_put(struct cache_set *c, struct bkey *k) -{ - unsigned i; - - for (i = 0; i < KEY_PTRS(k); i++) - atomic_dec_bug(&PTR_BUCKET(c, k, i)->pin); -} - static inline void cached_dev_put(struct cached_dev *dc) { if (atomic_dec_and_test(&dc->count)) |