Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dsww2
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
dsww2
7y ago
Not true, the instruction set of eBPF itself /is/ Turing complete. Linux is one implementation of it and the verifier currently imposes restrictions in order to not destabilize the kernel (e.g. infinite loops). But that doesn'
2.
▲
by
dsww2
7y ago
Loops are supported in newer kernels as long as they have an upper bound which can be constant, or unknown but bounded value.