bcache: fix variable length array abuse in btree_iter
Linux
Affected versions
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
Linux
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
≥ cafe563591446cf80bfbc2fe3bc72a2e36cf1060 · < 3a861560ccb35f2a4f0a4b8207fa7c2a35fc7f31| No fix yet |
| Linux Linux |
|
|
In the Linux kernel, the following vulnerability has been resolved:
bcache: fix variable length array abuse in btree_iter
btree_iter is used in two ways: either allocated on the stack with a fixed size MAX_BSETS, or from a mempool with a dynamic size based on the specific cache set. Previously, the struct had a fixed-length array of size MAX_BSETS which was indexed out-of-bounds for the dynamically-sized iterators, which causes UBSAN to complain.
This patch uses the same approach as in bcachefs's sort_iter and splits the iterator into a btree_iter with a flexible array member and a btree_iter_stack which embeds a btree_iter as well as a fixed-length data array.
From the CVE record · Linux
The Linux kernel’s bcache btree_iter can index beyond a fixed-length array when the iterator is dynamically allocated from a mempool. The input does not specify what an attacker could do or whether exploitation requires local or network access, authentication, or user interaction.
Teams running Linux kernels with bcache should check their installations; affected versions are not specified.