OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

rtl.h (set_rtx_cost, [...]): New functions.

Browse Source 
gcc/
	* rtl.h (set_rtx_cost, get_full_set_rtx_cost): New functions.
	* auto-inc-dec.c (attempt_change): Use set_rtx_cost.
	* cfgloopanal.c (seq_cost): Likewise.
	* loop-invariant.c (create_new_invariant): Likewise.
	* postreload.c (move2add_use_add2_insn, move2add_use_add3_insn)
	(reload_cse_move2add): Use get_full_set_rtx_cost.

From-SVN: r177850
This commit is contained in:
Richard Sandiford 2011-08-18 12:36:51 +00:00 committed by Richard Sandiford
parent fdb4f31533
commit d51102f3e7
6 changed files with 35 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
gcc/ChangeLog
View File

@ -1,3 +1,12 @@
2011-08-18 Richard Sandiford <richard.sandiford@linaro.org>
* rtl.h (set_rtx_cost, get_full_set_rtx_cost): New functions.
* auto-inc-dec.c (attempt_change): Use set_rtx_cost.
* cfgloopanal.c (seq_cost): Likewise.
* loop-invariant.c (create_new_invariant): Likewise.
* postreload.c (move2add_use_add2_insn, move2add_use_add3_insn)
(reload_cse_move2add): Use get_full_set_rtx_cost.
2011-08-18 Richard Guenther <rguenther@suse.de>
* expr.c (get_inner_reference): Fix typo in last change.

2
gcc/auto-inc-dec.c
View File

@ -484,7 +484,7 @@ attempt_change (rtx new_addr, rtx inc_reg)
XEXP (mem_tmp, 0) = new_addr;
old_cost = (rtx_cost (mem, SET, speed)
+ rtx_cost (PATTERN (inc_insn.insn), SET, speed));
+ set_rtx_cost (PATTERN (inc_insn.insn), speed));
new_cost = rtx_cost (mem_tmp, SET, speed);
/* The first item of business is to see if this is profitable. */

2
gcc/cfgloopanal.c
View File

@ -314,7 +314,7 @@ seq_cost (const_rtx seq, bool speed)
{
set = single_set (seq);
if (set)
cost += rtx_cost (set, SET, speed);
cost += set_rtx_cost (set, speed);
else
cost++;
}

2
gcc/loop-invariant.c
View File

@ -704,7 +704,7 @@ create_new_invariant (struct def *def, rtx insn, bitmap depends_on,
the loop. Otherwise we save only cost of the computation. */
if (def)
{
inv->cost = rtx_cost (set, SET, speed);
inv->cost = set_rtx_cost (set, speed);
/* ??? Try to determine cheapness of address computation. Unfortunately
the address cost is only a relative measure, we can't really compare
it with any absolute number, but only with other address costs.

10
gcc/postreload.c
View File

@ -1683,9 +1683,9 @@ move2add_use_add2_insn (rtx reg, rtx sym, rtx off, rtx insn)
struct full_rtx_costs oldcst, newcst;
rtx tem = gen_rtx_PLUS (GET_MODE (reg), reg, new_src);
get_full_rtx_cost (pat, SET, &oldcst);
get_full_set_rtx_cost (pat, &oldcst);
SET_SRC (pat) = tem;
get_full_rtx_cost (pat, SET, &newcst);
get_full_set_rtx_cost (pat, &newcst);
SET_SRC (pat) = src;
if (costs_lt_p (&newcst, &oldcst, speed)
@ -1752,7 +1752,7 @@ move2add_use_add3_insn (rtx reg, rtx sym, rtx off, rtx insn)
rtx plus_expr;
init_costs_to_max (&mincst);
get_full_rtx_cost (pat, SET, &oldcst);
get_full_set_rtx_cost (pat, &oldcst);
plus_expr = gen_rtx_PLUS (GET_MODE (reg), reg, const0_rtx);
SET_SRC (pat) = plus_expr;
@ -1781,7 +1781,7 @@ move2add_use_add3_insn (rtx reg, rtx sym, rtx off, rtx insn)
else
{
XEXP (plus_expr, 1) = new_src;
get_full_rtx_cost (pat, SET, &newcst);
get_full_set_rtx_cost (pat, &newcst);
if (costs_lt_p (&newcst, &mincst, speed))
{
@ -1934,7 +1934,7 @@ reload_cse_move2add (rtx first)
struct full_rtx_costs oldcst, newcst;
rtx tem = gen_rtx_PLUS (GET_MODE (reg), reg, new_src);
get_full_rtx_cost (set, SET, &oldcst);
get_full_set_rtx_cost (set, &oldcst);
SET_SRC (set) = tem;
get_full_rtx_cost (tem, SET, &newcst);
SET_SRC (set) = old_src;

18
gcc/rtl.h
View File

@ -1217,6 +1217,24 @@ extern bool constant_pool_constant_p (rtx);
extern bool truncated_to_mode (enum machine_mode, const_rtx);
extern int low_bitmask_len (enum machine_mode, unsigned HOST_WIDE_INT);
#ifndef GENERATOR_FILE
/* Return the cost of SET X. SPEED_P is true if optimizing for speed
rather than size. */
static inline int
set_rtx_cost (rtx x, bool speed_p)
{
return rtx_cost (x, INSN, speed_p);
}
/* Like set_rtx_cost, but return both the speed and size costs in C. */
static inline void
get_full_set_rtx_cost (rtx x, struct full_rtx_costs *c)
{
get_full_rtx_cost (x, INSN, c);
}
#endif
/* 1 if RTX is a subreg containing a reg that is already known to be
sign- or zero-extended from the mode of the subreg to the mode of