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 2.1.12 was issued on 2021-03-18. There are currently 15
patches in the queue cut down this way:
- 2 MAJOR, first one merged on 2021-04-09
- 8 MEDIUM, first one merged on 2021-03-31
- 5 MINOR, first one merged on 2021-03-31
Thus the computed ideal release date for 2.1.13 would be 2021-05-07, which is
in two weeks or less.
The current list of patches in the queue is:
- 2.1 - MAJOR : dns: disabled servers through SRV
records never recover
- 2.1 - MAJOR : dns: fix null pointer dereference in
snr_update_srv_status
- 2.1 - MEDIUM : debug/lua: Use internal hlua function
to dump the lua traceback
- 2.1 - MEDIUM : resolvers: Don't release resolution
from a requester callbacks
- 2.1 - MEDIUM : freq_ctr/threads: use the
global_now_ms variable
- 2.1 - MEDIUM : task: close a possible data race
condition on a tasklet's list link
- 2.1 - MEDIUM : time: make sure to always initialize
the global tick
- 2.1 - MEDIUM : lua: Always init the lua stack before
referencing the context
- 2.1 - MEDIUM : mux-h1: make h1_shutw_conn() idempotent
- 2.1 - MEDIUM : thread: Fix a deadlock if an isolated
thread is marked as harmless
- 2.1 - MINOR : resolvers: Unlink DNS resolution to
set RMAINT on SRV resolution
- 2.1 - MINOR : http_fetch: make hdr_ip() reject
trailing characters
- 2.1 - MINOR : http_fetch: make hdr_ip() resistant to
empty fields
- 2.1 - MINOR : tcp: fix silent-drop workaround for
IPv6
- 2.1 - MINOR : stats: Apply proper styles in HTML
status page.
--
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.