News for hackers. Stuff that matters.
Re:Efficient Integer Overflow Checking in LLVM (2016) by pizlonator on Thursday September 24, 2020 @04:42AM (#24576612)
Maybe some day llvm will know how to optimize overflow checks as well as JavaScript engines do.
Re:Efficient Integer Overflow Checking in LLVM (2016) by saagarjha on Thursday September 24, 2020 @11:04AM (#24579270)
Maybe, but LLVM has the disadvantage that speculating “this won’t overflow” and creating a fast path with that information is not something that can be fixed if more profiling data comes in at runtime saying it was a poor choice.
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.
Re:Efficient Integer Overflow Checking in LLVM (2016) by im3w1l on Thursday September 24, 2020 @02:31PM (#24581882)
The C/C++ standards allow compilers to do whatever they want as long as it does not cause observable output changes.

So LLVM could do runtime profiling if it wanted. But I suspect that in the majority of the cases the cost of the profiling would be worse than the potential gains.

Re:Efficient Integer Overflow Checking in LLVM (2016) by nly on Thursday September 24, 2020 @04:50AM (#24576642)
Is this tongue in cheek? JavaScript numbers are floating point, are they not?
Re:Efficient Integer Overflow Checking in LLVM (2016) by titzer on Thursday September 24, 2020 @04:52AM (#24576657)
No, JS engines optimize heavily for small integers (31 or 32 bits) and dynamically overflow into double range as necessary.
Re:Efficient Integer Overflow Checking in LLVM (2016) by chrisseaton on Thursday September 24, 2020 @06:06AM (#24577048)
They aren’t literally implemented as floating point in most cases. That’d be crazy! If the number fits in an integer then a sensible implementation uses an integer.