bcachefs: Fall back to slowpath on exact comparison

Browse source

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>

...

This commit is contained in:

Kent Overstreet 2019-10-23 14:56:20 -04:00 • committed by Kent Overstreet

parent 1bdb67e8cb

commit 58404bb236

3 changed files with 48 additions and 61 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download patch file Download diff file Expand all files Collapse all files

100

fs/bcachefs/bset.c

View file

3

fs/bcachefs/bset.h

View file

6

fs/bcachefs/btree_cache.c

View file