3 ms·
Yes and no. It's important to keep in mind that BPF uses a register machine. If you look at the paper[0] describing BPF, the authors explicitly considered a dec
by bhickey 12y ago
Yes and no. It's important to keep in mind that BPF uses a register machine. If you look at the paper[0] describing BPF, the authors explicitly considered a decision tree model (CSPF). Turns out that trees perform redundant computation, can't deal with variable length headers, and are not memory efficient.
[0] http://www.tcpdump.org/papers/bpf-usenix93.pdf http://www.tcpdump.org/papers/bpf-usenix93.pdf
- userbinator 12y agoRight, that's why I said it's a DAG -- a decision DAG -- instead of just a tree structure.