linux.git/drivers/md/bcache/request.h, branch v4.4

bcache: Kill dead cgroup code

2014-03-18T19:22:35+00:00

This hasn't been used or even enabled in ages.

Signed-off-by: Kent Overstreet

bcache: Fix moving_gc deadlocking with a foreground write

2014-03-18T19:22:33+00:00

Deadlock happened because a foreground write slept, waiting for a bucket
to be allocated. Normally the gc would mark buckets available for invalidation.
But the moving_gc was stuck waiting for outstanding writes to complete.
These writes used the bcache_wq, the same queue foreground writes used.

This fix gives moving_gc its own work queue, so it was still finish moving
even if foreground writes are stuck waiting for allocation. It also makes
work queue a parameter to the data_insert path, so moving_gc can use its
workqueue for writes.

Signed-off-by: Nicholas Swenson 
Signed-off-by: Kent Overstreet

bcache: Zero less memory

2014-01-08T21:05:08+00:00

Another minor performance optimization

Signed-off-by: Kent Overstreet

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