wait/ptrace: assume __WALL if the child is traced
[linux/fpc-iii.git] / kernel / exit.c
blob654021d9f1b351fe4eab9d007cf3eebd0267ff81
1 /*
2 * linux/kernel/exit.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 #include <linux/mm.h>
8 #include <linux/slab.h>
9 #include <linux/interrupt.h>
10 #include <linux/module.h>
11 #include <linux/capability.h>
12 #include <linux/completion.h>
13 #include <linux/personality.h>
14 #include <linux/tty.h>
15 #include <linux/iocontext.h>
16 #include <linux/key.h>
17 #include <linux/security.h>
18 #include <linux/cpu.h>
19 #include <linux/acct.h>
20 #include <linux/tsacct_kern.h>
21 #include <linux/file.h>
22 #include <linux/fdtable.h>
23 #include <linux/freezer.h>
24 #include <linux/binfmts.h>
25 #include <linux/nsproxy.h>
26 #include <linux/pid_namespace.h>
27 #include <linux/ptrace.h>
28 #include <linux/profile.h>
29 #include <linux/mount.h>
30 #include <linux/proc_fs.h>
31 #include <linux/kthread.h>
32 #include <linux/mempolicy.h>
33 #include <linux/taskstats_kern.h>
34 #include <linux/delayacct.h>
35 #include <linux/cgroup.h>
36 #include <linux/syscalls.h>
37 #include <linux/signal.h>
38 #include <linux/posix-timers.h>
39 #include <linux/cn_proc.h>
40 #include <linux/mutex.h>
41 #include <linux/futex.h>
42 #include <linux/pipe_fs_i.h>
43 #include <linux/audit.h> /* for audit_free() */
44 #include <linux/resource.h>
45 #include <linux/blkdev.h>
46 #include <linux/task_io_accounting_ops.h>
47 #include <linux/tracehook.h>
48 #include <linux/fs_struct.h>
49 #include <linux/init_task.h>
50 #include <linux/perf_event.h>
51 #include <trace/events/sched.h>
52 #include <linux/hw_breakpoint.h>
53 #include <linux/oom.h>
54 #include <linux/writeback.h>
55 #include <linux/shm.h>
57 #include <asm/uaccess.h>
58 #include <asm/unistd.h>
59 #include <asm/pgtable.h>
60 #include <asm/mmu_context.h>
62 static void exit_mm(struct task_struct *tsk);
64 static void __unhash_process(struct task_struct *p, bool group_dead)
66 nr_threads--;
67 detach_pid(p, PIDTYPE_PID);
68 if (group_dead) {
69 detach_pid(p, PIDTYPE_PGID);
70 detach_pid(p, PIDTYPE_SID);
72 list_del_rcu(&p->tasks);
73 list_del_init(&p->sibling);
74 __this_cpu_dec(process_counts);
76 list_del_rcu(&p->thread_group);
77 list_del_rcu(&p->thread_node);
81 * This function expects the tasklist_lock write-locked.
83 static void __exit_signal(struct task_struct *tsk)
85 struct signal_struct *sig = tsk->signal;
86 bool group_dead = thread_group_leader(tsk);
87 struct sighand_struct *sighand;
88 struct tty_struct *uninitialized_var(tty);
89 cputime_t utime, stime;
91 sighand = rcu_dereference_check(tsk->sighand,
92 lockdep_tasklist_lock_is_held());
93 spin_lock(&sighand->siglock);
95 posix_cpu_timers_exit(tsk);
96 if (group_dead) {
97 posix_cpu_timers_exit_group(tsk);
98 tty = sig->tty;
99 sig->tty = NULL;
100 } else {
102 * This can only happen if the caller is de_thread().
103 * FIXME: this is the temporary hack, we should teach
104 * posix-cpu-timers to handle this case correctly.
106 if (unlikely(has_group_leader_pid(tsk)))
107 posix_cpu_timers_exit_group(tsk);
110 * If there is any task waiting for the group exit
111 * then notify it:
113 if (sig->notify_count > 0 && !--sig->notify_count)
114 wake_up_process(sig->group_exit_task);
116 if (tsk == sig->curr_target)
117 sig->curr_target = next_thread(tsk);
121 * Accumulate here the counters for all threads but the group leader
122 * as they die, so they can be added into the process-wide totals
123 * when those are taken. The group leader stays around as a zombie as
124 * long as there are other threads. When it gets reaped, the exit.c
125 * code will add its counts into these totals. We won't ever get here
126 * for the group leader, since it will have been the last reference on
127 * the signal_struct.
129 task_cputime(tsk, &utime, &stime);
130 write_seqlock(&sig->stats_lock);
131 sig->utime += utime;
132 sig->stime += stime;
133 sig->gtime += task_gtime(tsk);
134 sig->min_flt += tsk->min_flt;
135 sig->maj_flt += tsk->maj_flt;
136 sig->nvcsw += tsk->nvcsw;
137 sig->nivcsw += tsk->nivcsw;
138 sig->inblock += task_io_get_inblock(tsk);
139 sig->oublock += task_io_get_oublock(tsk);
140 task_io_accounting_add(&sig->ioac, &tsk->ioac);
141 sig->sum_sched_runtime += tsk->se.sum_exec_runtime;
142 sig->nr_threads--;
143 __unhash_process(tsk, group_dead);
144 write_sequnlock(&sig->stats_lock);
147 * Do this under ->siglock, we can race with another thread
148 * doing sigqueue_free() if we have SIGQUEUE_PREALLOC signals.
150 flush_sigqueue(&tsk->pending);
151 tsk->sighand = NULL;
152 spin_unlock(&sighand->siglock);
154 __cleanup_sighand(sighand);
155 clear_tsk_thread_flag(tsk, TIF_SIGPENDING);
156 if (group_dead) {
157 flush_sigqueue(&sig->shared_pending);
158 tty_kref_put(tty);
162 static void delayed_put_task_struct(struct rcu_head *rhp)
164 struct task_struct *tsk = container_of(rhp, struct task_struct, rcu);
166 perf_event_delayed_put(tsk);
167 trace_sched_process_free(tsk);
168 put_task_struct(tsk);
172 void release_task(struct task_struct *p)
174 struct task_struct *leader;
175 int zap_leader;
176 repeat:
177 /* don't need to get the RCU readlock here - the process is dead and
178 * can't be modifying its own credentials. But shut RCU-lockdep up */
179 rcu_read_lock();
180 atomic_dec(&__task_cred(p)->user->processes);
181 rcu_read_unlock();
183 proc_flush_task(p);
185 write_lock_irq(&tasklist_lock);
186 ptrace_release_task(p);
187 __exit_signal(p);
190 * If we are the last non-leader member of the thread
191 * group, and the leader is zombie, then notify the
192 * group leader's parent process. (if it wants notification.)
194 zap_leader = 0;
195 leader = p->group_leader;
196 if (leader != p && thread_group_empty(leader)
197 && leader->exit_state == EXIT_ZOMBIE) {
199 * If we were the last child thread and the leader has
200 * exited already, and the leader's parent ignores SIGCHLD,
201 * then we are the one who should release the leader.
203 zap_leader = do_notify_parent(leader, leader->exit_signal);
204 if (zap_leader)
205 leader->exit_state = EXIT_DEAD;
208 write_unlock_irq(&tasklist_lock);
209 release_thread(p);
210 call_rcu(&p->rcu, delayed_put_task_struct);
212 p = leader;
213 if (unlikely(zap_leader))
214 goto repeat;
218 * This checks not only the pgrp, but falls back on the pid if no
219 * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
220 * without this...
222 * The caller must hold rcu lock or the tasklist lock.
224 struct pid *session_of_pgrp(struct pid *pgrp)
226 struct task_struct *p;
227 struct pid *sid = NULL;
229 p = pid_task(pgrp, PIDTYPE_PGID);
230 if (p == NULL)
231 p = pid_task(pgrp, PIDTYPE_PID);
232 if (p != NULL)
233 sid = task_session(p);
235 return sid;
239 * Determine if a process group is "orphaned", according to the POSIX
240 * definition in 2.2.2.52. Orphaned process groups are not to be affected
241 * by terminal-generated stop signals. Newly orphaned process groups are
242 * to receive a SIGHUP and a SIGCONT.
244 * "I ask you, have you ever known what it is to be an orphan?"
246 static int will_become_orphaned_pgrp(struct pid *pgrp,
247 struct task_struct *ignored_task)
249 struct task_struct *p;
251 do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
252 if ((p == ignored_task) ||
253 (p->exit_state && thread_group_empty(p)) ||
254 is_global_init(p->real_parent))
255 continue;
257 if (task_pgrp(p->real_parent) != pgrp &&
258 task_session(p->real_parent) == task_session(p))
259 return 0;
260 } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
262 return 1;
265 int is_current_pgrp_orphaned(void)
267 int retval;
269 read_lock(&tasklist_lock);
270 retval = will_become_orphaned_pgrp(task_pgrp(current), NULL);
271 read_unlock(&tasklist_lock);
273 return retval;
276 static bool has_stopped_jobs(struct pid *pgrp)
278 struct task_struct *p;
280 do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
281 if (p->signal->flags & SIGNAL_STOP_STOPPED)
282 return true;
283 } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
285 return false;
289 * Check to see if any process groups have become orphaned as
290 * a result of our exiting, and if they have any stopped jobs,
291 * send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
293 static void
294 kill_orphaned_pgrp(struct task_struct *tsk, struct task_struct *parent)
296 struct pid *pgrp = task_pgrp(tsk);
297 struct task_struct *ignored_task = tsk;
299 if (!parent)
300 /* exit: our father is in a different pgrp than
301 * we are and we were the only connection outside.
303 parent = tsk->real_parent;
304 else
305 /* reparent: our child is in a different pgrp than
306 * we are, and it was the only connection outside.
308 ignored_task = NULL;
310 if (task_pgrp(parent) != pgrp &&
311 task_session(parent) == task_session(tsk) &&
312 will_become_orphaned_pgrp(pgrp, ignored_task) &&
313 has_stopped_jobs(pgrp)) {
314 __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp);
315 __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp);
319 #ifdef CONFIG_MEMCG
321 * A task is exiting. If it owned this mm, find a new owner for the mm.
323 void mm_update_next_owner(struct mm_struct *mm)
325 struct task_struct *c, *g, *p = current;
327 retry:
329 * If the exiting or execing task is not the owner, it's
330 * someone else's problem.
332 if (mm->owner != p)
333 return;
335 * The current owner is exiting/execing and there are no other
336 * candidates. Do not leave the mm pointing to a possibly
337 * freed task structure.
339 if (atomic_read(&mm->mm_users) <= 1) {
340 mm->owner = NULL;
341 return;
344 read_lock(&tasklist_lock);
346 * Search in the children
348 list_for_each_entry(c, &p->children, sibling) {
349 if (c->mm == mm)
350 goto assign_new_owner;
354 * Search in the siblings
356 list_for_each_entry(c, &p->real_parent->children, sibling) {
357 if (c->mm == mm)
358 goto assign_new_owner;
362 * Search through everything else, we should not get here often.
364 for_each_process(g) {
365 if (g->flags & PF_KTHREAD)
366 continue;
367 for_each_thread(g, c) {
368 if (c->mm == mm)
369 goto assign_new_owner;
370 if (c->mm)
371 break;
374 read_unlock(&tasklist_lock);
376 * We found no owner yet mm_users > 1: this implies that we are
377 * most likely racing with swapoff (try_to_unuse()) or /proc or
378 * ptrace or page migration (get_task_mm()). Mark owner as NULL.
380 mm->owner = NULL;
381 return;
383 assign_new_owner:
384 BUG_ON(c == p);
385 get_task_struct(c);
387 * The task_lock protects c->mm from changing.
388 * We always want mm->owner->mm == mm
390 task_lock(c);
392 * Delay read_unlock() till we have the task_lock()
393 * to ensure that c does not slip away underneath us
395 read_unlock(&tasklist_lock);
396 if (c->mm != mm) {
397 task_unlock(c);
398 put_task_struct(c);
399 goto retry;
401 mm->owner = c;
402 task_unlock(c);
403 put_task_struct(c);
405 #endif /* CONFIG_MEMCG */
408 * Turn us into a lazy TLB process if we
409 * aren't already..
411 static void exit_mm(struct task_struct *tsk)
413 struct mm_struct *mm = tsk->mm;
414 struct core_state *core_state;
416 mm_release(tsk, mm);
417 if (!mm)
418 return;
419 sync_mm_rss(mm);
421 * Serialize with any possible pending coredump.
422 * We must hold mmap_sem around checking core_state
423 * and clearing tsk->mm. The core-inducing thread
424 * will increment ->nr_threads for each thread in the
425 * group with ->mm != NULL.
427 down_read(&mm->mmap_sem);
428 core_state = mm->core_state;
429 if (core_state) {
430 struct core_thread self;
432 up_read(&mm->mmap_sem);
434 self.task = tsk;
435 self.next = xchg(&core_state->dumper.next, &self);
437 * Implies mb(), the result of xchg() must be visible
438 * to core_state->dumper.
440 if (atomic_dec_and_test(&core_state->nr_threads))
441 complete(&core_state->startup);
443 for (;;) {
444 set_task_state(tsk, TASK_UNINTERRUPTIBLE);
445 if (!self.task) /* see coredump_finish() */
446 break;
447 freezable_schedule();
449 __set_task_state(tsk, TASK_RUNNING);
450 down_read(&mm->mmap_sem);
452 atomic_inc(&mm->mm_count);
453 BUG_ON(mm != tsk->active_mm);
454 /* more a memory barrier than a real lock */
455 task_lock(tsk);
456 tsk->mm = NULL;
457 up_read(&mm->mmap_sem);
458 enter_lazy_tlb(mm, current);
459 task_unlock(tsk);
460 mm_update_next_owner(mm);
461 mmput(mm);
462 clear_thread_flag(TIF_MEMDIE);
466 * When we die, we re-parent all our children, and try to:
467 * 1. give them to another thread in our thread group, if such a member exists
468 * 2. give it to the first ancestor process which prctl'd itself as a
469 * child_subreaper for its children (like a service manager)
470 * 3. give it to the init process (PID 1) in our pid namespace
472 static struct task_struct *find_new_reaper(struct task_struct *father)
473 __releases(&tasklist_lock)
474 __acquires(&tasklist_lock)
476 struct pid_namespace *pid_ns = task_active_pid_ns(father);
477 struct task_struct *thread;
479 thread = father;
480 while_each_thread(father, thread) {
481 if (thread->flags & PF_EXITING)
482 continue;
483 if (unlikely(pid_ns->child_reaper == father))
484 pid_ns->child_reaper = thread;
485 return thread;
488 if (unlikely(pid_ns->child_reaper == father)) {
489 write_unlock_irq(&tasklist_lock);
490 if (unlikely(pid_ns == &init_pid_ns)) {
491 panic("Attempted to kill init! exitcode=0x%08x\n",
492 father->signal->group_exit_code ?:
493 father->exit_code);
496 zap_pid_ns_processes(pid_ns);
497 write_lock_irq(&tasklist_lock);
498 } else if (father->signal->has_child_subreaper) {
499 struct task_struct *reaper;
502 * Find the first ancestor marked as child_subreaper.
503 * Note that the code below checks same_thread_group(reaper,
504 * pid_ns->child_reaper). This is what we need to DTRT in a
505 * PID namespace. However we still need the check above, see
506 * http://marc.info/?l=linux-kernel&m=131385460420380
508 for (reaper = father->real_parent;
509 reaper != &init_task;
510 reaper = reaper->real_parent) {
511 if (same_thread_group(reaper, pid_ns->child_reaper))
512 break;
513 if (!reaper->signal->is_child_subreaper)
514 continue;
515 thread = reaper;
516 do {
517 if (!(thread->flags & PF_EXITING))
518 return reaper;
519 } while_each_thread(reaper, thread);
523 return pid_ns->child_reaper;
527 * Any that need to be release_task'd are put on the @dead list.
529 static void reparent_leader(struct task_struct *father, struct task_struct *p,
530 struct list_head *dead)
532 list_move_tail(&p->sibling, &p->real_parent->children);
534 if (p->exit_state == EXIT_DEAD)
535 return;
537 * If this is a threaded reparent there is no need to
538 * notify anyone anything has happened.
540 if (same_thread_group(p->real_parent, father))
541 return;
543 /* We don't want people slaying init. */
544 p->exit_signal = SIGCHLD;
546 /* If it has exited notify the new parent about this child's death. */
547 if (!p->ptrace &&
548 p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) {
549 if (do_notify_parent(p, p->exit_signal)) {
550 p->exit_state = EXIT_DEAD;
551 list_move_tail(&p->sibling, dead);
555 kill_orphaned_pgrp(p, father);
558 static void forget_original_parent(struct task_struct *father)
560 struct task_struct *p, *n, *reaper;
561 LIST_HEAD(dead_children);
563 write_lock_irq(&tasklist_lock);
565 * Note that exit_ptrace() and find_new_reaper() might
566 * drop tasklist_lock and reacquire it.
568 exit_ptrace(father);
569 reaper = find_new_reaper(father);
571 list_for_each_entry_safe(p, n, &father->children, sibling) {
572 struct task_struct *t = p;
574 do {
575 t->real_parent = reaper;
576 if (t->parent == father) {
577 BUG_ON(t->ptrace);
578 t->parent = t->real_parent;
580 if (t->pdeath_signal)
581 group_send_sig_info(t->pdeath_signal,
582 SEND_SIG_NOINFO, t);
583 } while_each_thread(p, t);
584 reparent_leader(father, p, &dead_children);
586 write_unlock_irq(&tasklist_lock);
588 BUG_ON(!list_empty(&father->children));
590 list_for_each_entry_safe(p, n, &dead_children, sibling) {
591 list_del_init(&p->sibling);
592 release_task(p);
597 * Send signals to all our closest relatives so that they know
598 * to properly mourn us..
600 static void exit_notify(struct task_struct *tsk, int group_dead)
602 bool autoreap;
605 * This does two things:
607 * A. Make init inherit all the child processes
608 * B. Check to see if any process groups have become orphaned
609 * as a result of our exiting, and if they have any stopped
610 * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
612 forget_original_parent(tsk);
614 write_lock_irq(&tasklist_lock);
615 if (group_dead)
616 kill_orphaned_pgrp(tsk->group_leader, NULL);
618 if (unlikely(tsk->ptrace)) {
619 int sig = thread_group_leader(tsk) &&
620 thread_group_empty(tsk) &&
621 !ptrace_reparented(tsk) ?
622 tsk->exit_signal : SIGCHLD;
623 autoreap = do_notify_parent(tsk, sig);
624 } else if (thread_group_leader(tsk)) {
625 autoreap = thread_group_empty(tsk) &&
626 do_notify_parent(tsk, tsk->exit_signal);
627 } else {
628 autoreap = true;
631 tsk->exit_state = autoreap ? EXIT_DEAD : EXIT_ZOMBIE;
633 /* mt-exec, de_thread() is waiting for group leader */
634 if (unlikely(tsk->signal->notify_count < 0))
635 wake_up_process(tsk->signal->group_exit_task);
636 write_unlock_irq(&tasklist_lock);
638 /* If the process is dead, release it - nobody will wait for it */
639 if (autoreap)
640 release_task(tsk);
643 #ifdef CONFIG_DEBUG_STACK_USAGE
644 static void check_stack_usage(void)
646 static DEFINE_SPINLOCK(low_water_lock);
647 static int lowest_to_date = THREAD_SIZE;
648 unsigned long free;
650 free = stack_not_used(current);
652 if (free >= lowest_to_date)
653 return;
655 spin_lock(&low_water_lock);
656 if (free < lowest_to_date) {
657 pr_warn("%s (%d) used greatest stack depth: %lu bytes left\n",
658 current->comm, task_pid_nr(current), free);
659 lowest_to_date = free;
661 spin_unlock(&low_water_lock);
663 #else
664 static inline void check_stack_usage(void) {}
665 #endif
667 void do_exit(long code)
669 struct task_struct *tsk = current;
670 int group_dead;
671 TASKS_RCU(int tasks_rcu_i);
673 profile_task_exit(tsk);
675 WARN_ON(blk_needs_flush_plug(tsk));
677 if (unlikely(in_interrupt()))
678 panic("Aiee, killing interrupt handler!");
679 if (unlikely(!tsk->pid))
680 panic("Attempted to kill the idle task!");
683 * If do_exit is called because this processes oopsed, it's possible
684 * that get_fs() was left as KERNEL_DS, so reset it to USER_DS before
685 * continuing. Amongst other possible reasons, this is to prevent
686 * mm_release()->clear_child_tid() from writing to a user-controlled
687 * kernel address.
689 set_fs(USER_DS);
691 ptrace_event(PTRACE_EVENT_EXIT, code);
693 validate_creds_for_do_exit(tsk);
696 * We're taking recursive faults here in do_exit. Safest is to just
697 * leave this task alone and wait for reboot.
699 if (unlikely(tsk->flags & PF_EXITING)) {
700 pr_alert("Fixing recursive fault but reboot is needed!\n");
702 * We can do this unlocked here. The futex code uses
703 * this flag just to verify whether the pi state
704 * cleanup has been done or not. In the worst case it
705 * loops once more. We pretend that the cleanup was
706 * done as there is no way to return. Either the
707 * OWNER_DIED bit is set by now or we push the blocked
708 * task into the wait for ever nirwana as well.
710 tsk->flags |= PF_EXITPIDONE;
711 set_current_state(TASK_UNINTERRUPTIBLE);
712 schedule();
715 exit_signals(tsk); /* sets PF_EXITING */
717 * tsk->flags are checked in the futex code to protect against
718 * an exiting task cleaning up the robust pi futexes.
720 smp_mb();
721 raw_spin_unlock_wait(&tsk->pi_lock);
723 if (unlikely(in_atomic()))
724 pr_info("note: %s[%d] exited with preempt_count %d\n",
725 current->comm, task_pid_nr(current),
726 preempt_count());
728 acct_update_integrals(tsk);
729 /* sync mm's RSS info before statistics gathering */
730 if (tsk->mm)
731 sync_mm_rss(tsk->mm);
732 group_dead = atomic_dec_and_test(&tsk->signal->live);
733 if (group_dead) {
734 hrtimer_cancel(&tsk->signal->real_timer);
735 exit_itimers(tsk->signal);
736 if (tsk->mm)
737 setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm);
739 acct_collect(code, group_dead);
740 if (group_dead)
741 tty_audit_exit();
742 audit_free(tsk);
744 tsk->exit_code = code;
745 taskstats_exit(tsk, group_dead);
747 exit_mm(tsk);
749 if (group_dead)
750 acct_process();
751 trace_sched_process_exit(tsk);
753 exit_sem(tsk);
754 exit_shm(tsk);
755 exit_files(tsk);
756 exit_fs(tsk);
757 if (group_dead)
758 disassociate_ctty(1);
759 exit_task_namespaces(tsk);
760 exit_task_work(tsk);
761 exit_thread();
764 * Flush inherited counters to the parent - before the parent
765 * gets woken up by child-exit notifications.
767 * because of cgroup mode, must be called before cgroup_exit()
769 perf_event_exit_task(tsk);
771 cgroup_exit(tsk);
773 module_put(task_thread_info(tsk)->exec_domain->module);
776 * FIXME: do that only when needed, using sched_exit tracepoint
778 flush_ptrace_hw_breakpoint(tsk);
780 TASKS_RCU(tasks_rcu_i = __srcu_read_lock(&tasks_rcu_exit_srcu));
781 exit_notify(tsk, group_dead);
782 proc_exit_connector(tsk);
783 #ifdef CONFIG_NUMA
784 task_lock(tsk);
785 mpol_put(tsk->mempolicy);
786 tsk->mempolicy = NULL;
787 task_unlock(tsk);
788 #endif
789 #ifdef CONFIG_FUTEX
790 if (unlikely(current->pi_state_cache))
791 kfree(current->pi_state_cache);
792 #endif
794 * Make sure we are holding no locks:
796 debug_check_no_locks_held();
798 * We can do this unlocked here. The futex code uses this flag
799 * just to verify whether the pi state cleanup has been done
800 * or not. In the worst case it loops once more.
802 tsk->flags |= PF_EXITPIDONE;
804 if (tsk->io_context)
805 exit_io_context(tsk);
807 if (tsk->splice_pipe)
808 free_pipe_info(tsk->splice_pipe);
810 if (tsk->task_frag.page)
811 put_page(tsk->task_frag.page);
813 validate_creds_for_do_exit(tsk);
815 check_stack_usage();
816 preempt_disable();
817 if (tsk->nr_dirtied)
818 __this_cpu_add(dirty_throttle_leaks, tsk->nr_dirtied);
819 exit_rcu();
820 TASKS_RCU(__srcu_read_unlock(&tasks_rcu_exit_srcu, tasks_rcu_i));
823 * The setting of TASK_RUNNING by try_to_wake_up() may be delayed
824 * when the following two conditions become true.
825 * - There is race condition of mmap_sem (It is acquired by
826 * exit_mm()), and
827 * - SMI occurs before setting TASK_RUNINNG.
828 * (or hypervisor of virtual machine switches to other guest)
829 * As a result, we may become TASK_RUNNING after becoming TASK_DEAD
831 * To avoid it, we have to wait for releasing tsk->pi_lock which
832 * is held by try_to_wake_up()
834 smp_mb();
835 raw_spin_unlock_wait(&tsk->pi_lock);
837 /* causes final put_task_struct in finish_task_switch(). */
838 tsk->state = TASK_DEAD;
839 tsk->flags |= PF_NOFREEZE; /* tell freezer to ignore us */
840 schedule();
841 BUG();
842 /* Avoid "noreturn function does return". */
843 for (;;)
844 cpu_relax(); /* For when BUG is null */
846 EXPORT_SYMBOL_GPL(do_exit);
848 void complete_and_exit(struct completion *comp, long code)
850 if (comp)
851 complete(comp);
853 do_exit(code);
855 EXPORT_SYMBOL(complete_and_exit);
857 SYSCALL_DEFINE1(exit, int, error_code)
859 do_exit((error_code&0xff)<<8);
863 * Take down every thread in the group. This is called by fatal signals
864 * as well as by sys_exit_group (below).
866 void
867 do_group_exit(int exit_code)
869 struct signal_struct *sig = current->signal;
871 BUG_ON(exit_code & 0x80); /* core dumps don't get here */
873 if (signal_group_exit(sig))
874 exit_code = sig->group_exit_code;
875 else if (!thread_group_empty(current)) {
876 struct sighand_struct *const sighand = current->sighand;
878 spin_lock_irq(&sighand->siglock);
879 if (signal_group_exit(sig))
880 /* Another thread got here before we took the lock. */
881 exit_code = sig->group_exit_code;
882 else {
883 sig->group_exit_code = exit_code;
884 sig->flags = SIGNAL_GROUP_EXIT;
885 zap_other_threads(current);
887 spin_unlock_irq(&sighand->siglock);
890 do_exit(exit_code);
891 /* NOTREACHED */
895 * this kills every thread in the thread group. Note that any externally
896 * wait4()-ing process will get the correct exit code - even if this
897 * thread is not the thread group leader.
899 SYSCALL_DEFINE1(exit_group, int, error_code)
901 do_group_exit((error_code & 0xff) << 8);
902 /* NOTREACHED */
903 return 0;
906 struct wait_opts {
907 enum pid_type wo_type;
908 int wo_flags;
909 struct pid *wo_pid;
911 struct siginfo __user *wo_info;
912 int __user *wo_stat;
913 struct rusage __user *wo_rusage;
915 wait_queue_t child_wait;
916 int notask_error;
919 static inline
920 struct pid *task_pid_type(struct task_struct *task, enum pid_type type)
922 if (type != PIDTYPE_PID)
923 task = task->group_leader;
924 return task->pids[type].pid;
927 static int eligible_pid(struct wait_opts *wo, struct task_struct *p)
929 return wo->wo_type == PIDTYPE_MAX ||
930 task_pid_type(p, wo->wo_type) == wo->wo_pid;
933 static int
934 eligible_child(struct wait_opts *wo, bool ptrace, struct task_struct *p)
936 if (!eligible_pid(wo, p))
937 return 0;
940 * Wait for all children (clone and not) if __WALL is set or
941 * if it is traced by us.
943 if (ptrace || (wo->wo_flags & __WALL))
944 return 1;
947 * Otherwise, wait for clone children *only* if __WCLONE is set;
948 * otherwise, wait for non-clone children *only*.
950 * Note: a "clone" child here is one that reports to its parent
951 * using a signal other than SIGCHLD, or a non-leader thread which
952 * we can only see if it is traced by us.
954 if ((p->exit_signal != SIGCHLD) ^ !!(wo->wo_flags & __WCLONE))
955 return 0;
957 return 1;
960 static int wait_noreap_copyout(struct wait_opts *wo, struct task_struct *p,
961 pid_t pid, uid_t uid, int why, int status)
963 struct siginfo __user *infop;
964 int retval = wo->wo_rusage
965 ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
967 put_task_struct(p);
968 infop = wo->wo_info;
969 if (infop) {
970 if (!retval)
971 retval = put_user(SIGCHLD, &infop->si_signo);
972 if (!retval)
973 retval = put_user(0, &infop->si_errno);
974 if (!retval)
975 retval = put_user((short)why, &infop->si_code);
976 if (!retval)
977 retval = put_user(pid, &infop->si_pid);
978 if (!retval)
979 retval = put_user(uid, &infop->si_uid);
980 if (!retval)
981 retval = put_user(status, &infop->si_status);
983 if (!retval)
984 retval = pid;
985 return retval;
989 * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
990 * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
991 * the lock and this task is uninteresting. If we return nonzero, we have
992 * released the lock and the system call should return.
994 static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p)
996 unsigned long state;
997 int retval, status, traced;
998 pid_t pid = task_pid_vnr(p);
999 uid_t uid = from_kuid_munged(current_user_ns(), task_uid(p));
1000 struct siginfo __user *infop;
1002 if (!likely(wo->wo_flags & WEXITED))
1003 return 0;
1005 if (unlikely(wo->wo_flags & WNOWAIT)) {
1006 int exit_code = p->exit_code;
1007 int why;
1009 get_task_struct(p);
1010 read_unlock(&tasklist_lock);
1011 if ((exit_code & 0x7f) == 0) {
1012 why = CLD_EXITED;
1013 status = exit_code >> 8;
1014 } else {
1015 why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
1016 status = exit_code & 0x7f;
1018 return wait_noreap_copyout(wo, p, pid, uid, why, status);
1021 traced = ptrace_reparented(p);
1023 * Move the task's state to DEAD/TRACE, only one thread can do this.
1025 state = traced && thread_group_leader(p) ? EXIT_TRACE : EXIT_DEAD;
1026 if (cmpxchg(&p->exit_state, EXIT_ZOMBIE, state) != EXIT_ZOMBIE)
1027 return 0;
1029 * It can be ptraced but not reparented, check
1030 * thread_group_leader() to filter out sub-threads.
1032 if (likely(!traced) && thread_group_leader(p)) {
1033 struct signal_struct *psig;
1034 struct signal_struct *sig;
1035 unsigned long maxrss;
1036 cputime_t tgutime, tgstime;
1039 * The resource counters for the group leader are in its
1040 * own task_struct. Those for dead threads in the group
1041 * are in its signal_struct, as are those for the child
1042 * processes it has previously reaped. All these
1043 * accumulate in the parent's signal_struct c* fields.
1045 * We don't bother to take a lock here to protect these
1046 * p->signal fields, because they are only touched by
1047 * __exit_signal, which runs with tasklist_lock
1048 * write-locked anyway, and so is excluded here. We do
1049 * need to protect the access to parent->signal fields,
1050 * as other threads in the parent group can be right
1051 * here reaping other children at the same time.
1053 * We use thread_group_cputime_adjusted() to get times for
1054 * the thread group, which consolidates times for all threads
1055 * in the group including the group leader.
1057 thread_group_cputime_adjusted(p, &tgutime, &tgstime);
1058 spin_lock_irq(&p->real_parent->sighand->siglock);
1059 psig = p->real_parent->signal;
1060 sig = p->signal;
1061 write_seqlock(&psig->stats_lock);
1062 psig->cutime += tgutime + sig->cutime;
1063 psig->cstime += tgstime + sig->cstime;
1064 psig->cgtime += task_gtime(p) + sig->gtime + sig->cgtime;
1065 psig->cmin_flt +=
1066 p->min_flt + sig->min_flt + sig->cmin_flt;
1067 psig->cmaj_flt +=
1068 p->maj_flt + sig->maj_flt + sig->cmaj_flt;
1069 psig->cnvcsw +=
1070 p->nvcsw + sig->nvcsw + sig->cnvcsw;
1071 psig->cnivcsw +=
1072 p->nivcsw + sig->nivcsw + sig->cnivcsw;
1073 psig->cinblock +=
1074 task_io_get_inblock(p) +
1075 sig->inblock + sig->cinblock;
1076 psig->coublock +=
1077 task_io_get_oublock(p) +
1078 sig->oublock + sig->coublock;
1079 maxrss = max(sig->maxrss, sig->cmaxrss);
1080 if (psig->cmaxrss < maxrss)
1081 psig->cmaxrss = maxrss;
1082 task_io_accounting_add(&psig->ioac, &p->ioac);
1083 task_io_accounting_add(&psig->ioac, &sig->ioac);
1084 write_sequnlock(&psig->stats_lock);
1085 spin_unlock_irq(&p->real_parent->sighand->siglock);
1089 * Now we are sure this task is interesting, and no other
1090 * thread can reap it because we its state == DEAD/TRACE.
1092 read_unlock(&tasklist_lock);
1094 retval = wo->wo_rusage
1095 ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
1096 status = (p->signal->flags & SIGNAL_GROUP_EXIT)
1097 ? p->signal->group_exit_code : p->exit_code;
1098 if (!retval && wo->wo_stat)
1099 retval = put_user(status, wo->wo_stat);
1101 infop = wo->wo_info;
1102 if (!retval && infop)
1103 retval = put_user(SIGCHLD, &infop->si_signo);
1104 if (!retval && infop)
1105 retval = put_user(0, &infop->si_errno);
1106 if (!retval && infop) {
1107 int why;
1109 if ((status & 0x7f) == 0) {
1110 why = CLD_EXITED;
1111 status >>= 8;
1112 } else {
1113 why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
1114 status &= 0x7f;
1116 retval = put_user((short)why, &infop->si_code);
1117 if (!retval)
1118 retval = put_user(status, &infop->si_status);
1120 if (!retval && infop)
1121 retval = put_user(pid, &infop->si_pid);
1122 if (!retval && infop)
1123 retval = put_user(uid, &infop->si_uid);
1124 if (!retval)
1125 retval = pid;
1127 if (state == EXIT_TRACE) {
1128 write_lock_irq(&tasklist_lock);
1129 /* We dropped tasklist, ptracer could die and untrace */
1130 ptrace_unlink(p);
1132 /* If parent wants a zombie, don't release it now */
1133 state = EXIT_ZOMBIE;
1134 if (do_notify_parent(p, p->exit_signal))
1135 state = EXIT_DEAD;
1136 p->exit_state = state;
1137 write_unlock_irq(&tasklist_lock);
1139 if (state == EXIT_DEAD)
1140 release_task(p);
1142 return retval;
1145 static int *task_stopped_code(struct task_struct *p, bool ptrace)
1147 if (ptrace) {
1148 if (task_is_stopped_or_traced(p) &&
1149 !(p->jobctl & JOBCTL_LISTENING))
1150 return &p->exit_code;
1151 } else {
1152 if (p->signal->flags & SIGNAL_STOP_STOPPED)
1153 return &p->signal->group_exit_code;
1155 return NULL;
1159 * wait_task_stopped - Wait for %TASK_STOPPED or %TASK_TRACED
1160 * @wo: wait options
1161 * @ptrace: is the wait for ptrace
1162 * @p: task to wait for
1164 * Handle sys_wait4() work for %p in state %TASK_STOPPED or %TASK_TRACED.
1166 * CONTEXT:
1167 * read_lock(&tasklist_lock), which is released if return value is
1168 * non-zero. Also, grabs and releases @p->sighand->siglock.
1170 * RETURNS:
1171 * 0 if wait condition didn't exist and search for other wait conditions
1172 * should continue. Non-zero return, -errno on failure and @p's pid on
1173 * success, implies that tasklist_lock is released and wait condition
1174 * search should terminate.
1176 static int wait_task_stopped(struct wait_opts *wo,
1177 int ptrace, struct task_struct *p)
1179 struct siginfo __user *infop;
1180 int retval, exit_code, *p_code, why;
1181 uid_t uid = 0; /* unneeded, required by compiler */
1182 pid_t pid;
1185 * Traditionally we see ptrace'd stopped tasks regardless of options.
1187 if (!ptrace && !(wo->wo_flags & WUNTRACED))
1188 return 0;
1190 if (!task_stopped_code(p, ptrace))
1191 return 0;
1193 exit_code = 0;
1194 spin_lock_irq(&p->sighand->siglock);
1196 p_code = task_stopped_code(p, ptrace);
1197 if (unlikely(!p_code))
1198 goto unlock_sig;
1200 exit_code = *p_code;
1201 if (!exit_code)
1202 goto unlock_sig;
1204 if (!unlikely(wo->wo_flags & WNOWAIT))
1205 *p_code = 0;
1207 uid = from_kuid_munged(current_user_ns(), task_uid(p));
1208 unlock_sig:
1209 spin_unlock_irq(&p->sighand->siglock);
1210 if (!exit_code)
1211 return 0;
1214 * Now we are pretty sure this task is interesting.
1215 * Make sure it doesn't get reaped out from under us while we
1216 * give up the lock and then examine it below. We don't want to
1217 * keep holding onto the tasklist_lock while we call getrusage and
1218 * possibly take page faults for user memory.
1220 get_task_struct(p);
1221 pid = task_pid_vnr(p);
1222 why = ptrace ? CLD_TRAPPED : CLD_STOPPED;
1223 read_unlock(&tasklist_lock);
1225 if (unlikely(wo->wo_flags & WNOWAIT))
1226 return wait_noreap_copyout(wo, p, pid, uid, why, exit_code);
1228 retval = wo->wo_rusage
1229 ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
1230 if (!retval && wo->wo_stat)
1231 retval = put_user((exit_code << 8) | 0x7f, wo->wo_stat);
1233 infop = wo->wo_info;
1234 if (!retval && infop)
1235 retval = put_user(SIGCHLD, &infop->si_signo);
1236 if (!retval && infop)
1237 retval = put_user(0, &infop->si_errno);
1238 if (!retval && infop)
1239 retval = put_user((short)why, &infop->si_code);
1240 if (!retval && infop)
1241 retval = put_user(exit_code, &infop->si_status);
1242 if (!retval && infop)
1243 retval = put_user(pid, &infop->si_pid);
1244 if (!retval && infop)
1245 retval = put_user(uid, &infop->si_uid);
1246 if (!retval)
1247 retval = pid;
1248 put_task_struct(p);
1250 BUG_ON(!retval);
1251 return retval;
1255 * Handle do_wait work for one task in a live, non-stopped state.
1256 * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
1257 * the lock and this task is uninteresting. If we return nonzero, we have
1258 * released the lock and the system call should return.
1260 static int wait_task_continued(struct wait_opts *wo, struct task_struct *p)
1262 int retval;
1263 pid_t pid;
1264 uid_t uid;
1266 if (!unlikely(wo->wo_flags & WCONTINUED))
1267 return 0;
1269 if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
1270 return 0;
1272 spin_lock_irq(&p->sighand->siglock);
1273 /* Re-check with the lock held. */
1274 if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
1275 spin_unlock_irq(&p->sighand->siglock);
1276 return 0;
1278 if (!unlikely(wo->wo_flags & WNOWAIT))
1279 p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
1280 uid = from_kuid_munged(current_user_ns(), task_uid(p));
1281 spin_unlock_irq(&p->sighand->siglock);
1283 pid = task_pid_vnr(p);
1284 get_task_struct(p);
1285 read_unlock(&tasklist_lock);
1287 if (!wo->wo_info) {
1288 retval = wo->wo_rusage
1289 ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
1290 put_task_struct(p);
1291 if (!retval && wo->wo_stat)
1292 retval = put_user(0xffff, wo->wo_stat);
1293 if (!retval)
1294 retval = pid;
1295 } else {
1296 retval = wait_noreap_copyout(wo, p, pid, uid,
1297 CLD_CONTINUED, SIGCONT);
1298 BUG_ON(retval == 0);
1301 return retval;
1305 * Consider @p for a wait by @parent.
1307 * -ECHILD should be in ->notask_error before the first call.
1308 * Returns nonzero for a final return, when we have unlocked tasklist_lock.
1309 * Returns zero if the search for a child should continue;
1310 * then ->notask_error is 0 if @p is an eligible child,
1311 * or another error from security_task_wait(), or still -ECHILD.
1313 static int wait_consider_task(struct wait_opts *wo, int ptrace,
1314 struct task_struct *p)
1317 * We can race with wait_task_zombie() from another thread.
1318 * Ensure that EXIT_ZOMBIE -> EXIT_DEAD/EXIT_TRACE transition
1319 * can't confuse the checks below.
1321 int exit_state = ACCESS_ONCE(p->exit_state);
1322 int ret;
1324 if (unlikely(exit_state == EXIT_DEAD))
1325 return 0;
1327 ret = eligible_child(wo, ptrace, p);
1328 if (!ret)
1329 return ret;
1331 ret = security_task_wait(p);
1332 if (unlikely(ret < 0)) {
1334 * If we have not yet seen any eligible child,
1335 * then let this error code replace -ECHILD.
1336 * A permission error will give the user a clue
1337 * to look for security policy problems, rather
1338 * than for mysterious wait bugs.
1340 if (wo->notask_error)
1341 wo->notask_error = ret;
1342 return 0;
1345 if (unlikely(exit_state == EXIT_TRACE)) {
1347 * ptrace == 0 means we are the natural parent. In this case
1348 * we should clear notask_error, debugger will notify us.
1350 if (likely(!ptrace))
1351 wo->notask_error = 0;
1352 return 0;
1355 if (likely(!ptrace) && unlikely(p->ptrace)) {
1357 * If it is traced by its real parent's group, just pretend
1358 * the caller is ptrace_do_wait() and reap this child if it
1359 * is zombie.
1361 * This also hides group stop state from real parent; otherwise
1362 * a single stop can be reported twice as group and ptrace stop.
1363 * If a ptracer wants to distinguish these two events for its
1364 * own children it should create a separate process which takes
1365 * the role of real parent.
1367 if (!ptrace_reparented(p))
1368 ptrace = 1;
1371 /* slay zombie? */
1372 if (exit_state == EXIT_ZOMBIE) {
1373 /* we don't reap group leaders with subthreads */
1374 if (!delay_group_leader(p)) {
1376 * A zombie ptracee is only visible to its ptracer.
1377 * Notification and reaping will be cascaded to the
1378 * real parent when the ptracer detaches.
1380 if (unlikely(ptrace) || likely(!p->ptrace))
1381 return wait_task_zombie(wo, p);
1385 * Allow access to stopped/continued state via zombie by
1386 * falling through. Clearing of notask_error is complex.
1388 * When !@ptrace:
1390 * If WEXITED is set, notask_error should naturally be
1391 * cleared. If not, subset of WSTOPPED|WCONTINUED is set,
1392 * so, if there are live subthreads, there are events to
1393 * wait for. If all subthreads are dead, it's still safe
1394 * to clear - this function will be called again in finite
1395 * amount time once all the subthreads are released and
1396 * will then return without clearing.
1398 * When @ptrace:
1400 * Stopped state is per-task and thus can't change once the
1401 * target task dies. Only continued and exited can happen.
1402 * Clear notask_error if WCONTINUED | WEXITED.
1404 if (likely(!ptrace) || (wo->wo_flags & (WCONTINUED | WEXITED)))
1405 wo->notask_error = 0;
1406 } else {
1408 * @p is alive and it's gonna stop, continue or exit, so
1409 * there always is something to wait for.
1411 wo->notask_error = 0;
1415 * Wait for stopped. Depending on @ptrace, different stopped state
1416 * is used and the two don't interact with each other.
1418 ret = wait_task_stopped(wo, ptrace, p);
1419 if (ret)
1420 return ret;
1423 * Wait for continued. There's only one continued state and the
1424 * ptracer can consume it which can confuse the real parent. Don't
1425 * use WCONTINUED from ptracer. You don't need or want it.
1427 return wait_task_continued(wo, p);
1431 * Do the work of do_wait() for one thread in the group, @tsk.
1433 * -ECHILD should be in ->notask_error before the first call.
1434 * Returns nonzero for a final return, when we have unlocked tasklist_lock.
1435 * Returns zero if the search for a child should continue; then
1436 * ->notask_error is 0 if there were any eligible children,
1437 * or another error from security_task_wait(), or still -ECHILD.
1439 static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk)
1441 struct task_struct *p;
1443 list_for_each_entry(p, &tsk->children, sibling) {
1444 int ret = wait_consider_task(wo, 0, p);
1446 if (ret)
1447 return ret;
1450 return 0;
1453 static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk)
1455 struct task_struct *p;
1457 list_for_each_entry(p, &tsk->ptraced, ptrace_entry) {
1458 int ret = wait_consider_task(wo, 1, p);
1460 if (ret)
1461 return ret;
1464 return 0;
1467 static int child_wait_callback(wait_queue_t *wait, unsigned mode,
1468 int sync, void *key)
1470 struct wait_opts *wo = container_of(wait, struct wait_opts,
1471 child_wait);
1472 struct task_struct *p = key;
1474 if (!eligible_pid(wo, p))
1475 return 0;
1477 if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent)
1478 return 0;
1480 return default_wake_function(wait, mode, sync, key);
1483 void __wake_up_parent(struct task_struct *p, struct task_struct *parent)
1485 __wake_up_sync_key(&parent->signal->wait_chldexit,
1486 TASK_INTERRUPTIBLE, 1, p);
1489 static long do_wait(struct wait_opts *wo)
1491 struct task_struct *tsk;
1492 int retval;
1494 trace_sched_process_wait(wo->wo_pid);
1496 init_waitqueue_func_entry(&wo->child_wait, child_wait_callback);
1497 wo->child_wait.private = current;
1498 add_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
1499 repeat:
1501 * If there is nothing that can match our critiera just get out.
1502 * We will clear ->notask_error to zero if we see any child that
1503 * might later match our criteria, even if we are not able to reap
1504 * it yet.
1506 wo->notask_error = -ECHILD;
1507 if ((wo->wo_type < PIDTYPE_MAX) &&
1508 (!wo->wo_pid || hlist_empty(&wo->wo_pid->tasks[wo->wo_type])))
1509 goto notask;
1511 set_current_state(TASK_INTERRUPTIBLE);
1512 read_lock(&tasklist_lock);
1513 tsk = current;
1514 do {
1515 retval = do_wait_thread(wo, tsk);
1516 if (retval)
1517 goto end;
1519 retval = ptrace_do_wait(wo, tsk);
1520 if (retval)
1521 goto end;
1523 if (wo->wo_flags & __WNOTHREAD)
1524 break;
1525 } while_each_thread(current, tsk);
1526 read_unlock(&tasklist_lock);
1528 notask:
1529 retval = wo->notask_error;
1530 if (!retval && !(wo->wo_flags & WNOHANG)) {
1531 retval = -ERESTARTSYS;
1532 if (!signal_pending(current)) {
1533 schedule();
1534 goto repeat;
1537 end:
1538 __set_current_state(TASK_RUNNING);
1539 remove_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
1540 return retval;
1543 SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *,
1544 infop, int, options, struct rusage __user *, ru)
1546 struct wait_opts wo;
1547 struct pid *pid = NULL;
1548 enum pid_type type;
1549 long ret;
1551 if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
1552 return -EINVAL;
1553 if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
1554 return -EINVAL;
1556 switch (which) {
1557 case P_ALL:
1558 type = PIDTYPE_MAX;
1559 break;
1560 case P_PID:
1561 type = PIDTYPE_PID;
1562 if (upid <= 0)
1563 return -EINVAL;
1564 break;
1565 case P_PGID:
1566 type = PIDTYPE_PGID;
1567 if (upid <= 0)
1568 return -EINVAL;
1569 break;
1570 default:
1571 return -EINVAL;
1574 if (type < PIDTYPE_MAX)
1575 pid = find_get_pid(upid);
1577 wo.wo_type = type;
1578 wo.wo_pid = pid;
1579 wo.wo_flags = options;
1580 wo.wo_info = infop;
1581 wo.wo_stat = NULL;
1582 wo.wo_rusage = ru;
1583 ret = do_wait(&wo);
1585 if (ret > 0) {
1586 ret = 0;
1587 } else if (infop) {
1589 * For a WNOHANG return, clear out all the fields
1590 * we would set so the user can easily tell the
1591 * difference.
1593 if (!ret)
1594 ret = put_user(0, &infop->si_signo);
1595 if (!ret)
1596 ret = put_user(0, &infop->si_errno);
1597 if (!ret)
1598 ret = put_user(0, &infop->si_code);
1599 if (!ret)
1600 ret = put_user(0, &infop->si_pid);
1601 if (!ret)
1602 ret = put_user(0, &infop->si_uid);
1603 if (!ret)
1604 ret = put_user(0, &infop->si_status);
1607 put_pid(pid);
1608 return ret;
1611 SYSCALL_DEFINE4(wait4, pid_t, upid, int __user *, stat_addr,
1612 int, options, struct rusage __user *, ru)
1614 struct wait_opts wo;
1615 struct pid *pid = NULL;
1616 enum pid_type type;
1617 long ret;
1619 if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
1620 __WNOTHREAD|__WCLONE|__WALL))
1621 return -EINVAL;
1623 if (upid == -1)
1624 type = PIDTYPE_MAX;
1625 else if (upid < 0) {
1626 type = PIDTYPE_PGID;
1627 pid = find_get_pid(-upid);
1628 } else if (upid == 0) {
1629 type = PIDTYPE_PGID;
1630 pid = get_task_pid(current, PIDTYPE_PGID);
1631 } else /* upid > 0 */ {
1632 type = PIDTYPE_PID;
1633 pid = find_get_pid(upid);
1636 wo.wo_type = type;
1637 wo.wo_pid = pid;
1638 wo.wo_flags = options | WEXITED;
1639 wo.wo_info = NULL;
1640 wo.wo_stat = stat_addr;
1641 wo.wo_rusage = ru;
1642 ret = do_wait(&wo);
1643 put_pid(pid);
1645 return ret;
1648 #ifdef __ARCH_WANT_SYS_WAITPID
1651 * sys_waitpid() remains for compatibility. waitpid() should be
1652 * implemented by calling sys_wait4() from libc.a.
1654 SYSCALL_DEFINE3(waitpid, pid_t, pid, int __user *, stat_addr, int, options)
1656 return sys_wait4(pid, stat_addr, options, NULL);
1659 #endif