6 ms·
EBPF has strict limitations, like 512-byte stack and 1M instructions, that would make it inapplicable to a lot of programs. It's intentionally not Turing comple
by NegativeK 3y ago
EBPF has strict limitations, like 512-byte stack and 1M instructions, that would make it inapplicable to a lot of programs. It's intentionally not Turing complete.
Also, because context switches are good?