exit.c 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560
  1. /*
  2. * linux/kernel/exit.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/config.h>
  7. #include <linux/mm.h>
  8. #include <linux/slab.h>
  9. #include <linux/interrupt.h>
  10. #include <linux/smp_lock.h>
  11. #include <linux/module.h>
  12. #include <linux/completion.h>
  13. #include <linux/personality.h>
  14. #include <linux/tty.h>
  15. #include <linux/namespace.h>
  16. #include <linux/key.h>
  17. #include <linux/security.h>
  18. #include <linux/cpu.h>
  19. #include <linux/acct.h>
  20. #include <linux/file.h>
  21. #include <linux/binfmts.h>
  22. #include <linux/ptrace.h>
  23. #include <linux/profile.h>
  24. #include <linux/mount.h>
  25. #include <linux/proc_fs.h>
  26. #include <linux/mempolicy.h>
  27. #include <linux/cpuset.h>
  28. #include <linux/syscalls.h>
  29. #include <linux/signal.h>
  30. #include <asm/uaccess.h>
  31. #include <asm/unistd.h>
  32. #include <asm/pgtable.h>
  33. #include <asm/mmu_context.h>
  34. extern void sem_exit (void);
  35. extern struct task_struct *child_reaper;
  36. int getrusage(struct task_struct *, int, struct rusage __user *);
  37. static void exit_mm(struct task_struct * tsk);
  38. static void __unhash_process(struct task_struct *p)
  39. {
  40. nr_threads--;
  41. detach_pid(p, PIDTYPE_PID);
  42. detach_pid(p, PIDTYPE_TGID);
  43. if (thread_group_leader(p)) {
  44. detach_pid(p, PIDTYPE_PGID);
  45. detach_pid(p, PIDTYPE_SID);
  46. if (p->pid)
  47. __get_cpu_var(process_counts)--;
  48. }
  49. REMOVE_LINKS(p);
  50. }
  51. void release_task(struct task_struct * p)
  52. {
  53. int zap_leader;
  54. task_t *leader;
  55. struct dentry *proc_dentry;
  56. repeat:
  57. atomic_dec(&p->user->processes);
  58. spin_lock(&p->proc_lock);
  59. proc_dentry = proc_pid_unhash(p);
  60. write_lock_irq(&tasklist_lock);
  61. if (unlikely(p->ptrace))
  62. __ptrace_unlink(p);
  63. BUG_ON(!list_empty(&p->ptrace_list) || !list_empty(&p->ptrace_children));
  64. __exit_signal(p);
  65. __exit_sighand(p);
  66. /*
  67. * Note that the fastpath in sys_times depends on __exit_signal having
  68. * updated the counters before a task is removed from the tasklist of
  69. * the process by __unhash_process.
  70. */
  71. __unhash_process(p);
  72. /*
  73. * If we are the last non-leader member of the thread
  74. * group, and the leader is zombie, then notify the
  75. * group leader's parent process. (if it wants notification.)
  76. */
  77. zap_leader = 0;
  78. leader = p->group_leader;
  79. if (leader != p && thread_group_empty(leader) && leader->exit_state == EXIT_ZOMBIE) {
  80. BUG_ON(leader->exit_signal == -1);
  81. do_notify_parent(leader, leader->exit_signal);
  82. /*
  83. * If we were the last child thread and the leader has
  84. * exited already, and the leader's parent ignores SIGCHLD,
  85. * then we are the one who should release the leader.
  86. *
  87. * do_notify_parent() will have marked it self-reaping in
  88. * that case.
  89. */
  90. zap_leader = (leader->exit_signal == -1);
  91. }
  92. sched_exit(p);
  93. write_unlock_irq(&tasklist_lock);
  94. spin_unlock(&p->proc_lock);
  95. proc_pid_flush(proc_dentry);
  96. release_thread(p);
  97. put_task_struct(p);
  98. p = leader;
  99. if (unlikely(zap_leader))
  100. goto repeat;
  101. }
  102. /* we are using it only for SMP init */
  103. void unhash_process(struct task_struct *p)
  104. {
  105. struct dentry *proc_dentry;
  106. spin_lock(&p->proc_lock);
  107. proc_dentry = proc_pid_unhash(p);
  108. write_lock_irq(&tasklist_lock);
  109. __unhash_process(p);
  110. write_unlock_irq(&tasklist_lock);
  111. spin_unlock(&p->proc_lock);
  112. proc_pid_flush(proc_dentry);
  113. }
  114. /*
  115. * This checks not only the pgrp, but falls back on the pid if no
  116. * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
  117. * without this...
  118. */
  119. int session_of_pgrp(int pgrp)
  120. {
  121. struct task_struct *p;
  122. int sid = -1;
  123. read_lock(&tasklist_lock);
  124. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  125. if (p->signal->session > 0) {
  126. sid = p->signal->session;
  127. goto out;
  128. }
  129. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  130. p = find_task_by_pid(pgrp);
  131. if (p)
  132. sid = p->signal->session;
  133. out:
  134. read_unlock(&tasklist_lock);
  135. return sid;
  136. }
  137. /*
  138. * Determine if a process group is "orphaned", according to the POSIX
  139. * definition in 2.2.2.52. Orphaned process groups are not to be affected
  140. * by terminal-generated stop signals. Newly orphaned process groups are
  141. * to receive a SIGHUP and a SIGCONT.
  142. *
  143. * "I ask you, have you ever known what it is to be an orphan?"
  144. */
  145. static int will_become_orphaned_pgrp(int pgrp, task_t *ignored_task)
  146. {
  147. struct task_struct *p;
  148. int ret = 1;
  149. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  150. if (p == ignored_task
  151. || p->exit_state
  152. || p->real_parent->pid == 1)
  153. continue;
  154. if (process_group(p->real_parent) != pgrp
  155. && p->real_parent->signal->session == p->signal->session) {
  156. ret = 0;
  157. break;
  158. }
  159. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  160. return ret; /* (sighing) "Often!" */
  161. }
  162. int is_orphaned_pgrp(int pgrp)
  163. {
  164. int retval;
  165. read_lock(&tasklist_lock);
  166. retval = will_become_orphaned_pgrp(pgrp, NULL);
  167. read_unlock(&tasklist_lock);
  168. return retval;
  169. }
  170. static inline int has_stopped_jobs(int pgrp)
  171. {
  172. int retval = 0;
  173. struct task_struct *p;
  174. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  175. if (p->state != TASK_STOPPED)
  176. continue;
  177. /* If p is stopped by a debugger on a signal that won't
  178. stop it, then don't count p as stopped. This isn't
  179. perfect but it's a good approximation. */
  180. if (unlikely (p->ptrace)
  181. && p->exit_code != SIGSTOP
  182. && p->exit_code != SIGTSTP
  183. && p->exit_code != SIGTTOU
  184. && p->exit_code != SIGTTIN)
  185. continue;
  186. retval = 1;
  187. break;
  188. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  189. return retval;
  190. }
  191. /**
  192. * reparent_to_init - Reparent the calling kernel thread to the init task.
  193. *
  194. * If a kernel thread is launched as a result of a system call, or if
  195. * it ever exits, it should generally reparent itself to init so that
  196. * it is correctly cleaned up on exit.
  197. *
  198. * The various task state such as scheduling policy and priority may have
  199. * been inherited from a user process, so we reset them to sane values here.
  200. *
  201. * NOTE that reparent_to_init() gives the caller full capabilities.
  202. */
  203. static inline void reparent_to_init(void)
  204. {
  205. write_lock_irq(&tasklist_lock);
  206. ptrace_unlink(current);
  207. /* Reparent to init */
  208. REMOVE_LINKS(current);
  209. current->parent = child_reaper;
  210. current->real_parent = child_reaper;
  211. SET_LINKS(current);
  212. /* Set the exit signal to SIGCHLD so we signal init on exit */
  213. current->exit_signal = SIGCHLD;
  214. if ((current->policy == SCHED_NORMAL) && (task_nice(current) < 0))
  215. set_user_nice(current, 0);
  216. /* cpus_allowed? */
  217. /* rt_priority? */
  218. /* signals? */
  219. security_task_reparent_to_init(current);
  220. memcpy(current->signal->rlim, init_task.signal->rlim,
  221. sizeof(current->signal->rlim));
  222. atomic_inc(&(INIT_USER->__count));
  223. write_unlock_irq(&tasklist_lock);
  224. switch_uid(INIT_USER);
  225. }
  226. void __set_special_pids(pid_t session, pid_t pgrp)
  227. {
  228. struct task_struct *curr = current;
  229. if (curr->signal->session != session) {
  230. detach_pid(curr, PIDTYPE_SID);
  231. curr->signal->session = session;
  232. attach_pid(curr, PIDTYPE_SID, session);
  233. }
  234. if (process_group(curr) != pgrp) {
  235. detach_pid(curr, PIDTYPE_PGID);
  236. curr->signal->pgrp = pgrp;
  237. attach_pid(curr, PIDTYPE_PGID, pgrp);
  238. }
  239. }
  240. void set_special_pids(pid_t session, pid_t pgrp)
  241. {
  242. write_lock_irq(&tasklist_lock);
  243. __set_special_pids(session, pgrp);
  244. write_unlock_irq(&tasklist_lock);
  245. }
  246. /*
  247. * Let kernel threads use this to say that they
  248. * allow a certain signal (since daemonize() will
  249. * have disabled all of them by default).
  250. */
  251. int allow_signal(int sig)
  252. {
  253. if (!valid_signal(sig) || sig < 1)
  254. return -EINVAL;
  255. spin_lock_irq(&current->sighand->siglock);
  256. sigdelset(&current->blocked, sig);
  257. if (!current->mm) {
  258. /* Kernel threads handle their own signals.
  259. Let the signal code know it'll be handled, so
  260. that they don't get converted to SIGKILL or
  261. just silently dropped */
  262. current->sighand->action[(sig)-1].sa.sa_handler = (void __user *)2;
  263. }
  264. recalc_sigpending();
  265. spin_unlock_irq(&current->sighand->siglock);
  266. return 0;
  267. }
  268. EXPORT_SYMBOL(allow_signal);
  269. int disallow_signal(int sig)
  270. {
  271. if (!valid_signal(sig) || sig < 1)
  272. return -EINVAL;
  273. spin_lock_irq(&current->sighand->siglock);
  274. sigaddset(&current->blocked, sig);
  275. recalc_sigpending();
  276. spin_unlock_irq(&current->sighand->siglock);
  277. return 0;
  278. }
  279. EXPORT_SYMBOL(disallow_signal);
  280. /*
  281. * Put all the gunge required to become a kernel thread without
  282. * attached user resources in one place where it belongs.
  283. */
  284. void daemonize(const char *name, ...)
  285. {
  286. va_list args;
  287. struct fs_struct *fs;
  288. sigset_t blocked;
  289. va_start(args, name);
  290. vsnprintf(current->comm, sizeof(current->comm), name, args);
  291. va_end(args);
  292. /*
  293. * If we were started as result of loading a module, close all of the
  294. * user space pages. We don't need them, and if we didn't close them
  295. * they would be locked into memory.
  296. */
  297. exit_mm(current);
  298. set_special_pids(1, 1);
  299. down(&tty_sem);
  300. current->signal->tty = NULL;
  301. up(&tty_sem);
  302. /* Block and flush all signals */
  303. sigfillset(&blocked);
  304. sigprocmask(SIG_BLOCK, &blocked, NULL);
  305. flush_signals(current);
  306. /* Become as one with the init task */
  307. exit_fs(current); /* current->fs->count--; */
  308. fs = init_task.fs;
  309. current->fs = fs;
  310. atomic_inc(&fs->count);
  311. exit_files(current);
  312. current->files = init_task.files;
  313. atomic_inc(&current->files->count);
  314. reparent_to_init();
  315. }
  316. EXPORT_SYMBOL(daemonize);
  317. static inline void close_files(struct files_struct * files)
  318. {
  319. int i, j;
  320. struct fdtable *fdt;
  321. j = 0;
  322. /*
  323. * It is safe to dereference the fd table without RCU or
  324. * ->file_lock because this is the last reference to the
  325. * files structure.
  326. */
  327. fdt = files_fdtable(files);
  328. for (;;) {
  329. unsigned long set;
  330. i = j * __NFDBITS;
  331. if (i >= fdt->max_fdset || i >= fdt->max_fds)
  332. break;
  333. set = fdt->open_fds->fds_bits[j++];
  334. while (set) {
  335. if (set & 1) {
  336. struct file * file = xchg(&fdt->fd[i], NULL);
  337. if (file)
  338. filp_close(file, files);
  339. }
  340. i++;
  341. set >>= 1;
  342. }
  343. }
  344. }
  345. struct files_struct *get_files_struct(struct task_struct *task)
  346. {
  347. struct files_struct *files;
  348. task_lock(task);
  349. files = task->files;
  350. if (files)
  351. atomic_inc(&files->count);
  352. task_unlock(task);
  353. return files;
  354. }
  355. void fastcall put_files_struct(struct files_struct *files)
  356. {
  357. struct fdtable *fdt;
  358. if (atomic_dec_and_test(&files->count)) {
  359. close_files(files);
  360. /*
  361. * Free the fd and fdset arrays if we expanded them.
  362. * If the fdtable was embedded, pass files for freeing
  363. * at the end of the RCU grace period. Otherwise,
  364. * you can free files immediately.
  365. */
  366. fdt = files_fdtable(files);
  367. if (fdt == &files->fdtab)
  368. fdt->free_files = files;
  369. else
  370. kmem_cache_free(files_cachep, files);
  371. free_fdtable(fdt);
  372. }
  373. }
  374. EXPORT_SYMBOL(put_files_struct);
  375. static inline void __exit_files(struct task_struct *tsk)
  376. {
  377. struct files_struct * files = tsk->files;
  378. if (files) {
  379. task_lock(tsk);
  380. tsk->files = NULL;
  381. task_unlock(tsk);
  382. put_files_struct(files);
  383. }
  384. }
  385. void exit_files(struct task_struct *tsk)
  386. {
  387. __exit_files(tsk);
  388. }
  389. static inline void __put_fs_struct(struct fs_struct *fs)
  390. {
  391. /* No need to hold fs->lock if we are killing it */
  392. if (atomic_dec_and_test(&fs->count)) {
  393. dput(fs->root);
  394. mntput(fs->rootmnt);
  395. dput(fs->pwd);
  396. mntput(fs->pwdmnt);
  397. if (fs->altroot) {
  398. dput(fs->altroot);
  399. mntput(fs->altrootmnt);
  400. }
  401. kmem_cache_free(fs_cachep, fs);
  402. }
  403. }
  404. void put_fs_struct(struct fs_struct *fs)
  405. {
  406. __put_fs_struct(fs);
  407. }
  408. static inline void __exit_fs(struct task_struct *tsk)
  409. {
  410. struct fs_struct * fs = tsk->fs;
  411. if (fs) {
  412. task_lock(tsk);
  413. tsk->fs = NULL;
  414. task_unlock(tsk);
  415. __put_fs_struct(fs);
  416. }
  417. }
  418. void exit_fs(struct task_struct *tsk)
  419. {
  420. __exit_fs(tsk);
  421. }
  422. EXPORT_SYMBOL_GPL(exit_fs);
  423. /*
  424. * Turn us into a lazy TLB process if we
  425. * aren't already..
  426. */
  427. static void exit_mm(struct task_struct * tsk)
  428. {
  429. struct mm_struct *mm = tsk->mm;
  430. mm_release(tsk, mm);
  431. if (!mm)
  432. return;
  433. /*
  434. * Serialize with any possible pending coredump.
  435. * We must hold mmap_sem around checking core_waiters
  436. * and clearing tsk->mm. The core-inducing thread
  437. * will increment core_waiters for each thread in the
  438. * group with ->mm != NULL.
  439. */
  440. down_read(&mm->mmap_sem);
  441. if (mm->core_waiters) {
  442. up_read(&mm->mmap_sem);
  443. down_write(&mm->mmap_sem);
  444. if (!--mm->core_waiters)
  445. complete(mm->core_startup_done);
  446. up_write(&mm->mmap_sem);
  447. wait_for_completion(&mm->core_done);
  448. down_read(&mm->mmap_sem);
  449. }
  450. atomic_inc(&mm->mm_count);
  451. if (mm != tsk->active_mm) BUG();
  452. /* more a memory barrier than a real lock */
  453. task_lock(tsk);
  454. tsk->mm = NULL;
  455. up_read(&mm->mmap_sem);
  456. enter_lazy_tlb(mm, current);
  457. task_unlock(tsk);
  458. mmput(mm);
  459. }
  460. static inline void choose_new_parent(task_t *p, task_t *reaper, task_t *child_reaper)
  461. {
  462. /*
  463. * Make sure we're not reparenting to ourselves and that
  464. * the parent is not a zombie.
  465. */
  466. BUG_ON(p == reaper || reaper->exit_state >= EXIT_ZOMBIE);
  467. p->real_parent = reaper;
  468. }
  469. static inline void reparent_thread(task_t *p, task_t *father, int traced)
  470. {
  471. /* We don't want people slaying init. */
  472. if (p->exit_signal != -1)
  473. p->exit_signal = SIGCHLD;
  474. if (p->pdeath_signal)
  475. /* We already hold the tasklist_lock here. */
  476. group_send_sig_info(p->pdeath_signal, (void *) 0, p);
  477. /* Move the child from its dying parent to the new one. */
  478. if (unlikely(traced)) {
  479. /* Preserve ptrace links if someone else is tracing this child. */
  480. list_del_init(&p->ptrace_list);
  481. if (p->parent != p->real_parent)
  482. list_add(&p->ptrace_list, &p->real_parent->ptrace_children);
  483. } else {
  484. /* If this child is being traced, then we're the one tracing it
  485. * anyway, so let go of it.
  486. */
  487. p->ptrace = 0;
  488. list_del_init(&p->sibling);
  489. p->parent = p->real_parent;
  490. list_add_tail(&p->sibling, &p->parent->children);
  491. /* If we'd notified the old parent about this child's death,
  492. * also notify the new parent.
  493. */
  494. if (p->exit_state == EXIT_ZOMBIE && p->exit_signal != -1 &&
  495. thread_group_empty(p))
  496. do_notify_parent(p, p->exit_signal);
  497. else if (p->state == TASK_TRACED) {
  498. /*
  499. * If it was at a trace stop, turn it into
  500. * a normal stop since it's no longer being
  501. * traced.
  502. */
  503. ptrace_untrace(p);
  504. }
  505. }
  506. /*
  507. * process group orphan check
  508. * Case ii: Our child is in a different pgrp
  509. * than we are, and it was the only connection
  510. * outside, so the child pgrp is now orphaned.
  511. */
  512. if ((process_group(p) != process_group(father)) &&
  513. (p->signal->session == father->signal->session)) {
  514. int pgrp = process_group(p);
  515. if (will_become_orphaned_pgrp(pgrp, NULL) && has_stopped_jobs(pgrp)) {
  516. __kill_pg_info(SIGHUP, (void *)1, pgrp);
  517. __kill_pg_info(SIGCONT, (void *)1, pgrp);
  518. }
  519. }
  520. }
  521. /*
  522. * When we die, we re-parent all our children.
  523. * Try to give them to another thread in our thread
  524. * group, and if no such member exists, give it to
  525. * the global child reaper process (ie "init")
  526. */
  527. static inline void forget_original_parent(struct task_struct * father,
  528. struct list_head *to_release)
  529. {
  530. struct task_struct *p, *reaper = father;
  531. struct list_head *_p, *_n;
  532. do {
  533. reaper = next_thread(reaper);
  534. if (reaper == father) {
  535. reaper = child_reaper;
  536. break;
  537. }
  538. } while (reaper->exit_state);
  539. /*
  540. * There are only two places where our children can be:
  541. *
  542. * - in our child list
  543. * - in our ptraced child list
  544. *
  545. * Search them and reparent children.
  546. */
  547. list_for_each_safe(_p, _n, &father->children) {
  548. int ptrace;
  549. p = list_entry(_p,struct task_struct,sibling);
  550. ptrace = p->ptrace;
  551. /* if father isn't the real parent, then ptrace must be enabled */
  552. BUG_ON(father != p->real_parent && !ptrace);
  553. if (father == p->real_parent) {
  554. /* reparent with a reaper, real father it's us */
  555. choose_new_parent(p, reaper, child_reaper);
  556. reparent_thread(p, father, 0);
  557. } else {
  558. /* reparent ptraced task to its real parent */
  559. __ptrace_unlink (p);
  560. if (p->exit_state == EXIT_ZOMBIE && p->exit_signal != -1 &&
  561. thread_group_empty(p))
  562. do_notify_parent(p, p->exit_signal);
  563. }
  564. /*
  565. * if the ptraced child is a zombie with exit_signal == -1
  566. * we must collect it before we exit, or it will remain
  567. * zombie forever since we prevented it from self-reap itself
  568. * while it was being traced by us, to be able to see it in wait4.
  569. */
  570. if (unlikely(ptrace && p->exit_state == EXIT_ZOMBIE && p->exit_signal == -1))
  571. list_add(&p->ptrace_list, to_release);
  572. }
  573. list_for_each_safe(_p, _n, &father->ptrace_children) {
  574. p = list_entry(_p,struct task_struct,ptrace_list);
  575. choose_new_parent(p, reaper, child_reaper);
  576. reparent_thread(p, father, 1);
  577. }
  578. }
  579. /*
  580. * Send signals to all our closest relatives so that they know
  581. * to properly mourn us..
  582. */
  583. static void exit_notify(struct task_struct *tsk)
  584. {
  585. int state;
  586. struct task_struct *t;
  587. struct list_head ptrace_dead, *_p, *_n;
  588. if (signal_pending(tsk) && !(tsk->signal->flags & SIGNAL_GROUP_EXIT)
  589. && !thread_group_empty(tsk)) {
  590. /*
  591. * This occurs when there was a race between our exit
  592. * syscall and a group signal choosing us as the one to
  593. * wake up. It could be that we are the only thread
  594. * alerted to check for pending signals, but another thread
  595. * should be woken now to take the signal since we will not.
  596. * Now we'll wake all the threads in the group just to make
  597. * sure someone gets all the pending signals.
  598. */
  599. read_lock(&tasklist_lock);
  600. spin_lock_irq(&tsk->sighand->siglock);
  601. for (t = next_thread(tsk); t != tsk; t = next_thread(t))
  602. if (!signal_pending(t) && !(t->flags & PF_EXITING)) {
  603. recalc_sigpending_tsk(t);
  604. if (signal_pending(t))
  605. signal_wake_up(t, 0);
  606. }
  607. spin_unlock_irq(&tsk->sighand->siglock);
  608. read_unlock(&tasklist_lock);
  609. }
  610. write_lock_irq(&tasklist_lock);
  611. /*
  612. * This does two things:
  613. *
  614. * A. Make init inherit all the child processes
  615. * B. Check to see if any process groups have become orphaned
  616. * as a result of our exiting, and if they have any stopped
  617. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  618. */
  619. INIT_LIST_HEAD(&ptrace_dead);
  620. forget_original_parent(tsk, &ptrace_dead);
  621. BUG_ON(!list_empty(&tsk->children));
  622. BUG_ON(!list_empty(&tsk->ptrace_children));
  623. /*
  624. * Check to see if any process groups have become orphaned
  625. * as a result of our exiting, and if they have any stopped
  626. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  627. *
  628. * Case i: Our father is in a different pgrp than we are
  629. * and we were the only connection outside, so our pgrp
  630. * is about to become orphaned.
  631. */
  632. t = tsk->real_parent;
  633. if ((process_group(t) != process_group(tsk)) &&
  634. (t->signal->session == tsk->signal->session) &&
  635. will_become_orphaned_pgrp(process_group(tsk), tsk) &&
  636. has_stopped_jobs(process_group(tsk))) {
  637. __kill_pg_info(SIGHUP, (void *)1, process_group(tsk));
  638. __kill_pg_info(SIGCONT, (void *)1, process_group(tsk));
  639. }
  640. /* Let father know we died
  641. *
  642. * Thread signals are configurable, but you aren't going to use
  643. * that to send signals to arbitary processes.
  644. * That stops right now.
  645. *
  646. * If the parent exec id doesn't match the exec id we saved
  647. * when we started then we know the parent has changed security
  648. * domain.
  649. *
  650. * If our self_exec id doesn't match our parent_exec_id then
  651. * we have changed execution domain as these two values started
  652. * the same after a fork.
  653. *
  654. */
  655. if (tsk->exit_signal != SIGCHLD && tsk->exit_signal != -1 &&
  656. ( tsk->parent_exec_id != t->self_exec_id ||
  657. tsk->self_exec_id != tsk->parent_exec_id)
  658. && !capable(CAP_KILL))
  659. tsk->exit_signal = SIGCHLD;
  660. /* If something other than our normal parent is ptracing us, then
  661. * send it a SIGCHLD instead of honoring exit_signal. exit_signal
  662. * only has special meaning to our real parent.
  663. */
  664. if (tsk->exit_signal != -1 && thread_group_empty(tsk)) {
  665. int signal = tsk->parent == tsk->real_parent ? tsk->exit_signal : SIGCHLD;
  666. do_notify_parent(tsk, signal);
  667. } else if (tsk->ptrace) {
  668. do_notify_parent(tsk, SIGCHLD);
  669. }
  670. state = EXIT_ZOMBIE;
  671. if (tsk->exit_signal == -1 &&
  672. (likely(tsk->ptrace == 0) ||
  673. unlikely(tsk->parent->signal->flags & SIGNAL_GROUP_EXIT)))
  674. state = EXIT_DEAD;
  675. tsk->exit_state = state;
  676. write_unlock_irq(&tasklist_lock);
  677. list_for_each_safe(_p, _n, &ptrace_dead) {
  678. list_del_init(_p);
  679. t = list_entry(_p,struct task_struct,ptrace_list);
  680. release_task(t);
  681. }
  682. /* If the process is dead, release it - nobody will wait for it */
  683. if (state == EXIT_DEAD)
  684. release_task(tsk);
  685. /* PF_DEAD causes final put_task_struct after we schedule. */
  686. preempt_disable();
  687. tsk->flags |= PF_DEAD;
  688. }
  689. fastcall NORET_TYPE void do_exit(long code)
  690. {
  691. struct task_struct *tsk = current;
  692. int group_dead;
  693. profile_task_exit(tsk);
  694. WARN_ON(atomic_read(&tsk->fs_excl));
  695. if (unlikely(in_interrupt()))
  696. panic("Aiee, killing interrupt handler!");
  697. if (unlikely(!tsk->pid))
  698. panic("Attempted to kill the idle task!");
  699. if (unlikely(tsk->pid == 1))
  700. panic("Attempted to kill init!");
  701. if (tsk->io_context)
  702. exit_io_context();
  703. if (unlikely(current->ptrace & PT_TRACE_EXIT)) {
  704. current->ptrace_message = code;
  705. ptrace_notify((PTRACE_EVENT_EXIT << 8) | SIGTRAP);
  706. }
  707. /*
  708. * We're taking recursive faults here in do_exit. Safest is to just
  709. * leave this task alone and wait for reboot.
  710. */
  711. if (unlikely(tsk->flags & PF_EXITING)) {
  712. printk(KERN_ALERT
  713. "Fixing recursive fault but reboot is needed!\n");
  714. set_current_state(TASK_UNINTERRUPTIBLE);
  715. schedule();
  716. }
  717. tsk->flags |= PF_EXITING;
  718. /*
  719. * Make sure we don't try to process any timer firings
  720. * while we are already exiting.
  721. */
  722. tsk->it_virt_expires = cputime_zero;
  723. tsk->it_prof_expires = cputime_zero;
  724. tsk->it_sched_expires = 0;
  725. if (unlikely(in_atomic()))
  726. printk(KERN_INFO "note: %s[%d] exited with preempt_count %d\n",
  727. current->comm, current->pid,
  728. preempt_count());
  729. acct_update_integrals(tsk);
  730. update_mem_hiwater(tsk);
  731. group_dead = atomic_dec_and_test(&tsk->signal->live);
  732. if (group_dead) {
  733. del_timer_sync(&tsk->signal->real_timer);
  734. acct_process(code);
  735. }
  736. exit_mm(tsk);
  737. exit_sem(tsk);
  738. __exit_files(tsk);
  739. __exit_fs(tsk);
  740. exit_namespace(tsk);
  741. exit_thread();
  742. cpuset_exit(tsk);
  743. exit_keys(tsk);
  744. if (group_dead && tsk->signal->leader)
  745. disassociate_ctty(1);
  746. module_put(tsk->thread_info->exec_domain->module);
  747. if (tsk->binfmt)
  748. module_put(tsk->binfmt->module);
  749. tsk->exit_code = code;
  750. exit_notify(tsk);
  751. #ifdef CONFIG_NUMA
  752. mpol_free(tsk->mempolicy);
  753. tsk->mempolicy = NULL;
  754. #endif
  755. BUG_ON(!(current->flags & PF_DEAD));
  756. schedule();
  757. BUG();
  758. /* Avoid "noreturn function does return". */
  759. for (;;) ;
  760. }
  761. EXPORT_SYMBOL_GPL(do_exit);
  762. NORET_TYPE void complete_and_exit(struct completion *comp, long code)
  763. {
  764. if (comp)
  765. complete(comp);
  766. do_exit(code);
  767. }
  768. EXPORT_SYMBOL(complete_and_exit);
  769. asmlinkage long sys_exit(int error_code)
  770. {
  771. do_exit((error_code&0xff)<<8);
  772. }
  773. task_t fastcall *next_thread(const task_t *p)
  774. {
  775. return pid_task(p->pids[PIDTYPE_TGID].pid_list.next, PIDTYPE_TGID);
  776. }
  777. EXPORT_SYMBOL(next_thread);
  778. /*
  779. * Take down every thread in the group. This is called by fatal signals
  780. * as well as by sys_exit_group (below).
  781. */
  782. NORET_TYPE void
  783. do_group_exit(int exit_code)
  784. {
  785. BUG_ON(exit_code & 0x80); /* core dumps don't get here */
  786. if (current->signal->flags & SIGNAL_GROUP_EXIT)
  787. exit_code = current->signal->group_exit_code;
  788. else if (!thread_group_empty(current)) {
  789. struct signal_struct *const sig = current->signal;
  790. struct sighand_struct *const sighand = current->sighand;
  791. read_lock(&tasklist_lock);
  792. spin_lock_irq(&sighand->siglock);
  793. if (sig->flags & SIGNAL_GROUP_EXIT)
  794. /* Another thread got here before we took the lock. */
  795. exit_code = sig->group_exit_code;
  796. else {
  797. sig->flags = SIGNAL_GROUP_EXIT;
  798. sig->group_exit_code = exit_code;
  799. zap_other_threads(current);
  800. }
  801. spin_unlock_irq(&sighand->siglock);
  802. read_unlock(&tasklist_lock);
  803. }
  804. do_exit(exit_code);
  805. /* NOTREACHED */
  806. }
  807. /*
  808. * this kills every thread in the thread group. Note that any externally
  809. * wait4()-ing process will get the correct exit code - even if this
  810. * thread is not the thread group leader.
  811. */
  812. asmlinkage void sys_exit_group(int error_code)
  813. {
  814. do_group_exit((error_code & 0xff) << 8);
  815. }
  816. static int eligible_child(pid_t pid, int options, task_t *p)
  817. {
  818. if (pid > 0) {
  819. if (p->pid != pid)
  820. return 0;
  821. } else if (!pid) {
  822. if (process_group(p) != process_group(current))
  823. return 0;
  824. } else if (pid != -1) {
  825. if (process_group(p) != -pid)
  826. return 0;
  827. }
  828. /*
  829. * Do not consider detached threads that are
  830. * not ptraced:
  831. */
  832. if (p->exit_signal == -1 && !p->ptrace)
  833. return 0;
  834. /* Wait for all children (clone and not) if __WALL is set;
  835. * otherwise, wait for clone children *only* if __WCLONE is
  836. * set; otherwise, wait for non-clone children *only*. (Note:
  837. * A "clone" child here is one that reports to its parent
  838. * using a signal other than SIGCHLD.) */
  839. if (((p->exit_signal != SIGCHLD) ^ ((options & __WCLONE) != 0))
  840. && !(options & __WALL))
  841. return 0;
  842. /*
  843. * Do not consider thread group leaders that are
  844. * in a non-empty thread group:
  845. */
  846. if (current->tgid != p->tgid && delay_group_leader(p))
  847. return 2;
  848. if (security_task_wait(p))
  849. return 0;
  850. return 1;
  851. }
  852. static int wait_noreap_copyout(task_t *p, pid_t pid, uid_t uid,
  853. int why, int status,
  854. struct siginfo __user *infop,
  855. struct rusage __user *rusagep)
  856. {
  857. int retval = rusagep ? getrusage(p, RUSAGE_BOTH, rusagep) : 0;
  858. put_task_struct(p);
  859. if (!retval)
  860. retval = put_user(SIGCHLD, &infop->si_signo);
  861. if (!retval)
  862. retval = put_user(0, &infop->si_errno);
  863. if (!retval)
  864. retval = put_user((short)why, &infop->si_code);
  865. if (!retval)
  866. retval = put_user(pid, &infop->si_pid);
  867. if (!retval)
  868. retval = put_user(uid, &infop->si_uid);
  869. if (!retval)
  870. retval = put_user(status, &infop->si_status);
  871. if (!retval)
  872. retval = pid;
  873. return retval;
  874. }
  875. /*
  876. * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
  877. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  878. * the lock and this task is uninteresting. If we return nonzero, we have
  879. * released the lock and the system call should return.
  880. */
  881. static int wait_task_zombie(task_t *p, int noreap,
  882. struct siginfo __user *infop,
  883. int __user *stat_addr, struct rusage __user *ru)
  884. {
  885. unsigned long state;
  886. int retval;
  887. int status;
  888. if (unlikely(noreap)) {
  889. pid_t pid = p->pid;
  890. uid_t uid = p->uid;
  891. int exit_code = p->exit_code;
  892. int why, status;
  893. if (unlikely(p->exit_state != EXIT_ZOMBIE))
  894. return 0;
  895. if (unlikely(p->exit_signal == -1 && p->ptrace == 0))
  896. return 0;
  897. get_task_struct(p);
  898. read_unlock(&tasklist_lock);
  899. if ((exit_code & 0x7f) == 0) {
  900. why = CLD_EXITED;
  901. status = exit_code >> 8;
  902. } else {
  903. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  904. status = exit_code & 0x7f;
  905. }
  906. return wait_noreap_copyout(p, pid, uid, why,
  907. status, infop, ru);
  908. }
  909. /*
  910. * Try to move the task's state to DEAD
  911. * only one thread is allowed to do this:
  912. */
  913. state = xchg(&p->exit_state, EXIT_DEAD);
  914. if (state != EXIT_ZOMBIE) {
  915. BUG_ON(state != EXIT_DEAD);
  916. return 0;
  917. }
  918. if (unlikely(p->exit_signal == -1 && p->ptrace == 0)) {
  919. /*
  920. * This can only happen in a race with a ptraced thread
  921. * dying on another processor.
  922. */
  923. return 0;
  924. }
  925. if (likely(p->real_parent == p->parent) && likely(p->signal)) {
  926. /*
  927. * The resource counters for the group leader are in its
  928. * own task_struct. Those for dead threads in the group
  929. * are in its signal_struct, as are those for the child
  930. * processes it has previously reaped. All these
  931. * accumulate in the parent's signal_struct c* fields.
  932. *
  933. * We don't bother to take a lock here to protect these
  934. * p->signal fields, because they are only touched by
  935. * __exit_signal, which runs with tasklist_lock
  936. * write-locked anyway, and so is excluded here. We do
  937. * need to protect the access to p->parent->signal fields,
  938. * as other threads in the parent group can be right
  939. * here reaping other children at the same time.
  940. */
  941. spin_lock_irq(&p->parent->sighand->siglock);
  942. p->parent->signal->cutime =
  943. cputime_add(p->parent->signal->cutime,
  944. cputime_add(p->utime,
  945. cputime_add(p->signal->utime,
  946. p->signal->cutime)));
  947. p->parent->signal->cstime =
  948. cputime_add(p->parent->signal->cstime,
  949. cputime_add(p->stime,
  950. cputime_add(p->signal->stime,
  951. p->signal->cstime)));
  952. p->parent->signal->cmin_flt +=
  953. p->min_flt + p->signal->min_flt + p->signal->cmin_flt;
  954. p->parent->signal->cmaj_flt +=
  955. p->maj_flt + p->signal->maj_flt + p->signal->cmaj_flt;
  956. p->parent->signal->cnvcsw +=
  957. p->nvcsw + p->signal->nvcsw + p->signal->cnvcsw;
  958. p->parent->signal->cnivcsw +=
  959. p->nivcsw + p->signal->nivcsw + p->signal->cnivcsw;
  960. spin_unlock_irq(&p->parent->sighand->siglock);
  961. }
  962. /*
  963. * Now we are sure this task is interesting, and no other
  964. * thread can reap it because we set its state to EXIT_DEAD.
  965. */
  966. read_unlock(&tasklist_lock);
  967. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  968. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  969. ? p->signal->group_exit_code : p->exit_code;
  970. if (!retval && stat_addr)
  971. retval = put_user(status, stat_addr);
  972. if (!retval && infop)
  973. retval = put_user(SIGCHLD, &infop->si_signo);
  974. if (!retval && infop)
  975. retval = put_user(0, &infop->si_errno);
  976. if (!retval && infop) {
  977. int why;
  978. if ((status & 0x7f) == 0) {
  979. why = CLD_EXITED;
  980. status >>= 8;
  981. } else {
  982. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  983. status &= 0x7f;
  984. }
  985. retval = put_user((short)why, &infop->si_code);
  986. if (!retval)
  987. retval = put_user(status, &infop->si_status);
  988. }
  989. if (!retval && infop)
  990. retval = put_user(p->pid, &infop->si_pid);
  991. if (!retval && infop)
  992. retval = put_user(p->uid, &infop->si_uid);
  993. if (retval) {
  994. // TODO: is this safe?
  995. p->exit_state = EXIT_ZOMBIE;
  996. return retval;
  997. }
  998. retval = p->pid;
  999. if (p->real_parent != p->parent) {
  1000. write_lock_irq(&tasklist_lock);
  1001. /* Double-check with lock held. */
  1002. if (p->real_parent != p->parent) {
  1003. __ptrace_unlink(p);
  1004. // TODO: is this safe?
  1005. p->exit_state = EXIT_ZOMBIE;
  1006. /*
  1007. * If this is not a detached task, notify the parent.
  1008. * If it's still not detached after that, don't release
  1009. * it now.
  1010. */
  1011. if (p->exit_signal != -1) {
  1012. do_notify_parent(p, p->exit_signal);
  1013. if (p->exit_signal != -1)
  1014. p = NULL;
  1015. }
  1016. }
  1017. write_unlock_irq(&tasklist_lock);
  1018. }
  1019. if (p != NULL)
  1020. release_task(p);
  1021. BUG_ON(!retval);
  1022. return retval;
  1023. }
  1024. /*
  1025. * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold
  1026. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1027. * the lock and this task is uninteresting. If we return nonzero, we have
  1028. * released the lock and the system call should return.
  1029. */
  1030. static int wait_task_stopped(task_t *p, int delayed_group_leader, int noreap,
  1031. struct siginfo __user *infop,
  1032. int __user *stat_addr, struct rusage __user *ru)
  1033. {
  1034. int retval, exit_code;
  1035. if (!p->exit_code)
  1036. return 0;
  1037. if (delayed_group_leader && !(p->ptrace & PT_PTRACED) &&
  1038. p->signal && p->signal->group_stop_count > 0)
  1039. /*
  1040. * A group stop is in progress and this is the group leader.
  1041. * We won't report until all threads have stopped.
  1042. */
  1043. return 0;
  1044. /*
  1045. * Now we are pretty sure this task is interesting.
  1046. * Make sure it doesn't get reaped out from under us while we
  1047. * give up the lock and then examine it below. We don't want to
  1048. * keep holding onto the tasklist_lock while we call getrusage and
  1049. * possibly take page faults for user memory.
  1050. */
  1051. get_task_struct(p);
  1052. read_unlock(&tasklist_lock);
  1053. if (unlikely(noreap)) {
  1054. pid_t pid = p->pid;
  1055. uid_t uid = p->uid;
  1056. int why = (p->ptrace & PT_PTRACED) ? CLD_TRAPPED : CLD_STOPPED;
  1057. exit_code = p->exit_code;
  1058. if (unlikely(!exit_code) ||
  1059. unlikely(p->state & TASK_TRACED))
  1060. goto bail_ref;
  1061. return wait_noreap_copyout(p, pid, uid,
  1062. why, (exit_code << 8) | 0x7f,
  1063. infop, ru);
  1064. }
  1065. write_lock_irq(&tasklist_lock);
  1066. /*
  1067. * This uses xchg to be atomic with the thread resuming and setting
  1068. * it. It must also be done with the write lock held to prevent a
  1069. * race with the EXIT_ZOMBIE case.
  1070. */
  1071. exit_code = xchg(&p->exit_code, 0);
  1072. if (unlikely(p->exit_state)) {
  1073. /*
  1074. * The task resumed and then died. Let the next iteration
  1075. * catch it in EXIT_ZOMBIE. Note that exit_code might
  1076. * already be zero here if it resumed and did _exit(0).
  1077. * The task itself is dead and won't touch exit_code again;
  1078. * other processors in this function are locked out.
  1079. */
  1080. p->exit_code = exit_code;
  1081. exit_code = 0;
  1082. }
  1083. if (unlikely(exit_code == 0)) {
  1084. /*
  1085. * Another thread in this function got to it first, or it
  1086. * resumed, or it resumed and then died.
  1087. */
  1088. write_unlock_irq(&tasklist_lock);
  1089. bail_ref:
  1090. put_task_struct(p);
  1091. /*
  1092. * We are returning to the wait loop without having successfully
  1093. * removed the process and having released the lock. We cannot
  1094. * continue, since the "p" task pointer is potentially stale.
  1095. *
  1096. * Return -EAGAIN, and do_wait() will restart the loop from the
  1097. * beginning. Do _not_ re-acquire the lock.
  1098. */
  1099. return -EAGAIN;
  1100. }
  1101. /* move to end of parent's list to avoid starvation */
  1102. remove_parent(p);
  1103. add_parent(p, p->parent);
  1104. write_unlock_irq(&tasklist_lock);
  1105. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1106. if (!retval && stat_addr)
  1107. retval = put_user((exit_code << 8) | 0x7f, stat_addr);
  1108. if (!retval && infop)
  1109. retval = put_user(SIGCHLD, &infop->si_signo);
  1110. if (!retval && infop)
  1111. retval = put_user(0, &infop->si_errno);
  1112. if (!retval && infop)
  1113. retval = put_user((short)((p->ptrace & PT_PTRACED)
  1114. ? CLD_TRAPPED : CLD_STOPPED),
  1115. &infop->si_code);
  1116. if (!retval && infop)
  1117. retval = put_user(exit_code, &infop->si_status);
  1118. if (!retval && infop)
  1119. retval = put_user(p->pid, &infop->si_pid);
  1120. if (!retval && infop)
  1121. retval = put_user(p->uid, &infop->si_uid);
  1122. if (!retval)
  1123. retval = p->pid;
  1124. put_task_struct(p);
  1125. BUG_ON(!retval);
  1126. return retval;
  1127. }
  1128. /*
  1129. * Handle do_wait work for one task in a live, non-stopped state.
  1130. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1131. * the lock and this task is uninteresting. If we return nonzero, we have
  1132. * released the lock and the system call should return.
  1133. */
  1134. static int wait_task_continued(task_t *p, int noreap,
  1135. struct siginfo __user *infop,
  1136. int __user *stat_addr, struct rusage __user *ru)
  1137. {
  1138. int retval;
  1139. pid_t pid;
  1140. uid_t uid;
  1141. if (unlikely(!p->signal))
  1142. return 0;
  1143. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1144. return 0;
  1145. spin_lock_irq(&p->sighand->siglock);
  1146. /* Re-check with the lock held. */
  1147. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1148. spin_unlock_irq(&p->sighand->siglock);
  1149. return 0;
  1150. }
  1151. if (!noreap)
  1152. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1153. spin_unlock_irq(&p->sighand->siglock);
  1154. pid = p->pid;
  1155. uid = p->uid;
  1156. get_task_struct(p);
  1157. read_unlock(&tasklist_lock);
  1158. if (!infop) {
  1159. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1160. put_task_struct(p);
  1161. if (!retval && stat_addr)
  1162. retval = put_user(0xffff, stat_addr);
  1163. if (!retval)
  1164. retval = p->pid;
  1165. } else {
  1166. retval = wait_noreap_copyout(p, pid, uid,
  1167. CLD_CONTINUED, SIGCONT,
  1168. infop, ru);
  1169. BUG_ON(retval == 0);
  1170. }
  1171. return retval;
  1172. }
  1173. static inline int my_ptrace_child(struct task_struct *p)
  1174. {
  1175. if (!(p->ptrace & PT_PTRACED))
  1176. return 0;
  1177. if (!(p->ptrace & PT_ATTACHED))
  1178. return 1;
  1179. /*
  1180. * This child was PTRACE_ATTACH'd. We should be seeing it only if
  1181. * we are the attacher. If we are the real parent, this is a race
  1182. * inside ptrace_attach. It is waiting for the tasklist_lock,
  1183. * which we have to switch the parent links, but has already set
  1184. * the flags in p->ptrace.
  1185. */
  1186. return (p->parent != p->real_parent);
  1187. }
  1188. static long do_wait(pid_t pid, int options, struct siginfo __user *infop,
  1189. int __user *stat_addr, struct rusage __user *ru)
  1190. {
  1191. DECLARE_WAITQUEUE(wait, current);
  1192. struct task_struct *tsk;
  1193. int flag, retval;
  1194. add_wait_queue(&current->signal->wait_chldexit,&wait);
  1195. repeat:
  1196. /*
  1197. * We will set this flag if we see any child that might later
  1198. * match our criteria, even if we are not able to reap it yet.
  1199. */
  1200. flag = 0;
  1201. current->state = TASK_INTERRUPTIBLE;
  1202. read_lock(&tasklist_lock);
  1203. tsk = current;
  1204. do {
  1205. struct task_struct *p;
  1206. struct list_head *_p;
  1207. int ret;
  1208. list_for_each(_p,&tsk->children) {
  1209. p = list_entry(_p,struct task_struct,sibling);
  1210. ret = eligible_child(pid, options, p);
  1211. if (!ret)
  1212. continue;
  1213. switch (p->state) {
  1214. case TASK_TRACED:
  1215. if (!my_ptrace_child(p))
  1216. continue;
  1217. /*FALLTHROUGH*/
  1218. case TASK_STOPPED:
  1219. /*
  1220. * It's stopped now, so it might later
  1221. * continue, exit, or stop again.
  1222. */
  1223. flag = 1;
  1224. if (!(options & WUNTRACED) &&
  1225. !my_ptrace_child(p))
  1226. continue;
  1227. retval = wait_task_stopped(p, ret == 2,
  1228. (options & WNOWAIT),
  1229. infop,
  1230. stat_addr, ru);
  1231. if (retval == -EAGAIN)
  1232. goto repeat;
  1233. if (retval != 0) /* He released the lock. */
  1234. goto end;
  1235. break;
  1236. default:
  1237. // case EXIT_DEAD:
  1238. if (p->exit_state == EXIT_DEAD)
  1239. continue;
  1240. // case EXIT_ZOMBIE:
  1241. if (p->exit_state == EXIT_ZOMBIE) {
  1242. /*
  1243. * Eligible but we cannot release
  1244. * it yet:
  1245. */
  1246. if (ret == 2)
  1247. goto check_continued;
  1248. if (!likely(options & WEXITED))
  1249. continue;
  1250. retval = wait_task_zombie(
  1251. p, (options & WNOWAIT),
  1252. infop, stat_addr, ru);
  1253. /* He released the lock. */
  1254. if (retval != 0)
  1255. goto end;
  1256. break;
  1257. }
  1258. check_continued:
  1259. /*
  1260. * It's running now, so it might later
  1261. * exit, stop, or stop and then continue.
  1262. */
  1263. flag = 1;
  1264. if (!unlikely(options & WCONTINUED))
  1265. continue;
  1266. retval = wait_task_continued(
  1267. p, (options & WNOWAIT),
  1268. infop, stat_addr, ru);
  1269. if (retval != 0) /* He released the lock. */
  1270. goto end;
  1271. break;
  1272. }
  1273. }
  1274. if (!flag) {
  1275. list_for_each(_p, &tsk->ptrace_children) {
  1276. p = list_entry(_p, struct task_struct,
  1277. ptrace_list);
  1278. if (!eligible_child(pid, options, p))
  1279. continue;
  1280. flag = 1;
  1281. break;
  1282. }
  1283. }
  1284. if (options & __WNOTHREAD)
  1285. break;
  1286. tsk = next_thread(tsk);
  1287. if (tsk->signal != current->signal)
  1288. BUG();
  1289. } while (tsk != current);
  1290. read_unlock(&tasklist_lock);
  1291. if (flag) {
  1292. retval = 0;
  1293. if (options & WNOHANG)
  1294. goto end;
  1295. retval = -ERESTARTSYS;
  1296. if (signal_pending(current))
  1297. goto end;
  1298. schedule();
  1299. goto repeat;
  1300. }
  1301. retval = -ECHILD;
  1302. end:
  1303. current->state = TASK_RUNNING;
  1304. remove_wait_queue(&current->signal->wait_chldexit,&wait);
  1305. if (infop) {
  1306. if (retval > 0)
  1307. retval = 0;
  1308. else {
  1309. /*
  1310. * For a WNOHANG return, clear out all the fields
  1311. * we would set so the user can easily tell the
  1312. * difference.
  1313. */
  1314. if (!retval)
  1315. retval = put_user(0, &infop->si_signo);
  1316. if (!retval)
  1317. retval = put_user(0, &infop->si_errno);
  1318. if (!retval)
  1319. retval = put_user(0, &infop->si_code);
  1320. if (!retval)
  1321. retval = put_user(0, &infop->si_pid);
  1322. if (!retval)
  1323. retval = put_user(0, &infop->si_uid);
  1324. if (!retval)
  1325. retval = put_user(0, &infop->si_status);
  1326. }
  1327. }
  1328. return retval;
  1329. }
  1330. asmlinkage long sys_waitid(int which, pid_t pid,
  1331. struct siginfo __user *infop, int options,
  1332. struct rusage __user *ru)
  1333. {
  1334. long ret;
  1335. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1336. return -EINVAL;
  1337. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1338. return -EINVAL;
  1339. switch (which) {
  1340. case P_ALL:
  1341. pid = -1;
  1342. break;
  1343. case P_PID:
  1344. if (pid <= 0)
  1345. return -EINVAL;
  1346. break;
  1347. case P_PGID:
  1348. if (pid <= 0)
  1349. return -EINVAL;
  1350. pid = -pid;
  1351. break;
  1352. default:
  1353. return -EINVAL;
  1354. }
  1355. ret = do_wait(pid, options, infop, NULL, ru);
  1356. /* avoid REGPARM breakage on x86: */
  1357. prevent_tail_call(ret);
  1358. return ret;
  1359. }
  1360. asmlinkage long sys_wait4(pid_t pid, int __user *stat_addr,
  1361. int options, struct rusage __user *ru)
  1362. {
  1363. long ret;
  1364. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1365. __WNOTHREAD|__WCLONE|__WALL))
  1366. return -EINVAL;
  1367. ret = do_wait(pid, options | WEXITED, NULL, stat_addr, ru);
  1368. /* avoid REGPARM breakage on x86: */
  1369. prevent_tail_call(ret);
  1370. return ret;
  1371. }
  1372. #ifdef __ARCH_WANT_SYS_WAITPID
  1373. /*
  1374. * sys_waitpid() remains for compatibility. waitpid() should be
  1375. * implemented by calling sys_wait4() from libc.a.
  1376. */
  1377. asmlinkage long sys_waitpid(pid_t pid, int __user *stat_addr, int options)
  1378. {
  1379. return sys_wait4(pid, stat_addr, options, NULL);
  1380. }
  1381. #endif