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 3.3.1 was issued on 2025-12-19. There are currently 11
patches in the queue cut down this way:
- 4 MEDIUM, first one merged on 2026-01-09
- 7 MINOR, first one merged on 2026-01-09
Thus the computed ideal release date for 3.3.2 would be 2026-02-06, which is in
one week or less.
Last release 3.2.10 was issued on 2025-12-18. There are currently 10
patches in the queue cut down this way:
- 5 MEDIUM, first one merged on 2026-01-07
- 5 MINOR, first one merged on 2026-01-09
Thus the computed ideal release date for 3.2.11 would be 2026-02-06, which is
in one week or less.
Last release 3.1.12 was issued on 2025-12-22. There are currently 11
patches in the queue cut down this way:
- 5 MEDIUM, first one merged on 2026-01-07
- 6 MINOR, first one merged on 2026-01-09
Thus the computed ideal release date for 3.1.13 would be 2026-03-06, which is
in five weeks or less.
Last release 3.0.14 was issued on 2025-12-22. There are currently 15
patches in the queue cut down this way:
- 9 MEDIUM, first one merged on 2026-01-07
- 6 MINOR, first one merged on 2026-01-09
Thus the computed ideal release date for 3.0.15 would be 2026-03-06, which is
in five weeks or less.
Last release 2.8.18 was issued on 2025-12-25. There are currently 7
patches in the queue cut down this way:
- 3 MEDIUM, first one merged on 2026-01-07
- 4 MINOR, first one merged on 2026-01-09
Thus the computed ideal release date for 2.8.19 would be 2026-04-03, which is
in nine weeks or less.
The current list of patches in the queue is:
- 3.0 - MEDIUM : resolvers: Make resolution owns its
hostname_dn value
- 3.3 - MEDIUM : mux-h1: Take care to update
- 3.1, 3.2 - MEDIUM : ssl: Don't resume session for check
connections
- 3.3 - MEDIUM : peers: Properly handle shutdown when
trying to get a line
- 3.0 - MEDIUM : resolvers: break an infinite loop in
resolv_get_ip_from_response()
- 2.8, 3.0, 3.1, 3.2 - MEDIUM : stconn: Don't report abort from SC
if read0 was already received
- 3.0 - MEDIUM : resolvers: Accept to create resolution
without hostname
- 2.8, 3.0 - MEDIUM : config: Use the mux protocol ALPN by
default for listeners if forced
- 3.1, 3.2, 3.3 - MEDIUM : mworker: can't use signals after a
failed reload
- 3.0 - MEDIUM : resolvers: Test for empty tree when
getting a record from DNS answer
- 3.1, 3.2 - MEDIUM : ssl: Don't reuse TLS session if the
connection's SNI differs
- 3.0 - MEDIUM : resolvers: Wake resolver task up whne
unlinking a stream requester
- 3.0 - MEDIUM : resolvers: Properly cache do-resolv
resolution
- 3.3 - MEDIUM : stconn: Move data from
- 2.8, 3.0, 3.1, 3.2 - MEDIUM : http-ana: Properly detect client
abort when forwarding response (v2)
- 3.0 - MINOR : resolvers: ensure fair round robin
iteration
- 2.8, 3.0, 3.1, 3.2, 3.3 - MINOR : cfgparse: wrong section name
upon error
- 2.8, 3.0, 3.1, 3.2, 3.3 - MINOR : backend: fix the conn_retries
check for TFO
- 3.1, 3.2 - MINOR : sock-inet: ignore conntrack for
transparent sockets on Linux
- 2.8, 3.0, 3.1, 3.2, 3.3 - MINOR : cli/stick-tables: argument to
"show table" is optional
- 3.3 - MINOR : mworker/cli: fix show proc pagination
using reload counter
- 3.1 - MINOR : mux-h2: send the preface along with
the first request if needed
- 2.8, 3.0, 3.1, 3.2, 3.3 - MINOR : backend: inspect request not
response buffer to check for TFO
- 3.0 - MINOR : resolvers: Restore round-robin
selection on records in DNS answers
- 3.3 - MINOR : ech/quic: enable ech configuration
also for quic listeners
- 3.3 - MINOR : quic: fix deprecated warning for
window size keyword
--
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.
