linux-stable.git/drivers/md/bcache/request.h, branch linux-3.13.y

bcache: Move sector allocator to alloc.c

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

Just reorganizing things a bit.

Signed-off-by: Kent Overstreet

bcache: Break up struct search

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

With all the recent refactoring around struct btree op struct search has
gotten rather large.

But we can now easily break it up in a different way - we break out
struct btree_insert_op which is for inserting data into the cache, and
that's now what the copying gc code uses - struct search is now specific
to request.c

Signed-off-by: Kent Overstreet

bcache: Don't use op->insert_collision

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

When we convert bch_btree_insert() to bch_btree_map_leaf_nodes(), we
won't be passing struct btree_op to bch_btree_insert() anymore - so we
need a different way of returning whether there was a collision (really,
a replace collision).

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: Fix/revamp tracepoints

2013-06-27T00:09:15+00:00

The tracepoints were reworked to be more sensible, and fixed a null
pointer deref in one of the tracepoints.

Converted some of the pr_debug()s to tracepoints - this is partly a
performance optimization; it used to be that with DEBUG or
CONFIG_DYNAMIC_DEBUG pr_debug() was an empty macro; but at some point it
was changed to an empty inline function.

Some of the pr_debug() statements had rather expensive function calls as
part of the arguments, so this code was getting run unnecessarily even
on non debug kernels - in some fast paths, too.

Signed-off-by: Kent Overstreet