CVE-2022-49236: bpf: Fix UAF due to race between btf_try_get_module and load_module
In the Linux kernel, the following vulnerability has been resolved:
bpf: Fix UAF due to race between btf_try_get_module and load_module
While working on code to populate kfunc BTF ID sets for module BTF from
its initcall, I noticed that by the time the initcall is invoked, the
module BTF can already be seen by userspace (and the BPF verifier). The
existing btf_try_get_module calls try_module_get which only fails if
mod->state == MODULE_STATE_GOING, i.e. it can increment module reference
when module initcall is happening in parallel.
Currently, BTF parsing happens from MODULE_STATE_COMING notifier
callback. At this point, the module initcalls have not been invoked.
The notifier callback parses and prepares the module BTF, allocates an
ID, which publishes it to userspace, and then adds it to the btf_modules
list allowing the kernel to invoke btf_try_get_module for the BTF.
However, at this point, the module has not been fully initialized (i.e.
its initcalls have not finished). The code in module.c can still fail
and free the module, without caring for other users. However, nothing
stops btf_try_get_module from succeeding between the state transition
from MODULE_STATE_COMING to MODULE_STATE_LIVE.
This leads to a use-after-free issue when BPF program loads
successfully in the state transition, load_module's do_init_module call
fails and frees the module, and BPF program fd on close calls module_put
for the freed module. Future patch has test case to verify we don't
regress in this area in future.
There are multiple points after prepare_coming_module (in load_module)
where failure can occur and module loading can return error. We
illustrate and test for the race using the last point where it can
practically occur (in module __init function).
An illustration of the race:
CPU 0 CPU 1
load_module
notifier_call(MODULE_STATE_COMING)
btf_parse_module
btf_alloc_id // Published to userspace
list_add(&btf_mod->list, btf_modules)
mod->init(...)
... ^
bpf_check |
check_pseudo_btf_id |
btf_try_get_module |
returns true | ...
... | module __init in progress
return prog_fd | ...
... V
if (ret < 0)
free_module(mod)
...
close(prog_fd)
...
bpf_prog_free_deferred
module_put(used_btf.mod) // use-after-free
We fix this issue by setting a flag BTF_MODULE_F_LIVE, from the notifier
callback when MODULE_STATE_LIVE state is reached for the module, so that
we return NULL from btf_try_get_module for modules that are not fully
formed. Since try_module_get already checks that module is not in
MODULE_STATE_GOING state, and that is the only transition a live module
can make before being removed from btf_modules list, this is enough to
close the race and prevent the bug.
A later selftest patch crafts the race condition artifically to verify
that it has been fixed, and that verifier fails to load program (with
ENXIO).
Lastly, a couple of comments:
1. Even if this race didn't exist, it seems more appropriate to only
access resources (ksyms and kfuncs) of a fully formed module which
has been initialized completely.
2. This patch was born out of need for synchronization against module
initcall for the next patch, so it is needed for correctness even
without the aforementioned race condition. The BTF resources
initialized by module initcall are set up once and then only looked
up, so just waiting until the initcall has finished ensures correct
behavior.
Security readout for executives and security teams
Plain-English summary
This is a Linux kernel memory-safety flaw in BPF/BTF handling. A local authenticated user may trigger a race while a kernel module is loading, causing use-after-free behavior. Because kernel memory corruption can affect confidentiality, integrity, and availability, affected Linux hosts should be prioritized for kernel update validation.
Executive priority
High priority for Linux fleets with multi-user access, container workloads, or untrusted local code. The issue requires local access, so it is usually below remote-code-execution emergencies, but kernel compromise impact justifies prompt patch tracking and deployment.
Technical view
The flaw is a race between btf_try_get_module and load_module. Module BTF can be published before module init completes, allowing BPF verifier references to a module that may later fail initialization and be freed. Closing the BPF program file can then call module_put on freed memory.
Likely exposure
Exposure is most relevant on Linux systems running affected kernel versions where local users or workloads can use BPF features and kernel modules are loaded. Containers may matter if host BPF access is available. The source bundle does not identify affected distributions.
Exploitation context
The CVSS vector is local, low complexity, low privileges, and no user interaction. The bundle marks KEV as false and provides no evidence of active exploitation. Treat it as a serious local privilege and kernel-stability risk, not a confirmed in-the-wild campaign.
Researcher notes
Focus validation on kernel branches carrying BPF module BTF support. The fix gates btf_try_get_module on BTF_MODULE_F_LIVE so only fully initialized modules are referenced. Evidence includes the race description and stable kernel commits, but no distribution matrix or exploit report.
Mitigation direction
Update to a kernel containing the referenced stable fixes.
Check Linux vendor advisories for distribution-specific fixed package versions.
Restrict untrusted local access to BPF where operationally feasible.
Reduce unnecessary kernel module loading on exposed multi-user systems.
Prioritize shared hosts, developer workstations, and container platforms.
Validation and detection
Inventory Linux kernel versions across affected fleets.
Confirm whether vendor kernels include the referenced stable commits.
Review BPF access posture for untrusted users or containers.
Check module-loading paths on multi-tenant systems.
Run vendor-supported regression tests after kernel updates.
Generated from the cited source records. This long-tail analysis has not been individually reviewed by a named human.
Potential ATT&CK relevance
Conservative CVE-to-ATT&CK context
These mappings and lookup hints may be relevant to the vulnerability behavior, CWE, affected product, or exposure path. Glexia-inferred context is not an official MITRE, ATT&CK, CWE, or CVE Program mapping.
ATT&CK lookup starting points
Use these exact CWE pages and searches to review the Glexia ATT&CK library from this CVE's weakness and description context.
cwe · low confidence lookup
CWE-416: Exact CWE lookup
Use the exact CWE identifier as the starting point before reviewing related ATT&CK behavior. Open the exact CWE lookup page first, then review the ATT&CK searches from that MITRE weakness context. This is a Glexia lookup hint, not an official ATT&CK mapping.
These fields come from the CVE record and ADP containers, not from Glexia's Take. They preserve time-varying source decisions such as CISA SSVC, KEV status, CVSS metrics, and provider references.
1CVSS vectors
3Timeline events
1ADP providers
5Source links
SSVC decision data
CISA-ADPCISA Coordinator
Timestamp
Version
2.0.3
Exploitation: noneAutomatable: noTechnical Impact: total
CVSS vector scores
1 official score
We collect every scored CVSS vector available in the official CNA and ADP containers. When more than one version is present, the table keeps the source vectors side by side instead of collapsing them into the highest score.
CWE links open Glexia weakness intelligence pages with official CWE context, developer remediation guidance, and related CVE mappings.
CWE-416 · source CWE mapping
Use After Free
Use After Free represents a recurring weakness pattern that can create exploitable paths when design, validation, or implementation controls are missing.