GHSA-4XRV-JF38-655F
Vulnerability from github – Published: 2026-09-25 12:31 – Updated: 2026-09-25 12:31In the Linux kernel, the following vulnerability has been resolved:
btrfs: zstd: fix lost wakeup when waiting for a workspace
A writer can sleep forever in zstd_get_workspace() even though a workspace is free. When zstd_alloc_workspace() fails, the task is queued on zwsm->wait and schedules unconditionally, never re-testing the pool. zstd_put_workspace() publishes the workspace and then calls cond_wake_up(), which only wakes when a sleeper is already visible, so a workspace returned between the failed allocation and prepare_to_wait() wakes nobody. The window is wide: zstd_alloc_workspace() goes through kvmalloc() and may enter reclaim.
Only a max level workspace triggers the wakeup and one is deliberately kept allocated as the fallback every waiter waits for, so once its wakeup is lost the writer stays in TASK_UNINTERRUPTIBLE until some other task happens to return one. Re-check the pool after prepare_to_wait() has published the waiter, and use the workspace if one turned up.
{
"affected": [],
"aliases": [
"CVE-2026-98079"
],
"database_specific": {
"cwe_ids": [],
"github_reviewed": false,
"github_reviewed_at": null,
"nvd_published_at": "2026-09-25T11:17:37Z",
"severity": null
},
"details": "In the Linux kernel, the following vulnerability has been resolved:\n\nbtrfs: zstd: fix lost wakeup when waiting for a workspace\n\nA writer can sleep forever in zstd_get_workspace() even though a workspace\nis free. When zstd_alloc_workspace() fails, the task is queued on\nzwsm-\u003ewait and schedules unconditionally, never re-testing the pool.\nzstd_put_workspace() publishes the workspace and then calls cond_wake_up(),\nwhich only wakes when a sleeper is already visible, so a workspace returned\nbetween the failed allocation and prepare_to_wait() wakes nobody. The\nwindow is wide: zstd_alloc_workspace() goes through kvmalloc() and may\nenter reclaim.\n\nOnly a max level workspace triggers the wakeup and one is deliberately kept\nallocated as the fallback every waiter waits for, so once its wakeup is\nlost the writer stays in TASK_UNINTERRUPTIBLE until some other task happens\nto return one. Re-check the pool after prepare_to_wait() has published the\nwaiter, and use the workspace if one turned up.",
"id": "GHSA-4xrv-jf38-655f",
"modified": "2026-09-25T12:31:36Z",
"published": "2026-09-25T12:31:36Z",
"references": [
{
"type": "ADVISORY",
"url": "https://nvd.nist.gov/vuln/detail/CVE-2026-98079"
},
{
"type": "WEB",
"url": "https://git.kernel.org/stable/c/0de9f31d447ae71ab08c7850a321682f8d2907c3"
},
{
"type": "WEB",
"url": "https://git.kernel.org/stable/c/2acb9f3d1cc8f65dc81ed55e238cbf8e5b60bff7"
},
{
"type": "WEB",
"url": "https://git.kernel.org/stable/c/d8f57049521948df5f50797141472fbbed3b0723"
}
],
"schema_version": "1.4.0",
"severity": []
}
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.
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.