[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20070125192044.c9c2a093.akpm@osdl.org>
Date: Thu, 25 Jan 2007 19:20:44 -0800
From: Andrew Morton <akpm@...l.org>
To: "Robert P. J. Day" <rpjday@...dspring.com>
Cc: Linux kernel mailing list <linux-kernel@...r.kernel.org>,
dhowells@...hat.com
Subject: Re: [PATCH] Add a rounddown_pow_of_two() macro to log2.h.
On Thu, 25 Jan 2007 04:32:12 -0500 (EST)
"Robert P. J. Day" <rpjday@...dspring.com> wrote:
>
> In the same way that include/linux/log2.h defines the
> roundup_pow_of_two() macro, define the rounddown_pow_of_two() macro so
> peopls can stop re-implementing this operation using a loop.
>
> Signed-off-by: Robert P. J. Day <rpjday@...dspring.com>
>
> ---
>
> compile tested on x86 using "make allyesconfig", but there wasn't
> much chance of the build failing anyway since the patch only adds the
> macro definition, it doesn't change any existing code to use it.
> those patches will be submitted later, bit by bit.
>
> diff --git a/include/linux/log2.h b/include/linux/log2.h
> index d02e1a5..6cf7081 100644
> --- a/include/linux/log2.h
> +++ b/include/linux/log2.h
> @@ -52,6 +63,15 @@ unsigned long __roundup_pow_of_two(unsigned long n)
> return 1UL << fls_long(n - 1);
> }
>
> +/*
> + * round down to nearest power of two
> + */
> +static inline __attribute__((const))
> +unsigned long __rounddown_pow_of_two(unsigned long n)
> +{
> + return 1UL << (fls_long(n) - 1);
> +}
So __rounddown_pow_of_two(16) returns 8?
> /**
> * ilog2 - log of base 2 of 32-bit or a 64-bit unsigned value
> * @n - parameter
> @@ -154,4 +174,20 @@ unsigned long __roundup_pow_of_two(unsigned long n)
> __roundup_pow_of_two(n) \
> )
>
> +/**
> + * rounddown_pow_of_two - round the given value down to nearest power of two
> + * @n - parameter
> + *
> + * round the given value down to the nearest power of two
> + * - the result is undefined when n == 0
> + * - this can be used to initialise global variables from constant data
> + */
> +#define rounddown_pow_of_two(n) \
> +( \
> + __builtin_constant_p(n) ? ( \
> + (n == 1) ? 0 : \
> + (1UL << ilog2(n)) : \
> + __rounddown_pow_of_two(n) \
> + )
But (1UL << ilog2(16)) returns 16?
And, afiact, your __rounddown_pow_of_two() is basically equivalent to (1UL
<< ilog2(n)) anyway. So a suitable (and less buggy) implementation might be
static inline unsigned long rounddown_pow_of_two(unsigned long n)
{
return (n == 1) ? 0 : (1UL << ilog2(n));
}
But I'm not sure. Please create a userspace test harness to test this
patch.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists