https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81346
Jakub Jelinek <jakub at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|UNCONFIRMED |NEW
Last reconfirmed| |2017-07-07
CC| |glisse at gcc dot gnu.org,
| |jakub at gcc dot gnu.org
Ever confirmed|0 |1
--- Comment #3 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
Indeed, it is fold_div_compare in fold-const.c. Perhaps we should move the
first part of that routine (the computation of lo and hi) into a helper
subroutine and use that in match.pd pattern that would then based on those
lo/hi trees decide how to optimize stuff?
