[lkml]   [2018]   [Jul]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH - revised] rhashtable: detect when object movement might have invalidated a lookup
On Mon, Jul 16, 2018 at 11:23:43AM +1000, NeilBrown wrote:
> kmem_cache_free() directly. For this, I need rhashtable to be safe if
> an object is deleted and immediately re-inserted into the same hash
> chain.

This means that

A = rhashtable_lookup();

A can turn into object B when it is used. That is just too strange
for words. Can we see some actual code on how this works?

For comparison, the existing net code where this happens A doesn't
actually change and it simply moves from one hashtable to another.

I'm relucant to add semantics that would restrain on how rhashtable
works unless we have real and valid use-cases for it.

Email: Herbert Xu <>
Home Page:
PGP Key:

 \ /
  Last update: 2018-07-16 04:17    [W:0.123 / U:0.972 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site