3 * Symbol table management
5 * (c) 1998 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of the mLib utilities library.
12 * mLib is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU Library General Public License as
14 * published by the Free Software Foundation; either version 2 of the
15 * License, or (at your option) any later version.
17 * mLib is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU Library General Public License for more details.
22 * You should have received a copy of the GNU Library General Public
23 * License along with mLib; if not, write to the Free
24 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
28 /*----- Header files ------------------------------------------------------*/
30 /* --- ANSI headers --- */
36 /* --- Local headers --- */
47 /*----- Main code ---------------------------------------------------------*/
49 /* --- @sym_create@ --- *
51 * Arguments: @sym_table *t@ = symbol table to initialize
55 * Use: Initializes the given symbol table. Raises @EXC_NOMEM@ if
56 * there isn't enough memory.
59 void sym_create(sym_table
*t
)
61 hash_create(&t
->t
, SYM_INITSZ
);
63 t
->load
= SYM_LIMIT(SYM_INITSZ
);
66 /* --- @sym_destroy@ --- *
68 * Arguments: @sym_table *t@ = pointer to symbol table in question
72 * Use: Destroys a symbol table, freeing all the memory it used to
76 void sym_destroy(sym_table
*t
)
91 /* --- @sym_find@ --- *
93 * Arguments: @sym_table *t@ = pointer to symbol table in question
94 * @const char *n@ = pointer to symbol name to look up
95 * @long l@ = length of the name string or negative to measure
96 * @size_t sz@ = size of desired symbol object, or zero
97 * @unsigned *f@ = pointer to a flag, or null.
99 * Returns: The address of a @sym_base@ structure, or null if not found
102 * Use: Looks up a symbol in a given symbol table. The name is
103 * passed by the address of its first character. The length
104 * may be given, in which case the name may contain arbitrary
105 * binary data, or it may be given as a negative number, in
106 * which case the length of the name is calculated as
109 * The return value is the address of a pointer to a @sym_base@
110 * block (which may have other things on the end, as above). If
111 * the symbol could be found, the return value points to the
112 * symbol block. If the symbol wasn't there, then if @sz@ is
113 * nonzero, a new symbol is created and its address is returned;
114 * otherwise a null pointer is returned. The exception
115 * @EXC_NOMEM@ is raised if the block can't be allocated.
117 * The value of @*f@ indicates whether a new symbol entry was
118 * created: a nonzero value indicates that an old value was
122 void *sym_find(sym_table
*t
, const char *n
, long l
, size_t sz
, unsigned *f
)
126 hash_base
**bin
, **p
;
129 /* --- Find the correct bin --- */
131 len
= l
< 0 ?
strlen(n
) : l
;
132 hash
= UNIHASH(&unihash_global
, n
, len
);
133 bin
= HASH_BIN(&t
->t
, hash
);
135 /* --- Search the bin list --- */
137 for (p
= bin
; *p
; p
= &(*p
)->next
) {
139 if (hash
== q
->b
.hash
&& len
== q
->len
&& !memcmp(n
, SYM_NAME(q
), len
)) {
141 /* --- Found a match --- *
143 * As a minor, and probably pointless, tweak, move the item to the
144 * front of its bin list.
151 /* --- Return the block --- */
158 /* --- Couldn't find the item there --- */
163 /* --- Create a new symbol block and initialize it --- *
165 * The name is attached to the end of the symbol block.
168 q
= x_alloc(t
->t
.a
, sz
+ len
+ 1);
171 q
->name
= (char *)q
+ sz
;
172 memcpy(q
->name
, n
, len
);
177 /* --- Consider growing the array --- */
181 if (!t
->load
&& hash_extend(&t
->t
))
182 t
->load
= SYM_LIMIT(t
->t
.mask
+ 1);
184 /* --- Finished that, so return the new symbol block --- */
189 /* --- @sym_remove@ --- *
191 * Arguments: @sym_table *t@ = pointer to a symbol table object
192 * @void *p@ = pointer to symbol table entry
196 * Use: Removes the object from the symbol table. The space occupied
197 * by the object and its name is freed; anything else attached
198 * to the entry should already be gone by this point.
201 void sym_remove(sym_table
*t
, void *p
)
204 hash_remove(&t
->t
, &q
->b
);
209 /* --- @sym_mkiter@ --- *
211 * Arguments: @sym_iter *i@ = pointer to an iterator object
212 * @sym_table *t@ = pointer to a symbol table object
216 * Use: Creates a new symbol table iterator which may be used to
217 * iterate through a symbol table.
220 void sym_mkiter(sym_iter
*i
, sym_table
*t
) { SYM_MKITER(i
, t
); }
222 /* --- @sym_next@ --- *
224 * Arguments: @sym_iter *i@ = pointer to iterator object
226 * Returns: Pointer to the next symbol found, or null when finished.
228 * Use: Returns the next symbol from the table. Symbols are not
229 * returned in any particular order.
232 void *sym_next(sym_iter
*i
)
239 /*----- That's all, folks -------------------------------------------------*/