On Mon, 2002-07-29 at 13:56, Andi Kleen wrote:
> here is a patch for 2.4 that just makes it use get_free_pages to test the
> TLB theory. Another obvious improvement would be to not use list_heads
> for the hash table buckets - a single pointer would likely suffice and
> it would cut the hash table in half, saving cache, TLB and memory.
I think the list_heads are used for only one thing currently, for the
early eviction in case of overload, then it scans backwards in the
chains to find unreplied connections to evict, or so the comment in
/* Traverse backwards: gives us oldest, which is roughly LRU */
but then it uses the normal LIST_FIND macro which I think traverses the
list in the normal forward direction. I havn't looked into the rest of
the code but I can't seem to remember anything that needs list_heads.
I think Patrick Schaaf is looking into conntrack as we speak. Maybe he
has any ideas?
I know I've had plans on rewriting the locking in conntrack which is
quite frankly horrible, one giant rwlock used for almost everything
(including the hashtable). One idea that has come to mind is using RCU
(need to learn more about it) or maybe use one rwlock per N buckets or
something. Looking at some stats from one of my routers I see that an
average connection is over 130 packets long so the ratio between reads
and writes is quite good.
And this eviction which occurs at overload needs to be redone, we can't
go around dropping one unreplied connection at a time, we need
gang-eviction of unreplied connections. We've had some nasty DDoS's here
in which our routers have been spending all cputime in conntrack trying
to evict connections to make room for the SYN floods coming in at
Never argue with an idiot. They drag you down to their level, then beat
you with experience.