<?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://cve.radiocsirt.org</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>Tue, 06 Oct 2026 16:33:26 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-53265 — dm cache policy smq: check allocation under invalidate lock</title>
      <link>https://cve.radiocsirt.org/vuln/cve-2026-53265</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;dm cache policy smq: check allocation under invalidate lock&lt;/p&gt;
&lt;p&gt;commit 2d1f7b65f5de (&amp;#34;dm cache policy smq: fix missing locks in
invalidating cache blocks&amp;#34;) added mq-&amp;gt;lock around the destructive part of
smq_invalidate_mapping(), but left the e-&amp;gt;allocated check outside the
critical section.&lt;/p&gt;
&lt;p&gt;That leaves a check-then-act race. Two concurrent invalidators can both
observe e-&amp;gt;allocated as true before either of them takes mq-&amp;gt;lock. The
first invalidator that acquires the lock removes the entry from the
queues and hash table and then calls free_entry(), which clears
e-&amp;gt;allocated and puts the entry back on the free list. The second
invalidator can then acquire mq-&amp;gt;lock and continue with the stale result
of the unlocked check.&lt;/p&gt;
&lt;p&gt;This can corrupt the SMQ queues or hash table by deleting an entry that
is no longer on those structures. It can also hit the allocation check in
free_entry() when the same entry is freed again.&lt;/p&gt;
&lt;p&gt;Move the allocation check under mq-&amp;gt;lock so the predicate and the
destructive operations are serialized by the same lock.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;dm cache policy smq: check allocation under invalidate lock&lt;/p&gt;
&lt;p&gt;commit 2d1f7b65f5de (&amp;#34;dm cache policy smq: fix missing locks in
invalidating cache blocks&amp;#34;) added mq-&amp;gt;lock around the destructive part of
smq_invalidate_mapping(), but left the e-&amp;gt;allocated check outside the
critical section.&lt;/p&gt;
&lt;p&gt;That leaves a check-then-act race. Two concurrent invalidators can both
observe e-&amp;gt;allocated as true before either of them takes mq-&amp;gt;lock. The
first invalidator that acquires the lock removes the entry from the
queues and hash table and then calls free_entry(), which clears
e-&amp;gt;allocated and puts the entry back on the free list. The second
invalidator can then acquire mq-&amp;gt;lock and continue with the stale result
of the unlocked check.&lt;/p&gt;
&lt;p&gt;This can corrupt the SMQ queues or hash table by deleting an entry that
is no longer on those structures. It can also hit the allocation check in
free_entry() when the same entry is freed again.&lt;/p&gt;
&lt;p&gt;Move the allocation check under mq-&amp;gt;lock so the predicate and the
destructive operations are serialized by the same lock.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/cve-2026-53265</guid>
    </item>
  </channel>
</rss>
