bcachefs: Fall back to slowpath on exact comparison
authorKent Overstreet <kent.overstreet@gmail.com>
Wed, 23 Oct 2019 18:56:20 +0000 (14:56 -0400)
committerKent Overstreet <kent.overstreet@linux.dev>
Sun, 22 Oct 2023 21:08:31 +0000 (17:08 -0400)
commit58404bb2362d8198c8b6618669ff949f84743ff6
tree8925d64235fa5ddc9d750abced791f81f3c45240
parent1bdb67e8cb42c156954dfe2bfb1fa6ca5eee3633
bcachefs: Fall back to slowpath on exact comparison

This is basically equivalent to the original strategy of falling back to
checking against the original key when the original key and previous key
didn't differ in the required bits - except, now we only fall back when
the search key doesn't differ in the required bits, which ends up being
a bit faster.

Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
fs/bcachefs/bset.c
fs/bcachefs/bset.h
fs/bcachefs/btree_cache.c