Date: Sun, 27 Apr 1997 20:34:32 +1000 From: Bruce Evans <bde@zeta.org.au> To: bde@zeta.org.au, michaelh@cet.co.jp Cc: hackers@hub.freebsd.org, msmith@atrad.adelaide.edu.au Subject: Re: namei & hash functions Message-ID: <199704271034.UAA04857@godzilla.zeta.org.au>
next in thread | raw e-mail | index | archive | help
>Umm. I didn't notice it in the logs. Just curious how many integer mults >by 33 equal a integer mod by a prime? Depends on the prime and the compiler. The division doesn't need to be perfectly accurate for hashing, so it can be reduced to multiplication by 2^32/prime, which in general takes 10 times as long as multiplying by 33 on a P5. Bruce
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199704271034.UAA04857>