commit 13b3a8297e6337a3ed89b9ef0182f273cf693ac3
Author: Kyrylo Tkachov <kyrylo.tkachov@arm.com>
Date: Tue Mar 10 15:52:24 2015 +0000
[AArch64] Properly cost MNEG/[SU]MNEGL patterns
@@ -5228,6 +5228,15 @@ aarch64_rtx_mult_cost (rtx x, int code, int outer, bool speed)
return cost;
}
+ /* MNEG or [US]MNEGL. Extract the NEG operand and indicate that it's a
+ compound and let the below cases handle it. After all, MNEG is a
+ special-case alias of MSUB. */
+ if (GET_CODE (op0) == NEG)
+ {
+ op0 = XEXP (op0, 0);
+ compound_p = true;
+ }
+
/* Integer multiplies or FMAs have zero/sign extending variants. */
if ((GET_CODE (op0) == ZERO_EXTEND
&& GET_CODE (op1) == ZERO_EXTEND)
@@ -5240,7 +5249,7 @@ aarch64_rtx_mult_cost (rtx x, int code, int outer, bool speed)
if (speed)
{
if (compound_p)
- /* MADD/SMADDL/UMADDL. */
+ /* SMADDL/UMADDL/UMSUBL/SMSUBL. */
cost += extra_cost->mult[0].extend_add;
else
/* MUL/SMULL/UMULL. */
@@ -5250,7 +5259,7 @@ aarch64_rtx_mult_cost (rtx x, int code, int outer, bool speed)
return cost;
}
- /* This is either an integer multiply or an FMA. In both cases
+ /* This is either an integer multiply or a MADD. In both cases
we want to recurse and cost the operands. */
cost += rtx_cost (op0, MULT, 0, speed)
+ rtx_cost (op1, MULT, 1, speed);
@@ -5258,7 +5267,7 @@ aarch64_rtx_mult_cost (rtx x, int code, int outer, bool speed)
if (speed)
{
if (compound_p)
- /* MADD. */
+ /* MADD/MSUB. */
cost += extra_cost->mult[mode == DImode].add;
else
/* MUL. */