I just built a treeshaker for SubX programs. To my pleasant surprise it took just about 2 hours.

https://github.com/akkartik/mu/blob/master/tools/treeshake.cc

I don't trust it yet, but it does yield some stats:

https://github.com/akkartik/mu/blob/master/linux/stats.txt

Notes:

a) Binary sizes, in spite of being just tens of KB, are quite bloated by tests and unused library functions. They can usually be shrunk to ~20% their original size. Programming in machine code naturally focuses on the essence.

b) 75% LoC in sources are tests. Verbose!

This post is part of my Freewheeling Apps Devlog.

Comments gratefully appreciated. Please send them to me by any method of your choice and I'll include them here.