exit.c 41 KB

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