| commit | 6ded34d1a54c046a45db071d3cb7b37bd0a4a31f | [log] [tgz] |
|---|---|---|
| author | Kent Overstreet <koverstreet@google.com> | Sat May 11 15:59:37 2013 -0700 |
| committer | Kent Overstreet <koverstreet@google.com> | Wed Jun 26 17:09:16 2013 -0700 |
| tree | 1f2b7703d1be78e0ab510df54a487b746a8e2312 | |
| parent | 85b1492ee113486d871de7676a61f506a43ca475 [diff] |
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>