exit.c 44 KB

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