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