[$] Taking BPF programs beyond one-million instructions

Date:
Wed, 16 Apr 2025 16:44:29 +0000

Description:
The BPF verifier is not magic; it cannot solve the halting problem . Therefore,
it has to err on the side of assuming that a program will run too long if it cannot prove that the program will not.
The ultimate check on the size of a BPF program is the
one-million-instruction limit the verifier will refuse to process more than one-million instructions, no matter what a BPF program does. Alexei Starovoitov gave
a 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 user experience of large BPF programs better in the future.

======================================================================
Link to news story:
https://lwn.net/Articles/1017116/


--- Mystic BBS v1.12 A47 (Linux/64)
* Origin: tqwNet UK HUB @ hub.uk.erb.pw (1337:1/100)