[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20101129.215303.48488457.davem@davemloft.net>
Date: Mon, 29 Nov 2010 21:53:03 -0800 (PST)
From: David Miller <davem@...emloft.net>
To: eric.dumazet@...il.com
Cc: xiaosuo@...il.com, netdev@...r.kernel.org
Subject: Re: [PATCH 1/3] inetpeer: Support ipv6 addresses.
From: Eric Dumazet <eric.dumazet@...il.com>
Date: Tue, 30 Nov 2010 06:42:16 +0100
> Its a bit early in the morning here, I must confess I dont yet
> understand your patch David :)
>
> As we use a tree, why not using two different trees for ipv4 / ipv6 ?
The "key" just creates a natural ordering in the tree, it's
almost arbitrary except that it must distribute well amongst
the entries.
I currently don't see any reason to make two trees right now.
> I dont understand how computing a 32bit key (sort of hash key) is going
> to help when hash collision happens, with an avl tree.
> Either version of tree (AVL/rbtree) will be expensive to use if depth is
> big (With 2 millions entries, depth is going to be very big). I
> understand you want to get rid of route cache ?
Do we plan to talk to 2 million unique destinations and have active
non-default metrics for each one of them very often?
inet_peer entries will only get created when we need to make
non-default metric settings for a specific destination address.
See that's the thing, it's scope is so much smaller than the existing
routing cache. It's only going to be used in limited if not
controlled cases.
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists