the table, unlink the matching entry. */
static void *
-hash_find_entry (Hash_table *table, const void *entry,
- struct hash_entry **bucket_head, bool delete)
+find_entry (Hash_table *table, const void *entry,
+ struct hash_entry **bucket_head, bool delete)
{
struct hash_entry *bucket = safe_hasher (table, entry);
struct hash_entry *cursor;
struct hash_entry *bucket;
/* The caller cannot insert a NULL entry, since hash_lookup returns NULL
- to indicate "not found", and hash_find_entry uses "bucket->data == NULL"
+ to indicate "not found", and find_entry uses "bucket->data == NULL"
to indicate an empty bucket. */
if (! entry)
abort ();
/* If there's a matching entry already in the table, return that. */
- if ((data = hash_find_entry (table, entry, &bucket, false)) != NULL)
+ if ((data = find_entry (table, entry, &bucket, false)) != NULL)
{
if (matched_ent)
*matched_ent = data;
return -1;
/* Update the bucket we are interested in. */
- if (hash_find_entry (table, entry, &bucket, false) != NULL)
+ if (find_entry (table, entry, &bucket, false) != NULL)
abort ();
}
}
void *data;
struct hash_entry *bucket;
- data = hash_find_entry (table, entry, &bucket, true);
+ data = find_entry (table, entry, &bucket, true);
if (!data)
return NULL;