TeamHeptaMirrors/gcc
1
0
Fork 1
mirror of https://github.com/gcc-mirror/gcc.git synced 2026-05-06 23:25:24 +02:00
Code Issues Packages Projects Releases Wiki Activity

re PR target/62631 (gcc.dg/tree-ssa/ivopts-lt-2.c FAILs)

Browse Source 
PR target/62631
	* tree-ssa-loop-ivopts.c (get_shiftadd_cost): Use the mininum of costs
	of shift-add and (add + shift) operations.  Rename local variable.

From-SVN: r220473
This commit is contained in:
Eric Botcazou
2015-02-06 11:17:46 +00:00
committed by Eric Botcazou
parent 9f9ab303f7
commit 9fb87eb0bb
2 changed files with 17 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@@ -1,3 +1,9 @@
2015-02-06 Eric Botcazou <ebotcazou@adacore.com>
PR target/62631
* tree-ssa-loop-ivopts.c (get_shiftadd_cost): Use the mininum of costs
of shift-add and (add + shift) operations. Rename local variable.
2015-02-05 Jeff Law <law@redhat.com>
PR target/17306

18
gcc/tree-ssa-loop-ivopts.c
View File

@@ -3597,22 +3597,26 @@ get_shiftadd_cost (tree expr, machine_mode mode, comp_cost cost0,
tree multop = TREE_OPERAND (mult, 0);
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;
int as_cost, sa_cost;
bool mult_in_op1;
if (!(m >= 0 && m < maxm))
return false;
if (operand_equal_p (op1, mult, 0))
equal_p = true;
mult_in_op1 = operand_equal_p (op1, mult, 0);
as_cost = add_cost (speed, mode) + shift_cost (speed, mode, m);
/* If the target has a cheap shift-and-add or shift-and-sub instruction,
use that in preference to a shift insn followed by an add insn. */
sa_cost = (TREE_CODE (expr) != MINUS_EXPR
? shiftadd_cost (speed, mode, m)
: (equal_p
: (mult_in_op1
? shiftsub1_cost (speed, mode, m)
: shiftsub0_cost (speed, mode, m)));
res = new_cost (sa_cost, 0);
res = add_costs (res, equal_p ? cost0 : cost1);
res = new_cost (MIN (as_cost, sa_cost), 0);
res = add_costs (res, mult_in_op1 ? cost0 : cost1);
STRIP_NOPS (multop);
if (!is_gimple_val (multop))