Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on BPF for Hid Drivers. Parent comment
- Verifier can explore up to 1million insns now instead of 4096
- 512 bytes of stack but with tail chaining you have up to 8k
- Bounded loops have been added. Unbounded loops are prevented by design to not stall the kernel
[0] https://docs.cilium.io/en/v1.12/bpf/
There are no comments on this comment yet.
- Verifier can explore up to 1million insns now instead of 4096
- 512 bytes of stack but with tail chaining you have up to 8k
- Bounded loops have been added. Unbounded loops are prevented by design to not stall the kernel
[0] https://docs.cilium.io/en/v1.12/bpf/