1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.opensource.org/licenses/cpl1.0.txt *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* Glenn Fowler
* AT&T Research
*
* hash table library
*/
static const char id_hash[] = "\n@(#)$Id: hash (AT&T Research) 1996-08-11 $\0\n";
#include "hashlib.h"
Hash_info_t hash_info = { 0 };
/*
* create a new hash table
*/
Hash_table_t*
hashalloc(Hash_table_t* ref, ...)
{
register Hash_table_t* tab;
register Hash_table_t* ret = 0;
register int internal;
int n;
va_list ap;
va_list va[4];
va_list* vp = va;
Hash_region_f region = 0;
void* handle;
va_start(ap, ref);
/*
* check for HASH_region which must be first
*/
n = va_arg(ap, int);
if (!ref && n == HASH_region)
{
region = va_arg(ap, Hash_region_f);
handle = va_arg(ap, void*);
n = va_arg(ap, int);
if (!(tab = (Hash_table_t*)(*region)(handle, NiL, sizeof(Hash_table_t), 0)))
goto out;
memset(tab, 0, sizeof(Hash_table_t));
}
else if (!(tab = newof(0, Hash_table_t, 1, 0)))
goto out;
tab->bucketsize = (sizeof(Hash_header_t) + sizeof(char*) - 1) / sizeof(char*);
if (ref)
{
tab->flags = ref->flags & ~HASH_RESET;
tab->root = ref->root;
internal = HASH_INTERNAL;
}
else
{
if (region)
{
if (!(tab->root = (Hash_root_t*)(*region)(handle, NiL, sizeof(Hash_root_t), 0)))
goto out;
memset(tab->root, 0, sizeof(Hash_root_t));
}
else if (!(tab->root = newof(0, Hash_root_t, 1, 0)))
goto out;
if (!(tab->root->local = newof(0, Hash_local_t, 1, 0)))
goto out;
if (tab->root->local->region = region)
tab->root->local->handle = handle;
tab->root->meanchain = HASHMEANCHAIN;
internal = 0;
}
tab->size = HASHMINSIZE;
for (;;)
{
switch (n)
{
case HASH_alloc:
if (ref) goto out;
tab->root->local->alloc = va_arg(ap, Hash_alloc_f);
break;
case HASH_bucketsize:
n = (va_arg(ap, int) + sizeof(char*) - 1) / sizeof(char*);
if (n > UCHAR_MAX) goto out;
if (n > tab->bucketsize) tab->bucketsize = n;
break;
case HASH_clear:
tab->flags &= ~(va_arg(ap, int) & ~internal);
break;
case HASH_compare:
if (ref) goto out;
tab->root->local->compare = va_arg(ap, Hash_compare_f);
break;
case HASH_free:
if (ref) goto out;
tab->root->local->free = va_arg(ap, Hash_free_f);
break;
case HASH_hash:
if (ref) goto out;
tab->root->local->hash = va_arg(ap, Hash_hash_f);
break;
case HASH_meanchain:
if (ref) goto out;
tab->root->meanchain = va_arg(ap, int);
break;
case HASH_name:
tab->name = va_arg(ap, char*);
break;
case HASH_namesize:
if (ref) goto out;
tab->root->namesize = va_arg(ap, int);
break;
case HASH_region:
goto out;
case HASH_set:
tab->flags |= (va_arg(ap, int) & ~internal);
break;
case HASH_size:
tab->size = va_arg(ap, int);
if (tab->size & (tab->size - 1)) tab->flags |= HASH_FIXED;
break;
case HASH_table:
tab->table = va_arg(ap, Hash_bucket_t**);
tab->flags |= HASH_STATIC;
break;
case HASH_va_list:
if (vp < &va[elementsof(va)])
{
va_copy(*vp, ap);
vp++;
}
va_copy(ap, va_listval(va_arg(ap, va_listarg)));
break;
case 0:
if (vp > va)
{
vp--;
va_copy(ap, *vp);
break;
}
if (tab->flags & HASH_SCOPE)
{
if (!(tab->scope = ref)) goto out;
ref->frozen++;
}
if (!tab->table)
{
if (region)
{
if (!(tab->table = (Hash_bucket_t**)(*region)(handle, NiL, sizeof(Hash_bucket_t*) * tab->size, 0)))
goto out;
memset(tab->table, 0, sizeof(Hash_bucket_t*) * tab->size);
}
else if (!(tab->table = newof(0, Hash_bucket_t*, tab->size, 0))) goto out;
}
if (!ref)
{
tab->root->flags = tab->flags & HASH_INTERNAL;
tab->root->next = hash_info.list;
hash_info.list = tab->root;
}
if (!region)
{
tab->next = tab->root->references;
tab->root->references = tab;
}
ret = tab;
goto out;
default:
goto out;
}
n = va_arg(ap, int);
}
out:
va_end(ap);
if (!ret) hashfree(tab);
return(ret);
}
|
