<?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 04:49:41 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-89962 — powerpc/kexec_file: Prevent kexec range truncation</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2026-89962</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;powerpc/kexec_file: Prevent kexec range truncation&lt;/p&gt;
&lt;p&gt;Sashiko AI review pointed out the following issue.&lt;/p&gt;
&lt;p&gt;The __merge_memory_ranges() function incorrectly handles overlapping
memory ranges when merging them. Although sort_memory_ranges() sorts all
ranges by their start address in ascending order beforehand, the merge
logic remains defective in two ways:&lt;/p&gt;
&lt;p&gt;1. It compares the current range&amp;#39;s start against the previous element (i-1)
   instead of the running target index (idx)&lt;/p&gt;
&lt;p&gt;2. It unconditionally overwrites &amp;#39;ranges[idx].end&amp;#39; with &amp;#39;ranges[i].end&amp;#39;.&lt;/p&gt;
&lt;p&gt;This logic flaw leads to critical memory truncation when a larger memory
range completely subsumes subsequent smaller ranges.&lt;/p&gt;
&lt;p&gt;For example, consider a sorted input array with three ranges:
  Range A (idx=0): [0x1000 - 0x9000]
  Range B (i=1):   [0x2000 - 0x5000] (completely inside Range A)
  Range C (i=2):   [0x6000 - 0x8000] (completely inside Range A)&lt;/p&gt;
&lt;p&gt;1. When i=1 (Range B):
   ranges[1].start (0x2000) &amp;lt;= ranges[0].end + 1 (0x9001) is TRUE.
   The code executes: ranges[0].end = ranges[1].end, which erroneously
   shrinks Range A&amp;#39;s end from 0x9000 down to 0x5000.&lt;/p&gt;
&lt;p&gt;2. When i=2 (Range C):
   ranges[2].start (0x6000) &amp;lt;= ranges[1].end + 1 (0x5001) is FALSE.
   The code falls into the else block, creating a broken new range.&lt;/p&gt;
&lt;p&gt;As a result, valid memory fragments [0x5001 - 0x5fff] and [0x8001 - 0x9000]
are completely lost from the kexec exclude lists, potentially allowing…&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;powerpc/kexec_file: Prevent kexec range truncation&lt;/p&gt;
&lt;p&gt;Sashiko AI review pointed out the following issue.&lt;/p&gt;
&lt;p&gt;The __merge_memory_ranges() function incorrectly handles overlapping
memory ranges when merging them. Although sort_memory_ranges() sorts all
ranges by their start address in ascending order beforehand, the merge
logic remains defective in two ways:&lt;/p&gt;
&lt;p&gt;1. It compares the current range&amp;#39;s start against the previous element (i-1)
   instead of the running target index (idx)&lt;/p&gt;
&lt;p&gt;2. It unconditionally overwrites &amp;#39;ranges[idx].end&amp;#39; with &amp;#39;ranges[i].end&amp;#39;.&lt;/p&gt;
&lt;p&gt;This logic flaw leads to critical memory truncation when a larger memory
range completely subsumes subsequent smaller ranges.&lt;/p&gt;
&lt;p&gt;For example, consider a sorted input array with three ranges:
  Range A (idx=0): [0x1000 - 0x9000]
  Range B (i=1):   [0x2000 - 0x5000] (completely inside Range A)
  Range C (i=2):   [0x6000 - 0x8000] (completely inside Range A)&lt;/p&gt;
&lt;p&gt;1. When i=1 (Range B):
   ranges[1].start (0x2000) &amp;lt;= ranges[0].end + 1 (0x9001) is TRUE.
   The code executes: ranges[0].end = ranges[1].end, which erroneously
   shrinks Range A&amp;#39;s end from 0x9000 down to 0x5000.&lt;/p&gt;
&lt;p&gt;2. When i=2 (Range C):
   ranges[2].start (0x6000) &amp;lt;= ranges[1].end + 1 (0x5001) is FALSE.
   The code falls into the else block, creating a broken new range.&lt;/p&gt;
&lt;p&gt;As a result, valid memory fragments [0x5001 - 0x5fff] and [0x8001 - 0x9000]
are completely lost from the kexec exclude lists, potentially allowing…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2026-89962</guid>
    </item>
  </channel>
</rss>
