miniblog.

Jan 30, 2016 at 12:57

Compiling LLVM can be slow (20 mins on my little box). Luckily, there are pre-built binaries you can use to bisect!

[llvm-dev] beta: cloud compiler bisection tool

Jan 16, 2026 at 10:03

Wonderful post from the lead LLVM maintainer reflecting on how the project is run, the design issues in LLVM today, and opportunities to make it better:

LLVM: The bad parts

Jul 27, 2024 at 04:13

Bril is a cute intermediate language for teaching (think simplified LLVM IR): https://www.cs.cornell.edu/~asampson/blog/bril.html The idea of providing a standard JSON format to help students write basic passes is really elegant.

Bril: An Intermediate Language for Teaching Compilers

I created a new intermediate language, called Bril, for teaching my funky open-source, hands-on compilers course. Because it’s for education, Bril prioritizes simplicity and regularity over more typical compiler priorities like performance and concision. This is an overview of Bril’s design, its quirks, and the ecosystem that has grown up around it since 2019.

Jan 26, 2024 at 16:38

I'm a big fan of segmented stacks (or 'split stacks'), where stack frames are heap allocated, You can write recursive functions with less worry, and you get better tracebacks than TCO. Go is the most popular language with this feature, to my knowledge: https://dave.cheney.net/2013/06/02/why-is-a-goroutines-stack-infinite I'd assumed that LLVM didn't support this, but gollvm handles it fine! https://groups.google.com/g/golang-nuts/c/ivOZ-j6Zt2c/m/BUBX2Td9BgAJ

Why is a Goroutine’s stack infinite ? | Dave Cheney

Related Posts