https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96094
--- Comment #3 from CVS Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Jakub Jelinek <ja...@gcc.gnu.org>: https://gcc.gnu.org/g:d41b097350d3c5d03824ea19520cd3b4430c9e62 commit r11-6100-gd41b097350d3c5d03824ea19520cd3b4430c9e62 Author: Jakub Jelinek <ja...@redhat.com> Date: Tue Dec 15 22:43:46 2020 +0100 match.pd: Optimize X / bool_range_Y to X [PR96094] When the divisor is bool or has [0, 1] range, as division by 0 is UB, the only remaining option in valid programs is division by 1, so we can optimize X / bool_range_Y into X. 2020-12-15 Jakub Jelinek <ja...@redhat.com> PR tree-optimization/96094 * match.pd (X / bool_range_Y -> X): New simplification. * gcc.dg/tree-ssa/pr96094.c: New test.
