From mboxrd@z Thu Jan 1 00:00:00 1970 From: akpm@linux-foundation.org (Andrew Morton) Date: Tue, 3 Feb 2015 00:48:41 -0800 Subject: [RFC] change non-atomic bitops method In-Reply-To: <20150203.004031.593368249759204527.davem@davemloft.net> References: <35FD53F367049845BC99AC72306C23D1044A02027E0B@CNBJMBX05.corpusers.net> <35FD53F367049845BC99AC72306C23D1044A02027E0C@CNBJMBX05.corpusers.net> <20150202223851.f30768d0.akpm@linux-foundation.org> <20150203.004031.593368249759204527.davem@davemloft.net> Message-ID: <20150203004841.b48e84df.akpm@linux-foundation.org> To: linux-arm-kernel@lists.infradead.org List-Id: linux-arm-kernel.lists.infradead.org On Tue, 03 Feb 2015 00:40:31 -0800 (PST) David Miller wrote: > From: Andrew Morton > Date: Mon, 2 Feb 2015 22:38:51 -0800 > > > It is only with both these ratios that we can work out whether the > > patch is a net gain. My suspicion is that set_bit on an already-set > > bit is so rare that the patch will be a loss. > > A common pattern is implementing a "referenced" bit, and in that case > the bit is often already set, and in such a scenerio the proposed > change is a huge win. pagecache, dcache and icache already perform this optimisation (and only pagecache uses bitops for it anyway). I'm not sure what's left. But there's really no point in speculating about this - it's trivial to instrument the kernel and get real numbers.