Hi, This is a friendly bot that watches fixes pending for the next haproxy-stable release! One such e-mail is sent periodically once patches are waiting in the last maintenance branch, and an ideal release date is computed based on the severity of these fixes and their merge date. Responses to this mail must be sent to the mailing list.
Last release 1.9.10 was issued on 2019/08/08. There are currently 17 patches in the queue cut down this way: - 8 MEDIUM, first one merged on 2019/08/15 - 9 MINOR, first one merged on 2019/08/12 Thus the computed ideal release date for 1.9.11 would be 2019/09/09, which was one week ago. The current list of patches in the queue is: - MEDIUM : cache: Don't cache objects if the size of headers is too big - MEDIUM : url32 does not take the path part into account in the returned hash. - MEDIUM : listener/threads: fix an AB/BA locking issue in delete_listener() - MEDIUM : connection: don't keep more idle connections than ever needed - MEDIUM : proto-http: Always start the parsing if there is no outgoing data - MEDIUM : http: also reject messages where "chunked" is missing from transfer-enoding - MEDIUM : mux-h1: do not truncate trailing 0CRLF on buffer boundary - MEDIUM : lua: Fix test on the direction to set the channel exp timeout - MINOR : listener: Fix a possible null pointer dereference - MINOR : lb/leastconn: ignore the server weights for empty servers - MINOR : lua: fix setting netfilter mark - MINOR : Missing stat_field_names (since f21d17bb) - MINOR : mworker: disable SIGPROF on re-exec - MINOR : http-ana: Reset response flags when 1xx messages are handled - MINOR : h1: Properly reset h1m when parsing is restarted - MINOR : acl: Fix memory leaks when an ACL expression is parsed - MINOR : filters: Properly set the HTTP status code on analysis error --- The haproxy stable-bot is freely provided by HAProxy Technologies to help improve the quality of each HAProxy release. If you have any issue with these emails or if you want to suggest some improvements, please post them on the list so that the solutions suiting the most users can be found.