linux-kernel - Re: [PATCH] Re-organization of PIDMAP

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-Id: <20080114092035.321a64cc.randy.dunlap@oracle.com>
Date:	Mon, 14 Jan 2008 09:20:35 -0800
From:	Randy Dunlap <randy.dunlap@...cle.com>
To:	ratn.josh@...il.com
Cc:	linux-kernel@...r.kernel.org, trivial@...nel.org,
	akpm@...ux-foundation.org
Subject: Re: [PATCH] Re-organization of PIDMAP_ENTRIES macro expansion

On Mon, 14 Jan 2008 16:20:35 +0530 Ratnadeep Joshi wrote:

> This patch tries to re-organize the macro expansion of PIDMAP_ENTRIES
> (possibly) to a more clear one.
> 
> Thanks,
> - Ratnadeep Joshi
> 
> diff --git a/include/linux/pid_namespace.h
> b/include/linux/pid_namespace.h
> index 1689e28..06e3e99 100644
> --- a/include/linux/pid_namespace.h
> +++ b/include/linux/pid_namespace.h
> @@ -12,7 +12,7 @@ struct pidmap {
>         void *page;
>  };
>  
> -#define PIDMAP_ENTRIES         ((PID_MAX_LIMIT + 8*PAGE_SIZE -
> 1)/PAGE_SIZE/8)
> +#define PIDMAP_ENTRIES         ((PID_MAX_LIMIT - 1)/PAGE_SIZE/8 + 1)
>  
>  struct pid_namespace {
>  	struct kref kref;


I beg to disagree.  There is a very common (idiomatic) way for
doing this kind of calculation and the first/original expression
is in that form, although it's a little difficult to recognize.

This common formula lives in linux/kernel.h:

#define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d))

where n is (AFAIK) numerator and d is divisor.

Example:  One use of this is in linux/bitops.h:

#define BITS_TO_LONGS(nr)	DIV_ROUND_UP(nr, BITS_PER_LONG)

This macro returns the number of longs that it takes to hold
'nr' bits.  Expanded, it looks like:

nr_longs = (nr_bits + BITS_PER_LONG - 1) / BITS_PER_LONG;

The idiomatic formula handles boundary conditions very nicely.


Now for PIDMAP_ENTRIES, use 8 * PAGE_SIZE as the (d) part of
DIV_ROUND_UP() and you can see that it is done correctly.

---
~Randy
--
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/