<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[The unseen hero of OpenBSD]]></title><description><![CDATA[<p dir="auto">The unseen hero of OpenBSD: otto’s malloc What this is about This is me learning about OpenBSD’s malloc.<br />
I try not to do a surface-level overview.<br />
I want to understand the internals better, the data structures, the design decisions, and why those decisions make heap exploitation so much harder.<br />
What malloc actually does Every C program that needs memory at runtime calls malloc.<br />
malloc is a library function. It’s not a syscall – it’s a layer between your code and the kernel.</p>
<ul>
<li><a href="https://polymathmonkey.github.io/weblog/artifacts/openbsdmalloc/index.html" rel="nofollow ugc">https://polymathmonkey.github.io/weblog/artifacts/openbsdmalloc/index.html</a></li>
</ul>
]]></description><link>https://billboard.bsd.cafe/topic/100/the-unseen-hero-of-openbsd</link><generator>RSS for Node</generator><lastBuildDate>Fri, 01 May 2026 22:43:59 GMT</lastBuildDate><atom:link href="https://billboard.bsd.cafe/topic/100.rss" rel="self" type="application/rss+xml"/><pubDate>Tue, 21 Apr 2026 12:13:34 GMT</pubDate><ttl>60</ttl></channel></rss>