CVE-2025-68169:詳細資料

CVE-2025-68169

0.03%V4
2025-12-16
13h42 +00:00
2026-05-11
21h47 +00:00
指定 CVE 通知
掌握特定 CVE 的任何變更。
管理通知

CVE 描述

netpoll: Fix deadlock in memory allocation under spinlock

In the Linux kernel, the following vulnerability has been resolved: netpoll: Fix deadlock in memory allocation under spinlock Fix a AA deadlock in refill_skbs() where memory allocation while holding skb_pool->lock can trigger a recursive lock acquisition attempt. The deadlock scenario occurs when the system is under severe memory pressure: 1. refill_skbs() acquires skb_pool->lock (spinlock) 2. alloc_skb() is called while holding the lock 3. Memory allocator fails and calls slab_out_of_memory() 4. This triggers printk() for the OOM warning 5. The console output path calls netpoll_send_udp() 6. netpoll_send_udp() attempts to acquire the same skb_pool->lock 7. Deadlock: the lock is already held by the same CPU Call stack: refill_skbs() spin_lock_irqsave(&skb_pool->lock) <- lock acquired __alloc_skb() kmem_cache_alloc_node_noprof() slab_out_of_memory() printk() console_flush_all() netpoll_send_udp() skb_dequeue() spin_lock_irqsave(&skb_pool->lock) <- deadlock attempt This bug was exposed by commit 248f6571fd4c51 ("netpoll: Optimize skb refilling on critical path") which removed refill_skbs() from the critical path (where nested printk was being deferred), letting nested printk being called from inside refill_skbs() Refactor refill_skbs() to never allocate memory while holding the spinlock. Another possible solution to fix this problem is protecting the refill_skbs() from nested printks, basically calling printk_deferred_{enter,exit}() in refill_skbs(), then, any nested pr_warn() would be deferred. I prefer this approach, given I _think_ it might be a good idea to move the alloc_skb() from GFP_ATOMIC to GFP_KERNEL in the future, so, having the alloc_skb() outside of the lock will be necessary step. There is a possible TOCTOU issue when checking for the pool length, and queueing the new allocated skb, but, this is not an issue, given that an extra SKB in the pool is harmless and it will be eventually used.

CVE 資訊

EPSS

EPSS 是一種預測漏洞被利用可能性的評分模型。

EPSS 評分

EPSS 模型產生介於 0 到 1(0% 到 100%)之間的概率分數。分數越高,漏洞被利用的概率越大。

EPSS 百分位數

百分位數用於根據 EPSS 分數對 CVE 進行排名。例如,EPSS 評分在第 95 百分位的 CVE 比 95% 的其他 CVE 更有可能被利用。因此,百分位數用於比較某 CVE 的 EPSS 分數與其他 CVE 的相對位置。

參考資料