Re: 802.1q Was (Re: Plans for 2.5 / 2.6 ???

[Mitchell Blank Jr <mitch@xxxxxxxxxx>]

Ben Greear wrote:
> Seems a hashtable would be nice for the ifindex....

The problemn with using a hashtable: how big should it be?  After all
you want it small enough that there isn't much memory waste if you
have 3 devices, yet we can efficiently do a lookup on 10000 devices.
That's why I'm thinking a B+ tree or something would be more
appropriate.

People on lkml occasionally talk about making a general tree
implementation similar to <linux/list.h>.. does anyone know if
there's code somewhere?

> Also, if it takes out a linear search in a critical path (with seemingly
> minimal overhead), then I don't even think it should be a configurable
> option, just *IN* there!

I personally agree, but since some people seem strongly against the idea
it's a somewhat a matter of politics.

-Mitch