GHSA-8QG4-F3VX-GHVF
Vulnerability from github – Published: 2026-09-25 12:31 – Updated: 2026-09-25 12:31In the Linux kernel, the following vulnerability has been resolved:
bnxt_en: Prevent queue stop with deferred completions
When the driver receives a burst of packets, it can mark a BD with the NO_CMPL bit to defer completions. The expectation is that the last packet in the ring will have this bit unset and the completion generated by that packet will cleanup that packet and the ones preceding it. This helps to reduce the number of completions fired.
The suppressed completions are controlled by the driver and the number of packets with suppressed completions scales with the size of the ring. SW USO packets, on the other hand, have an upper bound on the maximum number of BDs which can be consumed which does not scale with the ring size.
So, for small rings it is possible that: a burst of packets is handed to the driver, the driver defers completions for all of the packets because the number of free descriptors stays above the threshold in the driver. Then, a USO packet arrives, but the number of BDs available is not enough and the USO code exits early.
In this case, you end up in a state where the ring is full of packets with their completions suppressed, which can cause the queue to stop and never be restarted.
Assuming default CONFIG_MAX_SKB_FRAGS, this is only possible for small rings (<= 457 descriptors, below the driver default value) when a burst of packets fills the ring, followed by a large USO packet that can't fit. For larger rings, the delta between the completion suppression threshold and the BDs required for SW USO is large enough that completions will fire and this case is unreachable.
This issue was pointed out by Sashiko and while it seems fairly unlikely given that the queue size must be small to trigger this, it is indeed possible.
Fix this by tracking the last BD which deferred completions and centralizing the logic for deciding when to ring the doorbell. The NO_CMPL bit is now cleared in bnxt_txr_db_kick(), so every doorbell site is covered, including the SW USO early exit. This guarantees the ring always ends in a BD which generates a completion to clean it and wake the queue.
{
"affected": [],
"aliases": [
"CVE-2026-97569"
],
"database_specific": {
"cwe_ids": [],
"github_reviewed": false,
"github_reviewed_at": null,
"nvd_published_at": "2026-09-25T11:17:07Z",
"severity": null
},
"details": "In the Linux kernel, the following vulnerability has been resolved:\n\nbnxt_en: Prevent queue stop with deferred completions\n\nWhen the driver receives a burst of packets, it can mark a BD with the\nNO_CMPL bit to defer completions. The expectation is that the last\npacket in the ring will have this bit unset and the completion generated\nby that packet will cleanup that packet and the ones preceding it. This\nhelps to reduce the number of completions fired.\n\nThe suppressed completions are controlled by the driver and the number\nof packets with suppressed completions scales with the size of the ring.\nSW USO packets, on the other hand, have an upper bound on the maximum\nnumber of BDs which can be consumed which does not scale with the ring\nsize.\n\nSo, for small rings it is possible that: a burst of packets is handed to\nthe driver, the driver defers completions for all of the packets because\nthe number of free descriptors stays above the threshold in the driver.\nThen, a USO packet arrives, but the number of BDs available is not\nenough and the USO code exits early.\n\nIn this case, you end up in a state where the ring is full of packets\nwith their completions suppressed, which can cause the queue to stop and\nnever be restarted.\n\nAssuming default CONFIG_MAX_SKB_FRAGS, this is only possible for small\nrings (\u003c= 457 descriptors, below the driver default value) when\na burst of packets fills the ring, followed by a large USO packet that\ncan\u0027t fit. For larger rings, the delta between the completion\nsuppression threshold and the BDs required for SW USO is large enough\nthat completions will fire and this case is unreachable.\n\nThis issue was pointed out by Sashiko and while it seems fairly unlikely\ngiven that the queue size must be small to trigger this, it is indeed\npossible.\n\nFix this by tracking the last BD which deferred completions and\ncentralizing the logic for deciding when to ring the doorbell. The NO_CMPL\nbit is now cleared in bnxt_txr_db_kick(), so every doorbell site is\ncovered, including the SW USO early exit. This guarantees the ring always\nends in a BD which generates a completion to clean it and wake the queue.",
"id": "GHSA-8qg4-f3vx-ghvf",
"modified": "2026-09-25T12:31:24Z",
"published": "2026-09-25T12:31:24Z",
"references": [
{
"type": "ADVISORY",
"url": "https://nvd.nist.gov/vuln/detail/CVE-2026-97569"
},
{
"type": "WEB",
"url": "https://git.kernel.org/stable/c/39b23c1c40e1f73d2b94a09282cc476af647e438"
},
{
"type": "WEB",
"url": "https://git.kernel.org/stable/c/e33ce547c0cd40738d6bad23e5fc0539ee3e8f7d"
}
],
"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.