Linux Kernel BPF Invalid Wait Context Vulnerability in SK Storage

Vulnerability

A vulnerability in the Linux kernel's BPF (Berkeley Packet Filter) implementation has been addressed. The issue involved an invalid wait context reported by the lock dependency checker, which indicated that a local lock was being acquired while holding a raw spin lock. This situation could potentially lead to unsafe memory allocation in real-time contexts. The vulnerability was identified during a test program that simulated local storage operations, revealing a conflict between lock management and memory allocation processes.

Impact

The vulnerability could cause improper lock handling, leading to potential memory allocation issues in real-time contexts, which could disrupt normal kernel operations.

Reproduction

The vulnerability can be reproduced by running the Linux kernel BPF test program 'test_progs' with the 'test_local_storage' option. This will trigger the invalid wait context report by the lock dependency checker, highlighting the conflict between local lock and raw spin lock management.

Remediation

Users can upgrade to the latest version of the Linux kernel where this vulnerability has been fixed. The specific commit addressing this issue is '300415caa373a07782fcbc2f8d9429bc2dc27a47', which is available in the Linux kernel stable tree.

Added: Dec 9, 2025, 9:15 PM
Updated: Dec 9, 2025, 9:15 PM

Vulnerability Rating

Custom Algorithm
spread
9.0
impact
2.5
exploitability
4.3
remediation
0.0
relevance
1.4
threat
4.8
urgency
2.9
incentive
1.7

Our algorithm analyzes dozens of metrics to generate these 8 key vulnerability categories, which are then combined to calculate the overall risk score.