On Thu, 7 Jul 2016, Craig Gallek wrote: > This sort of seems like it's just side-stepping the problem. Given > that the size of this hash table is fixed, the lookup time of this > operation is still going to approach linear as the number of qdiscs > increases.
That's true; however the primary goal here is not to actually ultimately improve speed of qdisc lookup per se, but rather to make it possible to unhide the qdiscs which are currently omitted as the linked list takes too long to walk. The static hashtable is going help here. Thanks, -- Jiri Kosina SUSE Labs
