do_wait: return security_task_wait() error code in place of -ECHILD
[linux-2.6-block.git] / kernel / exit.c
CommitLineData
1da177e4
LT
1/*
2 * linux/kernel/exit.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
1da177e4
LT
7#include <linux/mm.h>
8#include <linux/slab.h>
9#include <linux/interrupt.h>
1da177e4 10#include <linux/module.h>
c59ede7b 11#include <linux/capability.h>
1da177e4
LT
12#include <linux/completion.h>
13#include <linux/personality.h>
14#include <linux/tty.h>
6b3286ed 15#include <linux/mnt_namespace.h>
da9cbc87 16#include <linux/iocontext.h>
1da177e4
LT
17#include <linux/key.h>
18#include <linux/security.h>
19#include <linux/cpu.h>
20#include <linux/acct.h>
8f0ab514 21#include <linux/tsacct_kern.h>
1da177e4 22#include <linux/file.h>
9f3acc31 23#include <linux/fdtable.h>
1da177e4 24#include <linux/binfmts.h>
ab516013 25#include <linux/nsproxy.h>
84d73786 26#include <linux/pid_namespace.h>
1da177e4
LT
27#include <linux/ptrace.h>
28#include <linux/profile.h>
29#include <linux/mount.h>
30#include <linux/proc_fs.h>
49d769d5 31#include <linux/kthread.h>
1da177e4 32#include <linux/mempolicy.h>
c757249a 33#include <linux/taskstats_kern.h>
ca74e92b 34#include <linux/delayacct.h>
83144186 35#include <linux/freezer.h>
b4f48b63 36#include <linux/cgroup.h>
1da177e4 37#include <linux/syscalls.h>
7ed20e1a 38#include <linux/signal.h>
6a14c5c9 39#include <linux/posix-timers.h>
9f46080c 40#include <linux/cn_proc.h>
de5097c2 41#include <linux/mutex.h>
0771dfef 42#include <linux/futex.h>
34f192c6 43#include <linux/compat.h>
b92ce558 44#include <linux/pipe_fs_i.h>
fa84cb93 45#include <linux/audit.h> /* for audit_free() */
83cc5ed3 46#include <linux/resource.h>
0d67a46d 47#include <linux/blkdev.h>
6eaeeaba 48#include <linux/task_io_accounting_ops.h>
1da177e4
LT
49
50#include <asm/uaccess.h>
51#include <asm/unistd.h>
52#include <asm/pgtable.h>
53#include <asm/mmu_context.h>
54
408b664a
AB
55static void exit_mm(struct task_struct * tsk);
56
d839fd4d
ON
57static inline int task_detached(struct task_struct *p)
58{
59 return p->exit_signal == -1;
60}
61
1da177e4
LT
62static void __unhash_process(struct task_struct *p)
63{
64 nr_threads--;
65 detach_pid(p, PIDTYPE_PID);
1da177e4
LT
66 if (thread_group_leader(p)) {
67 detach_pid(p, PIDTYPE_PGID);
68 detach_pid(p, PIDTYPE_SID);
c97d9893 69
5e85d4ab 70 list_del_rcu(&p->tasks);
73b9ebfe 71 __get_cpu_var(process_counts)--;
1da177e4 72 }
47e65328 73 list_del_rcu(&p->thread_group);
f470021a 74 list_del_init(&p->sibling);
1da177e4
LT
75}
76
6a14c5c9
ON
77/*
78 * This function expects the tasklist_lock write-locked.
79 */
80static void __exit_signal(struct task_struct *tsk)
81{
82 struct signal_struct *sig = tsk->signal;
83 struct sighand_struct *sighand;
84
85 BUG_ON(!sig);
86 BUG_ON(!atomic_read(&sig->count));
87
88 rcu_read_lock();
89 sighand = rcu_dereference(tsk->sighand);
90 spin_lock(&sighand->siglock);
91
92 posix_cpu_timers_exit(tsk);
93 if (atomic_dec_and_test(&sig->count))
94 posix_cpu_timers_exit_group(tsk);
95 else {
96 /*
97 * If there is any task waiting for the group exit
98 * then notify it:
99 */
6db840fa 100 if (sig->group_exit_task && atomic_read(&sig->count) == sig->notify_count)
6a14c5c9 101 wake_up_process(sig->group_exit_task);
6db840fa 102
6a14c5c9
ON
103 if (tsk == sig->curr_target)
104 sig->curr_target = next_thread(tsk);
105 /*
106 * Accumulate here the counters for all threads but the
107 * group leader as they die, so they can be added into
108 * the process-wide totals when those are taken.
109 * The group leader stays around as a zombie as long
110 * as there are other threads. When it gets reaped,
111 * the exit.c code will add its counts into these totals.
112 * We won't ever get here for the group leader, since it
113 * will have been the last reference on the signal_struct.
114 */
115 sig->utime = cputime_add(sig->utime, tsk->utime);
116 sig->stime = cputime_add(sig->stime, tsk->stime);
9ac52315 117 sig->gtime = cputime_add(sig->gtime, tsk->gtime);
6a14c5c9
ON
118 sig->min_flt += tsk->min_flt;
119 sig->maj_flt += tsk->maj_flt;
120 sig->nvcsw += tsk->nvcsw;
121 sig->nivcsw += tsk->nivcsw;
6eaeeaba
ED
122 sig->inblock += task_io_get_inblock(tsk);
123 sig->oublock += task_io_get_oublock(tsk);
172ba844 124 sig->sum_sched_runtime += tsk->se.sum_exec_runtime;
6a14c5c9
ON
125 sig = NULL; /* Marker for below. */
126 }
127
5876700c
ON
128 __unhash_process(tsk);
129
da7978b0
ON
130 /*
131 * Do this under ->siglock, we can race with another thread
132 * doing sigqueue_free() if we have SIGQUEUE_PREALLOC signals.
133 */
134 flush_sigqueue(&tsk->pending);
135
6a14c5c9 136 tsk->signal = NULL;
a7e5328a 137 tsk->sighand = NULL;
6a14c5c9
ON
138 spin_unlock(&sighand->siglock);
139 rcu_read_unlock();
140
a7e5328a 141 __cleanup_sighand(sighand);
6a14c5c9 142 clear_tsk_thread_flag(tsk,TIF_SIGPENDING);
6a14c5c9
ON
143 if (sig) {
144 flush_sigqueue(&sig->shared_pending);
093a8e8a 145 taskstats_tgid_free(sig);
6a14c5c9
ON
146 __cleanup_signal(sig);
147 }
148}
149
8c7904a0
EB
150static void delayed_put_task_struct(struct rcu_head *rhp)
151{
152 put_task_struct(container_of(rhp, struct task_struct, rcu));
153}
154
f470021a
RM
155/*
156 * Do final ptrace-related cleanup of a zombie being reaped.
157 *
158 * Called with write_lock(&tasklist_lock) held.
159 */
160static void ptrace_release_task(struct task_struct *p)
161{
162 BUG_ON(!list_empty(&p->ptraced));
163 ptrace_unlink(p);
164 BUG_ON(!list_empty(&p->ptrace_entry));
165}
166
1da177e4
LT
167void release_task(struct task_struct * p)
168{
36c8b586 169 struct task_struct *leader;
1da177e4 170 int zap_leader;
1f09f974 171repeat:
1da177e4 172 atomic_dec(&p->user->processes);
60347f67 173 proc_flush_task(p);
1da177e4 174 write_lock_irq(&tasklist_lock);
f470021a 175 ptrace_release_task(p);
1da177e4 176 __exit_signal(p);
35f5cad8 177
1da177e4
LT
178 /*
179 * If we are the last non-leader member of the thread
180 * group, and the leader is zombie, then notify the
181 * group leader's parent process. (if it wants notification.)
182 */
183 zap_leader = 0;
184 leader = p->group_leader;
185 if (leader != p && thread_group_empty(leader) && leader->exit_state == EXIT_ZOMBIE) {
d839fd4d 186 BUG_ON(task_detached(leader));
1da177e4
LT
187 do_notify_parent(leader, leader->exit_signal);
188 /*
189 * If we were the last child thread and the leader has
190 * exited already, and the leader's parent ignores SIGCHLD,
191 * then we are the one who should release the leader.
192 *
193 * do_notify_parent() will have marked it self-reaping in
194 * that case.
195 */
d839fd4d 196 zap_leader = task_detached(leader);
1da177e4
LT
197 }
198
1da177e4 199 write_unlock_irq(&tasklist_lock);
1da177e4 200 release_thread(p);
8c7904a0 201 call_rcu(&p->rcu, delayed_put_task_struct);
1da177e4
LT
202
203 p = leader;
204 if (unlikely(zap_leader))
205 goto repeat;
206}
207
1da177e4
LT
208/*
209 * This checks not only the pgrp, but falls back on the pid if no
210 * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
211 * without this...
04a2e6a5
EB
212 *
213 * The caller must hold rcu lock or the tasklist lock.
1da177e4 214 */
04a2e6a5 215struct pid *session_of_pgrp(struct pid *pgrp)
1da177e4
LT
216{
217 struct task_struct *p;
04a2e6a5 218 struct pid *sid = NULL;
62dfb554 219
04a2e6a5 220 p = pid_task(pgrp, PIDTYPE_PGID);
62dfb554 221 if (p == NULL)
04a2e6a5 222 p = pid_task(pgrp, PIDTYPE_PID);
62dfb554 223 if (p != NULL)
04a2e6a5 224 sid = task_session(p);
62dfb554 225
1da177e4
LT
226 return sid;
227}
228
229/*
230 * Determine if a process group is "orphaned", according to the POSIX
231 * definition in 2.2.2.52. Orphaned process groups are not to be affected
232 * by terminal-generated stop signals. Newly orphaned process groups are
233 * to receive a SIGHUP and a SIGCONT.
234 *
235 * "I ask you, have you ever known what it is to be an orphan?"
236 */
0475ac08 237static int will_become_orphaned_pgrp(struct pid *pgrp, struct task_struct *ignored_task)
1da177e4
LT
238{
239 struct task_struct *p;
1da177e4 240
0475ac08 241 do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
05e83df6
ON
242 if ((p == ignored_task) ||
243 (p->exit_state && thread_group_empty(p)) ||
244 is_global_init(p->real_parent))
1da177e4 245 continue;
05e83df6 246
0475ac08 247 if (task_pgrp(p->real_parent) != pgrp &&
05e83df6
ON
248 task_session(p->real_parent) == task_session(p))
249 return 0;
0475ac08 250 } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
05e83df6
ON
251
252 return 1;
1da177e4
LT
253}
254
3e7cd6c4 255int is_current_pgrp_orphaned(void)
1da177e4
LT
256{
257 int retval;
258
259 read_lock(&tasklist_lock);
3e7cd6c4 260 retval = will_become_orphaned_pgrp(task_pgrp(current), NULL);
1da177e4
LT
261 read_unlock(&tasklist_lock);
262
263 return retval;
264}
265
0475ac08 266static int has_stopped_jobs(struct pid *pgrp)
1da177e4
LT
267{
268 int retval = 0;
269 struct task_struct *p;
270
0475ac08 271 do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
338077e5 272 if (!task_is_stopped(p))
1da177e4 273 continue;
1da177e4
LT
274 retval = 1;
275 break;
0475ac08 276 } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
1da177e4
LT
277 return retval;
278}
279
f49ee505
ON
280/*
281 * Check to see if any process groups have become orphaned as
282 * a result of our exiting, and if they have any stopped jobs,
283 * send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
284 */
285static void
286kill_orphaned_pgrp(struct task_struct *tsk, struct task_struct *parent)
287{
288 struct pid *pgrp = task_pgrp(tsk);
289 struct task_struct *ignored_task = tsk;
290
291 if (!parent)
292 /* exit: our father is in a different pgrp than
293 * we are and we were the only connection outside.
294 */
295 parent = tsk->real_parent;
296 else
297 /* reparent: our child is in a different pgrp than
298 * we are, and it was the only connection outside.
299 */
300 ignored_task = NULL;
301
302 if (task_pgrp(parent) != pgrp &&
303 task_session(parent) == task_session(tsk) &&
304 will_become_orphaned_pgrp(pgrp, ignored_task) &&
305 has_stopped_jobs(pgrp)) {
306 __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp);
307 __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp);
308 }
309}
310
1da177e4 311/**
49d769d5 312 * reparent_to_kthreadd - Reparent the calling kernel thread to kthreadd
1da177e4
LT
313 *
314 * If a kernel thread is launched as a result of a system call, or if
49d769d5
EB
315 * it ever exits, it should generally reparent itself to kthreadd so it
316 * isn't in the way of other processes and is correctly cleaned up on exit.
1da177e4
LT
317 *
318 * The various task state such as scheduling policy and priority may have
319 * been inherited from a user process, so we reset them to sane values here.
320 *
49d769d5 321 * NOTE that reparent_to_kthreadd() gives the caller full capabilities.
1da177e4 322 */
49d769d5 323static void reparent_to_kthreadd(void)
1da177e4
LT
324{
325 write_lock_irq(&tasklist_lock);
326
327 ptrace_unlink(current);
328 /* Reparent to init */
49d769d5 329 current->real_parent = current->parent = kthreadd_task;
f470021a 330 list_move_tail(&current->sibling, &current->real_parent->children);
1da177e4
LT
331
332 /* Set the exit signal to SIGCHLD so we signal init on exit */
333 current->exit_signal = SIGCHLD;
334
e05606d3 335 if (task_nice(current) < 0)
1da177e4
LT
336 set_user_nice(current, 0);
337 /* cpus_allowed? */
338 /* rt_priority? */
339 /* signals? */
340 security_task_reparent_to_init(current);
341 memcpy(current->signal->rlim, init_task.signal->rlim,
342 sizeof(current->signal->rlim));
343 atomic_inc(&(INIT_USER->__count));
344 write_unlock_irq(&tasklist_lock);
345 switch_uid(INIT_USER);
346}
347
8520d7c7 348void __set_special_pids(struct pid *pid)
1da177e4 349{
e19f247a 350 struct task_struct *curr = current->group_leader;
8520d7c7 351 pid_t nr = pid_nr(pid);
1da177e4 352
8520d7c7 353 if (task_session(curr) != pid) {
7d8da096 354 change_pid(curr, PIDTYPE_SID, pid);
8520d7c7 355 set_task_session(curr, nr);
1da177e4 356 }
8520d7c7 357 if (task_pgrp(curr) != pid) {
7d8da096 358 change_pid(curr, PIDTYPE_PGID, pid);
8520d7c7 359 set_task_pgrp(curr, nr);
1da177e4
LT
360 }
361}
362
8520d7c7 363static void set_special_pids(struct pid *pid)
1da177e4
LT
364{
365 write_lock_irq(&tasklist_lock);
8520d7c7 366 __set_special_pids(pid);
1da177e4
LT
367 write_unlock_irq(&tasklist_lock);
368}
369
370/*
371 * Let kernel threads use this to say that they
372 * allow a certain signal (since daemonize() will
373 * have disabled all of them by default).
374 */
375int allow_signal(int sig)
376{
7ed20e1a 377 if (!valid_signal(sig) || sig < 1)
1da177e4
LT
378 return -EINVAL;
379
380 spin_lock_irq(&current->sighand->siglock);
381 sigdelset(&current->blocked, sig);
382 if (!current->mm) {
383 /* Kernel threads handle their own signals.
384 Let the signal code know it'll be handled, so
385 that they don't get converted to SIGKILL or
386 just silently dropped */
387 current->sighand->action[(sig)-1].sa.sa_handler = (void __user *)2;
388 }
389 recalc_sigpending();
390 spin_unlock_irq(&current->sighand->siglock);
391 return 0;
392}
393
394EXPORT_SYMBOL(allow_signal);
395
396int disallow_signal(int sig)
397{
7ed20e1a 398 if (!valid_signal(sig) || sig < 1)
1da177e4
LT
399 return -EINVAL;
400
401 spin_lock_irq(&current->sighand->siglock);
10ab825b 402 current->sighand->action[(sig)-1].sa.sa_handler = SIG_IGN;
1da177e4
LT
403 recalc_sigpending();
404 spin_unlock_irq(&current->sighand->siglock);
405 return 0;
406}
407
408EXPORT_SYMBOL(disallow_signal);
409
410/*
411 * Put all the gunge required to become a kernel thread without
412 * attached user resources in one place where it belongs.
413 */
414
415void daemonize(const char *name, ...)
416{
417 va_list args;
418 struct fs_struct *fs;
419 sigset_t blocked;
420
421 va_start(args, name);
422 vsnprintf(current->comm, sizeof(current->comm), name, args);
423 va_end(args);
424
425 /*
426 * If we were started as result of loading a module, close all of the
427 * user space pages. We don't need them, and if we didn't close them
428 * they would be locked into memory.
429 */
430 exit_mm(current);
83144186
RW
431 /*
432 * We don't want to have TIF_FREEZE set if the system-wide hibernation
433 * or suspend transition begins right now.
434 */
435 current->flags |= PF_NOFREEZE;
1da177e4 436
8520d7c7
ON
437 if (current->nsproxy != &init_nsproxy) {
438 get_nsproxy(&init_nsproxy);
439 switch_task_namespaces(current, &init_nsproxy);
440 }
297bd42b 441 set_special_pids(&init_struct_pid);
24ec839c 442 proc_clear_tty(current);
1da177e4
LT
443
444 /* Block and flush all signals */
445 sigfillset(&blocked);
446 sigprocmask(SIG_BLOCK, &blocked, NULL);
447 flush_signals(current);
448
449 /* Become as one with the init task */
450
451 exit_fs(current); /* current->fs->count--; */
452 fs = init_task.fs;
453 current->fs = fs;
454 atomic_inc(&fs->count);
ab516013 455
d4c5e41f 456 exit_files(current);
1da177e4
LT
457 current->files = init_task.files;
458 atomic_inc(&current->files->count);
459
49d769d5 460 reparent_to_kthreadd();
1da177e4
LT
461}
462
463EXPORT_SYMBOL(daemonize);
464
858119e1 465static void close_files(struct files_struct * files)
1da177e4
LT
466{
467 int i, j;
badf1662 468 struct fdtable *fdt;
1da177e4
LT
469
470 j = 0;
4fb3a538
DS
471
472 /*
473 * It is safe to dereference the fd table without RCU or
474 * ->file_lock because this is the last reference to the
475 * files structure.
476 */
badf1662 477 fdt = files_fdtable(files);
1da177e4
LT
478 for (;;) {
479 unsigned long set;
480 i = j * __NFDBITS;
bbea9f69 481 if (i >= fdt->max_fds)
1da177e4 482 break;
badf1662 483 set = fdt->open_fds->fds_bits[j++];
1da177e4
LT
484 while (set) {
485 if (set & 1) {
badf1662 486 struct file * file = xchg(&fdt->fd[i], NULL);
944be0b2 487 if (file) {
1da177e4 488 filp_close(file, files);
944be0b2
IM
489 cond_resched();
490 }
1da177e4
LT
491 }
492 i++;
493 set >>= 1;
494 }
495 }
496}
497
498struct files_struct *get_files_struct(struct task_struct *task)
499{
500 struct files_struct *files;
501
502 task_lock(task);
503 files = task->files;
504 if (files)
505 atomic_inc(&files->count);
506 task_unlock(task);
507
508 return files;
509}
510
7ad5b3a5 511void put_files_struct(struct files_struct *files)
1da177e4 512{
badf1662
DS
513 struct fdtable *fdt;
514
1da177e4
LT
515 if (atomic_dec_and_test(&files->count)) {
516 close_files(files);
517 /*
518 * Free the fd and fdset arrays if we expanded them.
ab2af1f5
DS
519 * If the fdtable was embedded, pass files for freeing
520 * at the end of the RCU grace period. Otherwise,
521 * you can free files immediately.
1da177e4 522 */
badf1662 523 fdt = files_fdtable(files);
4fd45812 524 if (fdt != &files->fdtab)
ab2af1f5 525 kmem_cache_free(files_cachep, files);
01b2d93c 526 free_fdtable(fdt);
1da177e4
LT
527 }
528}
529
3b125388 530void reset_files_struct(struct files_struct *files)
3b9b8ab6 531{
3b125388 532 struct task_struct *tsk = current;
3b9b8ab6
KK
533 struct files_struct *old;
534
535 old = tsk->files;
536 task_lock(tsk);
537 tsk->files = files;
538 task_unlock(tsk);
539 put_files_struct(old);
540}
3b9b8ab6 541
1ec7f1dd 542void exit_files(struct task_struct *tsk)
1da177e4
LT
543{
544 struct files_struct * files = tsk->files;
545
546 if (files) {
547 task_lock(tsk);
548 tsk->files = NULL;
549 task_unlock(tsk);
550 put_files_struct(files);
551 }
552}
553
1ec7f1dd 554void put_fs_struct(struct fs_struct *fs)
1da177e4
LT
555{
556 /* No need to hold fs->lock if we are killing it */
557 if (atomic_dec_and_test(&fs->count)) {
6ac08c39
JB
558 path_put(&fs->root);
559 path_put(&fs->pwd);
560 if (fs->altroot.dentry)
561 path_put(&fs->altroot);
1da177e4
LT
562 kmem_cache_free(fs_cachep, fs);
563 }
564}
565
1ec7f1dd 566void exit_fs(struct task_struct *tsk)
1da177e4
LT
567{
568 struct fs_struct * fs = tsk->fs;
569
570 if (fs) {
571 task_lock(tsk);
572 tsk->fs = NULL;
573 task_unlock(tsk);
1ec7f1dd 574 put_fs_struct(fs);
1da177e4
LT
575 }
576}
577
1da177e4
LT
578EXPORT_SYMBOL_GPL(exit_fs);
579
cf475ad2
BS
580#ifdef CONFIG_MM_OWNER
581/*
582 * Task p is exiting and it owned mm, lets find a new owner for it
583 */
584static inline int
585mm_need_new_owner(struct mm_struct *mm, struct task_struct *p)
586{
587 /*
588 * If there are other users of the mm and the owner (us) is exiting
589 * we need to find a new owner to take on the responsibility.
590 */
591 if (!mm)
592 return 0;
593 if (atomic_read(&mm->mm_users) <= 1)
594 return 0;
595 if (mm->owner != p)
596 return 0;
597 return 1;
598}
599
600void mm_update_next_owner(struct mm_struct *mm)
601{
602 struct task_struct *c, *g, *p = current;
603
604retry:
605 if (!mm_need_new_owner(mm, p))
606 return;
607
608 read_lock(&tasklist_lock);
609 /*
610 * Search in the children
611 */
612 list_for_each_entry(c, &p->children, sibling) {
613 if (c->mm == mm)
614 goto assign_new_owner;
615 }
616
617 /*
618 * Search in the siblings
619 */
620 list_for_each_entry(c, &p->parent->children, sibling) {
621 if (c->mm == mm)
622 goto assign_new_owner;
623 }
624
625 /*
626 * Search through everything else. We should not get
627 * here often
628 */
629 do_each_thread(g, c) {
630 if (c->mm == mm)
631 goto assign_new_owner;
632 } while_each_thread(g, c);
633
634 read_unlock(&tasklist_lock);
635 return;
636
637assign_new_owner:
638 BUG_ON(c == p);
639 get_task_struct(c);
640 /*
641 * The task_lock protects c->mm from changing.
642 * We always want mm->owner->mm == mm
643 */
644 task_lock(c);
645 /*
646 * Delay read_unlock() till we have the task_lock()
647 * to ensure that c does not slip away underneath us
648 */
649 read_unlock(&tasklist_lock);
650 if (c->mm != mm) {
651 task_unlock(c);
652 put_task_struct(c);
653 goto retry;
654 }
655 cgroup_mm_owner_callbacks(mm->owner, c);
656 mm->owner = c;
657 task_unlock(c);
658 put_task_struct(c);
659}
660#endif /* CONFIG_MM_OWNER */
661
1da177e4
LT
662/*
663 * Turn us into a lazy TLB process if we
664 * aren't already..
665 */
408b664a 666static void exit_mm(struct task_struct * tsk)
1da177e4
LT
667{
668 struct mm_struct *mm = tsk->mm;
669
670 mm_release(tsk, mm);
671 if (!mm)
672 return;
673 /*
674 * Serialize with any possible pending coredump.
675 * We must hold mmap_sem around checking core_waiters
676 * and clearing tsk->mm. The core-inducing thread
677 * will increment core_waiters for each thread in the
678 * group with ->mm != NULL.
679 */
680 down_read(&mm->mmap_sem);
681 if (mm->core_waiters) {
682 up_read(&mm->mmap_sem);
683 down_write(&mm->mmap_sem);
684 if (!--mm->core_waiters)
685 complete(mm->core_startup_done);
686 up_write(&mm->mmap_sem);
687
688 wait_for_completion(&mm->core_done);
689 down_read(&mm->mmap_sem);
690 }
691 atomic_inc(&mm->mm_count);
125e1874 692 BUG_ON(mm != tsk->active_mm);
1da177e4
LT
693 /* more a memory barrier than a real lock */
694 task_lock(tsk);
695 tsk->mm = NULL;
696 up_read(&mm->mmap_sem);
697 enter_lazy_tlb(mm, current);
0c1eecfb
RW
698 /* We don't want this task to be frozen prematurely */
699 clear_freeze_flag(tsk);
1da177e4 700 task_unlock(tsk);
cf475ad2 701 mm_update_next_owner(mm);
1da177e4
LT
702 mmput(mm);
703}
704
f470021a
RM
705/*
706 * Detach all tasks we were using ptrace on.
707 * Any that need to be release_task'd are put on the @dead list.
708 *
709 * Called with write_lock(&tasklist_lock) held.
710 */
711static void ptrace_exit(struct task_struct *parent, struct list_head *dead)
1da177e4 712{
f470021a 713 struct task_struct *p, *n;
241ceee0 714
f470021a
RM
715 list_for_each_entry_safe(p, n, &parent->ptraced, ptrace_entry) {
716 __ptrace_unlink(p);
717
718 if (p->exit_state != EXIT_ZOMBIE)
719 continue;
720
721 /*
722 * If it's a zombie, our attachedness prevented normal
723 * parent notification or self-reaping. Do notification
724 * now if it would have happened earlier. If it should
725 * reap itself, add it to the @dead list. We can't call
726 * release_task() here because we already hold tasklist_lock.
727 *
728 * If it's our own child, there is no notification to do.
1da177e4 729 */
f470021a
RM
730 if (!task_detached(p) && thread_group_empty(p)) {
731 if (!same_thread_group(p->real_parent, parent))
732 do_notify_parent(p, p->exit_signal);
733 }
1da177e4 734
f470021a 735 if (task_detached(p)) {
1da177e4 736 /*
f470021a 737 * Mark it as in the process of being reaped.
1da177e4 738 */
f470021a
RM
739 p->exit_state = EXIT_DEAD;
740 list_add(&p->ptrace_entry, dead);
1da177e4
LT
741 }
742 }
f470021a
RM
743}
744
745/*
746 * Finish up exit-time ptrace cleanup.
747 *
748 * Called without locks.
749 */
750static void ptrace_exit_finish(struct task_struct *parent,
751 struct list_head *dead)
752{
753 struct task_struct *p, *n;
754
755 BUG_ON(!list_empty(&parent->ptraced));
756
757 list_for_each_entry_safe(p, n, dead, ptrace_entry) {
758 list_del_init(&p->ptrace_entry);
759 release_task(p);
760 }
761}
762
763static void reparent_thread(struct task_struct *p, struct task_struct *father)
764{
765 if (p->pdeath_signal)
766 /* We already hold the tasklist_lock here. */
767 group_send_sig_info(p->pdeath_signal, SEND_SIG_NOINFO, p);
768
769 list_move_tail(&p->sibling, &p->real_parent->children);
1da177e4 770
b2b2cbc4
EB
771 /* If this is a threaded reparent there is no need to
772 * notify anyone anything has happened.
773 */
376e1d25 774 if (same_thread_group(p->real_parent, father))
b2b2cbc4
EB
775 return;
776
777 /* We don't want people slaying init. */
d839fd4d 778 if (!task_detached(p))
b2b2cbc4 779 p->exit_signal = SIGCHLD;
b2b2cbc4
EB
780
781 /* If we'd notified the old parent about this child's death,
782 * also notify the new parent.
783 */
f470021a
RM
784 if (!ptrace_reparented(p) &&
785 p->exit_state == EXIT_ZOMBIE &&
d839fd4d 786 !task_detached(p) && thread_group_empty(p))
b2b2cbc4
EB
787 do_notify_parent(p, p->exit_signal);
788
f49ee505 789 kill_orphaned_pgrp(p, father);
1da177e4
LT
790}
791
792/*
793 * When we die, we re-parent all our children.
794 * Try to give them to another thread in our thread
795 * group, and if no such member exists, give it to
84d73786
SB
796 * the child reaper process (ie "init") in our pid
797 * space.
1da177e4 798 */
762a24be 799static void forget_original_parent(struct task_struct *father)
1da177e4 800{
03ff1797 801 struct task_struct *p, *n, *reaper = father;
f470021a 802 LIST_HEAD(ptrace_dead);
762a24be
ON
803
804 write_lock_irq(&tasklist_lock);
1da177e4 805
f470021a
RM
806 /*
807 * First clean up ptrace if we were using it.
808 */
809 ptrace_exit(father, &ptrace_dead);
810
1da177e4
LT
811 do {
812 reaper = next_thread(reaper);
813 if (reaper == father) {
88f21d81 814 reaper = task_child_reaper(father);
1da177e4
LT
815 break;
816 }
762a24be 817 } while (reaper->flags & PF_EXITING);
1da177e4 818
03ff1797 819 list_for_each_entry_safe(p, n, &father->children, sibling) {
84eb646b 820 p->real_parent = reaper;
f470021a
RM
821 if (p->parent == father) {
822 BUG_ON(p->ptrace);
823 p->parent = p->real_parent;
824 }
825 reparent_thread(p, father);
1da177e4 826 }
762a24be
ON
827
828 write_unlock_irq(&tasklist_lock);
829 BUG_ON(!list_empty(&father->children));
762a24be 830
f470021a 831 ptrace_exit_finish(father, &ptrace_dead);
1da177e4
LT
832}
833
834/*
835 * Send signals to all our closest relatives so that they know
836 * to properly mourn us..
837 */
821c7de7 838static void exit_notify(struct task_struct *tsk, int group_dead)
1da177e4
LT
839{
840 int state;
1da177e4 841
1da177e4
LT
842 /*
843 * This does two things:
844 *
845 * A. Make init inherit all the child processes
846 * B. Check to see if any process groups have become orphaned
847 * as a result of our exiting, and if they have any stopped
848 * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
849 */
762a24be 850 forget_original_parent(tsk);
2e4a7072 851 exit_task_namespaces(tsk);
1da177e4 852
762a24be 853 write_lock_irq(&tasklist_lock);
821c7de7
ON
854 if (group_dead)
855 kill_orphaned_pgrp(tsk->group_leader, NULL);
1da177e4 856
24728448 857 /* Let father know we died
1da177e4
LT
858 *
859 * Thread signals are configurable, but you aren't going to use
d4c5e41f 860 * that to send signals to arbitary processes.
1da177e4
LT
861 * That stops right now.
862 *
863 * If the parent exec id doesn't match the exec id we saved
864 * when we started then we know the parent has changed security
865 * domain.
866 *
867 * If our self_exec id doesn't match our parent_exec_id then
868 * we have changed execution domain as these two values started
869 * the same after a fork.
1da177e4 870 */
d839fd4d 871 if (tsk->exit_signal != SIGCHLD && !task_detached(tsk) &&
f49ee505 872 (tsk->parent_exec_id != tsk->real_parent->self_exec_id ||
d839fd4d
ON
873 tsk->self_exec_id != tsk->parent_exec_id) &&
874 !capable(CAP_KILL))
1da177e4
LT
875 tsk->exit_signal = SIGCHLD;
876
1da177e4
LT
877 /* If something other than our normal parent is ptracing us, then
878 * send it a SIGCHLD instead of honoring exit_signal. exit_signal
879 * only has special meaning to our real parent.
880 */
d839fd4d 881 if (!task_detached(tsk) && thread_group_empty(tsk)) {
53b6f9fb
ON
882 int signal = ptrace_reparented(tsk) ?
883 SIGCHLD : tsk->exit_signal;
1da177e4
LT
884 do_notify_parent(tsk, signal);
885 } else if (tsk->ptrace) {
886 do_notify_parent(tsk, SIGCHLD);
887 }
888
889 state = EXIT_ZOMBIE;
d839fd4d 890 if (task_detached(tsk) && likely(!tsk->ptrace))
1da177e4
LT
891 state = EXIT_DEAD;
892 tsk->exit_state = state;
893
2800d8d1 894 /* mt-exec, de_thread() is waiting for us */
6db840fa
ON
895 if (thread_group_leader(tsk) &&
896 tsk->signal->notify_count < 0 &&
897 tsk->signal->group_exit_task)
898 wake_up_process(tsk->signal->group_exit_task);
899
1da177e4
LT
900 write_unlock_irq(&tasklist_lock);
901
1da177e4
LT
902 /* If the process is dead, release it - nobody will wait for it */
903 if (state == EXIT_DEAD)
904 release_task(tsk);
1da177e4
LT
905}
906
e18eecb8
JD
907#ifdef CONFIG_DEBUG_STACK_USAGE
908static void check_stack_usage(void)
909{
910 static DEFINE_SPINLOCK(low_water_lock);
911 static int lowest_to_date = THREAD_SIZE;
912 unsigned long *n = end_of_stack(current);
913 unsigned long free;
914
915 while (*n == 0)
916 n++;
917 free = (unsigned long)n - (unsigned long)end_of_stack(current);
918
919 if (free >= lowest_to_date)
920 return;
921
922 spin_lock(&low_water_lock);
923 if (free < lowest_to_date) {
924 printk(KERN_WARNING "%s used greatest stack depth: %lu bytes "
925 "left\n",
926 current->comm, free);
927 lowest_to_date = free;
928 }
929 spin_unlock(&low_water_lock);
930}
931#else
932static inline void check_stack_usage(void) {}
933#endif
934
84eb646b
ON
935static inline void exit_child_reaper(struct task_struct *tsk)
936{
88f21d81 937 if (likely(tsk->group_leader != task_child_reaper(tsk)))
84eb646b
ON
938 return;
939
3eb07c8c
SB
940 if (tsk->nsproxy->pid_ns == &init_pid_ns)
941 panic("Attempted to kill init!");
942
943 /*
944 * @tsk is the last thread in the 'cgroup-init' and is exiting.
945 * Terminate all remaining processes in the namespace and reap them
946 * before exiting @tsk.
947 *
948 * Note that @tsk (last thread of cgroup-init) may not necessarily
949 * be the child-reaper (i.e main thread of cgroup-init) of the
950 * namespace i.e the child_reaper may have already exited.
951 *
952 * Even after a child_reaper exits, we let it inherit orphaned children,
953 * because, pid_ns->child_reaper remains valid as long as there is
954 * at least one living sub-thread in the cgroup init.
955
956 * This living sub-thread of the cgroup-init will be notified when
957 * a child inherited by the 'child-reaper' exits (do_notify_parent()
958 * uses __group_send_sig_info()). Further, when reaping child processes,
959 * do_wait() iterates over children of all living sub threads.
960
961 * i.e even though 'child_reaper' thread is listed as the parent of the
962 * orphaned children, any living sub-thread in the cgroup-init can
963 * perform the role of the child_reaper.
964 */
965 zap_pid_ns_processes(tsk->nsproxy->pid_ns);
84eb646b
ON
966}
967
7ad5b3a5 968NORET_TYPE void do_exit(long code)
1da177e4
LT
969{
970 struct task_struct *tsk = current;
971 int group_dead;
972
973 profile_task_exit(tsk);
974
22e2c507
JA
975 WARN_ON(atomic_read(&tsk->fs_excl));
976
1da177e4
LT
977 if (unlikely(in_interrupt()))
978 panic("Aiee, killing interrupt handler!");
979 if (unlikely(!tsk->pid))
980 panic("Attempted to kill the idle task!");
1da177e4
LT
981
982 if (unlikely(current->ptrace & PT_TRACE_EXIT)) {
983 current->ptrace_message = code;
984 ptrace_notify((PTRACE_EVENT_EXIT << 8) | SIGTRAP);
985 }
986
df164db5
AN
987 /*
988 * We're taking recursive faults here in do_exit. Safest is to just
989 * leave this task alone and wait for reboot.
990 */
991 if (unlikely(tsk->flags & PF_EXITING)) {
992 printk(KERN_ALERT
993 "Fixing recursive fault but reboot is needed!\n");
778e9a9c
AK
994 /*
995 * We can do this unlocked here. The futex code uses
996 * this flag just to verify whether the pi state
997 * cleanup has been done or not. In the worst case it
998 * loops once more. We pretend that the cleanup was
999 * done as there is no way to return. Either the
1000 * OWNER_DIED bit is set by now or we push the blocked
1001 * task into the wait for ever nirwana as well.
1002 */
1003 tsk->flags |= PF_EXITPIDONE;
afc847b7
AV
1004 if (tsk->io_context)
1005 exit_io_context();
df164db5
AN
1006 set_current_state(TASK_UNINTERRUPTIBLE);
1007 schedule();
1008 }
1009
d12619b5 1010 exit_signals(tsk); /* sets PF_EXITING */
778e9a9c
AK
1011 /*
1012 * tsk->flags are checked in the futex code to protect against
1013 * an exiting task cleaning up the robust pi futexes.
1014 */
d2ee7198
ON
1015 smp_mb();
1016 spin_unlock_wait(&tsk->pi_lock);
1da177e4 1017
1da177e4
LT
1018 if (unlikely(in_atomic()))
1019 printk(KERN_INFO "note: %s[%d] exited with preempt_count %d\n",
ba25f9dc 1020 current->comm, task_pid_nr(current),
1da177e4
LT
1021 preempt_count());
1022
1023 acct_update_integrals(tsk);
365e9c87
HD
1024 if (tsk->mm) {
1025 update_hiwater_rss(tsk->mm);
1026 update_hiwater_vm(tsk->mm);
1027 }
1da177e4 1028 group_dead = atomic_dec_and_test(&tsk->signal->live);
c3068951 1029 if (group_dead) {
84eb646b 1030 exit_child_reaper(tsk);
778e9a9c 1031 hrtimer_cancel(&tsk->signal->real_timer);
25f407f0 1032 exit_itimers(tsk->signal);
c3068951 1033 }
f6ec29a4 1034 acct_collect(code, group_dead);
42b2dd0a 1035#ifdef CONFIG_FUTEX
0771dfef
IM
1036 if (unlikely(tsk->robust_list))
1037 exit_robust_list(tsk);
42b2dd0a 1038#ifdef CONFIG_COMPAT
34f192c6
IM
1039 if (unlikely(tsk->compat_robust_list))
1040 compat_exit_robust_list(tsk);
42b2dd0a 1041#endif
34f192c6 1042#endif
522ed776
MT
1043 if (group_dead)
1044 tty_audit_exit();
fa84cb93
AV
1045 if (unlikely(tsk->audit_context))
1046 audit_free(tsk);
115085ea 1047
f2ab6d88 1048 tsk->exit_code = code;
115085ea 1049 taskstats_exit(tsk, group_dead);
c757249a 1050
1da177e4
LT
1051 exit_mm(tsk);
1052
0e464814 1053 if (group_dead)
f6ec29a4 1054 acct_process();
1da177e4 1055 exit_sem(tsk);
1ec7f1dd
AV
1056 exit_files(tsk);
1057 exit_fs(tsk);
e18eecb8 1058 check_stack_usage();
1da177e4 1059 exit_thread();
b4f48b63 1060 cgroup_exit(tsk, 1);
1da177e4
LT
1061 exit_keys(tsk);
1062
1063 if (group_dead && tsk->signal->leader)
1064 disassociate_ctty(1);
1065
a1261f54 1066 module_put(task_thread_info(tsk)->exec_domain->module);
1da177e4
LT
1067 if (tsk->binfmt)
1068 module_put(tsk->binfmt->module);
1069
9f46080c 1070 proc_exit_connector(tsk);
821c7de7 1071 exit_notify(tsk, group_dead);
1da177e4 1072#ifdef CONFIG_NUMA
f0be3d32 1073 mpol_put(tsk->mempolicy);
1da177e4
LT
1074 tsk->mempolicy = NULL;
1075#endif
42b2dd0a 1076#ifdef CONFIG_FUTEX
c87e2837
IM
1077 /*
1078 * This must happen late, after the PID is not
1079 * hashed anymore:
1080 */
1081 if (unlikely(!list_empty(&tsk->pi_state_list)))
1082 exit_pi_state_list(tsk);
1083 if (unlikely(current->pi_state_cache))
1084 kfree(current->pi_state_cache);
42b2dd0a 1085#endif
de5097c2 1086 /*
9a11b49a 1087 * Make sure we are holding no locks:
de5097c2 1088 */
9a11b49a 1089 debug_check_no_locks_held(tsk);
778e9a9c
AK
1090 /*
1091 * We can do this unlocked here. The futex code uses this flag
1092 * just to verify whether the pi state cleanup has been done
1093 * or not. In the worst case it loops once more.
1094 */
1095 tsk->flags |= PF_EXITPIDONE;
1da177e4 1096
afc847b7
AV
1097 if (tsk->io_context)
1098 exit_io_context();
1099
b92ce558
JA
1100 if (tsk->splice_pipe)
1101 __free_pipe_info(tsk->splice_pipe);
1102
7407251a 1103 preempt_disable();
55a101f8 1104 /* causes final put_task_struct in finish_task_switch(). */
c394cc9f 1105 tsk->state = TASK_DEAD;
7407251a 1106
1da177e4
LT
1107 schedule();
1108 BUG();
1109 /* Avoid "noreturn function does return". */
54306cf0
AC
1110 for (;;)
1111 cpu_relax(); /* For when BUG is null */
1da177e4
LT
1112}
1113
012914da
RA
1114EXPORT_SYMBOL_GPL(do_exit);
1115
1da177e4
LT
1116NORET_TYPE void complete_and_exit(struct completion *comp, long code)
1117{
1118 if (comp)
1119 complete(comp);
55a101f8 1120
1da177e4
LT
1121 do_exit(code);
1122}
1123
1124EXPORT_SYMBOL(complete_and_exit);
1125
1126asmlinkage long sys_exit(int error_code)
1127{
1128 do_exit((error_code&0xff)<<8);
1129}
1130
1da177e4
LT
1131/*
1132 * Take down every thread in the group. This is called by fatal signals
1133 * as well as by sys_exit_group (below).
1134 */
1135NORET_TYPE void
1136do_group_exit(int exit_code)
1137{
bfc4b089
ON
1138 struct signal_struct *sig = current->signal;
1139
1da177e4
LT
1140 BUG_ON(exit_code & 0x80); /* core dumps don't get here */
1141
bfc4b089
ON
1142 if (signal_group_exit(sig))
1143 exit_code = sig->group_exit_code;
1da177e4 1144 else if (!thread_group_empty(current)) {
1da177e4 1145 struct sighand_struct *const sighand = current->sighand;
1da177e4 1146 spin_lock_irq(&sighand->siglock);
ed5d2cac 1147 if (signal_group_exit(sig))
1da177e4
LT
1148 /* Another thread got here before we took the lock. */
1149 exit_code = sig->group_exit_code;
1150 else {
1da177e4 1151 sig->group_exit_code = exit_code;
ed5d2cac 1152 sig->flags = SIGNAL_GROUP_EXIT;
1da177e4
LT
1153 zap_other_threads(current);
1154 }
1155 spin_unlock_irq(&sighand->siglock);
1da177e4
LT
1156 }
1157
1158 do_exit(exit_code);
1159 /* NOTREACHED */
1160}
1161
1162/*
1163 * this kills every thread in the thread group. Note that any externally
1164 * wait4()-ing process will get the correct exit code - even if this
1165 * thread is not the thread group leader.
1166 */
1167asmlinkage void sys_exit_group(int error_code)
1168{
1169 do_group_exit((error_code & 0xff) << 8);
1170}
1171
161550d7
EB
1172static struct pid *task_pid_type(struct task_struct *task, enum pid_type type)
1173{
1174 struct pid *pid = NULL;
1175 if (type == PIDTYPE_PID)
1176 pid = task->pids[type].pid;
1177 else if (type < PIDTYPE_MAX)
1178 pid = task->group_leader->pids[type].pid;
1179 return pid;
1180}
1181
1182static int eligible_child(enum pid_type type, struct pid *pid, int options,
1183 struct task_struct *p)
1da177e4 1184{
73243284
RM
1185 int err;
1186
161550d7
EB
1187 if (type < PIDTYPE_MAX) {
1188 if (task_pid_type(p, type) != pid)
1da177e4
LT
1189 return 0;
1190 }
1191
1da177e4
LT
1192 /* Wait for all children (clone and not) if __WALL is set;
1193 * otherwise, wait for clone children *only* if __WCLONE is
1194 * set; otherwise, wait for non-clone children *only*. (Note:
1195 * A "clone" child here is one that reports to its parent
1196 * using a signal other than SIGCHLD.) */
1197 if (((p->exit_signal != SIGCHLD) ^ ((options & __WCLONE) != 0))
1198 && !(options & __WALL))
1199 return 0;
1da177e4 1200
73243284 1201 err = security_task_wait(p);
14dd0b81
RM
1202 if (err)
1203 return err;
1da177e4 1204
14dd0b81 1205 return 1;
1da177e4
LT
1206}
1207
36c8b586 1208static int wait_noreap_copyout(struct task_struct *p, pid_t pid, uid_t uid,
1da177e4
LT
1209 int why, int status,
1210 struct siginfo __user *infop,
1211 struct rusage __user *rusagep)
1212{
1213 int retval = rusagep ? getrusage(p, RUSAGE_BOTH, rusagep) : 0;
36c8b586 1214
1da177e4
LT
1215 put_task_struct(p);
1216 if (!retval)
1217 retval = put_user(SIGCHLD, &infop->si_signo);
1218 if (!retval)
1219 retval = put_user(0, &infop->si_errno);
1220 if (!retval)
1221 retval = put_user((short)why, &infop->si_code);
1222 if (!retval)
1223 retval = put_user(pid, &infop->si_pid);
1224 if (!retval)
1225 retval = put_user(uid, &infop->si_uid);
1226 if (!retval)
1227 retval = put_user(status, &infop->si_status);
1228 if (!retval)
1229 retval = pid;
1230 return retval;
1231}
1232
1233/*
1234 * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
1235 * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
1236 * the lock and this task is uninteresting. If we return nonzero, we have
1237 * released the lock and the system call should return.
1238 */
98abed02 1239static int wait_task_zombie(struct task_struct *p, int options,
1da177e4
LT
1240 struct siginfo __user *infop,
1241 int __user *stat_addr, struct rusage __user *ru)
1242{
1243 unsigned long state;
2f4e6e2a 1244 int retval, status, traced;
6c5f3e7b 1245 pid_t pid = task_pid_vnr(p);
1da177e4 1246
98abed02
RM
1247 if (!likely(options & WEXITED))
1248 return 0;
1249
1250 if (unlikely(options & WNOWAIT)) {
1da177e4
LT
1251 uid_t uid = p->uid;
1252 int exit_code = p->exit_code;
1253 int why, status;
1254
1da177e4
LT
1255 get_task_struct(p);
1256 read_unlock(&tasklist_lock);
1257 if ((exit_code & 0x7f) == 0) {
1258 why = CLD_EXITED;
1259 status = exit_code >> 8;
1260 } else {
1261 why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
1262 status = exit_code & 0x7f;
1263 }
1264 return wait_noreap_copyout(p, pid, uid, why,
1265 status, infop, ru);
1266 }
1267
1268 /*
1269 * Try to move the task's state to DEAD
1270 * only one thread is allowed to do this:
1271 */
1272 state = xchg(&p->exit_state, EXIT_DEAD);
1273 if (state != EXIT_ZOMBIE) {
1274 BUG_ON(state != EXIT_DEAD);
1275 return 0;
1276 }
1da177e4 1277
53b6f9fb 1278 traced = ptrace_reparented(p);
2f4e6e2a
ON
1279
1280 if (likely(!traced)) {
3795e161
JJ
1281 struct signal_struct *psig;
1282 struct signal_struct *sig;
1283
1da177e4
LT
1284 /*
1285 * The resource counters for the group leader are in its
1286 * own task_struct. Those for dead threads in the group
1287 * are in its signal_struct, as are those for the child
1288 * processes it has previously reaped. All these
1289 * accumulate in the parent's signal_struct c* fields.
1290 *
1291 * We don't bother to take a lock here to protect these
1292 * p->signal fields, because they are only touched by
1293 * __exit_signal, which runs with tasklist_lock
1294 * write-locked anyway, and so is excluded here. We do
1295 * need to protect the access to p->parent->signal fields,
1296 * as other threads in the parent group can be right
1297 * here reaping other children at the same time.
1298 */
1299 spin_lock_irq(&p->parent->sighand->siglock);
3795e161
JJ
1300 psig = p->parent->signal;
1301 sig = p->signal;
1302 psig->cutime =
1303 cputime_add(psig->cutime,
1da177e4 1304 cputime_add(p->utime,
3795e161
JJ
1305 cputime_add(sig->utime,
1306 sig->cutime)));
1307 psig->cstime =
1308 cputime_add(psig->cstime,
1da177e4 1309 cputime_add(p->stime,
3795e161
JJ
1310 cputime_add(sig->stime,
1311 sig->cstime)));
9ac52315
LV
1312 psig->cgtime =
1313 cputime_add(psig->cgtime,
1314 cputime_add(p->gtime,
1315 cputime_add(sig->gtime,
1316 sig->cgtime)));
3795e161
JJ
1317 psig->cmin_flt +=
1318 p->min_flt + sig->min_flt + sig->cmin_flt;
1319 psig->cmaj_flt +=
1320 p->maj_flt + sig->maj_flt + sig->cmaj_flt;
1321 psig->cnvcsw +=
1322 p->nvcsw + sig->nvcsw + sig->cnvcsw;
1323 psig->cnivcsw +=
1324 p->nivcsw + sig->nivcsw + sig->cnivcsw;
6eaeeaba
ED
1325 psig->cinblock +=
1326 task_io_get_inblock(p) +
1327 sig->inblock + sig->cinblock;
1328 psig->coublock +=
1329 task_io_get_oublock(p) +
1330 sig->oublock + sig->coublock;
1da177e4
LT
1331 spin_unlock_irq(&p->parent->sighand->siglock);
1332 }
1333
1334 /*
1335 * Now we are sure this task is interesting, and no other
1336 * thread can reap it because we set its state to EXIT_DEAD.
1337 */
1338 read_unlock(&tasklist_lock);
1339
1340 retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
1341 status = (p->signal->flags & SIGNAL_GROUP_EXIT)
1342 ? p->signal->group_exit_code : p->exit_code;
1343 if (!retval && stat_addr)
1344 retval = put_user(status, stat_addr);
1345 if (!retval && infop)
1346 retval = put_user(SIGCHLD, &infop->si_signo);
1347 if (!retval && infop)
1348 retval = put_user(0, &infop->si_errno);
1349 if (!retval && infop) {
1350 int why;
1351
1352 if ((status & 0x7f) == 0) {
1353 why = CLD_EXITED;
1354 status >>= 8;
1355 } else {
1356 why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
1357 status &= 0x7f;
1358 }
1359 retval = put_user((short)why, &infop->si_code);
1360 if (!retval)
1361 retval = put_user(status, &infop->si_status);
1362 }
1363 if (!retval && infop)
3a515e4a 1364 retval = put_user(pid, &infop->si_pid);
1da177e4
LT
1365 if (!retval && infop)
1366 retval = put_user(p->uid, &infop->si_uid);
2f4e6e2a 1367 if (!retval)
3a515e4a 1368 retval = pid;
2f4e6e2a
ON
1369
1370 if (traced) {
1da177e4 1371 write_lock_irq(&tasklist_lock);
2f4e6e2a
ON
1372 /* We dropped tasklist, ptracer could die and untrace */
1373 ptrace_unlink(p);
1374 /*
1375 * If this is not a detached task, notify the parent.
1376 * If it's still not detached after that, don't release
1377 * it now.
1378 */
d839fd4d 1379 if (!task_detached(p)) {
2f4e6e2a 1380 do_notify_parent(p, p->exit_signal);
d839fd4d 1381 if (!task_detached(p)) {
2f4e6e2a
ON
1382 p->exit_state = EXIT_ZOMBIE;
1383 p = NULL;
1da177e4
LT
1384 }
1385 }
1386 write_unlock_irq(&tasklist_lock);
1387 }
1388 if (p != NULL)
1389 release_task(p);
2f4e6e2a 1390
1da177e4
LT
1391 return retval;
1392}
1393
1394/*
1395 * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold
1396 * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
1397 * the lock and this task is uninteresting. If we return nonzero, we have
1398 * released the lock and the system call should return.
1399 */
f470021a 1400static int wait_task_stopped(int ptrace, struct task_struct *p,
98abed02 1401 int options, struct siginfo __user *infop,
1da177e4
LT
1402 int __user *stat_addr, struct rusage __user *ru)
1403{
ee7c82da
ON
1404 int retval, exit_code, why;
1405 uid_t uid = 0; /* unneeded, required by compiler */
c8950783 1406 pid_t pid;
1da177e4 1407
f470021a 1408 if (!(options & WUNTRACED))
98abed02
RM
1409 return 0;
1410
ee7c82da
ON
1411 exit_code = 0;
1412 spin_lock_irq(&p->sighand->siglock);
1413
1414 if (unlikely(!task_is_stopped_or_traced(p)))
1415 goto unlock_sig;
1416
f470021a 1417 if (!ptrace && p->signal->group_stop_count > 0)
1da177e4
LT
1418 /*
1419 * A group stop is in progress and this is the group leader.
1420 * We won't report until all threads have stopped.
1421 */
ee7c82da
ON
1422 goto unlock_sig;
1423
1424 exit_code = p->exit_code;
1425 if (!exit_code)
1426 goto unlock_sig;
1427
98abed02 1428 if (!unlikely(options & WNOWAIT))
ee7c82da
ON
1429 p->exit_code = 0;
1430
1431 uid = p->uid;
1432unlock_sig:
1433 spin_unlock_irq(&p->sighand->siglock);
1434 if (!exit_code)
1da177e4
LT
1435 return 0;
1436
1437 /*
1438 * Now we are pretty sure this task is interesting.
1439 * Make sure it doesn't get reaped out from under us while we
1440 * give up the lock and then examine it below. We don't want to
1441 * keep holding onto the tasklist_lock while we call getrusage and
1442 * possibly take page faults for user memory.
1443 */
1444 get_task_struct(p);
6c5f3e7b 1445 pid = task_pid_vnr(p);
f470021a 1446 why = ptrace ? CLD_TRAPPED : CLD_STOPPED;
1da177e4
LT
1447 read_unlock(&tasklist_lock);
1448
98abed02 1449 if (unlikely(options & WNOWAIT))
1da177e4 1450 return wait_noreap_copyout(p, pid, uid,
e6ceb32a 1451 why, exit_code,
1da177e4 1452 infop, ru);
1da177e4
LT
1453
1454 retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
1455 if (!retval && stat_addr)
1456 retval = put_user((exit_code << 8) | 0x7f, stat_addr);
1457 if (!retval && infop)
1458 retval = put_user(SIGCHLD, &infop->si_signo);
1459 if (!retval && infop)
1460 retval = put_user(0, &infop->si_errno);
1461 if (!retval && infop)
6efcae46 1462 retval = put_user((short)why, &infop->si_code);
1da177e4
LT
1463 if (!retval && infop)
1464 retval = put_user(exit_code, &infop->si_status);
1465 if (!retval && infop)
c8950783 1466 retval = put_user(pid, &infop->si_pid);
1da177e4 1467 if (!retval && infop)
ee7c82da 1468 retval = put_user(uid, &infop->si_uid);
1da177e4 1469 if (!retval)
c8950783 1470 retval = pid;
1da177e4
LT
1471 put_task_struct(p);
1472
1473 BUG_ON(!retval);
1474 return retval;
1475}
1476
1477/*
1478 * Handle do_wait work for one task in a live, non-stopped state.
1479 * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
1480 * the lock and this task is uninteresting. If we return nonzero, we have
1481 * released the lock and the system call should return.
1482 */
98abed02 1483static int wait_task_continued(struct task_struct *p, int options,
1da177e4
LT
1484 struct siginfo __user *infop,
1485 int __user *stat_addr, struct rusage __user *ru)
1486{
1487 int retval;
1488 pid_t pid;
1489 uid_t uid;
1490
98abed02
RM
1491 if (!unlikely(options & WCONTINUED))
1492 return 0;
1493
1da177e4
LT
1494 if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
1495 return 0;
1496
1497 spin_lock_irq(&p->sighand->siglock);
1498 /* Re-check with the lock held. */
1499 if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
1500 spin_unlock_irq(&p->sighand->siglock);
1501 return 0;
1502 }
98abed02 1503 if (!unlikely(options & WNOWAIT))
1da177e4
LT
1504 p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
1505 spin_unlock_irq(&p->sighand->siglock);
1506
6c5f3e7b 1507 pid = task_pid_vnr(p);
1da177e4
LT
1508 uid = p->uid;
1509 get_task_struct(p);
1510 read_unlock(&tasklist_lock);
1511
1512 if (!infop) {
1513 retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
1514 put_task_struct(p);
1515 if (!retval && stat_addr)
1516 retval = put_user(0xffff, stat_addr);
1517 if (!retval)
3a515e4a 1518 retval = pid;
1da177e4
LT
1519 } else {
1520 retval = wait_noreap_copyout(p, pid, uid,
1521 CLD_CONTINUED, SIGCONT,
1522 infop, ru);
1523 BUG_ON(retval == 0);
1524 }
1525
1526 return retval;
1527}
1528
98abed02
RM
1529/*
1530 * Consider @p for a wait by @parent.
1531 *
1532 * -ECHILD should be in *@notask_error before the first call.
1533 * Returns nonzero for a final return, when we have unlocked tasklist_lock.
1534 * Returns zero if the search for a child should continue;
14dd0b81
RM
1535 * then *@notask_error is 0 if @p is an eligible child,
1536 * or another error from security_task_wait(), or still -ECHILD.
98abed02 1537 */
f470021a 1538static int wait_consider_task(struct task_struct *parent, int ptrace,
98abed02
RM
1539 struct task_struct *p, int *notask_error,
1540 enum pid_type type, struct pid *pid, int options,
1541 struct siginfo __user *infop,
1542 int __user *stat_addr, struct rusage __user *ru)
1543{
1544 int ret = eligible_child(type, pid, options, p);
14dd0b81 1545 if (!ret)
98abed02
RM
1546 return ret;
1547
14dd0b81
RM
1548 if (unlikely(ret < 0)) {
1549 /*
1550 * If we have not yet seen any eligible child,
1551 * then let this error code replace -ECHILD.
1552 * A permission error will give the user a clue
1553 * to look for security policy problems, rather
1554 * than for mysterious wait bugs.
1555 */
1556 if (*notask_error)
1557 *notask_error = ret;
1558 }
1559
f470021a
RM
1560 if (likely(!ptrace) && unlikely(p->ptrace)) {
1561 /*
1562 * This child is hidden by ptrace.
1563 * We aren't allowed to see it now, but eventually we will.
1564 */
1565 *notask_error = 0;
1566 return 0;
1567 }
1568
98abed02
RM
1569 if (p->exit_state == EXIT_DEAD)
1570 return 0;
1571
1572 /*
1573 * We don't reap group leaders with subthreads.
1574 */
1575 if (p->exit_state == EXIT_ZOMBIE && !delay_group_leader(p))
1576 return wait_task_zombie(p, options, infop, stat_addr, ru);
1577
1578 /*
1579 * It's stopped or running now, so it might
1580 * later continue, exit, or stop again.
1581 */
1582 *notask_error = 0;
1583
1584 if (task_is_stopped_or_traced(p))
f470021a
RM
1585 return wait_task_stopped(ptrace, p, options,
1586 infop, stat_addr, ru);
98abed02
RM
1587
1588 return wait_task_continued(p, options, infop, stat_addr, ru);
1589}
1590
1591/*
1592 * Do the work of do_wait() for one thread in the group, @tsk.
1593 *
1594 * -ECHILD should be in *@notask_error before the first call.
1595 * Returns nonzero for a final return, when we have unlocked tasklist_lock.
1596 * Returns zero if the search for a child should continue; then
14dd0b81
RM
1597 * *@notask_error is 0 if there were any eligible children,
1598 * or another error from security_task_wait(), or still -ECHILD.
98abed02
RM
1599 */
1600static int do_wait_thread(struct task_struct *tsk, int *notask_error,
1601 enum pid_type type, struct pid *pid, int options,
1602 struct siginfo __user *infop, int __user *stat_addr,
1603 struct rusage __user *ru)
1604{
1605 struct task_struct *p;
1606
1607 list_for_each_entry(p, &tsk->children, sibling) {
f470021a
RM
1608 /*
1609 * Do not consider detached threads.
1610 */
1611 if (!task_detached(p)) {
1612 int ret = wait_consider_task(tsk, 0, p, notask_error,
1613 type, pid, options,
1614 infop, stat_addr, ru);
1615 if (ret)
1616 return ret;
1617 }
98abed02
RM
1618 }
1619
1620 return 0;
1621}
1622
1623static int ptrace_do_wait(struct task_struct *tsk, int *notask_error,
1624 enum pid_type type, struct pid *pid, int options,
1625 struct siginfo __user *infop, int __user *stat_addr,
1626 struct rusage __user *ru)
1627{
1628 struct task_struct *p;
1629
1630 /*
f470021a 1631 * Traditionally we see ptrace'd stopped tasks regardless of options.
98abed02 1632 */
f470021a 1633 options |= WUNTRACED;
98abed02 1634
f470021a
RM
1635 list_for_each_entry(p, &tsk->ptraced, ptrace_entry) {
1636 int ret = wait_consider_task(tsk, 1, p, notask_error,
1637 type, pid, options,
1638 infop, stat_addr, ru);
1639 if (ret)
98abed02 1640 return ret;
98abed02
RM
1641 }
1642
1643 return 0;
1644}
1645
161550d7
EB
1646static long do_wait(enum pid_type type, struct pid *pid, int options,
1647 struct siginfo __user *infop, int __user *stat_addr,
1648 struct rusage __user *ru)
1da177e4
LT
1649{
1650 DECLARE_WAITQUEUE(wait, current);
1651 struct task_struct *tsk;
98abed02 1652 int retval;
1da177e4
LT
1653
1654 add_wait_queue(&current->signal->wait_chldexit,&wait);
1655repeat:
98abed02
RM
1656 /*
1657 * If there is nothing that can match our critiera just get out.
1658 * We will clear @retval to zero if we see any child that might later
1659 * match our criteria, even if we are not able to reap it yet.
1660 */
161550d7
EB
1661 retval = -ECHILD;
1662 if ((type < PIDTYPE_MAX) && (!pid || hlist_empty(&pid->tasks[type])))
1663 goto end;
1664
1da177e4
LT
1665 current->state = TASK_INTERRUPTIBLE;
1666 read_lock(&tasklist_lock);
1667 tsk = current;
1668 do {
98abed02
RM
1669 int tsk_result = do_wait_thread(tsk, &retval,
1670 type, pid, options,
1671 infop, stat_addr, ru);
1672 if (!tsk_result)
1673 tsk_result = ptrace_do_wait(tsk, &retval,
1674 type, pid, options,
1675 infop, stat_addr, ru);
1676 if (tsk_result) {
1677 /*
1678 * tasklist_lock is unlocked and we have a final result.
1679 */
1680 retval = tsk_result;
1681 goto end;
1da177e4 1682 }
98abed02 1683
1da177e4
LT
1684 if (options & __WNOTHREAD)
1685 break;
1686 tsk = next_thread(tsk);
125e1874 1687 BUG_ON(tsk->signal != current->signal);
1da177e4 1688 } while (tsk != current);
1da177e4 1689 read_unlock(&tasklist_lock);
f2cc3eb1 1690
98abed02 1691 if (!retval && !(options & WNOHANG)) {
1da177e4 1692 retval = -ERESTARTSYS;
98abed02
RM
1693 if (!signal_pending(current)) {
1694 schedule();
1695 goto repeat;
1696 }
1da177e4 1697 }
98abed02 1698
1da177e4
LT
1699end:
1700 current->state = TASK_RUNNING;
1701 remove_wait_queue(&current->signal->wait_chldexit,&wait);
1702 if (infop) {
1703 if (retval > 0)
9cbab810 1704 retval = 0;
1da177e4
LT
1705 else {
1706 /*
1707 * For a WNOHANG return, clear out all the fields
1708 * we would set so the user can easily tell the
1709 * difference.
1710 */
1711 if (!retval)
1712 retval = put_user(0, &infop->si_signo);
1713 if (!retval)
1714 retval = put_user(0, &infop->si_errno);
1715 if (!retval)
1716 retval = put_user(0, &infop->si_code);
1717 if (!retval)
1718 retval = put_user(0, &infop->si_pid);
1719 if (!retval)
1720 retval = put_user(0, &infop->si_uid);
1721 if (!retval)
1722 retval = put_user(0, &infop->si_status);
1723 }
1724 }
1725 return retval;
1726}
1727
161550d7 1728asmlinkage long sys_waitid(int which, pid_t upid,
1da177e4
LT
1729 struct siginfo __user *infop, int options,
1730 struct rusage __user *ru)
1731{
161550d7
EB
1732 struct pid *pid = NULL;
1733 enum pid_type type;
1da177e4
LT
1734 long ret;
1735
1736 if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
1737 return -EINVAL;
1738 if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
1739 return -EINVAL;
1740
1741 switch (which) {
1742 case P_ALL:
161550d7 1743 type = PIDTYPE_MAX;
1da177e4
LT
1744 break;
1745 case P_PID:
161550d7
EB
1746 type = PIDTYPE_PID;
1747 if (upid <= 0)
1da177e4
LT
1748 return -EINVAL;
1749 break;
1750 case P_PGID:
161550d7
EB
1751 type = PIDTYPE_PGID;
1752 if (upid <= 0)
1da177e4 1753 return -EINVAL;
1da177e4
LT
1754 break;
1755 default:
1756 return -EINVAL;
1757 }
1758
161550d7
EB
1759 if (type < PIDTYPE_MAX)
1760 pid = find_get_pid(upid);
1761 ret = do_wait(type, pid, options, infop, NULL, ru);
1762 put_pid(pid);
1da177e4
LT
1763
1764 /* avoid REGPARM breakage on x86: */
54a01510 1765 asmlinkage_protect(5, ret, which, upid, infop, options, ru);
1da177e4
LT
1766 return ret;
1767}
1768
161550d7 1769asmlinkage long sys_wait4(pid_t upid, int __user *stat_addr,
1da177e4
LT
1770 int options, struct rusage __user *ru)
1771{
161550d7
EB
1772 struct pid *pid = NULL;
1773 enum pid_type type;
1da177e4
LT
1774 long ret;
1775
1776 if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
1777 __WNOTHREAD|__WCLONE|__WALL))
1778 return -EINVAL;
161550d7
EB
1779
1780 if (upid == -1)
1781 type = PIDTYPE_MAX;
1782 else if (upid < 0) {
1783 type = PIDTYPE_PGID;
1784 pid = find_get_pid(-upid);
1785 } else if (upid == 0) {
1786 type = PIDTYPE_PGID;
1787 pid = get_pid(task_pgrp(current));
1788 } else /* upid > 0 */ {
1789 type = PIDTYPE_PID;
1790 pid = find_get_pid(upid);
1791 }
1792
1793 ret = do_wait(type, pid, options | WEXITED, NULL, stat_addr, ru);
1794 put_pid(pid);
1da177e4
LT
1795
1796 /* avoid REGPARM breakage on x86: */
54a01510 1797 asmlinkage_protect(4, ret, upid, stat_addr, options, ru);
1da177e4
LT
1798 return ret;
1799}
1800
1801#ifdef __ARCH_WANT_SYS_WAITPID
1802
1803/*
1804 * sys_waitpid() remains for compatibility. waitpid() should be
1805 * implemented by calling sys_wait4() from libc.a.
1806 */
1807asmlinkage long sys_waitpid(pid_t pid, int __user *stat_addr, int options)
1808{
1809 return sys_wait4(pid, stat_addr, options, NULL);
1810}
1811
1812#endif