commit | 6c39198b575444466ddfc5368e481d2a7cf8111d | [log] [tgz] |
---|---|---|
author | Frédéric Lécaille <flecaille@haproxy.com> | Thu Jun 06 11:34:03 2019 +0200 |
committer | Willy Tarreau <w@1wt.eu> | Fri Jun 07 15:47:54 2019 +0200 |
tree | 817d84246c5ce41dc7d457df48e0177b3bfd6993 | |
parent | 6ec902a6590bff551f332d8a1a9b67b2dda02829 [diff] |
MINOR peers: data structure simplifications for server names dictionary cache. We store pointers to server names dictionary entries in a pre-allocated array of ebpt_node's (->entries member of struct dcache_tx) to cache those sent to remote peers. Consequently the ID used to identify the server name dictionary entry is also used as index for this array. There is no need to implement a lookup by key for this dictionary cache.