←back to thread

Optimizing the Ion compiler back end

(spidermonkey.dev)
164 points undercut | 1 comments | 16 Oct 24 17:15 UTC | HN request time: 0s | source
Show context
rpearl ◴[16 Oct 24 21:16 UTC] No.41863932[source]▶
Wow, that dominator tree algorithm I wrote as an intern (https://bugzilla.mozilla.org/show_bug.cgi?id=666426) seems to have lasted 13 years! At the time we assumed that graphs would be small enough to not warrant the constant factor against Lengauer-Tarjan. ...And of course, browser-based apps have gotten much bigger since then.

Semi-NCA hadn't even been published yet and seems like the clear choice nowadays, so I'm glad to see it in place! Great work!

replies(4): >>41863991 #>>41865343 #>>41865494 #>>41866865 #
1. jandem ◴[17 Oct 24 06:08 UTC] No.41866865[source]▶
Nice to hear from you! Yes it was a very reasonable choice back then, before (enormous) asm.js and Wasm functions.

The compiler wasn't really designed for these huge graphs, but fortunately a lot of the issues can be fixed incrementally and it's still holding up well.