bcache: Incremental gc

Browse source

Big garbage collection rewrite; now, garbage collection uses the same
mechanisms as used elsewhere for inserting/updating btree node pointers,
instead of rewriting interior btree nodes in place.

This makes the code significantly cleaner and less fragile, and means we
can now make garbage collection incremental - it doesn't have to hold a
write lock on the root of the btree for the entire duration of garbage
collection.

This means that there's less of a latency hit for doing garbage
collection, which means we can gc more frequently (and do a better job
of reclaiming from the cache), and we can coalesce across more btree
nodes (improving our space efficiency).

Signed-off-by: Kent Overstreet <kmo@daterainc.com>

...

This commit is contained in:

Kent Overstreet 2013-09-10 19:07:00 -07:00

parent 8835c1234d

commit a1f0358b2b

4 changed files with 226 additions and 167 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download patch file Download diff file Expand all files Collapse all files

1

drivers/md/bcache/bcache.h

View file

410

drivers/md/bcache/btree.c

View file

2

drivers/md/bcache/btree.h

View file

2

drivers/md/bcache/sysfs.c

View file