summaryrefslogtreecommitdiff
path: root/drivers/md/bcache/request.c
diff options
context:
space:
mode:
authorKent Overstreet <kmo@daterainc.com>2013-08-28 18:01:24 -0700
committerKent Overstreet <kmo@daterainc.com>2013-09-18 13:32:10 -0700
commit12bd13ba67db0757a99729a32630dce0507aee6d (patch)
tree86c4237adb2b67d8e6c368c08add0583fa20da8f /drivers/md/bcache/request.c
parent28b7244fe1b6a82d8e68d03a26eba9b5cf80ae0b (diff)
bcache: Fix for handling overlapping extents when reading in a btree node
btree_sort_fixup() was overly clever, because it was trying to avoid pulling a key off the btree iterator in more than one place. This led to a really obscure bug where we'd break early from the loop in btree_sort_fixup() if the current key overlapped with keys in more than one older set, and the next key it overlapped with was zero size. Signed-off-by: Kent Overstreet <kmo@daterainc.com> Cc: linux-stable <stable@vger.kernel.org> # >= v3.10
Diffstat (limited to 'drivers/md/bcache/request.c')
0 files changed, 0 insertions, 0 deletions