aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSukadev Bhattiprolu <sukadev@us.ibm.com>2006-10-02 02:17:20 -0700
committerLinus Torvalds <torvalds@g5.osdl.org>2006-10-02 07:57:14 -0700
commit6a1f3b84557774a46af68747c92d8f36382027ae (patch)
treeab0c42601a07e7b9ea92cbf6a6ecf1d486302bdf
parentb68e31d0ebbcc909d1941f9f230c9d062a3a13d3 (diff)
[PATCH] pids: coding style: use struct pidmap
Use struct pidmap instead of pidmap_t. Its a subset of Eric Biederman's patch http://lkml.org/lkml/2006/2/6/271. Signed-off-by: Eric W. Biederman <ebiederm@xmission.com> Signed-off-by: Sukadev Bhattiprolu <sukadev@us.ibm.com> Cc: Dave Hansen <haveblue@us.ibm.com> Cc: Serge Hallyn <serue@us.ibm.com> Cc: Cedric Le Goater <clg@fr.ibm.com> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
-rw-r--r--kernel/pid.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/kernel/pid.c b/kernel/pid.c
index 5c9037ba42f..0a45de2918e 100644
--- a/kernel/pid.c
+++ b/kernel/pid.c
@@ -53,12 +53,12 @@ int pid_max_max = PID_MAX_LIMIT;
* value does not cause lots of bitmaps to be allocated, but
* the scheme scales to up to 4 million PIDs, runtime.
*/
-typedef struct pidmap {
+struct pidmap {
atomic_t nr_free;
void *page;
-} pidmap_t;
+};
-static pidmap_t pidmap_array[PIDMAP_ENTRIES] =
+static struct pidmap pidmap_array[PIDMAP_ENTRIES] =
{ [ 0 ... PIDMAP_ENTRIES-1 ] = { ATOMIC_INIT(BITS_PER_PAGE), NULL } };
/*
@@ -78,7 +78,7 @@ static __cacheline_aligned_in_smp DEFINE_SPINLOCK(pidmap_lock);
static fastcall void free_pidmap(int pid)
{
- pidmap_t *map = pidmap_array + pid / BITS_PER_PAGE;
+ struct pidmap *map = pidmap_array + pid / BITS_PER_PAGE;
int offset = pid & BITS_PER_PAGE_MASK;
clear_bit(offset, map->page);
@@ -88,7 +88,7 @@ static fastcall void free_pidmap(int pid)
static int alloc_pidmap(void)
{
int i, offset, max_scan, pid, last = last_pid;
- pidmap_t *map;
+ struct pidmap *map;
pid = last + 1;
if (pid >= pid_max)