News for hackers. Stuff that matters.

A comment on Faster remainders when the divisor is a constant: beating compilers & libdivide. Parent comment

Re:Faster remainders when the divisor is a constant: beating... by yorwba on Friday February 08, 2019 @05:21PM (#19119236)
The article mentions the book and that the method presented therein is used by clang for faster division. The novel part is to adapt the method for faster remainders without calculating the quotient first.
[ Parent | on HN ]

There are no comments on this comment yet.