bpf: Fix hashtab overflow check on 32-bit arches
Linux
Affected versions
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
Linux
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
≥ daaf427c6ab392bedcd018e326b2ffa1e1110cd6 · < 8435f0961bf3dc65e204094349bd9aeaac1f8868| No fix yet |
| Linux Linux |
|
|
In the Linux kernel, the following vulnerability has been resolved:
bpf: Fix hashtab overflow check on 32-bit arches
The hashtab code relies on roundup_pow_of_two() to compute the number of hash buckets, and contains an overflow check by checking if the resulting value is 0. However, on 32-bit arches, the roundup code itself can overflow by doing a 32-bit left-shift of an unsigned long value, which is undefined behaviour, so it is not guaranteed to truncate neatly. This was triggered by syzbot on the DEVMAP_HASH type, which contains the same check, copied from the hashtab code. So apply the same fix to hashtab, by moving the overflow check to before the roundup.
From the CVE record · Linux
On 32-bit architectures, the Linux kernel’s BPF hashtab code can overflow while calculating the number of hash buckets. A user able to trigger the affected map-sizing operation may cause undefined behavior; the input does not specify authentication requirements or whether user interaction is needed.
Engineers running Linux kernels on 32-bit architectures should check whether their kernel includes the BPF hashtab fix; affected versions were not provided.