SecvalisbySYSDEVOPS.EU
Katalog CVE
EnglishPolski

CVE-2026-74686

Niskie ryzyko· EPSS 14%
Opublikowano: Zaktualizowano: Przetłumaczono: NVD NIST

Prawdopodobieństwo exploitacji (EPSS)

Niskie ryzyko
0.24%

Percentyl 14 - wyżej niż 14% wszystkich znanych CVE

Streszczenie

W jądrze Linuxa wykryto podatność w mechanizmie rqspinlock, gdzie w przypadku wykrycia zakleszczenia ABBA nie jest resetowany wskaźnik ogona kolejki oczekujących. Może to prowadzić do sytuacji, w której wątek czeka na następnego oczekującego, który nigdy nie nadejdzie, powodując sporadyczne lub trwałe zawieszenie działania systemu.

Ocena ryzyka

Ryzyko polega na możliwych zakleszczeniach i zawieszeniach systemu w środowiskach wieloprocesorowych, co może prowadzić do niedostępności usług i awarii systemu.

Rekomendacja

Zaleca się pilne zastosowanie oficjalnej łatki jądra Linuxa, która resetuje wskaźnik ogona kolejki w przypadku wykrycia zakleszczenia, oraz monitorowanie komunikatów o zakleszczeniach w logach systemowych.

Inne podatności w Linux kernel

Zobacz wszystkie
Oryginalny opis (angielski, źródło NVD)

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

Dane podatności pochodzą z NVD (NIST) · CISA KEV · EPSS