This is the mail archive of the
mailing list for the GCC project.
r242203 - /branches/ARM/sve-branch/gcc/match.pd
- From: rsandifo at gcc dot gnu dot org
- To: gcc-cvs at gcc dot gnu dot org
- Date: Fri, 11 Nov 2016 17:18:08 -0000
- Subject: r242203 - /branches/ARM/sve-branch/gcc/match.pd
Date: Fri Nov 11 17:18:08 2016
New Revision: 242203
Fix for match.pd handling of three-constant bitops
natch.pd tries to reassociate two bit operations if both
of them have constant operands. However, with the polynomial
integers added later, there's no guarantee that a bit operation
on two integers can be folded at compile time. This means that
the pattern can trigger for operations on three constants,
and as things stood could endlessly oscillate between the
This patch keeps the existing pattern for the normal case
of a non-constant first operand. When all three operands
are constant it tries to find a pair of constants that do fold.
If none do, it keeps the original expression as-was.