Willy Tarreau e1ee956399 [OPTIM] ebtree: inline ebst_lookup_len and ebis_lookup_len ... (from ebtree 6.0.5) Both of them are very short and rely on another non-inlined lookup function, so it's pointless to have them as pure functions, it wastes space. (cherry picked from commit 1e68d6fef815f759304d4cc0e65f957689e19a7a)		2011-01-04 14:44:05 +01:00
..
compiler.h	[BUG] definitely fix regparm issues between haproxy core and ebtree	2009-10-27 21:53:58 +01:00
eb32tree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
eb32tree.h	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
eb64tree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
eb64tree.h	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebimtree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebimtree.h	[OPTIM] ebtree: ebmb_lookup: reduce stack usage by moving the return code out of the loop	2011-01-04 14:43:58 +01:00
ebistree.c	[OPTIM] ebtree: inline ebst_lookup_len and ebis_lookup_len	2011-01-04 14:44:05 +01:00
ebistree.h	[OPTIM] ebtree: inline ebst_lookup_len and ebis_lookup_len	2011-01-04 14:44:05 +01:00
ebmbtree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebmbtree.h	[OPTIM] ebtree: ebmb_lookup: reduce stack usage by moving the return code out of the loop	2011-01-04 14:43:58 +01:00
ebpttree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebpttree.h	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebsttree.c	[OPTIM] ebtree: inline ebst_lookup_len and ebis_lookup_len	2011-01-04 14:44:05 +01:00
ebsttree.h	[OPTIM] ebtree: inline ebst_lookup_len and ebis_lookup_len	2011-01-04 14:44:05 +01:00
ebtree.c	[MEDIUM] ebtree: upgrade to version 6.0	2010-05-12 16:52:00 +02:00
ebtree.h	[BUG] ebtree: fix duplicate strings insertion	2010-10-30 19:04:36 +02:00