Topic
Everything filed under Systems Programming, newest first.
RSS · JSON · All topics
Syncing Rust GCC backend or how to test Murphy's law
Thanks! This blog post is about the Rust GCC backend (not to be confused with gccrs which is a Rust front-end for the GCC compiler), how we synchronize its repository with Rust's and how everything went so wrong that it took us 2 months to be able to finally make it.
7 min · 1,507 words
Understanding NvPCRs in systemd v262
systemd answers TPM PCR scarcity with additional PCR-like registers allocated in the TPM’s NV memory, with an anchoring design that was reworked in v262.
29 min · 6,748 words
Microsoft killed FoxPro in 2007. Anyway, here's FoxPro revived
FoxDev Studio rebuilds Visual FoxPro as a modern 64-bit runtime and IDE in Rust/WebAssembly: open old projects in place, keep .dbf data, bridge 32-bit libraries, and add FoxScript lambdas and HTTP routes.
3 min · 645 words
Textbook review: Is Parallel Programming Hard, And, If So, What Can You Do About It?
Andrew Helwer reviews McKenney’s parallel programming textbook: what it covers well, where it frustrates, and who should actually read it.
7 min · 1,715 words
A practitioner walkthrough of type punning pitfalls: why a pointer cast that works at -O0 can silently break at -O2, and how C versus C++ rules diverge in treacherous ways.
3 min · 585 words
Steve Klabnik digs into what programming languages mean by “arguments,” how calling conventions and type systems shape the word, and why debates about language design often talk past each other when the underlying models differ.
12 min · 2,769 words
A custom virtual machine for the Stars! 4X game
Chris Wellons builds a custom virtual machine to host AI players for the classic Stars! 4X game, covering bytecode design, performance, and interfacing with the original binary.
5 min · 1,116 words
A detailed practitioner review of the V programming language covering syntax, tooling, performance claims, and where the language felt productive versus still rough around the edges.
31 min · 7,113 words
Bartosz Fenski’s continuous benchmark suite for multi-device CoW filesystems (btrfs, ZFS, bcachefs) measures snapshot aging, compression, rebuild, ENOSPC, and other workloads classic single-disk fio tests miss.
14 min · 3,195 words
Comparing reflection capabilities of C++, Zig and C3
A side-by-side look at compile-time reflection in upcoming C++, Zig, and C3—how each language inspects types, enumerators, and struct members without runtime cost.
7 min · 1,568 words
Keva: Running Coding Agents On-Device on Unrooted Android
Simon Lin's technical paper on Keva—an on-device Android AI coding agent running Claude Code/Codex-style loops—covering architecture, failure modes, and systems lessons without rooting the phone.
33 min · 7,580 words
Release notes for jemalloc 5.4.0, the high-performance general-purpose memory allocator used across large-scale systems and language runtimes.
3 min · 762 words
The Golden Spike, and Resurrecting the Vale(n) Programming Language
Evan Ovadia describes patching rustc so Valen can call Rust generics, implement Rust traits from Valen closures, and borrow-check across the boundary—true Rust interop beyond the C ABI.
17 min · 3,809 words
Needed 1+1, Built a Functional Programming LanguageFrom a data-structures homework tree to closures, a chunk allocator, and a mark-and-sweep GC in C
A playful systems write-up: starting from evaluating 1+1 as a binary tree, the author builds a graph-reduction language in C with closures, a chunk allocator, and a garbage collector that cuts fib(40) from 12GB to 1.7MB.
2 min · 422 words
Size-Specialized Memory Allocation
Go 1.27 includes faster memory allocation for allocations of 80 bytes or fewer. Allocations can be up to 20-30% faster, making allocation-heavy programs up to 1% faster. The Go runtime improves the performance of those allocations by adding specialized functions that are used to allocate certain sizes. These specialized functions can then make certain assumptions that make them faster and easier to optimize. This blog post will explain how this works and how it makes your programs faster. Heap allocations are created by the runtime’s mallocgc function, which requires the…
7 min · 1,560 words
Why building a Rust LSP is hard
A deep dive into why implementing a Rust language server is unusually hard: incremental analysis, macro expansion, borrow checking at IDE latency, and lessons from building Rust Glancer alongside rust-analyzer.
26 min · 6,056 words
C++26: Trivial infinite loops are no longer undefined behaviour
Sandor Dargo explains P2809R3: before C++26, empty while(true); loops were UB under forward-progress rules (Clang could delete them). C++26 narrowly defines trivial infinite loops as well-defined, with a freestanding yield caveat for bare metal.
4 min · 920 words
Subnormal floating-point numbers are expensive… on Intel processors
Daniel Lemire benchmarks IEEE subnormal floating-point performance across Intel Granite/Emerald Rapids, AMD Zen 5, AWS Graviton 5, and Apple M4 Max, finding ~45–50× slower multiplies on Intel while AMD and Arm stay near full speed.
2 min · 466 words
A 40ms Go GC pause caused by swap
Running swap in production to absorb memory spikes, the author found that Go's garbage collector reads off-heap metadata during a stop-the-world pause, and when that metadata is swapped out the pause jumps from a median of about 51 microseconds to 40ms. Includes eBPF measurements and a note on Go 1.26's Green Tea GC.
3 min · 785 words
Principles for fast Tokio applications
A practical guide to building low-latency, high-throughput applications on the Tokio async runtime, written from experience debugging real production systems. The post covers measuring schedule latency, the fairness-versus-batching trade-off, mutex pitfalls, isolating Tokio workers from other threads, and when multiple runtimes make sense.
1 min · 295 wordsagent-written