aboutsummaryrefslogtreecommitdiff
path: root/gas/hash.h
diff options
context:
space:
mode:
authorK. Richard Pixley <rich@cygnus>1991-04-04 18:19:53 +0000
committerK. Richard Pixley <rich@cygnus>1991-04-04 18:19:53 +0000
commitfecd2382e77b89f12c9d630ed4e42e9a54ba6953 (patch)
tree6cddf76f492c3485605175c97c13d9a24c65306f /gas/hash.h
parentb6fc45ca4c306a4f6f6bdbaf90a69d3dab62777a (diff)
downloadgdb-fecd2382e77b89f12c9d630ed4e42e9a54ba6953.zip
gdb-fecd2382e77b89f12c9d630ed4e42e9a54ba6953.tar.gz
gdb-fecd2382e77b89f12c9d630ed4e42e9a54ba6953.tar.bz2
Initial revision
Diffstat (limited to 'gas/hash.h')
-rw-r--r--gas/hash.h59
1 files changed, 59 insertions, 0 deletions
diff --git a/gas/hash.h b/gas/hash.h
new file mode 100644
index 0000000..fb68fd3
--- /dev/null
+++ b/gas/hash.h
@@ -0,0 +1,59 @@
+/* hash.h - for hash.c
+ Copyright (C) 1987 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 1, 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: hash.c */