diff options
author | Mark Mitchell <mark@codesourcery.com> | 2000-03-31 07:04:37 +0000 |
---|---|---|
committer | Mark Mitchell <mmitchel@gcc.gnu.org> | 2000-03-31 07:04:37 +0000 |
commit | b13eb66b7de2865ac502a92ee8e68b17417c9db6 (patch) | |
tree | 0bbfb81bb3327866160b992f8c9fb040addd6364 /libiberty/hashtab.c | |
parent | d68894a1c80dfc898985c664811134e02946ef3a (diff) | |
download | gcc-b13eb66b7de2865ac502a92ee8e68b17417c9db6.tar.gz |
hashtab.h (hashval_t): New type.
* hashtab.h (hashval_t): New type.
(htab_find_with_hash): Use it as an argument.
(htab_find_slot_with_hash): Likewise.
* hashtab.c (find_empty_slot_for_expand): Use hashval_t for hash
codes.
(htab_find_with_hash): Likewise.
(htab_find_slot_with_hash): Likewise.
From-SVN: r32842
Diffstat (limited to 'libiberty/hashtab.c')
-rw-r--r-- | libiberty/hashtab.c | 16 |
1 files changed, 9 insertions, 7 deletions
diff --git a/libiberty/hashtab.c b/libiberty/hashtab.c index 027f75d12ac..ba897b2b03d 100644 --- a/libiberty/hashtab.c +++ b/libiberty/hashtab.c @@ -1,5 +1,5 @@ /* An expandable hash tables datatype. - Copyright (C) 1999 Free Software Foundation, Inc. + Copyright (C) 1999, 2000 Free Software Foundation, Inc. Contributed by Vladimir Makarov (vmakarov@cygnus.com). This file is part of the libiberty library. @@ -155,10 +155,10 @@ htab_empty (htab) static void ** find_empty_slot_for_expand (htab, hash) htab_t htab; - unsigned int hash; + hashval_t hash; { size_t size = htab->size; - unsigned int hash2 = 1 + hash % (size - 2); + hashval_t hash2 = 1 + hash % (size - 2); unsigned int index = hash % size; for (;;) @@ -221,9 +221,10 @@ void * htab_find_with_hash (htab, element, hash) htab_t htab; const void *element; - unsigned int hash; + hashval_t hash; { - unsigned int index, hash2; + unsigned int index; + hashval_t hash2; size_t size; void *entry; @@ -272,11 +273,12 @@ void ** htab_find_slot_with_hash (htab, element, hash, insert) htab_t htab; const void *element; - unsigned int hash; + hashval_t hash; int insert; { void **first_deleted_slot; - unsigned int index, hash2; + unsigned int index; + hashval_t hash2; size_t size; if (insert && htab->size * 3 <= htab->n_elements * 4) |