[Bug rtl-optimization/97459] __uint128_t remainder for division by 3

["cvs-commit at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97459

--- Comment #23 from CVS Commits <cvs-commit at gcc dot gnu.org> ---
The master branch has been updated by Jakub Jelinek <jakub@gcc.gnu.org>:

https://gcc.gnu.org/g:855bb43f6d0bee5a74b5d3739456ca34b4609a50

commit r11-5614-g855bb43f6d0bee5a74b5d3739456ca34b4609a50
Author: Jakub Jelinek <jakub@redhat.com>
Date:   Tue Dec 1 16:25:06 2020 +0100

    Improve double-word mod even on powerpc [PR97459]

    I have noticed that while my (already committed, thanks for review)
    patch works on x86, it doesn't work on powerpc*.  The problem is that
    we don't have lshr double-word optab (neither TImode nor for -m32 DImode),
    but as expander has code for double-word shift, that doesn't really matter.
    As the implementation is prepared to punt whenever something can't be
    expanded with OPTAB_DIRECT and in the end also punts if any library calls
    would be emitted, the optab_handler checks were just to save compile time.

    On the other side, for even divisors, we know that (1 << bit) % (2 * x)
    for bit > 0 will never be equal to 1, because both dividend and divisor
    are even and so remainder will be even too, so we can save some compile
time
    by adding an early exit.

    The even divisors can be handled with the approach Thomas wrote about
    (perhaps generalized into divisors equal to what expand_doubleword_mod
    can handle times some power of two where we can handle power of two modulo
    cheaply), but that would be done in a different function...
    And we could use ctz to find the power of two...

    2020-12-01  Jakub Jelinek  <jakub@redhat.com>

            PR rtl-optimization/97459
            * optabs.c (expand_doubleword_mod): Punt early for even op1.
            (expand_binop): Don't require lshr_optab double-word handler.