Re: [PATCH 1/4] bitops: Add single_bit_set()

[Vaittinen, Matti]

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.
>>
>> Signed-off-by: Matti Vaittinen <matti.vaittinen@xxxxxxxxxxxxxxxxx>
>> ---
>> I am not at all sure what would be the best place for this. Please let
>> me know if you think some other file would be more appropriate.
> 
> 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().

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 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).

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.

--Matti

-- 
The Linux Kernel guy at ROHM Semiconductors

Matti Vaittinen, Linux device drivers
ROHM Semiconductors, Finland SWDC
Kiviharjunlenkki 1E
90220 OULU
FINLAND

~~ this year is the year of a signature writers block ~~