summaryrefslogtreecommitdiff
path: root/libihash/ChangeLog
diff options
context:
space:
mode:
authorThomas Bushnell <thomas@gnu.org>1999-03-05 22:21:53 +0000
committerThomas Bushnell <thomas@gnu.org>1999-03-05 22:21:53 +0000
commit77b6f43a9626ed1939a626ec91936ac78d1415cb (patch)
tree5c8fcdc94c350fea0d8b0f17acbf40e46cb33c6b /libihash/ChangeLog
parent511ce6420fe41abb5fea6b294fba9a21548ecca4 (diff)
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).
Diffstat (limited to 'libihash/ChangeLog')
-rw-r--r--libihash/ChangeLog7
1 files changed, 7 insertions, 0 deletions
diff --git a/libihash/ChangeLog b/libihash/ChangeLog
index 62f056e9..000d60a6 100644
--- a/libihash/ChangeLog
+++ b/libihash/ChangeLog
@@ -1,3 +1,10 @@
+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.