Date:   Mon, 22 Nov 2021 14:57:27 +0200
From:   Andy Shevchenko <andriy.shevchenko@linux.intel.com>
To:     "Vaittinen, Matti" <Matti.Vaittinen@fi.rohmeurope.com>
Cc:     Matti Vaittinen <mazziesaccount@gmail.com>,
        Liam Girdwood <lgirdwood@gmail.com>,
        Mark Brown <broonie@kernel.org>,
        Jiri Kosina <trivial@kernel.org>,
        Andrew Morton <akpm@linux-foundation.org>,
        Yury Norov <yury.norov@gmail.com>,
        Kumar Kartikeya Dwivedi <memxor@gmail.com>,
        Rasmus Villemoes <linux@rasmusvillemoes.dk>,
        Geert Uytterhoeven <geert+renesas@glider.be>,
        "linux-kernel@vger.kernel.org" <linux-kernel@vger.kernel.org>
Subject: Re: [PATCH 1/4] bitops: Add single_bit_set()
Message-ID: <YZuTt3+PPvyJsFQ/@smile.fi.intel.com>
References: <cover.1637330431.git.matti.vaittinen@fi.rohmeurope.com>
 <73d5e4286282a47b614d1cc5631eb9ff2a7e2b44.1637330431.git.matti.vaittinen@fi.rohmeurope.com>
 <YZt+x2moR632x///@smile.fi.intel.com>
 <2c22b52f-9a1f-06f5-f008-d568096f5c4d@fi.rohmeurope.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <2c22b52f-9a1f-06f5-f008-d568096f5c4d@fi.rohmeurope.com>
Organization: Intel Finland Oy - BIC 0357606-4 - Westendinkatu 7, 02160 Espoo
Precedence: bulk

On Mon, Nov 22, 2021 at 12:42:21PM +0000, Vaittinen, Matti wrote:
> On 11/22/21 13:28, Andy Shevchenko wrote:
> > On Mon, Nov 22, 2021 at 01:03:25PM +0200, Matti Vaittinen wrote:
> >> There are cases when it is useful to check a bit-mask has only one bit
> >> set. Add a generic helper for it instead of baking own one for each
> >> user.

> > So, you decided to reinvent hamming weight...
> > Please, drop this patch and use corresponding hweight() call.

> Thanks Andy.
> 
> There are few differences to hamming weight here. We scan only given 
> amount of bits - and we will end scanning immediately when we hit second 
> set bit. Oh, and obviously we only return information whether there is 
> exactly one bit set. So no, this is not hamming weight().

What do you mean by this?

hweight() will return you the number of the non-zero elements in the set.
In application to boolean based arrays it means the number of bits that
are set. Obviously, the condition `hweight() == 1` is what you are looking
for.

Or is there anything that missed in the equation?

> Yet, I think you are correct. My use-case does not warrant adding this. 
> I have no need for scanning only certain amount of bits.

(I guess no need to tell that eliminating bits is using mask in the parameter
 as you do anyway by supplying amount of bits.)

> I think I actually tried using hweight() at some point but don't really 
> remember why I rolled the single_bit_set. (I remember the hweight() 
> usage because I had to do some googling as I had never heard term 
> hamming weight before).

Oh, it should be a very good reason not to use hweight() since on some
architectures it might become just one assembly instruction.

> I'll see how it works out and if (when) it does I'll respin the series 
> w/o this as you suggested. So thanks.

(Side note: all your sentences but last in all of the paragraphs are ending
 with trailing space. For example, "series " and "thanks." for the comparison
 in the previous paragraph. Can you fix this, please?)

-- 
With Best Regards,
Andy Shevchenko