blob: 22e40def77bcda2aed433fc0feb94bbe2ee4532d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
2006-07-11 Samuel Thibault <samuel.thibault@ens-lyon.org>
* ihash.c (add_one): Cast VALUE with (hurd_ihash_locp_t *) instead of
(hurd_ihash_locp_t).
2004-04-21 Marcus Brinkmann <marcus@gnu.org>
* ihash.h (HURD_IHASH_ITERATE): Don't use increment operator in
assignment, but just add one. Reported by Ognyan Kulev.
2004-04-01 Marco Gerards <metgerards@student.han.nl>
* ihash.c (hurd_ihash_remove): Don't look for the index when the
hashtable is empty.
* ihash.h (HURD_IHASH_ITERATE): Doc fix.
2004-03-07 Marcus Brinkmann <marcus@gnu.org>
* ihash.h (HURD_IHASH_NO_LOCP): Change to INTPTR_MIN.
(struct hurd_ihash): Change type of locp_offset from off_t to
intptr_t.
(hurd_ihash_init): Likewise in prototype.
(hurd_ihash_create): Likewise in prototype.
* ihash.c (hurd_ihash_init): Likewise in definition.
(hurd_ihash_create): Likewise in definition.
2003-08-17 Marcus Brinkmann <marcus@gnu.org>
* ihash.c: Rewritten.
* ihash.h: Rewritten.
* Makefile (SRCS): Remove sizes.c.
(LCLHDRS): Remove priv.h.
* primes.c, sizes.c, priv.h: Files removed.
2001-08-15 Roland McGrath <roland@frob.com>
* 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.
1999-03-07 Roland McGrath <roland@baalperazim.frob.com>
* primes.c: Fix last change.
Fri Mar 5 17:13:04 1999 Thomas Bushnell, BSG <tb@mit.edu>
* 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 <miles@gnu.ai.mit.edu>
* ihash.c (ihash_create): Initialize CLEANUP & CLEANUP_ARG fields.
Thu Apr 11 15:26:18 1996 Michael I. Bushnell, p/BSG <mib@gnu.ai.mit.edu>
* ihash.c: Include "priv.h".
* primes.c: Likewise.
* priv.h: New file.
* Makefile (LCLHDRS): Add priv.h.
* primes.c (_ihash_nextprime): Renamed from nextprime.c. All
callers changed.
Thu Mar 7 15:01:46 1996 Michael I. Bushnell, p/BSG <mib@gnu.ai.mit.edu>
* primes.c: Include <spin_lock.h>.
(table_lock): New variable.
(nextprime): Lock table_lock around operation of routine.
Sun Aug 6 15:23:13 1995 Miles Bader <miles@churchy.gnu.ai.mit.edu>
* ihash.c (ihash_locp_remove): Get rid of the optimization to use
HASH_EMPTY instead of HASH_DEL when the next position on the chain
is empty -- different hash chains may share this cell, and have
different next positions.
|
