exit.c 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734
  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. sig->group_exit_task = NULL;
  88. }
  89. if (tsk == sig->curr_target)
  90. sig->curr_target = next_thread(tsk);
  91. /*
  92. * Accumulate here the counters for all threads but the
  93. * group leader as they die, so they can be added into
  94. * the process-wide totals when those are taken.
  95. * The group leader stays around as a zombie as long
  96. * as there are other threads. When it gets reaped,
  97. * the exit.c code will add its counts into these totals.
  98. * We won't ever get here for the group leader, since it
  99. * will have been the last reference on the signal_struct.
  100. */
  101. sig->utime = cputime_add(sig->utime, tsk->utime);
  102. sig->stime = cputime_add(sig->stime, tsk->stime);
  103. sig->gtime = cputime_add(sig->gtime, tsk->gtime);
  104. sig->min_flt += tsk->min_flt;
  105. sig->maj_flt += tsk->maj_flt;
  106. sig->nvcsw += tsk->nvcsw;
  107. sig->nivcsw += tsk->nivcsw;
  108. sig->inblock += task_io_get_inblock(tsk);
  109. sig->oublock += task_io_get_oublock(tsk);
  110. sig->sum_sched_runtime += tsk->se.sum_exec_runtime;
  111. sig = NULL; /* Marker for below. */
  112. }
  113. __unhash_process(tsk);
  114. tsk->signal = NULL;
  115. tsk->sighand = NULL;
  116. spin_unlock(&sighand->siglock);
  117. rcu_read_unlock();
  118. __cleanup_sighand(sighand);
  119. clear_tsk_thread_flag(tsk,TIF_SIGPENDING);
  120. flush_sigqueue(&tsk->pending);
  121. if (sig) {
  122. flush_sigqueue(&sig->shared_pending);
  123. taskstats_tgid_free(sig);
  124. __cleanup_signal(sig);
  125. }
  126. }
  127. static void delayed_put_task_struct(struct rcu_head *rhp)
  128. {
  129. put_task_struct(container_of(rhp, struct task_struct, rcu));
  130. }
  131. void release_task(struct task_struct * p)
  132. {
  133. struct task_struct *leader;
  134. int zap_leader;
  135. repeat:
  136. atomic_dec(&p->user->processes);
  137. write_lock_irq(&tasklist_lock);
  138. ptrace_unlink(p);
  139. BUG_ON(!list_empty(&p->ptrace_list) || !list_empty(&p->ptrace_children));
  140. __exit_signal(p);
  141. /*
  142. * If we are the last non-leader member of the thread
  143. * group, and the leader is zombie, then notify the
  144. * group leader's parent process. (if it wants notification.)
  145. */
  146. zap_leader = 0;
  147. leader = p->group_leader;
  148. if (leader != p && thread_group_empty(leader) && leader->exit_state == EXIT_ZOMBIE) {
  149. BUG_ON(leader->exit_signal == -1);
  150. do_notify_parent(leader, leader->exit_signal);
  151. /*
  152. * If we were the last child thread and the leader has
  153. * exited already, and the leader's parent ignores SIGCHLD,
  154. * then we are the one who should release the leader.
  155. *
  156. * do_notify_parent() will have marked it self-reaping in
  157. * that case.
  158. */
  159. zap_leader = (leader->exit_signal == -1);
  160. }
  161. write_unlock_irq(&tasklist_lock);
  162. proc_flush_task(p);
  163. release_thread(p);
  164. call_rcu(&p->rcu, delayed_put_task_struct);
  165. p = leader;
  166. if (unlikely(zap_leader))
  167. goto repeat;
  168. }
  169. /*
  170. * This checks not only the pgrp, but falls back on the pid if no
  171. * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
  172. * without this...
  173. *
  174. * The caller must hold rcu lock or the tasklist lock.
  175. */
  176. struct pid *session_of_pgrp(struct pid *pgrp)
  177. {
  178. struct task_struct *p;
  179. struct pid *sid = NULL;
  180. p = pid_task(pgrp, PIDTYPE_PGID);
  181. if (p == NULL)
  182. p = pid_task(pgrp, PIDTYPE_PID);
  183. if (p != NULL)
  184. sid = task_session(p);
  185. return sid;
  186. }
  187. /*
  188. * Determine if a process group is "orphaned", according to the POSIX
  189. * definition in 2.2.2.52. Orphaned process groups are not to be affected
  190. * by terminal-generated stop signals. Newly orphaned process groups are
  191. * to receive a SIGHUP and a SIGCONT.
  192. *
  193. * "I ask you, have you ever known what it is to be an orphan?"
  194. */
  195. static int will_become_orphaned_pgrp(struct pid *pgrp, struct task_struct *ignored_task)
  196. {
  197. struct task_struct *p;
  198. int ret = 1;
  199. do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
  200. if (p == ignored_task
  201. || p->exit_state
  202. || is_init(p->real_parent))
  203. continue;
  204. if (task_pgrp(p->real_parent) != pgrp &&
  205. task_session(p->real_parent) == task_session(p)) {
  206. ret = 0;
  207. break;
  208. }
  209. } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
  210. return ret; /* (sighing) "Often!" */
  211. }
  212. int is_current_pgrp_orphaned(void)
  213. {
  214. int retval;
  215. read_lock(&tasklist_lock);
  216. retval = will_become_orphaned_pgrp(task_pgrp(current), NULL);
  217. read_unlock(&tasklist_lock);
  218. return retval;
  219. }
  220. static int has_stopped_jobs(struct pid *pgrp)
  221. {
  222. int retval = 0;
  223. struct task_struct *p;
  224. do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
  225. if (p->state != TASK_STOPPED)
  226. continue;
  227. retval = 1;
  228. break;
  229. } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
  230. return retval;
  231. }
  232. /**
  233. * reparent_to_kthreadd - Reparent the calling kernel thread to kthreadd
  234. *
  235. * If a kernel thread is launched as a result of a system call, or if
  236. * it ever exits, it should generally reparent itself to kthreadd so it
  237. * isn't in the way of other processes and is correctly cleaned up on exit.
  238. *
  239. * The various task state such as scheduling policy and priority may have
  240. * been inherited from a user process, so we reset them to sane values here.
  241. *
  242. * NOTE that reparent_to_kthreadd() gives the caller full capabilities.
  243. */
  244. static void reparent_to_kthreadd(void)
  245. {
  246. write_lock_irq(&tasklist_lock);
  247. ptrace_unlink(current);
  248. /* Reparent to init */
  249. remove_parent(current);
  250. current->real_parent = current->parent = kthreadd_task;
  251. add_parent(current);
  252. /* Set the exit signal to SIGCHLD so we signal init on exit */
  253. current->exit_signal = SIGCHLD;
  254. if (task_nice(current) < 0)
  255. set_user_nice(current, 0);
  256. /* cpus_allowed? */
  257. /* rt_priority? */
  258. /* signals? */
  259. security_task_reparent_to_init(current);
  260. memcpy(current->signal->rlim, init_task.signal->rlim,
  261. sizeof(current->signal->rlim));
  262. atomic_inc(&(INIT_USER->__count));
  263. write_unlock_irq(&tasklist_lock);
  264. switch_uid(INIT_USER);
  265. }
  266. void __set_special_pids(pid_t session, pid_t pgrp)
  267. {
  268. struct task_struct *curr = current->group_leader;
  269. if (process_session(curr) != session) {
  270. detach_pid(curr, PIDTYPE_SID);
  271. set_signal_session(curr->signal, session);
  272. attach_pid(curr, PIDTYPE_SID, find_pid(session));
  273. }
  274. if (process_group(curr) != pgrp) {
  275. detach_pid(curr, PIDTYPE_PGID);
  276. curr->signal->pgrp = pgrp;
  277. attach_pid(curr, PIDTYPE_PGID, find_pid(pgrp));
  278. }
  279. }
  280. static void set_special_pids(pid_t session, pid_t pgrp)
  281. {
  282. write_lock_irq(&tasklist_lock);
  283. __set_special_pids(session, pgrp);
  284. write_unlock_irq(&tasklist_lock);
  285. }
  286. /*
  287. * Let kernel threads use this to say that they
  288. * allow a certain signal (since daemonize() will
  289. * have disabled all of them by default).
  290. */
  291. int allow_signal(int sig)
  292. {
  293. if (!valid_signal(sig) || sig < 1)
  294. return -EINVAL;
  295. spin_lock_irq(&current->sighand->siglock);
  296. sigdelset(&current->blocked, sig);
  297. if (!current->mm) {
  298. /* Kernel threads handle their own signals.
  299. Let the signal code know it'll be handled, so
  300. that they don't get converted to SIGKILL or
  301. just silently dropped */
  302. current->sighand->action[(sig)-1].sa.sa_handler = (void __user *)2;
  303. }
  304. recalc_sigpending();
  305. spin_unlock_irq(&current->sighand->siglock);
  306. return 0;
  307. }
  308. EXPORT_SYMBOL(allow_signal);
  309. int disallow_signal(int sig)
  310. {
  311. if (!valid_signal(sig) || sig < 1)
  312. return -EINVAL;
  313. spin_lock_irq(&current->sighand->siglock);
  314. current->sighand->action[(sig)-1].sa.sa_handler = SIG_IGN;
  315. recalc_sigpending();
  316. spin_unlock_irq(&current->sighand->siglock);
  317. return 0;
  318. }
  319. EXPORT_SYMBOL(disallow_signal);
  320. /*
  321. * Put all the gunge required to become a kernel thread without
  322. * attached user resources in one place where it belongs.
  323. */
  324. void daemonize(const char *name, ...)
  325. {
  326. va_list args;
  327. struct fs_struct *fs;
  328. sigset_t blocked;
  329. va_start(args, name);
  330. vsnprintf(current->comm, sizeof(current->comm), name, args);
  331. va_end(args);
  332. /*
  333. * If we were started as result of loading a module, close all of the
  334. * user space pages. We don't need them, and if we didn't close them
  335. * they would be locked into memory.
  336. */
  337. exit_mm(current);
  338. /*
  339. * We don't want to have TIF_FREEZE set if the system-wide hibernation
  340. * or suspend transition begins right now.
  341. */
  342. current->flags |= PF_NOFREEZE;
  343. set_special_pids(1, 1);
  344. proc_clear_tty(current);
  345. /* Block and flush all signals */
  346. sigfillset(&blocked);
  347. sigprocmask(SIG_BLOCK, &blocked, NULL);
  348. flush_signals(current);
  349. /* Become as one with the init task */
  350. exit_fs(current); /* current->fs->count--; */
  351. fs = init_task.fs;
  352. current->fs = fs;
  353. atomic_inc(&fs->count);
  354. exit_task_namespaces(current);
  355. current->nsproxy = init_task.nsproxy;
  356. get_task_namespaces(current);
  357. exit_files(current);
  358. current->files = init_task.files;
  359. atomic_inc(&current->files->count);
  360. reparent_to_kthreadd();
  361. }
  362. EXPORT_SYMBOL(daemonize);
  363. static void close_files(struct files_struct * files)
  364. {
  365. int i, j;
  366. struct fdtable *fdt;
  367. j = 0;
  368. /*
  369. * It is safe to dereference the fd table without RCU or
  370. * ->file_lock because this is the last reference to the
  371. * files structure.
  372. */
  373. fdt = files_fdtable(files);
  374. for (;;) {
  375. unsigned long set;
  376. i = j * __NFDBITS;
  377. if (i >= fdt->max_fds)
  378. break;
  379. set = fdt->open_fds->fds_bits[j++];
  380. while (set) {
  381. if (set & 1) {
  382. struct file * file = xchg(&fdt->fd[i], NULL);
  383. if (file) {
  384. filp_close(file, files);
  385. cond_resched();
  386. }
  387. }
  388. i++;
  389. set >>= 1;
  390. }
  391. }
  392. }
  393. struct files_struct *get_files_struct(struct task_struct *task)
  394. {
  395. struct files_struct *files;
  396. task_lock(task);
  397. files = task->files;
  398. if (files)
  399. atomic_inc(&files->count);
  400. task_unlock(task);
  401. return files;
  402. }
  403. void fastcall put_files_struct(struct files_struct *files)
  404. {
  405. struct fdtable *fdt;
  406. if (atomic_dec_and_test(&files->count)) {
  407. close_files(files);
  408. /*
  409. * Free the fd and fdset arrays if we expanded them.
  410. * If the fdtable was embedded, pass files for freeing
  411. * at the end of the RCU grace period. Otherwise,
  412. * you can free files immediately.
  413. */
  414. fdt = files_fdtable(files);
  415. if (fdt != &files->fdtab)
  416. kmem_cache_free(files_cachep, files);
  417. free_fdtable(fdt);
  418. }
  419. }
  420. EXPORT_SYMBOL(put_files_struct);
  421. void reset_files_struct(struct task_struct *tsk, struct files_struct *files)
  422. {
  423. struct files_struct *old;
  424. old = tsk->files;
  425. task_lock(tsk);
  426. tsk->files = files;
  427. task_unlock(tsk);
  428. put_files_struct(old);
  429. }
  430. EXPORT_SYMBOL(reset_files_struct);
  431. static inline void __exit_files(struct task_struct *tsk)
  432. {
  433. struct files_struct * files = tsk->files;
  434. if (files) {
  435. task_lock(tsk);
  436. tsk->files = NULL;
  437. task_unlock(tsk);
  438. put_files_struct(files);
  439. }
  440. }
  441. void exit_files(struct task_struct *tsk)
  442. {
  443. __exit_files(tsk);
  444. }
  445. static inline void __put_fs_struct(struct fs_struct *fs)
  446. {
  447. /* No need to hold fs->lock if we are killing it */
  448. if (atomic_dec_and_test(&fs->count)) {
  449. dput(fs->root);
  450. mntput(fs->rootmnt);
  451. dput(fs->pwd);
  452. mntput(fs->pwdmnt);
  453. if (fs->altroot) {
  454. dput(fs->altroot);
  455. mntput(fs->altrootmnt);
  456. }
  457. kmem_cache_free(fs_cachep, fs);
  458. }
  459. }
  460. void put_fs_struct(struct fs_struct *fs)
  461. {
  462. __put_fs_struct(fs);
  463. }
  464. static inline void __exit_fs(struct task_struct *tsk)
  465. {
  466. struct fs_struct * fs = tsk->fs;
  467. if (fs) {
  468. task_lock(tsk);
  469. tsk->fs = NULL;
  470. task_unlock(tsk);
  471. __put_fs_struct(fs);
  472. }
  473. }
  474. void exit_fs(struct task_struct *tsk)
  475. {
  476. __exit_fs(tsk);
  477. }
  478. EXPORT_SYMBOL_GPL(exit_fs);
  479. /*
  480. * Turn us into a lazy TLB process if we
  481. * aren't already..
  482. */
  483. static void exit_mm(struct task_struct * tsk)
  484. {
  485. struct mm_struct *mm = tsk->mm;
  486. mm_release(tsk, mm);
  487. if (!mm)
  488. return;
  489. /*
  490. * Serialize with any possible pending coredump.
  491. * We must hold mmap_sem around checking core_waiters
  492. * and clearing tsk->mm. The core-inducing thread
  493. * will increment core_waiters for each thread in the
  494. * group with ->mm != NULL.
  495. */
  496. down_read(&mm->mmap_sem);
  497. if (mm->core_waiters) {
  498. up_read(&mm->mmap_sem);
  499. down_write(&mm->mmap_sem);
  500. if (!--mm->core_waiters)
  501. complete(mm->core_startup_done);
  502. up_write(&mm->mmap_sem);
  503. wait_for_completion(&mm->core_done);
  504. down_read(&mm->mmap_sem);
  505. }
  506. atomic_inc(&mm->mm_count);
  507. BUG_ON(mm != tsk->active_mm);
  508. /* more a memory barrier than a real lock */
  509. task_lock(tsk);
  510. tsk->mm = NULL;
  511. up_read(&mm->mmap_sem);
  512. enter_lazy_tlb(mm, current);
  513. /* We don't want this task to be frozen prematurely */
  514. clear_freeze_flag(tsk);
  515. task_unlock(tsk);
  516. mmput(mm);
  517. }
  518. static void
  519. reparent_thread(struct task_struct *p, struct task_struct *father, int traced)
  520. {
  521. if (p->pdeath_signal)
  522. /* We already hold the tasklist_lock here. */
  523. group_send_sig_info(p->pdeath_signal, SEND_SIG_NOINFO, p);
  524. /* Move the child from its dying parent to the new one. */
  525. if (unlikely(traced)) {
  526. /* Preserve ptrace links if someone else is tracing this child. */
  527. list_del_init(&p->ptrace_list);
  528. if (p->parent != p->real_parent)
  529. list_add(&p->ptrace_list, &p->real_parent->ptrace_children);
  530. } else {
  531. /* If this child is being traced, then we're the one tracing it
  532. * anyway, so let go of it.
  533. */
  534. p->ptrace = 0;
  535. remove_parent(p);
  536. p->parent = p->real_parent;
  537. add_parent(p);
  538. if (p->state == TASK_TRACED) {
  539. /*
  540. * If it was at a trace stop, turn it into
  541. * a normal stop since it's no longer being
  542. * traced.
  543. */
  544. ptrace_untrace(p);
  545. }
  546. }
  547. /* If this is a threaded reparent there is no need to
  548. * notify anyone anything has happened.
  549. */
  550. if (p->real_parent->group_leader == father->group_leader)
  551. return;
  552. /* We don't want people slaying init. */
  553. if (p->exit_signal != -1)
  554. p->exit_signal = SIGCHLD;
  555. /* If we'd notified the old parent about this child's death,
  556. * also notify the new parent.
  557. */
  558. if (!traced && p->exit_state == EXIT_ZOMBIE &&
  559. p->exit_signal != -1 && thread_group_empty(p))
  560. do_notify_parent(p, p->exit_signal);
  561. /*
  562. * process group orphan check
  563. * Case ii: Our child is in a different pgrp
  564. * than we are, and it was the only connection
  565. * outside, so the child pgrp is now orphaned.
  566. */
  567. if ((task_pgrp(p) != task_pgrp(father)) &&
  568. (task_session(p) == task_session(father))) {
  569. struct pid *pgrp = task_pgrp(p);
  570. if (will_become_orphaned_pgrp(pgrp, NULL) &&
  571. has_stopped_jobs(pgrp)) {
  572. __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp);
  573. __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp);
  574. }
  575. }
  576. }
  577. /*
  578. * When we die, we re-parent all our children.
  579. * Try to give them to another thread in our thread
  580. * group, and if no such member exists, give it to
  581. * the child reaper process (ie "init") in our pid
  582. * space.
  583. */
  584. static void
  585. forget_original_parent(struct task_struct *father, struct list_head *to_release)
  586. {
  587. struct task_struct *p, *reaper = father;
  588. struct list_head *_p, *_n;
  589. do {
  590. reaper = next_thread(reaper);
  591. if (reaper == father) {
  592. reaper = child_reaper(father);
  593. break;
  594. }
  595. } while (reaper->exit_state);
  596. /*
  597. * There are only two places where our children can be:
  598. *
  599. * - in our child list
  600. * - in our ptraced child list
  601. *
  602. * Search them and reparent children.
  603. */
  604. list_for_each_safe(_p, _n, &father->children) {
  605. int ptrace;
  606. p = list_entry(_p, struct task_struct, sibling);
  607. ptrace = p->ptrace;
  608. /* if father isn't the real parent, then ptrace must be enabled */
  609. BUG_ON(father != p->real_parent && !ptrace);
  610. if (father == p->real_parent) {
  611. /* reparent with a reaper, real father it's us */
  612. p->real_parent = reaper;
  613. reparent_thread(p, father, 0);
  614. } else {
  615. /* reparent ptraced task to its real parent */
  616. __ptrace_unlink (p);
  617. if (p->exit_state == EXIT_ZOMBIE && p->exit_signal != -1 &&
  618. thread_group_empty(p))
  619. do_notify_parent(p, p->exit_signal);
  620. }
  621. /*
  622. * if the ptraced child is a zombie with exit_signal == -1
  623. * we must collect it before we exit, or it will remain
  624. * zombie forever since we prevented it from self-reap itself
  625. * while it was being traced by us, to be able to see it in wait4.
  626. */
  627. if (unlikely(ptrace && p->exit_state == EXIT_ZOMBIE && p->exit_signal == -1))
  628. list_add(&p->ptrace_list, to_release);
  629. }
  630. list_for_each_safe(_p, _n, &father->ptrace_children) {
  631. p = list_entry(_p, struct task_struct, ptrace_list);
  632. p->real_parent = reaper;
  633. reparent_thread(p, father, 1);
  634. }
  635. }
  636. /*
  637. * Send signals to all our closest relatives so that they know
  638. * to properly mourn us..
  639. */
  640. static void exit_notify(struct task_struct *tsk)
  641. {
  642. int state;
  643. struct task_struct *t;
  644. struct list_head ptrace_dead, *_p, *_n;
  645. struct pid *pgrp;
  646. if (signal_pending(tsk) && !(tsk->signal->flags & SIGNAL_GROUP_EXIT)
  647. && !thread_group_empty(tsk)) {
  648. /*
  649. * This occurs when there was a race between our exit
  650. * syscall and a group signal choosing us as the one to
  651. * wake up. It could be that we are the only thread
  652. * alerted to check for pending signals, but another thread
  653. * should be woken now to take the signal since we will not.
  654. * Now we'll wake all the threads in the group just to make
  655. * sure someone gets all the pending signals.
  656. */
  657. read_lock(&tasklist_lock);
  658. spin_lock_irq(&tsk->sighand->siglock);
  659. for (t = next_thread(tsk); t != tsk; t = next_thread(t))
  660. if (!signal_pending(t) && !(t->flags & PF_EXITING))
  661. recalc_sigpending_and_wake(t);
  662. spin_unlock_irq(&tsk->sighand->siglock);
  663. read_unlock(&tasklist_lock);
  664. }
  665. write_lock_irq(&tasklist_lock);
  666. /*
  667. * This does two things:
  668. *
  669. * A. Make init inherit all the child processes
  670. * B. Check to see if any process groups have become orphaned
  671. * as a result of our exiting, and if they have any stopped
  672. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  673. */
  674. INIT_LIST_HEAD(&ptrace_dead);
  675. forget_original_parent(tsk, &ptrace_dead);
  676. BUG_ON(!list_empty(&tsk->children));
  677. BUG_ON(!list_empty(&tsk->ptrace_children));
  678. /*
  679. * Check to see if any process groups have become orphaned
  680. * as a result of our exiting, and if they have any stopped
  681. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  682. *
  683. * Case i: Our father is in a different pgrp than we are
  684. * and we were the only connection outside, so our pgrp
  685. * is about to become orphaned.
  686. */
  687. t = tsk->real_parent;
  688. pgrp = task_pgrp(tsk);
  689. if ((task_pgrp(t) != pgrp) &&
  690. (task_session(t) == task_session(tsk)) &&
  691. will_become_orphaned_pgrp(pgrp, tsk) &&
  692. has_stopped_jobs(pgrp)) {
  693. __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp);
  694. __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp);
  695. }
  696. /* Let father know we died
  697. *
  698. * Thread signals are configurable, but you aren't going to use
  699. * that to send signals to arbitary processes.
  700. * That stops right now.
  701. *
  702. * If the parent exec id doesn't match the exec id we saved
  703. * when we started then we know the parent has changed security
  704. * domain.
  705. *
  706. * If our self_exec id doesn't match our parent_exec_id then
  707. * we have changed execution domain as these two values started
  708. * the same after a fork.
  709. */
  710. if (tsk->exit_signal != SIGCHLD && tsk->exit_signal != -1 &&
  711. ( tsk->parent_exec_id != t->self_exec_id ||
  712. tsk->self_exec_id != tsk->parent_exec_id)
  713. && !capable(CAP_KILL))
  714. tsk->exit_signal = SIGCHLD;
  715. /* If something other than our normal parent is ptracing us, then
  716. * send it a SIGCHLD instead of honoring exit_signal. exit_signal
  717. * only has special meaning to our real parent.
  718. */
  719. if (tsk->exit_signal != -1 && thread_group_empty(tsk)) {
  720. int signal = tsk->parent == tsk->real_parent ? tsk->exit_signal : SIGCHLD;
  721. do_notify_parent(tsk, signal);
  722. } else if (tsk->ptrace) {
  723. do_notify_parent(tsk, SIGCHLD);
  724. }
  725. state = EXIT_ZOMBIE;
  726. if (tsk->exit_signal == -1 && likely(!tsk->ptrace))
  727. state = EXIT_DEAD;
  728. tsk->exit_state = state;
  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;
  1013. int status;
  1014. if (unlikely(noreap)) {
  1015. pid_t pid = p->pid;
  1016. uid_t uid = p->uid;
  1017. int exit_code = p->exit_code;
  1018. int why, status;
  1019. if (unlikely(p->exit_state != EXIT_ZOMBIE))
  1020. return 0;
  1021. if (unlikely(p->exit_signal == -1 && p->ptrace == 0))
  1022. return 0;
  1023. get_task_struct(p);
  1024. read_unlock(&tasklist_lock);
  1025. if ((exit_code & 0x7f) == 0) {
  1026. why = CLD_EXITED;
  1027. status = exit_code >> 8;
  1028. } else {
  1029. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  1030. status = exit_code & 0x7f;
  1031. }
  1032. return wait_noreap_copyout(p, pid, uid, why,
  1033. status, infop, ru);
  1034. }
  1035. /*
  1036. * Try to move the task's state to DEAD
  1037. * only one thread is allowed to do this:
  1038. */
  1039. state = xchg(&p->exit_state, EXIT_DEAD);
  1040. if (state != EXIT_ZOMBIE) {
  1041. BUG_ON(state != EXIT_DEAD);
  1042. return 0;
  1043. }
  1044. if (unlikely(p->exit_signal == -1 && p->ptrace == 0)) {
  1045. /*
  1046. * This can only happen in a race with a ptraced thread
  1047. * dying on another processor.
  1048. */
  1049. return 0;
  1050. }
  1051. if (likely(p->real_parent == p->parent) && likely(p->signal)) {
  1052. struct signal_struct *psig;
  1053. struct signal_struct *sig;
  1054. /*
  1055. * The resource counters for the group leader are in its
  1056. * own task_struct. Those for dead threads in the group
  1057. * are in its signal_struct, as are those for the child
  1058. * processes it has previously reaped. All these
  1059. * accumulate in the parent's signal_struct c* fields.
  1060. *
  1061. * We don't bother to take a lock here to protect these
  1062. * p->signal fields, because they are only touched by
  1063. * __exit_signal, which runs with tasklist_lock
  1064. * write-locked anyway, and so is excluded here. We do
  1065. * need to protect the access to p->parent->signal fields,
  1066. * as other threads in the parent group can be right
  1067. * here reaping other children at the same time.
  1068. */
  1069. spin_lock_irq(&p->parent->sighand->siglock);
  1070. psig = p->parent->signal;
  1071. sig = p->signal;
  1072. psig->cutime =
  1073. cputime_add(psig->cutime,
  1074. cputime_add(p->utime,
  1075. cputime_add(sig->utime,
  1076. sig->cutime)));
  1077. psig->cstime =
  1078. cputime_add(psig->cstime,
  1079. cputime_add(p->stime,
  1080. cputime_add(sig->stime,
  1081. sig->cstime)));
  1082. psig->cgtime =
  1083. cputime_add(psig->cgtime,
  1084. cputime_add(p->gtime,
  1085. cputime_add(sig->gtime,
  1086. sig->cgtime)));
  1087. psig->cmin_flt +=
  1088. p->min_flt + sig->min_flt + sig->cmin_flt;
  1089. psig->cmaj_flt +=
  1090. p->maj_flt + sig->maj_flt + sig->cmaj_flt;
  1091. psig->cnvcsw +=
  1092. p->nvcsw + sig->nvcsw + sig->cnvcsw;
  1093. psig->cnivcsw +=
  1094. p->nivcsw + sig->nivcsw + sig->cnivcsw;
  1095. psig->cinblock +=
  1096. task_io_get_inblock(p) +
  1097. sig->inblock + sig->cinblock;
  1098. psig->coublock +=
  1099. task_io_get_oublock(p) +
  1100. sig->oublock + sig->coublock;
  1101. spin_unlock_irq(&p->parent->sighand->siglock);
  1102. }
  1103. /*
  1104. * Now we are sure this task is interesting, and no other
  1105. * thread can reap it because we set its state to EXIT_DEAD.
  1106. */
  1107. read_unlock(&tasklist_lock);
  1108. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1109. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  1110. ? p->signal->group_exit_code : p->exit_code;
  1111. if (!retval && stat_addr)
  1112. retval = put_user(status, stat_addr);
  1113. if (!retval && infop)
  1114. retval = put_user(SIGCHLD, &infop->si_signo);
  1115. if (!retval && infop)
  1116. retval = put_user(0, &infop->si_errno);
  1117. if (!retval && infop) {
  1118. int why;
  1119. if ((status & 0x7f) == 0) {
  1120. why = CLD_EXITED;
  1121. status >>= 8;
  1122. } else {
  1123. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  1124. status &= 0x7f;
  1125. }
  1126. retval = put_user((short)why, &infop->si_code);
  1127. if (!retval)
  1128. retval = put_user(status, &infop->si_status);
  1129. }
  1130. if (!retval && infop)
  1131. retval = put_user(p->pid, &infop->si_pid);
  1132. if (!retval && infop)
  1133. retval = put_user(p->uid, &infop->si_uid);
  1134. if (retval) {
  1135. // TODO: is this safe?
  1136. p->exit_state = EXIT_ZOMBIE;
  1137. return retval;
  1138. }
  1139. retval = p->pid;
  1140. if (p->real_parent != p->parent) {
  1141. write_lock_irq(&tasklist_lock);
  1142. /* Double-check with lock held. */
  1143. if (p->real_parent != p->parent) {
  1144. __ptrace_unlink(p);
  1145. // TODO: is this safe?
  1146. p->exit_state = EXIT_ZOMBIE;
  1147. /*
  1148. * If this is not a detached task, notify the parent.
  1149. * If it's still not detached after that, don't release
  1150. * it now.
  1151. */
  1152. if (p->exit_signal != -1) {
  1153. do_notify_parent(p, p->exit_signal);
  1154. if (p->exit_signal != -1)
  1155. p = NULL;
  1156. }
  1157. }
  1158. write_unlock_irq(&tasklist_lock);
  1159. }
  1160. if (p != NULL)
  1161. release_task(p);
  1162. BUG_ON(!retval);
  1163. return retval;
  1164. }
  1165. /*
  1166. * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold
  1167. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1168. * the lock and this task is uninteresting. If we return nonzero, we have
  1169. * released the lock and the system call should return.
  1170. */
  1171. static int wait_task_stopped(struct task_struct *p, int delayed_group_leader,
  1172. int noreap, struct siginfo __user *infop,
  1173. int __user *stat_addr, struct rusage __user *ru)
  1174. {
  1175. int retval, exit_code;
  1176. if (!p->exit_code)
  1177. return 0;
  1178. if (delayed_group_leader && !(p->ptrace & PT_PTRACED) &&
  1179. p->signal && p->signal->group_stop_count > 0)
  1180. /*
  1181. * A group stop is in progress and this is the group leader.
  1182. * We won't report until all threads have stopped.
  1183. */
  1184. return 0;
  1185. /*
  1186. * Now we are pretty sure this task is interesting.
  1187. * Make sure it doesn't get reaped out from under us while we
  1188. * give up the lock and then examine it below. We don't want to
  1189. * keep holding onto the tasklist_lock while we call getrusage and
  1190. * possibly take page faults for user memory.
  1191. */
  1192. get_task_struct(p);
  1193. read_unlock(&tasklist_lock);
  1194. if (unlikely(noreap)) {
  1195. pid_t pid = p->pid;
  1196. uid_t uid = p->uid;
  1197. int why = (p->ptrace & PT_PTRACED) ? CLD_TRAPPED : CLD_STOPPED;
  1198. exit_code = p->exit_code;
  1199. if (unlikely(!exit_code) ||
  1200. unlikely(p->state & TASK_TRACED))
  1201. goto bail_ref;
  1202. return wait_noreap_copyout(p, pid, uid,
  1203. why, (exit_code << 8) | 0x7f,
  1204. infop, ru);
  1205. }
  1206. write_lock_irq(&tasklist_lock);
  1207. /*
  1208. * This uses xchg to be atomic with the thread resuming and setting
  1209. * it. It must also be done with the write lock held to prevent a
  1210. * race with the EXIT_ZOMBIE case.
  1211. */
  1212. exit_code = xchg(&p->exit_code, 0);
  1213. if (unlikely(p->exit_state)) {
  1214. /*
  1215. * The task resumed and then died. Let the next iteration
  1216. * catch it in EXIT_ZOMBIE. Note that exit_code might
  1217. * already be zero here if it resumed and did _exit(0).
  1218. * The task itself is dead and won't touch exit_code again;
  1219. * other processors in this function are locked out.
  1220. */
  1221. p->exit_code = exit_code;
  1222. exit_code = 0;
  1223. }
  1224. if (unlikely(exit_code == 0)) {
  1225. /*
  1226. * Another thread in this function got to it first, or it
  1227. * resumed, or it resumed and then died.
  1228. */
  1229. write_unlock_irq(&tasklist_lock);
  1230. bail_ref:
  1231. put_task_struct(p);
  1232. /*
  1233. * We are returning to the wait loop without having successfully
  1234. * removed the process and having released the lock. We cannot
  1235. * continue, since the "p" task pointer is potentially stale.
  1236. *
  1237. * Return -EAGAIN, and do_wait() will restart the loop from the
  1238. * beginning. Do _not_ re-acquire the lock.
  1239. */
  1240. return -EAGAIN;
  1241. }
  1242. /* move to end of parent's list to avoid starvation */
  1243. remove_parent(p);
  1244. add_parent(p);
  1245. write_unlock_irq(&tasklist_lock);
  1246. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1247. if (!retval && stat_addr)
  1248. retval = put_user((exit_code << 8) | 0x7f, stat_addr);
  1249. if (!retval && infop)
  1250. retval = put_user(SIGCHLD, &infop->si_signo);
  1251. if (!retval && infop)
  1252. retval = put_user(0, &infop->si_errno);
  1253. if (!retval && infop)
  1254. retval = put_user((short)((p->ptrace & PT_PTRACED)
  1255. ? CLD_TRAPPED : CLD_STOPPED),
  1256. &infop->si_code);
  1257. if (!retval && infop)
  1258. retval = put_user(exit_code, &infop->si_status);
  1259. if (!retval && infop)
  1260. retval = put_user(p->pid, &infop->si_pid);
  1261. if (!retval && infop)
  1262. retval = put_user(p->uid, &infop->si_uid);
  1263. if (!retval)
  1264. retval = p->pid;
  1265. put_task_struct(p);
  1266. BUG_ON(!retval);
  1267. return retval;
  1268. }
  1269. /*
  1270. * Handle do_wait work for one task in a live, non-stopped state.
  1271. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1272. * the lock and this task is uninteresting. If we return nonzero, we have
  1273. * released the lock and the system call should return.
  1274. */
  1275. static int wait_task_continued(struct task_struct *p, int noreap,
  1276. struct siginfo __user *infop,
  1277. int __user *stat_addr, struct rusage __user *ru)
  1278. {
  1279. int retval;
  1280. pid_t pid;
  1281. uid_t uid;
  1282. if (unlikely(!p->signal))
  1283. return 0;
  1284. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1285. return 0;
  1286. spin_lock_irq(&p->sighand->siglock);
  1287. /* Re-check with the lock held. */
  1288. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1289. spin_unlock_irq(&p->sighand->siglock);
  1290. return 0;
  1291. }
  1292. if (!noreap)
  1293. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1294. spin_unlock_irq(&p->sighand->siglock);
  1295. pid = p->pid;
  1296. uid = p->uid;
  1297. get_task_struct(p);
  1298. read_unlock(&tasklist_lock);
  1299. if (!infop) {
  1300. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1301. put_task_struct(p);
  1302. if (!retval && stat_addr)
  1303. retval = put_user(0xffff, stat_addr);
  1304. if (!retval)
  1305. retval = p->pid;
  1306. } else {
  1307. retval = wait_noreap_copyout(p, pid, uid,
  1308. CLD_CONTINUED, SIGCONT,
  1309. infop, ru);
  1310. BUG_ON(retval == 0);
  1311. }
  1312. return retval;
  1313. }
  1314. static inline int my_ptrace_child(struct task_struct *p)
  1315. {
  1316. if (!(p->ptrace & PT_PTRACED))
  1317. return 0;
  1318. if (!(p->ptrace & PT_ATTACHED))
  1319. return 1;
  1320. /*
  1321. * This child was PTRACE_ATTACH'd. We should be seeing it only if
  1322. * we are the attacher. If we are the real parent, this is a race
  1323. * inside ptrace_attach. It is waiting for the tasklist_lock,
  1324. * which we have to switch the parent links, but has already set
  1325. * the flags in p->ptrace.
  1326. */
  1327. return (p->parent != p->real_parent);
  1328. }
  1329. static long do_wait(pid_t pid, int options, struct siginfo __user *infop,
  1330. int __user *stat_addr, struct rusage __user *ru)
  1331. {
  1332. DECLARE_WAITQUEUE(wait, current);
  1333. struct task_struct *tsk;
  1334. int flag, retval;
  1335. int allowed, denied;
  1336. add_wait_queue(&current->signal->wait_chldexit,&wait);
  1337. repeat:
  1338. /*
  1339. * We will set this flag if we see any child that might later
  1340. * match our criteria, even if we are not able to reap it yet.
  1341. */
  1342. flag = 0;
  1343. allowed = denied = 0;
  1344. current->state = TASK_INTERRUPTIBLE;
  1345. read_lock(&tasklist_lock);
  1346. tsk = current;
  1347. do {
  1348. struct task_struct *p;
  1349. struct list_head *_p;
  1350. int ret;
  1351. list_for_each(_p,&tsk->children) {
  1352. p = list_entry(_p, struct task_struct, sibling);
  1353. ret = eligible_child(pid, options, p);
  1354. if (!ret)
  1355. continue;
  1356. if (unlikely(ret < 0)) {
  1357. denied = ret;
  1358. continue;
  1359. }
  1360. allowed = 1;
  1361. switch (p->state) {
  1362. case TASK_TRACED:
  1363. /*
  1364. * When we hit the race with PTRACE_ATTACH,
  1365. * we will not report this child. But the
  1366. * race means it has not yet been moved to
  1367. * our ptrace_children list, so we need to
  1368. * set the flag here to avoid a spurious ECHILD
  1369. * when the race happens with the only child.
  1370. */
  1371. flag = 1;
  1372. if (!my_ptrace_child(p))
  1373. continue;
  1374. /*FALLTHROUGH*/
  1375. case TASK_STOPPED:
  1376. /*
  1377. * It's stopped now, so it might later
  1378. * continue, exit, or stop again.
  1379. */
  1380. flag = 1;
  1381. if (!(options & WUNTRACED) &&
  1382. !my_ptrace_child(p))
  1383. continue;
  1384. retval = wait_task_stopped(p, ret == 2,
  1385. (options & WNOWAIT),
  1386. infop,
  1387. stat_addr, ru);
  1388. if (retval == -EAGAIN)
  1389. goto repeat;
  1390. if (retval != 0) /* He released the lock. */
  1391. goto end;
  1392. break;
  1393. default:
  1394. // case EXIT_DEAD:
  1395. if (p->exit_state == EXIT_DEAD)
  1396. continue;
  1397. // case EXIT_ZOMBIE:
  1398. if (p->exit_state == EXIT_ZOMBIE) {
  1399. /*
  1400. * Eligible but we cannot release
  1401. * it yet:
  1402. */
  1403. if (ret == 2)
  1404. goto check_continued;
  1405. if (!likely(options & WEXITED))
  1406. continue;
  1407. retval = wait_task_zombie(
  1408. p, (options & WNOWAIT),
  1409. infop, stat_addr, ru);
  1410. /* He released the lock. */
  1411. if (retval != 0)
  1412. goto end;
  1413. break;
  1414. }
  1415. check_continued:
  1416. /*
  1417. * It's running now, so it might later
  1418. * exit, stop, or stop and then continue.
  1419. */
  1420. flag = 1;
  1421. if (!unlikely(options & WCONTINUED))
  1422. continue;
  1423. retval = wait_task_continued(
  1424. p, (options & WNOWAIT),
  1425. infop, stat_addr, ru);
  1426. if (retval != 0) /* He released the lock. */
  1427. goto end;
  1428. break;
  1429. }
  1430. }
  1431. if (!flag) {
  1432. list_for_each(_p, &tsk->ptrace_children) {
  1433. p = list_entry(_p, struct task_struct,
  1434. ptrace_list);
  1435. if (!eligible_child(pid, options, p))
  1436. continue;
  1437. flag = 1;
  1438. break;
  1439. }
  1440. }
  1441. if (options & __WNOTHREAD)
  1442. break;
  1443. tsk = next_thread(tsk);
  1444. BUG_ON(tsk->signal != current->signal);
  1445. } while (tsk != current);
  1446. read_unlock(&tasklist_lock);
  1447. if (flag) {
  1448. retval = 0;
  1449. if (options & WNOHANG)
  1450. goto end;
  1451. retval = -ERESTARTSYS;
  1452. if (signal_pending(current))
  1453. goto end;
  1454. schedule();
  1455. goto repeat;
  1456. }
  1457. retval = -ECHILD;
  1458. if (unlikely(denied) && !allowed)
  1459. retval = denied;
  1460. end:
  1461. current->state = TASK_RUNNING;
  1462. remove_wait_queue(&current->signal->wait_chldexit,&wait);
  1463. if (infop) {
  1464. if (retval > 0)
  1465. retval = 0;
  1466. else {
  1467. /*
  1468. * For a WNOHANG return, clear out all the fields
  1469. * we would set so the user can easily tell the
  1470. * difference.
  1471. */
  1472. if (!retval)
  1473. retval = put_user(0, &infop->si_signo);
  1474. if (!retval)
  1475. retval = put_user(0, &infop->si_errno);
  1476. if (!retval)
  1477. retval = put_user(0, &infop->si_code);
  1478. if (!retval)
  1479. retval = put_user(0, &infop->si_pid);
  1480. if (!retval)
  1481. retval = put_user(0, &infop->si_uid);
  1482. if (!retval)
  1483. retval = put_user(0, &infop->si_status);
  1484. }
  1485. }
  1486. return retval;
  1487. }
  1488. asmlinkage long sys_waitid(int which, pid_t pid,
  1489. struct siginfo __user *infop, int options,
  1490. struct rusage __user *ru)
  1491. {
  1492. long ret;
  1493. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1494. return -EINVAL;
  1495. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1496. return -EINVAL;
  1497. switch (which) {
  1498. case P_ALL:
  1499. pid = -1;
  1500. break;
  1501. case P_PID:
  1502. if (pid <= 0)
  1503. return -EINVAL;
  1504. break;
  1505. case P_PGID:
  1506. if (pid <= 0)
  1507. return -EINVAL;
  1508. pid = -pid;
  1509. break;
  1510. default:
  1511. return -EINVAL;
  1512. }
  1513. ret = do_wait(pid, options, infop, NULL, ru);
  1514. /* avoid REGPARM breakage on x86: */
  1515. prevent_tail_call(ret);
  1516. return ret;
  1517. }
  1518. asmlinkage long sys_wait4(pid_t pid, int __user *stat_addr,
  1519. int options, struct rusage __user *ru)
  1520. {
  1521. long ret;
  1522. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1523. __WNOTHREAD|__WCLONE|__WALL))
  1524. return -EINVAL;
  1525. ret = do_wait(pid, options | WEXITED, NULL, stat_addr, ru);
  1526. /* avoid REGPARM breakage on x86: */
  1527. prevent_tail_call(ret);
  1528. return ret;
  1529. }
  1530. #ifdef __ARCH_WANT_SYS_WAITPID
  1531. /*
  1532. * sys_waitpid() remains for compatibility. waitpid() should be
  1533. * implemented by calling sys_wait4() from libc.a.
  1534. */
  1535. asmlinkage long sys_waitpid(pid_t pid, int __user *stat_addr, int options)
  1536. {
  1537. return sys_wait4(pid, stat_addr, options, NULL);
  1538. }
  1539. #endif