X-Git-Url: http://git.efficios.com/?a=blobdiff_plain;f=gas%2Fhash.h;h=444bcc23a3a77360d2b7640c66f4ca062ed4373c;hb=1b1bb2c67bba67bcf0a9382fb6b6c61874e9b089;hp=4e151f992741e9fb3fabc3d786d174e7fd4781ba;hpb=8b228fe958bcac8cf510ce2ed3d9ae24a717334e;p=deliverable%2Fbinutils-gdb.git

diff --git a/gas/hash.h b/gas/hash.h
index 4e151f9927..444bcc23a3 100644
--- a/gas/hash.h
+++ b/gas/hash.h
@@ -1,59 +1,88 @@
-/* hash.h - for hash.c
-   Copyright (C) 1987 Free Software Foundation, Inc.
-   
+/* hash.h -- header file for gas hash table routines
+   Copyright (C) 1987-2020 Free Software Foundation, Inc.
+
    This file is part of GAS, the GNU Assembler.
-   
+
    GAS is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
-   the Free Software Foundation; either version 2, or (at your option)
+   the Free Software Foundation; either version 3, or (at your option)
    any later version.
-   
+
    GAS is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
-   
+
    You should have received a copy of the GNU General Public License
-   along with GAS; see the file COPYING.  If not, write to
-   the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */
-
-#ifndef hashH
-#define hashH
-
-struct hash_entry
-{
-	char *      hash_string;	/* points to where the symbol string is */
-	/* NULL means slot is not used */
-	/* DELETED means slot was deleted */
-	char *      hash_value;	/* user's datum, associated with symbol */
-};
-
-
-#define HASH_STATLENGTH	(6)
-struct hash_control
-{
-	struct hash_entry * hash_where; /* address of hash table */
-	int         hash_sizelog;	/* Log of ( hash_mask + 1 ) */
-	int         hash_mask;	/* masks a hash into index into table */
-	int         hash_full;	/* when hash_stat[STAT_USED] exceeds this, */
-	/* grow table */
-	struct hash_entry * hash_wall; /* point just after last (usable) entry */
-	/* here we have some statistics */
-	int hash_stat[HASH_STATLENGTH]; /* lies & statistics */
-	/* we need STAT_USED & STAT_SIZE */
-};
-
-
-/*						returns		  */
-struct hash_control *	hash_new();	/* [control block]	  */
-void			hash_die();
-void			hash_say();
-char *			hash_delete();	/* previous value         */
-char *			hash_relpace();	/* previous value         */
-char *			hash_insert();	/* error string           */
-char *			hash_apply();	/* 0 means OK             */
-char *			hash_find();	/* value                  */
-char *			hash_jam();	/* error text (internal)  */
-#endif				/* #ifdef hashH */
-
-/* end of hash.c */
+   along with GAS; see the file COPYING.  If not, write to the Free
+   Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
+   02110-1301, USA.  */
+
+#ifndef HASH_H
+#define HASH_H
+
+struct hash_control;
+
+/* Set the size of the hash table used.  */
+
+void set_gas_hash_table_size (unsigned long);
+
+/* Create a hash table.  This return a control block.  */
+
+extern struct hash_control *hash_new (void);
+extern struct hash_control *hash_new_sized (unsigned long);
+
+/* Delete a hash table, freeing all allocated memory.  */
+
+extern void hash_die (struct hash_control *);
+
+/* Insert an entry into a hash table.  This returns NULL on success.
+   On error, it returns a printable string indicating the error.  It
+   is considered to be an error if the entry already exists in the
+   hash table.  */
+
+extern const char *hash_insert (struct hash_control *,
+				const char *key, void *value);
+
+/* Insert or replace an entry in a hash table.  This returns NULL on
+   success.  On error, it returns a printable string indicating the
+   error.  If an entry already exists, its value is replaced.  */
+
+extern const char *hash_jam (struct hash_control *,
+			     const char *key, void *value);
+
+/* Replace an existing entry in a hash table.  This returns the old
+   value stored for the entry.  If the entry is not found in the hash
+   table, this does nothing and returns NULL.  */
+
+extern void *hash_replace (struct hash_control *, const char *key,
+			 void *value);
+
+/* Find an entry in a hash table, returning its value.  Returns NULL
+   if the entry is not found.  */
+
+extern void *hash_find (struct hash_control *, const char *key);
+
+/* As hash_find, but KEY is of length LEN and is not guaranteed to be
+   NUL-terminated.  */
+
+extern void *hash_find_n (struct hash_control *, const char *key, size_t len);
+
+/* Delete an entry from a hash table.  This returns the value stored
+   for that entry, or NULL if there is no such entry.  */
+
+extern void *hash_delete (struct hash_control *, const char *key, int);
+
+/* Traverse a hash table.  Call the function on every entry in the
+   hash table.  */
+
+extern void hash_traverse (struct hash_control *,
+			   void (*pfn) (const char *key, void *value));
+
+/* Print hash table statistics on the specified file.  NAME is the
+   name of the hash table, used for printing a header.  */
+
+extern void hash_print_statistics (FILE *, const char *name,
+				   struct hash_control *);
+
+#endif /* HASH_H */