Re: [1/1 take 2] Unified socket storage. (with small bench).

[David Miller <davem@davemloft.net>]

From: Evgeniy Polyakov <johnpol@2ka.mipt.ru>
Date: Wed, 9 May 2007 13:57:40 +0400

> That is only because we have very different way of working with udp.
> In udp hash table we can have multiple sockets bound to different ip
> addresses, but with the same port, so it will be placed into the same
> hash chain. With trie each socket will have differnet key, since
> addresses are different (or bound device number), so it automatically
> fixes problem with broken hash for udp (which is a bit fixed with
> extended hashing).

Yes it is power of trie.

So connection rates are interesting, but what about raw lookup
performance?  Last time this topic came up you went into some
cave when you looked at the trie lookup assembly and compared
it to hash. :)

It does make more memory references than hash by definition, and we
need to figure out whether that matters enough or not.