tree 566d3a7f8a31a4803ea762a6c4ea6e057a9d6b2e
parent 8bb72aa82fd68822fc116f58a062e97c924b4fe5
author Remi Tricot-Le Breton <rlebreton@haproxy.com> 1606295383 +0100
committer William Lallemand <wlallemand@haproxy.org> 1606923522 +0100

MINOR: cache: Add entry to the tree as soon as possible

When many concurrent requests targeting the same resource were seen, the
cache could sometimes be filled by too many partial responses resulting
in the impossibility to cache a single one of them. This happened
because the actual tree insertion happened only after all the payload of
every response was seen. So until then, every response was added to the
cache because none of the streams knew that a similar request/response
was already being treated.
This patch consists in adding the cache_entry as soon as possible in the
tree (right after the first packet) so that the other responses do not
get cached as well (if they have the same primary key).
A "complete" flag is also added to the cache_entry so that we know if
all the payload is already stored in the entry or if it is still being
processed.