]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/kernel/exit.c | |
3 | * | |
4 | * Copyright (C) 1991, 1992 Linus Torvalds | |
5 | */ | |
6 | ||
1da177e4 LT |
7 | #include <linux/mm.h> |
8 | #include <linux/slab.h> | |
9 | #include <linux/interrupt.h> | |
1da177e4 | 10 | #include <linux/module.h> |
c59ede7b | 11 | #include <linux/capability.h> |
1da177e4 LT |
12 | #include <linux/completion.h> |
13 | #include <linux/personality.h> | |
14 | #include <linux/tty.h> | |
da9cbc87 | 15 | #include <linux/iocontext.h> |
1da177e4 LT |
16 | #include <linux/key.h> |
17 | #include <linux/security.h> | |
18 | #include <linux/cpu.h> | |
19 | #include <linux/acct.h> | |
8f0ab514 | 20 | #include <linux/tsacct_kern.h> |
1da177e4 | 21 | #include <linux/file.h> |
9f3acc31 | 22 | #include <linux/fdtable.h> |
1da177e4 | 23 | #include <linux/binfmts.h> |
ab516013 | 24 | #include <linux/nsproxy.h> |
84d73786 | 25 | #include <linux/pid_namespace.h> |
1da177e4 LT |
26 | #include <linux/ptrace.h> |
27 | #include <linux/profile.h> | |
28 | #include <linux/mount.h> | |
29 | #include <linux/proc_fs.h> | |
49d769d5 | 30 | #include <linux/kthread.h> |
1da177e4 | 31 | #include <linux/mempolicy.h> |
c757249a | 32 | #include <linux/taskstats_kern.h> |
ca74e92b | 33 | #include <linux/delayacct.h> |
83144186 | 34 | #include <linux/freezer.h> |
b4f48b63 | 35 | #include <linux/cgroup.h> |
1da177e4 | 36 | #include <linux/syscalls.h> |
7ed20e1a | 37 | #include <linux/signal.h> |
6a14c5c9 | 38 | #include <linux/posix-timers.h> |
9f46080c | 39 | #include <linux/cn_proc.h> |
de5097c2 | 40 | #include <linux/mutex.h> |
0771dfef | 41 | #include <linux/futex.h> |
b92ce558 | 42 | #include <linux/pipe_fs_i.h> |
fa84cb93 | 43 | #include <linux/audit.h> /* for audit_free() */ |
83cc5ed3 | 44 | #include <linux/resource.h> |
0d67a46d | 45 | #include <linux/blkdev.h> |
6eaeeaba | 46 | #include <linux/task_io_accounting_ops.h> |
30199f5a | 47 | #include <linux/tracehook.h> |
5ad4e53b | 48 | #include <linux/fs_struct.h> |
d84f4f99 | 49 | #include <linux/init_task.h> |
cdd6c482 | 50 | #include <linux/perf_event.h> |
ad8d75ff | 51 | #include <trace/events/sched.h> |
24f1e32c | 52 | #include <linux/hw_breakpoint.h> |
3d5992d2 | 53 | #include <linux/oom.h> |
1da177e4 LT |
54 | |
55 | #include <asm/uaccess.h> | |
56 | #include <asm/unistd.h> | |
57 | #include <asm/pgtable.h> | |
58 | #include <asm/mmu_context.h> | |
59 | ||
408b664a AB |
60 | static void exit_mm(struct task_struct * tsk); |
61 | ||
d40e48e0 | 62 | static void __unhash_process(struct task_struct *p, bool group_dead) |
1da177e4 LT |
63 | { |
64 | nr_threads--; | |
65 | detach_pid(p, PIDTYPE_PID); | |
d40e48e0 | 66 | if (group_dead) { |
1da177e4 LT |
67 | detach_pid(p, PIDTYPE_PGID); |
68 | detach_pid(p, PIDTYPE_SID); | |
c97d9893 | 69 | |
5e85d4ab | 70 | list_del_rcu(&p->tasks); |
9cd80bbb | 71 | list_del_init(&p->sibling); |
909ea964 | 72 | __this_cpu_dec(process_counts); |
1da177e4 | 73 | } |
47e65328 | 74 | list_del_rcu(&p->thread_group); |
1da177e4 LT |
75 | } |
76 | ||
6a14c5c9 ON |
77 | /* |
78 | * This function expects the tasklist_lock write-locked. | |
79 | */ | |
80 | static void __exit_signal(struct task_struct *tsk) | |
81 | { | |
82 | struct signal_struct *sig = tsk->signal; | |
d40e48e0 | 83 | bool group_dead = thread_group_leader(tsk); |
6a14c5c9 | 84 | struct sighand_struct *sighand; |
4ada856f | 85 | struct tty_struct *uninitialized_var(tty); |
6a14c5c9 | 86 | |
d11c563d PM |
87 | sighand = rcu_dereference_check(tsk->sighand, |
88 | rcu_read_lock_held() || | |
db1466b3 | 89 | lockdep_tasklist_lock_is_held()); |
6a14c5c9 ON |
90 | spin_lock(&sighand->siglock); |
91 | ||
92 | posix_cpu_timers_exit(tsk); | |
d40e48e0 | 93 | if (group_dead) { |
6a14c5c9 | 94 | posix_cpu_timers_exit_group(tsk); |
4ada856f ON |
95 | tty = sig->tty; |
96 | sig->tty = NULL; | |
4a599942 | 97 | } else { |
e0a70217 ON |
98 | /* |
99 | * This can only happen if the caller is de_thread(). | |
100 | * FIXME: this is the temporary hack, we should teach | |
101 | * posix-cpu-timers to handle this case correctly. | |
102 | */ | |
103 | if (unlikely(has_group_leader_pid(tsk))) | |
104 | posix_cpu_timers_exit_group(tsk); | |
105 | ||
6a14c5c9 ON |
106 | /* |
107 | * If there is any task waiting for the group exit | |
108 | * then notify it: | |
109 | */ | |
d344193a | 110 | if (sig->notify_count > 0 && !--sig->notify_count) |
6a14c5c9 | 111 | wake_up_process(sig->group_exit_task); |
6db840fa | 112 | |
6a14c5c9 ON |
113 | if (tsk == sig->curr_target) |
114 | sig->curr_target = next_thread(tsk); | |
115 | /* | |
116 | * Accumulate here the counters for all threads but the | |
117 | * group leader as they die, so they can be added into | |
118 | * the process-wide totals when those are taken. | |
119 | * The group leader stays around as a zombie as long | |
120 | * as there are other threads. When it gets reaped, | |
121 | * the exit.c code will add its counts into these totals. | |
122 | * We won't ever get here for the group leader, since it | |
123 | * will have been the last reference on the signal_struct. | |
124 | */ | |
0cf55e1e HS |
125 | sig->utime = cputime_add(sig->utime, tsk->utime); |
126 | sig->stime = cputime_add(sig->stime, tsk->stime); | |
d5b7c78e | 127 | sig->gtime = cputime_add(sig->gtime, tsk->gtime); |
6a14c5c9 ON |
128 | sig->min_flt += tsk->min_flt; |
129 | sig->maj_flt += tsk->maj_flt; | |
130 | sig->nvcsw += tsk->nvcsw; | |
131 | sig->nivcsw += tsk->nivcsw; | |
6eaeeaba ED |
132 | sig->inblock += task_io_get_inblock(tsk); |
133 | sig->oublock += task_io_get_oublock(tsk); | |
5995477a | 134 | task_io_accounting_add(&sig->ioac, &tsk->ioac); |
32bd671d | 135 | sig->sum_sched_runtime += tsk->se.sum_exec_runtime; |
6a14c5c9 ON |
136 | } |
137 | ||
b3ac022c | 138 | sig->nr_threads--; |
d40e48e0 | 139 | __unhash_process(tsk, group_dead); |
5876700c | 140 | |
da7978b0 ON |
141 | /* |
142 | * Do this under ->siglock, we can race with another thread | |
143 | * doing sigqueue_free() if we have SIGQUEUE_PREALLOC signals. | |
144 | */ | |
145 | flush_sigqueue(&tsk->pending); | |
a7e5328a | 146 | tsk->sighand = NULL; |
6a14c5c9 | 147 | spin_unlock(&sighand->siglock); |
6a14c5c9 | 148 | |
a7e5328a | 149 | __cleanup_sighand(sighand); |
6a14c5c9 | 150 | clear_tsk_thread_flag(tsk,TIF_SIGPENDING); |
d40e48e0 | 151 | if (group_dead) { |
6a14c5c9 | 152 | flush_sigqueue(&sig->shared_pending); |
4ada856f | 153 | tty_kref_put(tty); |
6a14c5c9 ON |
154 | } |
155 | } | |
156 | ||
8c7904a0 EB |
157 | static void delayed_put_task_struct(struct rcu_head *rhp) |
158 | { | |
0a16b607 MD |
159 | struct task_struct *tsk = container_of(rhp, struct task_struct, rcu); |
160 | ||
4e231c79 | 161 | perf_event_delayed_put(tsk); |
0a16b607 MD |
162 | trace_sched_process_free(tsk); |
163 | put_task_struct(tsk); | |
8c7904a0 EB |
164 | } |
165 | ||
f470021a | 166 | |
1da177e4 LT |
167 | void release_task(struct task_struct * p) |
168 | { | |
36c8b586 | 169 | struct task_struct *leader; |
1da177e4 | 170 | int zap_leader; |
1f09f974 | 171 | repeat: |
dae33574 | 172 | tracehook_prepare_release_task(p); |
c69e8d9c | 173 | /* don't need to get the RCU readlock here - the process is dead and |
d11c563d PM |
174 | * can't be modifying its own credentials. But shut RCU-lockdep up */ |
175 | rcu_read_lock(); | |
c69e8d9c | 176 | atomic_dec(&__task_cred(p)->user->processes); |
d11c563d | 177 | rcu_read_unlock(); |
c69e8d9c | 178 | |
60347f67 | 179 | proc_flush_task(p); |
0203026b | 180 | |
1da177e4 | 181 | write_lock_irq(&tasklist_lock); |
dae33574 | 182 | tracehook_finish_release_task(p); |
1da177e4 | 183 | __exit_signal(p); |
35f5cad8 | 184 | |
1da177e4 LT |
185 | /* |
186 | * If we are the last non-leader member of the thread | |
187 | * group, and the leader is zombie, then notify the | |
188 | * group leader's parent process. (if it wants notification.) | |
189 | */ | |
190 | zap_leader = 0; | |
191 | leader = p->group_leader; | |
192 | if (leader != p && thread_group_empty(leader) && leader->exit_state == EXIT_ZOMBIE) { | |
d839fd4d | 193 | BUG_ON(task_detached(leader)); |
1da177e4 LT |
194 | do_notify_parent(leader, leader->exit_signal); |
195 | /* | |
196 | * If we were the last child thread and the leader has | |
197 | * exited already, and the leader's parent ignores SIGCHLD, | |
198 | * then we are the one who should release the leader. | |
199 | * | |
200 | * do_notify_parent() will have marked it self-reaping in | |
201 | * that case. | |
202 | */ | |
d839fd4d | 203 | zap_leader = task_detached(leader); |
dae33574 RM |
204 | |
205 | /* | |
206 | * This maintains the invariant that release_task() | |
207 | * only runs on a task in EXIT_DEAD, just for sanity. | |
208 | */ | |
209 | if (zap_leader) | |
210 | leader->exit_state = EXIT_DEAD; | |
1da177e4 LT |
211 | } |
212 | ||
1da177e4 | 213 | write_unlock_irq(&tasklist_lock); |
1da177e4 | 214 | release_thread(p); |
8c7904a0 | 215 | call_rcu(&p->rcu, delayed_put_task_struct); |
1da177e4 LT |
216 | |
217 | p = leader; | |
218 | if (unlikely(zap_leader)) | |
219 | goto repeat; | |
220 | } | |
221 | ||
1da177e4 LT |
222 | /* |
223 | * This checks not only the pgrp, but falls back on the pid if no | |
224 | * satisfactory pgrp is found. I dunno - gdb doesn't work correctly | |
225 | * without this... | |
04a2e6a5 EB |
226 | * |
227 | * The caller must hold rcu lock or the tasklist lock. | |
1da177e4 | 228 | */ |
04a2e6a5 | 229 | struct pid *session_of_pgrp(struct pid *pgrp) |
1da177e4 LT |
230 | { |
231 | struct task_struct *p; | |
04a2e6a5 | 232 | struct pid *sid = NULL; |
62dfb554 | 233 | |
04a2e6a5 | 234 | p = pid_task(pgrp, PIDTYPE_PGID); |
62dfb554 | 235 | if (p == NULL) |
04a2e6a5 | 236 | p = pid_task(pgrp, PIDTYPE_PID); |
62dfb554 | 237 | if (p != NULL) |
04a2e6a5 | 238 | sid = task_session(p); |
62dfb554 | 239 | |
1da177e4 LT |
240 | return sid; |
241 | } | |
242 | ||
243 | /* | |
244 | * Determine if a process group is "orphaned", according to the POSIX | |
245 | * definition in 2.2.2.52. Orphaned process groups are not to be affected | |
246 | * by terminal-generated stop signals. Newly orphaned process groups are | |
247 | * to receive a SIGHUP and a SIGCONT. | |
248 | * | |
249 | * "I ask you, have you ever known what it is to be an orphan?" | |
250 | */ | |
0475ac08 | 251 | static int will_become_orphaned_pgrp(struct pid *pgrp, struct task_struct *ignored_task) |
1da177e4 LT |
252 | { |
253 | struct task_struct *p; | |
1da177e4 | 254 | |
0475ac08 | 255 | do_each_pid_task(pgrp, PIDTYPE_PGID, p) { |
05e83df6 ON |
256 | if ((p == ignored_task) || |
257 | (p->exit_state && thread_group_empty(p)) || | |
258 | is_global_init(p->real_parent)) | |
1da177e4 | 259 | continue; |
05e83df6 | 260 | |
0475ac08 | 261 | if (task_pgrp(p->real_parent) != pgrp && |
05e83df6 ON |
262 | task_session(p->real_parent) == task_session(p)) |
263 | return 0; | |
0475ac08 | 264 | } while_each_pid_task(pgrp, PIDTYPE_PGID, p); |
05e83df6 ON |
265 | |
266 | return 1; | |
1da177e4 LT |
267 | } |
268 | ||
3e7cd6c4 | 269 | int is_current_pgrp_orphaned(void) |
1da177e4 LT |
270 | { |
271 | int retval; | |
272 | ||
273 | read_lock(&tasklist_lock); | |
3e7cd6c4 | 274 | retval = will_become_orphaned_pgrp(task_pgrp(current), NULL); |
1da177e4 LT |
275 | read_unlock(&tasklist_lock); |
276 | ||
277 | return retval; | |
278 | } | |
279 | ||
0475ac08 | 280 | static int has_stopped_jobs(struct pid *pgrp) |
1da177e4 LT |
281 | { |
282 | int retval = 0; | |
283 | struct task_struct *p; | |
284 | ||
0475ac08 | 285 | do_each_pid_task(pgrp, PIDTYPE_PGID, p) { |
338077e5 | 286 | if (!task_is_stopped(p)) |
1da177e4 | 287 | continue; |
1da177e4 LT |
288 | retval = 1; |
289 | break; | |
0475ac08 | 290 | } while_each_pid_task(pgrp, PIDTYPE_PGID, p); |
1da177e4 LT |
291 | return retval; |
292 | } | |
293 | ||
f49ee505 ON |
294 | /* |
295 | * Check to see if any process groups have become orphaned as | |
296 | * a result of our exiting, and if they have any stopped jobs, | |
297 | * send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2) | |
298 | */ | |
299 | static void | |
300 | kill_orphaned_pgrp(struct task_struct *tsk, struct task_struct *parent) | |
301 | { | |
302 | struct pid *pgrp = task_pgrp(tsk); | |
303 | struct task_struct *ignored_task = tsk; | |
304 | ||
305 | if (!parent) | |
306 | /* exit: our father is in a different pgrp than | |
307 | * we are and we were the only connection outside. | |
308 | */ | |
309 | parent = tsk->real_parent; | |
310 | else | |
311 | /* reparent: our child is in a different pgrp than | |
312 | * we are, and it was the only connection outside. | |
313 | */ | |
314 | ignored_task = NULL; | |
315 | ||
316 | if (task_pgrp(parent) != pgrp && | |
317 | task_session(parent) == task_session(tsk) && | |
318 | will_become_orphaned_pgrp(pgrp, ignored_task) && | |
319 | has_stopped_jobs(pgrp)) { | |
320 | __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp); | |
321 | __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp); | |
322 | } | |
323 | } | |
324 | ||
1da177e4 | 325 | /** |
49d769d5 | 326 | * reparent_to_kthreadd - Reparent the calling kernel thread to kthreadd |
1da177e4 LT |
327 | * |
328 | * If a kernel thread is launched as a result of a system call, or if | |
49d769d5 EB |
329 | * it ever exits, it should generally reparent itself to kthreadd so it |
330 | * isn't in the way of other processes and is correctly cleaned up on exit. | |
1da177e4 LT |
331 | * |
332 | * The various task state such as scheduling policy and priority may have | |
333 | * been inherited from a user process, so we reset them to sane values here. | |
334 | * | |
49d769d5 | 335 | * NOTE that reparent_to_kthreadd() gives the caller full capabilities. |
1da177e4 | 336 | */ |
49d769d5 | 337 | static void reparent_to_kthreadd(void) |
1da177e4 LT |
338 | { |
339 | write_lock_irq(&tasklist_lock); | |
340 | ||
341 | ptrace_unlink(current); | |
342 | /* Reparent to init */ | |
49d769d5 | 343 | current->real_parent = current->parent = kthreadd_task; |
f470021a | 344 | list_move_tail(¤t->sibling, ¤t->real_parent->children); |
1da177e4 LT |
345 | |
346 | /* Set the exit signal to SIGCHLD so we signal init on exit */ | |
347 | current->exit_signal = SIGCHLD; | |
348 | ||
e05606d3 | 349 | if (task_nice(current) < 0) |
1da177e4 LT |
350 | set_user_nice(current, 0); |
351 | /* cpus_allowed? */ | |
352 | /* rt_priority? */ | |
353 | /* signals? */ | |
1da177e4 LT |
354 | memcpy(current->signal->rlim, init_task.signal->rlim, |
355 | sizeof(current->signal->rlim)); | |
d84f4f99 DH |
356 | |
357 | atomic_inc(&init_cred.usage); | |
358 | commit_creds(&init_cred); | |
1da177e4 | 359 | write_unlock_irq(&tasklist_lock); |
1da177e4 LT |
360 | } |
361 | ||
8520d7c7 | 362 | void __set_special_pids(struct pid *pid) |
1da177e4 | 363 | { |
e19f247a | 364 | struct task_struct *curr = current->group_leader; |
1da177e4 | 365 | |
0d0df599 | 366 | if (task_session(curr) != pid) |
7d8da096 | 367 | change_pid(curr, PIDTYPE_SID, pid); |
1b0f7ffd ON |
368 | |
369 | if (task_pgrp(curr) != pid) | |
7d8da096 | 370 | change_pid(curr, PIDTYPE_PGID, pid); |
1da177e4 LT |
371 | } |
372 | ||
8520d7c7 | 373 | static void set_special_pids(struct pid *pid) |
1da177e4 LT |
374 | { |
375 | write_lock_irq(&tasklist_lock); | |
8520d7c7 | 376 | __set_special_pids(pid); |
1da177e4 LT |
377 | write_unlock_irq(&tasklist_lock); |
378 | } | |
379 | ||
380 | /* | |
87245135 ON |
381 | * Let kernel threads use this to say that they allow a certain signal. |
382 | * Must not be used if kthread was cloned with CLONE_SIGHAND. | |
1da177e4 LT |
383 | */ |
384 | int allow_signal(int sig) | |
385 | { | |
7ed20e1a | 386 | if (!valid_signal(sig) || sig < 1) |
1da177e4 LT |
387 | return -EINVAL; |
388 | ||
389 | spin_lock_irq(¤t->sighand->siglock); | |
87245135 | 390 | /* This is only needed for daemonize()'ed kthreads */ |
1da177e4 | 391 | sigdelset(¤t->blocked, sig); |
87245135 ON |
392 | /* |
393 | * Kernel threads handle their own signals. Let the signal code | |
394 | * know it'll be handled, so that they don't get converted to | |
395 | * SIGKILL or just silently dropped. | |
396 | */ | |
397 | current->sighand->action[(sig)-1].sa.sa_handler = (void __user *)2; | |
1da177e4 LT |
398 | recalc_sigpending(); |
399 | spin_unlock_irq(¤t->sighand->siglock); | |
400 | return 0; | |
401 | } | |
402 | ||
403 | EXPORT_SYMBOL(allow_signal); | |
404 | ||
405 | int disallow_signal(int sig) | |
406 | { | |
7ed20e1a | 407 | if (!valid_signal(sig) || sig < 1) |
1da177e4 LT |
408 | return -EINVAL; |
409 | ||
410 | spin_lock_irq(¤t->sighand->siglock); | |
10ab825b | 411 | current->sighand->action[(sig)-1].sa.sa_handler = SIG_IGN; |
1da177e4 LT |
412 | recalc_sigpending(); |
413 | spin_unlock_irq(¤t->sighand->siglock); | |
414 | return 0; | |
415 | } | |
416 | ||
417 | EXPORT_SYMBOL(disallow_signal); | |
418 | ||
419 | /* | |
420 | * Put all the gunge required to become a kernel thread without | |
421 | * attached user resources in one place where it belongs. | |
422 | */ | |
423 | ||
424 | void daemonize(const char *name, ...) | |
425 | { | |
426 | va_list args; | |
1da177e4 LT |
427 | sigset_t blocked; |
428 | ||
429 | va_start(args, name); | |
430 | vsnprintf(current->comm, sizeof(current->comm), name, args); | |
431 | va_end(args); | |
432 | ||
433 | /* | |
434 | * If we were started as result of loading a module, close all of the | |
435 | * user space pages. We don't need them, and if we didn't close them | |
436 | * they would be locked into memory. | |
437 | */ | |
438 | exit_mm(current); | |
83144186 RW |
439 | /* |
440 | * We don't want to have TIF_FREEZE set if the system-wide hibernation | |
441 | * or suspend transition begins right now. | |
442 | */ | |
7b34e428 | 443 | current->flags |= (PF_NOFREEZE | PF_KTHREAD); |
1da177e4 | 444 | |
8520d7c7 ON |
445 | if (current->nsproxy != &init_nsproxy) { |
446 | get_nsproxy(&init_nsproxy); | |
447 | switch_task_namespaces(current, &init_nsproxy); | |
448 | } | |
297bd42b | 449 | set_special_pids(&init_struct_pid); |
24ec839c | 450 | proc_clear_tty(current); |
1da177e4 LT |
451 | |
452 | /* Block and flush all signals */ | |
453 | sigfillset(&blocked); | |
454 | sigprocmask(SIG_BLOCK, &blocked, NULL); | |
455 | flush_signals(current); | |
456 | ||
457 | /* Become as one with the init task */ | |
458 | ||
3e93cd67 | 459 | daemonize_fs_struct(); |
d4c5e41f | 460 | exit_files(current); |
1da177e4 LT |
461 | current->files = init_task.files; |
462 | atomic_inc(¤t->files->count); | |
463 | ||
49d769d5 | 464 | reparent_to_kthreadd(); |
1da177e4 LT |
465 | } |
466 | ||
467 | EXPORT_SYMBOL(daemonize); | |
468 | ||
858119e1 | 469 | static void close_files(struct files_struct * files) |
1da177e4 LT |
470 | { |
471 | int i, j; | |
badf1662 | 472 | struct fdtable *fdt; |
1da177e4 LT |
473 | |
474 | j = 0; | |
4fb3a538 DS |
475 | |
476 | /* | |
477 | * It is safe to dereference the fd table without RCU or | |
478 | * ->file_lock because this is the last reference to the | |
d11c563d | 479 | * files structure. But use RCU to shut RCU-lockdep up. |
4fb3a538 | 480 | */ |
d11c563d | 481 | rcu_read_lock(); |
badf1662 | 482 | fdt = files_fdtable(files); |
d11c563d | 483 | rcu_read_unlock(); |
1da177e4 LT |
484 | for (;;) { |
485 | unsigned long set; | |
486 | i = j * __NFDBITS; | |
bbea9f69 | 487 | if (i >= fdt->max_fds) |
1da177e4 | 488 | break; |
badf1662 | 489 | set = fdt->open_fds->fds_bits[j++]; |
1da177e4 LT |
490 | while (set) { |
491 | if (set & 1) { | |
badf1662 | 492 | struct file * file = xchg(&fdt->fd[i], NULL); |
944be0b2 | 493 | if (file) { |
1da177e4 | 494 | filp_close(file, files); |
944be0b2 IM |
495 | cond_resched(); |
496 | } | |
1da177e4 LT |
497 | } |
498 | i++; | |
499 | set >>= 1; | |
500 | } | |
501 | } | |
502 | } | |
503 | ||
504 | struct files_struct *get_files_struct(struct task_struct *task) | |
505 | { | |
506 | struct files_struct *files; | |
507 | ||
508 | task_lock(task); | |
509 | files = task->files; | |
510 | if (files) | |
511 | atomic_inc(&files->count); | |
512 | task_unlock(task); | |
513 | ||
514 | return files; | |
515 | } | |
516 | ||
7ad5b3a5 | 517 | void put_files_struct(struct files_struct *files) |
1da177e4 | 518 | { |
badf1662 DS |
519 | struct fdtable *fdt; |
520 | ||
1da177e4 LT |
521 | if (atomic_dec_and_test(&files->count)) { |
522 | close_files(files); | |
523 | /* | |
524 | * Free the fd and fdset arrays if we expanded them. | |
ab2af1f5 DS |
525 | * If the fdtable was embedded, pass files for freeing |
526 | * at the end of the RCU grace period. Otherwise, | |
527 | * you can free files immediately. | |
1da177e4 | 528 | */ |
d11c563d | 529 | rcu_read_lock(); |
badf1662 | 530 | fdt = files_fdtable(files); |
4fd45812 | 531 | if (fdt != &files->fdtab) |
ab2af1f5 | 532 | kmem_cache_free(files_cachep, files); |
01b2d93c | 533 | free_fdtable(fdt); |
d11c563d | 534 | rcu_read_unlock(); |
1da177e4 LT |
535 | } |
536 | } | |
537 | ||
3b125388 | 538 | void reset_files_struct(struct files_struct *files) |
3b9b8ab6 | 539 | { |
3b125388 | 540 | struct task_struct *tsk = current; |
3b9b8ab6 KK |
541 | struct files_struct *old; |
542 | ||
543 | old = tsk->files; | |
544 | task_lock(tsk); | |
545 | tsk->files = files; | |
546 | task_unlock(tsk); | |
547 | put_files_struct(old); | |
548 | } | |
3b9b8ab6 | 549 | |
1ec7f1dd | 550 | void exit_files(struct task_struct *tsk) |
1da177e4 LT |
551 | { |
552 | struct files_struct * files = tsk->files; | |
553 | ||
554 | if (files) { | |
555 | task_lock(tsk); | |
556 | tsk->files = NULL; | |
557 | task_unlock(tsk); | |
558 | put_files_struct(files); | |
559 | } | |
560 | } | |
561 | ||
cf475ad2 BS |
562 | #ifdef CONFIG_MM_OWNER |
563 | /* | |
564 | * Task p is exiting and it owned mm, lets find a new owner for it | |
565 | */ | |
566 | static inline int | |
567 | mm_need_new_owner(struct mm_struct *mm, struct task_struct *p) | |
568 | { | |
569 | /* | |
570 | * If there are other users of the mm and the owner (us) is exiting | |
571 | * we need to find a new owner to take on the responsibility. | |
572 | */ | |
cf475ad2 BS |
573 | if (atomic_read(&mm->mm_users) <= 1) |
574 | return 0; | |
575 | if (mm->owner != p) | |
576 | return 0; | |
577 | return 1; | |
578 | } | |
579 | ||
580 | void mm_update_next_owner(struct mm_struct *mm) | |
581 | { | |
582 | struct task_struct *c, *g, *p = current; | |
583 | ||
584 | retry: | |
585 | if (!mm_need_new_owner(mm, p)) | |
586 | return; | |
587 | ||
588 | read_lock(&tasklist_lock); | |
589 | /* | |
590 | * Search in the children | |
591 | */ | |
592 | list_for_each_entry(c, &p->children, sibling) { | |
593 | if (c->mm == mm) | |
594 | goto assign_new_owner; | |
595 | } | |
596 | ||
597 | /* | |
598 | * Search in the siblings | |
599 | */ | |
dea33cfd | 600 | list_for_each_entry(c, &p->real_parent->children, sibling) { |
cf475ad2 BS |
601 | if (c->mm == mm) |
602 | goto assign_new_owner; | |
603 | } | |
604 | ||
605 | /* | |
606 | * Search through everything else. We should not get | |
607 | * here often | |
608 | */ | |
609 | do_each_thread(g, c) { | |
610 | if (c->mm == mm) | |
611 | goto assign_new_owner; | |
612 | } while_each_thread(g, c); | |
613 | ||
614 | read_unlock(&tasklist_lock); | |
31a78f23 BS |
615 | /* |
616 | * We found no owner yet mm_users > 1: this implies that we are | |
617 | * most likely racing with swapoff (try_to_unuse()) or /proc or | |
e5991371 | 618 | * ptrace or page migration (get_task_mm()). Mark owner as NULL. |
31a78f23 | 619 | */ |
31a78f23 | 620 | mm->owner = NULL; |
cf475ad2 BS |
621 | return; |
622 | ||
623 | assign_new_owner: | |
624 | BUG_ON(c == p); | |
625 | get_task_struct(c); | |
626 | /* | |
627 | * The task_lock protects c->mm from changing. | |
628 | * We always want mm->owner->mm == mm | |
629 | */ | |
630 | task_lock(c); | |
e5991371 HD |
631 | /* |
632 | * Delay read_unlock() till we have the task_lock() | |
633 | * to ensure that c does not slip away underneath us | |
634 | */ | |
635 | read_unlock(&tasklist_lock); | |
cf475ad2 BS |
636 | if (c->mm != mm) { |
637 | task_unlock(c); | |
638 | put_task_struct(c); | |
639 | goto retry; | |
640 | } | |
cf475ad2 BS |
641 | mm->owner = c; |
642 | task_unlock(c); | |
643 | put_task_struct(c); | |
644 | } | |
645 | #endif /* CONFIG_MM_OWNER */ | |
646 | ||
1da177e4 LT |
647 | /* |
648 | * Turn us into a lazy TLB process if we | |
649 | * aren't already.. | |
650 | */ | |
408b664a | 651 | static void exit_mm(struct task_struct * tsk) |
1da177e4 LT |
652 | { |
653 | struct mm_struct *mm = tsk->mm; | |
b564daf8 | 654 | struct core_state *core_state; |
1da177e4 LT |
655 | |
656 | mm_release(tsk, mm); | |
657 | if (!mm) | |
658 | return; | |
659 | /* | |
660 | * Serialize with any possible pending coredump. | |
999d9fc1 | 661 | * We must hold mmap_sem around checking core_state |
1da177e4 | 662 | * and clearing tsk->mm. The core-inducing thread |
999d9fc1 | 663 | * will increment ->nr_threads for each thread in the |
1da177e4 LT |
664 | * group with ->mm != NULL. |
665 | */ | |
666 | down_read(&mm->mmap_sem); | |
b564daf8 ON |
667 | core_state = mm->core_state; |
668 | if (core_state) { | |
669 | struct core_thread self; | |
1da177e4 | 670 | up_read(&mm->mmap_sem); |
1da177e4 | 671 | |
b564daf8 ON |
672 | self.task = tsk; |
673 | self.next = xchg(&core_state->dumper.next, &self); | |
674 | /* | |
675 | * Implies mb(), the result of xchg() must be visible | |
676 | * to core_state->dumper. | |
677 | */ | |
678 | if (atomic_dec_and_test(&core_state->nr_threads)) | |
679 | complete(&core_state->startup); | |
1da177e4 | 680 | |
a94e2d40 ON |
681 | for (;;) { |
682 | set_task_state(tsk, TASK_UNINTERRUPTIBLE); | |
683 | if (!self.task) /* see coredump_finish() */ | |
684 | break; | |
685 | schedule(); | |
686 | } | |
687 | __set_task_state(tsk, TASK_RUNNING); | |
1da177e4 LT |
688 | down_read(&mm->mmap_sem); |
689 | } | |
690 | atomic_inc(&mm->mm_count); | |
125e1874 | 691 | BUG_ON(mm != tsk->active_mm); |
1da177e4 LT |
692 | /* more a memory barrier than a real lock */ |
693 | task_lock(tsk); | |
694 | tsk->mm = NULL; | |
695 | up_read(&mm->mmap_sem); | |
696 | enter_lazy_tlb(mm, current); | |
0c1eecfb RW |
697 | /* We don't want this task to be frozen prematurely */ |
698 | clear_freeze_flag(tsk); | |
3d5992d2 YH |
699 | if (tsk->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) |
700 | atomic_dec(&mm->oom_disable_count); | |
1da177e4 | 701 | task_unlock(tsk); |
cf475ad2 | 702 | mm_update_next_owner(mm); |
1da177e4 LT |
703 | mmput(mm); |
704 | } | |
705 | ||
1da177e4 LT |
706 | /* |
707 | * When we die, we re-parent all our children. | |
708 | * Try to give them to another thread in our thread | |
709 | * group, and if no such member exists, give it to | |
84d73786 SB |
710 | * the child reaper process (ie "init") in our pid |
711 | * space. | |
1da177e4 | 712 | */ |
950bbabb | 713 | static struct task_struct *find_new_reaper(struct task_struct *father) |
d16e15f5 NK |
714 | __releases(&tasklist_lock) |
715 | __acquires(&tasklist_lock) | |
1da177e4 | 716 | { |
950bbabb ON |
717 | struct pid_namespace *pid_ns = task_active_pid_ns(father); |
718 | struct task_struct *thread; | |
1da177e4 | 719 | |
950bbabb ON |
720 | thread = father; |
721 | while_each_thread(father, thread) { | |
722 | if (thread->flags & PF_EXITING) | |
723 | continue; | |
724 | if (unlikely(pid_ns->child_reaper == father)) | |
725 | pid_ns->child_reaper = thread; | |
726 | return thread; | |
727 | } | |
1da177e4 | 728 | |
950bbabb ON |
729 | if (unlikely(pid_ns->child_reaper == father)) { |
730 | write_unlock_irq(&tasklist_lock); | |
731 | if (unlikely(pid_ns == &init_pid_ns)) | |
732 | panic("Attempted to kill init!"); | |
1da177e4 | 733 | |
950bbabb ON |
734 | zap_pid_ns_processes(pid_ns); |
735 | write_lock_irq(&tasklist_lock); | |
1da177e4 | 736 | /* |
950bbabb ON |
737 | * We can not clear ->child_reaper or leave it alone. |
738 | * There may by stealth EXIT_DEAD tasks on ->children, | |
739 | * forget_original_parent() must move them somewhere. | |
1da177e4 | 740 | */ |
950bbabb | 741 | pid_ns->child_reaper = init_pid_ns.child_reaper; |
1da177e4 | 742 | } |
762a24be | 743 | |
950bbabb ON |
744 | return pid_ns->child_reaper; |
745 | } | |
746 | ||
5dfc80be ON |
747 | /* |
748 | * Any that need to be release_task'd are put on the @dead list. | |
749 | */ | |
9cd80bbb | 750 | static void reparent_leader(struct task_struct *father, struct task_struct *p, |
5dfc80be ON |
751 | struct list_head *dead) |
752 | { | |
5dfc80be ON |
753 | list_move_tail(&p->sibling, &p->real_parent->children); |
754 | ||
755 | if (task_detached(p)) | |
756 | return; | |
757 | /* | |
758 | * If this is a threaded reparent there is no need to | |
759 | * notify anyone anything has happened. | |
760 | */ | |
761 | if (same_thread_group(p->real_parent, father)) | |
762 | return; | |
763 | ||
764 | /* We don't want people slaying init. */ | |
765 | p->exit_signal = SIGCHLD; | |
766 | ||
767 | /* If it has exited notify the new parent about this child's death. */ | |
5cb11446 | 768 | if (!task_ptrace(p) && |
5dfc80be ON |
769 | p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) { |
770 | do_notify_parent(p, p->exit_signal); | |
771 | if (task_detached(p)) { | |
772 | p->exit_state = EXIT_DEAD; | |
773 | list_move_tail(&p->sibling, dead); | |
774 | } | |
775 | } | |
776 | ||
777 | kill_orphaned_pgrp(p, father); | |
778 | } | |
779 | ||
762a24be | 780 | static void forget_original_parent(struct task_struct *father) |
1da177e4 | 781 | { |
950bbabb | 782 | struct task_struct *p, *n, *reaper; |
5dfc80be | 783 | LIST_HEAD(dead_children); |
762a24be ON |
784 | |
785 | write_lock_irq(&tasklist_lock); | |
c7e49c14 ON |
786 | /* |
787 | * Note that exit_ptrace() and find_new_reaper() might | |
788 | * drop tasklist_lock and reacquire it. | |
789 | */ | |
790 | exit_ptrace(father); | |
950bbabb | 791 | reaper = find_new_reaper(father); |
f470021a | 792 | |
03ff1797 | 793 | list_for_each_entry_safe(p, n, &father->children, sibling) { |
9cd80bbb ON |
794 | struct task_struct *t = p; |
795 | do { | |
796 | t->real_parent = reaper; | |
797 | if (t->parent == father) { | |
798 | BUG_ON(task_ptrace(t)); | |
799 | t->parent = t->real_parent; | |
800 | } | |
801 | if (t->pdeath_signal) | |
802 | group_send_sig_info(t->pdeath_signal, | |
803 | SEND_SIG_NOINFO, t); | |
804 | } while_each_thread(p, t); | |
805 | reparent_leader(father, p, &dead_children); | |
1da177e4 | 806 | } |
762a24be | 807 | write_unlock_irq(&tasklist_lock); |
5dfc80be | 808 | |
762a24be | 809 | BUG_ON(!list_empty(&father->children)); |
762a24be | 810 | |
5dfc80be ON |
811 | list_for_each_entry_safe(p, n, &dead_children, sibling) { |
812 | list_del_init(&p->sibling); | |
39c626ae ON |
813 | release_task(p); |
814 | } | |
1da177e4 LT |
815 | } |
816 | ||
817 | /* | |
818 | * Send signals to all our closest relatives so that they know | |
819 | * to properly mourn us.. | |
820 | */ | |
821c7de7 | 821 | static void exit_notify(struct task_struct *tsk, int group_dead) |
1da177e4 | 822 | { |
2b2a1ff6 RM |
823 | int signal; |
824 | void *cookie; | |
1da177e4 | 825 | |
1da177e4 LT |
826 | /* |
827 | * This does two things: | |
828 | * | |
829 | * A. Make init inherit all the child processes | |
830 | * B. Check to see if any process groups have become orphaned | |
831 | * as a result of our exiting, and if they have any stopped | |
832 | * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2) | |
833 | */ | |
762a24be | 834 | forget_original_parent(tsk); |
2e4a7072 | 835 | exit_task_namespaces(tsk); |
1da177e4 | 836 | |
762a24be | 837 | write_lock_irq(&tasklist_lock); |
821c7de7 ON |
838 | if (group_dead) |
839 | kill_orphaned_pgrp(tsk->group_leader, NULL); | |
1da177e4 | 840 | |
24728448 | 841 | /* Let father know we died |
1da177e4 LT |
842 | * |
843 | * Thread signals are configurable, but you aren't going to use | |
d4c5e41f | 844 | * that to send signals to arbitary processes. |
1da177e4 LT |
845 | * That stops right now. |
846 | * | |
847 | * If the parent exec id doesn't match the exec id we saved | |
848 | * when we started then we know the parent has changed security | |
849 | * domain. | |
850 | * | |
851 | * If our self_exec id doesn't match our parent_exec_id then | |
852 | * we have changed execution domain as these two values started | |
853 | * the same after a fork. | |
1da177e4 | 854 | */ |
d839fd4d | 855 | if (tsk->exit_signal != SIGCHLD && !task_detached(tsk) && |
f49ee505 | 856 | (tsk->parent_exec_id != tsk->real_parent->self_exec_id || |
432870da | 857 | tsk->self_exec_id != tsk->parent_exec_id)) |
1da177e4 LT |
858 | tsk->exit_signal = SIGCHLD; |
859 | ||
2b2a1ff6 | 860 | signal = tracehook_notify_death(tsk, &cookie, group_dead); |
5c7edcd7 | 861 | if (signal >= 0) |
2b2a1ff6 | 862 | signal = do_notify_parent(tsk, signal); |
1da177e4 | 863 | |
5c7edcd7 | 864 | tsk->exit_state = signal == DEATH_REAP ? EXIT_DEAD : EXIT_ZOMBIE; |
1da177e4 | 865 | |
9c339168 ON |
866 | /* mt-exec, de_thread() is waiting for group leader */ |
867 | if (unlikely(tsk->signal->notify_count < 0)) | |
6db840fa | 868 | wake_up_process(tsk->signal->group_exit_task); |
1da177e4 LT |
869 | write_unlock_irq(&tasklist_lock); |
870 | ||
2b2a1ff6 RM |
871 | tracehook_report_death(tsk, signal, cookie, group_dead); |
872 | ||
1da177e4 | 873 | /* If the process is dead, release it - nobody will wait for it */ |
5c7edcd7 | 874 | if (signal == DEATH_REAP) |
1da177e4 | 875 | release_task(tsk); |
1da177e4 LT |
876 | } |
877 | ||
e18eecb8 JD |
878 | #ifdef CONFIG_DEBUG_STACK_USAGE |
879 | static void check_stack_usage(void) | |
880 | { | |
881 | static DEFINE_SPINLOCK(low_water_lock); | |
882 | static int lowest_to_date = THREAD_SIZE; | |
e18eecb8 JD |
883 | unsigned long free; |
884 | ||
7c9f8861 | 885 | free = stack_not_used(current); |
e18eecb8 JD |
886 | |
887 | if (free >= lowest_to_date) | |
888 | return; | |
889 | ||
890 | spin_lock(&low_water_lock); | |
891 | if (free < lowest_to_date) { | |
892 | printk(KERN_WARNING "%s used greatest stack depth: %lu bytes " | |
893 | "left\n", | |
894 | current->comm, free); | |
895 | lowest_to_date = free; | |
896 | } | |
897 | spin_unlock(&low_water_lock); | |
898 | } | |
899 | #else | |
900 | static inline void check_stack_usage(void) {} | |
901 | #endif | |
902 | ||
7ad5b3a5 | 903 | NORET_TYPE void do_exit(long code) |
1da177e4 LT |
904 | { |
905 | struct task_struct *tsk = current; | |
906 | int group_dead; | |
907 | ||
908 | profile_task_exit(tsk); | |
909 | ||
22e2c507 JA |
910 | WARN_ON(atomic_read(&tsk->fs_excl)); |
911 | ||
1da177e4 LT |
912 | if (unlikely(in_interrupt())) |
913 | panic("Aiee, killing interrupt handler!"); | |
914 | if (unlikely(!tsk->pid)) | |
915 | panic("Attempted to kill the idle task!"); | |
1da177e4 | 916 | |
33dd94ae NE |
917 | /* |
918 | * If do_exit is called because this processes oopsed, it's possible | |
919 | * that get_fs() was left as KERNEL_DS, so reset it to USER_DS before | |
920 | * continuing. Amongst other possible reasons, this is to prevent | |
921 | * mm_release()->clear_child_tid() from writing to a user-controlled | |
922 | * kernel address. | |
923 | */ | |
924 | set_fs(USER_DS); | |
925 | ||
30199f5a | 926 | tracehook_report_exit(&code); |
1da177e4 | 927 | |
e0e81739 DH |
928 | validate_creds_for_do_exit(tsk); |
929 | ||
df164db5 AN |
930 | /* |
931 | * We're taking recursive faults here in do_exit. Safest is to just | |
932 | * leave this task alone and wait for reboot. | |
933 | */ | |
934 | if (unlikely(tsk->flags & PF_EXITING)) { | |
935 | printk(KERN_ALERT | |
936 | "Fixing recursive fault but reboot is needed!\n"); | |
778e9a9c AK |
937 | /* |
938 | * We can do this unlocked here. The futex code uses | |
939 | * this flag just to verify whether the pi state | |
940 | * cleanup has been done or not. In the worst case it | |
941 | * loops once more. We pretend that the cleanup was | |
942 | * done as there is no way to return. Either the | |
943 | * OWNER_DIED bit is set by now or we push the blocked | |
944 | * task into the wait for ever nirwana as well. | |
945 | */ | |
946 | tsk->flags |= PF_EXITPIDONE; | |
df164db5 AN |
947 | set_current_state(TASK_UNINTERRUPTIBLE); |
948 | schedule(); | |
949 | } | |
950 | ||
3aa551c9 TG |
951 | exit_irq_thread(); |
952 | ||
d12619b5 | 953 | exit_signals(tsk); /* sets PF_EXITING */ |
778e9a9c AK |
954 | /* |
955 | * tsk->flags are checked in the futex code to protect against | |
956 | * an exiting task cleaning up the robust pi futexes. | |
957 | */ | |
d2ee7198 | 958 | smp_mb(); |
1d615482 | 959 | raw_spin_unlock_wait(&tsk->pi_lock); |
1da177e4 | 960 | |
1da177e4 LT |
961 | if (unlikely(in_atomic())) |
962 | printk(KERN_INFO "note: %s[%d] exited with preempt_count %d\n", | |
ba25f9dc | 963 | current->comm, task_pid_nr(current), |
1da177e4 LT |
964 | preempt_count()); |
965 | ||
966 | acct_update_integrals(tsk); | |
34e55232 | 967 | /* sync mm's RSS info before statistics gathering */ |
a3a2e76c KH |
968 | if (tsk->mm) |
969 | sync_mm_rss(tsk, tsk->mm); | |
1da177e4 | 970 | group_dead = atomic_dec_and_test(&tsk->signal->live); |
c3068951 | 971 | if (group_dead) { |
778e9a9c | 972 | hrtimer_cancel(&tsk->signal->real_timer); |
25f407f0 | 973 | exit_itimers(tsk->signal); |
1f10206c JP |
974 | if (tsk->mm) |
975 | setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm); | |
c3068951 | 976 | } |
f6ec29a4 | 977 | acct_collect(code, group_dead); |
522ed776 MT |
978 | if (group_dead) |
979 | tty_audit_exit(); | |
fa84cb93 AV |
980 | if (unlikely(tsk->audit_context)) |
981 | audit_free(tsk); | |
115085ea | 982 | |
f2ab6d88 | 983 | tsk->exit_code = code; |
115085ea | 984 | taskstats_exit(tsk, group_dead); |
c757249a | 985 | |
1da177e4 LT |
986 | exit_mm(tsk); |
987 | ||
0e464814 | 988 | if (group_dead) |
f6ec29a4 | 989 | acct_process(); |
0a16b607 MD |
990 | trace_sched_process_exit(tsk); |
991 | ||
1da177e4 | 992 | exit_sem(tsk); |
1ec7f1dd AV |
993 | exit_files(tsk); |
994 | exit_fs(tsk); | |
e18eecb8 | 995 | check_stack_usage(); |
1da177e4 | 996 | exit_thread(); |
0b3fcf17 SE |
997 | |
998 | /* | |
999 | * Flush inherited counters to the parent - before the parent | |
1000 | * gets woken up by child-exit notifications. | |
1001 | * | |
1002 | * because of cgroup mode, must be called before cgroup_exit() | |
1003 | */ | |
1004 | perf_event_exit_task(tsk); | |
1005 | ||
b4f48b63 | 1006 | cgroup_exit(tsk, 1); |
1da177e4 | 1007 | |
5ec93d11 | 1008 | if (group_dead) |
1da177e4 LT |
1009 | disassociate_ctty(1); |
1010 | ||
a1261f54 | 1011 | module_put(task_thread_info(tsk)->exec_domain->module); |
1da177e4 | 1012 | |
9f46080c | 1013 | proc_exit_connector(tsk); |
33b2fb30 | 1014 | |
24f1e32c FW |
1015 | /* |
1016 | * FIXME: do that only when needed, using sched_exit tracepoint | |
1017 | */ | |
1018 | flush_ptrace_hw_breakpoint(tsk); | |
33b2fb30 | 1019 | |
821c7de7 | 1020 | exit_notify(tsk, group_dead); |
1da177e4 | 1021 | #ifdef CONFIG_NUMA |
c0ff7453 | 1022 | task_lock(tsk); |
f0be3d32 | 1023 | mpol_put(tsk->mempolicy); |
1da177e4 | 1024 | tsk->mempolicy = NULL; |
c0ff7453 | 1025 | task_unlock(tsk); |
1da177e4 | 1026 | #endif |
42b2dd0a | 1027 | #ifdef CONFIG_FUTEX |
c87e2837 IM |
1028 | if (unlikely(current->pi_state_cache)) |
1029 | kfree(current->pi_state_cache); | |
42b2dd0a | 1030 | #endif |
de5097c2 | 1031 | /* |
9a11b49a | 1032 | * Make sure we are holding no locks: |
de5097c2 | 1033 | */ |
9a11b49a | 1034 | debug_check_no_locks_held(tsk); |
778e9a9c AK |
1035 | /* |
1036 | * We can do this unlocked here. The futex code uses this flag | |
1037 | * just to verify whether the pi state cleanup has been done | |
1038 | * or not. In the worst case it loops once more. | |
1039 | */ | |
1040 | tsk->flags |= PF_EXITPIDONE; | |
1da177e4 | 1041 | |
afc847b7 | 1042 | if (tsk->io_context) |
b69f2292 | 1043 | exit_io_context(tsk); |
afc847b7 | 1044 | |
b92ce558 JA |
1045 | if (tsk->splice_pipe) |
1046 | __free_pipe_info(tsk->splice_pipe); | |
1047 | ||
e0e81739 DH |
1048 | validate_creds_for_do_exit(tsk); |
1049 | ||
7407251a | 1050 | preempt_disable(); |
f41d911f | 1051 | exit_rcu(); |
55a101f8 | 1052 | /* causes final put_task_struct in finish_task_switch(). */ |
c394cc9f | 1053 | tsk->state = TASK_DEAD; |
1da177e4 LT |
1054 | schedule(); |
1055 | BUG(); | |
1056 | /* Avoid "noreturn function does return". */ | |
54306cf0 AC |
1057 | for (;;) |
1058 | cpu_relax(); /* For when BUG is null */ | |
1da177e4 LT |
1059 | } |
1060 | ||
012914da RA |
1061 | EXPORT_SYMBOL_GPL(do_exit); |
1062 | ||
1da177e4 LT |
1063 | NORET_TYPE void complete_and_exit(struct completion *comp, long code) |
1064 | { | |
1065 | if (comp) | |
1066 | complete(comp); | |
55a101f8 | 1067 | |
1da177e4 LT |
1068 | do_exit(code); |
1069 | } | |
1070 | ||
1071 | EXPORT_SYMBOL(complete_and_exit); | |
1072 | ||
754fe8d2 | 1073 | SYSCALL_DEFINE1(exit, int, error_code) |
1da177e4 LT |
1074 | { |
1075 | do_exit((error_code&0xff)<<8); | |
1076 | } | |
1077 | ||
1da177e4 LT |
1078 | /* |
1079 | * Take down every thread in the group. This is called by fatal signals | |
1080 | * as well as by sys_exit_group (below). | |
1081 | */ | |
1082 | NORET_TYPE void | |
1083 | do_group_exit(int exit_code) | |
1084 | { | |
bfc4b089 ON |
1085 | struct signal_struct *sig = current->signal; |
1086 | ||
1da177e4 LT |
1087 | BUG_ON(exit_code & 0x80); /* core dumps don't get here */ |
1088 | ||
bfc4b089 ON |
1089 | if (signal_group_exit(sig)) |
1090 | exit_code = sig->group_exit_code; | |
1da177e4 | 1091 | else if (!thread_group_empty(current)) { |
1da177e4 | 1092 | struct sighand_struct *const sighand = current->sighand; |
1da177e4 | 1093 | spin_lock_irq(&sighand->siglock); |
ed5d2cac | 1094 | if (signal_group_exit(sig)) |
1da177e4 LT |
1095 | /* Another thread got here before we took the lock. */ |
1096 | exit_code = sig->group_exit_code; | |
1097 | else { | |
1da177e4 | 1098 | sig->group_exit_code = exit_code; |
ed5d2cac | 1099 | sig->flags = SIGNAL_GROUP_EXIT; |
1da177e4 LT |
1100 | zap_other_threads(current); |
1101 | } | |
1102 | spin_unlock_irq(&sighand->siglock); | |
1da177e4 LT |
1103 | } |
1104 | ||
1105 | do_exit(exit_code); | |
1106 | /* NOTREACHED */ | |
1107 | } | |
1108 | ||
1109 | /* | |
1110 | * this kills every thread in the thread group. Note that any externally | |
1111 | * wait4()-ing process will get the correct exit code - even if this | |
1112 | * thread is not the thread group leader. | |
1113 | */ | |
754fe8d2 | 1114 | SYSCALL_DEFINE1(exit_group, int, error_code) |
1da177e4 LT |
1115 | { |
1116 | do_group_exit((error_code & 0xff) << 8); | |
2ed7c03e HC |
1117 | /* NOTREACHED */ |
1118 | return 0; | |
1da177e4 LT |
1119 | } |
1120 | ||
9e8ae01d ON |
1121 | struct wait_opts { |
1122 | enum pid_type wo_type; | |
9e8ae01d | 1123 | int wo_flags; |
e1eb1ebc | 1124 | struct pid *wo_pid; |
9e8ae01d ON |
1125 | |
1126 | struct siginfo __user *wo_info; | |
1127 | int __user *wo_stat; | |
1128 | struct rusage __user *wo_rusage; | |
1129 | ||
0b7570e7 | 1130 | wait_queue_t child_wait; |
9e8ae01d ON |
1131 | int notask_error; |
1132 | }; | |
1133 | ||
989264f4 ON |
1134 | static inline |
1135 | struct pid *task_pid_type(struct task_struct *task, enum pid_type type) | |
161550d7 | 1136 | { |
989264f4 ON |
1137 | if (type != PIDTYPE_PID) |
1138 | task = task->group_leader; | |
1139 | return task->pids[type].pid; | |
161550d7 EB |
1140 | } |
1141 | ||
989264f4 | 1142 | static int eligible_pid(struct wait_opts *wo, struct task_struct *p) |
1da177e4 | 1143 | { |
5c01ba49 ON |
1144 | return wo->wo_type == PIDTYPE_MAX || |
1145 | task_pid_type(p, wo->wo_type) == wo->wo_pid; | |
1146 | } | |
1da177e4 | 1147 | |
5c01ba49 ON |
1148 | static int eligible_child(struct wait_opts *wo, struct task_struct *p) |
1149 | { | |
1150 | if (!eligible_pid(wo, p)) | |
1151 | return 0; | |
1da177e4 LT |
1152 | /* Wait for all children (clone and not) if __WALL is set; |
1153 | * otherwise, wait for clone children *only* if __WCLONE is | |
1154 | * set; otherwise, wait for non-clone children *only*. (Note: | |
1155 | * A "clone" child here is one that reports to its parent | |
1156 | * using a signal other than SIGCHLD.) */ | |
9e8ae01d ON |
1157 | if (((p->exit_signal != SIGCHLD) ^ !!(wo->wo_flags & __WCLONE)) |
1158 | && !(wo->wo_flags & __WALL)) | |
1da177e4 | 1159 | return 0; |
1da177e4 | 1160 | |
14dd0b81 | 1161 | return 1; |
1da177e4 LT |
1162 | } |
1163 | ||
9e8ae01d ON |
1164 | static int wait_noreap_copyout(struct wait_opts *wo, struct task_struct *p, |
1165 | pid_t pid, uid_t uid, int why, int status) | |
1da177e4 | 1166 | { |
9e8ae01d ON |
1167 | struct siginfo __user *infop; |
1168 | int retval = wo->wo_rusage | |
1169 | ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0; | |
36c8b586 | 1170 | |
1da177e4 | 1171 | put_task_struct(p); |
9e8ae01d | 1172 | infop = wo->wo_info; |
b6fe2d11 VM |
1173 | if (infop) { |
1174 | if (!retval) | |
1175 | retval = put_user(SIGCHLD, &infop->si_signo); | |
1176 | if (!retval) | |
1177 | retval = put_user(0, &infop->si_errno); | |
1178 | if (!retval) | |
1179 | retval = put_user((short)why, &infop->si_code); | |
1180 | if (!retval) | |
1181 | retval = put_user(pid, &infop->si_pid); | |
1182 | if (!retval) | |
1183 | retval = put_user(uid, &infop->si_uid); | |
1184 | if (!retval) | |
1185 | retval = put_user(status, &infop->si_status); | |
1186 | } | |
1da177e4 LT |
1187 | if (!retval) |
1188 | retval = pid; | |
1189 | return retval; | |
1190 | } | |
1191 | ||
1192 | /* | |
1193 | * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold | |
1194 | * read_lock(&tasklist_lock) on entry. If we return zero, we still hold | |
1195 | * the lock and this task is uninteresting. If we return nonzero, we have | |
1196 | * released the lock and the system call should return. | |
1197 | */ | |
9e8ae01d | 1198 | static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p) |
1da177e4 LT |
1199 | { |
1200 | unsigned long state; | |
2f4e6e2a | 1201 | int retval, status, traced; |
6c5f3e7b | 1202 | pid_t pid = task_pid_vnr(p); |
c69e8d9c | 1203 | uid_t uid = __task_cred(p)->uid; |
9e8ae01d | 1204 | struct siginfo __user *infop; |
1da177e4 | 1205 | |
9e8ae01d | 1206 | if (!likely(wo->wo_flags & WEXITED)) |
98abed02 RM |
1207 | return 0; |
1208 | ||
9e8ae01d | 1209 | if (unlikely(wo->wo_flags & WNOWAIT)) { |
1da177e4 | 1210 | int exit_code = p->exit_code; |
f3abd4f9 | 1211 | int why; |
1da177e4 | 1212 | |
1da177e4 LT |
1213 | get_task_struct(p); |
1214 | read_unlock(&tasklist_lock); | |
1215 | if ((exit_code & 0x7f) == 0) { | |
1216 | why = CLD_EXITED; | |
1217 | status = exit_code >> 8; | |
1218 | } else { | |
1219 | why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED; | |
1220 | status = exit_code & 0x7f; | |
1221 | } | |
9e8ae01d | 1222 | return wait_noreap_copyout(wo, p, pid, uid, why, status); |
1da177e4 LT |
1223 | } |
1224 | ||
1225 | /* | |
1226 | * Try to move the task's state to DEAD | |
1227 | * only one thread is allowed to do this: | |
1228 | */ | |
1229 | state = xchg(&p->exit_state, EXIT_DEAD); | |
1230 | if (state != EXIT_ZOMBIE) { | |
1231 | BUG_ON(state != EXIT_DEAD); | |
1232 | return 0; | |
1233 | } | |
1da177e4 | 1234 | |
53b6f9fb | 1235 | traced = ptrace_reparented(p); |
befca967 ON |
1236 | /* |
1237 | * It can be ptraced but not reparented, check | |
1238 | * !task_detached() to filter out sub-threads. | |
1239 | */ | |
1240 | if (likely(!traced) && likely(!task_detached(p))) { | |
3795e161 JJ |
1241 | struct signal_struct *psig; |
1242 | struct signal_struct *sig; | |
1f10206c | 1243 | unsigned long maxrss; |
0cf55e1e | 1244 | cputime_t tgutime, tgstime; |
3795e161 | 1245 | |
1da177e4 LT |
1246 | /* |
1247 | * The resource counters for the group leader are in its | |
1248 | * own task_struct. Those for dead threads in the group | |
1249 | * are in its signal_struct, as are those for the child | |
1250 | * processes it has previously reaped. All these | |
1251 | * accumulate in the parent's signal_struct c* fields. | |
1252 | * | |
1253 | * We don't bother to take a lock here to protect these | |
1254 | * p->signal fields, because they are only touched by | |
1255 | * __exit_signal, which runs with tasklist_lock | |
1256 | * write-locked anyway, and so is excluded here. We do | |
d1e98f42 | 1257 | * need to protect the access to parent->signal fields, |
1da177e4 LT |
1258 | * as other threads in the parent group can be right |
1259 | * here reaping other children at the same time. | |
0cf55e1e HS |
1260 | * |
1261 | * We use thread_group_times() to get times for the thread | |
1262 | * group, which consolidates times for all threads in the | |
1263 | * group including the group leader. | |
1da177e4 | 1264 | */ |
0cf55e1e | 1265 | thread_group_times(p, &tgutime, &tgstime); |
d1e98f42 ON |
1266 | spin_lock_irq(&p->real_parent->sighand->siglock); |
1267 | psig = p->real_parent->signal; | |
3795e161 JJ |
1268 | sig = p->signal; |
1269 | psig->cutime = | |
1270 | cputime_add(psig->cutime, | |
0cf55e1e HS |
1271 | cputime_add(tgutime, |
1272 | sig->cutime)); | |
3795e161 JJ |
1273 | psig->cstime = |
1274 | cputime_add(psig->cstime, | |
0cf55e1e HS |
1275 | cputime_add(tgstime, |
1276 | sig->cstime)); | |
9ac52315 LV |
1277 | psig->cgtime = |
1278 | cputime_add(psig->cgtime, | |
1279 | cputime_add(p->gtime, | |
1280 | cputime_add(sig->gtime, | |
1281 | sig->cgtime))); | |
3795e161 JJ |
1282 | psig->cmin_flt += |
1283 | p->min_flt + sig->min_flt + sig->cmin_flt; | |
1284 | psig->cmaj_flt += | |
1285 | p->maj_flt + sig->maj_flt + sig->cmaj_flt; | |
1286 | psig->cnvcsw += | |
1287 | p->nvcsw + sig->nvcsw + sig->cnvcsw; | |
1288 | psig->cnivcsw += | |
1289 | p->nivcsw + sig->nivcsw + sig->cnivcsw; | |
6eaeeaba ED |
1290 | psig->cinblock += |
1291 | task_io_get_inblock(p) + | |
1292 | sig->inblock + sig->cinblock; | |
1293 | psig->coublock += | |
1294 | task_io_get_oublock(p) + | |
1295 | sig->oublock + sig->coublock; | |
1f10206c JP |
1296 | maxrss = max(sig->maxrss, sig->cmaxrss); |
1297 | if (psig->cmaxrss < maxrss) | |
1298 | psig->cmaxrss = maxrss; | |
5995477a AR |
1299 | task_io_accounting_add(&psig->ioac, &p->ioac); |
1300 | task_io_accounting_add(&psig->ioac, &sig->ioac); | |
d1e98f42 | 1301 | spin_unlock_irq(&p->real_parent->sighand->siglock); |
1da177e4 LT |
1302 | } |
1303 | ||
1304 | /* | |
1305 | * Now we are sure this task is interesting, and no other | |
1306 | * thread can reap it because we set its state to EXIT_DEAD. | |
1307 | */ | |
1308 | read_unlock(&tasklist_lock); | |
1309 | ||
9e8ae01d ON |
1310 | retval = wo->wo_rusage |
1311 | ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0; | |
1da177e4 LT |
1312 | status = (p->signal->flags & SIGNAL_GROUP_EXIT) |
1313 | ? p->signal->group_exit_code : p->exit_code; | |
9e8ae01d ON |
1314 | if (!retval && wo->wo_stat) |
1315 | retval = put_user(status, wo->wo_stat); | |
1316 | ||
1317 | infop = wo->wo_info; | |
1da177e4 LT |
1318 | if (!retval && infop) |
1319 | retval = put_user(SIGCHLD, &infop->si_signo); | |
1320 | if (!retval && infop) | |
1321 | retval = put_user(0, &infop->si_errno); | |
1322 | if (!retval && infop) { | |
1323 | int why; | |
1324 | ||
1325 | if ((status & 0x7f) == 0) { | |
1326 | why = CLD_EXITED; | |
1327 | status >>= 8; | |
1328 | } else { | |
1329 | why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED; | |
1330 | status &= 0x7f; | |
1331 | } | |
1332 | retval = put_user((short)why, &infop->si_code); | |
1333 | if (!retval) | |
1334 | retval = put_user(status, &infop->si_status); | |
1335 | } | |
1336 | if (!retval && infop) | |
3a515e4a | 1337 | retval = put_user(pid, &infop->si_pid); |
1da177e4 | 1338 | if (!retval && infop) |
c69e8d9c | 1339 | retval = put_user(uid, &infop->si_uid); |
2f4e6e2a | 1340 | if (!retval) |
3a515e4a | 1341 | retval = pid; |
2f4e6e2a ON |
1342 | |
1343 | if (traced) { | |
1da177e4 | 1344 | write_lock_irq(&tasklist_lock); |
2f4e6e2a ON |
1345 | /* We dropped tasklist, ptracer could die and untrace */ |
1346 | ptrace_unlink(p); | |
1347 | /* | |
1348 | * If this is not a detached task, notify the parent. | |
1349 | * If it's still not detached after that, don't release | |
1350 | * it now. | |
1351 | */ | |
d839fd4d | 1352 | if (!task_detached(p)) { |
2f4e6e2a | 1353 | do_notify_parent(p, p->exit_signal); |
d839fd4d | 1354 | if (!task_detached(p)) { |
2f4e6e2a ON |
1355 | p->exit_state = EXIT_ZOMBIE; |
1356 | p = NULL; | |
1da177e4 LT |
1357 | } |
1358 | } | |
1359 | write_unlock_irq(&tasklist_lock); | |
1360 | } | |
1361 | if (p != NULL) | |
1362 | release_task(p); | |
2f4e6e2a | 1363 | |
1da177e4 LT |
1364 | return retval; |
1365 | } | |
1366 | ||
90bc8d8b ON |
1367 | static int *task_stopped_code(struct task_struct *p, bool ptrace) |
1368 | { | |
1369 | if (ptrace) { | |
1370 | if (task_is_stopped_or_traced(p)) | |
1371 | return &p->exit_code; | |
1372 | } else { | |
1373 | if (p->signal->flags & SIGNAL_STOP_STOPPED) | |
1374 | return &p->signal->group_exit_code; | |
1375 | } | |
1376 | return NULL; | |
1377 | } | |
1378 | ||
1da177e4 LT |
1379 | /* |
1380 | * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold | |
1381 | * read_lock(&tasklist_lock) on entry. If we return zero, we still hold | |
1382 | * the lock and this task is uninteresting. If we return nonzero, we have | |
1383 | * released the lock and the system call should return. | |
1384 | */ | |
9e8ae01d ON |
1385 | static int wait_task_stopped(struct wait_opts *wo, |
1386 | int ptrace, struct task_struct *p) | |
1da177e4 | 1387 | { |
9e8ae01d | 1388 | struct siginfo __user *infop; |
90bc8d8b | 1389 | int retval, exit_code, *p_code, why; |
ee7c82da | 1390 | uid_t uid = 0; /* unneeded, required by compiler */ |
c8950783 | 1391 | pid_t pid; |
1da177e4 | 1392 | |
47918025 ON |
1393 | /* |
1394 | * Traditionally we see ptrace'd stopped tasks regardless of options. | |
1395 | */ | |
9e8ae01d | 1396 | if (!ptrace && !(wo->wo_flags & WUNTRACED)) |
98abed02 RM |
1397 | return 0; |
1398 | ||
ee7c82da ON |
1399 | exit_code = 0; |
1400 | spin_lock_irq(&p->sighand->siglock); | |
1401 | ||
90bc8d8b ON |
1402 | p_code = task_stopped_code(p, ptrace); |
1403 | if (unlikely(!p_code)) | |
ee7c82da ON |
1404 | goto unlock_sig; |
1405 | ||
90bc8d8b | 1406 | exit_code = *p_code; |
ee7c82da ON |
1407 | if (!exit_code) |
1408 | goto unlock_sig; | |
1409 | ||
9e8ae01d | 1410 | if (!unlikely(wo->wo_flags & WNOWAIT)) |
90bc8d8b | 1411 | *p_code = 0; |
ee7c82da | 1412 | |
f362b732 | 1413 | uid = task_uid(p); |
ee7c82da ON |
1414 | unlock_sig: |
1415 | spin_unlock_irq(&p->sighand->siglock); | |
1416 | if (!exit_code) | |
1da177e4 LT |
1417 | return 0; |
1418 | ||
1419 | /* | |
1420 | * Now we are pretty sure this task is interesting. | |
1421 | * Make sure it doesn't get reaped out from under us while we | |
1422 | * give up the lock and then examine it below. We don't want to | |
1423 | * keep holding onto the tasklist_lock while we call getrusage and | |
1424 | * possibly take page faults for user memory. | |
1425 | */ | |
1426 | get_task_struct(p); | |
6c5f3e7b | 1427 | pid = task_pid_vnr(p); |
f470021a | 1428 | why = ptrace ? CLD_TRAPPED : CLD_STOPPED; |
1da177e4 LT |
1429 | read_unlock(&tasklist_lock); |
1430 | ||
9e8ae01d ON |
1431 | if (unlikely(wo->wo_flags & WNOWAIT)) |
1432 | return wait_noreap_copyout(wo, p, pid, uid, why, exit_code); | |
1433 | ||
1434 | retval = wo->wo_rusage | |
1435 | ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0; | |
1436 | if (!retval && wo->wo_stat) | |
1437 | retval = put_user((exit_code << 8) | 0x7f, wo->wo_stat); | |
1da177e4 | 1438 | |
9e8ae01d | 1439 | infop = wo->wo_info; |
1da177e4 LT |
1440 | if (!retval && infop) |
1441 | retval = put_user(SIGCHLD, &infop->si_signo); | |
1442 | if (!retval && infop) | |
1443 | retval = put_user(0, &infop->si_errno); | |
1444 | if (!retval && infop) | |
6efcae46 | 1445 | retval = put_user((short)why, &infop->si_code); |
1da177e4 LT |
1446 | if (!retval && infop) |
1447 | retval = put_user(exit_code, &infop->si_status); | |
1448 | if (!retval && infop) | |
c8950783 | 1449 | retval = put_user(pid, &infop->si_pid); |
1da177e4 | 1450 | if (!retval && infop) |
ee7c82da | 1451 | retval = put_user(uid, &infop->si_uid); |
1da177e4 | 1452 | if (!retval) |
c8950783 | 1453 | retval = pid; |
1da177e4 LT |
1454 | put_task_struct(p); |
1455 | ||
1456 | BUG_ON(!retval); | |
1457 | return retval; | |
1458 | } | |
1459 | ||
1460 | /* | |
1461 | * Handle do_wait work for one task in a live, non-stopped state. | |
1462 | * read_lock(&tasklist_lock) on entry. If we return zero, we still hold | |
1463 | * the lock and this task is uninteresting. If we return nonzero, we have | |
1464 | * released the lock and the system call should return. | |
1465 | */ | |
9e8ae01d | 1466 | static int wait_task_continued(struct wait_opts *wo, struct task_struct *p) |
1da177e4 LT |
1467 | { |
1468 | int retval; | |
1469 | pid_t pid; | |
1470 | uid_t uid; | |
1471 | ||
9e8ae01d | 1472 | if (!unlikely(wo->wo_flags & WCONTINUED)) |
98abed02 RM |
1473 | return 0; |
1474 | ||
1da177e4 LT |
1475 | if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) |
1476 | return 0; | |
1477 | ||
1478 | spin_lock_irq(&p->sighand->siglock); | |
1479 | /* Re-check with the lock held. */ | |
1480 | if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) { | |
1481 | spin_unlock_irq(&p->sighand->siglock); | |
1482 | return 0; | |
1483 | } | |
9e8ae01d | 1484 | if (!unlikely(wo->wo_flags & WNOWAIT)) |
1da177e4 | 1485 | p->signal->flags &= ~SIGNAL_STOP_CONTINUED; |
f362b732 | 1486 | uid = task_uid(p); |
1da177e4 LT |
1487 | spin_unlock_irq(&p->sighand->siglock); |
1488 | ||
6c5f3e7b | 1489 | pid = task_pid_vnr(p); |
1da177e4 LT |
1490 | get_task_struct(p); |
1491 | read_unlock(&tasklist_lock); | |
1492 | ||
9e8ae01d ON |
1493 | if (!wo->wo_info) { |
1494 | retval = wo->wo_rusage | |
1495 | ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0; | |
1da177e4 | 1496 | put_task_struct(p); |
9e8ae01d ON |
1497 | if (!retval && wo->wo_stat) |
1498 | retval = put_user(0xffff, wo->wo_stat); | |
1da177e4 | 1499 | if (!retval) |
3a515e4a | 1500 | retval = pid; |
1da177e4 | 1501 | } else { |
9e8ae01d ON |
1502 | retval = wait_noreap_copyout(wo, p, pid, uid, |
1503 | CLD_CONTINUED, SIGCONT); | |
1da177e4 LT |
1504 | BUG_ON(retval == 0); |
1505 | } | |
1506 | ||
1507 | return retval; | |
1508 | } | |
1509 | ||
98abed02 RM |
1510 | /* |
1511 | * Consider @p for a wait by @parent. | |
1512 | * | |
9e8ae01d | 1513 | * -ECHILD should be in ->notask_error before the first call. |
98abed02 RM |
1514 | * Returns nonzero for a final return, when we have unlocked tasklist_lock. |
1515 | * Returns zero if the search for a child should continue; | |
9e8ae01d | 1516 | * then ->notask_error is 0 if @p is an eligible child, |
14dd0b81 | 1517 | * or another error from security_task_wait(), or still -ECHILD. |
98abed02 | 1518 | */ |
b6e763f0 ON |
1519 | static int wait_consider_task(struct wait_opts *wo, int ptrace, |
1520 | struct task_struct *p) | |
98abed02 | 1521 | { |
9e8ae01d | 1522 | int ret = eligible_child(wo, p); |
14dd0b81 | 1523 | if (!ret) |
98abed02 RM |
1524 | return ret; |
1525 | ||
a2322e1d | 1526 | ret = security_task_wait(p); |
14dd0b81 RM |
1527 | if (unlikely(ret < 0)) { |
1528 | /* | |
1529 | * If we have not yet seen any eligible child, | |
1530 | * then let this error code replace -ECHILD. | |
1531 | * A permission error will give the user a clue | |
1532 | * to look for security policy problems, rather | |
1533 | * than for mysterious wait bugs. | |
1534 | */ | |
9e8ae01d ON |
1535 | if (wo->notask_error) |
1536 | wo->notask_error = ret; | |
78a3d9d5 | 1537 | return 0; |
14dd0b81 RM |
1538 | } |
1539 | ||
5cb11446 | 1540 | if (likely(!ptrace) && unlikely(task_ptrace(p))) { |
f470021a RM |
1541 | /* |
1542 | * This child is hidden by ptrace. | |
1543 | * We aren't allowed to see it now, but eventually we will. | |
1544 | */ | |
9e8ae01d | 1545 | wo->notask_error = 0; |
f470021a RM |
1546 | return 0; |
1547 | } | |
1548 | ||
98abed02 RM |
1549 | if (p->exit_state == EXIT_DEAD) |
1550 | return 0; | |
1551 | ||
1552 | /* | |
1553 | * We don't reap group leaders with subthreads. | |
1554 | */ | |
1555 | if (p->exit_state == EXIT_ZOMBIE && !delay_group_leader(p)) | |
9e8ae01d | 1556 | return wait_task_zombie(wo, p); |
98abed02 RM |
1557 | |
1558 | /* | |
1559 | * It's stopped or running now, so it might | |
1560 | * later continue, exit, or stop again. | |
1561 | */ | |
9e8ae01d | 1562 | wo->notask_error = 0; |
98abed02 | 1563 | |
90bc8d8b | 1564 | if (task_stopped_code(p, ptrace)) |
9e8ae01d | 1565 | return wait_task_stopped(wo, ptrace, p); |
98abed02 | 1566 | |
9e8ae01d | 1567 | return wait_task_continued(wo, p); |
98abed02 RM |
1568 | } |
1569 | ||
1570 | /* | |
1571 | * Do the work of do_wait() for one thread in the group, @tsk. | |
1572 | * | |
9e8ae01d | 1573 | * -ECHILD should be in ->notask_error before the first call. |
98abed02 RM |
1574 | * Returns nonzero for a final return, when we have unlocked tasklist_lock. |
1575 | * Returns zero if the search for a child should continue; then | |
9e8ae01d | 1576 | * ->notask_error is 0 if there were any eligible children, |
14dd0b81 | 1577 | * or another error from security_task_wait(), or still -ECHILD. |
98abed02 | 1578 | */ |
9e8ae01d | 1579 | static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk) |
98abed02 RM |
1580 | { |
1581 | struct task_struct *p; | |
1582 | ||
1583 | list_for_each_entry(p, &tsk->children, sibling) { | |
9cd80bbb ON |
1584 | int ret = wait_consider_task(wo, 0, p); |
1585 | if (ret) | |
1586 | return ret; | |
98abed02 RM |
1587 | } |
1588 | ||
1589 | return 0; | |
1590 | } | |
1591 | ||
9e8ae01d | 1592 | static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk) |
98abed02 RM |
1593 | { |
1594 | struct task_struct *p; | |
1595 | ||
f470021a | 1596 | list_for_each_entry(p, &tsk->ptraced, ptrace_entry) { |
b6e763f0 | 1597 | int ret = wait_consider_task(wo, 1, p); |
f470021a | 1598 | if (ret) |
98abed02 | 1599 | return ret; |
98abed02 RM |
1600 | } |
1601 | ||
1602 | return 0; | |
1603 | } | |
1604 | ||
0b7570e7 ON |
1605 | static int child_wait_callback(wait_queue_t *wait, unsigned mode, |
1606 | int sync, void *key) | |
1607 | { | |
1608 | struct wait_opts *wo = container_of(wait, struct wait_opts, | |
1609 | child_wait); | |
1610 | struct task_struct *p = key; | |
1611 | ||
5c01ba49 | 1612 | if (!eligible_pid(wo, p)) |
0b7570e7 ON |
1613 | return 0; |
1614 | ||
b4fe5182 ON |
1615 | if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent) |
1616 | return 0; | |
1617 | ||
0b7570e7 ON |
1618 | return default_wake_function(wait, mode, sync, key); |
1619 | } | |
1620 | ||
a7f0765e ON |
1621 | void __wake_up_parent(struct task_struct *p, struct task_struct *parent) |
1622 | { | |
0b7570e7 ON |
1623 | __wake_up_sync_key(&parent->signal->wait_chldexit, |
1624 | TASK_INTERRUPTIBLE, 1, p); | |
a7f0765e ON |
1625 | } |
1626 | ||
9e8ae01d | 1627 | static long do_wait(struct wait_opts *wo) |
1da177e4 | 1628 | { |
1da177e4 | 1629 | struct task_struct *tsk; |
98abed02 | 1630 | int retval; |
1da177e4 | 1631 | |
9e8ae01d | 1632 | trace_sched_process_wait(wo->wo_pid); |
0a16b607 | 1633 | |
0b7570e7 ON |
1634 | init_waitqueue_func_entry(&wo->child_wait, child_wait_callback); |
1635 | wo->child_wait.private = current; | |
1636 | add_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); | |
1da177e4 | 1637 | repeat: |
98abed02 RM |
1638 | /* |
1639 | * If there is nothing that can match our critiera just get out. | |
9e8ae01d ON |
1640 | * We will clear ->notask_error to zero if we see any child that |
1641 | * might later match our criteria, even if we are not able to reap | |
1642 | * it yet. | |
98abed02 | 1643 | */ |
64a16caf | 1644 | wo->notask_error = -ECHILD; |
9e8ae01d ON |
1645 | if ((wo->wo_type < PIDTYPE_MAX) && |
1646 | (!wo->wo_pid || hlist_empty(&wo->wo_pid->tasks[wo->wo_type]))) | |
64a16caf | 1647 | goto notask; |
161550d7 | 1648 | |
f95d39d1 | 1649 | set_current_state(TASK_INTERRUPTIBLE); |
1da177e4 LT |
1650 | read_lock(&tasklist_lock); |
1651 | tsk = current; | |
1652 | do { | |
64a16caf ON |
1653 | retval = do_wait_thread(wo, tsk); |
1654 | if (retval) | |
1655 | goto end; | |
9e8ae01d | 1656 | |
64a16caf ON |
1657 | retval = ptrace_do_wait(wo, tsk); |
1658 | if (retval) | |
98abed02 | 1659 | goto end; |
98abed02 | 1660 | |
9e8ae01d | 1661 | if (wo->wo_flags & __WNOTHREAD) |
1da177e4 | 1662 | break; |
a3f6dfb7 | 1663 | } while_each_thread(current, tsk); |
1da177e4 | 1664 | read_unlock(&tasklist_lock); |
f2cc3eb1 | 1665 | |
64a16caf | 1666 | notask: |
9e8ae01d ON |
1667 | retval = wo->notask_error; |
1668 | if (!retval && !(wo->wo_flags & WNOHANG)) { | |
1da177e4 | 1669 | retval = -ERESTARTSYS; |
98abed02 RM |
1670 | if (!signal_pending(current)) { |
1671 | schedule(); | |
1672 | goto repeat; | |
1673 | } | |
1da177e4 | 1674 | } |
1da177e4 | 1675 | end: |
f95d39d1 | 1676 | __set_current_state(TASK_RUNNING); |
0b7570e7 | 1677 | remove_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); |
1da177e4 LT |
1678 | return retval; |
1679 | } | |
1680 | ||
17da2bd9 HC |
1681 | SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *, |
1682 | infop, int, options, struct rusage __user *, ru) | |
1da177e4 | 1683 | { |
9e8ae01d | 1684 | struct wait_opts wo; |
161550d7 EB |
1685 | struct pid *pid = NULL; |
1686 | enum pid_type type; | |
1da177e4 LT |
1687 | long ret; |
1688 | ||
1689 | if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED)) | |
1690 | return -EINVAL; | |
1691 | if (!(options & (WEXITED|WSTOPPED|WCONTINUED))) | |
1692 | return -EINVAL; | |
1693 | ||
1694 | switch (which) { | |
1695 | case P_ALL: | |
161550d7 | 1696 | type = PIDTYPE_MAX; |
1da177e4 LT |
1697 | break; |
1698 | case P_PID: | |
161550d7 EB |
1699 | type = PIDTYPE_PID; |
1700 | if (upid <= 0) | |
1da177e4 LT |
1701 | return -EINVAL; |
1702 | break; | |
1703 | case P_PGID: | |
161550d7 EB |
1704 | type = PIDTYPE_PGID; |
1705 | if (upid <= 0) | |
1da177e4 | 1706 | return -EINVAL; |
1da177e4 LT |
1707 | break; |
1708 | default: | |
1709 | return -EINVAL; | |
1710 | } | |
1711 | ||
161550d7 EB |
1712 | if (type < PIDTYPE_MAX) |
1713 | pid = find_get_pid(upid); | |
9e8ae01d ON |
1714 | |
1715 | wo.wo_type = type; | |
1716 | wo.wo_pid = pid; | |
1717 | wo.wo_flags = options; | |
1718 | wo.wo_info = infop; | |
1719 | wo.wo_stat = NULL; | |
1720 | wo.wo_rusage = ru; | |
1721 | ret = do_wait(&wo); | |
dfe16dfa VM |
1722 | |
1723 | if (ret > 0) { | |
1724 | ret = 0; | |
1725 | } else if (infop) { | |
1726 | /* | |
1727 | * For a WNOHANG return, clear out all the fields | |
1728 | * we would set so the user can easily tell the | |
1729 | * difference. | |
1730 | */ | |
1731 | if (!ret) | |
1732 | ret = put_user(0, &infop->si_signo); | |
1733 | if (!ret) | |
1734 | ret = put_user(0, &infop->si_errno); | |
1735 | if (!ret) | |
1736 | ret = put_user(0, &infop->si_code); | |
1737 | if (!ret) | |
1738 | ret = put_user(0, &infop->si_pid); | |
1739 | if (!ret) | |
1740 | ret = put_user(0, &infop->si_uid); | |
1741 | if (!ret) | |
1742 | ret = put_user(0, &infop->si_status); | |
1743 | } | |
1744 | ||
161550d7 | 1745 | put_pid(pid); |
1da177e4 LT |
1746 | |
1747 | /* avoid REGPARM breakage on x86: */ | |
54a01510 | 1748 | asmlinkage_protect(5, ret, which, upid, infop, options, ru); |
1da177e4 LT |
1749 | return ret; |
1750 | } | |
1751 | ||
754fe8d2 HC |
1752 | SYSCALL_DEFINE4(wait4, pid_t, upid, int __user *, stat_addr, |
1753 | int, options, struct rusage __user *, ru) | |
1da177e4 | 1754 | { |
9e8ae01d | 1755 | struct wait_opts wo; |
161550d7 EB |
1756 | struct pid *pid = NULL; |
1757 | enum pid_type type; | |
1da177e4 LT |
1758 | long ret; |
1759 | ||
1760 | if (options & ~(WNOHANG|WUNTRACED|WCONTINUED| | |
1761 | __WNOTHREAD|__WCLONE|__WALL)) | |
1762 | return -EINVAL; | |
161550d7 EB |
1763 | |
1764 | if (upid == -1) | |
1765 | type = PIDTYPE_MAX; | |
1766 | else if (upid < 0) { | |
1767 | type = PIDTYPE_PGID; | |
1768 | pid = find_get_pid(-upid); | |
1769 | } else if (upid == 0) { | |
1770 | type = PIDTYPE_PGID; | |
2ae448ef | 1771 | pid = get_task_pid(current, PIDTYPE_PGID); |
161550d7 EB |
1772 | } else /* upid > 0 */ { |
1773 | type = PIDTYPE_PID; | |
1774 | pid = find_get_pid(upid); | |
1775 | } | |
1776 | ||
9e8ae01d ON |
1777 | wo.wo_type = type; |
1778 | wo.wo_pid = pid; | |
1779 | wo.wo_flags = options | WEXITED; | |
1780 | wo.wo_info = NULL; | |
1781 | wo.wo_stat = stat_addr; | |
1782 | wo.wo_rusage = ru; | |
1783 | ret = do_wait(&wo); | |
161550d7 | 1784 | put_pid(pid); |
1da177e4 LT |
1785 | |
1786 | /* avoid REGPARM breakage on x86: */ | |
54a01510 | 1787 | asmlinkage_protect(4, ret, upid, stat_addr, options, ru); |
1da177e4 LT |
1788 | return ret; |
1789 | } | |
1790 | ||
1791 | #ifdef __ARCH_WANT_SYS_WAITPID | |
1792 | ||
1793 | /* | |
1794 | * sys_waitpid() remains for compatibility. waitpid() should be | |
1795 | * implemented by calling sys_wait4() from libc.a. | |
1796 | */ | |
17da2bd9 | 1797 | SYSCALL_DEFINE3(waitpid, pid_t, pid, int __user *, stat_addr, int, options) |
1da177e4 LT |
1798 | { |
1799 | return sys_wait4(pid, stat_addr, options, NULL); | |
1800 | } | |
1801 | ||
1802 | #endif |