linux.git/drivers/md/bcache/super.c, branch v3.13 Linux kernel source tree bcache: Fix for can_attach_cache() 2013-12-16T22:22:57+00:00 Nicholas Swenson nks@daterainc.com 2013-10-22T20:19:23+00:00 9eb8ebeb2471b8cbaa078066aeb85fe5d46f5304 Signed-off-by: Nicholas Swenson <nks@daterainc.com> Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Signed-off-by: Nicholas Swenson <nks@daterainc.com>
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: defensively handle format strings 2013-11-11T05:56:43+00:00 Kees Cook keescook@chromium.org 2013-09-11T04:41:34+00:00 c86949486d41d9e7d7681fc72923555114fd702f Just to be safe, call the error reporting function with "%s" to avoid any possible future format string leak. Signed-off-by: Kees Cook <keescook@chromium.org> Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Just to be safe, call the error reporting function with "%s" to avoid
any possible future format string leak.

Signed-off-by: Kees Cook <keescook@chromium.org>
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Use ida for bcache block dev minor 2013-11-11T05:56:42+00:00 Kent Overstreet kmo@daterainc.com 2013-07-31T08:12:02+00:00 28935ab5163c49ca5c199d67335e5e3c72c50853 Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Fix sysfs splat on shutdown with flash only devs 2013-11-11T05:56:41+00:00 Kent Overstreet kmo@daterainc.com 2013-08-22T00:49:09+00:00 c4d951ddb66fe1d087447b0ba65c4fa4446f1083 Whoops. Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Whoops.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Better full stripe scanning 2013-11-11T05:56:41+00:00 Kent Overstreet kmo@daterainc.com 2013-10-31T22:43:22+00:00 48a915a87f0bd98c3d68d029acf223a2e5116f07 The old scanning-by-stripe code burned too much CPU, this should be better. Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
The old scanning-by-stripe code burned too much CPU, this should be
better.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Move spinlock into struct time_stats 2013-11-11T05:56:40+00:00 Kent Overstreet kmo@daterainc.com 2013-07-31T07:03:54+00:00 65d22e911bfc4f46cda4751f1b1926b43c316c14 Minor cleanup. Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Minor cleanup.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Kill sequential_merge option 2013-11-11T05:56:39+00:00 Kent Overstreet kmo@daterainc.com 2013-07-31T05:34:40+00:00 8aee122071a69ca6fa3314da7713bdf0b61dc07c It never really made sense to expose this, so just kill it. Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
It never really made sense to expose this, so just kill it.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Avoid deadlocking in garbage collection 2013-11-11T05:56:38+00:00 Kent Overstreet kmo@daterainc.com 2013-09-11T02:07:35+00:00 bc9389eefe479b7b7b323c2729b61a7155d2d0ea Not a complete fix - we could still deadlock if btree_insert_node() has to split... Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Not a complete fix - we could still deadlock if btree_insert_node() has
to split...

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: bch_(btree|extent)_ptr_invalid() 2013-11-11T05:56:35+00:00 Kent Overstreet kmo@daterainc.com 2013-07-25T06:06:40+00:00 d5cc66e95744065f96024add4bf7d7e019be54ac Trying to treat btree pointers and leaf node pointers the same way was a mistake - going to start being more explicit about the type of key/pointer we're dealing with. This is the first part of that refactoring; this patch shouldn't change any actual behaviour. Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
Trying to treat btree pointers and leaf node pointers the same way was a
mistake - going to start being more explicit about the type of
key/pointer we're dealing with. This is the first part of that
refactoring; this patch shouldn't change any actual behaviour.

Signed-off-by: Kent Overstreet <kmo@daterainc.com>
bcache: Don't bother with bucket refcount for btree node allocations 2013-11-11T05:56:34+00:00 Kent Overstreet kmo@daterainc.com 2013-07-24T23:46:42+00:00 3a3b6a4e075188342b58d4b6560f5540af64cac0 The bucket refcount (dropped with bkey_put()) is only needed to prevent the newly allocated bucket from being garbage collected until we've added a pointer to it somewhere. But for btree node allocations, the fact that we have btree nodes locked is enough to guard against races with garbage collection. Eventually the per bucket refcount is going to be replaced with something specific to bch_alloc_sectors(). Signed-off-by: Kent Overstreet <kmo@daterainc.com> 
The bucket refcount (dropped with bkey_put()) is only needed to prevent
the newly allocated bucket from being garbage collected until we've
added a pointer to it somewhere. But for btree node allocations, the
fact that we have btree nodes locked is enough to guard against races
with garbage collection.

Eventually the per bucket refcount is going to be replaced with
something specific to bch_alloc_sectors().

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