mirror of
http://git.haproxy.org/git/haproxy.git/
synced 2024-12-11 22:15:14 +00:00
3a93244ed8
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. |
||
|---|---|---|
| .. | ||
| compiler.h | ||
| eb32tree.c | ||
| eb32tree.h | ||
| eb64tree.c | ||
| eb64tree.h | ||
| ebimtree.c | ||
| ebimtree.h | ||
| ebistree.c | ||
| ebistree.h | ||
| ebmbtree.c | ||
| ebmbtree.h | ||
| ebpttree.c | ||
| ebpttree.h | ||
| ebsttree.c | ||
| ebsttree.h | ||
| ebtree.c | ||
| ebtree.h | ||