Richard Yao 677c6f8457 btree: Implement faster binary search algorithm ... This implements a binary search algorithm for B-Trees that reduces branching to the absolute minimum necessary for a binary search algorithm. It also enables the compiler to inline the comparator to ensure that the only slowdown when doing binary search is from waiting for memory accesses. Additionally, it instructs the compiler to unroll the loop, which gives an additional 40% improve with Clang and 8% improvement with GCC. Consumers must opt into using the faster algorithm. At present, only B-Trees used inside kernel code have been modified to use the faster algorithm. Micro-benchmarks suggest that this can improve binary search performance by up to 3.5 times when compiling with Clang 16 and up to 1.9 times when compiling with GCC 12.2. Reviewed-by: Alexander Motin <mav@FreeBSD.org> Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov> Signed-off-by: Richard Yao <richard.yao@alumni.stonybrook.edu> Closes #14866		2023-05-26 10:03:12 -07:00
..
callbacks	Split functional testings via github action matrix	2023-03-15 10:41:05 -07:00
cmd	btree: Implement faster binary search algorithm	2023-05-26 10:03:12 -07:00
include	Teach zpool scrub to scrub only blocks in error log	2023-05-18 11:59:42 -07:00
tests	zil: Add some more statistics.	2023-05-25 13:51:53 -07:00
.gitignore	autoconf: use include directives instead of recursing down cmd	2022-05-10 10:18:38 -07:00
Makefile.am	autoconf: use include directives instead of recursing down tests (mostly)	2022-05-10 10:20:09 -07:00