Blame view
kernel/pid.c
12.7 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
/* * Generic pidhash and scalable, time-bounded PID allocator * * (C) 2002-2003 William Irwin, IBM * (C) 2004 William Irwin, Oracle * (C) 2002-2004 Ingo Molnar, Red Hat * * pid-structures are backing objects for tasks sharing a given ID to chain * against. There is very little to them aside from hashing them and * parking tasks using given ID's on a list. * * The hash is always changed with the tasklist_lock write-acquired, * and the hash is only accessed with the tasklist_lock at least * read-acquired, so there's no additional SMP locking needed here. * * We have a list of bitmap pages, which bitmaps represent the PID space. * Allocating and freeing PIDs is completely lockless. The worst-case * allocation scenario when all but one out of 1 million PIDs possible are * allocated already: the scanning of 32 list entries and at most PAGE_SIZE * bytes. The typical fastpath is a single successful setbit. Freeing is O(1). |
30e49c263 pid namespaces: a... |
21 22 23 24 25 26 |
* * Pid namespaces: * (C) 2007 Pavel Emelyanov <xemul@openvz.org>, OpenVZ, SWsoft Inc. * (C) 2007 Sukadev Bhattiprolu <sukadev@us.ibm.com>, IBM * Many thanks to Oleg Nesterov for comments and help * |
1da177e4c Linux-2.6.12-rc2 |
27 28 29 30 31 32 |
*/ #include <linux/mm.h> #include <linux/module.h> #include <linux/slab.h> #include <linux/init.h> |
82524746c rcu: split list.h... |
33 |
#include <linux/rculist.h> |
1da177e4c Linux-2.6.12-rc2 |
34 35 |
#include <linux/bootmem.h> #include <linux/hash.h> |
61a58c6c2 [PATCH] rename st... |
36 |
#include <linux/pid_namespace.h> |
820e45db2 statically initia... |
37 |
#include <linux/init_task.h> |
3eb07c8c8 pid namespaces: d... |
38 |
#include <linux/syscalls.h> |
1da177e4c Linux-2.6.12-rc2 |
39 |
|
8ef047aaa pid namespaces: m... |
40 41 |
#define pid_hashfn(nr, ns) \ hash_long((unsigned long)nr + (unsigned long)ns, pidhash_shift) |
92476d7fc [PATCH] pidhash: ... |
42 |
static struct hlist_head *pid_hash; |
1da177e4c Linux-2.6.12-rc2 |
43 |
static int pidhash_shift; |
820e45db2 statically initia... |
44 |
struct pid init_struct_pid = INIT_STRUCT_PID; |
1da177e4c Linux-2.6.12-rc2 |
45 46 |
int pid_max = PID_MAX_DEFAULT; |
1da177e4c Linux-2.6.12-rc2 |
47 48 49 50 51 |
#define RESERVED_PIDS 300 int pid_max_min = RESERVED_PIDS + 1; int pid_max_max = PID_MAX_LIMIT; |
1da177e4c Linux-2.6.12-rc2 |
52 53 |
#define BITS_PER_PAGE (PAGE_SIZE*8) #define BITS_PER_PAGE_MASK (BITS_PER_PAGE-1) |
3fbc96486 [PATCH] Define st... |
54 |
|
61a58c6c2 [PATCH] rename st... |
55 56 |
static inline int mk_pid(struct pid_namespace *pid_ns, struct pidmap *map, int off) |
3fbc96486 [PATCH] Define st... |
57 |
{ |
61a58c6c2 [PATCH] rename st... |
58 |
return (map - pid_ns->pidmap)*BITS_PER_PAGE + off; |
3fbc96486 [PATCH] Define st... |
59 |
} |
1da177e4c Linux-2.6.12-rc2 |
60 61 62 63 64 65 66 67 68 |
#define find_next_offset(map, off) \ find_next_zero_bit((map)->page, BITS_PER_PAGE, off) /* * PID-map pages start out as NULL, they get allocated upon * first use and are never deallocated. This way a low pid_max * value does not cause lots of bitmaps to be allocated, but * the scheme scales to up to 4 million PIDs, runtime. */ |
61a58c6c2 [PATCH] rename st... |
69 |
struct pid_namespace init_pid_ns = { |
9a575a92d [PATCH] to nsproxy |
70 71 72 |
.kref = { .refcount = ATOMIC_INIT(2), }, |
3fbc96486 [PATCH] Define st... |
73 74 75 |
.pidmap = { [ 0 ... PIDMAP_ENTRIES-1] = { ATOMIC_INIT(BITS_PER_PAGE), NULL } }, |
84d737866 [PATCH] add child... |
76 |
.last_pid = 0, |
faacbfd3a pid namespaces: a... |
77 78 |
.level = 0, .child_reaper = &init_task, |
3fbc96486 [PATCH] Define st... |
79 |
}; |
198fe21b0 pid namespaces: h... |
80 |
EXPORT_SYMBOL_GPL(init_pid_ns); |
1da177e4c Linux-2.6.12-rc2 |
81 |
|
b461cc038 pid namespaces: m... |
82 |
int is_container_init(struct task_struct *tsk) |
b460cbc58 pid namespaces: d... |
83 |
{ |
b461cc038 pid namespaces: m... |
84 85 86 87 88 89 90 91 92 93 |
int ret = 0; struct pid *pid; rcu_read_lock(); pid = task_pid(tsk); if (pid != NULL && pid->numbers[pid->level].nr == 1) ret = 1; rcu_read_unlock(); return ret; |
b460cbc58 pid namespaces: d... |
94 |
} |
b461cc038 pid namespaces: m... |
95 |
EXPORT_SYMBOL(is_container_init); |
b460cbc58 pid namespaces: d... |
96 |
|
92476d7fc [PATCH] pidhash: ... |
97 98 99 100 101 102 103 104 105 106 107 108 109 |
/* * Note: disable interrupts while the pidmap_lock is held as an * interrupt might come in and do read_lock(&tasklist_lock). * * If we don't disable interrupts there is a nasty deadlock between * detach_pid()->free_pid() and another cpu that does * spin_lock(&pidmap_lock) followed by an interrupt routine that does * read_lock(&tasklist_lock); * * After we clean up the tasklist_lock and know there are no * irq handlers that take it we can leave the interrupts enabled. * For now it is easier to be safe than to prove it can't happen. */ |
3fbc96486 [PATCH] Define st... |
110 |
|
1da177e4c Linux-2.6.12-rc2 |
111 |
static __cacheline_aligned_in_smp DEFINE_SPINLOCK(pidmap_lock); |
b7127aa45 free_pidmap: turn... |
112 |
static void free_pidmap(struct upid *upid) |
1da177e4c Linux-2.6.12-rc2 |
113 |
{ |
b7127aa45 free_pidmap: turn... |
114 115 116 |
int nr = upid->nr; struct pidmap *map = upid->ns->pidmap + nr / BITS_PER_PAGE; int offset = nr & BITS_PER_PAGE_MASK; |
1da177e4c Linux-2.6.12-rc2 |
117 118 119 120 |
clear_bit(offset, map->page); atomic_inc(&map->nr_free); } |
61a58c6c2 [PATCH] rename st... |
121 |
static int alloc_pidmap(struct pid_namespace *pid_ns) |
1da177e4c Linux-2.6.12-rc2 |
122 |
{ |
61a58c6c2 [PATCH] rename st... |
123 |
int i, offset, max_scan, pid, last = pid_ns->last_pid; |
6a1f3b845 [PATCH] pids: cod... |
124 |
struct pidmap *map; |
1da177e4c Linux-2.6.12-rc2 |
125 126 127 128 129 |
pid = last + 1; if (pid >= pid_max) pid = RESERVED_PIDS; offset = pid & BITS_PER_PAGE_MASK; |
61a58c6c2 [PATCH] rename st... |
130 |
map = &pid_ns->pidmap[pid/BITS_PER_PAGE]; |
1da177e4c Linux-2.6.12-rc2 |
131 132 133 |
max_scan = (pid_max + BITS_PER_PAGE - 1)/BITS_PER_PAGE - !offset; for (i = 0; i <= max_scan; ++i) { if (unlikely(!map->page)) { |
3fbc96486 [PATCH] Define st... |
134 |
void *page = kzalloc(PAGE_SIZE, GFP_KERNEL); |
1da177e4c Linux-2.6.12-rc2 |
135 136 137 138 |
/* * Free the page if someone raced with us * installing it: */ |
92476d7fc [PATCH] pidhash: ... |
139 |
spin_lock_irq(&pidmap_lock); |
1da177e4c Linux-2.6.12-rc2 |
140 |
if (map->page) |
3fbc96486 [PATCH] Define st... |
141 |
kfree(page); |
1da177e4c Linux-2.6.12-rc2 |
142 |
else |
3fbc96486 [PATCH] Define st... |
143 |
map->page = page; |
92476d7fc [PATCH] pidhash: ... |
144 |
spin_unlock_irq(&pidmap_lock); |
1da177e4c Linux-2.6.12-rc2 |
145 146 147 148 149 150 151 |
if (unlikely(!map->page)) break; } if (likely(atomic_read(&map->nr_free))) { do { if (!test_and_set_bit(offset, map->page)) { atomic_dec(&map->nr_free); |
61a58c6c2 [PATCH] rename st... |
152 |
pid_ns->last_pid = pid; |
1da177e4c Linux-2.6.12-rc2 |
153 154 155 |
return pid; } offset = find_next_offset(map, offset); |
61a58c6c2 [PATCH] rename st... |
156 |
pid = mk_pid(pid_ns, map, offset); |
1da177e4c Linux-2.6.12-rc2 |
157 158 159 160 161 162 163 164 165 166 |
/* * find_next_offset() found a bit, the pid from it * is in-bounds, and if we fell back to the last * bitmap block and the final block was the same * as the starting point, pid is before last_pid. */ } while (offset < BITS_PER_PAGE && pid < pid_max && (i != max_scan || pid < last || !((last+1) & BITS_PER_PAGE_MASK))); } |
61a58c6c2 [PATCH] rename st... |
167 |
if (map < &pid_ns->pidmap[(pid_max-1)/BITS_PER_PAGE]) { |
1da177e4c Linux-2.6.12-rc2 |
168 169 170 |
++map; offset = 0; } else { |
61a58c6c2 [PATCH] rename st... |
171 |
map = &pid_ns->pidmap[0]; |
1da177e4c Linux-2.6.12-rc2 |
172 173 174 175 |
offset = RESERVED_PIDS; if (unlikely(last == offset)) break; } |
61a58c6c2 [PATCH] rename st... |
176 |
pid = mk_pid(pid_ns, map, offset); |
1da177e4c Linux-2.6.12-rc2 |
177 178 179 |
} return -1; } |
74bd59bb3 namespaces: clean... |
180 |
int next_pidmap(struct pid_namespace *pid_ns, int last) |
0804ef4b0 [PATCH] proc: rea... |
181 182 |
{ int offset; |
f40f50d3b [PATCH] Use struc... |
183 |
struct pidmap *map, *end; |
0804ef4b0 [PATCH] proc: rea... |
184 185 |
offset = (last + 1) & BITS_PER_PAGE_MASK; |
61a58c6c2 [PATCH] rename st... |
186 187 |
map = &pid_ns->pidmap[(last + 1)/BITS_PER_PAGE]; end = &pid_ns->pidmap[PIDMAP_ENTRIES]; |
f40f50d3b [PATCH] Use struc... |
188 |
for (; map < end; map++, offset = 0) { |
0804ef4b0 [PATCH] proc: rea... |
189 190 191 192 |
if (unlikely(!map->page)) continue; offset = find_next_bit((map)->page, BITS_PER_PAGE, offset); if (offset < BITS_PER_PAGE) |
61a58c6c2 [PATCH] rename st... |
193 |
return mk_pid(pid_ns, map, offset); |
0804ef4b0 [PATCH] proc: rea... |
194 195 196 |
} return -1; } |
7ad5b3a50 kernel: remove fa... |
197 |
void put_pid(struct pid *pid) |
92476d7fc [PATCH] pidhash: ... |
198 |
{ |
baf8f0f82 pid namespaces: d... |
199 |
struct pid_namespace *ns; |
92476d7fc [PATCH] pidhash: ... |
200 201 |
if (!pid) return; |
baf8f0f82 pid namespaces: d... |
202 |
|
8ef047aaa pid namespaces: m... |
203 |
ns = pid->numbers[pid->level].ns; |
92476d7fc [PATCH] pidhash: ... |
204 |
if ((atomic_read(&pid->count) == 1) || |
8ef047aaa pid namespaces: m... |
205 |
atomic_dec_and_test(&pid->count)) { |
baf8f0f82 pid namespaces: d... |
206 |
kmem_cache_free(ns->pid_cachep, pid); |
b461cc038 pid namespaces: m... |
207 |
put_pid_ns(ns); |
8ef047aaa pid namespaces: m... |
208 |
} |
92476d7fc [PATCH] pidhash: ... |
209 |
} |
bbf73147e [PATCH] pid: expo... |
210 |
EXPORT_SYMBOL_GPL(put_pid); |
92476d7fc [PATCH] pidhash: ... |
211 212 213 214 215 216 |
static void delayed_put_pid(struct rcu_head *rhp) { struct pid *pid = container_of(rhp, struct pid, rcu); put_pid(pid); } |
7ad5b3a50 kernel: remove fa... |
217 |
void free_pid(struct pid *pid) |
92476d7fc [PATCH] pidhash: ... |
218 219 |
{ /* We can be called with write_lock_irq(&tasklist_lock) held */ |
8ef047aaa pid namespaces: m... |
220 |
int i; |
92476d7fc [PATCH] pidhash: ... |
221 222 223 |
unsigned long flags; spin_lock_irqsave(&pidmap_lock, flags); |
198fe21b0 pid namespaces: h... |
224 225 |
for (i = 0; i <= pid->level; i++) hlist_del_rcu(&pid->numbers[i].pid_chain); |
92476d7fc [PATCH] pidhash: ... |
226 |
spin_unlock_irqrestore(&pidmap_lock, flags); |
8ef047aaa pid namespaces: m... |
227 |
for (i = 0; i <= pid->level; i++) |
b7127aa45 free_pidmap: turn... |
228 |
free_pidmap(pid->numbers + i); |
8ef047aaa pid namespaces: m... |
229 |
|
92476d7fc [PATCH] pidhash: ... |
230 231 |
call_rcu(&pid->rcu, delayed_put_pid); } |
8ef047aaa pid namespaces: m... |
232 |
struct pid *alloc_pid(struct pid_namespace *ns) |
92476d7fc [PATCH] pidhash: ... |
233 234 235 |
{ struct pid *pid; enum pid_type type; |
8ef047aaa pid namespaces: m... |
236 237 |
int i, nr; struct pid_namespace *tmp; |
198fe21b0 pid namespaces: h... |
238 |
struct upid *upid; |
92476d7fc [PATCH] pidhash: ... |
239 |
|
baf8f0f82 pid namespaces: d... |
240 |
pid = kmem_cache_alloc(ns->pid_cachep, GFP_KERNEL); |
92476d7fc [PATCH] pidhash: ... |
241 242 |
if (!pid) goto out; |
8ef047aaa pid namespaces: m... |
243 244 245 246 247 |
tmp = ns; for (i = ns->level; i >= 0; i--) { nr = alloc_pidmap(tmp); if (nr < 0) goto out_free; |
92476d7fc [PATCH] pidhash: ... |
248 |
|
8ef047aaa pid namespaces: m... |
249 250 251 252 |
pid->numbers[i].nr = nr; pid->numbers[i].ns = tmp; tmp = tmp->parent; } |
b461cc038 pid namespaces: m... |
253 |
get_pid_ns(ns); |
8ef047aaa pid namespaces: m... |
254 |
pid->level = ns->level; |
92476d7fc [PATCH] pidhash: ... |
255 |
atomic_set(&pid->count, 1); |
92476d7fc [PATCH] pidhash: ... |
256 257 258 259 |
for (type = 0; type < PIDTYPE_MAX; ++type) INIT_HLIST_HEAD(&pid->tasks[type]); spin_lock_irq(&pidmap_lock); |
198fe21b0 pid namespaces: h... |
260 261 262 263 264 |
for (i = ns->level; i >= 0; i--) { upid = &pid->numbers[i]; hlist_add_head_rcu(&upid->pid_chain, &pid_hash[pid_hashfn(upid->nr, upid->ns)]); } |
92476d7fc [PATCH] pidhash: ... |
265 266 267 268 269 270 |
spin_unlock_irq(&pidmap_lock); out: return pid; out_free: |
b7127aa45 free_pidmap: turn... |
271 272 |
while (++i <= ns->level) free_pidmap(pid->numbers + i); |
8ef047aaa pid namespaces: m... |
273 |
|
baf8f0f82 pid namespaces: d... |
274 |
kmem_cache_free(ns->pid_cachep, pid); |
92476d7fc [PATCH] pidhash: ... |
275 276 277 |
pid = NULL; goto out; } |
7ad5b3a50 kernel: remove fa... |
278 |
struct pid *find_pid_ns(int nr, struct pid_namespace *ns) |
1da177e4c Linux-2.6.12-rc2 |
279 280 |
{ struct hlist_node *elem; |
198fe21b0 pid namespaces: h... |
281 282 283 284 285 286 287 |
struct upid *pnr; hlist_for_each_entry_rcu(pnr, elem, &pid_hash[pid_hashfn(nr, ns)], pid_chain) if (pnr->nr == nr && pnr->ns == ns) return container_of(pnr, struct pid, numbers[ns->level]); |
1da177e4c Linux-2.6.12-rc2 |
288 |
|
1da177e4c Linux-2.6.12-rc2 |
289 290 |
return NULL; } |
198fe21b0 pid namespaces: h... |
291 |
EXPORT_SYMBOL_GPL(find_pid_ns); |
1da177e4c Linux-2.6.12-rc2 |
292 |
|
8990571eb Uninline find_pid... |
293 294 295 296 297 |
struct pid *find_vpid(int nr) { return find_pid_ns(nr, current->nsproxy->pid_ns); } EXPORT_SYMBOL_GPL(find_vpid); |
e713d0dab attach_pid() with... |
298 299 300 |
/* * attach_pid() must be called with the tasklist_lock write-held. */ |
24336eaee pids: introduce c... |
301 |
void attach_pid(struct task_struct *task, enum pid_type type, |
e713d0dab attach_pid() with... |
302 |
struct pid *pid) |
1da177e4c Linux-2.6.12-rc2 |
303 |
{ |
92476d7fc [PATCH] pidhash: ... |
304 |
struct pid_link *link; |
92476d7fc [PATCH] pidhash: ... |
305 |
|
92476d7fc [PATCH] pidhash: ... |
306 |
link = &task->pids[type]; |
e713d0dab attach_pid() with... |
307 |
link->pid = pid; |
92476d7fc [PATCH] pidhash: ... |
308 |
hlist_add_head_rcu(&link->node, &pid->tasks[type]); |
1da177e4c Linux-2.6.12-rc2 |
309 |
} |
24336eaee pids: introduce c... |
310 311 |
static void __change_pid(struct task_struct *task, enum pid_type type, struct pid *new) |
1da177e4c Linux-2.6.12-rc2 |
312 |
{ |
92476d7fc [PATCH] pidhash: ... |
313 314 315 |
struct pid_link *link; struct pid *pid; int tmp; |
1da177e4c Linux-2.6.12-rc2 |
316 |
|
92476d7fc [PATCH] pidhash: ... |
317 318 |
link = &task->pids[type]; pid = link->pid; |
1da177e4c Linux-2.6.12-rc2 |
319 |
|
92476d7fc [PATCH] pidhash: ... |
320 |
hlist_del_rcu(&link->node); |
24336eaee pids: introduce c... |
321 |
link->pid = new; |
1da177e4c Linux-2.6.12-rc2 |
322 |
|
92476d7fc [PATCH] pidhash: ... |
323 324 325 |
for (tmp = PIDTYPE_MAX; --tmp >= 0; ) if (!hlist_empty(&pid->tasks[tmp])) return; |
1da177e4c Linux-2.6.12-rc2 |
326 |
|
92476d7fc [PATCH] pidhash: ... |
327 |
free_pid(pid); |
1da177e4c Linux-2.6.12-rc2 |
328 |
} |
24336eaee pids: introduce c... |
329 330 331 332 333 334 335 336 337 338 339 |
void detach_pid(struct task_struct *task, enum pid_type type) { __change_pid(task, type, NULL); } void change_pid(struct task_struct *task, enum pid_type type, struct pid *pid) { __change_pid(task, type, pid); attach_pid(task, type, pid); } |
c18258c6f [PATCH] pid: Impl... |
340 |
/* transfer_pid is an optimization of attach_pid(new), detach_pid(old) */ |
7ad5b3a50 kernel: remove fa... |
341 |
void transfer_pid(struct task_struct *old, struct task_struct *new, |
c18258c6f [PATCH] pid: Impl... |
342 343 344 345 |
enum pid_type type) { new->pids[type].pid = old->pids[type].pid; hlist_replace_rcu(&old->pids[type].node, &new->pids[type].node); |
c18258c6f [PATCH] pid: Impl... |
346 |
} |
7ad5b3a50 kernel: remove fa... |
347 |
struct task_struct *pid_task(struct pid *pid, enum pid_type type) |
1da177e4c Linux-2.6.12-rc2 |
348 |
{ |
92476d7fc [PATCH] pidhash: ... |
349 350 351 352 353 354 355 356 357 |
struct task_struct *result = NULL; if (pid) { struct hlist_node *first; first = rcu_dereference(pid->tasks[type].first); if (first) result = hlist_entry(first, struct task_struct, pids[(type)].node); } return result; } |
eccba0689 gfs2: make gfs2_g... |
358 |
EXPORT_SYMBOL(pid_task); |
1da177e4c Linux-2.6.12-rc2 |
359 |
|
92476d7fc [PATCH] pidhash: ... |
360 361 362 |
/* * Must be called under rcu_read_lock() or with tasklist_lock read-held. */ |
198fe21b0 pid namespaces: h... |
363 364 |
struct task_struct *find_task_by_pid_type_ns(int type, int nr, struct pid_namespace *ns) |
92476d7fc [PATCH] pidhash: ... |
365 |
{ |
198fe21b0 pid namespaces: h... |
366 |
return pid_task(find_pid_ns(nr, ns), type); |
92476d7fc [PATCH] pidhash: ... |
367 |
} |
1da177e4c Linux-2.6.12-rc2 |
368 |
|
198fe21b0 pid namespaces: h... |
369 |
EXPORT_SYMBOL(find_task_by_pid_type_ns); |
1da177e4c Linux-2.6.12-rc2 |
370 |
|
228ebcbe6 Uninline find_tas... |
371 372 373 374 375 376 377 378 379 380 381 382 |
struct task_struct *find_task_by_vpid(pid_t vnr) { return find_task_by_pid_type_ns(PIDTYPE_PID, vnr, current->nsproxy->pid_ns); } EXPORT_SYMBOL(find_task_by_vpid); struct task_struct *find_task_by_pid_ns(pid_t nr, struct pid_namespace *ns) { return find_task_by_pid_type_ns(PIDTYPE_PID, nr, ns); } EXPORT_SYMBOL(find_task_by_pid_ns); |
1a657f78d [PATCH] introduce... |
383 384 385 386 387 388 389 390 |
struct pid *get_task_pid(struct task_struct *task, enum pid_type type) { struct pid *pid; rcu_read_lock(); pid = get_pid(task->pids[type].pid); rcu_read_unlock(); return pid; } |
7ad5b3a50 kernel: remove fa... |
391 |
struct task_struct *get_pid_task(struct pid *pid, enum pid_type type) |
92476d7fc [PATCH] pidhash: ... |
392 393 394 395 396 397 398 399 |
{ struct task_struct *result; rcu_read_lock(); result = pid_task(pid, type); if (result) get_task_struct(result); rcu_read_unlock(); return result; |
1da177e4c Linux-2.6.12-rc2 |
400 |
} |
92476d7fc [PATCH] pidhash: ... |
401 |
struct pid *find_get_pid(pid_t nr) |
1da177e4c Linux-2.6.12-rc2 |
402 403 |
{ struct pid *pid; |
92476d7fc [PATCH] pidhash: ... |
404 |
rcu_read_lock(); |
198fe21b0 pid namespaces: h... |
405 |
pid = get_pid(find_vpid(nr)); |
92476d7fc [PATCH] pidhash: ... |
406 |
rcu_read_unlock(); |
1da177e4c Linux-2.6.12-rc2 |
407 |
|
92476d7fc [PATCH] pidhash: ... |
408 |
return pid; |
1da177e4c Linux-2.6.12-rc2 |
409 |
} |
339caf2a2 proc: misplaced e... |
410 |
EXPORT_SYMBOL_GPL(find_get_pid); |
1da177e4c Linux-2.6.12-rc2 |
411 |
|
7af572947 pid namespaces: h... |
412 413 414 415 416 417 418 419 420 421 422 423 |
pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns) { struct upid *upid; pid_t nr = 0; if (pid && ns->level <= pid->level) { upid = &pid->numbers[ns->level]; if (upid->ns == ns) nr = upid->nr; } return nr; } |
44c4e1b25 pid: Extend/Fix p... |
424 425 426 427 428 |
pid_t pid_vnr(struct pid *pid) { return pid_nr_ns(pid, current->nsproxy->pid_ns); } EXPORT_SYMBOL_GPL(pid_vnr); |
2f2a3a46f Uninline the task... |
429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 |
pid_t task_pid_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) { return pid_nr_ns(task_pid(tsk), ns); } EXPORT_SYMBOL(task_pid_nr_ns); pid_t task_tgid_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) { return pid_nr_ns(task_tgid(tsk), ns); } EXPORT_SYMBOL(task_tgid_nr_ns); pid_t task_pgrp_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) { return pid_nr_ns(task_pgrp(tsk), ns); } EXPORT_SYMBOL(task_pgrp_nr_ns); pid_t task_session_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) { return pid_nr_ns(task_session(tsk), ns); } EXPORT_SYMBOL(task_session_nr_ns); |
1da177e4c Linux-2.6.12-rc2 |
452 |
/* |
0804ef4b0 [PATCH] proc: rea... |
453 454 |
* Used by proc to find the first pid that is greater then or equal to nr. * |
e49859e71 pidns: remove now... |
455 |
* If there is a pid at nr this function is exactly the same as find_pid_ns. |
0804ef4b0 [PATCH] proc: rea... |
456 |
*/ |
198fe21b0 pid namespaces: h... |
457 |
struct pid *find_ge_pid(int nr, struct pid_namespace *ns) |
0804ef4b0 [PATCH] proc: rea... |
458 459 460 461 |
{ struct pid *pid; do { |
198fe21b0 pid namespaces: h... |
462 |
pid = find_pid_ns(nr, ns); |
0804ef4b0 [PATCH] proc: rea... |
463 464 |
if (pid) break; |
198fe21b0 pid namespaces: h... |
465 |
nr = next_pidmap(ns, nr); |
0804ef4b0 [PATCH] proc: rea... |
466 467 468 469 470 471 |
} while (nr > 0); return pid; } /* |
1da177e4c Linux-2.6.12-rc2 |
472 473 474 475 476 477 |
* The pid hash table is scaled according to the amount of memory in the * machine. From a minimum of 16 slots up to 4096 slots at one gigabyte or * more. */ void __init pidhash_init(void) { |
92476d7fc [PATCH] pidhash: ... |
478 |
int i, pidhash_size; |
1da177e4c Linux-2.6.12-rc2 |
479 480 481 482 483 484 485 486 487 |
unsigned long megabytes = nr_kernel_pages >> (20 - PAGE_SHIFT); pidhash_shift = max(4, fls(megabytes * 4)); pidhash_shift = min(12, pidhash_shift); pidhash_size = 1 << pidhash_shift; printk("PID hash table entries: %d (order: %d, %Zd bytes) ", pidhash_size, pidhash_shift, |
92476d7fc [PATCH] pidhash: ... |
488 489 490 491 492 493 494 495 |
pidhash_size * sizeof(struct hlist_head)); pid_hash = alloc_bootmem(pidhash_size * sizeof(*(pid_hash))); if (!pid_hash) panic("Could not alloc pidhash! "); for (i = 0; i < pidhash_size; i++) INIT_HLIST_HEAD(&pid_hash[i]); |
1da177e4c Linux-2.6.12-rc2 |
496 497 498 499 |
} void __init pidmap_init(void) { |
61a58c6c2 [PATCH] rename st... |
500 |
init_pid_ns.pidmap[0].page = kzalloc(PAGE_SIZE, GFP_KERNEL); |
73b9ebfe1 [PATCH] pidhash: ... |
501 |
/* Reserve PID 0. We never call free_pidmap(0) */ |
61a58c6c2 [PATCH] rename st... |
502 503 |
set_bit(0, init_pid_ns.pidmap[0].page); atomic_dec(&init_pid_ns.pidmap[0].nr_free); |
92476d7fc [PATCH] pidhash: ... |
504 |
|
74bd59bb3 namespaces: clean... |
505 506 |
init_pid_ns.pid_cachep = KMEM_CACHE(pid, SLAB_HWCACHE_ALIGN | SLAB_PANIC); |
1da177e4c Linux-2.6.12-rc2 |
507 |
} |