6 matches found
Astra Linux – Vulnerabilities in Linux, Linux-5.10, Linux-5.15, Linux-6.1
In the Linux kernel, the following vulnerability has been resolved: lib/generic-radix-tree.c: A rare race condition in genradixptralloc has been fixed. If we need to increase the tree depth, we will allocate a new node. If another thread increases the tree depth before us, we will still have a...
Unity Linux 20.1060a / 20.1070a Security Update: kernel (UTSA-2025-992931)
The Unity Linux 20 host has a package installed that is affected by a vulnerability as referenced in the UTSA-2025-992931 advisory. In the Linux kernel, the following vulnerability has been resolved: lib/generic-radix-tree.c: Fix rare race in genradixptralloc If we need to increase the tree depth...
kernel: lib/generic-radix-tree.c: Fix rare race in __genradix_ptr_alloc()
A flaw was found in the Linux kernel. A race condition in the genradixptralloc function, responsible for allocating nodes in the generic radix tree, can occur when increasing the tree depth. This race can lead to a preallocated node retaining a pointer to an old root instead of being properly...
kernel: lib/generic-radix-tree.c: Fix rare race in __genradix_ptr_alloc()
A flaw was found in the Linux kernel. A race condition in the genradixptralloc function, responsible for allocating nodes in the generic radix tree, can occur when increasing the tree depth. This race can lead to a preallocated node retaining a pointer to an old root instead of being properly...
kernel: lib/generic-radix-tree.c: Fix rare race in __genradix_ptr_alloc()
A flaw was found in the Linux kernel. A race condition in the genradixptralloc function, responsible for allocating nodes in the generic radix tree, can occur when increasing the tree depth. This race can lead to a preallocated node retaining a pointer to an old root instead of being properly...
SUSE CVE-2024-47668
In the Linux kernel, the following vulnerability has been resolved: lib/generic-radix-tree.c: Fix rare race in genradixptralloc If we need to increase the tree depth, allocate a new node, and then race with another thread that increased the tree depth before us, we'll still have a preallocated no...