This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH] Fix an endless recursion during simplification of MULT (PR rtl-optimization/49472)
- From: Eric Botcazou <ebotcazou at adacore dot com>
- To: Jakub Jelinek <jakub at redhat dot com>
- Cc: Richard Sandiford <richard dot sandiford at linaro dot org>, gcc-patches at gcc dot gnu dot org
- Date: Mon, 4 Jul 2011 20:42:53 +0200
- Subject: Re: [PATCH] Fix an endless recursion during simplification of MULT (PR rtl-optimization/49472)
- References: <20110704174043.GU16443@tyan-ft48-01.lab.bos.redhat.com>
> 2011-07-04 Jakub Jelinek <jakub@redhat.com>
>
> PR rtl-optimization/49472
> * simplify-rtx.c (simplify_unary_operation_1) <case NEG>: When
> negating MULT, negate the second operand instead of first.
> (simplify_binary_operation_1) <case MULT>: If one operand is
> a NEG and the other is MULT, don't attempt to optimize by
> negation of the MULT operand if it only moves the NEG operation
> around.
>
> * gfortran.dg/pr49472.f90: New test.
OK for mainline and 4.6 branch.
--
Eric Botcazou