diff options
| author | Kent Overstreet <koverstreet@google.com> | 2013-05-12 00:59:37 +0200 |
|---|---|---|
| committer | Kent Overstreet <koverstreet@google.com> | 2013-06-27 02:09:16 +0200 |
| commit | 6ded34d1a54c046a45db071d3cb7b37bd0a4a31f (patch) | |
| tree | 1f2b7703d1be78e0ab510df54a487b746a8e2312 /drivers/md/bcache/bcache.h | |
| parent | bcache: Rip out pkey()/pbtree() (diff) | |
| download | linux-6ded34d1a54c046a45db071d3cb7b37bd0a4a31f.tar.xz linux-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 'drivers/md/bcache/bcache.h')
| -rw-r--r-- | drivers/md/bcache/bcache.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/drivers/md/bcache/bcache.h b/drivers/md/bcache/bcache.h index 59c15e09e4dd..6fa5a1e33c49 100644 --- a/drivers/md/bcache/bcache.h +++ b/drivers/md/bcache/bcache.h @@ -828,6 +828,7 @@ struct cache_set { */ struct mutex sort_lock; struct bset *sort; + unsigned sort_crit_factor; /* List of buckets we're currently writing data to */ struct list_head data_buckets; |