tree bd6ba0ebc4b9218e1af18c313dc4b42242b48489
parent 2b5285da333ec711789a0806bd840cc7bcba0fa5
author Willy Tarreau <w@1wt.eu> 1273426163 +0200
committer Willy Tarreau <w@1wt.eu> 1273675920 +0200

[MEDIUM] ebtree: upgrade to version 6.0

This version adds support for prefix-based matching of memory blocks,
as well as some code-size and performance improvements on the generic
code. It provides a prefix insertion and longest match which are
compatible with the rest of the common features (walk, duplicates,
delete, ...). This is typically used for network address matching. The
longest-match code is a bit slower than the original memory block
handling code, so they have not been merged together into generic
code. Still it's possible to perform about 10 million networks lookups
per second in a set of 50000, so this should be enough for most usages.

This version also fixes some bugs in parts that were not used, so there
is no need to backport them.