Register deprivation: spills and runtime under forced register scarcity

·Hacker News··

Register deprivation: spills and runtime under forced register scarcity Intel Xeon E-2236 @ 3.40GHz · gcc 15.2.0 · 2026-07-13 We compiled nine small kernels while progressively reserving registers with gcc -ffixed-<reg>, then measured spills and runtime on one machine. Reserving registers reliably increases spills, but the static spill count is a weak predictor of the runtime cost, and one kernel gains 23 spills with no slowdown at all. Code is at https://github.com/rjpower/spillbench; the

Read full article →

Related Articles

Show HN: An e-ink frame that hears birds and draws them as 1800s illustrations
arnemunthekaas · Hacker News · 6h ago
Show HN: Capsule – Single-file web apps that save their data into SQLite
bashtian · Hacker News · 5h ago
How much of F-Droid is LLM generated?
_ZeD_ · Hacker News · 9h ago
Ubuntu 26.10 completes transition to Rust-based coreutils
theanonymousone · Hacker News · 1d ago
America's Driver's License Breach Is a National Security Disaster
hn_acker · Hacker News · 3h ago