bpf: Fix out-of-bounds write in trie_get_next_key()
Linux
Affected versions
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
Linux
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
≥ b471f2f1de8b816f1e799b80aa92588f3566e4bd · < 90a6e0e1e151ef7a9282e78f54c3091de2dcc99c| No fix yet |
| Linux Linux |
|
|
In the Linux kernel, the following vulnerability has been resolved:
bpf: Fix out-of-bounds write in trie_get_next_key()
trie_get_next_key() allocates a node stack with size trie->max_prefixlen, while it writes (trie->max_prefixlen + 1) nodes to the stack when it has full paths from the root to leaves. For example, consider a trie with max_prefixlen is 8, and the nodes with key 0x00/0, 0x00/1, 0x00/2, ... 0x00/8 inserted. Subsequent calls to trie_get_next_key with _key with .prefixlen = 8 make 9 nodes be written on the node stack with size 8.
From the CVE record · Linux
The Linux kernel's BPF trie_get_next_key() allocates a node stack one entry too small for a full path from root to leaf. An attacker who can trigger a next-key lookup on such a path could cause an out-of-bounds write. The input does not specify whether this requires local access, authentication, or user interaction.
Engineers running the Linux kernel should check whether their version is affected; affected versions are not specified.