<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/" version="2.0">
  <channel>
    <title>Most recent entries from all</title>
    <link>https://db.gcve.eu</link>
    <description>Contains only the most 10 recent entries.</description>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <generator>python-feedgen</generator>
    <language>en</language>
    <lastBuildDate>Thu, 12 Nov 2026 16:02:49 +0000</lastBuildDate>
    <item>
      <title>fkie_cve-2026-99229</title>
      <link>https://db.gcve.eu/vuln/fkie_cve-2026-99229</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;io_uring/wait: don&amp;#39;t spin on a stuck overflow list&lt;/p&gt;
&lt;p&gt;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&amp;#39;t empty the
list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed.&lt;/p&gt;
&lt;p&gt;The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;t be flushed, the
ring is full, and min_events is capped to the size of the ring. But:&lt;/p&gt;
&lt;p&gt;- 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().&lt;/p&gt;
&lt;p&gt;- 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&amp;#39;t be stopped any more, not even by
  SIGKILL.&lt;/p&gt;
&lt;p&gt;Only the application can make room in the CQ ring. Return to it if the
list could not be flushed.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;io_uring/wait: don&amp;#39;t spin on a stuck overflow list&lt;/p&gt;
&lt;p&gt;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&amp;#39;t empty the
list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed.&lt;/p&gt;
&lt;p&gt;The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;t be flushed, the
ring is full, and min_events is capped to the size of the ring. But:&lt;/p&gt;
&lt;p&gt;- 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().&lt;/p&gt;
&lt;p&gt;- 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&amp;#39;t be stopped any more, not even by
  SIGKILL.&lt;/p&gt;
&lt;p&gt;Only the application can make room in the CQ ring. Return to it if the
list could not be flushed.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/fkie_cve-2026-99229</guid>
    </item>
    <item>
      <title>GHSA-v4v7-2v4c-64vj</title>
      <link>https://db.gcve.eu/vuln/ghsa-v4v7-2v4c-64vj</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;io_uring/wait: don&amp;#39;t spin on a stuck overflow list&lt;/p&gt;
&lt;p&gt;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&amp;#39;t empty the
list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed.&lt;/p&gt;
&lt;p&gt;The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;t be flushed, the
ring is full, and min_events is capped to the size of the ring. But:&lt;/p&gt;
&lt;p&gt;- 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().&lt;/p&gt;
&lt;p&gt;- 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&amp;#39;t be stopped any more, not even by
  SIGKILL.&lt;/p&gt;
&lt;p&gt;Only the application can make room in the CQ ring. Return to it if the
list could not be flushed.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;io_uring/wait: don&amp;#39;t spin on a stuck overflow list&lt;/p&gt;
&lt;p&gt;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&amp;#39;t empty the
list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed.&lt;/p&gt;
&lt;p&gt;The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;t be flushed, the
ring is full, and min_events is capped to the size of the ring. But:&lt;/p&gt;
&lt;p&gt;- 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().&lt;/p&gt;
&lt;p&gt;- 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&amp;#39;t be stopped any more, not even by
  SIGKILL.&lt;/p&gt;
&lt;p&gt;Only the application can make room in the CQ ring. Return to it if the
list could not be flushed.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/ghsa-v4v7-2v4c-64vj</guid>
    </item>
    <item>
      <title>msrc_CVE-2026-99229 — io_uring/wait: don't spin on a stuck overflow list</title>
      <link>https://db.gcve.eu/vuln/msrc_cve-2026-99229</link>
      <description>msrc_CVE-2026-99229</description>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/msrc_cve-2026-99229</guid>
    </item>
    <item>
      <title>openSUSE-SU-2026:12497-1 — kernel-devel-7.3.3-1.1 on GA media</title>
      <link>https://db.gcve.eu/vuln/opensuse-su-2026:12497-1</link>
      <description>&lt;p&gt;kernel-devel-7.3.3-1.1 on GA media&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;kernel-devel-7.3.3-1.1 on GA media&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/opensuse-su-2026:12497-1</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2026-99229</title>
      <link>https://db.gcve.eu/vuln/ubuntu-cve-2026-99229</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 165 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: io_uring/wait: don&amp;#39;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&amp;#39;t empty the list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed. The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;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&amp;#39;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.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 165 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: io_uring/wait: don&amp;#39;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&amp;#39;t empty the list, and the CQ ring doesn&amp;#39;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&amp;#39;t be killed. The assumption is that this can&amp;#39;t happen: if CQEs can&amp;#39;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&amp;#39;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.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/ubuntu-cve-2026-99229</guid>
    </item>
    <item>
      <title>WID-SEC-W-2026-4302 — Linux Kernel: Mehrere Schwachstellen ermöglichen nicht spezifizierten Angriff</title>
      <link>https://db.gcve.eu/vuln/wid-sec-w-2026-4302</link>
      <description>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, darunter möglicherweise die Auslösung eines Denial-of-Service-Angriffs, die Manipulation oder Offenlegung von Daten, die Ausführung von beliebigem Code, die Erlangung erweiterter Berechtigungen oder die Umgehung von Sicherheitsmaßnahmen.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, darunter möglicherweise die Auslösung eines Denial-of-Service-Angriffs, die Manipulation oder Offenlegung von Daten, die Ausführung von beliebigem Code, die Erlangung erweiterter Berechtigungen oder die Umgehung von Sicherheitsmaßnahmen.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/wid-sec-w-2026-4302</guid>
    </item>
  </channel>
</rss>
