AND faster than integer modulo operation?

Question

It is possible to re-express:

• i % m

as:

• i & (m-1)

where,

• i is an unsigned integer
• m is a po

Answer 1

If you are using a decent C compiler with optimizations enabled, it will already optimize this to whatever is faster, a technique called "strength reduction". If you're doing hand-written assembly, only sure way to test is to benchmark it. But beware, even different models of the same processor could give different results.