BPF (and eBPF) disallow all backwards jumps. This makes the halting problem trivially decidable (all programs halt in finite steps), and those programs are sti

BPF (and eBPF) disallow all backwards jumps. This makes the halting problem trivially decidable (all programs halt in finite steps), and those programs are still practically useful in their problem domain.