From: Kent Overstreet <koverstreet@google.com>
Date: Sat, 11 May 2013 22:59:37 +0000 (-0700)
Subject: bcache: Improve lazy sorting
X-Git-Tag: v3.11-rc3~32^2~1^2~12
X-Git-Url: http://git.openpandora.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=6ded34d1a54c046a45db071d3cb7b37bd0a4a31f;p=pandora-kernel.git

bcache: Improve lazy sorting

The old lazy sorting code was kind of hacky - rewrite in a way that
mathematically makes more sense; the idea is that the size of the sets
of keys in a btree node should increase by a more or less fixed ratio
from smallest to biggest.

Signed-off-by: Kent Overstreet <koverstreet@google.com>
---

Reading git-diff-tree failed