From 1a1a55342cdeae4d1431b2b0c6c753939b8f1d4d Mon Sep 17 00:00:00 2001 From: Bin Cheng Date: Thu, 7 Nov 2013 08:34:02 +0000 Subject: [PATCH] tree-ssa-loop-ivopts.c (get_shiftadd_cost): Check equality using operand_equal_p. * tree-ssa-loop-ivopts.c (get_shiftadd_cost): Check equality using operand_equal_p. From-SVN: r204498 --- gcc/ChangeLog | 5 +++++ gcc/tree-ssa-loop-ivopts.c | 8 ++++++-- 2 files changed, 11 insertions(+), 2 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index fcbcbb5466f9..89ce09751e6c 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2013-11-07 Bin Cheng + + * tree-ssa-loop-ivopts.c (get_shiftadd_cost): Check equality + using operand_equal_p. + 2013-11-07 Bin Cheng * tree-ssa-loop-ivopts.c (alloc_iv): Lower address expressions. diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index 220aae6878b7..f7da12674161 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -3500,17 +3500,21 @@ get_shiftadd_cost (tree expr, enum machine_mode mode, comp_cost cost0, int m = exact_log2 (int_cst_value (cst)); int maxm = MIN (BITS_PER_WORD, GET_MODE_BITSIZE (mode)); int sa_cost; + bool equal_p = false; if (!(m >= 0 && m < maxm)) return false; + if (operand_equal_p (op1, mult, 0)) + equal_p = true; + sa_cost = (TREE_CODE (expr) != MINUS_EXPR ? shiftadd_cost (speed, mode, m) - : (mult == op1 + : (equal_p ? shiftsub1_cost (speed, mode, m) : shiftsub0_cost (speed, mode, m))); res = new_cost (sa_cost, 0); - res = add_costs (res, mult == op1 ? cost0 : cost1); + res = add_costs (res, equal_p ? cost0 : cost1); STRIP_NOPS (multop); if (!is_gimple_val (multop)) -- 2.43.5