News for hackers. Stuff that matters.
Re:How do compilers optimize divisions? by raphlinus on Monday February 20, 2017 @07:30PM (#13692250)
Duh, you're right on both counts. It should work for any odd divisor, I was just computing the inverse in a dumb way when I tried out other divisors. And I should have stated u32 wrapping arithmetic.
Re:How do compilers optimize divisions? by im3w1l on Tuesday February 21, 2017 @12:46AM (#13693569)
And for even divisors you can separate the divisor into a power of two, and an odd part. The odd part is checked as before, and the power of two is checked with an and mask.
Re:How do compilers optimize divisions? by raphlinus on Tuesday February 21, 2017 @01:54PM (#13698313)
An even trickier way to do this is to rotate right by the power of two factor between doing the multiply and the compare.
Re:How do compilers optimize divisions? by im3w1l on Thursday February 23, 2017 @02:17AM (#13712246)
That wouldn't work, because a number that is bigger than the threshold could become smaller than it after the rotation.