[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20171205.144758.229053819644783992.davem@davemloft.net>
Date: Tue, 05 Dec 2017 14:47:58 -0500 (EST)
From: David Miller <davem@...emloft.net>
To: tom@...ntonium.net
Cc: netdev@...r.kernel.org, herbert@...dor.apana.org.au,
rohit@...ntonium.net
Subject: Re: [PATCH v2 net-next 0/5] rhashtable: New features in walk and
bucket
From: Tom Herbert <tom@...ntonium.net>
Date: Mon, 4 Dec 2017 10:31:40 -0800
> This patch contains some changes to related rhashtable:
>
> - Above allow rhashtable_walk_start to return void
> - Add a functon to peek at the next entry during a walk
> - Abstract out function to compute a has for a table
> - A library function to alloc a spinlocks bucket array
> - Call the above function for rhashtable locks allocation
>
> Tested: Exercised using various operations on an ILA xlat
> table.
>
> v2:
> - Apply feedback from Herbert. Don't change semantics of resize
> event reporting and -EAGAIN, just simplify API for callers that
> ignore those.
> - Add end_of_table in iter to reliably tell when the iterator has
> reached to the eno.
I'll allow Herbert time to think about this some more as he requested
in comments against the first version of this series.
Thanks.
Powered by blists - more mailing lists