Willy Tarreau 52c6dd773d IMPORT: ebst: use prefetching in lookup() and insert() ... While the previous optimizations couldn't be preserved due to the possibility of out-of-bounds accesses, at least the prefetch is useful. A test on treebench shows that for 64k short strings, the lookup time falls from 276 to 199ns per lookup (28% savings), and the insert falls from 311 to 296ns (4.9% savings), which are pretty respectable, so let's do this. This is ebtree commit b44ea5d07dc1594d62c3a902783ed1fb133f568d.		2025-09-17 14:30:32 +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: ebst: use prefetching in lookup() and insert()	2025-09-17 14:30:32 +02:00
make	BUILD: makefile: add a qinfo macro to pass info in quiet mode	2025-01-08 11:26:05 +01:00