| 1 | 0[$] Writing network flow dissectors in BPF null/LWN/0000764200 70\r |
| 2 | i [Kernel] Sep 6, 2018 15:59 UTC (Thu) (corbet)\r |
| 3 | i\r |
| 4 | i Network packet headers contain a great deal of information,\r |
| 5 | i but the kernel often only needs a subset of that information\r |
| 6 | i to be able to perform filtering or associate any given packet\r |
| 7 | i with a flow. The piece of code that follows the different\r |
| 8 | i layers of packet encapsulation to find the important data is\r |
| 9 | i called a flow dissector. In current Linux kernels, the flow\r |
| 10 | i dissector is written in C. A patch set has been proposed\r |
| 11 | i recently to implement it in BPF with the clear goal of\r |
| 12 | i improving security, flexibility, and maybe even performance.\r |
| 13 | i\r |