Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 1 | /* hashlib.c -- functions to manage and access hash tables for bash. */ |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 2 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 3 | /* Copyright (C) 1987,1989,1991,1995,1998,2001,2003,2005,2006,2008,2009 Free Software Foundation, Inc. |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 4 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 5 | This file is part of GNU Bash, the Bourne Again SHell. |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 6 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 7 | Bash is free software: you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation, either version 3 of the License, or |
| 10 | (at your option) any later version. |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 11 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 12 | Bash is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 16 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 17 | You should have received a copy of the GNU General Public License |
| 18 | along with Bash. If not, see <http://www.gnu.org/licenses/>. |
| 19 | */ |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 20 | |
Jari Aalto | bb70624 | 2000-03-17 21:46:59 +0000 | [diff] [blame] | 21 | #include <config.h> |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 22 | |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 23 | #include "bashansi.h" |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 24 | |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 25 | #if defined (HAVE_UNISTD_H) |
Jari Aalto | cce855b | 1998-04-17 19:52:44 +0000 | [diff] [blame] | 26 | # ifdef _MINIX |
| 27 | # include <sys/types.h> |
| 28 | # endif |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 29 | # include <unistd.h> |
| 30 | #endif |
| 31 | |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 32 | #include <stdio.h> |
| 33 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 34 | #include "shell.h" |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 35 | #include "hashlib.h" |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 36 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 37 | /* Rely on properties of unsigned division (unsigned/int -> unsigned) and |
| 38 | don't discard the upper 32 bits of the value, if present. */ |
| 39 | #define HASH_BUCKET(s, t, h) (((h) = hash_string (s)) & ((t)->nbuckets - 1)) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 40 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 41 | static BUCKET_CONTENTS *copy_bucket_array __P((BUCKET_CONTENTS *, sh_string_func_t *)); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 42 | |
| 43 | /* Make a new hash table with BUCKETS number of buckets. Initialize |
| 44 | each slot in the table to NULL. */ |
| 45 | HASH_TABLE * |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 46 | hash_create (buckets) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 47 | int buckets; |
| 48 | { |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 49 | HASH_TABLE *new_table; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 50 | register int i; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 51 | |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 52 | new_table = (HASH_TABLE *)xmalloc (sizeof (HASH_TABLE)); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 53 | if (buckets == 0) |
| 54 | buckets = DEFAULT_HASH_BUCKETS; |
| 55 | |
| 56 | new_table->bucket_array = |
| 57 | (BUCKET_CONTENTS **)xmalloc (buckets * sizeof (BUCKET_CONTENTS *)); |
| 58 | new_table->nbuckets = buckets; |
| 59 | new_table->nentries = 0; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 60 | |
| 61 | for (i = 0; i < buckets; i++) |
| 62 | new_table->bucket_array[i] = (BUCKET_CONTENTS *)NULL; |
| 63 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 64 | return (new_table); |
| 65 | } |
| 66 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 67 | int |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 68 | hash_size (table) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 69 | HASH_TABLE *table; |
| 70 | { |
| 71 | return (HASH_ENTRIES(table)); |
| 72 | } |
| 73 | |
| 74 | static BUCKET_CONTENTS * |
| 75 | copy_bucket_array (ba, cpdata) |
| 76 | BUCKET_CONTENTS *ba; |
| 77 | sh_string_func_t *cpdata; /* data copy function */ |
| 78 | { |
| 79 | BUCKET_CONTENTS *new_bucket, *n, *e; |
| 80 | |
| 81 | if (ba == 0) |
| 82 | return ((BUCKET_CONTENTS *)0); |
| 83 | |
| 84 | for (n = (BUCKET_CONTENTS *)0, e = ba; e; e = e->next) |
| 85 | { |
| 86 | if (n == 0) |
| 87 | { |
| 88 | new_bucket = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS)); |
| 89 | n = new_bucket; |
| 90 | } |
| 91 | else |
| 92 | { |
| 93 | n->next = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS)); |
| 94 | n = n->next; |
| 95 | } |
| 96 | |
| 97 | n->key = savestring (e->key); |
| 98 | n->data = e->data ? (cpdata ? (*cpdata) (e->data) : savestring (e->data)) |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 99 | : NULL; |
| 100 | n->khash = e->khash; |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 101 | n->times_found = e->times_found; |
| 102 | n->next = (BUCKET_CONTENTS *)NULL; |
| 103 | } |
| 104 | |
| 105 | return new_bucket; |
| 106 | } |
| 107 | |
| 108 | HASH_TABLE * |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 109 | hash_copy (table, cpdata) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 110 | HASH_TABLE *table; |
| 111 | sh_string_func_t *cpdata; |
| 112 | { |
| 113 | HASH_TABLE *new_table; |
| 114 | int i; |
| 115 | |
| 116 | if (table == 0) |
| 117 | return ((HASH_TABLE *)NULL); |
| 118 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 119 | new_table = hash_create (table->nbuckets); |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 120 | |
| 121 | for (i = 0; i < table->nbuckets; i++) |
| 122 | new_table->bucket_array[i] = copy_bucket_array (table->bucket_array[i], cpdata); |
| 123 | |
| 124 | new_table->nentries = table->nentries; |
| 125 | return new_table; |
| 126 | } |
| 127 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 128 | /* The `khash' check below requires that strings that compare equally with |
| 129 | strcmp hash to the same value. */ |
| 130 | unsigned int |
| 131 | hash_string (s) |
| 132 | const char *s; |
| 133 | { |
| 134 | register unsigned int i; |
| 135 | |
| 136 | /* This is the best string hash function I found. |
| 137 | |
| 138 | The magic is in the interesting relationship between the special prime |
| 139 | 16777619 (2^24 + 403) and 2^32 and 2^8. */ |
| 140 | |
| 141 | for (i = 0; *s; s++) |
| 142 | { |
| 143 | i *= 16777619; |
| 144 | i ^= *s; |
| 145 | } |
| 146 | |
| 147 | return i; |
| 148 | } |
| 149 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 150 | /* Return the location of the bucket which should contain the data |
| 151 | for STRING. TABLE is a pointer to a HASH_TABLE. */ |
| 152 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 153 | int |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 154 | hash_bucket (string, table) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 155 | const char *string; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 156 | HASH_TABLE *table; |
| 157 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 158 | unsigned int h; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 159 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 160 | return (HASH_BUCKET (string, table, h)); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 161 | } |
| 162 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 163 | /* Return a pointer to the hashed item. If the HASH_CREATE flag is passed, |
| 164 | create a new hash table entry for STRING, otherwise return NULL. */ |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 165 | BUCKET_CONTENTS * |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 166 | hash_search (string, table, flags) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 167 | const char *string; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 168 | HASH_TABLE *table; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 169 | int flags; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 170 | { |
| 171 | BUCKET_CONTENTS *list; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 172 | int bucket; |
| 173 | unsigned int hv; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 174 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 175 | if (table == 0 || ((flags & HASH_CREATE) == 0 && HASH_ENTRIES (table) == 0)) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 176 | return (BUCKET_CONTENTS *)NULL; |
| 177 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 178 | bucket = HASH_BUCKET (string, table, hv); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 179 | |
Chet Ramey | 0001803 | 2011-11-21 20:51:19 -0500 | [diff] [blame] | 180 | for (list = table->bucket_array ? table->bucket_array[bucket] : 0; list; list = list->next) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 181 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 182 | if (hv == list->khash && STREQ (list->key, string)) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 183 | { |
| 184 | list->times_found++; |
| 185 | return (list); |
| 186 | } |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 187 | } |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 188 | |
| 189 | if (flags & HASH_CREATE) |
| 190 | { |
| 191 | list = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS)); |
| 192 | list->next = table->bucket_array[bucket]; |
| 193 | table->bucket_array[bucket] = list; |
| 194 | |
| 195 | list->data = NULL; |
| 196 | list->key = (char *)string; /* XXX fix later */ |
| 197 | list->khash = hv; |
| 198 | list->times_found = 0; |
| 199 | |
| 200 | table->nentries++; |
| 201 | return (list); |
| 202 | } |
| 203 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 204 | return (BUCKET_CONTENTS *)NULL; |
| 205 | } |
| 206 | |
| 207 | /* Remove the item specified by STRING from the hash table TABLE. |
| 208 | The item removed is returned, so you can free its contents. If |
| 209 | the item isn't in this table NULL is returned. */ |
| 210 | BUCKET_CONTENTS * |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 211 | hash_remove (string, table, flags) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 212 | const char *string; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 213 | HASH_TABLE *table; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 214 | int flags; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 215 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 216 | int bucket; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 217 | BUCKET_CONTENTS *prev, *temp; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 218 | unsigned int hv; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 219 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 220 | if (table == 0 || HASH_ENTRIES (table) == 0) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 221 | return (BUCKET_CONTENTS *)NULL; |
| 222 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 223 | bucket = HASH_BUCKET (string, table, hv); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 224 | prev = (BUCKET_CONTENTS *)NULL; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 225 | for (temp = table->bucket_array[bucket]; temp; temp = temp->next) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 226 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 227 | if (hv == temp->khash && STREQ (temp->key, string)) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 228 | { |
| 229 | if (prev) |
| 230 | prev->next = temp->next; |
| 231 | else |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 232 | table->bucket_array[bucket] = temp->next; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 233 | |
| 234 | table->nentries--; |
| 235 | return (temp); |
| 236 | } |
| 237 | prev = temp; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 238 | } |
| 239 | return ((BUCKET_CONTENTS *) NULL); |
| 240 | } |
| 241 | |
| 242 | /* Create an entry for STRING, in TABLE. If the entry already |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 243 | exists, then return it (unless the HASH_NOSRCH flag is set). */ |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 244 | BUCKET_CONTENTS * |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 245 | hash_insert (string, table, flags) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 246 | char *string; |
| 247 | HASH_TABLE *table; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 248 | int flags; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 249 | { |
| 250 | BUCKET_CONTENTS *item; |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 251 | int bucket; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 252 | unsigned int hv; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 253 | |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 254 | if (table == 0) |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 255 | table = hash_create (0); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 256 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 257 | item = (flags & HASH_NOSRCH) ? (BUCKET_CONTENTS *)NULL |
| 258 | : hash_search (string, table, 0); |
| 259 | |
| 260 | if (item == 0) |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 261 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 262 | bucket = HASH_BUCKET (string, table, hv); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 263 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 264 | item = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS)); |
| 265 | item->next = table->bucket_array[bucket]; |
| 266 | table->bucket_array[bucket] = item; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 267 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 268 | item->data = NULL; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 269 | item->key = string; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 270 | item->khash = hv; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 271 | item->times_found = 0; |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 272 | |
| 273 | table->nentries++; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 274 | } |
| 275 | |
| 276 | return (item); |
| 277 | } |
| 278 | |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 279 | /* Remove and discard all entries in TABLE. If FREE_DATA is non-null, it |
| 280 | is a function to call to dispose of a hash item's data. Otherwise, |
| 281 | free() is called. */ |
| 282 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 283 | hash_flush (table, free_data) |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 284 | HASH_TABLE *table; |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 285 | sh_free_func_t *free_data; |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 286 | { |
| 287 | int i; |
| 288 | register BUCKET_CONTENTS *bucket, *item; |
| 289 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 290 | if (table == 0 || HASH_ENTRIES (table) == 0) |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 291 | return; |
| 292 | |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 293 | for (i = 0; i < table->nbuckets; i++) |
| 294 | { |
| 295 | bucket = table->bucket_array[i]; |
| 296 | |
| 297 | while (bucket) |
| 298 | { |
| 299 | item = bucket; |
| 300 | bucket = bucket->next; |
| 301 | |
| 302 | if (free_data) |
| 303 | (*free_data) (item->data); |
| 304 | else |
| 305 | free (item->data); |
| 306 | free (item->key); |
| 307 | free (item); |
| 308 | } |
| 309 | table->bucket_array[i] = (BUCKET_CONTENTS *)NULL; |
| 310 | } |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 311 | |
| 312 | table->nentries = 0; |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 313 | } |
| 314 | |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 315 | /* Free the hash table pointed to by TABLE. */ |
| 316 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 317 | hash_dispose (table) |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 318 | HASH_TABLE *table; |
| 319 | { |
| 320 | free (table->bucket_array); |
| 321 | free (table); |
| 322 | } |
| 323 | |
Jari Aalto | cce855b | 1998-04-17 19:52:44 +0000 | [diff] [blame] | 324 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 325 | hash_walk (table, func) |
| 326 | HASH_TABLE *table; |
| 327 | hash_wfunc *func; |
| 328 | { |
| 329 | register int i; |
| 330 | BUCKET_CONTENTS *item; |
| 331 | |
| 332 | if (table == 0 || HASH_ENTRIES (table) == 0) |
| 333 | return; |
| 334 | |
| 335 | for (i = 0; i < table->nbuckets; i++) |
| 336 | { |
| 337 | for (item = hash_items (i, table); item; item = item->next) |
| 338 | if ((*func) (item) < 0) |
| 339 | return; |
| 340 | } |
| 341 | } |
| 342 | |
| 343 | #if defined (DEBUG) || defined (TEST_HASHING) |
| 344 | void |
| 345 | hash_pstats (table, name) |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 346 | HASH_TABLE *table; |
| 347 | char *name; |
| 348 | { |
| 349 | register int slot, bcount; |
| 350 | register BUCKET_CONTENTS *bc; |
| 351 | |
| 352 | if (name == 0) |
| 353 | name = "unknown hash table"; |
| 354 | |
| 355 | fprintf (stderr, "%s: %d buckets; %d items\n", name, table->nbuckets, table->nentries); |
| 356 | |
| 357 | /* Print out a count of how many strings hashed to each bucket, so we can |
| 358 | see how even the distribution is. */ |
| 359 | for (slot = 0; slot < table->nbuckets; slot++) |
| 360 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 361 | bc = hash_items (slot, table); |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 362 | |
| 363 | fprintf (stderr, "\tslot %3d: ", slot); |
| 364 | for (bcount = 0; bc; bc = bc->next) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 365 | bcount++; |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 366 | |
| 367 | fprintf (stderr, "%d\n", bcount); |
| 368 | } |
| 369 | } |
Jari Aalto | cce855b | 1998-04-17 19:52:44 +0000 | [diff] [blame] | 370 | #endif |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 371 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 372 | #ifdef TEST_HASHING |
| 373 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 374 | /* link with xmalloc.o and lib/malloc/libmalloc.a */ |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 375 | #undef NULL |
| 376 | #include <stdio.h> |
| 377 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 378 | #ifndef NULL |
| 379 | #define NULL 0 |
| 380 | #endif |
| 381 | |
| 382 | HASH_TABLE *table, *ntable; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 383 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 384 | int interrupt_immediately = 0; |
| 385 | |
| 386 | int |
| 387 | signal_is_trapped (s) |
| 388 | int s; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 389 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 390 | return (0); |
| 391 | } |
| 392 | |
| 393 | void |
| 394 | programming_error (const char *format, ...) |
| 395 | { |
| 396 | abort(); |
| 397 | } |
| 398 | |
| 399 | void |
| 400 | fatal_error (const char *format, ...) |
| 401 | { |
| 402 | abort(); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 403 | } |
| 404 | |
| 405 | main () |
| 406 | { |
| 407 | char string[256]; |
| 408 | int count = 0; |
| 409 | BUCKET_CONTENTS *tt; |
| 410 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 411 | table = hash_create (0); |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 412 | |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 413 | for (;;) |
| 414 | { |
| 415 | char *temp_string; |
| 416 | if (fgets (string, sizeof (string), stdin) == 0) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 417 | break; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 418 | if (!*string) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 419 | break; |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 420 | temp_string = savestring (string); |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 421 | tt = hash_insert (temp_string, table, 0); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 422 | if (tt->times_found) |
| 423 | { |
| 424 | fprintf (stderr, "You have already added item `%s'\n", string); |
| 425 | free (temp_string); |
| 426 | } |
| 427 | else |
| 428 | { |
| 429 | count++; |
| 430 | } |
| 431 | } |
Jari Aalto | ccc6cda | 1996-12-23 17:02:34 +0000 | [diff] [blame] | 432 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 433 | hash_pstats (table, "hash test"); |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 434 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 435 | ntable = hash_copy (table, (sh_string_func_t *)NULL); |
| 436 | hash_flush (table, (sh_free_func_t *)NULL); |
| 437 | hash_pstats (ntable, "hash copy test"); |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 438 | |
Jari Aalto | d166f04 | 1997-06-05 14:59:13 +0000 | [diff] [blame] | 439 | exit (0); |
Jari Aalto | 726f638 | 1996-08-26 18:22:31 +0000 | [diff] [blame] | 440 | } |
| 441 | |
| 442 | #endif /* TEST_HASHING */ |