exit.c 44 KB

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