FKIE_CVE-2025-68169
Vulnerability from fkie_nvd - Published: 2025-12-16 14:15 - Updated: 2026-10-14 13:10| Vendor | Product | Version |
|---|
{
"affected": [
{
"affectedData": [
{
"defaultStatus": "unaffected",
"product": "Linux",
"programFiles": [
"net/core/netpoll.c"
],
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"versions": [
{
"lessThan": "06742a3ab884d7428c9050b205ffcf6a8a548397",
"status": "affected",
"version": "248f6571fd4c51531f7f8f07f186f7ae98a50afc",
"versionType": "git"
},
{
"lessThan": "327c20c21d80e0d87834b392d83ae73c955ad8ff",
"status": "affected",
"version": "248f6571fd4c51531f7f8f07f186f7ae98a50afc",
"versionType": "git"
}
]
},
{
"defaultStatus": "affected",
"product": "Linux",
"programFiles": [
"net/core/netpoll.c"
],
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"versions": [
{
"status": "affected",
"version": "6.15"
},
{
"lessThan": "6.15",
"status": "unaffected",
"version": "0",
"versionType": "semver"
},
{
"lessThanOrEqual": "6.17.*",
"status": "unaffected",
"version": "6.17.8",
"versionType": "semver"
},
{
"lessThanOrEqual": "*",
"status": "unaffected",
"version": "6.18",
"versionType": "original_commit_for_fix"
}
]
}
],
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
}
],
"cveTags": [],
"descriptions": [
{
"lang": "en",
"value": "In the Linux kernel, the following vulnerability has been resolved:\n\nnetpoll: Fix deadlock in memory allocation under spinlock\n\nFix a AA deadlock in refill_skbs() where memory allocation while holding\nskb_pool-\u003elock can trigger a recursive lock acquisition attempt.\n\nThe deadlock scenario occurs when the system is under severe memory\npressure:\n\n1. refill_skbs() acquires skb_pool-\u003elock (spinlock)\n2. alloc_skb() is called while holding the lock\n3. Memory allocator fails and calls slab_out_of_memory()\n4. This triggers printk() for the OOM warning\n5. The console output path calls netpoll_send_udp()\n6. netpoll_send_udp() attempts to acquire the same skb_pool-\u003elock\n7. Deadlock: the lock is already held by the same CPU\n\nCall stack:\n refill_skbs()\n spin_lock_irqsave(\u0026skb_pool-\u003elock) \u003c- lock acquired\n __alloc_skb()\n kmem_cache_alloc_node_noprof()\n slab_out_of_memory()\n printk()\n console_flush_all()\n netpoll_send_udp()\n skb_dequeue()\n spin_lock_irqsave(\u0026skb_pool-\u003elock) \u003c- deadlock attempt\n\nThis bug was exposed by commit 248f6571fd4c51 (\"netpoll: Optimize skb\nrefilling on critical path\") which removed refill_skbs() from the\ncritical path (where nested printk was being deferred), letting nested\nprintk being called from inside refill_skbs()\n\nRefactor refill_skbs() to never allocate memory while holding\nthe spinlock.\n\nAnother possible solution to fix this problem is protecting the\nrefill_skbs() from nested printks, basically calling\nprintk_deferred_{enter,exit}() in refill_skbs(), then, any nested\npr_warn() would be deferred.\n\nI prefer this approach, given I _think_ it might be a good idea to move\nthe alloc_skb() from GFP_ATOMIC to GFP_KERNEL in the future, so, having\nthe alloc_skb() outside of the lock will be necessary step.\n\nThere is a possible TOCTOU issue when checking for the pool length, and\nqueueing the new allocated skb, but, this is not an issue, given that\nan extra SKB in the pool is harmless and it will be eventually used."
},
{
"lang": "es",
"value": "En el kernel de Linux, la siguiente vulnerabilidad ha sido resuelta:\n\nnetpoll: Correcci\u00f3n de interbloqueo en la asignaci\u00f3n de memoria bajo spinlock\n\nCorrige un interbloqueo AA en refill_skbs() donde la asignaci\u00f3n de memoria mientras se mantiene skb_pool -\u003e lock puede desencadenar un intento de adquisici\u00f3n recursiva del bloqueo.\n\nEl escenario de interbloqueo ocurre cuando el sistema est\u00e1 bajo una presi\u00f3n de memoria severa:\n\n1. refill_skbs() adquiere skb_pool -\u003e lock (spinlock)\n2. alloc_skb() es llamado mientras se mantiene el bloqueo\n3. El asignador de memoria falla y llama a slab_out_of_memory()\n4. Esto desencadena printk() para la advertencia de OOM\n5. La ruta de salida de la consola llama a netpoll_send_udp()\n6. netpoll_send_udp() intenta adquirir el mismo skb_pool -\u003e lock\n7. Interbloqueo: el bloqueo ya est\u00e1 en posesi\u00f3n de la misma CPU\n\nPila de llamadas:\n refill_skbs()\n spin_lock_irqsave(\u0026skb_pool -\u003e lock) \u003c- bloqueo adquirido\n __alloc_skb()\n kmem_cache_alloc_node_noprof()\n slab_out_of_memory()\n printk()\n console_flush_all()\n netpoll_send_udp()\n skb_dequeue()\n spin_lock_irqsave(\u0026skb_pool -\u003e lock) \u003c- intento de interbloqueo\n\nEste error fue expuesto por el commit 248f6571fd4c51 (\u0027netpoll: Optimize skb refilling on critical path\u0027) que elimin\u00f3 refill_skbs() de la ruta cr\u00edtica (donde el printk anidado estaba siendo diferido), permitiendo que el printk anidado fuera llamado desde dentro de refill_skbs()\n\nRefactorizar refill_skbs() para nunca asignar memoria mientras se mantiene el spinlock.\n\nOtra posible soluci\u00f3n para corregir este problema es proteger refill_skbs() de printks anidados, b\u00e1sicamente llamando a printk_deferred_{enter,exit}() en refill_skbs(), entonces, cualquier pr_warn() anidado ser\u00eda diferido.\n\nPrefiero este enfoque, dado que _creo_ que podr\u00eda ser una buena idea mover alloc_skb() de GFP_ATOMIC a GFP_KERNEL en el futuro, por lo tanto, tener alloc_skb() fuera del bloqueo ser\u00e1 un paso necesario.\n\nExiste un posible problema TOCTOU al verificar la longitud del pool y encolar el nuevo skb asignado, pero esto no es un problema, dado que un SKB extra en el pool es inofensivo y eventualmente ser\u00e1 utilizado."
}
],
"id": "CVE-2025-68169",
"lastModified": "2026-10-14T13:10:00.187",
"metrics": {},
"published": "2025-12-16T14:15:48.760",
"references": [
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"url": "https://git.kernel.org/stable/c/06742a3ab884d7428c9050b205ffcf6a8a548397"
},
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"url": "https://git.kernel.org/stable/c/327c20c21d80e0d87834b392d83ae73c955ad8ff"
}
],
"sourceIdentifier": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"vulnStatus": "Deferred"
}
Drag nodes to arrange them. Double-click a related vulnerability to open it, or a source to visit its link. The Physics button on the left tunes the layout and the simulation; the legend at the bottom left hides or shows nodes by kind and by sighting type.
Sightings
| Author | Source | Type | Date | Other |
|---|
Nomenclature
- Seen: The vulnerability was mentioned, discussed, or observed by the user.
- Confirmed: The vulnerability has been validated from an analyst's perspective.
- Published Proof of Concept: A public proof of concept is available for this vulnerability.
- Exploited: The vulnerability was observed as exploited by the user who reported the sighting.
- Patched: The vulnerability was observed as successfully patched by the user who reported the sighting.
- Not exploited: The vulnerability was not observed as exploited by the user who reported the sighting.
- Not confirmed: The user expressed doubt about the validity of the vulnerability.
- Not patched: The vulnerability was not observed as successfully patched by the user who reported the sighting.
Vulnerability timeline
Sightings and recorded dates, grouped by day · UTC
How durations are calculated
Following the VTEM framework (Black Hat USA 2015), time to patch starts when the vendor or a coordinator was informed, total time to patch at discovery, and disclosure to patch at public disclosure; vendor response time runs from the report to its acknowledgement. Time to exploit and time unpatched start at the earliest discovery or report, falling back to public disclosure. Unpatched time ends at the first recorded patch, or the calculation time when no patch is recorded. Exploitation to patch shows the interval between those two events; a published proof of concept is a public exploit, not exploitation.
Each result shows its source dates. A negative interval means the end event came first; when date-only inputs leave the order open, the result says so. Date-only inputs are approximate. The earliest evidence wins: KEV report dates and sightings are labelled as such. Records describing another vulnerability are listed but never calculated from, and a PoC alone does not establish exploitation. Missing patch evidence does not prove that no patch exists. Filters below change the event list only.
Loading timeline…
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Browse all ATT&CK techniques and the vulnerabilities related to each.
Related by attack behaviour
Vulnerabilities whose description is nearest to this one in the vector space of the CIRCL/vulnerability-attack-technique-biencoder model. This is a similarity search over the bi-encoder space (plain cosine), not a classification, and it has no measured accuracy.