expmed.c (synth_mult): Initialize latency.

	* expmed.c (synth_mult): Initialize latency.  Check cost before
	checking ops count.

From-SVN: r87456

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 5609638157f9bb36890dac7f859024c9c0ef35ab..419c409633cb5f00830d3b7672574fa333794ead 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2004-09-13  Daniel Jacobowitz  <dan@debian.org>
+
+       * expmed.c (synth_mult): Initialize latency.  Check cost before
+       checking ops count.
+
 2004-09-26  Kenneth Zadeck  <Kenneth.Zadeck@NaturalBridge.com>
 
 

diff --git a/gcc/expmed.c b/gcc/expmed.c
index eb8226da75f35294fc9e5340f7e067c6231fa85c..232381f2c5ab2210f8ab685d89430a50ff8f2be7 100644 (file)
--- a/gcc/expmed.c
+++ b/gcc/expmed.c
@@ -2247,6 +2247,7 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
   /* Indicate that no algorithm is yet found.  If no algorithm
      is found, this value will be returned and indicate failure.  */
   alg_out->cost.cost = cost_limit->cost + 1;
+  alg_out->cost.latency = cost_limit->latency + 1;
 
   if (cost_limit->cost < 0
       || (cost_limit->cost == 0 && cost_limit->latency <= 0))
@@ -2516,15 +2517,15 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
        }
     }
 
+  /* If best_cost has not decreased, we have not found any algorithm.  */
+  if (!CHEAPER_MULT_COST (&best_cost, cost_limit))
+    return;
+
   /* If we are getting a too long sequence for `struct algorithm'
      to record, make this search fail.  */
   if (best_alg->ops == MAX_BITS_PER_WORD)
     return;
 
-  /* If best_cost has not decreased, we have not found any algorithm.  */
-  if (!CHEAPER_MULT_COST (&best_cost, cost_limit))
-    return;
-
   /* Copy the algorithm from temporary space to the space at alg_out.
      We avoid using structure assignment because the majority of
      best_alg is normally undefined, and this is a critical function.  */