[$] Bounded loops in BPF programs

The BPF verifier is charged with ensuring that any given BPF program is
safe for the kernel to load and run. Programs that fail to terminate are
clearly unsafe, as they present an opportunity for denial-of-service
attacks. In current kernels, the verifier uses a heavy-handed technique to
block such
programs: it disallows any program containing loops. This works, but at the
cost of disallowing a wide range of useful programs; if the verifier could
determine whether any given loop would terminate within a bounded time,
this restriction could be lifted. John Fastabend presented a plan for
doing so during the .