aboutsummaryrefslogtreecommitdiff
path: root/libihash
Commit message (Collapse)AuthorAgeFilesLines
* .Roland McGrath2001-08-151-0/+11
|
* 2001-08-15 Roland McGrath <roland@frob.com>Roland McGrath2001-08-154-26/+70
| | | | | | | | | | | * sizes.c: New file, a list of prime numbers useful for table sizes. * priv.h (_ihash_sizes, _ihash_nsizes): Declare. (_ihash_nextprime): Don't. * ihash.c (ihash_add): Select sizes from the _ihash_sizes array instead of using _ihash_nextprime. * Makefile: Clean up whitespace, reorder all the variable definitions. (SRCS): Remove primes.c, add sizes.c instead. (OBJS): Define dynamically.
* .Roland McGrath1999-03-071-0/+4
|
* 1999-03-07 Roland McGrath <roland@baalperazim.frob.com>Roland McGrath1999-03-071-12/+9
| | | | * primes.c: Fix last change.
* Fri Mar 5 17:13:04 1999 Thomas Bushnell, BSG <tb@mit.edu>Thomas Bushnell1999-03-052-4/+9
| | | | | | | * primes.c (_ihash_nextprime): Use a dynamically-sized array for `seive' instead of alloca, so that if we are looping we won't allocate more stack than necessary. Suggested by wesommer@mit.edu (Bill Sommerfeld).
* .Miles Bader1997-06-201-0/+4
|
* (ihash_create):Miles Bader1997-06-201-1/+3
| | | | Initialize CLEANUP & CLEANUP_ARG fields.
* Initial revisionRoland McGrath1996-07-171-0/+21
|
* Undo last change.Roland McGrath1996-04-251-6/+4
|
* (ihash_find): Change return type to void **.Roland McGrath1996-04-251-4/+6
|
* Include "priv.h".Michael I. Bushnell1996-04-112-0/+2
|
* Initial revisionMichael I. Bushnell1996-04-111-0/+21
|
* (LCLHDRS): Add priv.h.Michael I. Bushnell1996-04-111-2/+2
|
* (ihash_add): New name of nextprime.Michael I. Bushnell1996-04-111-2/+2
|
* (_ihash_nextprime): Renamed from nextprime.c. All callers changed.Michael I. Bushnell1996-04-111-1/+1
|
* Include <spin_lock.h>.Michael I. Bushnell1996-03-071-3/+12
| | | | | (table_lock): New variable. (nextprime): Lock table_lock around operation of routine.
* (ihash_locp_remove): Get rid of the optimization to use HASH_EMPTY instead ofMiles Bader1995-08-071-18/+3
| | | | | | HASH_DEL when the next position on the chain is empty -- different hash chains may share this cell, and have different next positions, leading to random additional entries sometimes disappearing when deleting something.
* Initial revisionMichael I. Bushnell1995-06-061-0/+32
|
* Include <errno.h>.Michael I. Bushnell1995-06-051-0/+3
|
* Initial revisionMiles Bader1995-03-313-0/+521