Hacker News Reader

Prove was already there, what we did is to improve it to eliminate even more bound checks.

PS: I'm the author of those prove patches.

This is what I like about HN :)

How did you prioritize which BCE’s to include? (Or were these all that had a ticket?)

I wrote a Nintendo DS emulator in Go (see my GitHub) and ended up seeing lots of missing optimizations in generated code. I opened a few tickets and then focused on BCE. I realized that one of the main problems was the missing transitivity of the pass, so I ended up writing a largish piece of code to implement a partial-order set (see the poset data structure) and then picking on a few low hanging fruits that it opened up to be picked (searching for open tickets on GitHub issues). These were my first contributions to the SSA passes btw.

oops, my bad. I assumed with those big checkins that this is the first time this is getting introduced.

Reply on news.ycombinator.com