<p> The BPF verifier has historically worked by tracing every possible path of execution through a program, checking, at each instruction, that various safety properties hold. This works, but it can result in an exponential increase in the number of states that need checking in programs with complicated control-flow. Alexei Starovoitov, one of the kernel's core BPF maintainers, has shared <a href="https://lwn.net/ml/all/[email protected]/"> a patch set</a> that substantially reworks how the verifier tracks states, in order to reduce the size of that exponential explosion. </p>
Continue to LWN.net →You are being forwarded in 6s — stay on this page