[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20180719.234329.512279372120817504.davem@davemloft.net>
Date: Thu, 19 Jul 2018 23:43:29 -0700 (PDT)
From: David Miller <davem@...emloft.net>
To: neilb@...e.com
Cc: herbert@...dor.apana.org.au, tgraf@...g.ch, netdev@...r.kernel.org,
linux-kernel@...r.kernel.org, eric.dumazet@...il.com
Subject: Re: [PATCH - revised] rhashtable: detect when object movement
might have invalidated a lookup
From: NeilBrown <neilb@...e.com>
Date: Fri, 20 Jul 2018 16:30:34 +1000
> Does this ruling also apply to the bit-spin-lock changes and the
> per-cpu-counter changes that I have proposed? These improve
> scalability when updates dominate. Not having these in mainline
> would mean I need to carry a separate rhashtables implementation for
> lustre, which means code diversion which isn't healthy in the long
> run.
If it helps existing rhashtable users generally, then it is fine,
since it will actually be tested by upstream users.
Thanks.
Powered by blists - more mailing lists