exit.c 43 KB

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