BPF verifier adopts call graphs, lifts frame limit to 32
Exponential call-chain walks that could take minutes now finish in milliseconds, clearing a path for deeper Rust BPF programs.
By oopsExponential call-chain walks that could take minutes now finish in milliseconds, clearing a path for deeper Rust BPF programs.
By oopsAlexei Starovoitov’s 37-patch series lets the verifier accept more compiler output, including Rust and GCC forms that previously failed.
By oopsScalar evolution had been shrinking a packet pointer's upper bound without cutting the recorded valid length, so counted loops could pass checks for bytes past the end of the packet.
By oopsAlexei Starovoitov posts an 82-patch series that joins verifier states instead of walking every path, so rustc output can load.
By oopsPrograms compiled against kernel type information lack a stable ABI, so systemd joins ZFS and NVIDIA in linuxPackages.
By chrootYonghong Song's bpf-next series runs landing-pad cleanups on bpf_unwind so frames that own locks or kptrs can tear down instead of being discarded.
By oopsAlexei Starovoitov’s series stops the verifier from walking every iteration of simple loops, cutting work sharply while keeping today’s accepted programs valid.
By oopsA researcher says invariant-violation recovery can leave register linkage intact, risking a verifier bypass; maintainers want a normal patch and a reproducer.
By oopsSeveral paths let programs pass verification then fault on a null dereference at runtime.
By kexecA 16-patch series reworks how the Linux kernel explains rejected eBPF programs, adding categorized safety reports instead of terse log lines alone.
By oops