Поиск уязвимостей
Количество 17
Количество 17
GHSA-hhcv-vc8h-vmrg
Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified.
CVE-2026-19542
Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified.
CVE-2026-19542
Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified.
CVE-2026-19542
Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified.
CVE-2026-19542
Stack-based out-of-bounds write in tdelete during tree rebalancing
CVE-2026-19542
Calling tdelete on a sufficiently deep tree in the GNU C Library versi ...
RLSA-2026:80798
Moderate: glibc security update
RLSA-2026:76781
Moderate: glibc security, bug fix, and enhancement update
ELSA-2026-80798
ELSA-2026-80798: glibc security update (MODERATE)
ELSA-2026-76781
ELSA-2026-76781: glibc security, bug fix, and enhancement update (MODERATE)
SUSE-SU-2026:4204-1
Security update for glibc
RLSA-2026:79281
Moderate: glibc security, bug fix, and enhancement update
ELSA-2026-79281
ELSA-2026-79281: glibc security, bug fix, and enhancement update (MODERATE)
ELSA-2026-500576
ELSA-2026-500576: glibc security update (MODERATE)
SUSE-SU-2026:4250-1
Security update for glibc
openSUSE-SU-2026:21968-1
Security update for glibc
SUSE-SU-2026:4591-1
Security update for glibc
Уязвимостей на страницу
Уязвимость | CVSS | EPSS | Опубликовано | |
|---|---|---|---|---|
GHSA-hhcv-vc8h-vmrg Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified. | CVSS3: 5.6 | 0% Низкий | 2 месяца назад | |
CVE-2026-19542 Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified. | CVSS3: 5.6 | 0% Низкий | 2 месяца назад | |
CVE-2026-19542 Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified. | CVSS3: 4.2 | 0% Низкий | 3 месяца назад | |
CVE-2026-19542 Calling tdelete on a sufficiently deep tree in the GNU C Library version 2.1 to 2.44 may write one pointer past the end of an alloca-allocated array on the stack, which may crash the application. The tdelete implementation keeps an explicit stack of parent nodes for rebalancing, which is grown as needed while descending the tree. Two rebalancing branches push an additional entry without checking the capacity, and write past the array when the stack is exactly full. Triggering this requires a node at a depth of exactly 40 (or 40 plus a multiple of 20), which implies a tree with at least a million nodes, so an attacker must drive a large number of insertions and deletions through an application that uses tsearch and tdelete. The written value is a pointer into a tree node and is not directly attacker controlled. No affected application in common distributions has been identified. | CVSS3: 5.6 | 0% Низкий | 2 месяца назад | |
CVE-2026-19542 Stack-based out-of-bounds write in tdelete during tree rebalancing | CVSS3: 5.6 | 0% Низкий | 2 месяца назад | |
CVE-2026-19542 Calling tdelete on a sufficiently deep tree in the GNU C Library versi ... | CVSS3: 5.6 | 0% Низкий | 2 месяца назад | |
RLSA-2026:80798 Moderate: glibc security update | около 1 месяца назад | |||
RLSA-2026:76781 Moderate: glibc security, bug fix, and enhancement update | около 1 месяца назад | |||
ELSA-2026-80798 ELSA-2026-80798: glibc security update (MODERATE) | 15 дней назад | |||
ELSA-2026-76781 ELSA-2026-76781: glibc security, bug fix, and enhancement update (MODERATE) | 15 дней назад | |||
SUSE-SU-2026:4204-1 Security update for glibc | 2 месяца назад | |||
RLSA-2026:79281 Moderate: glibc security, bug fix, and enhancement update | около 1 месяца назад | |||
ELSA-2026-79281 ELSA-2026-79281: glibc security, bug fix, and enhancement update (MODERATE) | 16 дней назад | |||
ELSA-2026-500576 ELSA-2026-500576: glibc security update (MODERATE) | 14 дней назад | |||
SUSE-SU-2026:4250-1 Security update for glibc | 2 месяца назад | |||
openSUSE-SU-2026:21968-1 Security update for glibc | около 2 месяцев назад | |||
SUSE-SU-2026:4591-1 Security update for glibc | около 1 месяца назад |
Уязвимостей на страницу