News for hackers. Stuff that matters.
Re:How do compilers optimize divisions? by jeffasinger on Monday February 20, 2017 @08:43PM (#13692550)
This is an unsigned int, so the expectation would be to do integer division, which would not get you the same result as multiplying by the inverse.
Re:How do compilers optimize divisions? by dmichulke on Monday February 20, 2017 @08:51PM (#13692584)
Couldn't that be addressed via a floor operation afterwards?
Re:How do compilers optimize divisions? by SolarNet on Monday February 20, 2017 @10:17PM (#13692973)
Because unless you are on a video card (e.g. doing SIMD) floating point operations are very very expensive.
Re:How do compilers optimize divisions? by adwn on Tuesday February 21, 2017 @02:05AM (#13693849)
That is not true; compare kr7's comment [1]:

> On Skylake [...] 32/64-bit floating point multiplication has a 4 cycle latency with a throughput of 2 instructions / cycle.

Of course, there are some operations that are very expensive (trigonometric functions, for example), but they're not necessary here, and they're also very expensive on the GPU.

[1] https://news.ycombinator.com/item?id=13693749