Is that so? I thought the main point of the verifier was to check for illegal memory access, which, since BPF programs are AFAIK not sandboxed, could lead to crashes, corruption, and other calamaties.
The instruction limit stops the verifier from having to solve the halting problem. The guaranteed runtime limit seems to be a secondary benefit.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。