[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <alpine.LNX.2.00.1607081008460.24757@cbobk.fhfr.pm>
Date: Fri, 8 Jul 2016 10:11:26 +0200 (CEST)
From: Jiri Kosina <jikos@...nel.org>
To: Craig Gallek <kraigatgoog@...il.com>
cc: Eric Dumazet <eric.dumazet@...il.com>,
Jamal Hadi Salim <jhs@...atatu.com>,
Phil Sutter <phil@....cc>, netdev <netdev@...r.kernel.org>,
LKML <linux-kernel@...r.kernel.org>
Subject: Re: [RFC PATCH v2] net: sched: convert qdisc linked list to
hashtable
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
Powered by blists - more mailing lists