Re:eBPF on Windows
by alexeldeib on Tuesday May 11, 2021 @02:54AM
(#27114997)
It’s not magic, just constraints. there are some obvious tricks (which have since been relaxed).
No unbounded loops for one. I think no backward jumps was previously a rule? I think the ability to tail call another bpf program was added, so not sure if you can accidentally loop forever between individually terminating programs.
You can't; each program is verified independently, and there's a small limit to the number of tail calls you can do.
Being able to run an unbounded loop in eBPF would be a big deal (doesn't mean it can't be done; in fact: it almost surely can be) --- a serious vulnerability.
I knew this day would come. Be back in like a week. Gotta get my neurons warmed up and translating Theoretic CompSci/discrete math notation again.
If I don't come back send a search party. I'll probably be stuck somewhere around pumping lemmas screaming "This is arbitrary bullshit!"