aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRichard Henderson <rth@redhat.com>2003-02-11 22:14:12 -0800
committerRichard Henderson <rth@gcc.gnu.org>2003-02-11 22:14:12 -0800
commitceda50e9d5a000988c6403fe9113ef3c51bfc443 (patch)
treecb108ff180f54437c43e9496f22a4b4db03a0ff9
parentcc687dae1d8838b25e9e535de5f235e8fc0d66ab (diff)
downloadgcc-ceda50e9d5a000988c6403fe9113ef3c51bfc443.zip
gcc-ceda50e9d5a000988c6403fe9113ef3c51bfc443.tar.gz
gcc-ceda50e9d5a000988c6403fe9113ef3c51bfc443.tar.bz2
gcse.c (lookup_set): Remove unused argument PAT.
* gcse.c (lookup_set): Remove unused argument PAT. Update both callers. From-SVN: r62759
-rw-r--r--gcc/ChangeLog5
-rw-r--r--gcc/gcse.c26
2 files changed, 13 insertions, 18 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 96d364e..ccd5b58 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2003-02-11 Richard Henderson <rth@redhat.com>
+
+ * gcse.c (lookup_set): Remove unused argument PAT. Update
+ both callers.
+
2003-02-11 Geoffrey Keating <geoffk@apple.com>
* diagnostic.c (real_abort): New.
diff --git a/gcc/gcse.c b/gcc/gcse.c
index 2cc7f0b..7389661 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -593,7 +593,7 @@ static void compute_hash_table_work PARAMS ((struct hash_table *));
static void dump_hash_table PARAMS ((FILE *, const char *,
struct hash_table *));
static struct expr *lookup_expr PARAMS ((rtx, struct hash_table *));
-static struct expr *lookup_set PARAMS ((unsigned int, rtx, struct hash_table *));
+static struct expr *lookup_set PARAMS ((unsigned int, struct hash_table *));
static struct expr *next_set PARAMS ((unsigned int, struct expr *));
static void reset_opr_set_tables PARAMS ((void));
static int oprs_not_set_p PARAMS ((rtx, rtx));
@@ -2641,14 +2641,12 @@ lookup_expr (pat, table)
return expr;
}
-/* Lookup REGNO in the set TABLE. If PAT is non-NULL look for the entry that
- matches it, otherwise return the first entry for REGNO. The result is a
- pointer to the table entry, or NULL if not found. */
+/* Lookup REGNO in the set TABLE. The result is a pointer to the
+ table entry, or NULL if not found. */
static struct expr *
-lookup_set (regno, pat, table)
+lookup_set (regno, table)
unsigned int regno;
- rtx pat;
struct hash_table *table;
{
unsigned int hash = hash_set (regno, table->size);
@@ -2656,16 +2654,8 @@ lookup_set (regno, pat, table)
expr = table->table[hash];
- if (pat)
- {
- while (expr && ! expr_equiv_p (expr->expr, pat))
- expr = expr->next_same_hash;
- }
- else
- {
- while (expr && REGNO (SET_DEST (expr->expr)) != regno)
- expr = expr->next_same_hash;
- }
+ while (expr && REGNO (SET_DEST (expr->expr)) != regno)
+ expr = expr->next_same_hash;
return expr;
}
@@ -3997,7 +3987,7 @@ find_avail_set (regno, insn)
while (1)
{
rtx src;
- struct expr *set = lookup_set (regno, NULL_RTX, &set_hash_table);
+ struct expr *set = lookup_set (regno, &set_hash_table);
/* Find a set that is available at the start of the block
which contains INSN. */
@@ -4727,7 +4717,7 @@ find_bypass_set (regno, bb)
for (;;)
{
rtx src;
- struct expr *set = lookup_set (regno, NULL_RTX, &set_hash_table);
+ struct expr *set = lookup_set (regno, &set_hash_table);
while (set)
{