As mentioned in http://duriansoftware.com/joe/Optimizing-is-multiple-checks-with-modular-arithmetic.html , we could optimize unsigned x % const == 0 or x % const != 0 into a single (non-highpart) multiplication plus comparison (at least for odd const, for even const we can rotate before comparison if target has cheap rotates, or could test low bits and compare). Obviously, for power of two const we already emit the best code.
Dup of PR 82853 ?
Dup indeed. *** This bug has been marked as a duplicate of bug 82853 ***