Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * linux/kernel/exit.c | |
4 | * | |
5 | * Copyright (C) 1991, 1992 Linus Torvalds | |
6 | */ | |
7 | ||
1da177e4 LT |
8 | #include <linux/mm.h> |
9 | #include <linux/slab.h> | |
4eb5aaa3 | 10 | #include <linux/sched/autogroup.h> |
6e84f315 | 11 | #include <linux/sched/mm.h> |
03441a34 | 12 | #include <linux/sched/stat.h> |
29930025 | 13 | #include <linux/sched/task.h> |
68db0cf1 | 14 | #include <linux/sched/task_stack.h> |
32ef5517 | 15 | #include <linux/sched/cputime.h> |
1da177e4 | 16 | #include <linux/interrupt.h> |
1da177e4 | 17 | #include <linux/module.h> |
c59ede7b | 18 | #include <linux/capability.h> |
1da177e4 LT |
19 | #include <linux/completion.h> |
20 | #include <linux/personality.h> | |
21 | #include <linux/tty.h> | |
da9cbc87 | 22 | #include <linux/iocontext.h> |
1da177e4 | 23 | #include <linux/key.h> |
1da177e4 LT |
24 | #include <linux/cpu.h> |
25 | #include <linux/acct.h> | |
8f0ab514 | 26 | #include <linux/tsacct_kern.h> |
1da177e4 | 27 | #include <linux/file.h> |
9f3acc31 | 28 | #include <linux/fdtable.h> |
80d26af8 | 29 | #include <linux/freezer.h> |
1da177e4 | 30 | #include <linux/binfmts.h> |
ab516013 | 31 | #include <linux/nsproxy.h> |
84d73786 | 32 | #include <linux/pid_namespace.h> |
1da177e4 LT |
33 | #include <linux/ptrace.h> |
34 | #include <linux/profile.h> | |
35 | #include <linux/mount.h> | |
36 | #include <linux/proc_fs.h> | |
49d769d5 | 37 | #include <linux/kthread.h> |
1da177e4 | 38 | #include <linux/mempolicy.h> |
c757249a | 39 | #include <linux/taskstats_kern.h> |
ca74e92b | 40 | #include <linux/delayacct.h> |
b4f48b63 | 41 | #include <linux/cgroup.h> |
1da177e4 | 42 | #include <linux/syscalls.h> |
7ed20e1a | 43 | #include <linux/signal.h> |
6a14c5c9 | 44 | #include <linux/posix-timers.h> |
9f46080c | 45 | #include <linux/cn_proc.h> |
de5097c2 | 46 | #include <linux/mutex.h> |
0771dfef | 47 | #include <linux/futex.h> |
b92ce558 | 48 | #include <linux/pipe_fs_i.h> |
fa84cb93 | 49 | #include <linux/audit.h> /* for audit_free() */ |
83cc5ed3 | 50 | #include <linux/resource.h> |
6eaeeaba | 51 | #include <linux/task_io_accounting_ops.h> |
355f841a EB |
52 | #include <linux/blkdev.h> |
53 | #include <linux/task_work.h> | |
5ad4e53b | 54 | #include <linux/fs_struct.h> |
d84f4f99 | 55 | #include <linux/init_task.h> |
cdd6c482 | 56 | #include <linux/perf_event.h> |
ad8d75ff | 57 | #include <trace/events/sched.h> |
24f1e32c | 58 | #include <linux/hw_breakpoint.h> |
3d5992d2 | 59 | #include <linux/oom.h> |
54848d73 | 60 | #include <linux/writeback.h> |
40401530 | 61 | #include <linux/shm.h> |
5c9a8750 | 62 | #include <linux/kcov.h> |
50b5e49c | 63 | #include <linux/kmsan.h> |
53d3eaa3 | 64 | #include <linux/random.h> |
8f95c90c | 65 | #include <linux/rcuwait.h> |
7e95a225 | 66 | #include <linux/compat.h> |
b1b6b5a3 | 67 | #include <linux/io_uring.h> |
670721c7 | 68 | #include <linux/kprobes.h> |
54ecbe6f | 69 | #include <linux/rethook.h> |
9db89b41 | 70 | #include <linux/sysfs.h> |
1da177e4 | 71 | |
7c0f6ba6 | 72 | #include <linux/uaccess.h> |
1da177e4 | 73 | #include <asm/unistd.h> |
1da177e4 LT |
74 | #include <asm/mmu_context.h> |
75 | ||
d4ccd54d JH |
76 | /* |
77 | * The default value should be high enough to not crash a system that randomly | |
78 | * crashes its kernel from time to time, but low enough to at least not permit | |
79 | * overflowing 32-bit refcounts or the ldsem writer count. | |
80 | */ | |
81 | static unsigned int oops_limit = 10000; | |
82 | ||
83 | #ifdef CONFIG_SYSCTL | |
84 | static struct ctl_table kern_exit_table[] = { | |
85 | { | |
86 | .procname = "oops_limit", | |
87 | .data = &oops_limit, | |
88 | .maxlen = sizeof(oops_limit), | |
89 | .mode = 0644, | |
90 | .proc_handler = proc_douintvec, | |
91 | }, | |
92 | { } | |
93 | }; | |
94 | ||
95 | static __init int kernel_exit_sysctls_init(void) | |
96 | { | |
97 | register_sysctl_init("kernel", kern_exit_table); | |
98 | return 0; | |
99 | } | |
100 | late_initcall(kernel_exit_sysctls_init); | |
101 | #endif | |
102 | ||
9db89b41 KC |
103 | static atomic_t oops_count = ATOMIC_INIT(0); |
104 | ||
105 | #ifdef CONFIG_SYSFS | |
106 | static ssize_t oops_count_show(struct kobject *kobj, struct kobj_attribute *attr, | |
107 | char *page) | |
108 | { | |
109 | return sysfs_emit(page, "%d\n", atomic_read(&oops_count)); | |
110 | } | |
111 | ||
112 | static struct kobj_attribute oops_count_attr = __ATTR_RO(oops_count); | |
113 | ||
114 | static __init int kernel_exit_sysfs_init(void) | |
115 | { | |
116 | sysfs_add_file_to_group(kernel_kobj, &oops_count_attr.attr, NULL); | |
117 | return 0; | |
118 | } | |
119 | late_initcall(kernel_exit_sysfs_init); | |
120 | #endif | |
121 | ||
d40e48e0 | 122 | static void __unhash_process(struct task_struct *p, bool group_dead) |
1da177e4 LT |
123 | { |
124 | nr_threads--; | |
50d75f8d | 125 | detach_pid(p, PIDTYPE_PID); |
d40e48e0 | 126 | if (group_dead) { |
6883f81a | 127 | detach_pid(p, PIDTYPE_TGID); |
1da177e4 LT |
128 | detach_pid(p, PIDTYPE_PGID); |
129 | detach_pid(p, PIDTYPE_SID); | |
c97d9893 | 130 | |
5e85d4ab | 131 | list_del_rcu(&p->tasks); |
9cd80bbb | 132 | list_del_init(&p->sibling); |
909ea964 | 133 | __this_cpu_dec(process_counts); |
1da177e4 | 134 | } |
47e65328 | 135 | list_del_rcu(&p->thread_group); |
0c740d0a | 136 | list_del_rcu(&p->thread_node); |
1da177e4 LT |
137 | } |
138 | ||
6a14c5c9 ON |
139 | /* |
140 | * This function expects the tasklist_lock write-locked. | |
141 | */ | |
142 | static void __exit_signal(struct task_struct *tsk) | |
143 | { | |
144 | struct signal_struct *sig = tsk->signal; | |
d40e48e0 | 145 | bool group_dead = thread_group_leader(tsk); |
6a14c5c9 | 146 | struct sighand_struct *sighand; |
3f649ab7 | 147 | struct tty_struct *tty; |
5613fda9 | 148 | u64 utime, stime; |
6a14c5c9 | 149 | |
d11c563d | 150 | sighand = rcu_dereference_check(tsk->sighand, |
db1466b3 | 151 | lockdep_tasklist_lock_is_held()); |
6a14c5c9 ON |
152 | spin_lock(&sighand->siglock); |
153 | ||
baa73d9e | 154 | #ifdef CONFIG_POSIX_TIMERS |
6a14c5c9 | 155 | posix_cpu_timers_exit(tsk); |
b95e31c0 | 156 | if (group_dead) |
6a14c5c9 | 157 | posix_cpu_timers_exit_group(tsk); |
baa73d9e | 158 | #endif |
e0a70217 | 159 | |
baa73d9e NP |
160 | if (group_dead) { |
161 | tty = sig->tty; | |
162 | sig->tty = NULL; | |
163 | } else { | |
6a14c5c9 ON |
164 | /* |
165 | * If there is any task waiting for the group exit | |
166 | * then notify it: | |
167 | */ | |
d344193a | 168 | if (sig->notify_count > 0 && !--sig->notify_count) |
60700e38 | 169 | wake_up_process(sig->group_exec_task); |
6db840fa | 170 | |
6a14c5c9 ON |
171 | if (tsk == sig->curr_target) |
172 | sig->curr_target = next_thread(tsk); | |
6a14c5c9 ON |
173 | } |
174 | ||
53d3eaa3 NP |
175 | add_device_randomness((const void*) &tsk->se.sum_exec_runtime, |
176 | sizeof(unsigned long long)); | |
177 | ||
90ed9cbe | 178 | /* |
26e75b5c ON |
179 | * Accumulate here the counters for all threads as they die. We could |
180 | * skip the group leader because it is the last user of signal_struct, | |
181 | * but we want to avoid the race with thread_group_cputime() which can | |
182 | * see the empty ->thread_head list. | |
90ed9cbe RR |
183 | */ |
184 | task_cputime(tsk, &utime, &stime); | |
e78c3496 | 185 | write_seqlock(&sig->stats_lock); |
90ed9cbe RR |
186 | sig->utime += utime; |
187 | sig->stime += stime; | |
188 | sig->gtime += task_gtime(tsk); | |
189 | sig->min_flt += tsk->min_flt; | |
190 | sig->maj_flt += tsk->maj_flt; | |
191 | sig->nvcsw += tsk->nvcsw; | |
192 | sig->nivcsw += tsk->nivcsw; | |
193 | sig->inblock += task_io_get_inblock(tsk); | |
194 | sig->oublock += task_io_get_oublock(tsk); | |
195 | task_io_accounting_add(&sig->ioac, &tsk->ioac); | |
196 | sig->sum_sched_runtime += tsk->se.sum_exec_runtime; | |
b3ac022c | 197 | sig->nr_threads--; |
d40e48e0 | 198 | __unhash_process(tsk, group_dead); |
e78c3496 | 199 | write_sequnlock(&sig->stats_lock); |
5876700c | 200 | |
da7978b0 ON |
201 | /* |
202 | * Do this under ->siglock, we can race with another thread | |
203 | * doing sigqueue_free() if we have SIGQUEUE_PREALLOC signals. | |
204 | */ | |
205 | flush_sigqueue(&tsk->pending); | |
a7e5328a | 206 | tsk->sighand = NULL; |
6a14c5c9 | 207 | spin_unlock(&sighand->siglock); |
6a14c5c9 | 208 | |
a7e5328a | 209 | __cleanup_sighand(sighand); |
a0be55de | 210 | clear_tsk_thread_flag(tsk, TIF_SIGPENDING); |
d40e48e0 | 211 | if (group_dead) { |
6a14c5c9 | 212 | flush_sigqueue(&sig->shared_pending); |
4ada856f | 213 | tty_kref_put(tty); |
6a14c5c9 ON |
214 | } |
215 | } | |
216 | ||
8c7904a0 EB |
217 | static void delayed_put_task_struct(struct rcu_head *rhp) |
218 | { | |
0a16b607 MD |
219 | struct task_struct *tsk = container_of(rhp, struct task_struct, rcu); |
220 | ||
670721c7 | 221 | kprobe_flush_task(tsk); |
54ecbe6f | 222 | rethook_flush_task(tsk); |
4e231c79 | 223 | perf_event_delayed_put(tsk); |
0a16b607 MD |
224 | trace_sched_process_free(tsk); |
225 | put_task_struct(tsk); | |
8c7904a0 EB |
226 | } |
227 | ||
3fbd7ee2 EB |
228 | void put_task_struct_rcu_user(struct task_struct *task) |
229 | { | |
230 | if (refcount_dec_and_test(&task->rcu_users)) | |
231 | call_rcu(&task->rcu, delayed_put_task_struct); | |
232 | } | |
f470021a | 233 | |
2be9880d KW |
234 | void __weak release_thread(struct task_struct *dead_task) |
235 | { | |
236 | } | |
237 | ||
a0be55de | 238 | void release_task(struct task_struct *p) |
1da177e4 | 239 | { |
36c8b586 | 240 | struct task_struct *leader; |
7bc3e6e5 | 241 | struct pid *thread_pid; |
1da177e4 | 242 | int zap_leader; |
1f09f974 | 243 | repeat: |
c69e8d9c | 244 | /* don't need to get the RCU readlock here - the process is dead and |
d11c563d PM |
245 | * can't be modifying its own credentials. But shut RCU-lockdep up */ |
246 | rcu_read_lock(); | |
21d1c5e3 | 247 | dec_rlimit_ucounts(task_ucounts(p), UCOUNT_RLIMIT_NPROC, 1); |
d11c563d | 248 | rcu_read_unlock(); |
c69e8d9c | 249 | |
6b115bf5 | 250 | cgroup_release(p); |
0203026b | 251 | |
1da177e4 | 252 | write_lock_irq(&tasklist_lock); |
a288eecc | 253 | ptrace_release_task(p); |
7bc3e6e5 | 254 | thread_pid = get_pid(p->thread_pid); |
1da177e4 | 255 | __exit_signal(p); |
35f5cad8 | 256 | |
1da177e4 LT |
257 | /* |
258 | * If we are the last non-leader member of the thread | |
259 | * group, and the leader is zombie, then notify the | |
260 | * group leader's parent process. (if it wants notification.) | |
261 | */ | |
262 | zap_leader = 0; | |
263 | leader = p->group_leader; | |
a0be55de IA |
264 | if (leader != p && thread_group_empty(leader) |
265 | && leader->exit_state == EXIT_ZOMBIE) { | |
1da177e4 LT |
266 | /* |
267 | * If we were the last child thread and the leader has | |
268 | * exited already, and the leader's parent ignores SIGCHLD, | |
269 | * then we are the one who should release the leader. | |
dae33574 | 270 | */ |
86773473 | 271 | zap_leader = do_notify_parent(leader, leader->exit_signal); |
dae33574 RM |
272 | if (zap_leader) |
273 | leader->exit_state = EXIT_DEAD; | |
1da177e4 LT |
274 | } |
275 | ||
1da177e4 | 276 | write_unlock_irq(&tasklist_lock); |
3a15fb6e | 277 | seccomp_filter_release(p); |
7bc3e6e5 | 278 | proc_flush_pid(thread_pid); |
6ade99ec | 279 | put_pid(thread_pid); |
1da177e4 | 280 | release_thread(p); |
3fbd7ee2 | 281 | put_task_struct_rcu_user(p); |
1da177e4 LT |
282 | |
283 | p = leader; | |
284 | if (unlikely(zap_leader)) | |
285 | goto repeat; | |
286 | } | |
287 | ||
9d9a6ebf | 288 | int rcuwait_wake_up(struct rcuwait *w) |
8f95c90c | 289 | { |
9d9a6ebf | 290 | int ret = 0; |
8f95c90c DB |
291 | struct task_struct *task; |
292 | ||
293 | rcu_read_lock(); | |
294 | ||
295 | /* | |
296 | * Order condition vs @task, such that everything prior to the load | |
297 | * of @task is visible. This is the condition as to why the user called | |
c9d64a1b | 298 | * rcuwait_wake() in the first place. Pairs with set_current_state() |
8f95c90c DB |
299 | * barrier (A) in rcuwait_wait_event(). |
300 | * | |
301 | * WAIT WAKE | |
302 | * [S] tsk = current [S] cond = true | |
303 | * MB (A) MB (B) | |
304 | * [L] cond [L] tsk | |
305 | */ | |
6dc080ee | 306 | smp_mb(); /* (B) */ |
8f95c90c | 307 | |
8f95c90c DB |
308 | task = rcu_dereference(w->task); |
309 | if (task) | |
9d9a6ebf | 310 | ret = wake_up_process(task); |
8f95c90c | 311 | rcu_read_unlock(); |
9d9a6ebf DB |
312 | |
313 | return ret; | |
8f95c90c | 314 | } |
ac8dec42 | 315 | EXPORT_SYMBOL_GPL(rcuwait_wake_up); |
8f95c90c | 316 | |
1da177e4 LT |
317 | /* |
318 | * Determine if a process group is "orphaned", according to the POSIX | |
319 | * definition in 2.2.2.52. Orphaned process groups are not to be affected | |
320 | * by terminal-generated stop signals. Newly orphaned process groups are | |
321 | * to receive a SIGHUP and a SIGCONT. | |
322 | * | |
323 | * "I ask you, have you ever known what it is to be an orphan?" | |
324 | */ | |
a0be55de IA |
325 | static int will_become_orphaned_pgrp(struct pid *pgrp, |
326 | struct task_struct *ignored_task) | |
1da177e4 LT |
327 | { |
328 | struct task_struct *p; | |
1da177e4 | 329 | |
0475ac08 | 330 | do_each_pid_task(pgrp, PIDTYPE_PGID, p) { |
05e83df6 ON |
331 | if ((p == ignored_task) || |
332 | (p->exit_state && thread_group_empty(p)) || | |
333 | is_global_init(p->real_parent)) | |
1da177e4 | 334 | continue; |
05e83df6 | 335 | |
0475ac08 | 336 | if (task_pgrp(p->real_parent) != pgrp && |
05e83df6 ON |
337 | task_session(p->real_parent) == task_session(p)) |
338 | return 0; | |
0475ac08 | 339 | } while_each_pid_task(pgrp, PIDTYPE_PGID, p); |
05e83df6 ON |
340 | |
341 | return 1; | |
1da177e4 LT |
342 | } |
343 | ||
3e7cd6c4 | 344 | int is_current_pgrp_orphaned(void) |
1da177e4 LT |
345 | { |
346 | int retval; | |
347 | ||
348 | read_lock(&tasklist_lock); | |
3e7cd6c4 | 349 | retval = will_become_orphaned_pgrp(task_pgrp(current), NULL); |
1da177e4 LT |
350 | read_unlock(&tasklist_lock); |
351 | ||
352 | return retval; | |
353 | } | |
354 | ||
961c4675 | 355 | static bool has_stopped_jobs(struct pid *pgrp) |
1da177e4 | 356 | { |
1da177e4 LT |
357 | struct task_struct *p; |
358 | ||
0475ac08 | 359 | do_each_pid_task(pgrp, PIDTYPE_PGID, p) { |
961c4675 ON |
360 | if (p->signal->flags & SIGNAL_STOP_STOPPED) |
361 | return true; | |
0475ac08 | 362 | } while_each_pid_task(pgrp, PIDTYPE_PGID, p); |
961c4675 ON |
363 | |
364 | return false; | |
1da177e4 LT |
365 | } |
366 | ||
f49ee505 ON |
367 | /* |
368 | * Check to see if any process groups have become orphaned as | |
369 | * a result of our exiting, and if they have any stopped jobs, | |
370 | * send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2) | |
371 | */ | |
372 | static void | |
373 | kill_orphaned_pgrp(struct task_struct *tsk, struct task_struct *parent) | |
374 | { | |
375 | struct pid *pgrp = task_pgrp(tsk); | |
376 | struct task_struct *ignored_task = tsk; | |
377 | ||
378 | if (!parent) | |
a0be55de IA |
379 | /* exit: our father is in a different pgrp than |
380 | * we are and we were the only connection outside. | |
381 | */ | |
f49ee505 ON |
382 | parent = tsk->real_parent; |
383 | else | |
384 | /* reparent: our child is in a different pgrp than | |
385 | * we are, and it was the only connection outside. | |
386 | */ | |
387 | ignored_task = NULL; | |
388 | ||
389 | if (task_pgrp(parent) != pgrp && | |
390 | task_session(parent) == task_session(tsk) && | |
391 | will_become_orphaned_pgrp(pgrp, ignored_task) && | |
392 | has_stopped_jobs(pgrp)) { | |
393 | __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp); | |
394 | __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp); | |
395 | } | |
396 | } | |
397 | ||
92307383 | 398 | static void coredump_task_exit(struct task_struct *tsk) |
d67e03e3 EB |
399 | { |
400 | struct core_state *core_state; | |
401 | ||
402 | /* | |
403 | * Serialize with any possible pending coredump. | |
0258b5fd | 404 | * We must hold siglock around checking core_state |
92307383 | 405 | * and setting PF_POSTCOREDUMP. The core-inducing thread |
d67e03e3 | 406 | * will increment ->nr_threads for each thread in the |
92307383 | 407 | * group without PF_POSTCOREDUMP set. |
d67e03e3 | 408 | */ |
0258b5fd | 409 | spin_lock_irq(&tsk->sighand->siglock); |
92307383 | 410 | tsk->flags |= PF_POSTCOREDUMP; |
0258b5fd EB |
411 | core_state = tsk->signal->core_state; |
412 | spin_unlock_irq(&tsk->sighand->siglock); | |
d67e03e3 EB |
413 | if (core_state) { |
414 | struct core_thread self; | |
415 | ||
d67e03e3 EB |
416 | self.task = current; |
417 | if (self.task->flags & PF_SIGNALED) | |
418 | self.next = xchg(&core_state->dumper.next, &self); | |
419 | else | |
420 | self.task = NULL; | |
421 | /* | |
422 | * Implies mb(), the result of xchg() must be visible | |
423 | * to core_state->dumper. | |
424 | */ | |
425 | if (atomic_dec_and_test(&core_state->nr_threads)) | |
426 | complete(&core_state->startup); | |
427 | ||
428 | for (;;) { | |
f5d39b02 | 429 | set_current_state(TASK_UNINTERRUPTIBLE|TASK_FREEZABLE); |
d67e03e3 EB |
430 | if (!self.task) /* see coredump_finish() */ |
431 | break; | |
f5d39b02 | 432 | schedule(); |
d67e03e3 EB |
433 | } |
434 | __set_current_state(TASK_RUNNING); | |
d67e03e3 EB |
435 | } |
436 | } | |
437 | ||
f98bafa0 | 438 | #ifdef CONFIG_MEMCG |
cf475ad2 | 439 | /* |
733eda7a | 440 | * A task is exiting. If it owned this mm, find a new owner for the mm. |
cf475ad2 | 441 | */ |
cf475ad2 BS |
442 | void mm_update_next_owner(struct mm_struct *mm) |
443 | { | |
444 | struct task_struct *c, *g, *p = current; | |
445 | ||
446 | retry: | |
733eda7a KH |
447 | /* |
448 | * If the exiting or execing task is not the owner, it's | |
449 | * someone else's problem. | |
450 | */ | |
451 | if (mm->owner != p) | |
cf475ad2 | 452 | return; |
733eda7a KH |
453 | /* |
454 | * The current owner is exiting/execing and there are no other | |
455 | * candidates. Do not leave the mm pointing to a possibly | |
456 | * freed task structure. | |
457 | */ | |
458 | if (atomic_read(&mm->mm_users) <= 1) { | |
987717e5 | 459 | WRITE_ONCE(mm->owner, NULL); |
733eda7a KH |
460 | return; |
461 | } | |
cf475ad2 BS |
462 | |
463 | read_lock(&tasklist_lock); | |
464 | /* | |
465 | * Search in the children | |
466 | */ | |
467 | list_for_each_entry(c, &p->children, sibling) { | |
468 | if (c->mm == mm) | |
469 | goto assign_new_owner; | |
470 | } | |
471 | ||
472 | /* | |
473 | * Search in the siblings | |
474 | */ | |
dea33cfd | 475 | list_for_each_entry(c, &p->real_parent->children, sibling) { |
cf475ad2 BS |
476 | if (c->mm == mm) |
477 | goto assign_new_owner; | |
478 | } | |
479 | ||
480 | /* | |
f87fb599 | 481 | * Search through everything else, we should not get here often. |
cf475ad2 | 482 | */ |
39af1765 ON |
483 | for_each_process(g) { |
484 | if (g->flags & PF_KTHREAD) | |
485 | continue; | |
486 | for_each_thread(g, c) { | |
487 | if (c->mm == mm) | |
488 | goto assign_new_owner; | |
489 | if (c->mm) | |
490 | break; | |
491 | } | |
f87fb599 | 492 | } |
cf475ad2 | 493 | read_unlock(&tasklist_lock); |
31a78f23 BS |
494 | /* |
495 | * We found no owner yet mm_users > 1: this implies that we are | |
496 | * most likely racing with swapoff (try_to_unuse()) or /proc or | |
e5991371 | 497 | * ptrace or page migration (get_task_mm()). Mark owner as NULL. |
31a78f23 | 498 | */ |
987717e5 | 499 | WRITE_ONCE(mm->owner, NULL); |
cf475ad2 BS |
500 | return; |
501 | ||
502 | assign_new_owner: | |
503 | BUG_ON(c == p); | |
504 | get_task_struct(c); | |
505 | /* | |
506 | * The task_lock protects c->mm from changing. | |
507 | * We always want mm->owner->mm == mm | |
508 | */ | |
509 | task_lock(c); | |
e5991371 HD |
510 | /* |
511 | * Delay read_unlock() till we have the task_lock() | |
512 | * to ensure that c does not slip away underneath us | |
513 | */ | |
514 | read_unlock(&tasklist_lock); | |
cf475ad2 BS |
515 | if (c->mm != mm) { |
516 | task_unlock(c); | |
517 | put_task_struct(c); | |
518 | goto retry; | |
519 | } | |
987717e5 | 520 | WRITE_ONCE(mm->owner, c); |
bd74fdae | 521 | lru_gen_migrate_mm(mm); |
cf475ad2 BS |
522 | task_unlock(c); |
523 | put_task_struct(c); | |
524 | } | |
f98bafa0 | 525 | #endif /* CONFIG_MEMCG */ |
cf475ad2 | 526 | |
1da177e4 LT |
527 | /* |
528 | * Turn us into a lazy TLB process if we | |
529 | * aren't already.. | |
530 | */ | |
0039962a | 531 | static void exit_mm(void) |
1da177e4 | 532 | { |
0039962a | 533 | struct mm_struct *mm = current->mm; |
1da177e4 | 534 | |
4610ba7a | 535 | exit_mm_release(current, mm); |
1da177e4 LT |
536 | if (!mm) |
537 | return; | |
4fe7efdb | 538 | sync_mm_rss(mm); |
d8ed45c5 | 539 | mmap_read_lock(mm); |
f1f10076 | 540 | mmgrab(mm); |
0039962a | 541 | BUG_ON(mm != current->active_mm); |
1da177e4 | 542 | /* more a memory barrier than a real lock */ |
0039962a | 543 | task_lock(current); |
5bc78502 MD |
544 | /* |
545 | * When a thread stops operating on an address space, the loop | |
546 | * in membarrier_private_expedited() may not observe that | |
547 | * tsk->mm, and the loop in membarrier_global_expedited() may | |
548 | * not observe a MEMBARRIER_STATE_GLOBAL_EXPEDITED | |
549 | * rq->membarrier_state, so those would not issue an IPI. | |
550 | * Membarrier requires a memory barrier after accessing | |
551 | * user-space memory, before clearing tsk->mm or the | |
552 | * rq->membarrier_state. | |
553 | */ | |
554 | smp_mb__after_spinlock(); | |
555 | local_irq_disable(); | |
0039962a | 556 | current->mm = NULL; |
5bc78502 | 557 | membarrier_update_current_mm(NULL); |
1da177e4 | 558 | enter_lazy_tlb(mm, current); |
5bc78502 | 559 | local_irq_enable(); |
0039962a | 560 | task_unlock(current); |
5bc78502 | 561 | mmap_read_unlock(mm); |
cf475ad2 | 562 | mm_update_next_owner(mm); |
1da177e4 | 563 | mmput(mm); |
c32b3cbe | 564 | if (test_thread_flag(TIF_MEMDIE)) |
38531201 | 565 | exit_oom_victim(); |
1da177e4 LT |
566 | } |
567 | ||
c9dc05bf ON |
568 | static struct task_struct *find_alive_thread(struct task_struct *p) |
569 | { | |
570 | struct task_struct *t; | |
571 | ||
572 | for_each_thread(p, t) { | |
573 | if (!(t->flags & PF_EXITING)) | |
574 | return t; | |
575 | } | |
576 | return NULL; | |
577 | } | |
578 | ||
8fb335e0 AV |
579 | static struct task_struct *find_child_reaper(struct task_struct *father, |
580 | struct list_head *dead) | |
1109909c ON |
581 | __releases(&tasklist_lock) |
582 | __acquires(&tasklist_lock) | |
583 | { | |
584 | struct pid_namespace *pid_ns = task_active_pid_ns(father); | |
585 | struct task_struct *reaper = pid_ns->child_reaper; | |
8fb335e0 | 586 | struct task_struct *p, *n; |
1109909c ON |
587 | |
588 | if (likely(reaper != father)) | |
589 | return reaper; | |
590 | ||
c9dc05bf ON |
591 | reaper = find_alive_thread(father); |
592 | if (reaper) { | |
1109909c ON |
593 | pid_ns->child_reaper = reaper; |
594 | return reaper; | |
595 | } | |
596 | ||
597 | write_unlock_irq(&tasklist_lock); | |
8fb335e0 AV |
598 | |
599 | list_for_each_entry_safe(p, n, dead, ptrace_entry) { | |
600 | list_del_init(&p->ptrace_entry); | |
601 | release_task(p); | |
602 | } | |
603 | ||
1109909c ON |
604 | zap_pid_ns_processes(pid_ns); |
605 | write_lock_irq(&tasklist_lock); | |
606 | ||
607 | return father; | |
608 | } | |
609 | ||
1da177e4 | 610 | /* |
ebec18a6 LP |
611 | * When we die, we re-parent all our children, and try to: |
612 | * 1. give them to another thread in our thread group, if such a member exists | |
613 | * 2. give it to the first ancestor process which prctl'd itself as a | |
614 | * child_subreaper for its children (like a service manager) | |
615 | * 3. give it to the init process (PID 1) in our pid namespace | |
1da177e4 | 616 | */ |
1109909c ON |
617 | static struct task_struct *find_new_reaper(struct task_struct *father, |
618 | struct task_struct *child_reaper) | |
1da177e4 | 619 | { |
c9dc05bf | 620 | struct task_struct *thread, *reaper; |
1da177e4 | 621 | |
c9dc05bf ON |
622 | thread = find_alive_thread(father); |
623 | if (thread) | |
950bbabb | 624 | return thread; |
1da177e4 | 625 | |
7d24e2df | 626 | if (father->signal->has_child_subreaper) { |
c6c70f44 | 627 | unsigned int ns_level = task_pid(father)->level; |
ebec18a6 | 628 | /* |
175aed3f | 629 | * Find the first ->is_child_subreaper ancestor in our pid_ns. |
c6c70f44 ON |
630 | * We can't check reaper != child_reaper to ensure we do not |
631 | * cross the namespaces, the exiting parent could be injected | |
632 | * by setns() + fork(). | |
633 | * We check pid->level, this is slightly more efficient than | |
634 | * task_active_pid_ns(reaper) != task_active_pid_ns(father). | |
ebec18a6 | 635 | */ |
c6c70f44 ON |
636 | for (reaper = father->real_parent; |
637 | task_pid(reaper)->level == ns_level; | |
ebec18a6 | 638 | reaper = reaper->real_parent) { |
175aed3f | 639 | if (reaper == &init_task) |
ebec18a6 LP |
640 | break; |
641 | if (!reaper->signal->is_child_subreaper) | |
642 | continue; | |
c9dc05bf ON |
643 | thread = find_alive_thread(reaper); |
644 | if (thread) | |
645 | return thread; | |
ebec18a6 | 646 | } |
1da177e4 | 647 | } |
762a24be | 648 | |
1109909c | 649 | return child_reaper; |
950bbabb ON |
650 | } |
651 | ||
5dfc80be ON |
652 | /* |
653 | * Any that need to be release_task'd are put on the @dead list. | |
654 | */ | |
9cd80bbb | 655 | static void reparent_leader(struct task_struct *father, struct task_struct *p, |
5dfc80be ON |
656 | struct list_head *dead) |
657 | { | |
2831096e | 658 | if (unlikely(p->exit_state == EXIT_DEAD)) |
5dfc80be ON |
659 | return; |
660 | ||
abd50b39 | 661 | /* We don't want people slaying init. */ |
5dfc80be ON |
662 | p->exit_signal = SIGCHLD; |
663 | ||
664 | /* If it has exited notify the new parent about this child's death. */ | |
d21142ec | 665 | if (!p->ptrace && |
5dfc80be | 666 | p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) { |
86773473 | 667 | if (do_notify_parent(p, p->exit_signal)) { |
5dfc80be | 668 | p->exit_state = EXIT_DEAD; |
dc2fd4b0 | 669 | list_add(&p->ptrace_entry, dead); |
5dfc80be ON |
670 | } |
671 | } | |
672 | ||
673 | kill_orphaned_pgrp(p, father); | |
674 | } | |
675 | ||
482a3767 ON |
676 | /* |
677 | * This does two things: | |
678 | * | |
679 | * A. Make init inherit all the child processes | |
680 | * B. Check to see if any process groups have become orphaned | |
681 | * as a result of our exiting, and if they have any stopped | |
682 | * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2) | |
683 | */ | |
684 | static void forget_original_parent(struct task_struct *father, | |
685 | struct list_head *dead) | |
1da177e4 | 686 | { |
482a3767 | 687 | struct task_struct *p, *t, *reaper; |
762a24be | 688 | |
7c8bd232 | 689 | if (unlikely(!list_empty(&father->ptraced))) |
482a3767 | 690 | exit_ptrace(father, dead); |
f470021a | 691 | |
7c8bd232 | 692 | /* Can drop and reacquire tasklist_lock */ |
8fb335e0 | 693 | reaper = find_child_reaper(father, dead); |
ad9e206a | 694 | if (list_empty(&father->children)) |
482a3767 | 695 | return; |
1109909c ON |
696 | |
697 | reaper = find_new_reaper(father, reaper); | |
2831096e | 698 | list_for_each_entry(p, &father->children, sibling) { |
57a05918 | 699 | for_each_thread(p, t) { |
22a34c6f MB |
700 | RCU_INIT_POINTER(t->real_parent, reaper); |
701 | BUG_ON((!t->ptrace) != (rcu_access_pointer(t->parent) == father)); | |
57a05918 | 702 | if (likely(!t->ptrace)) |
9cd80bbb | 703 | t->parent = t->real_parent; |
9cd80bbb ON |
704 | if (t->pdeath_signal) |
705 | group_send_sig_info(t->pdeath_signal, | |
01024980 EB |
706 | SEND_SIG_NOINFO, t, |
707 | PIDTYPE_TGID); | |
57a05918 | 708 | } |
2831096e ON |
709 | /* |
710 | * If this is a threaded reparent there is no need to | |
711 | * notify anyone anything has happened. | |
712 | */ | |
713 | if (!same_thread_group(reaper, father)) | |
482a3767 | 714 | reparent_leader(father, p, dead); |
1da177e4 | 715 | } |
2831096e | 716 | list_splice_tail_init(&father->children, &reaper->children); |
1da177e4 LT |
717 | } |
718 | ||
719 | /* | |
720 | * Send signals to all our closest relatives so that they know | |
721 | * to properly mourn us.. | |
722 | */ | |
821c7de7 | 723 | static void exit_notify(struct task_struct *tsk, int group_dead) |
1da177e4 | 724 | { |
53c8f9f1 | 725 | bool autoreap; |
482a3767 ON |
726 | struct task_struct *p, *n; |
727 | LIST_HEAD(dead); | |
1da177e4 | 728 | |
762a24be | 729 | write_lock_irq(&tasklist_lock); |
482a3767 ON |
730 | forget_original_parent(tsk, &dead); |
731 | ||
821c7de7 ON |
732 | if (group_dead) |
733 | kill_orphaned_pgrp(tsk->group_leader, NULL); | |
1da177e4 | 734 | |
b191d649 | 735 | tsk->exit_state = EXIT_ZOMBIE; |
45cdf5cc ON |
736 | if (unlikely(tsk->ptrace)) { |
737 | int sig = thread_group_leader(tsk) && | |
738 | thread_group_empty(tsk) && | |
739 | !ptrace_reparented(tsk) ? | |
740 | tsk->exit_signal : SIGCHLD; | |
741 | autoreap = do_notify_parent(tsk, sig); | |
742 | } else if (thread_group_leader(tsk)) { | |
743 | autoreap = thread_group_empty(tsk) && | |
744 | do_notify_parent(tsk, tsk->exit_signal); | |
745 | } else { | |
746 | autoreap = true; | |
747 | } | |
1da177e4 | 748 | |
30b692d3 CB |
749 | if (autoreap) { |
750 | tsk->exit_state = EXIT_DEAD; | |
6c66e7db | 751 | list_add(&tsk->ptrace_entry, &dead); |
30b692d3 | 752 | } |
1da177e4 | 753 | |
9c339168 ON |
754 | /* mt-exec, de_thread() is waiting for group leader */ |
755 | if (unlikely(tsk->signal->notify_count < 0)) | |
60700e38 | 756 | wake_up_process(tsk->signal->group_exec_task); |
1da177e4 LT |
757 | write_unlock_irq(&tasklist_lock); |
758 | ||
482a3767 ON |
759 | list_for_each_entry_safe(p, n, &dead, ptrace_entry) { |
760 | list_del_init(&p->ptrace_entry); | |
761 | release_task(p); | |
762 | } | |
1da177e4 LT |
763 | } |
764 | ||
e18eecb8 JD |
765 | #ifdef CONFIG_DEBUG_STACK_USAGE |
766 | static void check_stack_usage(void) | |
767 | { | |
768 | static DEFINE_SPINLOCK(low_water_lock); | |
769 | static int lowest_to_date = THREAD_SIZE; | |
e18eecb8 JD |
770 | unsigned long free; |
771 | ||
7c9f8861 | 772 | free = stack_not_used(current); |
e18eecb8 JD |
773 | |
774 | if (free >= lowest_to_date) | |
775 | return; | |
776 | ||
777 | spin_lock(&low_water_lock); | |
778 | if (free < lowest_to_date) { | |
627393d4 | 779 | pr_info("%s (%d) used greatest stack depth: %lu bytes left\n", |
a0be55de | 780 | current->comm, task_pid_nr(current), free); |
e18eecb8 JD |
781 | lowest_to_date = free; |
782 | } | |
783 | spin_unlock(&low_water_lock); | |
784 | } | |
785 | #else | |
786 | static inline void check_stack_usage(void) {} | |
787 | #endif | |
788 | ||
d80f7d7b EB |
789 | static void synchronize_group_exit(struct task_struct *tsk, long code) |
790 | { | |
791 | struct sighand_struct *sighand = tsk->sighand; | |
792 | struct signal_struct *signal = tsk->signal; | |
793 | ||
794 | spin_lock_irq(&sighand->siglock); | |
795 | signal->quick_threads--; | |
796 | if ((signal->quick_threads == 0) && | |
797 | !(signal->flags & SIGNAL_GROUP_EXIT)) { | |
798 | signal->flags = SIGNAL_GROUP_EXIT; | |
799 | signal->group_exit_code = code; | |
800 | signal->group_stop_count = 0; | |
801 | } | |
802 | spin_unlock_irq(&sighand->siglock); | |
803 | } | |
804 | ||
9af6528e | 805 | void __noreturn do_exit(long code) |
1da177e4 LT |
806 | { |
807 | struct task_struct *tsk = current; | |
808 | int group_dead; | |
809 | ||
d80f7d7b EB |
810 | synchronize_group_exit(tsk, code); |
811 | ||
b1f866b0 | 812 | WARN_ON(tsk->plug); |
22e2c507 | 813 | |
586b58ca | 814 | kcov_task_exit(tsk); |
50b5e49c | 815 | kmsan_task_exit(tsk); |
586b58ca | 816 | |
92307383 | 817 | coredump_task_exit(tsk); |
a288eecc | 818 | ptrace_event(PTRACE_EVENT_EXIT, code); |
1da177e4 | 819 | |
e0e81739 DH |
820 | validate_creds_for_do_exit(tsk); |
821 | ||
f552a27a | 822 | io_uring_files_cancel(); |
d12619b5 | 823 | exit_signals(tsk); /* sets PF_EXITING */ |
1da177e4 | 824 | |
48d212a2 LT |
825 | /* sync mm's RSS info before statistics gathering */ |
826 | if (tsk->mm) | |
827 | sync_mm_rss(tsk->mm); | |
51229b49 | 828 | acct_update_integrals(tsk); |
1da177e4 | 829 | group_dead = atomic_dec_and_test(&tsk->signal->live); |
c3068951 | 830 | if (group_dead) { |
43cf75d9 | 831 | /* |
832 | * If the last thread of global init has exited, panic | |
833 | * immediately to get a useable coredump. | |
834 | */ | |
835 | if (unlikely(is_global_init(tsk))) | |
836 | panic("Attempted to kill init! exitcode=0x%08x\n", | |
837 | tsk->signal->group_exit_code ?: (int)code); | |
838 | ||
baa73d9e | 839 | #ifdef CONFIG_POSIX_TIMERS |
778e9a9c | 840 | hrtimer_cancel(&tsk->signal->real_timer); |
d5b36a4d | 841 | exit_itimers(tsk); |
baa73d9e | 842 | #endif |
1f10206c JP |
843 | if (tsk->mm) |
844 | setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm); | |
c3068951 | 845 | } |
f6ec29a4 | 846 | acct_collect(code, group_dead); |
522ed776 MT |
847 | if (group_dead) |
848 | tty_audit_exit(); | |
a4ff8dba | 849 | audit_free(tsk); |
115085ea | 850 | |
48d212a2 | 851 | tsk->exit_code = code; |
115085ea | 852 | taskstats_exit(tsk, group_dead); |
c757249a | 853 | |
0039962a | 854 | exit_mm(); |
1da177e4 | 855 | |
0e464814 | 856 | if (group_dead) |
f6ec29a4 | 857 | acct_process(); |
0a16b607 MD |
858 | trace_sched_process_exit(tsk); |
859 | ||
1da177e4 | 860 | exit_sem(tsk); |
b34a6b1d | 861 | exit_shm(tsk); |
1ec7f1dd AV |
862 | exit_files(tsk); |
863 | exit_fs(tsk); | |
c39df5fa ON |
864 | if (group_dead) |
865 | disassociate_ctty(1); | |
8aac6270 | 866 | exit_task_namespaces(tsk); |
ed3e694d | 867 | exit_task_work(tsk); |
e6464694 | 868 | exit_thread(tsk); |
0b3fcf17 SE |
869 | |
870 | /* | |
871 | * Flush inherited counters to the parent - before the parent | |
872 | * gets woken up by child-exit notifications. | |
873 | * | |
874 | * because of cgroup mode, must be called before cgroup_exit() | |
875 | */ | |
876 | perf_event_exit_task(tsk); | |
877 | ||
8e5bfa8c | 878 | sched_autogroup_exit_task(tsk); |
1ec41830 | 879 | cgroup_exit(tsk); |
1da177e4 | 880 | |
24f1e32c FW |
881 | /* |
882 | * FIXME: do that only when needed, using sched_exit tracepoint | |
883 | */ | |
7c8df286 | 884 | flush_ptrace_hw_breakpoint(tsk); |
33b2fb30 | 885 | |
ccdd29ff | 886 | exit_tasks_rcu_start(); |
821c7de7 | 887 | exit_notify(tsk, group_dead); |
ef982393 | 888 | proc_exit_connector(tsk); |
c11600e4 | 889 | mpol_put_task_policy(tsk); |
42b2dd0a | 890 | #ifdef CONFIG_FUTEX |
c87e2837 IM |
891 | if (unlikely(current->pi_state_cache)) |
892 | kfree(current->pi_state_cache); | |
42b2dd0a | 893 | #endif |
de5097c2 | 894 | /* |
9a11b49a | 895 | * Make sure we are holding no locks: |
de5097c2 | 896 | */ |
1b1d2fb4 | 897 | debug_check_no_locks_held(); |
1da177e4 | 898 | |
afc847b7 | 899 | if (tsk->io_context) |
b69f2292 | 900 | exit_io_context(tsk); |
afc847b7 | 901 | |
b92ce558 | 902 | if (tsk->splice_pipe) |
4b8a8f1e | 903 | free_pipe_info(tsk->splice_pipe); |
b92ce558 | 904 | |
5640f768 ED |
905 | if (tsk->task_frag.page) |
906 | put_page(tsk->task_frag.page); | |
907 | ||
e0e81739 | 908 | validate_creds_for_do_exit(tsk); |
1a03d3f1 | 909 | exit_task_stack_account(tsk); |
e0e81739 | 910 | |
4bcb8232 | 911 | check_stack_usage(); |
7407251a | 912 | preempt_disable(); |
54848d73 WF |
913 | if (tsk->nr_dirtied) |
914 | __this_cpu_add(dirty_throttle_leaks, tsk->nr_dirtied); | |
f41d911f | 915 | exit_rcu(); |
ccdd29ff | 916 | exit_tasks_rcu_finish(); |
b5740f4b | 917 | |
b09be676 | 918 | lockdep_free_task(tsk); |
9af6528e | 919 | do_task_dead(); |
1da177e4 | 920 | } |
012914da | 921 | |
0e25498f EB |
922 | void __noreturn make_task_dead(int signr) |
923 | { | |
924 | /* | |
925 | * Take the task off the cpu after something catastrophic has | |
926 | * happened. | |
05ea0424 EB |
927 | * |
928 | * We can get here from a kernel oops, sometimes with preemption off. | |
929 | * Start by checking for critical errors. | |
930 | * Then fix up important state like USER_DS and preemption. | |
931 | * Then do everything else. | |
0e25498f | 932 | */ |
05ea0424 EB |
933 | struct task_struct *tsk = current; |
934 | ||
935 | if (unlikely(in_interrupt())) | |
936 | panic("Aiee, killing interrupt handler!"); | |
937 | if (unlikely(!tsk->pid)) | |
938 | panic("Attempted to kill the idle task!"); | |
939 | ||
05ea0424 EB |
940 | if (unlikely(in_atomic())) { |
941 | pr_info("note: %s[%d] exited with preempt_count %d\n", | |
942 | current->comm, task_pid_nr(current), | |
943 | preempt_count()); | |
944 | preempt_count_set(PREEMPT_ENABLED); | |
945 | } | |
946 | ||
d4ccd54d JH |
947 | /* |
948 | * Every time the system oopses, if the oops happens while a reference | |
949 | * to an object was held, the reference leaks. | |
950 | * If the oops doesn't also leak memory, repeated oopsing can cause | |
951 | * reference counters to wrap around (if they're not using refcount_t). | |
952 | * This means that repeated oopsing can make unexploitable-looking bugs | |
953 | * exploitable through repeated oopsing. | |
954 | * To make sure this can't happen, place an upper bound on how often the | |
955 | * kernel may oops without panic(). | |
956 | */ | |
de92f657 | 957 | if (atomic_inc_return(&oops_count) >= READ_ONCE(oops_limit) && oops_limit) |
d4ccd54d JH |
958 | panic("Oopsed too often (kernel.oops_limit is %d)", oops_limit); |
959 | ||
05ea0424 EB |
960 | /* |
961 | * We're taking recursive faults here in make_task_dead. Safest is to just | |
962 | * leave this task alone and wait for reboot. | |
963 | */ | |
964 | if (unlikely(tsk->flags & PF_EXITING)) { | |
965 | pr_alert("Fixing recursive fault but reboot is needed!\n"); | |
966 | futex_exit_recursive(tsk); | |
912616f1 EB |
967 | tsk->exit_state = EXIT_DEAD; |
968 | refcount_inc(&tsk->rcu_users); | |
7f80a2fd | 969 | do_task_dead(); |
05ea0424 EB |
970 | } |
971 | ||
0e25498f EB |
972 | do_exit(signr); |
973 | } | |
974 | ||
754fe8d2 | 975 | SYSCALL_DEFINE1(exit, int, error_code) |
1da177e4 LT |
976 | { |
977 | do_exit((error_code&0xff)<<8); | |
978 | } | |
979 | ||
1da177e4 LT |
980 | /* |
981 | * Take down every thread in the group. This is called by fatal signals | |
982 | * as well as by sys_exit_group (below). | |
983 | */ | |
eae654f1 | 984 | void __noreturn |
1da177e4 LT |
985 | do_group_exit(int exit_code) |
986 | { | |
bfc4b089 ON |
987 | struct signal_struct *sig = current->signal; |
988 | ||
49697335 | 989 | if (sig->flags & SIGNAL_GROUP_EXIT) |
bfc4b089 | 990 | exit_code = sig->group_exit_code; |
49697335 EB |
991 | else if (sig->group_exec_task) |
992 | exit_code = 0; | |
cbe9dac3 | 993 | else { |
1da177e4 | 994 | struct sighand_struct *const sighand = current->sighand; |
a0be55de | 995 | |
1da177e4 | 996 | spin_lock_irq(&sighand->siglock); |
49697335 | 997 | if (sig->flags & SIGNAL_GROUP_EXIT) |
1da177e4 LT |
998 | /* Another thread got here before we took the lock. */ |
999 | exit_code = sig->group_exit_code; | |
49697335 EB |
1000 | else if (sig->group_exec_task) |
1001 | exit_code = 0; | |
1da177e4 | 1002 | else { |
1da177e4 | 1003 | sig->group_exit_code = exit_code; |
ed5d2cac | 1004 | sig->flags = SIGNAL_GROUP_EXIT; |
1da177e4 LT |
1005 | zap_other_threads(current); |
1006 | } | |
1007 | spin_unlock_irq(&sighand->siglock); | |
1da177e4 LT |
1008 | } |
1009 | ||
1010 | do_exit(exit_code); | |
1011 | /* NOTREACHED */ | |
1012 | } | |
1013 | ||
1014 | /* | |
1015 | * this kills every thread in the thread group. Note that any externally | |
1016 | * wait4()-ing process will get the correct exit code - even if this | |
1017 | * thread is not the thread group leader. | |
1018 | */ | |
754fe8d2 | 1019 | SYSCALL_DEFINE1(exit_group, int, error_code) |
1da177e4 LT |
1020 | { |
1021 | do_group_exit((error_code & 0xff) << 8); | |
2ed7c03e HC |
1022 | /* NOTREACHED */ |
1023 | return 0; | |
1da177e4 LT |
1024 | } |
1025 | ||
67d7ddde AV |
1026 | struct waitid_info { |
1027 | pid_t pid; | |
1028 | uid_t uid; | |
1029 | int status; | |
1030 | int cause; | |
1031 | }; | |
1032 | ||
9e8ae01d ON |
1033 | struct wait_opts { |
1034 | enum pid_type wo_type; | |
9e8ae01d | 1035 | int wo_flags; |
e1eb1ebc | 1036 | struct pid *wo_pid; |
9e8ae01d | 1037 | |
67d7ddde | 1038 | struct waitid_info *wo_info; |
359566fa | 1039 | int wo_stat; |
ce72a16f | 1040 | struct rusage *wo_rusage; |
9e8ae01d | 1041 | |
ac6424b9 | 1042 | wait_queue_entry_t child_wait; |
9e8ae01d ON |
1043 | int notask_error; |
1044 | }; | |
1045 | ||
989264f4 | 1046 | static int eligible_pid(struct wait_opts *wo, struct task_struct *p) |
1da177e4 | 1047 | { |
5c01ba49 ON |
1048 | return wo->wo_type == PIDTYPE_MAX || |
1049 | task_pid_type(p, wo->wo_type) == wo->wo_pid; | |
1050 | } | |
1da177e4 | 1051 | |
bf959931 ON |
1052 | static int |
1053 | eligible_child(struct wait_opts *wo, bool ptrace, struct task_struct *p) | |
5c01ba49 ON |
1054 | { |
1055 | if (!eligible_pid(wo, p)) | |
1056 | return 0; | |
bf959931 ON |
1057 | |
1058 | /* | |
1059 | * Wait for all children (clone and not) if __WALL is set or | |
1060 | * if it is traced by us. | |
1061 | */ | |
1062 | if (ptrace || (wo->wo_flags & __WALL)) | |
1063 | return 1; | |
1064 | ||
1065 | /* | |
1066 | * Otherwise, wait for clone children *only* if __WCLONE is set; | |
1067 | * otherwise, wait for non-clone children *only*. | |
1068 | * | |
1069 | * Note: a "clone" child here is one that reports to its parent | |
1070 | * using a signal other than SIGCHLD, or a non-leader thread which | |
1071 | * we can only see if it is traced by us. | |
1072 | */ | |
1073 | if ((p->exit_signal != SIGCHLD) ^ !!(wo->wo_flags & __WCLONE)) | |
1da177e4 | 1074 | return 0; |
1da177e4 | 1075 | |
14dd0b81 | 1076 | return 1; |
1da177e4 LT |
1077 | } |
1078 | ||
1da177e4 LT |
1079 | /* |
1080 | * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold | |
1081 | * read_lock(&tasklist_lock) on entry. If we return zero, we still hold | |
1082 | * the lock and this task is uninteresting. If we return nonzero, we have | |
1083 | * released the lock and the system call should return. | |
1084 | */ | |
9e8ae01d | 1085 | static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p) |
1da177e4 | 1086 | { |
67d7ddde | 1087 | int state, status; |
6c5f3e7b | 1088 | pid_t pid = task_pid_vnr(p); |
43e13cc1 | 1089 | uid_t uid = from_kuid_munged(current_user_ns(), task_uid(p)); |
67d7ddde | 1090 | struct waitid_info *infop; |
1da177e4 | 1091 | |
9e8ae01d | 1092 | if (!likely(wo->wo_flags & WEXITED)) |
98abed02 RM |
1093 | return 0; |
1094 | ||
9e8ae01d | 1095 | if (unlikely(wo->wo_flags & WNOWAIT)) { |
907c311f EB |
1096 | status = (p->signal->flags & SIGNAL_GROUP_EXIT) |
1097 | ? p->signal->group_exit_code : p->exit_code; | |
1da177e4 LT |
1098 | get_task_struct(p); |
1099 | read_unlock(&tasklist_lock); | |
1029a2b5 | 1100 | sched_annotate_sleep(); |
e61a2502 AV |
1101 | if (wo->wo_rusage) |
1102 | getrusage(p, RUSAGE_BOTH, wo->wo_rusage); | |
bb380ec3 | 1103 | put_task_struct(p); |
76d9871e | 1104 | goto out_info; |
1da177e4 | 1105 | } |
1da177e4 | 1106 | /* |
abd50b39 | 1107 | * Move the task's state to DEAD/TRACE, only one thread can do this. |
1da177e4 | 1108 | */ |
f6507f83 ON |
1109 | state = (ptrace_reparented(p) && thread_group_leader(p)) ? |
1110 | EXIT_TRACE : EXIT_DEAD; | |
abd50b39 | 1111 | if (cmpxchg(&p->exit_state, EXIT_ZOMBIE, state) != EXIT_ZOMBIE) |
1da177e4 | 1112 | return 0; |
986094df ON |
1113 | /* |
1114 | * We own this thread, nobody else can reap it. | |
1115 | */ | |
1116 | read_unlock(&tasklist_lock); | |
1117 | sched_annotate_sleep(); | |
f6507f83 | 1118 | |
befca967 | 1119 | /* |
f6507f83 | 1120 | * Check thread_group_leader() to exclude the traced sub-threads. |
befca967 | 1121 | */ |
f6507f83 | 1122 | if (state == EXIT_DEAD && thread_group_leader(p)) { |
f953ccd0 ON |
1123 | struct signal_struct *sig = p->signal; |
1124 | struct signal_struct *psig = current->signal; | |
1f10206c | 1125 | unsigned long maxrss; |
5613fda9 | 1126 | u64 tgutime, tgstime; |
3795e161 | 1127 | |
1da177e4 LT |
1128 | /* |
1129 | * The resource counters for the group leader are in its | |
1130 | * own task_struct. Those for dead threads in the group | |
1131 | * are in its signal_struct, as are those for the child | |
1132 | * processes it has previously reaped. All these | |
1133 | * accumulate in the parent's signal_struct c* fields. | |
1134 | * | |
1135 | * We don't bother to take a lock here to protect these | |
f953ccd0 ON |
1136 | * p->signal fields because the whole thread group is dead |
1137 | * and nobody can change them. | |
1138 | * | |
dcca3475 | 1139 | * psig->stats_lock also protects us from our sub-threads |
f953ccd0 ON |
1140 | * which can reap other children at the same time. Until |
1141 | * we change k_getrusage()-like users to rely on this lock | |
1142 | * we have to take ->siglock as well. | |
0cf55e1e | 1143 | * |
a0be55de IA |
1144 | * We use thread_group_cputime_adjusted() to get times for |
1145 | * the thread group, which consolidates times for all threads | |
1146 | * in the group including the group leader. | |
1da177e4 | 1147 | */ |
e80d0a1a | 1148 | thread_group_cputime_adjusted(p, &tgutime, &tgstime); |
f953ccd0 | 1149 | spin_lock_irq(¤t->sighand->siglock); |
e78c3496 | 1150 | write_seqlock(&psig->stats_lock); |
64861634 MS |
1151 | psig->cutime += tgutime + sig->cutime; |
1152 | psig->cstime += tgstime + sig->cstime; | |
6fac4829 | 1153 | psig->cgtime += task_gtime(p) + sig->gtime + sig->cgtime; |
3795e161 JJ |
1154 | psig->cmin_flt += |
1155 | p->min_flt + sig->min_flt + sig->cmin_flt; | |
1156 | psig->cmaj_flt += | |
1157 | p->maj_flt + sig->maj_flt + sig->cmaj_flt; | |
1158 | psig->cnvcsw += | |
1159 | p->nvcsw + sig->nvcsw + sig->cnvcsw; | |
1160 | psig->cnivcsw += | |
1161 | p->nivcsw + sig->nivcsw + sig->cnivcsw; | |
6eaeeaba ED |
1162 | psig->cinblock += |
1163 | task_io_get_inblock(p) + | |
1164 | sig->inblock + sig->cinblock; | |
1165 | psig->coublock += | |
1166 | task_io_get_oublock(p) + | |
1167 | sig->oublock + sig->coublock; | |
1f10206c JP |
1168 | maxrss = max(sig->maxrss, sig->cmaxrss); |
1169 | if (psig->cmaxrss < maxrss) | |
1170 | psig->cmaxrss = maxrss; | |
5995477a AR |
1171 | task_io_accounting_add(&psig->ioac, &p->ioac); |
1172 | task_io_accounting_add(&psig->ioac, &sig->ioac); | |
e78c3496 | 1173 | write_sequnlock(&psig->stats_lock); |
f953ccd0 | 1174 | spin_unlock_irq(¤t->sighand->siglock); |
1da177e4 LT |
1175 | } |
1176 | ||
ce72a16f AV |
1177 | if (wo->wo_rusage) |
1178 | getrusage(p, RUSAGE_BOTH, wo->wo_rusage); | |
1da177e4 LT |
1179 | status = (p->signal->flags & SIGNAL_GROUP_EXIT) |
1180 | ? p->signal->group_exit_code : p->exit_code; | |
359566fa | 1181 | wo->wo_stat = status; |
2f4e6e2a | 1182 | |
b4360690 | 1183 | if (state == EXIT_TRACE) { |
1da177e4 | 1184 | write_lock_irq(&tasklist_lock); |
2f4e6e2a ON |
1185 | /* We dropped tasklist, ptracer could die and untrace */ |
1186 | ptrace_unlink(p); | |
b4360690 ON |
1187 | |
1188 | /* If parent wants a zombie, don't release it now */ | |
1189 | state = EXIT_ZOMBIE; | |
1190 | if (do_notify_parent(p, p->exit_signal)) | |
1191 | state = EXIT_DEAD; | |
abd50b39 | 1192 | p->exit_state = state; |
1da177e4 LT |
1193 | write_unlock_irq(&tasklist_lock); |
1194 | } | |
abd50b39 | 1195 | if (state == EXIT_DEAD) |
1da177e4 | 1196 | release_task(p); |
2f4e6e2a | 1197 | |
76d9871e AV |
1198 | out_info: |
1199 | infop = wo->wo_info; | |
1200 | if (infop) { | |
1201 | if ((status & 0x7f) == 0) { | |
1202 | infop->cause = CLD_EXITED; | |
1203 | infop->status = status >> 8; | |
1204 | } else { | |
1205 | infop->cause = (status & 0x80) ? CLD_DUMPED : CLD_KILLED; | |
1206 | infop->status = status & 0x7f; | |
1207 | } | |
1208 | infop->pid = pid; | |
1209 | infop->uid = uid; | |
1210 | } | |
1211 | ||
67d7ddde | 1212 | return pid; |
1da177e4 LT |
1213 | } |
1214 | ||
90bc8d8b ON |
1215 | static int *task_stopped_code(struct task_struct *p, bool ptrace) |
1216 | { | |
1217 | if (ptrace) { | |
570ac933 | 1218 | if (task_is_traced(p) && !(p->jobctl & JOBCTL_LISTENING)) |
90bc8d8b ON |
1219 | return &p->exit_code; |
1220 | } else { | |
1221 | if (p->signal->flags & SIGNAL_STOP_STOPPED) | |
1222 | return &p->signal->group_exit_code; | |
1223 | } | |
1224 | return NULL; | |
1225 | } | |
1226 | ||
19e27463 TH |
1227 | /** |
1228 | * wait_task_stopped - Wait for %TASK_STOPPED or %TASK_TRACED | |
1229 | * @wo: wait options | |
1230 | * @ptrace: is the wait for ptrace | |
1231 | * @p: task to wait for | |
1232 | * | |
1233 | * Handle sys_wait4() work for %p in state %TASK_STOPPED or %TASK_TRACED. | |
1234 | * | |
1235 | * CONTEXT: | |
1236 | * read_lock(&tasklist_lock), which is released if return value is | |
1237 | * non-zero. Also, grabs and releases @p->sighand->siglock. | |
1238 | * | |
1239 | * RETURNS: | |
1240 | * 0 if wait condition didn't exist and search for other wait conditions | |
1241 | * should continue. Non-zero return, -errno on failure and @p's pid on | |
1242 | * success, implies that tasklist_lock is released and wait condition | |
1243 | * search should terminate. | |
1da177e4 | 1244 | */ |
9e8ae01d ON |
1245 | static int wait_task_stopped(struct wait_opts *wo, |
1246 | int ptrace, struct task_struct *p) | |
1da177e4 | 1247 | { |
67d7ddde AV |
1248 | struct waitid_info *infop; |
1249 | int exit_code, *p_code, why; | |
ee7c82da | 1250 | uid_t uid = 0; /* unneeded, required by compiler */ |
c8950783 | 1251 | pid_t pid; |
1da177e4 | 1252 | |
47918025 ON |
1253 | /* |
1254 | * Traditionally we see ptrace'd stopped tasks regardless of options. | |
1255 | */ | |
9e8ae01d | 1256 | if (!ptrace && !(wo->wo_flags & WUNTRACED)) |
98abed02 RM |
1257 | return 0; |
1258 | ||
19e27463 TH |
1259 | if (!task_stopped_code(p, ptrace)) |
1260 | return 0; | |
1261 | ||
ee7c82da ON |
1262 | exit_code = 0; |
1263 | spin_lock_irq(&p->sighand->siglock); | |
1264 | ||
90bc8d8b ON |
1265 | p_code = task_stopped_code(p, ptrace); |
1266 | if (unlikely(!p_code)) | |
ee7c82da ON |
1267 | goto unlock_sig; |
1268 | ||
90bc8d8b | 1269 | exit_code = *p_code; |
ee7c82da ON |
1270 | if (!exit_code) |
1271 | goto unlock_sig; | |
1272 | ||
9e8ae01d | 1273 | if (!unlikely(wo->wo_flags & WNOWAIT)) |
90bc8d8b | 1274 | *p_code = 0; |
ee7c82da | 1275 | |
8ca937a6 | 1276 | uid = from_kuid_munged(current_user_ns(), task_uid(p)); |
ee7c82da ON |
1277 | unlock_sig: |
1278 | spin_unlock_irq(&p->sighand->siglock); | |
1279 | if (!exit_code) | |
1da177e4 LT |
1280 | return 0; |
1281 | ||
1282 | /* | |
1283 | * Now we are pretty sure this task is interesting. | |
1284 | * Make sure it doesn't get reaped out from under us while we | |
1285 | * give up the lock and then examine it below. We don't want to | |
1286 | * keep holding onto the tasklist_lock while we call getrusage and | |
1287 | * possibly take page faults for user memory. | |
1288 | */ | |
1289 | get_task_struct(p); | |
6c5f3e7b | 1290 | pid = task_pid_vnr(p); |
f470021a | 1291 | why = ptrace ? CLD_TRAPPED : CLD_STOPPED; |
1da177e4 | 1292 | read_unlock(&tasklist_lock); |
1029a2b5 | 1293 | sched_annotate_sleep(); |
e61a2502 AV |
1294 | if (wo->wo_rusage) |
1295 | getrusage(p, RUSAGE_BOTH, wo->wo_rusage); | |
bb380ec3 | 1296 | put_task_struct(p); |
1da177e4 | 1297 | |
bb380ec3 AV |
1298 | if (likely(!(wo->wo_flags & WNOWAIT))) |
1299 | wo->wo_stat = (exit_code << 8) | 0x7f; | |
1da177e4 | 1300 | |
9e8ae01d | 1301 | infop = wo->wo_info; |
67d7ddde AV |
1302 | if (infop) { |
1303 | infop->cause = why; | |
1304 | infop->status = exit_code; | |
1305 | infop->pid = pid; | |
1306 | infop->uid = uid; | |
1307 | } | |
67d7ddde | 1308 | return pid; |
1da177e4 LT |
1309 | } |
1310 | ||
1311 | /* | |
1312 | * Handle do_wait work for one task in a live, non-stopped state. | |
1313 | * read_lock(&tasklist_lock) on entry. If we return zero, we still hold | |
1314 | * the lock and this task is uninteresting. If we return nonzero, we have | |
1315 | * released the lock and the system call should return. | |
1316 | */ | |
9e8ae01d | 1317 | static int wait_task_continued(struct wait_opts *wo, struct task_struct *p) |
1da177e4 | 1318 | { |
bb380ec3 | 1319 | struct waitid_info *infop; |
1da177e4 LT |
1320 | pid_t pid; |
1321 | uid_t uid; | |
1322 | ||
9e8ae01d | 1323 | if (!unlikely(wo->wo_flags & WCONTINUED)) |
98abed02 RM |
1324 | return 0; |
1325 | ||
1da177e4 LT |
1326 | if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) |
1327 | return 0; | |
1328 | ||
1329 | spin_lock_irq(&p->sighand->siglock); | |
1330 | /* Re-check with the lock held. */ | |
1331 | if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) { | |
1332 | spin_unlock_irq(&p->sighand->siglock); | |
1333 | return 0; | |
1334 | } | |
9e8ae01d | 1335 | if (!unlikely(wo->wo_flags & WNOWAIT)) |
1da177e4 | 1336 | p->signal->flags &= ~SIGNAL_STOP_CONTINUED; |
8ca937a6 | 1337 | uid = from_kuid_munged(current_user_ns(), task_uid(p)); |
1da177e4 LT |
1338 | spin_unlock_irq(&p->sighand->siglock); |
1339 | ||
6c5f3e7b | 1340 | pid = task_pid_vnr(p); |
1da177e4 LT |
1341 | get_task_struct(p); |
1342 | read_unlock(&tasklist_lock); | |
1029a2b5 | 1343 | sched_annotate_sleep(); |
e61a2502 AV |
1344 | if (wo->wo_rusage) |
1345 | getrusage(p, RUSAGE_BOTH, wo->wo_rusage); | |
bb380ec3 | 1346 | put_task_struct(p); |
1da177e4 | 1347 | |
bb380ec3 AV |
1348 | infop = wo->wo_info; |
1349 | if (!infop) { | |
359566fa | 1350 | wo->wo_stat = 0xffff; |
1da177e4 | 1351 | } else { |
bb380ec3 AV |
1352 | infop->cause = CLD_CONTINUED; |
1353 | infop->pid = pid; | |
1354 | infop->uid = uid; | |
1355 | infop->status = SIGCONT; | |
1da177e4 | 1356 | } |
bb380ec3 | 1357 | return pid; |
1da177e4 LT |
1358 | } |
1359 | ||
98abed02 RM |
1360 | /* |
1361 | * Consider @p for a wait by @parent. | |
1362 | * | |
9e8ae01d | 1363 | * -ECHILD should be in ->notask_error before the first call. |
98abed02 RM |
1364 | * Returns nonzero for a final return, when we have unlocked tasklist_lock. |
1365 | * Returns zero if the search for a child should continue; | |
9e8ae01d | 1366 | * then ->notask_error is 0 if @p is an eligible child, |
3a2f5a59 | 1367 | * or still -ECHILD. |
98abed02 | 1368 | */ |
b6e763f0 ON |
1369 | static int wait_consider_task(struct wait_opts *wo, int ptrace, |
1370 | struct task_struct *p) | |
98abed02 | 1371 | { |
3245d6ac ON |
1372 | /* |
1373 | * We can race with wait_task_zombie() from another thread. | |
1374 | * Ensure that EXIT_ZOMBIE -> EXIT_DEAD/EXIT_TRACE transition | |
1375 | * can't confuse the checks below. | |
1376 | */ | |
6aa7de05 | 1377 | int exit_state = READ_ONCE(p->exit_state); |
b3ab0316 ON |
1378 | int ret; |
1379 | ||
3245d6ac | 1380 | if (unlikely(exit_state == EXIT_DEAD)) |
b3ab0316 ON |
1381 | return 0; |
1382 | ||
bf959931 | 1383 | ret = eligible_child(wo, ptrace, p); |
14dd0b81 | 1384 | if (!ret) |
98abed02 RM |
1385 | return ret; |
1386 | ||
3245d6ac | 1387 | if (unlikely(exit_state == EXIT_TRACE)) { |
50b8d257 | 1388 | /* |
abd50b39 ON |
1389 | * ptrace == 0 means we are the natural parent. In this case |
1390 | * we should clear notask_error, debugger will notify us. | |
50b8d257 | 1391 | */ |
abd50b39 | 1392 | if (likely(!ptrace)) |
50b8d257 | 1393 | wo->notask_error = 0; |
823b018e | 1394 | return 0; |
50b8d257 | 1395 | } |
823b018e | 1396 | |
377d75da ON |
1397 | if (likely(!ptrace) && unlikely(p->ptrace)) { |
1398 | /* | |
1399 | * If it is traced by its real parent's group, just pretend | |
1400 | * the caller is ptrace_do_wait() and reap this child if it | |
1401 | * is zombie. | |
1402 | * | |
1403 | * This also hides group stop state from real parent; otherwise | |
1404 | * a single stop can be reported twice as group and ptrace stop. | |
1405 | * If a ptracer wants to distinguish these two events for its | |
1406 | * own children it should create a separate process which takes | |
1407 | * the role of real parent. | |
1408 | */ | |
1409 | if (!ptrace_reparented(p)) | |
1410 | ptrace = 1; | |
1411 | } | |
1412 | ||
45cb24a1 | 1413 | /* slay zombie? */ |
3245d6ac | 1414 | if (exit_state == EXIT_ZOMBIE) { |
9b84cca2 | 1415 | /* we don't reap group leaders with subthreads */ |
7c733eb3 ON |
1416 | if (!delay_group_leader(p)) { |
1417 | /* | |
1418 | * A zombie ptracee is only visible to its ptracer. | |
1419 | * Notification and reaping will be cascaded to the | |
1420 | * real parent when the ptracer detaches. | |
1421 | */ | |
1422 | if (unlikely(ptrace) || likely(!p->ptrace)) | |
1423 | return wait_task_zombie(wo, p); | |
1424 | } | |
98abed02 | 1425 | |
f470021a | 1426 | /* |
9b84cca2 TH |
1427 | * Allow access to stopped/continued state via zombie by |
1428 | * falling through. Clearing of notask_error is complex. | |
1429 | * | |
1430 | * When !@ptrace: | |
1431 | * | |
1432 | * If WEXITED is set, notask_error should naturally be | |
1433 | * cleared. If not, subset of WSTOPPED|WCONTINUED is set, | |
1434 | * so, if there are live subthreads, there are events to | |
1435 | * wait for. If all subthreads are dead, it's still safe | |
1436 | * to clear - this function will be called again in finite | |
1437 | * amount time once all the subthreads are released and | |
1438 | * will then return without clearing. | |
1439 | * | |
1440 | * When @ptrace: | |
1441 | * | |
1442 | * Stopped state is per-task and thus can't change once the | |
1443 | * target task dies. Only continued and exited can happen. | |
1444 | * Clear notask_error if WCONTINUED | WEXITED. | |
1445 | */ | |
1446 | if (likely(!ptrace) || (wo->wo_flags & (WCONTINUED | WEXITED))) | |
1447 | wo->notask_error = 0; | |
1448 | } else { | |
1449 | /* | |
1450 | * @p is alive and it's gonna stop, continue or exit, so | |
1451 | * there always is something to wait for. | |
f470021a | 1452 | */ |
9e8ae01d | 1453 | wo->notask_error = 0; |
f470021a RM |
1454 | } |
1455 | ||
98abed02 | 1456 | /* |
45cb24a1 TH |
1457 | * Wait for stopped. Depending on @ptrace, different stopped state |
1458 | * is used and the two don't interact with each other. | |
98abed02 | 1459 | */ |
19e27463 TH |
1460 | ret = wait_task_stopped(wo, ptrace, p); |
1461 | if (ret) | |
1462 | return ret; | |
98abed02 RM |
1463 | |
1464 | /* | |
45cb24a1 TH |
1465 | * Wait for continued. There's only one continued state and the |
1466 | * ptracer can consume it which can confuse the real parent. Don't | |
1467 | * use WCONTINUED from ptracer. You don't need or want it. | |
98abed02 | 1468 | */ |
9e8ae01d | 1469 | return wait_task_continued(wo, p); |
98abed02 RM |
1470 | } |
1471 | ||
1472 | /* | |
1473 | * Do the work of do_wait() for one thread in the group, @tsk. | |
1474 | * | |
9e8ae01d | 1475 | * -ECHILD should be in ->notask_error before the first call. |
98abed02 RM |
1476 | * Returns nonzero for a final return, when we have unlocked tasklist_lock. |
1477 | * Returns zero if the search for a child should continue; then | |
9e8ae01d | 1478 | * ->notask_error is 0 if there were any eligible children, |
3a2f5a59 | 1479 | * or still -ECHILD. |
98abed02 | 1480 | */ |
9e8ae01d | 1481 | static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk) |
98abed02 RM |
1482 | { |
1483 | struct task_struct *p; | |
1484 | ||
1485 | list_for_each_entry(p, &tsk->children, sibling) { | |
9cd80bbb | 1486 | int ret = wait_consider_task(wo, 0, p); |
a0be55de | 1487 | |
9cd80bbb ON |
1488 | if (ret) |
1489 | return ret; | |
98abed02 RM |
1490 | } |
1491 | ||
1492 | return 0; | |
1493 | } | |
1494 | ||
9e8ae01d | 1495 | static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk) |
98abed02 RM |
1496 | { |
1497 | struct task_struct *p; | |
1498 | ||
f470021a | 1499 | list_for_each_entry(p, &tsk->ptraced, ptrace_entry) { |
b6e763f0 | 1500 | int ret = wait_consider_task(wo, 1, p); |
a0be55de | 1501 | |
f470021a | 1502 | if (ret) |
98abed02 | 1503 | return ret; |
98abed02 RM |
1504 | } |
1505 | ||
1506 | return 0; | |
1507 | } | |
1508 | ||
ac6424b9 | 1509 | static int child_wait_callback(wait_queue_entry_t *wait, unsigned mode, |
0b7570e7 ON |
1510 | int sync, void *key) |
1511 | { | |
1512 | struct wait_opts *wo = container_of(wait, struct wait_opts, | |
1513 | child_wait); | |
1514 | struct task_struct *p = key; | |
1515 | ||
5c01ba49 | 1516 | if (!eligible_pid(wo, p)) |
0b7570e7 ON |
1517 | return 0; |
1518 | ||
b4fe5182 ON |
1519 | if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent) |
1520 | return 0; | |
1521 | ||
0b7570e7 ON |
1522 | return default_wake_function(wait, mode, sync, key); |
1523 | } | |
1524 | ||
a7f0765e ON |
1525 | void __wake_up_parent(struct task_struct *p, struct task_struct *parent) |
1526 | { | |
0b7570e7 | 1527 | __wake_up_sync_key(&parent->signal->wait_chldexit, |
ce4dd442 | 1528 | TASK_INTERRUPTIBLE, p); |
a7f0765e ON |
1529 | } |
1530 | ||
5449162a JN |
1531 | static bool is_effectively_child(struct wait_opts *wo, bool ptrace, |
1532 | struct task_struct *target) | |
1533 | { | |
1534 | struct task_struct *parent = | |
1535 | !ptrace ? target->real_parent : target->parent; | |
1536 | ||
1537 | return current == parent || (!(wo->wo_flags & __WNOTHREAD) && | |
1538 | same_thread_group(current, parent)); | |
1539 | } | |
1540 | ||
1541 | /* | |
1542 | * Optimization for waiting on PIDTYPE_PID. No need to iterate through child | |
1543 | * and tracee lists to find the target task. | |
1544 | */ | |
1545 | static int do_wait_pid(struct wait_opts *wo) | |
1546 | { | |
1547 | bool ptrace; | |
1548 | struct task_struct *target; | |
1549 | int retval; | |
1550 | ||
1551 | ptrace = false; | |
1552 | target = pid_task(wo->wo_pid, PIDTYPE_TGID); | |
1553 | if (target && is_effectively_child(wo, ptrace, target)) { | |
1554 | retval = wait_consider_task(wo, ptrace, target); | |
1555 | if (retval) | |
1556 | return retval; | |
1557 | } | |
1558 | ||
1559 | ptrace = true; | |
1560 | target = pid_task(wo->wo_pid, PIDTYPE_PID); | |
1561 | if (target && target->ptrace && | |
1562 | is_effectively_child(wo, ptrace, target)) { | |
1563 | retval = wait_consider_task(wo, ptrace, target); | |
1564 | if (retval) | |
1565 | return retval; | |
1566 | } | |
1567 | ||
1568 | return 0; | |
1569 | } | |
1570 | ||
9e8ae01d | 1571 | static long do_wait(struct wait_opts *wo) |
1da177e4 | 1572 | { |
98abed02 | 1573 | int retval; |
1da177e4 | 1574 | |
9e8ae01d | 1575 | trace_sched_process_wait(wo->wo_pid); |
0a16b607 | 1576 | |
0b7570e7 ON |
1577 | init_waitqueue_func_entry(&wo->child_wait, child_wait_callback); |
1578 | wo->child_wait.private = current; | |
1579 | add_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); | |
1da177e4 | 1580 | repeat: |
98abed02 | 1581 | /* |
3da56d16 | 1582 | * If there is nothing that can match our criteria, just get out. |
9e8ae01d ON |
1583 | * We will clear ->notask_error to zero if we see any child that |
1584 | * might later match our criteria, even if we are not able to reap | |
1585 | * it yet. | |
98abed02 | 1586 | */ |
64a16caf | 1587 | wo->notask_error = -ECHILD; |
9e8ae01d | 1588 | if ((wo->wo_type < PIDTYPE_MAX) && |
1722c14a | 1589 | (!wo->wo_pid || !pid_has_task(wo->wo_pid, wo->wo_type))) |
64a16caf | 1590 | goto notask; |
161550d7 | 1591 | |
f95d39d1 | 1592 | set_current_state(TASK_INTERRUPTIBLE); |
1da177e4 | 1593 | read_lock(&tasklist_lock); |
9e8ae01d | 1594 | |
5449162a JN |
1595 | if (wo->wo_type == PIDTYPE_PID) { |
1596 | retval = do_wait_pid(wo); | |
64a16caf | 1597 | if (retval) |
98abed02 | 1598 | goto end; |
5449162a JN |
1599 | } else { |
1600 | struct task_struct *tsk = current; | |
1601 | ||
1602 | do { | |
1603 | retval = do_wait_thread(wo, tsk); | |
1604 | if (retval) | |
1605 | goto end; | |
98abed02 | 1606 | |
5449162a JN |
1607 | retval = ptrace_do_wait(wo, tsk); |
1608 | if (retval) | |
1609 | goto end; | |
1610 | ||
1611 | if (wo->wo_flags & __WNOTHREAD) | |
1612 | break; | |
1613 | } while_each_thread(current, tsk); | |
1614 | } | |
1da177e4 | 1615 | read_unlock(&tasklist_lock); |
f2cc3eb1 | 1616 | |
64a16caf | 1617 | notask: |
9e8ae01d ON |
1618 | retval = wo->notask_error; |
1619 | if (!retval && !(wo->wo_flags & WNOHANG)) { | |
1da177e4 | 1620 | retval = -ERESTARTSYS; |
98abed02 RM |
1621 | if (!signal_pending(current)) { |
1622 | schedule(); | |
1623 | goto repeat; | |
1624 | } | |
1da177e4 | 1625 | } |
1da177e4 | 1626 | end: |
f95d39d1 | 1627 | __set_current_state(TASK_RUNNING); |
0b7570e7 | 1628 | remove_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); |
1da177e4 LT |
1629 | return retval; |
1630 | } | |
1631 | ||
67d7ddde | 1632 | static long kernel_waitid(int which, pid_t upid, struct waitid_info *infop, |
ce72a16f | 1633 | int options, struct rusage *ru) |
1da177e4 | 1634 | { |
9e8ae01d | 1635 | struct wait_opts wo; |
161550d7 EB |
1636 | struct pid *pid = NULL; |
1637 | enum pid_type type; | |
1da177e4 | 1638 | long ret; |
ba7d25f3 | 1639 | unsigned int f_flags = 0; |
1da177e4 | 1640 | |
91c4e8ea ON |
1641 | if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED| |
1642 | __WNOTHREAD|__WCLONE|__WALL)) | |
1da177e4 LT |
1643 | return -EINVAL; |
1644 | if (!(options & (WEXITED|WSTOPPED|WCONTINUED))) | |
1645 | return -EINVAL; | |
1646 | ||
1647 | switch (which) { | |
1648 | case P_ALL: | |
161550d7 | 1649 | type = PIDTYPE_MAX; |
1da177e4 LT |
1650 | break; |
1651 | case P_PID: | |
161550d7 EB |
1652 | type = PIDTYPE_PID; |
1653 | if (upid <= 0) | |
1da177e4 | 1654 | return -EINVAL; |
3695eae5 CB |
1655 | |
1656 | pid = find_get_pid(upid); | |
1da177e4 LT |
1657 | break; |
1658 | case P_PGID: | |
161550d7 | 1659 | type = PIDTYPE_PGID; |
821cc7b0 | 1660 | if (upid < 0) |
1da177e4 | 1661 | return -EINVAL; |
3695eae5 | 1662 | |
821cc7b0 EB |
1663 | if (upid) |
1664 | pid = find_get_pid(upid); | |
1665 | else | |
1666 | pid = get_task_pid(current, PIDTYPE_PGID); | |
3695eae5 CB |
1667 | break; |
1668 | case P_PIDFD: | |
1669 | type = PIDTYPE_PID; | |
1670 | if (upid < 0) | |
1da177e4 | 1671 | return -EINVAL; |
3695eae5 | 1672 | |
ba7d25f3 | 1673 | pid = pidfd_get_pid(upid, &f_flags); |
3695eae5 CB |
1674 | if (IS_ERR(pid)) |
1675 | return PTR_ERR(pid); | |
ba7d25f3 | 1676 | |
1da177e4 LT |
1677 | break; |
1678 | default: | |
1679 | return -EINVAL; | |
1680 | } | |
1681 | ||
9e8ae01d ON |
1682 | wo.wo_type = type; |
1683 | wo.wo_pid = pid; | |
1684 | wo.wo_flags = options; | |
1685 | wo.wo_info = infop; | |
9e8ae01d | 1686 | wo.wo_rusage = ru; |
ba7d25f3 CB |
1687 | if (f_flags & O_NONBLOCK) |
1688 | wo.wo_flags |= WNOHANG; | |
1689 | ||
9e8ae01d | 1690 | ret = do_wait(&wo); |
ba7d25f3 CB |
1691 | if (!ret && !(options & WNOHANG) && (f_flags & O_NONBLOCK)) |
1692 | ret = -EAGAIN; | |
dfe16dfa | 1693 | |
161550d7 | 1694 | put_pid(pid); |
1da177e4 LT |
1695 | return ret; |
1696 | } | |
1697 | ||
ce72a16f AV |
1698 | SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *, |
1699 | infop, int, options, struct rusage __user *, ru) | |
1700 | { | |
1701 | struct rusage r; | |
67d7ddde AV |
1702 | struct waitid_info info = {.status = 0}; |
1703 | long err = kernel_waitid(which, upid, &info, options, ru ? &r : NULL); | |
634a8160 | 1704 | int signo = 0; |
6c85501f | 1705 | |
634a8160 AV |
1706 | if (err > 0) { |
1707 | signo = SIGCHLD; | |
1708 | err = 0; | |
ce72a16f AV |
1709 | if (ru && copy_to_user(ru, &r, sizeof(struct rusage))) |
1710 | return -EFAULT; | |
1711 | } | |
67d7ddde AV |
1712 | if (!infop) |
1713 | return err; | |
1714 | ||
41cd7805 | 1715 | if (!user_write_access_begin(infop, sizeof(*infop))) |
1c9fec47 | 1716 | return -EFAULT; |
96ca579a | 1717 | |
634a8160 | 1718 | unsafe_put_user(signo, &infop->si_signo, Efault); |
4c48abe9 | 1719 | unsafe_put_user(0, &infop->si_errno, Efault); |
cc731525 | 1720 | unsafe_put_user(info.cause, &infop->si_code, Efault); |
4c48abe9 AV |
1721 | unsafe_put_user(info.pid, &infop->si_pid, Efault); |
1722 | unsafe_put_user(info.uid, &infop->si_uid, Efault); | |
1723 | unsafe_put_user(info.status, &infop->si_status, Efault); | |
41cd7805 | 1724 | user_write_access_end(); |
ce72a16f | 1725 | return err; |
4c48abe9 | 1726 | Efault: |
41cd7805 | 1727 | user_write_access_end(); |
4c48abe9 | 1728 | return -EFAULT; |
ce72a16f AV |
1729 | } |
1730 | ||
92ebce5a AV |
1731 | long kernel_wait4(pid_t upid, int __user *stat_addr, int options, |
1732 | struct rusage *ru) | |
1da177e4 | 1733 | { |
9e8ae01d | 1734 | struct wait_opts wo; |
161550d7 EB |
1735 | struct pid *pid = NULL; |
1736 | enum pid_type type; | |
1da177e4 LT |
1737 | long ret; |
1738 | ||
1739 | if (options & ~(WNOHANG|WUNTRACED|WCONTINUED| | |
1740 | __WNOTHREAD|__WCLONE|__WALL)) | |
1741 | return -EINVAL; | |
161550d7 | 1742 | |
dd83c161 | 1743 | /* -INT_MIN is not defined */ |
1744 | if (upid == INT_MIN) | |
1745 | return -ESRCH; | |
1746 | ||
161550d7 EB |
1747 | if (upid == -1) |
1748 | type = PIDTYPE_MAX; | |
1749 | else if (upid < 0) { | |
1750 | type = PIDTYPE_PGID; | |
1751 | pid = find_get_pid(-upid); | |
1752 | } else if (upid == 0) { | |
1753 | type = PIDTYPE_PGID; | |
2ae448ef | 1754 | pid = get_task_pid(current, PIDTYPE_PGID); |
161550d7 EB |
1755 | } else /* upid > 0 */ { |
1756 | type = PIDTYPE_PID; | |
1757 | pid = find_get_pid(upid); | |
1758 | } | |
1759 | ||
9e8ae01d ON |
1760 | wo.wo_type = type; |
1761 | wo.wo_pid = pid; | |
1762 | wo.wo_flags = options | WEXITED; | |
1763 | wo.wo_info = NULL; | |
359566fa | 1764 | wo.wo_stat = 0; |
9e8ae01d ON |
1765 | wo.wo_rusage = ru; |
1766 | ret = do_wait(&wo); | |
161550d7 | 1767 | put_pid(pid); |
359566fa AV |
1768 | if (ret > 0 && stat_addr && put_user(wo.wo_stat, stat_addr)) |
1769 | ret = -EFAULT; | |
1da177e4 | 1770 | |
1da177e4 LT |
1771 | return ret; |
1772 | } | |
1773 | ||
8043fc14 CH |
1774 | int kernel_wait(pid_t pid, int *stat) |
1775 | { | |
1776 | struct wait_opts wo = { | |
1777 | .wo_type = PIDTYPE_PID, | |
1778 | .wo_pid = find_get_pid(pid), | |
1779 | .wo_flags = WEXITED, | |
1780 | }; | |
1781 | int ret; | |
1782 | ||
1783 | ret = do_wait(&wo); | |
1784 | if (ret > 0 && wo.wo_stat) | |
1785 | *stat = wo.wo_stat; | |
1786 | put_pid(wo.wo_pid); | |
1787 | return ret; | |
1788 | } | |
1789 | ||
ce72a16f AV |
1790 | SYSCALL_DEFINE4(wait4, pid_t, upid, int __user *, stat_addr, |
1791 | int, options, struct rusage __user *, ru) | |
1792 | { | |
1793 | struct rusage r; | |
1794 | long err = kernel_wait4(upid, stat_addr, options, ru ? &r : NULL); | |
1795 | ||
1796 | if (err > 0) { | |
1797 | if (ru && copy_to_user(ru, &r, sizeof(struct rusage))) | |
1798 | return -EFAULT; | |
1799 | } | |
1800 | return err; | |
1801 | } | |
1802 | ||
1da177e4 LT |
1803 | #ifdef __ARCH_WANT_SYS_WAITPID |
1804 | ||
1805 | /* | |
1806 | * sys_waitpid() remains for compatibility. waitpid() should be | |
1807 | * implemented by calling sys_wait4() from libc.a. | |
1808 | */ | |
17da2bd9 | 1809 | SYSCALL_DEFINE3(waitpid, pid_t, pid, int __user *, stat_addr, int, options) |
1da177e4 | 1810 | { |
d300b610 | 1811 | return kernel_wait4(pid, stat_addr, options, NULL); |
1da177e4 LT |
1812 | } |
1813 | ||
1814 | #endif | |
7e95a225 AV |
1815 | |
1816 | #ifdef CONFIG_COMPAT | |
1817 | COMPAT_SYSCALL_DEFINE4(wait4, | |
1818 | compat_pid_t, pid, | |
1819 | compat_uint_t __user *, stat_addr, | |
1820 | int, options, | |
1821 | struct compat_rusage __user *, ru) | |
1822 | { | |
ce72a16f AV |
1823 | struct rusage r; |
1824 | long err = kernel_wait4(pid, stat_addr, options, ru ? &r : NULL); | |
1825 | if (err > 0) { | |
1826 | if (ru && put_compat_rusage(&r, ru)) | |
1827 | return -EFAULT; | |
7e95a225 | 1828 | } |
ce72a16f | 1829 | return err; |
7e95a225 AV |
1830 | } |
1831 | ||
1832 | COMPAT_SYSCALL_DEFINE5(waitid, | |
1833 | int, which, compat_pid_t, pid, | |
1834 | struct compat_siginfo __user *, infop, int, options, | |
1835 | struct compat_rusage __user *, uru) | |
1836 | { | |
7e95a225 | 1837 | struct rusage ru; |
67d7ddde AV |
1838 | struct waitid_info info = {.status = 0}; |
1839 | long err = kernel_waitid(which, pid, &info, options, uru ? &ru : NULL); | |
634a8160 AV |
1840 | int signo = 0; |
1841 | if (err > 0) { | |
1842 | signo = SIGCHLD; | |
1843 | err = 0; | |
6c85501f AV |
1844 | if (uru) { |
1845 | /* kernel_waitid() overwrites everything in ru */ | |
1846 | if (COMPAT_USE_64BIT_TIME) | |
1847 | err = copy_to_user(uru, &ru, sizeof(ru)); | |
1848 | else | |
1849 | err = put_compat_rusage(&ru, uru); | |
1850 | if (err) | |
1851 | return -EFAULT; | |
1852 | } | |
7e95a225 AV |
1853 | } |
1854 | ||
4c48abe9 AV |
1855 | if (!infop) |
1856 | return err; | |
1857 | ||
41cd7805 | 1858 | if (!user_write_access_begin(infop, sizeof(*infop))) |
1c9fec47 | 1859 | return -EFAULT; |
96ca579a | 1860 | |
634a8160 | 1861 | unsafe_put_user(signo, &infop->si_signo, Efault); |
4c48abe9 | 1862 | unsafe_put_user(0, &infop->si_errno, Efault); |
cc731525 | 1863 | unsafe_put_user(info.cause, &infop->si_code, Efault); |
4c48abe9 AV |
1864 | unsafe_put_user(info.pid, &infop->si_pid, Efault); |
1865 | unsafe_put_user(info.uid, &infop->si_uid, Efault); | |
1866 | unsafe_put_user(info.status, &infop->si_status, Efault); | |
41cd7805 | 1867 | user_write_access_end(); |
67d7ddde | 1868 | return err; |
4c48abe9 | 1869 | Efault: |
41cd7805 | 1870 | user_write_access_end(); |
4c48abe9 | 1871 | return -EFAULT; |
7e95a225 AV |
1872 | } |
1873 | #endif | |
7c2c11b2 | 1874 | |
38fd525a EB |
1875 | /** |
1876 | * thread_group_exited - check that a thread group has exited | |
1877 | * @pid: tgid of thread group to be checked. | |
1878 | * | |
1879 | * Test if the thread group represented by tgid has exited (all | |
1880 | * threads are zombies, dead or completely gone). | |
1881 | * | |
1882 | * Return: true if the thread group has exited. false otherwise. | |
1883 | */ | |
1884 | bool thread_group_exited(struct pid *pid) | |
1885 | { | |
1886 | struct task_struct *task; | |
1887 | bool exited; | |
1888 | ||
1889 | rcu_read_lock(); | |
1890 | task = pid_task(pid, PIDTYPE_PID); | |
1891 | exited = !task || | |
1892 | (READ_ONCE(task->exit_state) && thread_group_empty(task)); | |
1893 | rcu_read_unlock(); | |
1894 | ||
1895 | return exited; | |
1896 | } | |
1897 | EXPORT_SYMBOL(thread_group_exited); | |
1898 | ||
7c2c11b2 SM |
1899 | __weak void abort(void) |
1900 | { | |
1901 | BUG(); | |
1902 | ||
1903 | /* if that doesn't kill us, halt */ | |
1904 | panic("Oops failed to kill thread"); | |
1905 | } | |
dc8635b7 | 1906 | EXPORT_SYMBOL(abort); |