BPF verifier gains scalar evolution to widen bounded loops
Eduard Zingerman's 43-patch series lets the kernel treat loop induction variables as ranges instead of enumerating every value.
By kexec#loops
BPF verifier series adds scalar evolution for bounded loops
Eduard Zingerman proposes algebraic loop analysis so induction variables can be treated as ranges instead of enumerated values.
By kexecBPF verifier gains widening path for long bounded loops
Alexei Starovoitov’s series stops the verifier from walking every iteration of simple loops, cutting work sharply while keeping today’s accepted programs valid.
By oops