exit.c 43 KB

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