This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH][11/n] Merge from match-and-simplify, bit patterns from forwprop
- From: Marc Glisse <marc dot glisse at inria dot fr>
- To: Richard Biener <rguenther at suse dot de>
- Cc: gcc-patches at gcc dot gnu dot org
- Date: Thu, 6 Nov 2014 13:17:55 +0100 (CET)
- Subject: Re: [PATCH][11/n] Merge from match-and-simplify, bit patterns from forwprop
- Authentication-results: sourceware.org; auth=none
- References: <alpine dot LSU dot 2 dot 11 dot 1411060952430 dot 27850 at zhemvz dot fhfr dot qr>
- Reply-to: gcc-patches at gcc dot gnu dot org
On Thu, 6 Nov 2014, Richard Biener wrote:
+/* Simplify (A & B) OP0 (C & B) to (A OP0 C) & B. */
+/* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
As soon as there are 2+ operations in the result, this comment in
fwprop_ssa_val becomes outdated, no?
/* We continue matching along SSA use-def edges for SSA names
that are not single-use. Currently there are no patterns
that would cause any issues with that. */
(I am not opposing the patch, just trying to understand how things work
for when I'll propose new patterns)
--
Marc Glisse