diff options
| author | Kent Overstreet <koverstreet@google.com> | 2013-05-11 22:59:37 (GMT) |
|---|---|---|
| committer | Kent Overstreet <koverstreet@google.com> | 2013-06-27 00:09:16 (GMT) |
| commit | 6ded34d1a54c046a45db071d3cb7b37bd0a4a31f (patch) | |
| tree | 1f2b7703d1be78e0ab510df54a487b746a8e2312 /arch/ia64 | |
| parent | 85b1492ee113486d871de7676a61f506a43ca475 (diff) | |
| download | linux-6ded34d1a54c046a45db071d3cb7b37bd0a4a31f.tar.xz | |
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>
Diffstat (limited to 'arch/ia64')
0 files changed, 0 insertions, 0 deletions