exit.c 43 KB

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