4 ms·
>If true, that would imply BPF programs are not Turing complete. It's not intended to be turing complete, just to be useful enough while provably not harming t
by garblegarble 7y ago
>If true, that would imply BPF programs are not Turing complete.
It's not intended to be turing complete, just to be useful enough while provably not harming the system (e.g. by never terminating). There's quite a good write-up at https://lwn.net/Articles/773605/ https://lwn.net/Articles/773605/