News for hackers. Stuff that matters.
Re:Efficient Integer Overflow Checking in LLVM (2016) by pizlonator on Thursday September 24, 2020 @02:49PM (#24582117)
Those aren’t the optimizations I’m talking about. That’s not even how JSC optimizes overflow checks.

I’m talking about:

- abstract interpretation using a streamlined version of the octagon domain.

- instruction selection and register allocation hacks to emit the best possible code for checked math. I don’t think llvm has parity with B3 here, particularly in cases where inputs to the math are live on the failing case.

- probably other stuff. IRs that start out with checked math tend to include checked math reasoning in more optimizations.

Re:Efficient Integer Overflow Checking in LLVM (2016) by frankpf on Thursday September 24, 2020 @06:34PM (#24584464)
> - abstract interpretation using a streamlined version of the octagon domain.

Do you have any links/source code where I can read up about this (possibly in the context of compilers)? I've never heard of the term octagon domain before.

Re:Efficient Integer Overflow Checking in LLVM (2016) by tom_mellior on Saturday September 26, 2020 @05:14PM (#24602175)
Re:Efficient Integer Overflow Checking in LLVM (2016) by tom_mellior on Wednesday September 30, 2020 @09:18AM (#24638413)
Having said the above, I can't find any other information on JavaScriptCore using octagons. Searching https://trac.webkit.org/browser/trunk/Source/JavaScriptCore for "octagon" yields nothing.