[prev in list] [next in list] [prev in thread] [next in thread] 

List:       linux-netdev
Subject:    [PATCH net-next 0/2] rhashtable: Quick initial table growth
From:       Thomas Graf <tgraf () suug ! ch>
Date:       2015-04-30 22:46:43
Message-ID: 1430434005-6143-1-git-send-email-tgraf () suug ! ch
[Download RAW message or body]

Besides a trivial cleanup. This proposes to introduce a quicker growth
algorithm for very small table sizes to avoid a large number of resize
cycles to go through. I experienced up to 15 chained resizes when
growing from small table sizes. A typical use case where this matters
is the nft set restore if no hint for the table size is given.

Thomas Graf (2):
  rhashtable: Simplify iterator code
  rhashtable: Quick initial growth of tables

 lib/rhashtable.c | 45 +++++++++++++++++++++++++++++++++++++--------
 1 file changed, 37 insertions(+), 8 deletions(-)

-- 
1.9.3

--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
[prev in list] [next in list] [prev in thread] [next in thread] 

Configure | About | News | Add a list | Sponsored by KoreLogic