linux-toradex.git/drivers/md/bcache/btree.h, branch v4.4.68

bcache: Make gc wakeup sane, remove set_task_state()

2017-02-23T16:43:10+00:00

commit be628be09563f8f6e81929efbd7cf3f45c344416 upstream.

Signed-off-by: Kent Overstreet 
Signed-off-by: Greg Kroah-Hartman

bcache: try to set b->parent properly

2014-08-04T22:23:04+00:00

bcache_flash_dev.ktest would reliably crash with 8k and 16k bucket size
before; now it passes.

Change-Id: Ib542232235e39298c3a7548fe52b645cabb823d1

bcache: wait for buckets when allocating new btree root

2014-08-04T22:23:03+00:00

Tested:
- sometimes bcache_tier test would hang on startup with a failure
  to allocate the btree root -- no longer seeing this

Signed-off-by: Kent Overstreet

bcache: Kill unused freelist

2014-03-18T19:23:36+00:00

This was originally added as at optimization that for various reasons isn't
needed anymore, but it does add a lot of nasty corner cases (and it was
responsible for some recently fixed bugs). Just get rid of it now.

Signed-off-by: Kent Overstreet

bcache: Rework btree cache reserve handling

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

This changes the bucket allocation reserves to use _real_ reserves - separate
freelists - instead of watermarks, which if nothing else makes the current code
saner to reason about and is going to be important in the future when we add
support for multiple btrees.

It also adds btree_check_reserve(), which checks (and locks) the reserves for
both bucket allocation and memory allocation for btree nodes; the old code just
kinda sorta assumed that since (e.g. for btree node splits) it had the root
locked and that meant no other threads could try to make use of the same
reserve; this technically should have been ok for memory allocation (we should
always have a reserve for memory allocation (the btree node cache is used as a
reserve and we preallocate it)), but multiple btrees will mean that locking the
root won't be sufficient anymore, and for the bucket allocation reserve it was
technically possible for the old code to deadlock.

Signed-off-by: Kent Overstreet

bcache: btree locking rework

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

Add a new lock, b->write_lock, which is required to actually modify - or write -
a btree node; this lock is only held for short durations.

This means we can write out a btree node without taking b->lock, which _is_ held
for long durations - solving a deadlock when btree_flush_write() (from the
journalling code) is called with a btree node locked.

Right now just occurs in bch_btree_set_root(), but with an upcoming journalling
rework is going to happen a lot more.

This also turns b->lock is now more of a read/intent lock instead of a
read/write lock - but not completely, since it still blocks readers. May turn it
into a real intent lock at some point in the future.

Signed-off-by: Kent Overstreet

bcache: Fix another bug recovering from unclean shutdown

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

The on disk bucket gens are allowed to be out of date, when we reuse buckets
that didn't have any live data in them. To deal with this, the initial gc has to
update the bucket gen when we find a pointer gen newer than the bucket's gen.

Unfortunately we weren't doing this for pointers in the journal that we're about
to replay.

Signed-off-by: Kent Overstreet

bcache: Convert btree_iter to struct btree_keys

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

More work to disentangle bset.c from struct btree

Signed-off-by: Kent Overstreet

bcache: Add struct btree_keys

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

Soon, bset.c won't need to depend on struct btree.

Signed-off-by: Kent Overstreet

bcache: Abstract out stuff needed for sorting

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

Signed-off-by: Kent Overstreet