Willy Tarreau 8878b6c4cb MINOR: ebtree: implement eb32sc_lookup_ge_or_first() ... In the scheduler we always have to loop back to the beginning after we don't find the last entry, so let's implement this in a new lookup function instead. The resulting code is slightly faster, mostly due to the fact that there's much less inlined code in the fast path.		2017-11-06 11:20:11 +01:00
..
compiler.h
eb32sctree.c	MINOR: ebtree: implement eb32sc_lookup_ge_or_first()	2017-11-06 11:20:11 +01:00
eb32sctree.h	MINOR: ebtree: implement eb32sc_lookup_ge_or_first()	2017-11-06 11:20:11 +01:00
eb32tree.c
eb32tree.h	MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates	2013-05-07 16:10:02 +02:00
eb64tree.c
eb64tree.h	MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates	2013-05-07 16:10:02 +02:00
ebimtree.c
ebimtree.h	MINOR: protect ebimtree/ebistree against multiple inclusions	2014-03-15 07:48:25 +01:00
ebistree.c
ebistree.h	MINOR: protect ebimtree/ebistree against multiple inclusions	2014-03-15 07:48:25 +01:00
ebmbtree.c
ebmbtree.h	DOC: ebtree: indicate that prefix insertion/lookup may be used with strings	2014-05-10 08:36:19 +02:00
ebpttree.c
ebpttree.h	MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates	2013-05-07 16:10:02 +02:00
ebsttree.c
ebsttree.h
ebtree.c
ebtree.h	OPTIM: ebtree: pack the struct eb_node to avoid holes on 64-bit	2013-12-07 01:36:08 +01:00
LICENSE