aboutsummaryrefslogtreecommitdiffstats
path: root/kernel
diff options
context:
space:
mode:
authorSukadev Bhattiprolu <sukadev@us.ibm.com>2006-10-02 05:17:20 -0400
committerLinus Torvalds <torvalds@g5.osdl.org>2006-10-02 10:57:14 -0400
commit6a1f3b84557774a46af68747c92d8f36382027ae (patch)
treeab0c42601a07e7b9ea92cbf6a6ecf1d486302bdf /kernel
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>
Diffstat (limited to 'kernel')
-rw-r--r--kernel/pid.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/kernel/pid.c b/kernel/pid.c
index 5c9037ba42f5..0a45de2918e2 100644
--- a/kernel/pid.c
+++ b/kernel/pid.c
@@ -53,12 +53,12 @@ int pid_max_max = PID_MAX_LIMIT;
53 * value does not cause lots of bitmaps to be allocated, but 53 * value does not cause lots of bitmaps to be allocated, but
54 * the scheme scales to up to 4 million PIDs, runtime. 54 * the scheme scales to up to 4 million PIDs, runtime.
55 */ 55 */
56typedef struct pidmap { 56struct pidmap {
57 atomic_t nr_free; 57 atomic_t nr_free;
58 void *page; 58 void *page;
59} pidmap_t; 59};
60 60
61static pidmap_t pidmap_array[PIDMAP_ENTRIES] = 61static struct pidmap pidmap_array[PIDMAP_ENTRIES] =
62 { [ 0 ... PIDMAP_ENTRIES-1 ] = { ATOMIC_INIT(BITS_PER_PAGE), NULL } }; 62 { [ 0 ... PIDMAP_ENTRIES-1 ] = { ATOMIC_INIT(BITS_PER_PAGE), NULL } };
63 63
64/* 64/*
@@ -78,7 +78,7 @@ static __cacheline_aligned_in_smp DEFINE_SPINLOCK(pidmap_lock);
78 78
79static fastcall void free_pidmap(int pid) 79static fastcall void free_pidmap(int pid)
80{ 80{
81 pidmap_t *map = pidmap_array + pid / BITS_PER_PAGE; 81 struct pidmap *map = pidmap_array + pid / BITS_PER_PAGE;
82 int offset = pid & BITS_PER_PAGE_MASK; 82 int offset = pid & BITS_PER_PAGE_MASK;
83 83
84 clear_bit(offset, map->page); 84 clear_bit(offset, map->page);
@@ -88,7 +88,7 @@ static fastcall void free_pidmap(int pid)
88static int alloc_pidmap(void) 88static int alloc_pidmap(void)
89{ 89{
90 int i, offset, max_scan, pid, last = last_pid; 90 int i, offset, max_scan, pid, last = last_pid;
91 pidmap_t *map; 91 struct pidmap *map;
92 92
93 pid = last + 1; 93 pid = last + 1;
94 if (pid >= pid_max) 94 if (pid >= pid_max)