1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2011 AT&T Intellectual Property *
5da2e3ebdSchin * and is licensed under the *
6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 *
77c2fbfb3SApril Chin * by AT&T Intellectual Property *
8da2e3ebdSchin * *
9da2e3ebdSchin * A copy of the License is available at *
10*b30d1939SAndy Fiddaman * http://www.eclipse.org/org/documents/epl-v10.html *
11*b30d1939SAndy Fiddaman * (with md5 checksum b35adb5213ca9657e911e9befb180842) *
12da2e3ebdSchin * *
13da2e3ebdSchin * Information and Software Systems Research *
14da2e3ebdSchin * AT&T Research *
15da2e3ebdSchin * Florham Park NJ *
16da2e3ebdSchin * *
17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> *
18da2e3ebdSchin * David Korn <dgk@research.att.com> *
19da2e3ebdSchin * Phong Vo <kpv@research.att.com> *
20da2e3ebdSchin * *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #pragma prototyped
23da2e3ebdSchin /*
24da2e3ebdSchin * Glenn Fowler
25da2e3ebdSchin * AT&T Research
26da2e3ebdSchin *
27da2e3ebdSchin * hash table library
28da2e3ebdSchin */
29da2e3ebdSchin
30da2e3ebdSchin #include "hashlib.h"
31da2e3ebdSchin
32da2e3ebdSchin /*
33da2e3ebdSchin * change table size and rehash
34da2e3ebdSchin * size must be a power of 2
35da2e3ebdSchin */
36da2e3ebdSchin
37da2e3ebdSchin void
hashsize(register Hash_table_t * tab,int size)38da2e3ebdSchin hashsize(register Hash_table_t* tab, int size)
39da2e3ebdSchin {
40da2e3ebdSchin register Hash_bucket_t** old_s;
41da2e3ebdSchin register Hash_bucket_t** new_s;
42da2e3ebdSchin register Hash_bucket_t* old_b;
43da2e3ebdSchin register Hash_bucket_t* new_b;
44da2e3ebdSchin Hash_bucket_t** old_sx;
45da2e3ebdSchin unsigned int index;
46da2e3ebdSchin Hash_region_f region;
47da2e3ebdSchin void* handle;
48da2e3ebdSchin
49da2e3ebdSchin if (size > 0 && size != tab->size && !(size & (size - 1)))
50da2e3ebdSchin {
51da2e3ebdSchin if (region = tab->root->local->region)
52da2e3ebdSchin {
53da2e3ebdSchin handle = tab->root->local->handle;
54da2e3ebdSchin new_s = (Hash_bucket_t**)(*region)(handle, NiL, sizeof(Hash_bucket_t*) * size, 0);
55da2e3ebdSchin }
56da2e3ebdSchin else new_s = newof(0, Hash_bucket_t*, size, 0);
57da2e3ebdSchin if (!new_s) tab->flags |= HASH_FIXED;
58da2e3ebdSchin else
59da2e3ebdSchin {
60da2e3ebdSchin old_sx = (old_s = tab->table) + tab->size;
61da2e3ebdSchin tab->size = size;
62da2e3ebdSchin while (old_s < old_sx)
63da2e3ebdSchin {
64da2e3ebdSchin old_b = *old_s++;
65da2e3ebdSchin while (old_b)
66da2e3ebdSchin {
67da2e3ebdSchin new_b = old_b;
68da2e3ebdSchin old_b = old_b->next;
69da2e3ebdSchin index = new_b->hash;
70da2e3ebdSchin HASHMOD(tab, index);
71da2e3ebdSchin new_b->next = new_s[index];
72da2e3ebdSchin new_s[index] = new_b;
73da2e3ebdSchin }
74da2e3ebdSchin }
75da2e3ebdSchin if ((tab->flags & (HASH_RESIZE|HASH_STATIC)) != HASH_STATIC)
76da2e3ebdSchin {
77da2e3ebdSchin if (region) (*region)(handle, tab->table, 0, 0);
78da2e3ebdSchin else free(tab->table);
79da2e3ebdSchin }
80da2e3ebdSchin tab->table = new_s;
81da2e3ebdSchin tab->flags |= HASH_RESIZE;
82da2e3ebdSchin }
83da2e3ebdSchin }
84da2e3ebdSchin }
85