aboutsummaryrefslogtreecommitdiff
path: root/gas/hash.c
diff options
context:
space:
mode:
authorKazu Hirata <kazu@codesourcery.com>2003-11-24 03:37:58 +0000
committerKazu Hirata <kazu@codesourcery.com>2003-11-24 03:37:58 +0000
commitb1f1fa963c3c1e6deb8e8cf0651ce993e2b94a3c (patch)
tree322dacc8d73d100710a2691c119d9c1db35092a2 /gas/hash.c
parentc765be85d5b6c0d20915c4c69c62f75d2d7fad49 (diff)
downloadgdb-b1f1fa963c3c1e6deb8e8cf0651ce993e2b94a3c.zip
gdb-b1f1fa963c3c1e6deb8e8cf0651ce993e2b94a3c.tar.gz
gdb-b1f1fa963c3c1e6deb8e8cf0651ce993e2b94a3c.tar.bz2
* hash.c: Convert to ISO-C.
* hash.h: Likewise. * input-file.c: Likewise. * input-file.h: Likewise. * input-scrub.c: Likewise. * itbl-ops.c: Likewise. * itbl-ops.h: Likewise.
Diffstat (limited to 'gas/hash.c')
-rw-r--r--gas/hash.c55
1 files changed, 18 insertions, 37 deletions
diff --git a/gas/hash.c b/gas/hash.c
index 2faeba9..a7b8298 100644
--- a/gas/hash.c
+++ b/gas/hash.c
@@ -75,7 +75,7 @@ struct hash_control {
/* Create a hash table. This return a control block. */
struct hash_control *
-hash_new ()
+hash_new (void)
{
unsigned int size;
struct hash_control *ret;
@@ -105,8 +105,7 @@ hash_new ()
/* Delete a hash table, freeing all allocated memory. */
void
-hash_die (table)
- struct hash_control *table;
+hash_die (struct hash_control *table)
{
obstack_free (&table->memory, 0);
free (table);
@@ -121,17 +120,14 @@ hash_die (table)
Each time we look up a string, we move it to the start of the list
for its hash code, to take advantage of referential locality. */
-static struct hash_entry *hash_lookup PARAMS ((struct hash_control *,
- const char *,
- struct hash_entry ***,
- unsigned long *));
+static struct hash_entry *hash_lookup (struct hash_control *,
+ const char *,
+ struct hash_entry ***,
+ unsigned long *);
static struct hash_entry *
-hash_lookup (table, key, plist, phash)
- struct hash_control *table;
- const char *key;
- struct hash_entry ***plist;
- unsigned long *phash;
+hash_lookup (struct hash_control *table, const char *key,
+ struct hash_entry ***plist, unsigned long *phash)
{
register unsigned long hash;
unsigned int len;
@@ -205,10 +201,7 @@ hash_lookup (table, key, plist, phash)
hash table. */
const char *
-hash_insert (table, key, value)
- struct hash_control *table;
- const char *key;
- PTR value;
+hash_insert (struct hash_control *table, const char *key, PTR value)
{
struct hash_entry *p;
struct hash_entry **list;
@@ -238,10 +231,7 @@ hash_insert (table, key, value)
error. If an entry already exists, its value is replaced. */
const char *
-hash_jam (table, key, value)
- struct hash_control *table;
- const char *key;
- PTR value;
+hash_jam (struct hash_control *table, const char *key, PTR value)
{
struct hash_entry *p;
struct hash_entry **list;
@@ -279,10 +269,7 @@ hash_jam (table, key, value)
table, this does nothing and returns NULL. */
PTR
-hash_replace (table, key, value)
- struct hash_control *table;
- const char *key;
- PTR value;
+hash_replace (struct hash_control *table, const char *key, PTR value)
{
struct hash_entry *p;
PTR ret;
@@ -306,9 +293,7 @@ hash_replace (table, key, value)
if the entry is not found. */
PTR
-hash_find (table, key)
- struct hash_control *table;
- const char *key;
+hash_find (struct hash_control *table, const char *key)
{
struct hash_entry *p;
@@ -323,9 +308,7 @@ hash_find (table, key)
for that entry, or NULL if there is no such entry. */
PTR
-hash_delete (table, key)
- struct hash_control *table;
- const char *key;
+hash_delete (struct hash_control *table, const char *key)
{
struct hash_entry *p;
struct hash_entry **list;
@@ -354,9 +337,8 @@ hash_delete (table, key)
hash table. */
void
-hash_traverse (table, pfn)
- struct hash_control *table;
- void (*pfn) PARAMS ((const char *key, PTR value));
+hash_traverse (struct hash_control *table,
+ void (*pfn) (const char *key, PTR value))
{
unsigned int i;
@@ -373,10 +355,9 @@ hash_traverse (table, pfn)
name of the hash table, used for printing a header. */
void
-hash_print_statistics (f, name, table)
- FILE *f ATTRIBUTE_UNUSED;
- const char *name ATTRIBUTE_UNUSED;
- struct hash_control *table ATTRIBUTE_UNUSED;
+hash_print_statistics (FILE *f ATTRIBUTE_UNUSED,
+ const char *name ATTRIBUTE_UNUSED,
+ struct hash_control *table ATTRIBUTE_UNUSED)
{
#ifdef HASH_STATISTICS
unsigned int i;