<?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>Sun, 04 Oct 2026 17:16:57 +0000</lastBuildDate>
    <item>
      <title>CVE-2023-53728 — posix-timers: Ensure timer ID search-loop limit is valid</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2023-53728</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;posix-timers: Ensure timer ID search-loop limit is valid&lt;/p&gt;
&lt;p&gt;posix_timer_add() tries to allocate a posix timer ID by starting from the
cached ID which was stored by the last successful allocation.&lt;/p&gt;
&lt;p&gt;This is done in a loop searching the ID space for a free slot one by
one. The loop has to terminate when the search wrapped around to the
starting point.&lt;/p&gt;
&lt;p&gt;But that&amp;#39;s racy vs. establishing the starting point. That is read out
lockless, which leads to the following problem:&lt;/p&gt;
&lt;p&gt;CPU0	  	      	     	   CPU1
posix_timer_add()
  start = sig-&amp;gt;posix_timer_id;
  lock(hash_lock);
  ...				   posix_timer_add()
  if (++sig-&amp;gt;posix_timer_id &amp;lt; 0)
      			             start = sig-&amp;gt;posix_timer_id;
     sig-&amp;gt;posix_timer_id = 0;&lt;/p&gt;
&lt;p&gt;So CPU1 can observe a negative start value, i.e. -1, and the loop break
never happens because the condition can never be true:&lt;/p&gt;
&lt;p&gt;if (sig-&amp;gt;posix_timer_id == start)
     break;&lt;/p&gt;
&lt;p&gt;While this is unlikely to ever turn into an endless loop as the ID space is
huge (INT_MAX), the racy read of the start value caught the attention of
KCSAN and Dmitry unearthed that incorrectness.&lt;/p&gt;
&lt;p&gt;Rewrite it so that all id operations are under the hash 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;posix-timers: Ensure timer ID search-loop limit is valid&lt;/p&gt;
&lt;p&gt;posix_timer_add() tries to allocate a posix timer ID by starting from the
cached ID which was stored by the last successful allocation.&lt;/p&gt;
&lt;p&gt;This is done in a loop searching the ID space for a free slot one by
one. The loop has to terminate when the search wrapped around to the
starting point.&lt;/p&gt;
&lt;p&gt;But that&amp;#39;s racy vs. establishing the starting point. That is read out
lockless, which leads to the following problem:&lt;/p&gt;
&lt;p&gt;CPU0	  	      	     	   CPU1
posix_timer_add()
  start = sig-&amp;gt;posix_timer_id;
  lock(hash_lock);
  ...				   posix_timer_add()
  if (++sig-&amp;gt;posix_timer_id &amp;lt; 0)
      			             start = sig-&amp;gt;posix_timer_id;
     sig-&amp;gt;posix_timer_id = 0;&lt;/p&gt;
&lt;p&gt;So CPU1 can observe a negative start value, i.e. -1, and the loop break
never happens because the condition can never be true:&lt;/p&gt;
&lt;p&gt;if (sig-&amp;gt;posix_timer_id == start)
     break;&lt;/p&gt;
&lt;p&gt;While this is unlikely to ever turn into an endless loop as the ID space is
huge (INT_MAX), the racy read of the start value caught the attention of
KCSAN and Dmitry unearthed that incorrectness.&lt;/p&gt;
&lt;p&gt;Rewrite it so that all id operations are under the hash lock.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2023-53728</guid>
    </item>
  </channel>
</rss>
