PT-2026-152602

CVE-2026-99722

·

Published

2026-11-20

·

Updated

2026-11-20

Description by

Score
N/A
Not available

No severity ratings or metrics are available. When they are, we'll update the corresponding info on the page.

In the Linux kernel, the following vulnerability has been resolved:
vringh: bound top-level re-entry into indirect tables
In vringh iov(), the F INDIRECT branch descends into the indirect table and continues before the descriptor accounting runs. A top-level indirect descriptor is therefore never charged to count. If such a descriptor sets NEXT to point back at itself, returning from the indirect table resumes at the same top-level descriptor, which is again not counted, so the walk never makes forward progress.
Because count stays flat and indirect count is reset to 0 on every return to the top-level table, neither bound in the loop check trips. A guest can spin the vringh worker at 100% CPU inside vringh iov(), an uninterruptible host DoS.
Move the descriptor accounting above the indirect switch so that a top-level indirect descriptor is charged one top-level traversal step before the walk descends into its table, bringing this re-entry under the existing vrh->vring.num bound. Each top-level descriptor is still charged at most one step and indirect count still bounds a single table, so legitimate chains (including the multiple-indirect case in tools/virtio/vringh test.c) stay within vring.num, while a cyclic indirect descriptor is now rejected with -ELOOP.
Vendors
Affected products
Related identifiers
Found an issue in the description? Have something to add? Feel free to write us 👾