GHSA-9PJG-5PPG-4CGH

Vulnerability from github – Published: 2026-11-20 09:31 – Updated: 2026-11-20 09:31
VLAI
Details

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

io_uring/bpf-ops: clear bpf_ctx while submitting SQEs

bpf_io_uring_submit_sqes() calls io_submit_sqes() from inside the loop program, with current->bpf_ctx set, and requests issued inline run with it set too. The socket code uses has_current_bpf_ctx() to recognize calls from bpf_setsockopt() and friends, where the caller holds the socket lock and has already been vetted, and skips both.

So a SOCKET_URING_OP_SETSOCKOPT from the SQ passes sockopt_capable() without the capability, and runs without lock_sock(). A task with no capability can set SO_MARK, IP_TRANSPARENT or TCP_REPAIR, and two threads changing IP_OPTIONS on one socket, one through the ring, double free in no time. SOCK_DESTROY via IORING_OP_SENDMSG ends up in tcp_abort() without the lock the same way.

Clear the run context around io_submit_sqes(). The SQEs come from userspace and must be issued like those of any other ring. They still run inside the program's RCU tasks trace read section, so a request that sleeps there holds up that grace period, but other request types do that already.

Show details on source website

{
  "affected": [],
  "aliases": [
    "CVE-2026-99801"
  ],
  "database_specific": {
    "cwe_ids": [],
    "github_reviewed": false,
    "github_reviewed_at": null,
    "nvd_published_at": "2026-11-20T08:18:37Z",
    "severity": null
  },
  "details": "In the Linux kernel, the following vulnerability has been resolved:\n\nio_uring/bpf-ops: clear bpf_ctx while submitting SQEs\n\nbpf_io_uring_submit_sqes() calls io_submit_sqes() from inside the loop\nprogram, with current-\u003ebpf_ctx set, and requests issued inline run with\nit set too. The socket code uses has_current_bpf_ctx() to recognize\ncalls from bpf_setsockopt() and friends, where the caller holds the\nsocket lock and has already been vetted, and skips both.\n\nSo a SOCKET_URING_OP_SETSOCKOPT from the SQ passes sockopt_capable()\nwithout the capability, and runs without lock_sock(). A task with no\ncapability can set SO_MARK, IP_TRANSPARENT or TCP_REPAIR, and two\nthreads changing IP_OPTIONS on one socket, one through the ring, double\nfree in no time. SOCK_DESTROY via IORING_OP_SENDMSG ends up in\ntcp_abort() without the lock the same way.\n\nClear the run context around io_submit_sqes(). The SQEs come from\nuserspace and must be issued like those of any other ring. They still\nrun inside the program\u0027s RCU tasks trace read section, so a request\nthat sleeps there holds up that grace period, but other request types\ndo that already.",
  "id": "GHSA-9pjg-5ppg-4cgh",
  "modified": "2026-11-20T09:31:34Z",
  "published": "2026-11-20T09:31:34Z",
  "references": [
    {
      "type": "ADVISORY",
      "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-99801"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/521861b17a107875c884df9474e7746617f256d5"
    },
    {
      "type": "WEB",
      "url": "https://git.kernel.org/stable/c/8543a39f03db8816a2d80d0c92c132a19f2afb48"
    }
  ],
  "schema_version": "1.4.0",
  "severity": []
}



Log in or create an account to share your comment.




Tags
Taxonomy of the tags.


Loading…

Loading…

Loading…

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.

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.
Vulnerability timeline

Sightings and recorded dates, grouped by day · UTC

JSON
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.

Events included in the timeline

Loading timeline…


    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.