linux.git/drivers/md/bcache/journal.c, branch v3.13

bcache: Pull on disk data structures out into a separate header

2013-11-11T05:56:33+00:00

Now, the on disk data structures are in a header that can be exported to
userspace - and having them all centralized is nice too.

Signed-off-by: Kent Overstreet

bcache: Convert bch_btree_insert() to bch_btree_map_leaf_nodes()

2013-11-11T05:56:31+00:00

Last of the btree_map() conversions. Main visible effect is
bch_btree_insert() is no longer taking a struct btree_op as an argument
anymore - there's no fancy state machine stuff going on, it's just a
normal function.

Signed-off-by: Kent Overstreet

bcache: Kill op->replace

2013-11-11T05:56:29+00:00

This is prep work for converting bch_btree_insert to
bch_btree_map_leaf_nodes() - we have to convert all its arguments to
actual arguments. Bunch of churn, but should be straightforward.

Signed-off-by: Kent Overstreet

bcache: Kill op->cl

2013-11-11T05:56:09+00:00

This isn't used for waiting asynchronously anymore - so this is a fairly
trivial refactoring.

Signed-off-by: Kent Overstreet

bcache: Prune struct btree_op

2013-11-11T05:56:08+00:00

Eventual goal is for struct btree_op to contain only what is necessary
for traversing the btree.

Signed-off-by: Kent Overstreet

bcache: Convert bch_btree_read_async() to bch_btree_map_keys()

2013-11-11T05:56:07+00:00

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

bcache: Move keylist out of btree_op

2013-11-11T05:56:02+00:00

Slowly working on pruning struct btree_op - the aim is for it to only
contain things that are actually necessary for traversing the btree.

Signed-off-by: Kent Overstreet

bcache: Refactor journalling flow control

2013-11-11T05:56:02+00:00

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

bcache: Clean up keylist code

2013-11-11T05:56:00+00:00

More random refactoring.

Signed-off-by: Kent Overstreet

bcache: Add explicit keylist arg to btree_insert()

2013-11-11T05:55:59+00:00

Some refactoring - better to explicitly pass stuff around instead of
having it all in the "big bag of state", struct btree_op. Going to prune
struct btree_op quite a bit over time.

Signed-off-by: Kent Overstreet