[$] Taking BPF programs beyond one-million instructions

The BPF verifier is not magic; it cannot solve thehalting problem. Therefore,it has to err on the side of assuming that a program will run too long if itcannot prove that the program will not.The ultimate check on the size of a BPF program is theone-million-instruction limit - the verifier will refuse to process more thanone-million instructions, no matter what a BPF program does. Alexei Starovoitov gavea talk at the 2025 Linux Storage, Filesystem,Memory-Management, and BPF Summit about that limit,why correctly written BPF programs shouldn't hit it, and how to make the userexperience of large BPF programs better in the future.