3 * $Id: sym.c,v 1.10 1999/12/10 23:42:04 mdw Exp $
5 * Symbol table management
7 * (c) 1998 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of the mLib utilities library.
14 * mLib is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * mLib is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with mLib; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.10 1999/12/10 23:42:04 mdw
34 * Change header file guard names.
36 * Revision 1.9 1999/10/22 22:36:37 mdw
37 * New test structure for symbol tables.
39 * Revision 1.8 1999/08/02 14:45:48 mdw
40 * Break low-level hashtable code out from sym.
42 * Revision 1.7 1999/06/01 09:49:08 mdw
43 * Allow things to be looked up by just their caller-supplied hashes. This
44 * actually needs to be thought through better.
46 * Revision 1.6 1999/05/26 21:08:31 mdw
47 * Rename symbols in line with newer conventions.
49 * Revision 1.5 1999/05/13 22:48:37 mdw
50 * Twiddle the extension threshold. Change `-ise' to `-ize' throughout.
52 * Revision 1.4 1999/05/06 19:51:35 mdw
53 * Reformatted the LGPL notice a little bit.
55 * Revision 1.3 1999/05/05 18:50:31 mdw
56 * Change licensing conditions to LGPL.
58 * Revision 1.2 1998/11/26 19:27:33 mdw
59 * Move SYM_NAME into the header file. Fix bugs.
61 * Revision 1.1.1.1 1998/06/17 23:44:42 mdw
62 * Initial version of mLib
66 /*----- Header files ------------------------------------------------------*/
68 /* --- ANSI headers --- */
74 /* --- Local headers --- */
85 /*----- Tuning parameters -------------------------------------------------*/
87 /* --- Initial hash table size --- *
89 * This is the initial @mask@ value. It must be of the form %$2^n - 1$%,
90 * so that it can be used to mask of the bottom bits of a hash value.
93 #define SYM_INITSZ 64 /* Size of a new hash table */
95 /* --- Maximum load factor --- *
97 * This parameter controls how much the table has to be loaded before the
98 * table is extended. The number of elements %$n$%, the number of bins %$b$%
99 * and the limit %$l$% satisfy the relation %$n < bl$%; if a new item is
100 * added to the table and this relation is found to be false, the table is
104 #define SYM_LIMIT(n) ((n) * 2) /* Load factor for growing table */
106 /*----- Main code ---------------------------------------------------------*/
108 /* --- @sym_create@ --- *
110 * Arguments: @sym_table *t@ = symbol table to initialize
114 * Use: Initializes the given symbol table. Raises @EXC_NOMEM@ if
115 * there isn't enough memory.
118 void sym_create(sym_table
*t
)
120 TRACK_CTX("symbol table creation");
122 hash_create(&t
->t
, SYM_INITSZ
);
123 t
->load
= SYM_LIMIT(SYM_INITSZ
);
127 /* --- @sym_destroy@ --- *
129 * Arguments: @sym_table *t@ = pointer to symbol table in question
133 * Use: Destroys a symbol table, freeing all the memory it used to
137 void sym_destroy(sym_table
*t
)
141 TRACK_CTX("symbol table destruction");
150 if (p
->len
> SYM_BUFSZ
)
151 sub_free(p
->name
.p
, p
->len
);
159 /* --- @sym_find@ --- *
161 * Arguments: @sym_table *t@ = pointer to symbol table in question
162 * @const char *n@ = pointer to symbol table to look up
163 * @long l@ = length of the name string or negative to measure
164 * @size_t sz@ = size of desired symbol object, or zero
165 * @unsigned *f@ = pointer to a flag, or null.
167 * Returns: The address of a @sym_base@ structure, or null if not found
170 * Use: Looks up a symbol in a given symbol table. The name is
171 * passed by the address of its first character. The length
172 * may be given, in which case the name may contain arbitrary
173 * binary data, or it may be given as a negative number, in
174 * which case the length of the name is calculated as
177 * The return value is the address of a pointer to a @sym_base@
178 * block (which may have other things on the end, as above). If
179 * the symbol could be found, the return value points to the
180 * symbol block. If the symbol wasn't there, then if @sz@ is
181 * nonzero, a new symbol is created and its address is returned;
182 * otherwise a null pointer is returned. The exception
183 * @EXC_NOMEM@ is raised if the block can't be allocated.
185 * The value of @*f@ indicates whether a new symbol entry was
186 * created: a nonzero value indicates that an old value was
190 void *sym_find(sym_table
*t
, const char *n
, long l
, size_t sz
, unsigned *f
)
194 hash_base
**bin
, **p
;
197 /* --- Find the correct bin --- */
199 len
= l
< 0 ?
strlen(n
) + 1 : l
;
200 CRC32(hash
, 0, n
, len
);
201 bin
= HASH_BIN(&t
->t
, hash
);
203 /* --- Search the bin list --- */
205 for (p
= bin
; *p
; p
= &(*p
)->next
) {
207 if (hash
== q
->b
.hash
&& len
== q
->len
&& !memcmp(n
, SYM_NAME(q
), len
)) {
209 /* --- Found a match --- *
211 * As a minor, and probably pointless, tweak, move the item to the
212 * front of its bin list.
219 /* --- Return the block --- */
226 /* --- Couldn't find the item there --- */
231 /* --- Create a new symbol block and initialize it --- */
234 TRACK_CTX("new symbol creation");
242 if (len
<= SYM_BUFSZ
)
243 memcpy(q
->name
.b
, n
, len
);
246 q
->name
.p
= sub_alloc(len
);
247 memcpy(q
->name
.p
, n
, len
);
261 /* --- Consider growing the array --- */
265 if (!t
->load
&& hash_extend(&t
->t
))
266 t
->load
= SYM_LIMIT(t
->t
.mask
/ 2 + 1);
268 /* --- Finished that, so return the new symbol block --- */
273 /* --- @sym_remove@ --- *
275 * Arguments: @sym_table *t@ = pointer to a symbol table object
276 * @void *p@ = pointer to symbol table entry
280 * Use: Removes the object from the symbol table. The space occupied
281 * by the object and its name is freed; anything else attached
282 * to the entry should already be gone by this point.
285 void sym_remove(sym_table
*t
, void *p
)
288 hash_remove(&t
->t
, &q
->b
);
289 if (q
->len
> SYM_BUFSZ
)
290 sub_free(q
->name
.p
, q
->len
);
295 /* --- @sym_mkiter@ --- *
297 * Arguments: @sym_iter *i@ = pointer to an iterator object
298 * @sym_table *t@ = pointer to a symbol table object
302 * Use: Creates a new symbol table iterator which may be used to
303 * iterate through a symbol table.
306 void sym_mkiter(sym_iter
*i
, sym_table
*t
) { SYM_MKITER(i
, t
); }
308 /* --- @sym_next@ --- *
310 * Arguments: @sym_iter *i@ = pointer to iterator object
312 * Returns: Pointer to the next symbol found, or null when finished.
314 * Use: Returns the next symbol from the table. Symbols are not
315 * returned in any particular order.
318 void *sym_next(sym_iter
*i
)
325 /*----- That's all, folks -------------------------------------------------*/