From: Kent Overstreet <kmo@daterainc.com>
Date: Tue, 24 Sep 2013 06:17:35 +0000 (-0700)
Subject: bcache: Fix for handling overlapping extents when reading in a btree node
X-Git-Tag: v3.12-rc3~34^2~1
X-Git-Url: http://git.openpandora.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=84786438ed17978d72eeced580ab757e4da8830b;p=pandora-kernel.git

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
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
---

Reading git-diff-tree failed