diff options
| author | Kent Overstreet <kmo@daterainc.com> | 2013-10-25 04:07:04 +0400 |
|---|---|---|
| committer | Kent Overstreet <kmo@daterainc.com> | 2013-11-11 09:56:02 +0400 |
| commit | a34a8bfd4e6358c646928320d37b0425c0762f8a (patch) | |
| tree | 650dd57be0460f439551baca3514009b4287bb12 /drivers/md/bcache/request.h | |
| parent | cdd972b164be8fc69f6ee8533c5a07b621da74c7 (diff) | |
| download | linux-a34a8bfd4e6358c646928320d37b0425c0762f8a.tar.xz | |
bcache: Refactor journalling flow control
Making things less asynchronous that don't need to be - bch_journal()
only has to block when the journal or journal entry is full, which is
emphatically not a fast path. So make it a normal function that just
returns when it finishes, to make the code and control flow easier to
follow.
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
Diffstat (limited to 'drivers/md/bcache/request.h')
| -rw-r--r-- | drivers/md/bcache/request.h | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/drivers/md/bcache/request.h b/drivers/md/bcache/request.h index 57dc4784f4f4..1f1b59d38db5 100644 --- a/drivers/md/bcache/request.h +++ b/drivers/md/bcache/request.h @@ -31,8 +31,7 @@ struct search { void bch_cache_read_endio(struct bio *, int); unsigned bch_get_congested(struct cache_set *); -void bch_insert_data(struct closure *cl); -void bch_btree_insert_async(struct closure *); +void bch_data_insert(struct closure *cl); void bch_cache_read_endio(struct bio *, int); void bch_open_buckets_free(struct cache_set *); |