[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: more about proc

From: Niels Möller
Subject: Re: more about proc
Date: 15 Aug 2001 10:37:44 +0200

Marcus Brinkmann <Marcus.Brinkmann@ruhr-uni-bochum.de> writes:

> On Wed, Aug 15, 2001 at 12:32:20AM -0400, Roland McGrath wrote:
> > It's a good bet the bug is in libihash/ihash.c, since that creates a large
> > array of chars on the stack and sets them all to 1 or 0.  
> This would be libihash/primes.c, it's the sieve used for finding the next
> prime number.

Is there any good reason why primes are generated at run time?
Wouldn't it be good enough to have a fix (or automatically generated
at compile time) list of primes close to 2^i (say, 30 primes) or
2^(i/2) (about 60) if you want smaller steps?


reply via email to

[Prev in Thread] Current Thread [Next in Thread]