Re:Performance patches in Go 1.11
by agnivade on Friday June 22, 2018 @10:53AM
(#17374391)
The newly introduced prove pass is probably the biggest game changer. And it provides a ground work for new optimizations to be done on top of it.
[ Parent
| on HN ]
Re:Performance patches in Go 1.11
by giovannibajo1 on Friday June 22, 2018 @12:54PM
(#17375494)
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.
Re:Performance patches in Go 1.11
by hectormalot on Friday June 22, 2018 @02:44PM
(#17376313)
This is what I like about HN :)
How did you prioritize which BCE’s to include? (Or were these all that had a ticket?)
Re:Performance patches in Go 1.11
by giovannibajo1 on Friday June 22, 2018 @06:48PM
(#17378163)
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.