BlackTreeIndependent security intelligence
← Back to the CVE catalogue
Full vulnerability report · 2026
CVE-2026-74686High confidence

rqspinlock: Reset tail when preserving queue on deadlock

Linux · Linux

…UnscoredAssess manually
Recommended action
Needs assessment

No CVSS base score is available from the CNA, CISA ADP or NIST. Absence of a score is not evidence of low risk; review the vendor advisory, affected exposure and exploit evidence.

Patch available
Distribution package intelligence

Ubuntu vendor package status

Canonical’s release and source-package findings are shown separately from local repository availability.

13 package states
Repository candidate not checked

A published vendor fix does not prove that a matching update is enabled and installable on a particular asset. Confirm the local package candidate before scheduling remediation.

Ubuntu releaseSource packageVendor stateFixed versionEvidence
Ubuntu 24.04 LTSnoble · standard archivelinux-aws-6.14Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-azure-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-azure-fde-6.14Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-azure-nvidia-6.14Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-gcp-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-hwe-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-lowlatency-hwe-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-nvidia-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-oem-6.11Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-oracle-6.14Affected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-raspi-realtimeAffected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-realtimeAffected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Ubuntu 24.04 LTSnoble · standard archivelinux-riscvAffected, no fix publishedCanonical OVAL identifies this running kernel flavour as affected and does not publish a fixed package version in this definition.Not published in this feedCanonical record ↗Source updated 8 Sept 2026
Direct vendor intelligence

Authoritative vendor CSAF and VEX advisories

Structured product status and remediation from the issuing vendor. Product-state explanations are always visible; large lists can be searched or downloaded.

1 current
CVE-2026-74686 · CSAF 2.0 · revision 3 · finalRed Hat Product Securitykernel: rqspinlock: Reset tail when preserving queue on deadlock
76 known affected

The vendor explicitly identifies these products as affected by this CVE.

  • kernel as a component of Red Hat Enterprise Linux 10
  • kernel-64k as a component of Red Hat Enterprise Linux 10
  • kernel-64k-core as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-core as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-devel as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-devel-matched as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-modules as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-modules-core as a component of Red Hat Enterprise Linux 10
  • kernel-64k-debug-modules-extra as a component of Red Hat Enterprise Linux 10
  • kernel-64k-devel as a component of Red Hat Enterprise Linux 10
  • kernel-64k-devel-matched as a component of Red Hat Enterprise Linux 10
Summary
A flaw was found in the Linux kernel's `rqspinlock` component. During deadlock detection, the system may not correctly reset the tail of the waiter queue. This improper handling can cause the system to wait indefinitely for a subsequent waiter that never arrives, leading to an indefinite stall and a denial of service (DoS).
Remediation
Fix deferred
Optional official sources

National CERT insights
?CERT means Computer Emergency Response Team; CSIRT is the closely related term Computer Security Incident Response Team.

Select the national-authority views to include. The exact source language is shown on each matched advisory. Your choice is remembered on this device and encoded in the shareable URL.

Official European source

ENISA European Vulnerability Database

Official EUVD identifiers, advisory evidence and known-exploited context. Missing fields are not treated as evidence of low risk.

1 current
ENISA EUVD identifier

EUVD-2026-64373

No EUVD known-exploited evidence

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

EUVD state
Present in the current official mapping
Known exploitation
Not present in the current ENISA EUVD known-exploited dataset. This is not proof of no exploitation.
ENISA score
0.0
Advisory evidence
No linked advisory details stored yet
Recommended actionNeeds assessment

No CVSS base score is available from the CNA, CISA ADP or NIST. Absence of a score is not evidence of low risk; review the vendor advisory, affected exposure and exploit evidence.

Patch available
01

What, why and how

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

What

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

Why

The current structured CVE record identifies a security weakness, but the root cause requires confirmation in the linked vendor material.

How

An attacker operating through the affected interface may attempt exploitation when the stated preconditions are met. If successful, the issue may cause the confidentiality, integrity or availability impact described by the vendor.

What

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

Why

The current structured CVE record identifies a security weakness, but the root cause requires confirmation in the linked vendor material.

How

An attacker operating through the affected interface may attempt exploitation when the stated preconditions are met. If successful, the issue may cause the confidentiality, integrity or availability impact described by the vendor.

02

Exploit reality and attack path

CVSS severity, EPSS forecast probability, public exploit material and CISA-confirmed exploitation are separate signals.

Observed exploitation
?Confirmed exploitation and public exploit material are separate signals. Attacks can occur without public proof-of-concept or exploit code.
No confirmed evidence

No CISA KEV match was present at the last successful refresh. This means no confirmation from that source, not proof of no exploitation.

Public PoC / exploit material
?Confirmed exploitation and public exploit material are separate signals. Attacks can occur without public proof-of-concept or exploit code.
None recorded

No exploit-tagged reference or CISA SSVC proof-of-concept state is currently recorded. Research may still exist outside the structured feeds.

Likely attack path
the affected interface → vulnerable operation → cause the confidentiality, integrity or availability impact described by the vendor
Attack surface
Unspecified
Privileges required
Not stated in the selected CVSS metric
User interaction
Not stated in the selected CVSS metric
Attack complexity
Not stated in the selected CVSS metric
Security boundary
Not stated in the selected CVSS metric
Weakness
?CWE means Common Weakness Enumeration.
CWE not yet assigned
CVSS vector
?CVSS means Common Vulnerability Scoring System. The vector records the metric values used to calculate technical severity.
Not available from the selected scoring authority.
Post-exploitation / living off the land
No specific living-off-the-land technique is confirmed in the structured sources. Monitor normal administration tools for activity inconsistent with the affected service's baseline.
A

Official authority intelligence

Only matched European and national findings are included. Language selectors and unavailable sources are omitted.

ENISA EUVD · EUVD-2026-64373Official EUVD mapping

In the Linux kernel, the following vulnerability has been resolved: rqspinlock: Reset tail when preserving queue on deadlock Currently, the destruction of the waiter queue is suppressed for rqspinlock in cases where a deadlock is detected. Deadlock checks happen relatively frequently (on entry for AA, within 1ms for ABBA), and waiter threads may not be involved in locking scenarios involving deadlocks. Thus, it is useful to not flush the queue and let other waiters take a stab at acquiring the lock after we detect a deadlock and exit. However, we need to follow the same logic as what we did previously for the waitq_timeout label: reset the tail, and if we cannot, signal the next waiter appropriately. In case of deadlocks, this signal would just mark the MCS node as unlocked, and in case of timeouts, it would signal RES_TIMEOUT_VAL. The difference thus is in the value propagated, which decides whether the queue remains active or gets flushed. Not doing the tail reset, and waiting for the next waiter can lead to cases where we are the final waiter, and thus no next waiter arrives, leading to intermittent stalls in this path. Once the next waiter does join, we will be unblocked. In the theoretical case when the next waiter never joins, we risk stalling indefinitely. This can only happen for ABBA deadlocks, since entry into the wait queue is guarded with AA checks. A precise sequence of executions leading up to this scenario can be: CPU 0 holds lock A. CPU 1 holds lock B. CPU 2 attempts lock B, becomes the pending waiter for B. CPU 0 attempts lock B. B has locked+pending bits set, thus CPU 0 queues. CPU 1 attempts lock A. CPU 0 detects an ABBA deadlock. Once deadlock detection happens for CPU 0, it will sit waiting for the next waiter in the queue to populate node->next, which will experience delays until such a waiter arrives. Fix this by adjusting the logic for the check for deadlocks preceding the waitq_timeout label. It would make sense to consolidate code for both cases and use 'ret' to distinguish the value being propagated, but that is left as an exercise for a future refactoring task to avoid diff noise in this patch.

Official EUVD record
BSI · German · WID-SEC-W-2026-2970Linux Kernel: Mehrere Schwachstellen ermöglichen nicht spezifizierten Angriff

Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, möglicherweise Sicherheitsmaßnahmen zu umgehen, einen Denial-of-Service-Zustand herbeizuführen oder vertrauliche Informationen offenzulegen.

Official advisory
03

Patch and workaround

Operational remediation based on structured source evidence.

Status
?Patch availability is based on structured fixed-version fields and authoritative update references. If no fix is verified, check the vendor advisory before making a change.
Patch available
Affected
kernel as a component of Red Hat Enterprise Linux 10; kernel-64k as a component of Red Hat Enterprise Linux 10; kernel-64k-core as a component of Red Hat Enterprise Linux 10; kernel-64k-debug as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-core as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-devel as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-devel-matched as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-modules as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-modules-core as a component of Red Hat Enterprise Linux 10; kernel-64k-debug-modules-extra as a component of Red Hat Enterprise Linux 10; kernel-64k-devel as a component of Red Hat Enterprise Linux 10; kernel-64k-devel-matched as a component of Red Hat Enterprise Linux 10; kernel-64k-modules as a component of Red Hat Enterprise Linux 10; kernel-64k-modules-core as a component of Red Hat Enterprise Linux 10; kernel-64k-modules-extra as a component of Red Hat Enterprise Linux 10; kernel-abi-stablelists as a component of Red Hat Enterprise Linux 10; kernel-core as a component of Red Hat Enterprise Linux 10; kernel-debug as a component of Red Hat Enterprise Linux 10; kernel-debug-core as a component of Red Hat Enterprise Linux 10; kernel-debug-devel as a component of Red Hat Enterprise Linux 10; kernel-debug-devel-matched as a component of Red Hat Enterprise Linux 10; kernel-debug-modules as a component of Red Hat Enterprise Linux 10; kernel-debug-modules-core as a component of Red Hat Enterprise Linux 10; kernel-debug-modules-extra as a component of Red Hat Enterprise Linux 10; kernel-debug-uki-virt as a component of Red Hat Enterprise Linux 10; kernel-devel as a component of Red Hat Enterprise Linux 10; kernel-devel-matched as a component of Red Hat Enterprise Linux 10; kernel-doc as a component of Red Hat Enterprise Linux 10; kernel-modules as a component of Red Hat Enterprise Linux 10; kernel-modules-core as a component of Red Hat Enterprise Linux 10; and 46 more
Fixed
< 6.19; 7.1.9 ≤ 7.1.*; 7.2 ≤ *
Action
Review the linked authoritative reference and apply the recorded fixed release appropriate to the affected product branch.
Workaround
No verified workaround is recorded. Limit untrusted access and use least privilege until authoritative guidance is available.
04

Evidence and provenance

Published 22 Aug 2026 · Last source change 22 Aug 2026, 15:32 UTC · CWE not yet assigned

CVE recordCVE.org · 5.2
CVSS sourceUnavailable
EPSS source
?The date BlackTree first stored a score for this CVE from the daily FIRST EPSS feed.
FIRST · tracked since 2026-08-23
European sourceENISA EUVD · EUVD-2026-64373
Product sourceVendor CSAF · Red Hat Product Security
Remediation sourceVendor CSAF · Red Hat Product Security
CWE sourceUnavailable
NVD statusNVD received

Missing structured fields: CVSS base score, CWE classification. Missing data is not evidence of low risk; review the primary advisory.

Material change intelligence

What changed after publication

View recent updates →
  1. ENISA EUVD mappingEUVD-2026-64373 was added to the official ENISA EUVD mapping for this CVE.
    Before
    not recorded
    After
    {"euvdId":"EUVD-2026-64373"}
    ENISA EUVD ↗
  2. Catalogue recordCVE added to the BlackTree catalogue.
    CNA ↗
Material fields only · duplicate refreshes suppressed · history retained for the configured operational retention period
CVE published
Fixed release or patch reference recorded
ENISA EUVD · EUVD-2026-64373↗Vendor CSAF · Red Hat Product Security↗CVE authority or vendor reference↗Official CVE record (CNA and ADP data)↗NVD record↗
Technical terms and abbreviations used in this report
CVE
Common Vulnerabilities and Exposures: the public identifier for one disclosed vulnerability.
CVSS
Common Vulnerability Scoring System: a technical severity framework; it is not patching priority by itself.
EPSS
Exploit Prediction Scoring System: FIRST's estimate of the probability that exploitation activity will be observed in the next 30 days; it is a forecast, not confirmation.
CWE
Common Weakness Enumeration: the standard category describing the underlying software or hardware weakness.
CNA
CVE Numbering Authority: an organisation authorised to assign and publish CVE records.
CISA ADP
Cybersecurity and Infrastructure Security Agency Authorized Data Publisher: structured enrichment added to a CVE record.
NVD
National Vulnerability Database: NIST's enrichment service for CVE records.
CERT / CSIRT
A computer security incident response team that publishes warnings or coordinates incident response.
PoC
Proof of concept: public material that demonstrates or helps reproduce exploitation.
CSAF
Common Security Advisory Framework: a machine-readable format for security advisories.
LoTL
Living off the land: abuse of legitimate tools or system functions during an attack.
Free version - for non-commercial use only.CVE-2026-74686 · cve.blacktree.nl