diff options
| author | Kent Overstreet <kent.overstreet@gmail.com> | 2021-04-06 13:43:31 -0400 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-10-22 17:08:59 -0400 |
| commit | a0857785001777ff659248e45a2e1688fb43499d (patch) | |
| tree | 58146431cce01acf7038edcd25814882f79c6d34 /fs/bcachefs/bset.h | |
| parent | f72b1fd710870547f566d7d02563833eda43e67d (diff) | |
bcachefs: Increase BSET_CACHELINE to 256 bytes
Linear searches have gotten cheaper relative to binary searches on
modern hardware, due to better branch prediction behaviour.
Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
Diffstat (limited to 'fs/bcachefs/bset.h')
| -rw-r--r-- | fs/bcachefs/bset.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/bcachefs/bset.h b/fs/bcachefs/bset.h index e6c8d081f9b6..8acbcb5d86c4 100644 --- a/fs/bcachefs/bset.h +++ b/fs/bcachefs/bset.h @@ -188,7 +188,7 @@ static inline enum bset_aux_tree_type bset_aux_tree_type(const struct bset_tree * gets to the second cacheline. */ -#define BSET_CACHELINE 128 +#define BSET_CACHELINE 256 static inline size_t btree_keys_cachelines(const struct btree *b) { |