exit.c 42 KB

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