get rid of PROTO macros

1 files changed, 22 insertions, 22 deletions

diff --git a/gcc/hash.h b/gcc/hash.h
index ac3b1ed..02a5c3e 100755
--- a/gcc/hash.h
+++ b/gcc/hash.h
@@ -60,72 +60,72 @@ struct hash_table
      built each of which calls the function in the superclass.  Thus
      each function should be written to allocate a new block of memory
      only if the argument is NULL.  */
-  struct hash_entry *(*newfunc) PARAMS ((struct hash_entry *,
+  struct hash_entry *(*newfunc) (struct hash_entry *,
 					 struct hash_table *,
-					 hash_table_key));
+					 hash_table_key);
   /* A function to compute the hash code for a key in the hash table.  */
-  unsigned long (*hash) PARAMS ((hash_table_key));
+  unsigned long (*hash) (hash_table_key);
   /* A function to compare two keys.  */
-  boolean (*comp) PARAMS ((hash_table_key, hash_table_key));
+  boolean (*comp) (hash_table_key, hash_table_key);
   /* An obstack for this hash table.  */
   struct obstack memory;
 };
 
 /* Initialize a hash table.  */
 extern boolean hash_table_init
-  PARAMS ((struct hash_table *,
+  (struct hash_table *,
 	   struct hash_entry *(*) (struct hash_entry *,
 				   struct hash_table *,
 				   hash_table_key),
 	   unsigned long (*hash) (hash_table_key),
-	   boolean (*comp) (hash_table_key, hash_table_key)));
+	   boolean (*comp) (hash_table_key, hash_table_key));
 
 /* Initialize a hash table specifying a size.  */
 extern boolean hash_table_init_n
-  PARAMS ((struct hash_table *,
+  (struct hash_table *,
 	   struct hash_entry *(*) (struct hash_entry *,
 				   struct hash_table *,
 				   hash_table_key),
 	   unsigned long (*hash) (hash_table_key),
 	   boolean (*comp) (hash_table_key, hash_table_key),
-	   unsigned int size));
+	   unsigned int size);
 
 /* Free up a hash table.  */
-extern void hash_table_free PARAMS ((struct hash_table *));
+extern void hash_table_free (struct hash_table *);
 
 /* Look up KEY in a hash table.  If CREATE is true, a new entry
    will be created for this KEY if one does not already exist.  If
    COPY is non-NULL, it is used to copy the KEY before storing it in
    the hash table.  */
 extern struct hash_entry *hash_lookup
-  PARAMS ((struct hash_table *, hash_table_key key, boolean create,
-	   hash_table_key (*copy)(struct obstack*, hash_table_key)));
+  (struct hash_table *, hash_table_key key, boolean create,
+	   hash_table_key (*copy)(struct obstack*, hash_table_key));
 
 /* Base method for creating a hash table entry.  */
 extern struct hash_entry *hash_newfunc
-  PARAMS ((struct hash_entry *, struct hash_table *, 
-	   hash_table_key key));
+  (struct hash_entry *, struct hash_table *, 
+	   hash_table_key key);
 
 /* Grab some space for a hash table entry.  */
-extern PTR hash_allocate PARAMS ((struct hash_table *,
-				  unsigned int));
+extern PTR hash_allocate (struct hash_table *,
+				  unsigned int);
 
 /* Traverse a hash table in a random order, calling a function on each
    element.  If the function returns false, the traversal stops.  The
    INFO argument is passed to the function.  */
-extern void hash_traverse PARAMS ((struct hash_table *,
+extern void hash_traverse (struct hash_table *,
 				   boolean (*) (struct hash_entry *,
 						hash_table_key),
-				   hash_table_key info));
+				   hash_table_key info);
 
 /* Hash a string K, which is really of type `char*'.  */
-extern unsigned long string_hash PARAMS ((hash_table_key k));
+extern unsigned long string_hash (hash_table_key k);
 
 /* Compare two strings K1, K2 which are really of type `char*'.  */
-extern boolean string_compare PARAMS ((hash_table_key k1, 
-				       hash_table_key k2));
+extern boolean string_compare (hash_table_key k1, 
+				       hash_table_key k2);
 
 /* Copy a string K, which is really of type `char*'.  */
-extern hash_table_key string_copy PARAMS ((struct obstack* memory,
-					   hash_table_key k));
+extern hash_table_key string_copy (struct obstack* memory,
+					   hash_table_key k);