summaryrefslogtreecommitdiff
path: root/libihash
AgeCommit message (Collapse)Author
1999-03-07.Roland McGrath
1999-03-071999-03-07 Roland McGrath <roland@baalperazim.frob.com>Roland McGrath
* primes.c: Fix last change.
1999-03-05Fri Mar 5 17:13:04 1999 Thomas Bushnell, BSG <tb@mit.edu>Thomas Bushnell
* 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).
1997-06-20.Miles Bader
1997-06-20(ihash_create):Miles Bader
Initialize CLEANUP & CLEANUP_ARG fields.
1996-07-17Initial revisionRoland McGrath
1996-04-25Undo last change.Roland McGrath
1996-04-25(ihash_find): Change return type to void **.Roland McGrath
1996-04-11Include "priv.h".Michael I. Bushnell
1996-04-11Initial revisionMichael I. Bushnell
1996-04-11(LCLHDRS): Add priv.h.Michael I. Bushnell
1996-04-11(ihash_add): New name of nextprime.Michael I. Bushnell
1996-04-11(_ihash_nextprime): Renamed from nextprime.c. All callers changed.Michael I. Bushnell
1996-03-07Include <spin_lock.h>.Michael I. Bushnell
(table_lock): New variable. (nextprime): Lock table_lock around operation of routine.
1995-08-07(ihash_locp_remove): Get rid of the optimization to use HASH_EMPTY instead ofMiles Bader
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.
1995-06-06Initial revisionMichael I. Bushnell
1995-06-05Include <errno.h>.Michael I. Bushnell
1995-03-31Initial revisionMiles Bader