exit.c 44 KB

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