aboutsummaryrefslogtreecommitdiff
path: root/libiberty/hashtab.c
AgeCommit message (Collapse)AuthorFilesLines
2000-11-29* hashtab.c (higher_prime_number): Use a table, rather than aDJ Delorie1-22/+56
seive, to find the next prime.
2000-11-04 * hashtab.c (htab_expand): Change to return int. Use calloc orHans-Peter Nilsson1-8/+58
xcalloc depending on htab->return_allocation_failure. Return zero if calloc fails. (htab_create): Update comment to cover memory allocation. (htab_try_create): New. (htab_find_slot_with_hash): Return NULL if htab_expand fails. Update comment to cover this.
2000-11-03 * hashtab.c: Change void * to PTR where necessary.Hans-Peter Nilsson1-36/+36
(htab_create, htab_expand): Correct formatting of comment before function.
2000-06-15Synced with libiberty in the gcc repository.H.J. Lu1-62/+107
2000-05-29 * hashtab.c, partition.c, xmemdup.c: Include string.hZack Weinberg1-0/+4
if HAVE_STRING_H. * pexecute.c, xexit.c: Include stdlib.h if HAVE_STDLIB_H. * objalloc.c: Include config.h. Include stdlib.h and don't declare malloc or free if HAVE_STDLIB_H. * strerror.c, strsignal.c: Include stdlib.h if HAVE_STDLIB_H, else declare malloc without prototype. Include string.h if HAVE_STRING_H, else declare memset without prototype. Don't include stddef.h. * sort.c: Bring over from GCC.
2000-03-24merge from gccJason Merrill1-166/+265
2000-02-22import libiberty from egcsIan Lance Taylor1-0/+330