<?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 01:09:43 +0000</lastBuildDate>
    <item>
      <title>CVE-2025-68358 — btrfs: fix racy bitfield write in btrfs_clear_space_info_full()</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2025-68358</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;btrfs: fix racy bitfield write in btrfs_clear_space_info_full()&lt;/p&gt;
&lt;p&gt;From the memory-barriers.txt document regarding memory barrier ordering
guarantees:&lt;/p&gt;
&lt;p&gt;(*) These guarantees do not apply to bitfields, because compilers often
     generate code to modify these using non-atomic read-modify-write
     sequences.  Do not attempt to use bitfields to synchronize parallel
     algorithms.&lt;/p&gt;
&lt;p&gt;(*) Even in cases where bitfields are protected by locks, all fields
     in a given bitfield must be protected by one lock.  If two fields
     in a given bitfield are protected by different locks, the compiler&amp;#39;s
     non-atomic read-modify-write sequences can cause an update to one
     field to corrupt the value of an adjacent field.&lt;/p&gt;
&lt;p&gt;btrfs_space_info has a bitfield sharing an underlying word consisting of
the fields full, chunk_alloc, and flush:&lt;/p&gt;
&lt;p&gt;struct btrfs_space_info {
        struct btrfs_fs_info *     fs_info;              /*     0     8 */
        struct btrfs_space_info *  parent;               /*     8     8 */
        ...
        int                        clamp;                /*   172     4 */
        unsigned int               full:1;               /*   176: 0  4 */
        unsigned int               chunk_alloc:1;        /*   176: 1  4 */
        unsigned int               flush:1;              /*   176: 2  4 */
        ...&lt;/p&gt;
&lt;p&gt;Therefore, to be safe from parallel read-modify-writes losing a write to
one of the bitfi…&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;btrfs: fix racy bitfield write in btrfs_clear_space_info_full()&lt;/p&gt;
&lt;p&gt;From the memory-barriers.txt document regarding memory barrier ordering
guarantees:&lt;/p&gt;
&lt;p&gt;(*) These guarantees do not apply to bitfields, because compilers often
     generate code to modify these using non-atomic read-modify-write
     sequences.  Do not attempt to use bitfields to synchronize parallel
     algorithms.&lt;/p&gt;
&lt;p&gt;(*) Even in cases where bitfields are protected by locks, all fields
     in a given bitfield must be protected by one lock.  If two fields
     in a given bitfield are protected by different locks, the compiler&amp;#39;s
     non-atomic read-modify-write sequences can cause an update to one
     field to corrupt the value of an adjacent field.&lt;/p&gt;
&lt;p&gt;btrfs_space_info has a bitfield sharing an underlying word consisting of
the fields full, chunk_alloc, and flush:&lt;/p&gt;
&lt;p&gt;struct btrfs_space_info {
        struct btrfs_fs_info *     fs_info;              /*     0     8 */
        struct btrfs_space_info *  parent;               /*     8     8 */
        ...
        int                        clamp;                /*   172     4 */
        unsigned int               full:1;               /*   176: 0  4 */
        unsigned int               chunk_alloc:1;        /*   176: 1  4 */
        unsigned int               flush:1;              /*   176: 2  4 */
        ...&lt;/p&gt;
&lt;p&gt;Therefore, to be safe from parallel read-modify-writes losing a write to
one of the bitfi…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2025-68358</guid>
    </item>
  </channel>
</rss>
