Willy Tarreau c9e4adf608 IMPORT: eb32/eb64: use a more parallelizable check for lack of common bits ... Instead of shifting the XOR value right and comparing it to 1, which roughly requires 2 sequential instructions, better test if the XOR has any bit above the current bit, which means any bit set among those strictly higher, or in other words that XOR & (-bit << 1) is non-zero. This is one less instruction in the fast path and gives another nice performance gain on random keys (in million lookups/s): eb32 1k: 33.17 -> 37.30 +12.5% 10k: 15.74 -> 17.08 +8.51% 100k: 8.00 -> 9.00 +12.5% eb64 1k: 34.40 -> 38.10 +10.8% 10k: 16.17 -> 17.10 +5.75% 100k: 8.38 -> 8.87 +5.85% This is ebtree commit c942a2771758eed4f4584fe23cf2914573817a6b.		2025-09-17 14:30:31 +02:00
..
haproxy	MINOR: counters: document that tg shared counters are tied to shm-stats-file mapping	2025-09-17 11:31:29 +02:00
import	IMPORT: eb32/eb64: use a more parallelizable check for lack of common bits	2025-09-17 14:30:31 +02:00
make	BUILD: makefile: add a qinfo macro to pass info in quiet mode	2025-01-08 11:26:05 +01:00