<?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://vulnerability.circl.lu</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, 29 Sep 2026 07:29:48 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-74576 — mm/slab: prevent unbounded recursion in free path with new kmalloc type</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2026-74576</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;mm/slab: prevent unbounded recursion in free path with new kmalloc type&lt;/p&gt;
&lt;p&gt;Commit 280ea9c3154b (&amp;#34;mm/slab: avoid allocating slabobj_ext array from
its own slab&amp;#34;) avoided recursive allocation of obj_exts from kmalloc
caches of the same size, by bumping the obj_exts array&amp;#39;s allocation
size whenever the array size equals the size of the object being
allocated.&lt;/p&gt;
&lt;p&gt;However, as reported by Danielle Costantino and Shakeel Butt,
even slabs from kmalloc caches of different sizes can form a cycle
by allocating obj_exts arrays from each other [1]:&lt;/p&gt;
&lt;p&gt;What happened: a KMALLOC_NORMAL slab&amp;#39;s obj_exts array (used by
  allocation profiling / memcg accounting) is itself kmalloc()&amp;#39;d from a
  KMALLOC_NORMAL cache, so the &amp;#34;slab holds another slab&amp;#39;s obj_exts array&amp;#34;
  relation can form cycles. With sizeof(struct slabobj_ext) == 16 and
  the host&amp;#39;s geometry:&lt;/p&gt;
&lt;p&gt;- kmalloc-512 has 64 objects/slab -&amp;gt; array is 64*16 == 1024 bytes,
    served from kmalloc-1k;
  - kmalloc-1k  has 32 objects/slab -&amp;gt; array is 32*16 ==  512 bytes,
    served from kmalloc-512.&lt;/p&gt;
&lt;p&gt;A kmalloc-512 slab and a kmalloc-1k slab therefore hold each other&amp;#39;s
  obj_exts array.  Discarding one frees the other&amp;#39;s array, which empties
  and discards that slab, which frees the first&amp;#39;s array, and so on:
  __free_slab() -&amp;gt; free_slab_obj_exts() -&amp;gt; kfree() -&amp;gt; discard_slab() -&amp;gt;
  __free_slab() recurses along the cycle until the stack is exhausted.&lt;/p&gt;
&lt;p&gt;With memory allocation profiling,…&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;mm/slab: prevent unbounded recursion in free path with new kmalloc type&lt;/p&gt;
&lt;p&gt;Commit 280ea9c3154b (&amp;#34;mm/slab: avoid allocating slabobj_ext array from
its own slab&amp;#34;) avoided recursive allocation of obj_exts from kmalloc
caches of the same size, by bumping the obj_exts array&amp;#39;s allocation
size whenever the array size equals the size of the object being
allocated.&lt;/p&gt;
&lt;p&gt;However, as reported by Danielle Costantino and Shakeel Butt,
even slabs from kmalloc caches of different sizes can form a cycle
by allocating obj_exts arrays from each other [1]:&lt;/p&gt;
&lt;p&gt;What happened: a KMALLOC_NORMAL slab&amp;#39;s obj_exts array (used by
  allocation profiling / memcg accounting) is itself kmalloc()&amp;#39;d from a
  KMALLOC_NORMAL cache, so the &amp;#34;slab holds another slab&amp;#39;s obj_exts array&amp;#34;
  relation can form cycles. With sizeof(struct slabobj_ext) == 16 and
  the host&amp;#39;s geometry:&lt;/p&gt;
&lt;p&gt;- kmalloc-512 has 64 objects/slab -&amp;gt; array is 64*16 == 1024 bytes,
    served from kmalloc-1k;
  - kmalloc-1k  has 32 objects/slab -&amp;gt; array is 32*16 ==  512 bytes,
    served from kmalloc-512.&lt;/p&gt;
&lt;p&gt;A kmalloc-512 slab and a kmalloc-1k slab therefore hold each other&amp;#39;s
  obj_exts array.  Discarding one frees the other&amp;#39;s array, which empties
  and discards that slab, which frees the first&amp;#39;s array, and so on:
  __free_slab() -&amp;gt; free_slab_obj_exts() -&amp;gt; kfree() -&amp;gt; discard_slab() -&amp;gt;
  __free_slab() recurses along the cycle until the stack is exhausted.&lt;/p&gt;
&lt;p&gt;With memory allocation profiling,…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2026-74576</guid>
    </item>
  </channel>
</rss>
