GHSA-V4V7-2V4C-64VJ

Vulnerability from github – Published: 2026-11-02 18:32 – Updated: 2026-11-06 18:35
VLAI
Details

In the Linux kernel, the following vulnerability has been resolved:

io_uring/wait: don't spin on a stuck overflow list

As long as IO_CHECK_CQ_OVERFLOW_BIT is set, io_cqring_wait_schedule() returns right away, before it gets to look at signals or arms the timeout, for io_cqring_wait() to flush the overflow list. If that doesn't empty the list, and the CQ ring doesn't hold the number of events the caller wants, the loop starts over, with the same result. The task spins in the kernel, and can't be killed.

The assumption is that this can't happen: if CQEs can't be flushed, the ring is full, and min_events is capped to the size of the ring. But:

  • With IORING_SETUP_CQE_MIXED a 32b CQE needs two contiguous entries. It is stuck on the list if a single one is free, and then the ring holds less than cq_entries events. A single threaded application that asks for as many events as the ring has entries never gets out of io_uring_enter().

  • Whether the ring is full is up to the CQ head, which the application can write to. While one thread waits for events on an empty ring, another one can move the head back so that the ring looks full and have a CQE overflow. The waiter can't be stopped any more, not even by SIGKILL.

Only the application can make room in the CQ ring. Return to it if the list could not be flushed.

Show details on source website

{
  "affected": [],
  "aliases": [
    "CVE-2026-99229"
  ],
  "database_specific": {
    "cwe_ids": [],
    "github_reviewed": false,
    "github_reviewed_at": null,
    "nvd_published_at": "2026-11-02T16:17:47Z",
    "severity": null
  },
  "details": "In the Linux kernel, the following vulnerability has been resolved:\n\nio_uring/wait: don\u0027t spin on a stuck overflow list\n\nAs long as IO_CHECK_CQ_OVERFLOW_BIT is set, io_cqring_wait_schedule()\nreturns right away, before it gets to look at signals or arms the timeout,\nfor io_cqring_wait() to flush the overflow list. If that doesn\u0027t empty the\nlist, and the CQ ring doesn\u0027t hold the number of events the caller wants,\nthe loop starts over, with the same result. The task spins in the kernel,\nand can\u0027t be killed.\n\nThe assumption is that this can\u0027t happen: if CQEs can\u0027t be flushed, the\nring is full, and min_events is capped to the size of the ring. But:\n\n- With IORING_SETUP_CQE_MIXED a 32b CQE needs two contiguous entries. It\n  is stuck on the list if a single one is free, and then the ring holds\n  less than cq_entries events. A single threaded application that asks\n  for as many events as the ring has entries never gets out of\n  io_uring_enter().\n\n- Whether the ring is full is up to the CQ head, which the application\n  can write to. While one thread waits for events on an empty ring,\n  another one can move the head back so that the ring looks full and\n  have a CQE overflow. The waiter can\u0027t be stopped any more, not even by\n  SIGKILL.\n\nOnly the application can make room in the CQ ring. Return to it if the\nlist could not be flushed.",
  "id": "GHSA-v4v7-2v4c-64vj",
  "modified": "2026-11-06T18:35:04Z",
  "published": "2026-11-02T18:32:27Z",
  "references": [
    {
      "type": "ADVISORY",
      "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-99229"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/340944e27b4bb218ed0ee66d0947ac70faefa05a"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/34f5a664c34d3cb62f6bec7f4156754594a7d25b"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/4a89352edd8b3e20d1e1fb33f0fc297dd137149f"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/a6cfc85c6bf9498aaf1978b503f9663635a1aa22"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/bf1d2ed84b3162e3b0e0bb7018ac59147da6e975"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/c347691e5dc5481b2d6943c123619e04847fb0dc"
    }
  ],
  "schema_version": "1.4.0",
  "severity": []
}



Log in or create an account to share your comment.




Tags
Taxonomy of the tags.


Loading…

Loading…

Loading…

Forecast uses a logistic model when the trend is rising, or an exponential decay model when the trend is falling. Fitted via linearized least squares.

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.

Loading…

Loading…

Loading…

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.


Loading…