Willy Tarreau 7893ae117f MEDIUM: resolvers: replace the answer_list with a (flat) tree ...

With SRV records, a huge amount of time is spent looking for records
by walking long lists. It is possible to reduce this by indexing values
in trees instead. However the whole code relies a lot on the list
ordering, and even implements some round-robin on it to distribute IP
addresses to servers.

This patch starts carefully by replacing the list with a an eb32 tree
that is still used like a list, with a constant key 0. Since ebtrees
preserve insertion order for duplicates, the tree walk visits the nodes
in the exact same order it did with the lists. This allows to implement
the required infrastructure without changing the behavior.

2021-10-21 08:02:08 +02:00

..

haproxy

MEDIUM: resolvers: replace the answer_list with a (flat) tree

2021-10-21 08:02:08 +02:00

import

REORG: ebtree: split structures into their own file ebtree-t.h

2021-10-07 01:41:14 +02:00