aboutsummaryrefslogtreecommitdiff
path: root/gcc/cse.c
diff options
context:
space:
mode:
authorRichard Henderson <rth@gcc.gnu.org>2003-01-28 13:29:40 -0800
committerRichard Henderson <rth@gcc.gnu.org>2003-01-28 13:29:40 -0800
commite37135f7010aea36f9422bfb9e2ba38b04d0e8e7 (patch)
treebdbb4986ff84247e9b2f94305ae5bb79826c5bee /gcc/cse.c
parent4334c467a104d806de482e3e3b3058dc9de91540 (diff)
downloadgcc-e37135f7010aea36f9422bfb9e2ba38b04d0e8e7.zip
gcc-e37135f7010aea36f9422bfb9e2ba38b04d0e8e7.tar.gz
gcc-e37135f7010aea36f9422bfb9e2ba38b04d0e8e7.tar.bz2
* cse.c (find_best_addr): Kill !ADDRESS_COST code.
From-SVN: r62008
Diffstat (limited to 'gcc/cse.c')
-rw-r--r--gcc/cse.c32
1 files changed, 6 insertions, 26 deletions
diff --git a/gcc/cse.c b/gcc/cse.c
index 59253a9..d9e9fada 100644
--- a/gcc/cse.c
+++ b/gcc/cse.c
@@ -2870,13 +2870,12 @@ canon_reg (x, insn)
is a good approximation for that cost. However, most RISC machines have
only a few (usually only one) memory reference formats. If an address is
valid at all, it is often just as cheap as any other address. Hence, for
- RISC machines, we use the configuration macro `ADDRESS_COST' to compare the
- costs of various addresses. For two addresses of equal cost, choose the one
- with the highest `rtx_cost' value as that has the potential of eliminating
- the most insns. For equal costs, we choose the first in the equivalence
- class. Note that we ignore the fact that pseudo registers are cheaper
- than hard registers here because we would also prefer the pseudo registers.
- */
+ RISC machines, we use `address_cost' to compare the costs of various
+ addresses. For two addresses of equal cost, choose the one with the
+ highest `rtx_cost' value as that has the potential of eliminating the
+ most insns. For equal costs, we choose the first in the equivalence
+ class. Note that we ignore the fact that pseudo registers are cheaper than
+ hard registers here because we would also prefer the pseudo registers. */
static void
find_best_addr (insn, loc, mode)
@@ -2886,10 +2885,8 @@ find_best_addr (insn, loc, mode)
{
struct table_elt *elt;
rtx addr = *loc;
-#ifdef ADDRESS_COST
struct table_elt *p;
int found_better = 1;
-#endif
int save_do_not_record = do_not_record;
int save_hash_arg_in_memory = hash_arg_in_memory;
int addr_volatile;
@@ -2953,22 +2950,6 @@ find_best_addr (insn, loc, mode)
elt = lookup (addr, hash, Pmode);
-#ifndef ADDRESS_COST
- if (elt)
- {
- int our_cost = elt->cost;
-
- /* Find the lowest cost below ours that works. */
- for (elt = elt->first_same_value; elt; elt = elt->next_same_value)
- if (elt->cost < our_cost
- && (GET_CODE (elt->exp) == REG
- || exp_equiv_p (elt->exp, elt->exp, 1, 0))
- && validate_change (insn, loc,
- canon_reg (copy_rtx (elt->exp), NULL_RTX), 0))
- return;
- }
-#else
-
if (elt)
{
/* We need to find the best (under the criteria documented above) entry
@@ -3099,7 +3080,6 @@ find_best_addr (insn, loc, mode)
}
}
}
-#endif
}
/* Given an operation (CODE, *PARG1, *PARG2), where code is a comparison