ed38f5d5d8
1999-10-23 08:51 -0700 Zack Weinberg <zack@bitmover.com> * hashtab.c (find_hash_table_entry): When returning a DELETED_ENTRY slot, change it to EMPTY_ENTRY first. (clear_hash_table_slot): New function which deletes an entry by its position in the table, not its value. (traverse_hash_table): New function which calls a hook function for every live entry in the table. * hashtab.h: Give hash_table_t a struct tag. Add prototypes for clear_hash_table_slot and traverse_hash_table. Correct prototype of all_hash_table_collisions. From-SVN: r30138 |
||
---|---|---|
.. | ||
ansidecl.h | ||
ChangeLog | ||
COPYING | ||
demangle.h | ||
floatformat.h | ||
fnmatch.h | ||
getopt.h | ||
hashtab.h | ||
libiberty.h | ||
objalloc.h | ||
obstack.h | ||
splay-tree.h | ||
symcat.h |