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>

diff --git a/fs/bcachefs/bset.h b/fs/bcachefs/bset.h
index e6c8d081f9b64a39d58145d3e8a8139f7cf600bf..8acbcb5d86c4d84c70f9f938f33a2e6aeafb38be 100644 (file)
--- 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)
 {