Commit Graph

24 Commits

Author SHA1 Message Date
DJ Delorie 686e72d729 merge from gcc 2003-10-30 18:39:13 +00:00
DJ Delorie 5f73c3782d merge from gcc 2003-06-19 20:05:36 +00:00
Jason Merrill eafaf5ebda s/burtle/iterative 2003-05-07 20:30:13 +00:00
Jason Merrill 7108c5dc79 libiberty/
* hashtab.c (burtle_hash): New fn.
        * configure.in: Add AC_C_BIGENDIAN_CROSS.
        * aclocal.m4: Include accross.m4.
        * configure, config.in: Regenerate.
include/
        * hashtab.h (burtle_hash): Prototype.
        (burtle_hash_object): New macro.
2003-05-07 18:07:53 +00:00
DJ Delorie 1ea16ec5b4 merge from gcc 2003-04-15 21:29:34 +00:00
DJ Delorie f77ed96c7b merge from gcc 2003-03-17 18:01:07 +00:00
DJ Delorie 2336e17716 merge from gcc 2003-03-12 17:28:10 +00:00
DJ Delorie c4d8feb262 merge from gcc 2003-03-12 15:08:02 +00:00
Daniel Jacobowitz 5f9624e37e include/
* hashtab.h (htab_alloc_with_arg, htab_free_with_arg): Add new types.
	(struct htab): Add alloc_arg, alloc_with_arg_f, free_with_arg_f.
	(htab_create_alloc_ex): New prototype.
	(htab_set_functions_ex): New prototype.
libiberty/
	* hashtab.c (htab_create_alloc_ex): New function.
	(hatab_set_functions_ex): New function.
	(htab_delete, htab_expand): Support alternate allocation functions.
2003-01-26 07:33:29 +00:00
DJ Delorie eed2b28c05 merge from gcc 2003-01-20 19:03:56 +00:00
DJ Delorie 1889369086 merge from gcc 2002-06-06 12:55:24 +00:00
Richard Henderson b1c933fc52 * hashtab.c (higher_prime_number): Use 7 as minimum.
(find_empty_slot_for_expand): Don't compute hash2 unless needed.
        (htab_find_slot_with_hash): Likewise.
2002-04-10 00:43:27 +00:00
DJ Delorie e6450fe561 merge from gcc 2001-10-07 17:24:36 +00:00
DJ Delorie 68a41de77d merge from gcc 2001-08-17 21:14:20 +00:00
DJ Delorie 8fc3479902 merge from gcc 2001-08-17 06:33:05 +00:00
DJ Delorie 06b0287c20 merge from gcc 2001-03-15 22:02:06 +00:00
DJ Delorie b1e51b3cd9 merge from gcc 2001-03-15 21:07:01 +00:00
DJ Delorie 5ca0f83d75 * hashtab.c (higher_prime_number): Use a table, rather than a
seive, to find the next prime.
2000-11-29 19:19:10 +00:00
Hans-Peter Nilsson 99a4c1bd6b * hashtab.c (htab_expand): Change to return int. Use calloc or
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-04 07:54:27 +00:00
Hans-Peter Nilsson e0f3df8f1e * hashtab.c: Change void * to PTR where necessary.
(htab_create, htab_expand): Correct formatting of comment before
	function.
2000-11-03 20:55:25 +00:00
H.J. Lu eb383413c2 Synced with libiberty in the gcc repository. 2000-06-15 20:56:25 +00:00
Zack Weinberg 5c82d20a26 * hashtab.c, partition.c, xmemdup.c: Include string.h
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-05-29 20:45:32 +00:00
Jason Merrill b4fe268363 merge from gcc 2000-03-24 21:31:22 +00:00
Ian Lance Taylor e2eaf47799 import libiberty from egcs 2000-02-22 15:59:20 +00:00