LLVM Social #23 - The BPF target in LLVM

In our Spring meetup Michal Rostecki will talk about eBPF in LLVM. His connection to LLVM has its origins in his work on Aya, which he presented at FOSDEM earlier this year.

Abstract:
BPF (Berkley Packet Filter) is a virtual machine which allows to run minimal, sandboxed programs with very strong constraints (instruction limit, verifier checking the memory access), which are ensuring that the programs are secure and they are executing fast. It's primarily used in the Linux kernel to write programs attached to events happening in the system (network traffic, function calls), which can be used for network filtering, tracing, debugging (both the kernel and user-space applications) and implementing security rules.

How is this related to LLVM? Well, it's the first and main compiler providing the support for the BPF target! In this talk I'm going to start with a brief introduction to BPF before diving into LLVM, clang and rustc internals.

--

Once discussions fade into casual conversation, we typically go for drinks to c-base or one of the surrounding bars. There is always space for outside topics and discussions. If you have specific questions, please bring them. Looking forward to meeting everyone in mid April.