[PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Andreas Krebbel]

Hi,

the widening_mul pass might increase the number of multiplications in
the code by transforming

a = b * c
d = a + 2
e = a + 3

into:

d = b * c + 2
e = b * c + 3

under the assumption that an FMA instruction is not more expensive
than a simple add.  This certainly isn't always true.  While e.g. on
s390 an fma is indeed not slower than an add execution-wise it has
disadvantages regarding instruction grouping.  It doesn't group with
any other instruction what has a major impact on the instruction
dispatch bandwidth.

The following patch tries to figure out the costs for adds, mults and
fmas by building an RTX and asking the backends cost function in order
to estimate whether it is whorthwhile doing the transformation.

With that patch the 436.cactus hotloop contains 28 less
multiplications than before increasing performance slightly (~2%).

Bootstrapped and regtested on x86_64 and s390x.

Bye,

-Andreas-

2011-07-13  Andreas Krebbel  <Andreas.Krebbel@de.ibm.com>

	* tree-ssa-math-opts.c (compute_costs): New function.
	(convert_mult_to_fma): Take costs into account when propagating
	multiplications into several additions.
	* config/s390/s390.c (z196_costs): Adjust costs for madbr and
	maebr.


Index: gcc/tree-ssa-math-opts.c
===================================================================
*** gcc/tree-ssa-math-opts.c.orig
--- gcc/tree-ssa-math-opts.c
*************** convert_plusminus_to_widen (gimple_stmt_
*** 2185,2190 ****
--- 2185,2252 ----
    return true;
  }
  
+ /* Computing the costs for calculating RTX with CODE in MODE.  */
+ 
+ static unsigned
+ compute_costs (enum machine_mode mode, enum rtx_code code, bool speed)
+ {
+   rtx seq;
+   rtx set;
+   unsigned cost = 0;
+ 
+   start_sequence ();
+ 
+   switch (GET_RTX_LENGTH (code))
+     {
+     case 2:
+       force_operand (gen_rtx_fmt_ee (code, mode,
+ 		       gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
+ 		       gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2)),
+ 		     NULL_RTX);
+       break;
+     case 3:
+       /* FMA expressions are not handled by force_operand.  */
+       expand_ternary_op (mode, fma_optab,
+ 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
+ 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2),
+ 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 3),
+ 			 NULL_RTX, false);
+       break;
+     default:
+       gcc_unreachable ();
+     }
+ 
+   seq = get_insns ();
+   end_sequence ();
+ 
+   if (dump_file && (dump_flags & TDF_DETAILS))
+     {
+       fprintf (dump_file, "Calculating costs of %s in %s mode.  Sequence is:\n",
+ 	       GET_RTX_NAME (code), GET_MODE_NAME (mode));
+       print_rtl (dump_file, seq);
+     }
+ 
+   for (; seq; seq = NEXT_INSN (seq))
+     {
+       set = single_set (seq);
+       if (set)
+ 	cost += rtx_cost (set, SET, speed);
+       else
+ 	cost++;
+     }
+ 
+   /* If the backend returns a cost of zero it is most certainly lying.
+      Set this to one in order to notice that we already calculated it
+      once.  */
+   cost = cost ? cost : 1;
+ 
+   if (dump_file && (dump_flags & TDF_DETAILS))
+     fprintf (dump_file, "%s in %s costs %d\n\n",
+ 	       GET_RTX_NAME (code), GET_MODE_NAME (mode), cost);
+ 
+   return cost;
+ }
+ 
  /* Combine the multiplication at MUL_STMT with operands MULOP1 and MULOP2
     with uses in additions and subtractions to form fused multiply-add
     operations.  Returns true if successful and MUL_STMT should be removed.  */
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2197,2202 ****
--- 2259,2270 ----
    gimple use_stmt, neguse_stmt, fma_stmt;
    use_operand_p use_p;
    imm_use_iterator imm_iter;
+   enum machine_mode mode;
+   int uses = 0;
+   bool speed = optimize_bb_for_speed_p (gimple_bb (mul_stmt));
+   static unsigned mul_cost[NUM_MACHINE_MODES];
+   static unsigned add_cost[NUM_MACHINE_MODES];
+   static unsigned fma_cost[NUM_MACHINE_MODES];
  
    if (FLOAT_TYPE_P (type)
        && flag_fp_contract_mode == FP_CONTRACT_OFF)
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2213,2222 ****
    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
      return false;
  
    /* Make sure that the multiplication statement becomes dead after
!      the transformation, thus that all uses are transformed to FMAs.
!      This means we assume that an FMA operation has the same cost
!      as an addition.  */
    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
      {
        enum tree_code use_code;
--- 2281,2297 ----
    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
      return false;
  
+   mode = TYPE_MODE (type);
+ 
+   if (!fma_cost[mode])
+     {
+       fma_cost[mode] = compute_costs (mode, FMA, speed);
+       add_cost[mode] = compute_costs (mode, PLUS, speed);
+       mul_cost[mode] = compute_costs (mode, MULT, speed);
+     }
+ 
    /* Make sure that the multiplication statement becomes dead after
!      the transformation, thus that all uses are transformed to FMAs.  */
    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
      {
        enum tree_code use_code;
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2292,2297 ****
--- 2367,2373 ----
        if (gimple_assign_rhs1 (use_stmt) == gimple_assign_rhs2 (use_stmt))
  	return false;
  
+       uses++;
        /* While it is possible to validate whether or not the exact form
  	 that we've recognized is available in the backend, the assumption
  	 is that the transformation is never a loss.  For instance, suppose
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2302,2307 ****
--- 2378,2389 ----
  	 independant and could be run in parallel.  */
      }
  
+   /* Calculate the costs of moving the multiplication into all the
+      minus/plus expressions.  */
+ 
+   if (uses * fma_cost[mode] > uses * add_cost[mode] + mul_cost[mode])
+     return false;
+ 
    FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, mul_result)
      {
        gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
Index: gcc/config/s390/s390.c
===================================================================
*** gcc/config/s390/s390.c.orig
--- gcc/config/s390/s390.c
*************** struct processor_costs z196_cost =
*** 242,249 ****
    COSTS_N_INSNS (100),   /* SQXBR B+100 */
    COSTS_N_INSNS (42),    /* SQDBR B+42 */
    COSTS_N_INSNS (28),    /* SQEBR B+28 */
!   COSTS_N_INSNS (1),     /* MADBR B */
!   COSTS_N_INSNS (1),     /* MAEBR B */
    COSTS_N_INSNS (101),   /* DXBR B+101 */
    COSTS_N_INSNS (29),    /* DDBR */
    COSTS_N_INSNS (22),    /* DEBR */
--- 242,250 ----
    COSTS_N_INSNS (100),   /* SQXBR B+100 */
    COSTS_N_INSNS (42),    /* SQDBR B+42 */
    COSTS_N_INSNS (28),    /* SQEBR B+28 */
!   /* Cheaper than a mul+add but more expensive then a single mul/add.  */
!   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MADBR B */
!   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MAEBR B */
    COSTS_N_INSNS (101),   /* DXBR B+101 */
    COSTS_N_INSNS (29),    /* DDBR */
    COSTS_N_INSNS (22),    /* DEBR */

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Richard Guenther]

On Wed, Jul 13, 2011 at 3:13 PM, Andreas Krebbel
<krebbel@linux.vnet.ibm.com> wrote:
> Hi,
>
> the widening_mul pass might increase the number of multiplications in
> the code by transforming
>
> a = b * c
> d = a + 2
> e = a + 3
>
> into:
>
> d = b * c + 2
> e = b * c + 3
>
> under the assumption that an FMA instruction is not more expensive
> than a simple add.  This certainly isn't always true.  While e.g. on
> s390 an fma is indeed not slower than an add execution-wise it has
> disadvantages regarding instruction grouping.  It doesn't group with
> any other instruction what has a major impact on the instruction
> dispatch bandwidth.
>
> The following patch tries to figure out the costs for adds, mults and
> fmas by building an RTX and asking the backends cost function in order
> to estimate whether it is whorthwhile doing the transformation.
>
> With that patch the 436.cactus hotloop contains 28 less
> multiplications than before increasing performance slightly (~2%).
>
> Bootstrapped and regtested on x86_64 and s390x.

Ick ;)

Maybe this is finally the time to introduce target hook(s) to
get us back costs for trees?  For this case we'd need two
actually, or just one - dependent on what finegrained information
we pass.  Choices:

  tree_code_cost (enum tree_code)
  tree_code_cost (enum tree_code, enum machine_mode mode)
  unary_cost (enum tree_code, tree actual_arg0) // args will be mostly
SSA names or constants, but at least they are typed - works for
mixed-typed operations
  binary_cost (...)
  ...
  unary_cost (enum tree_code, enum tree_code arg0_kind) // constant
vs. non-constant arg, but lacks type/mode

Richard.

> Bye,
>
> -Andreas-
>
> 2011-07-13  Andreas Krebbel  <Andreas.Krebbel@de.ibm.com>
>
>        * tree-ssa-math-opts.c (compute_costs): New function.
>        (convert_mult_to_fma): Take costs into account when propagating
>        multiplications into several additions.
>        * config/s390/s390.c (z196_costs): Adjust costs for madbr and
>        maebr.
>
>
> Index: gcc/tree-ssa-math-opts.c
> ===================================================================
> *** gcc/tree-ssa-math-opts.c.orig
> --- gcc/tree-ssa-math-opts.c
> *************** convert_plusminus_to_widen (gimple_stmt_
> *** 2185,2190 ****
> --- 2185,2252 ----
>    return true;
>  }
>
> + /* Computing the costs for calculating RTX with CODE in MODE.  */
> +
> + static unsigned
> + compute_costs (enum machine_mode mode, enum rtx_code code, bool speed)
> + {
> +   rtx seq;
> +   rtx set;
> +   unsigned cost = 0;
> +
> +   start_sequence ();
> +
> +   switch (GET_RTX_LENGTH (code))
> +     {
> +     case 2:
> +       force_operand (gen_rtx_fmt_ee (code, mode,
> +                      gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
> +                      gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2)),
> +                    NULL_RTX);
> +       break;
> +     case 3:
> +       /* FMA expressions are not handled by force_operand.  */
> +       expand_ternary_op (mode, fma_optab,
> +                        gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
> +                        gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2),
> +                        gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 3),
> +                        NULL_RTX, false);
> +       break;
> +     default:
> +       gcc_unreachable ();
> +     }
> +
> +   seq = get_insns ();
> +   end_sequence ();
> +
> +   if (dump_file && (dump_flags & TDF_DETAILS))
> +     {
> +       fprintf (dump_file, "Calculating costs of %s in %s mode.  Sequence is:\n",
> +              GET_RTX_NAME (code), GET_MODE_NAME (mode));
> +       print_rtl (dump_file, seq);
> +     }
> +
> +   for (; seq; seq = NEXT_INSN (seq))
> +     {
> +       set = single_set (seq);
> +       if (set)
> +       cost += rtx_cost (set, SET, speed);
> +       else
> +       cost++;
> +     }
> +
> +   /* If the backend returns a cost of zero it is most certainly lying.
> +      Set this to one in order to notice that we already calculated it
> +      once.  */
> +   cost = cost ? cost : 1;
> +
> +   if (dump_file && (dump_flags & TDF_DETAILS))
> +     fprintf (dump_file, "%s in %s costs %d\n\n",
> +              GET_RTX_NAME (code), GET_MODE_NAME (mode), cost);
> +
> +   return cost;
> + }
> +
>  /* Combine the multiplication at MUL_STMT with operands MULOP1 and MULOP2
>     with uses in additions and subtractions to form fused multiply-add
>     operations.  Returns true if successful and MUL_STMT should be removed.  */
> *************** convert_mult_to_fma (gimple mul_stmt, tr
> *** 2197,2202 ****
> --- 2259,2270 ----
>    gimple use_stmt, neguse_stmt, fma_stmt;
>    use_operand_p use_p;
>    imm_use_iterator imm_iter;
> +   enum machine_mode mode;
> +   int uses = 0;
> +   bool speed = optimize_bb_for_speed_p (gimple_bb (mul_stmt));
> +   static unsigned mul_cost[NUM_MACHINE_MODES];
> +   static unsigned add_cost[NUM_MACHINE_MODES];
> +   static unsigned fma_cost[NUM_MACHINE_MODES];
>
>    if (FLOAT_TYPE_P (type)
>        && flag_fp_contract_mode == FP_CONTRACT_OFF)
> *************** convert_mult_to_fma (gimple mul_stmt, tr
> *** 2213,2222 ****
>    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
>      return false;
>
>    /* Make sure that the multiplication statement becomes dead after
> !      the transformation, thus that all uses are transformed to FMAs.
> !      This means we assume that an FMA operation has the same cost
> !      as an addition.  */
>    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
>      {
>        enum tree_code use_code;
> --- 2281,2297 ----
>    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
>      return false;
>
> +   mode = TYPE_MODE (type);
> +
> +   if (!fma_cost[mode])
> +     {
> +       fma_cost[mode] = compute_costs (mode, FMA, speed);
> +       add_cost[mode] = compute_costs (mode, PLUS, speed);
> +       mul_cost[mode] = compute_costs (mode, MULT, speed);
> +     }
> +
>    /* Make sure that the multiplication statement becomes dead after
> !      the transformation, thus that all uses are transformed to FMAs.  */
>    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
>      {
>        enum tree_code use_code;
> *************** convert_mult_to_fma (gimple mul_stmt, tr
> *** 2292,2297 ****
> --- 2367,2373 ----
>        if (gimple_assign_rhs1 (use_stmt) == gimple_assign_rhs2 (use_stmt))
>        return false;
>
> +       uses++;
>        /* While it is possible to validate whether or not the exact form
>         that we've recognized is available in the backend, the assumption
>         is that the transformation is never a loss.  For instance, suppose
> *************** convert_mult_to_fma (gimple mul_stmt, tr
> *** 2302,2307 ****
> --- 2378,2389 ----
>         independant and could be run in parallel.  */
>      }
>
> +   /* Calculate the costs of moving the multiplication into all the
> +      minus/plus expressions.  */
> +
> +   if (uses * fma_cost[mode] > uses * add_cost[mode] + mul_cost[mode])
> +     return false;
> +
>    FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, mul_result)
>      {
>        gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
> Index: gcc/config/s390/s390.c
> ===================================================================
> *** gcc/config/s390/s390.c.orig
> --- gcc/config/s390/s390.c
> *************** struct processor_costs z196_cost =
> *** 242,249 ****
>    COSTS_N_INSNS (100),   /* SQXBR B+100 */
>    COSTS_N_INSNS (42),    /* SQDBR B+42 */
>    COSTS_N_INSNS (28),    /* SQEBR B+28 */
> !   COSTS_N_INSNS (1),     /* MADBR B */
> !   COSTS_N_INSNS (1),     /* MAEBR B */
>    COSTS_N_INSNS (101),   /* DXBR B+101 */
>    COSTS_N_INSNS (29),    /* DDBR */
>    COSTS_N_INSNS (22),    /* DEBR */
> --- 242,250 ----
>    COSTS_N_INSNS (100),   /* SQXBR B+100 */
>    COSTS_N_INSNS (42),    /* SQDBR B+42 */
>    COSTS_N_INSNS (28),    /* SQEBR B+28 */
> !   /* Cheaper than a mul+add but more expensive then a single mul/add.  */
> !   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MADBR B */
> !   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MAEBR B */
>    COSTS_N_INSNS (101),   /* DXBR B+101 */
>    COSTS_N_INSNS (29),    /* DDBR */
>    COSTS_N_INSNS (22),    /* DEBR */
>

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Georg-Johann Lay]

Richard Guenther wrote:
> On Wed, Jul 13, 2011 at 3:13 PM, Andreas Krebbel
> <krebbel@linux.vnet.ibm.com> wrote:
>> Hi,
>>
>> the widening_mul pass might increase the number of multiplications in
>> the code by transforming
>>
>> a = b * c
>> d = a + 2
>> e = a + 3
>>
>> into:
>>
>> d = b * c + 2
>> e = b * c + 3
>>
>> under the assumption that an FMA instruction is not more expensive
>> than a simple add.  This certainly isn't always true.  While e.g. on
>> s390 an fma is indeed not slower than an add execution-wise it has
>> disadvantages regarding instruction grouping.  It doesn't group with
>> any other instruction what has a major impact on the instruction
>> dispatch bandwidth.
>>
>> The following patch tries to figure out the costs for adds, mults and
>> fmas by building an RTX and asking the backends cost function in order
>> to estimate whether it is whorthwhile doing the transformation.
>>
>> With that patch the 436.cactus hotloop contains 28 less
>> multiplications than before increasing performance slightly (~2%).
>>
>> Bootstrapped and regtested on x86_64 and s390x.
> 
> Ick ;)
> 
> Maybe this is finally the time to introduce target hook(s) to
> get us back costs for trees?  For this case we'd need two
> actually, or just one - dependent on what finegrained information
> we pass.  Choices:
> 
>   tree_code_cost (enum tree_code)
>   tree_code_cost (enum tree_code, enum machine_mode mode)
>   unary_cost (enum tree_code, tree actual_arg0) // args will be mostly
> SSA names or constants, but at least they are typed - works for
> mixed-typed operations
>   binary_cost (...)
>   ...
>   unary_cost (enum tree_code, enum tree_code arg0_kind) // constant
> vs. non-constant arg, but lacks type/mode
> 
> Richard.

What's bad with rtx_costs?

Yet another cost function might duplicate cost computation in a backend --
once on trees and once on RTXs.

BTW: For a port I read rtx_costs from insn attributes which helped me to
clean up code in rtx_costs to a great extend.  In particular for a target
with complex instructions which are synthesized by insn combine, rtx_costs
is mostly mechanical and brain-dead retyping of bulk of code that is
already present almost identical in insn-recog.c.

Johann

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Steven Bosscher]

On Wed, Jul 13, 2011 at 4:34 PM, Richard Guenther
<richard.guenther@gmail.com> wrote:
> On Wed, Jul 13, 2011 at 3:13 PM, Andreas Krebbel
> <krebbel@linux.vnet.ibm.com> wrote:
>> Hi,
>>
>> the widening_mul pass might increase the number of multiplications in
>> the code by transforming
>>
>> a = b * c
>> d = a + 2
>> e = a + 3
>>
>> into:
>>
>> d = b * c + 2
>> e = b * c + 3
>>
>> under the assumption that an FMA instruction is not more expensive
>> than a simple add.  This certainly isn't always true.  While e.g. on
>> s390 an fma is indeed not slower than an add execution-wise it has
>> disadvantages regarding instruction grouping.  It doesn't group with
>> any other instruction what has a major impact on the instruction
>> dispatch bandwidth.
>>
>> The following patch tries to figure out the costs for adds, mults and
>> fmas by building an RTX and asking the backends cost function in order
>> to estimate whether it is whorthwhile doing the transformation.
>>
>> With that patch the 436.cactus hotloop contains 28 less
>> multiplications than before increasing performance slightly (~2%).
>>
>> Bootstrapped and regtested on x86_64 and s390x.
>
> Ick ;)

+1

> Maybe this is finally the time to introduce target hook(s) to
> get us back costs for trees?  For this case we'd need two
> actually, or just one - dependent on what finegrained information
> we pass.  Choices:
>
>  tree_code_cost (enum tree_code)
>  tree_code_cost (enum tree_code, enum machine_mode mode)
>  unary_cost (enum tree_code, tree actual_arg0) // args will be mostly
> SSA names or constants, but at least they are typed - works for
> mixed-typed operations
>  binary_cost (...)
>  ...
>  unary_cost (enum tree_code, enum tree_code arg0_kind) // constant
> vs. non-constant arg, but lacks type/mode

Or maybe add a cost function for all named insns (i.e.
http://gcc.gnu.org/onlinedocs/gccint/Standard-Names.html#Standard-Names)?
I think that any form of lower GIMPLE will not be so low level that
more combinations will exist than the available named patterns. It
should be possible to write a gen* tool using rtx_costs to compute
some useful cost metric for all named patterns. How complicated that
could be (modes, reg vs. mem, etc.), I don't know... But at least that
way we don't end up with multiple target costs depending on the IR in
use.

Ciao!
Steven

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Richard Guenther]

On Wed, Jul 13, 2011 at 11:49 PM, Steven Bosscher <stevenb.gcc@gmail.com> wrote:
> On Wed, Jul 13, 2011 at 4:34 PM, Richard Guenther
> <richard.guenther@gmail.com> wrote:
>> On Wed, Jul 13, 2011 at 3:13 PM, Andreas Krebbel
>> <krebbel@linux.vnet.ibm.com> wrote:
>>> Hi,
>>>
>>> the widening_mul pass might increase the number of multiplications in
>>> the code by transforming
>>>
>>> a = b * c
>>> d = a + 2
>>> e = a + 3
>>>
>>> into:
>>>
>>> d = b * c + 2
>>> e = b * c + 3
>>>
>>> under the assumption that an FMA instruction is not more expensive
>>> than a simple add.  This certainly isn't always true.  While e.g. on
>>> s390 an fma is indeed not slower than an add execution-wise it has
>>> disadvantages regarding instruction grouping.  It doesn't group with
>>> any other instruction what has a major impact on the instruction
>>> dispatch bandwidth.
>>>
>>> The following patch tries to figure out the costs for adds, mults and
>>> fmas by building an RTX and asking the backends cost function in order
>>> to estimate whether it is whorthwhile doing the transformation.
>>>
>>> With that patch the 436.cactus hotloop contains 28 less
>>> multiplications than before increasing performance slightly (~2%).
>>>
>>> Bootstrapped and regtested on x86_64 and s390x.
>>
>> Ick ;)
>
> +1
>
>> Maybe this is finally the time to introduce target hook(s) to
>> get us back costs for trees?  For this case we'd need two
>> actually, or just one - dependent on what finegrained information
>> we pass.  Choices:
>>
>>  tree_code_cost (enum tree_code)
>>  tree_code_cost (enum tree_code, enum machine_mode mode)
>>  unary_cost (enum tree_code, tree actual_arg0) // args will be mostly
>> SSA names or constants, but at least they are typed - works for
>> mixed-typed operations
>>  binary_cost (...)
>>  ...
>>  unary_cost (enum tree_code, enum tree_code arg0_kind) // constant
>> vs. non-constant arg, but lacks type/mode
>
> Or maybe add a cost function for all named insns (i.e.
> http://gcc.gnu.org/onlinedocs/gccint/Standard-Names.html#Standard-Names)?
> I think that any form of lower GIMPLE will not be so low level that
> more combinations will exist than the available named patterns. It
> should be possible to write a gen* tool using rtx_costs to compute
> some useful cost metric for all named patterns. How complicated that
> could be (modes, reg vs. mem, etc.), I don't know... But at least that
> way we don't end up with multiple target costs depending on the IR in
> use.

Yeah, it occured to me as well that when we look for supportable operations
via optabs the same mechanism should also be able to provide a cost,
maybe as simple as attaching one to the named expanders.

Generating RTL from GIMPLE passes just to be able to use rtx_cost is,
well ... gross.  Yes, we do it in IVOPTs (and that case is even more complex),
but I don't think we want to start doing it elsewhere (look how the vectorizer
for example uses new target hooks instead of generating vectorized RTL
and then using rtx_cost).

Richard.

> Ciao!
> Steven
>

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Steven Bosscher]

On Thu, Jul 14, 2011 at 11:40 AM, Richard Guenther
<richard.guenther@gmail.com> wrote:
> Generating RTL from GIMPLE passes just to be able to use rtx_cost is,
> well ... gross.

Indeed. And it is one of the major blockers for fully separating the
RTL, GIMPLE and target code off into separate modules. It would be
great to get rid of RTL from IVOPTS too...

Ciao!
Steven

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Andreas Krebbel]

On 07/14/2011 11:40 AM, Richard Guenther wrote:
> (look how the vectorizer
> for example uses new target hooks instead of generating vectorized RTL
> and then using rtx_cost).

But wouldn't we then end up with just a bunch of special purpose tree_cost functions
again?! Then we would again be doomed to duplicate rtx_cost logic on a different IR what
has already been considered to be a bad idea.

-Andreas-

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Andreas Krebbel]

On 07/13/2011 04:34 PM, Richard Guenther wrote:
> On Wed, Jul 13, 2011 at 3:13 PM, Andreas Krebbel
> <krebbel@linux.vnet.ibm.com> wrote:
>> Hi,
>>
>> the widening_mul pass might increase the number of multiplications in
>> the code by transforming
>>
>> a = b * c
>> d = a + 2
>> e = a + 3
>>
>> into:
>>
>> d = b * c + 2
>> e = b * c + 3
>>
>> under the assumption that an FMA instruction is not more expensive
>> than a simple add.  This certainly isn't always true.  While e.g. on
>> s390 an fma is indeed not slower than an add execution-wise it has
>> disadvantages regarding instruction grouping.  It doesn't group with
>> any other instruction what has a major impact on the instruction
>> dispatch bandwidth.
>>
>> The following patch tries to figure out the costs for adds, mults and
>> fmas by building an RTX and asking the backends cost function in order
>> to estimate whether it is whorthwhile doing the transformation.
>>
>> With that patch the 436.cactus hotloop contains 28 less
>> multiplications than before increasing performance slightly (~2%).
>>
>> Bootstrapped and regtested on x86_64 and s390x.
> 
> Ick ;)

Just to defend myself I did not invent this. I basically copied it over from ivopts.

> Maybe this is finally the time to introduce target hook(s) to
> get us back costs for trees?  For this case we'd need two
> actually, or just one - dependent on what finegrained information
> we pass.  Choices:

Having another target hook for costs actually doesn't look that much better to me.
Duplicating the logic is not really practical for backend developers.  We rather should
have a generic interface for calculating tree costs based on the rtx_cost hook.

Bye,

-Andreas-

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Richard Henderson]

On 07/13/2011 06:13 AM, Andreas Krebbel wrote:
> +       force_operand (gen_rtx_fmt_ee (code, mode,
> + 		       gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
> + 		       gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2)),
> + 		     NULL_RTX);
> +       break;
> +     case 3:
> +       /* FMA expressions are not handled by force_operand.  */
> +       expand_ternary_op (mode, fma_optab,
> + 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
> + 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2),
> + 			 gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 3),
> + 			 NULL_RTX, false);

Why the force_operand?  You've got register inputs.  Either the target
is going to support the operation or it isn't.

Seems to me you can check the availability of the operation in the 
optab and pass that gen_rtx_fmt_ee result to rtx_cost directly.

> +   bool speed = optimize_bb_for_speed_p (gimple_bb (mul_stmt));
> +   static unsigned mul_cost[NUM_MACHINE_MODES];
> +   static unsigned add_cost[NUM_MACHINE_MODES];
> +   static unsigned fma_cost[NUM_MACHINE_MODES];
...
> +   if (!fma_cost[mode])
> +     {
> +       fma_cost[mode] = compute_costs (mode, FMA, speed);
> +       add_cost[mode] = compute_costs (mode, PLUS, speed);
> +       mul_cost[mode] = compute_costs (mode, MULT, speed);
> +     }

Saving cost data dependent on speed, which is non-constant.
You probably need to make this a two dimensional array.


r~

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Andreas Krebbel]

On 07/13/2011 06:58 PM, Richard Henderson wrote:
> Why the force_operand?  You've got register inputs.  Either the target
> is going to support the operation or it isn't.
> Seems to me you can check the availability of the operation in the 
> optab and pass that gen_rtx_fmt_ee result to rtx_cost directly.

Do I really need to check optab for availability at this point? For FMA
convert_mult_to_fma already did the check.  But what to do if no optab is available for
add/mul? Assume extraordinary high costs? This probably wouldn't make sense since it would
make a mul or add more expensive than an fma. Or perhaps the rtx_cost hooks should handle
that by returning high costs for everything the backend is not able to implement directly?

>> +   bool speed = optimize_bb_for_speed_p (gimple_bb (mul_stmt));
>> +   static unsigned mul_cost[NUM_MACHINE_MODES];
>> +   static unsigned add_cost[NUM_MACHINE_MODES];
>> +   static unsigned fma_cost[NUM_MACHINE_MODES];
> ...
>> +   if (!fma_cost[mode])
>> +     {
>> +       fma_cost[mode] = compute_costs (mode, FMA, speed);
>> +       add_cost[mode] = compute_costs (mode, PLUS, speed);
>> +       mul_cost[mode] = compute_costs (mode, MULT, speed);
>> +     }
> 
> Saving cost data dependent on speed, which is non-constant.
> You probably need to make this a two dimensional array.
Right. I'll fix this.

Bye,

-Andreas-

Re: [PATCH] widening_mul: Do cost check when propagating mult into plus/minus expressions

[Andreas Krebbel]

On Wed, Jul 13, 2011 at 09:58:08AM -0700, Richard Henderson wrote:
> Why the force_operand?  You've got register inputs.  Either the target
> is going to support the operation or it isn't.

I agree that it doesn't seem to be necessary. I've used force_operand
since ivopts (add_cost) is doing it without seeing a clear reason for
it.  So I've removed it now.

> Saving cost data dependent on speed, which is non-constant.
> You probably need to make this a two dimensional array.

Fixed.

Here is an updated version.

Bye,

-Andreas-

2011-07-14  Andreas Krebbel  <Andreas.Krebbel@de.ibm.com>

	* tree-ssa-math-opts.c (compute_costs): New function.
	(convert_mult_to_fma): Take costs into account when propagating
	multiplications into several additions.
	* config/s390/s390.c (z196_costs): Adjust costs for madbr and
	maebr.


Index: gcc/tree-ssa-math-opts.c
===================================================================
*** gcc/tree-ssa-math-opts.c.orig
--- gcc/tree-ssa-math-opts.c
*************** convert_plusminus_to_widen (gimple_stmt_
*** 2185,2190 ****
--- 2185,2236 ----
    return true;
  }
  
+ /* Computing the costs for calculating RTX with CODE in MODE.  */
+ 
+ static unsigned
+ compute_costs (enum machine_mode mode, enum rtx_code code, bool speed)
+ {
+   rtx insn;
+   unsigned cost;
+ 
+   switch (GET_RTX_LENGTH (code))
+     {
+     case 2:
+       insn = gen_rtx_fmt_ee (code, mode,
+ 			     gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
+ 			     gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2));
+       break;
+     case 3:
+       insn = gen_rtx_fmt_eee (code, mode,
+ 			      gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 1),
+ 			      gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 2),
+ 			      gen_raw_REG (mode, LAST_VIRTUAL_REGISTER + 3));
+       break;
+     default:
+       gcc_unreachable ();
+     }
+ 
+   if (dump_file && (dump_flags & TDF_DETAILS))
+     {
+       fprintf (dump_file, "Calculating costs of %s in %s mode.  RTX is:\n",
+ 	       GET_RTX_NAME (code), GET_MODE_NAME (mode));
+       print_rtl (dump_file, insn);
+     }
+ 
+   cost = rtx_cost (insn, SET, speed);
+ 
+   /* If the backend returns a cost of zero it is most certainly lying.
+      Set this to one in order to notice that we already calculated it
+      once.  */
+   cost = cost ? cost : 1;
+ 
+   if (dump_file && (dump_flags & TDF_DETAILS))
+     fprintf (dump_file, "\n%s in %s costs %d\n\n",
+ 	       GET_RTX_NAME (code), GET_MODE_NAME (mode), cost);
+ 
+   return cost;
+ }
+ 
  /* Combine the multiplication at MUL_STMT with operands MULOP1 and MULOP2
     with uses in additions and subtractions to form fused multiply-add
     operations.  Returns true if successful and MUL_STMT should be removed.  */
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2197,2202 ****
--- 2243,2254 ----
    gimple use_stmt, neguse_stmt, fma_stmt;
    use_operand_p use_p;
    imm_use_iterator imm_iter;
+   enum machine_mode mode;
+   int uses = 0;
+   bool speed = optimize_bb_for_speed_p (gimple_bb (mul_stmt));
+   static unsigned mul_cost[2][NUM_MACHINE_MODES];
+   static unsigned add_cost[2][NUM_MACHINE_MODES];
+   static unsigned fma_cost[2][NUM_MACHINE_MODES];
  
    if (FLOAT_TYPE_P (type)
        && flag_fp_contract_mode == FP_CONTRACT_OFF)
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2213,2222 ****
    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
      return false;
  
    /* Make sure that the multiplication statement becomes dead after
!      the transformation, thus that all uses are transformed to FMAs.
!      This means we assume that an FMA operation has the same cost
!      as an addition.  */
    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
      {
        enum tree_code use_code;
--- 2265,2281 ----
    if (optab_handler (fma_optab, TYPE_MODE (type)) == CODE_FOR_nothing)
      return false;
  
+   mode = TYPE_MODE (type);
+ 
+   if (!fma_cost[speed][mode])
+     {
+       fma_cost[speed][mode] = compute_costs (mode, FMA, speed);
+       add_cost[speed][mode] = compute_costs (mode, PLUS, speed);
+       mul_cost[speed][mode] = compute_costs (mode, MULT, speed);
+     }
+ 
    /* Make sure that the multiplication statement becomes dead after
!      the transformation, thus that all uses are transformed to FMAs.  */
    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, mul_result)
      {
        enum tree_code use_code;
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2292,2297 ****
--- 2351,2357 ----
        if (gimple_assign_rhs1 (use_stmt) == gimple_assign_rhs2 (use_stmt))
  	return false;
  
+       uses++;
        /* While it is possible to validate whether or not the exact form
  	 that we've recognized is available in the backend, the assumption
  	 is that the transformation is never a loss.  For instance, suppose
*************** convert_mult_to_fma (gimple mul_stmt, tr
*** 2302,2307 ****
--- 2362,2374 ----
  	 independant and could be run in parallel.  */
      }
  
+   /* Calculate the costs of moving the multiplication into all the
+      minus/plus expressions.  */
+ 
+   if (uses * fma_cost[speed][mode] >
+       uses * add_cost[speed][mode] + mul_cost[speed][mode])
+     return false;
+ 
    FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, mul_result)
      {
        gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
Index: gcc/config/s390/s390.c
===================================================================
*** gcc/config/s390/s390.c.orig
--- gcc/config/s390/s390.c
*************** struct processor_costs z196_cost =
*** 242,249 ****
    COSTS_N_INSNS (100),   /* SQXBR B+100 */
    COSTS_N_INSNS (42),    /* SQDBR B+42 */
    COSTS_N_INSNS (28),    /* SQEBR B+28 */
!   COSTS_N_INSNS (1),     /* MADBR B */
!   COSTS_N_INSNS (1),     /* MAEBR B */
    COSTS_N_INSNS (101),   /* DXBR B+101 */
    COSTS_N_INSNS (29),    /* DDBR */
    COSTS_N_INSNS (22),    /* DEBR */
--- 242,250 ----
    COSTS_N_INSNS (100),   /* SQXBR B+100 */
    COSTS_N_INSNS (42),    /* SQDBR B+42 */
    COSTS_N_INSNS (28),    /* SQEBR B+28 */
!   /* Cheaper than a mul+add but more expensive then a single mul/add.  */
!   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MADBR B */
!   COSTS_N_INSNS (1) + COSTS_N_INSNS (1) / 2, /* MAEBR B */
    COSTS_N_INSNS (101),   /* DXBR B+101 */
    COSTS_N_INSNS (29),    /* DDBR */
    COSTS_N_INSNS (22),    /* DEBR */