CVE-2025-38377 Affecting kernel-uek64k package, versions <0:6.12.0-103.40.4.1.el9uek


Severity

Recommended
high

Based on Oracle Linux security rating.

Threat Intelligence

EPSS
0.04% (9th percentile)

Do your applications use this vulnerable package?

In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.

Test your applications
  • Snyk IDSNYK-ORACLE9-KERNELUEK64K-12562512
  • published9 Sept 2025
  • disclosed25 Jul 2025

Introduced: 25 Jul 2025

CVE-2025-38377  (opens in a new tab)

How to fix?

Upgrade Oracle:9 kernel-uek64k to version 0:6.12.0-103.40.4.1.el9uek or higher.
This issue was patched in ELSA-2025-20551.

NVD Description

Note: Versions mentioned in the description apply only to the upstream kernel-uek64k package and not the kernel-uek64k package as distributed by Oracle. See How to fix? for Oracle:9 relevant fixed versions and status.

In the Linux kernel, the following vulnerability has been resolved:

rose: fix dangling neighbour pointers in rose_rt_device_down()

There are two bugs in rose_rt_device_down() that can cause use-after-free:

  1. The loop bound t-&gt;count is modified within the loop, which can cause the loop to terminate early and miss some entries.

  2. When removing an entry from the neighbour array, the subsequent entries are moved up to fill the gap, but the loop index i is still incremented, causing the next entry to be skipped.

For example, if a node has three neighbours (A, A, B) with count=3 and A is being removed, the second A is not checked.

i=0: (A, A, B) -&gt; (A, B) with count=2
      ^ checked
i=1: (A, B)    -&gt; (A, B) with count=2
         ^ checked (B, not A!)
i=2: (doesn&#39;t occur because i &lt; count is false)

This leaves the second A in the array with count=2, but the rose_neigh structure has been freed. Code that accesses these entries assumes that the first count entries are valid pointers, causing a use-after-free when it accesses the dangling pointer.

Fix both issues by iterating over the array in reverse order with a fixed loop bound. This ensures that all entries are examined and that the removal of an entry doesn't affect subsequent iterations.

CVSS Base Scores

version 3.1