re PR middle-end/15239 (suboptimal mult-by-const expansion cost limit)

	PR middle-end/15239
	* expmed.c (expand_mult): Remove artificial restriction on the
	maximum cost of a synthetic multiplication sequence.

From-SVN: r83610

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index a08ab3f5d6ab51a617148379ac9a58a25b9082de..d0c4473c01b39a306b7bd8465654ca6049131407 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2004-06-24  Roger Sayle  <roger@eyesopen.com>
+
+       PR middle-end/15239
+       * expmed.c (expand_mult): Remove artificial restriction on the
+       maximum cost of a synthetic multiplication sequence.
+
 2004-06-24  Eric Christopher  <echristo@redhat.com>
 
        * combine.c (distribute_notes): Don't delete sets to

diff --git a/gcc/expmed.c b/gcc/expmed.c
index ae76695a133b7dc15e60bfccd5deb7bf014ae397..c8625036425666c0409990acb834b0bdd7717f76 100644 (file)
--- a/gcc/expmed.c
+++ b/gcc/expmed.c
@@ -2664,7 +2664,6 @@ expand_mult (enum machine_mode mode, rtx op0, rtx op1, rtx target,
       && (unsignedp || !flag_trapv))
     {
       int mult_cost = rtx_cost (gen_rtx_MULT (mode, op0, op1), SET);
-      mult_cost = MIN (12 * add_cost[mode], mult_cost);
 
       if (choose_mult_variant (mode, INTVAL (const_op1), &algorithm, &variant,
                               mult_cost))