PT-2026-84878
CVE-2026-19542
·
Published
2026-08-23
·
Updated
2026-10-20
Description by
CVSS 3.1
5.6
MediumMetricsAV:N/AC:H/PR:N/UI:N/S:U/C:L/I:L/A:L
Name of the Vulnerable Software and Affected Versions
GNU C Library versions 2.1 through 2.44
Description
Calling the
tdelete() function on a sufficiently deep tree may result in writing one pointer past the end of an alloca-allocated array on the stack, potentially causing the application to crash. The tdelete() implementation maintains an explicit stack of parent nodes for rebalancing that grows during tree descent. Two rebalancing branches fail to check capacity before pushing an additional entry, leading to an out-of-bounds write when the stack is full. This condition requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), necessitating a tree with at least one million nodes. An attacker would need to trigger a large volume of insertions and deletions via an application utilizing tsearch() and tdelete(). The value written is a pointer to a tree node and is not directly controlled by the attacker.Recommendations
Update GNU C Library to a version later than 2.44.
As a temporary mitigation, restrict the use of the
tdelete() function in applications processing untrusted data that could lead to the creation of extremely deep trees. Found an issue in the description? Have something to add? Feel free to write us 👾