mirror of
https://git.haproxy.org/git/haproxy.git/
synced 2025-09-25 15:51:24 +02:00
65904e4f07
Add an arbitrary maximum number of secondary entries per primary hash (10 for now) to the cache. This prevents the cache from being filled with duplicates of the same resource. This works thanks to an entry counter that is kept in one of the duplicates of the list (the last one). When an entry is added to the list, the ebtree's implementation ensures that it will be added to the end of the existing list so the only thing to do to keep the counter updated is to get the previous counter from the second to last entry. Likewise, when an entry is explicitely deleted, we update the counter from the list's last item.
The HAProxy documentation has been split into a number of different files for ease of use. Please refer to the following files depending on what you're looking for : - INSTALL for instructions on how to build and install HAProxy - BRANCHES to understand the project's life cycle and what version to use - LICENSE for the project's license - CONTRIBUTING for the process to follow to submit contributions The more detailed documentation is located into the doc/ directory : - doc/intro.txt for a quick introduction on HAProxy - doc/configuration.txt for the configuration's reference manual - doc/lua.txt for the Lua's reference manual - doc/SPOE.txt for how to use the SPOE engine - doc/network-namespaces.txt for how to use network namespaces under Linux - doc/management.txt for the management guide - doc/regression-testing.txt for how to use the regression testing suite - doc/peers.txt for the peers protocol reference - doc/coding-style.txt for how to adopt HAProxy's coding style - doc/internals for developer-specific documentation (not all up to date)