diff options
author | 2013-05-11 15:59:37 -0700 | |
---|---|---|
committer | 2013-06-26 17:09:16 -0700 | |
commit | 6ded34d1a54c046a45db071d3cb7b37bd0a4a31f (patch) | |
tree | 1f2b7703d1be78e0ab510df54a487b746a8e2312 /tools/perf/scripts/python/call-graph-from-postgresql.py | |
parent | bcache: Rip out pkey()/pbtree() (diff) | |
download | linux-dev-6ded34d1a54c046a45db071d3cb7b37bd0a4a31f.tar.xz linux-dev-6ded34d1a54c046a45db071d3cb7b37bd0a4a31f.zip |
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 'tools/perf/scripts/python/call-graph-from-postgresql.py')
0 files changed, 0 insertions, 0 deletions