Before loading a BPF program, the kernel must verify that the program is safe to run; among other things, that verification includes ensuring that the program will terminate within a bounded time.

While singly-linked lists have many uses, they also present some restrictions. For one thing, singly-linked lists restrict node traversal to a single direction: you can’t traverse a singly-linked list ...