|
Hello,
On Mon, 17 Feb 2003, Roberto Nibali wrote:
> Agreed. Plus I would love to know why people always want to increase it? I
> remember that at one point we had a piece of code testing the hash table. I
> think Julian and/or Wensong wrote it. Does anyone of you still have that code?
After long search ... here it is:
http://www.ssi.bg/~ja/hashlvs-0.1.tgz
I created script for easy testing. Currently, there are 2 hash
functions for tests. I don't remember for what LVS version the
hash_*.c files were created. The usage:
get copy of the conn table output (use real data) and feed it to
the scripts by specifying the used hash table size (in bits) and the
desired hash function method. The result is the expected access
time in pseudo units. Bigger access time means slower lookup.
> We used it to tweak the hash function ... in case you guys forgot ;).
>
> Best regards,
> Roberto Nibali, ratz
Regards
--
Julian Anastasov <ja@xxxxxx>
|
