summaryrefslogtreecommitdiff
path: root/gcc/objc/hash.h
diff options
context:
space:
mode:
authorDennis Glatting <dennisg@gnu.org>1991-12-10 12:05:28 +0000
committerDennis Glatting <dennisg@gnu.org>1991-12-10 12:05:28 +0000
commiteedb4710a6c82c65caf53ee110fb2e53b29607c7 (patch)
tree3342c6a4a1da0680faf93cf5c07c55b4608787ae /gcc/objc/hash.h
parentb61e1345cbe8f0dd64c7243e027e0a6330a47507 (diff)
downloadgcc-eedb4710a6c82c65caf53ee110fb2e53b29607c7.tar.gz
Cleaned up file format for a distribution.
From-SVN: r111
Diffstat (limited to 'gcc/objc/hash.h')
-rw-r--r--gcc/objc/hash.h34
1 files changed, 19 insertions, 15 deletions
diff --git a/gcc/objc/hash.h b/gcc/objc/hash.h
index e68138b182e..62b48f8b401 100644
--- a/gcc/objc/hash.h
+++ b/gcc/objc/hash.h
@@ -21,10 +21,14 @@
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
- $Header: /usr/user/dennis_glatting/ObjC/c-runtime/lib/RCS/hash.h,v 0.6 1991/11/24 01:20:02 dennisg Exp dennisg $
+ $Header: /usr/user/dennis_glatting/ObjC/c-runtime/lib/RCS/hash.h,v 0.7 1991/12/03 02:01:23 dennisg Exp dennisg $
$Author: dennisg $
- $Date: 1991/11/24 01:20:02 $
+ $Date: 1991/12/03 02:01:23 $
$Log: hash.h,v $
+ * Revision 0.7 1991/12/03 02:01:23 dennisg
+ * fixed assert macro.
+ * added memory allocation adjustment macro for hash size allocation.
+ *
* Revision 0.6 1991/11/24 01:20:02 dennisg
* changed shorts back to ints.
* the efficiency gained didn't out weight the grossness of the code.
@@ -98,18 +102,18 @@ typedef struct cache {
*/
CacheNode_t (* theNodeTable)[]; /* Pointer to an array of
hash nodes. */
- /*
- * Variables used to track the size of the hash
- * table so to determine when to resize it.
- */
+ /*
+ * Variables used to track the size of the hash
+ * table so to determine when to resize it.
+ */
u_int sizeOfHash, /* Number of buckets
allocated for the hash
table (number of array
entries allocated for
"theNodeTable"). Must be
- a power of two. */
- entriesInHash; /* Current number of entries
- in ther hash table. */
+ a power of two. */
+ entriesInHash; /* Current number of entries
+ in ther hash table. */
/*
* Variables used to implement indexing
* through the hash table.
@@ -132,12 +136,12 @@ Cache_t hash_new (u_int sizeOfHash);
void hash_delete (Cache_t theCache);
/* Add the key/value pair
to the hash table. If the
- hash table reaches a
- level of fullnes then
- it will be resized.
-
- assert() if the key is
- already in the hash. */
+ hash table reaches a
+ level of fullnes then
+ it will be resized.
+
+ assert() if the key is
+ already in the hash. */
void hash_add (Cache_t* theCache, void* aKey, void* aValue);
/* Remove the key/value pair
from the hash table.