From b72d459f396af780bd6506f992b421663c4bb676 Mon Sep 17 00:00:00 2001 From: rsandifo Date: Thu, 18 Aug 2011 12:36:51 +0000 Subject: 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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@177850 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/loop-invariant.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'gcc/loop-invariant.c') diff --git a/gcc/loop-invariant.c b/gcc/loop-invariant.c index b9238a9554f..61ca446f079 100644 --- a/gcc/loop-invariant.c +++ b/gcc/loop-invariant.c @@ -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. -- cgit v1.2.3