]>
Commit | Line | Data |
---|---|---|
14b0e578 CS |
1 | /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */\r |
2 | \r | |
3 | /* static char sccsid[] = "@(#) st.c 5.1 89/12/14 Crucible"; */\r | |
4 | \r | |
5 | //#include <stdio.h>\r | |
6 | //#include <stdlib.h>\r | |
7 | //#include <string.h>\r | |
8 | #include "OnigurumaUefiPort.h"\r | |
9 | \r | |
10 | #ifdef _WIN32\r | |
11 | #include <malloc.h>\r | |
12 | #endif\r | |
13 | \r | |
14 | #include "regint.h"\r | |
15 | #include "st.h"\r | |
16 | \r | |
17 | typedef struct st_table_entry st_table_entry;\r | |
18 | \r | |
19 | struct st_table_entry {\r | |
20 | unsigned int hash;\r | |
21 | st_data_t key;\r | |
22 | st_data_t record;\r | |
23 | st_table_entry *next;\r | |
24 | };\r | |
25 | \r | |
26 | #define ST_DEFAULT_MAX_DENSITY 5\r | |
27 | #define ST_DEFAULT_INIT_TABLE_SIZE 11\r | |
28 | \r | |
29 | /*\r | |
30 | * DEFAULT_MAX_DENSITY is the default for the largest we allow the\r | |
31 | * average number of items per bin before increasing the number of\r | |
32 | * bins\r | |
33 | *\r | |
34 | * DEFAULT_INIT_TABLE_SIZE is the default for the number of bins\r | |
35 | * allocated initially\r | |
36 | *\r | |
37 | */\r | |
38 | \r | |
39 | static int numcmp(long, long);\r | |
40 | static int numhash(long);\r | |
41 | static struct st_hash_type type_numhash = {\r | |
42 | numcmp,\r | |
43 | numhash,\r | |
44 | };\r | |
45 | \r | |
46 | /* extern int strcmp(const char *, const char *); */\r | |
47 | static int strhash(const char *);\r | |
48 | static struct st_hash_type type_strhash = {\r | |
49 | strcmp,\r | |
50 | strhash,\r | |
51 | };\r | |
52 | \r | |
53 | static void rehash(st_table *);\r | |
54 | \r | |
55 | #define alloc(type) (type*)xmalloc((unsigned)sizeof(type))\r | |
56 | #define Calloc(n,s) (char*)xcalloc((n),(s))\r | |
57 | \r | |
58 | #define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)((x),(y)) == 0)\r | |
59 | \r | |
60 | #define do_hash(key,table) (unsigned int)(*(table)->type->hash)((key))\r | |
61 | #define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins)\r | |
62 | \r | |
63 | /*\r | |
64 | * MINSIZE is the minimum size of a dictionary.\r | |
65 | */\r | |
66 | \r | |
67 | #define MINSIZE 8\r | |
68 | \r | |
69 | /*\r | |
70 | Table of prime numbers 2^n+a, 2<=n<=30.\r | |
71 | */\r | |
72 | static const long primes[] = {\r | |
73 | 8 + 3,\r | |
74 | 16 + 3,\r | |
75 | 32 + 5,\r | |
76 | 64 + 3,\r | |
77 | 128 + 3,\r | |
78 | 256 + 27,\r | |
79 | 512 + 9,\r | |
80 | 1024 + 9,\r | |
81 | 2048 + 5,\r | |
82 | 4096 + 3,\r | |
83 | 8192 + 27,\r | |
84 | 16384 + 43,\r | |
85 | 32768 + 3,\r | |
86 | 65536 + 45,\r | |
87 | 131072 + 29,\r | |
88 | 262144 + 3,\r | |
89 | 524288 + 21,\r | |
90 | 1048576 + 7,\r | |
91 | 2097152 + 17,\r | |
92 | 4194304 + 15,\r | |
93 | 8388608 + 9,\r | |
94 | 16777216 + 43,\r | |
95 | 33554432 + 35,\r | |
96 | 67108864 + 15,\r | |
97 | 134217728 + 29,\r | |
98 | 268435456 + 3,\r | |
99 | 536870912 + 11,\r | |
100 | 1073741824 + 85,\r | |
101 | 0\r | |
102 | };\r | |
103 | \r | |
104 | static int\r | |
105 | new_size(size)\r | |
106 | int size;\r | |
107 | {\r | |
108 | int i;\r | |
109 | \r | |
110 | #if 0\r | |
111 | for (i=3; i<31; i++) {\r | |
112 | if ((1<<i) > size) return 1<<i;\r | |
113 | }\r | |
114 | return -1;\r | |
115 | #else\r | |
116 | int newsize;\r | |
117 | \r | |
118 | for (i = 0, newsize = MINSIZE;\r | |
119 | i < (int )(sizeof(primes)/sizeof(primes[0]));\r | |
120 | i++, newsize <<= 1)\r | |
121 | {\r | |
122 | if (newsize > size) return primes[i];\r | |
123 | }\r | |
124 | /* Ran out of polynomials */\r | |
125 | return -1; /* should raise exception */\r | |
126 | #endif\r | |
127 | }\r | |
128 | \r | |
129 | #ifdef HASH_LOG\r | |
130 | static int collision = 0;\r | |
131 | static int init_st = 0;\r | |
132 | \r | |
133 | static void\r | |
134 | stat_col()\r | |
135 | {\r | |
136 | FILE *f = fopen("/tmp/col", "w");\r | |
137 | fprintf(f, "collision: %d\n", collision);\r | |
138 | fclose(f);\r | |
139 | }\r | |
140 | #endif\r | |
141 | \r | |
142 | st_table*\r | |
143 | st_init_table_with_size(type, size)\r | |
144 | struct st_hash_type *type;\r | |
145 | int size;\r | |
146 | {\r | |
147 | st_table *tbl;\r | |
148 | \r | |
149 | #ifdef HASH_LOG\r | |
150 | if (init_st == 0) {\r | |
151 | init_st = 1;\r | |
152 | atexit(stat_col);\r | |
153 | }\r | |
154 | #endif\r | |
155 | \r | |
156 | size = new_size(size); /* round up to prime number */\r | |
157 | \r | |
158 | tbl = alloc(st_table);\r | |
b0c2b797 | 159 | CHECK_NULL_RETURN(tbl);\r |
14b0e578 CS |
160 | tbl->type = type;\r |
161 | tbl->num_entries = 0;\r | |
162 | tbl->num_bins = size;\r | |
163 | tbl->bins = (st_table_entry **)Calloc(size, sizeof(st_table_entry*));\r | |
164 | \r | |
165 | return tbl;\r | |
166 | }\r | |
167 | \r | |
168 | st_table*\r | |
169 | st_init_table(type)\r | |
170 | struct st_hash_type *type;\r | |
171 | {\r | |
172 | return st_init_table_with_size(type, 0);\r | |
173 | }\r | |
174 | \r | |
175 | st_table*\r | |
176 | st_init_numtable(void)\r | |
177 | {\r | |
178 | return st_init_table(&type_numhash);\r | |
179 | }\r | |
180 | \r | |
181 | st_table*\r | |
182 | st_init_numtable_with_size(size)\r | |
183 | int size;\r | |
184 | {\r | |
185 | return st_init_table_with_size(&type_numhash, size);\r | |
186 | }\r | |
187 | \r | |
188 | st_table*\r | |
189 | st_init_strtable(void)\r | |
190 | {\r | |
191 | return st_init_table(&type_strhash);\r | |
192 | }\r | |
193 | \r | |
194 | st_table*\r | |
195 | st_init_strtable_with_size(size)\r | |
196 | int size;\r | |
197 | {\r | |
198 | return st_init_table_with_size(&type_strhash, size);\r | |
199 | }\r | |
200 | \r | |
201 | void\r | |
202 | st_free_table(table)\r | |
203 | st_table *table;\r | |
204 | {\r | |
205 | register st_table_entry *ptr, *next;\r | |
206 | int i;\r | |
207 | \r | |
208 | for(i = 0; i < table->num_bins; i++) {\r | |
209 | ptr = table->bins[i];\r | |
210 | while (ptr != 0) {\r | |
211 | next = ptr->next;\r | |
212 | free(ptr);\r | |
213 | ptr = next;\r | |
214 | }\r | |
215 | }\r | |
216 | free(table->bins);\r | |
217 | free(table);\r | |
218 | }\r | |
219 | \r | |
220 | #define PTR_NOT_EQUAL(table, ptr, hash_val, key) \\r | |
221 | ((ptr) != 0 && (ptr->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key)))\r | |
222 | \r | |
223 | #ifdef HASH_LOG\r | |
224 | #define COLLISION collision++\r | |
225 | #else\r | |
226 | #define COLLISION\r | |
227 | #endif\r | |
228 | \r | |
229 | #define FIND_ENTRY(table, ptr, hash_val, bin_pos) do {\\r | |
230 | bin_pos = hash_val%(table)->num_bins;\\r | |
231 | ptr = (table)->bins[bin_pos];\\r | |
232 | if (PTR_NOT_EQUAL(table, ptr, hash_val, key)) {\\r | |
233 | COLLISION;\\r | |
234 | while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\\r | |
235 | ptr = ptr->next;\\r | |
236 | }\\r | |
237 | ptr = ptr->next;\\r | |
238 | }\\r | |
239 | } while (0)\r | |
240 | \r | |
241 | int\r | |
242 | st_lookup(table, key, value)\r | |
243 | st_table *table;\r | |
244 | register st_data_t key;\r | |
245 | st_data_t *value;\r | |
246 | {\r | |
247 | unsigned int hash_val, bin_pos;\r | |
248 | register st_table_entry *ptr;\r | |
249 | \r | |
250 | hash_val = do_hash(key, table);\r | |
251 | FIND_ENTRY(table, ptr, hash_val, bin_pos);\r | |
252 | \r | |
253 | if (ptr == 0) {\r | |
254 | return 0;\r | |
255 | }\r | |
256 | else {\r | |
257 | if (value != 0) *value = ptr->record;\r | |
258 | return 1;\r | |
259 | }\r | |
260 | }\r | |
261 | \r | |
262 | #define ADD_DIRECT(table, key, value, hash_val, bin_pos)\\r | |
263 | do {\\r | |
264 | st_table_entry *entry;\\r | |
265 | if (table->num_entries/(table->num_bins) > ST_DEFAULT_MAX_DENSITY) {\\r | |
266 | rehash(table);\\r | |
267 | bin_pos = hash_val % table->num_bins;\\r | |
268 | }\\r | |
269 | \\r | |
270 | entry = alloc(st_table_entry);\\r | |
b0c2b797 QS |
271 | if (entry == NULL) {\\r |
272 | break;\\r | |
273 | }\\r | |
14b0e578 CS |
274 | \\r |
275 | entry->hash = hash_val;\\r | |
276 | entry->key = key;\\r | |
277 | entry->record = value;\\r | |
278 | entry->next = table->bins[bin_pos];\\r | |
279 | table->bins[bin_pos] = entry;\\r | |
280 | table->num_entries++;\\r | |
281 | } while (0)\r | |
282 | \r | |
283 | int\r | |
284 | st_insert(table, key, value)\r | |
285 | register st_table *table;\r | |
286 | register st_data_t key;\r | |
287 | st_data_t value;\r | |
288 | {\r | |
289 | unsigned int hash_val, bin_pos;\r | |
290 | register st_table_entry *ptr;\r | |
291 | \r | |
292 | hash_val = do_hash(key, table);\r | |
293 | FIND_ENTRY(table, ptr, hash_val, bin_pos);\r | |
294 | \r | |
295 | if (ptr == 0) {\r | |
296 | ADD_DIRECT(table, key, value, hash_val, bin_pos);\r | |
297 | return 0;\r | |
298 | }\r | |
299 | else {\r | |
300 | ptr->record = value;\r | |
301 | return 1;\r | |
302 | }\r | |
303 | }\r | |
304 | \r | |
305 | void\r | |
306 | st_add_direct(table, key, value)\r | |
307 | st_table *table;\r | |
308 | st_data_t key;\r | |
309 | st_data_t value;\r | |
310 | {\r | |
311 | unsigned int hash_val, bin_pos;\r | |
312 | \r | |
313 | hash_val = do_hash(key, table);\r | |
314 | bin_pos = hash_val % table->num_bins;\r | |
315 | ADD_DIRECT(table, key, value, hash_val, bin_pos);\r | |
316 | }\r | |
317 | \r | |
318 | static void\r | |
319 | rehash(table)\r | |
320 | register st_table *table;\r | |
321 | {\r | |
322 | register st_table_entry *ptr, *next, **new_bins;\r | |
323 | int i, old_num_bins = table->num_bins, new_num_bins;\r | |
324 | unsigned int hash_val;\r | |
325 | \r | |
326 | new_num_bins = new_size(old_num_bins+1);\r | |
327 | new_bins = (st_table_entry**)Calloc(new_num_bins, sizeof(st_table_entry*));\r | |
b0c2b797 QS |
328 | if (new_bins == NULL) {\r |
329 | return;\r | |
330 | }\r | |
14b0e578 CS |
331 | \r |
332 | for(i = 0; i < old_num_bins; i++) {\r | |
333 | ptr = table->bins[i];\r | |
334 | while (ptr != 0) {\r | |
335 | next = ptr->next;\r | |
336 | hash_val = ptr->hash % new_num_bins;\r | |
337 | ptr->next = new_bins[hash_val];\r | |
338 | new_bins[hash_val] = ptr;\r | |
339 | ptr = next;\r | |
340 | }\r | |
341 | }\r | |
342 | free(table->bins);\r | |
343 | table->num_bins = new_num_bins;\r | |
344 | table->bins = new_bins;\r | |
345 | }\r | |
346 | \r | |
347 | st_table*\r | |
348 | st_copy(old_table)\r | |
349 | st_table *old_table;\r | |
350 | {\r | |
351 | st_table *new_table;\r | |
352 | st_table_entry *ptr, *entry;\r | |
353 | int i, num_bins = old_table->num_bins;\r | |
354 | \r | |
355 | new_table = alloc(st_table);\r | |
356 | if (new_table == 0) {\r | |
357 | return 0;\r | |
358 | }\r | |
359 | \r | |
360 | *new_table = *old_table;\r | |
361 | new_table->bins = (st_table_entry**)\r | |
362 | Calloc((unsigned)num_bins, sizeof(st_table_entry*));\r | |
363 | \r | |
364 | if (new_table->bins == 0) {\r | |
365 | free(new_table);\r | |
366 | return 0;\r | |
367 | }\r | |
368 | \r | |
369 | for(i = 0; i < num_bins; i++) {\r | |
370 | new_table->bins[i] = 0;\r | |
371 | ptr = old_table->bins[i];\r | |
372 | while (ptr != 0) {\r | |
373 | entry = alloc(st_table_entry);\r | |
374 | if (entry == 0) {\r | |
375 | free(new_table->bins);\r | |
376 | free(new_table);\r | |
377 | return 0;\r | |
378 | }\r | |
379 | *entry = *ptr;\r | |
380 | entry->next = new_table->bins[i];\r | |
381 | new_table->bins[i] = entry;\r | |
382 | ptr = ptr->next;\r | |
383 | }\r | |
384 | }\r | |
385 | return new_table;\r | |
386 | }\r | |
387 | \r | |
388 | int\r | |
389 | st_delete(table, key, value)\r | |
390 | register st_table *table;\r | |
391 | register st_data_t *key;\r | |
392 | st_data_t *value;\r | |
393 | {\r | |
394 | unsigned int hash_val;\r | |
395 | st_table_entry *tmp;\r | |
396 | register st_table_entry *ptr;\r | |
397 | \r | |
398 | hash_val = do_hash_bin(*key, table);\r | |
399 | ptr = table->bins[hash_val];\r | |
400 | \r | |
401 | if (ptr == 0) {\r | |
402 | if (value != 0) *value = 0;\r | |
403 | return 0;\r | |
404 | }\r | |
405 | \r | |
406 | if (EQUAL(table, *key, ptr->key)) {\r | |
407 | table->bins[hash_val] = ptr->next;\r | |
408 | table->num_entries--;\r | |
409 | if (value != 0) *value = ptr->record;\r | |
410 | *key = ptr->key;\r | |
411 | free(ptr);\r | |
412 | return 1;\r | |
413 | }\r | |
414 | \r | |
415 | for(; ptr->next != 0; ptr = ptr->next) {\r | |
416 | if (EQUAL(table, ptr->next->key, *key)) {\r | |
417 | tmp = ptr->next;\r | |
418 | ptr->next = ptr->next->next;\r | |
419 | table->num_entries--;\r | |
420 | if (value != 0) *value = tmp->record;\r | |
421 | *key = tmp->key;\r | |
422 | free(tmp);\r | |
423 | return 1;\r | |
424 | }\r | |
425 | }\r | |
426 | \r | |
427 | return 0;\r | |
428 | }\r | |
429 | \r | |
430 | int\r | |
431 | st_delete_safe(table, key, value, never)\r | |
432 | register st_table *table;\r | |
433 | register st_data_t *key;\r | |
434 | st_data_t *value;\r | |
435 | st_data_t never;\r | |
436 | {\r | |
437 | unsigned int hash_val;\r | |
438 | register st_table_entry *ptr;\r | |
439 | \r | |
440 | hash_val = do_hash_bin(*key, table);\r | |
441 | ptr = table->bins[hash_val];\r | |
442 | \r | |
443 | if (ptr == 0) {\r | |
444 | if (value != 0) *value = 0;\r | |
445 | return 0;\r | |
446 | }\r | |
447 | \r | |
448 | for(; ptr != 0; ptr = ptr->next) {\r | |
449 | if ((ptr->key != never) && EQUAL(table, ptr->key, *key)) {\r | |
450 | table->num_entries--;\r | |
451 | *key = ptr->key;\r | |
452 | if (value != 0) *value = ptr->record;\r | |
453 | ptr->key = ptr->record = never;\r | |
454 | return 1;\r | |
455 | }\r | |
456 | }\r | |
457 | \r | |
458 | return 0;\r | |
459 | }\r | |
460 | \r | |
461 | static int\r | |
462 | #if defined(__GNUC__)\r | |
463 | delete_never(st_data_t key __attribute__ ((unused)), st_data_t value,\r | |
464 | st_data_t never)\r | |
465 | #else\r | |
466 | delete_never(key, value, never)\r | |
467 | st_data_t key, value, never;\r | |
468 | #endif\r | |
469 | {\r | |
470 | if (value == never) return ST_DELETE;\r | |
471 | return ST_CONTINUE;\r | |
472 | }\r | |
473 | \r | |
474 | void\r | |
475 | st_cleanup_safe(table, never)\r | |
476 | st_table *table;\r | |
477 | st_data_t never;\r | |
478 | {\r | |
479 | int num_entries = table->num_entries;\r | |
480 | \r | |
481 | st_foreach(table, delete_never, never);\r | |
482 | table->num_entries = num_entries;\r | |
483 | }\r | |
484 | \r | |
485 | int\r | |
486 | st_foreach(table, func, arg)\r | |
487 | st_table *table;\r | |
488 | int (*func)();\r | |
489 | st_data_t arg;\r | |
490 | {\r | |
491 | st_table_entry *ptr, *last, *tmp;\r | |
492 | enum st_retval retval;\r | |
493 | int i;\r | |
494 | \r | |
495 | for(i = 0; i < table->num_bins; i++) {\r | |
496 | last = 0;\r | |
497 | for(ptr = table->bins[i]; ptr != 0;) {\r | |
498 | retval = (*func)(ptr->key, ptr->record, arg);\r | |
499 | switch (retval) {\r | |
500 | case ST_CHECK: /* check if hash is modified during iteration */\r | |
501 | tmp = 0;\r | |
502 | if (i < table->num_bins) {\r | |
503 | for (tmp = table->bins[i]; tmp; tmp=tmp->next) {\r | |
504 | if (tmp == ptr) break;\r | |
505 | }\r | |
506 | }\r | |
507 | if (!tmp) {\r | |
508 | /* call func with error notice */\r | |
509 | return 1;\r | |
510 | }\r | |
511 | /* fall through */\r | |
512 | case ST_CONTINUE:\r | |
513 | last = ptr;\r | |
514 | ptr = ptr->next;\r | |
515 | break;\r | |
516 | case ST_STOP:\r | |
517 | return 0;\r | |
518 | case ST_DELETE:\r | |
519 | tmp = ptr;\r | |
520 | if (last == 0) {\r | |
521 | table->bins[i] = ptr->next;\r | |
522 | }\r | |
523 | else {\r | |
524 | last->next = ptr->next;\r | |
525 | }\r | |
526 | ptr = ptr->next;\r | |
527 | free(tmp);\r | |
528 | table->num_entries--;\r | |
529 | }\r | |
530 | }\r | |
531 | }\r | |
532 | return 0;\r | |
533 | }\r | |
534 | \r | |
535 | static int\r | |
536 | strhash(string)\r | |
537 | register const char *string;\r | |
538 | {\r | |
539 | register int c;\r | |
540 | \r | |
541 | #ifdef HASH_ELFHASH\r | |
542 | register unsigned int h = 0, g;\r | |
543 | \r | |
544 | while ((c = *string++) != '\0') {\r | |
545 | h = ( h << 4 ) + c;\r | |
546 | if ( g = h & 0xF0000000 )\r | |
547 | h ^= g >> 24;\r | |
548 | h &= ~g;\r | |
549 | }\r | |
550 | return h;\r | |
551 | #elif HASH_PERL\r | |
552 | register int val = 0;\r | |
553 | \r | |
554 | while ((c = *string++) != '\0') {\r | |
555 | val += c;\r | |
556 | val += (val << 10);\r | |
557 | val ^= (val >> 6);\r | |
558 | }\r | |
559 | val += (val << 3);\r | |
560 | val ^= (val >> 11);\r | |
561 | \r | |
562 | return val + (val << 15);\r | |
563 | #else\r | |
564 | register int val = 0;\r | |
565 | \r | |
566 | while ((c = *string++) != '\0') {\r | |
567 | val = val*997 + c;\r | |
568 | }\r | |
569 | \r | |
570 | return val + (val>>5);\r | |
571 | #endif\r | |
572 | }\r | |
573 | \r | |
574 | static int\r | |
575 | numcmp(x, y)\r | |
576 | long x, y;\r | |
577 | {\r | |
578 | return x != y;\r | |
579 | }\r | |
580 | \r | |
581 | static int\r | |
582 | numhash(n)\r | |
583 | long n;\r | |
584 | {\r | |
585 | return n;\r | |
586 | }\r |