Re: [PATCH] Optimize is_power_of_2().

On Jun 15 2007 18:56, Vegard Nossum wrote:
> bool is_power_of_2(unsigned long n)
> {
>-	return (n != 0 && ((n & (n - 1)) == 0));
>+	return n * !(n & (n - 1));
> }

There is a third way which uses neither * nor &&, but []:

bool is_power_of_2(unsigned long n)
{
	static const bool yn[] = {
		[0] = false,
		[1 ... (8 * sizeof(n) - 1)] = true,
	};
	return yn[(n & (n - 1)) == 0];
}



	Jan
-- 
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

---

• Follow-Ups:
  • Re: [PATCH] Optimize is_power_of_2().
    • From: "David M. Lloyd" <[email protected]>

• References:
  • [PATCH] Optimize is_power_of_2().
    • From: Vegard Nossum <[email protected]>

• Prev by Date: Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3
• Next by Date: Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3
• Previous by thread: Re: [PATCH] Optimize is_power_of_2().
• Next by thread: Re: [PATCH] Optimize is_power_of_2().
• Index(es):
  • Date
  • Thread

[Index of Archives]     [Kernel Newbies]     [Netfilter]     [Bugtraq]     [Photo]     [Stuff]     [Gimp]     [Yosemite News]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Video 4 Linux]     [Linux for the blind]     [Linux Resources]