<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ebpf on Neil Naveen</title><link>https://neilnaveen.dev/tags/ebpf/</link><description>Recent content in Ebpf on Neil Naveen</description><generator>Hugo</generator><language>en-us</language><copyright>&lt;a href="https://creativecommons.org/licenses/by-nc/4.0/" target="_blank" rel="noopener"&gt;CC BY-NC 4.0&lt;/a&gt;</copyright><lastBuildDate>Wed, 28 Oct 2026 14:42:00 -0500</lastBuildDate><atom:link href="https://neilnaveen.dev/tags/ebpf/index.xml" rel="self" type="application/rss+xml"/><item><title>Speeding up eBPF filepath checks</title><link>https://neilnaveen.dev/posts/speeding-up-ebpf-filepath-checks/</link><pubDate>Wed, 28 Oct 2026 14:42:00 -0500</pubDate><guid>https://neilnaveen.dev/posts/speeding-up-ebpf-filepath-checks/</guid><description>&lt;p&gt;Recently, I was testing our eBPF agent, and I found a major bottleneck in our code. My brother Nathan solved half the problem by &lt;a href="https://nathannaveen.dev/posts/dropping-ebpf-cpu-cost-by-90/"&gt;caching the results&lt;/a&gt;. This blog post covers how we speed up the limiting factor itself, filepath checking, even when we don&amp;rsquo;t have cached results.&lt;/p&gt;&#10;&lt;p&gt;Before we dive into the performance changes, I want to briefly explain what our eBPF agent does so everything makes sense. Essentially, the eBPF agent receives a list of protected directories, if someone tries to mutate any files under those directories, we apply our policy. This is a gross simplification, so for a more in-depth one, take a look at the &lt;a href="https://github.com/bomfather/agent"&gt;bomfather/agent README&lt;/a&gt;.&lt;/p&gt;</description></item></channel></rss>