]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * linux/kernel/fork.c | |
3 | * | |
4 | * Copyright (C) 1991, 1992 Linus Torvalds | |
5 | */ | |
6 | ||
7 | /* | |
8 | * 'fork.c' contains the help-routines for the 'fork' system call | |
9 | * (see also entry.S and others). | |
10 | * Fork is rather simple, once you get the hang of it, but the memory | |
11 | * management can be a bitch. See 'mm/memory.c': 'copy_page_range()' | |
12 | */ | |
13 | ||
14 | #include <linux/slab.h> | |
15 | #include <linux/sched/autogroup.h> | |
16 | #include <linux/sched/mm.h> | |
17 | #include <linux/sched/coredump.h> | |
18 | #include <linux/sched/user.h> | |
19 | #include <linux/sched/numa_balancing.h> | |
20 | #include <linux/sched/stat.h> | |
21 | #include <linux/sched/task.h> | |
22 | #include <linux/sched/task_stack.h> | |
23 | #include <linux/sched/cputime.h> | |
24 | #include <linux/rtmutex.h> | |
25 | #include <linux/init.h> | |
26 | #include <linux/unistd.h> | |
27 | #include <linux/module.h> | |
28 | #include <linux/vmalloc.h> | |
29 | #include <linux/completion.h> | |
30 | #include <linux/personality.h> | |
31 | #include <linux/mempolicy.h> | |
32 | #include <linux/sem.h> | |
33 | #include <linux/file.h> | |
34 | #include <linux/fdtable.h> | |
35 | #include <linux/iocontext.h> | |
36 | #include <linux/key.h> | |
37 | #include <linux/binfmts.h> | |
38 | #include <linux/mman.h> | |
39 | #include <linux/mmu_notifier.h> | |
40 | #include <linux/hmm.h> | |
41 | #include <linux/fs.h> | |
42 | #include <linux/mm.h> | |
43 | #include <linux/vmacache.h> | |
44 | #include <linux/nsproxy.h> | |
45 | #include <linux/capability.h> | |
46 | #include <linux/cpu.h> | |
47 | #include <linux/cgroup.h> | |
48 | #include <linux/security.h> | |
49 | #include <linux/hugetlb.h> | |
50 | #include <linux/seccomp.h> | |
51 | #include <linux/swap.h> | |
52 | #include <linux/syscalls.h> | |
53 | #include <linux/jiffies.h> | |
54 | #include <linux/futex.h> | |
55 | #include <linux/compat.h> | |
56 | #include <linux/kthread.h> | |
57 | #include <linux/task_io_accounting_ops.h> | |
58 | #include <linux/rcupdate.h> | |
59 | #include <linux/ptrace.h> | |
60 | #include <linux/mount.h> | |
61 | #include <linux/audit.h> | |
62 | #include <linux/memcontrol.h> | |
63 | #include <linux/ftrace.h> | |
64 | #include <linux/proc_fs.h> | |
65 | #include <linux/profile.h> | |
66 | #include <linux/rmap.h> | |
67 | #include <linux/ksm.h> | |
68 | #include <linux/acct.h> | |
69 | #include <linux/userfaultfd_k.h> | |
70 | #include <linux/tsacct_kern.h> | |
71 | #include <linux/cn_proc.h> | |
72 | #include <linux/freezer.h> | |
73 | #include <linux/delayacct.h> | |
74 | #include <linux/taskstats_kern.h> | |
75 | #include <linux/random.h> | |
76 | #include <linux/tty.h> | |
77 | #include <linux/blkdev.h> | |
78 | #include <linux/fs_struct.h> | |
79 | #include <linux/magic.h> | |
80 | #include <linux/perf_event.h> | |
81 | #include <linux/posix-timers.h> | |
82 | #include <linux/user-return-notifier.h> | |
83 | #include <linux/oom.h> | |
84 | #include <linux/khugepaged.h> | |
85 | #include <linux/signalfd.h> | |
86 | #include <linux/uprobes.h> | |
87 | #include <linux/aio.h> | |
88 | #include <linux/compiler.h> | |
89 | #include <linux/sysctl.h> | |
90 | #include <linux/kcov.h> | |
91 | #include <linux/livepatch.h> | |
92 | #include <linux/thread_info.h> | |
93 | ||
94 | #include <asm/pgtable.h> | |
95 | #include <asm/pgalloc.h> | |
96 | #include <linux/uaccess.h> | |
97 | #include <asm/mmu_context.h> | |
98 | #include <asm/cacheflush.h> | |
99 | #include <asm/tlbflush.h> | |
100 | ||
101 | #include <trace/events/sched.h> | |
102 | ||
103 | #define CREATE_TRACE_POINTS | |
104 | #include <trace/events/task.h> | |
105 | #ifdef CONFIG_USER_NS | |
106 | extern int unprivileged_userns_clone; | |
107 | #else | |
108 | #define unprivileged_userns_clone 0 | |
109 | #endif | |
110 | ||
111 | /* | |
112 | * Minimum number of threads to boot the kernel | |
113 | */ | |
114 | #define MIN_THREADS 20 | |
115 | ||
116 | /* | |
117 | * Maximum number of threads | |
118 | */ | |
119 | #define MAX_THREADS FUTEX_TID_MASK | |
120 | ||
121 | /* | |
122 | * Protected counters by write_lock_irq(&tasklist_lock) | |
123 | */ | |
124 | unsigned long total_forks; /* Handle normal Linux uptimes. */ | |
125 | int nr_threads; /* The idle threads do not count.. */ | |
126 | ||
127 | int max_threads; /* tunable limit on nr_threads */ | |
128 | ||
129 | DEFINE_PER_CPU(unsigned long, process_counts) = 0; | |
130 | ||
131 | __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */ | |
132 | ||
133 | #ifdef CONFIG_PROVE_RCU | |
134 | int lockdep_tasklist_lock_is_held(void) | |
135 | { | |
136 | return lockdep_is_held(&tasklist_lock); | |
137 | } | |
138 | EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held); | |
139 | #endif /* #ifdef CONFIG_PROVE_RCU */ | |
140 | ||
141 | int nr_processes(void) | |
142 | { | |
143 | int cpu; | |
144 | int total = 0; | |
145 | ||
146 | for_each_possible_cpu(cpu) | |
147 | total += per_cpu(process_counts, cpu); | |
148 | ||
149 | return total; | |
150 | } | |
151 | ||
152 | void __weak arch_release_task_struct(struct task_struct *tsk) | |
153 | { | |
154 | } | |
155 | ||
156 | #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR | |
157 | static struct kmem_cache *task_struct_cachep; | |
158 | ||
159 | static inline struct task_struct *alloc_task_struct_node(int node) | |
160 | { | |
161 | return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node); | |
162 | } | |
163 | ||
164 | static inline void free_task_struct(struct task_struct *tsk) | |
165 | { | |
166 | kmem_cache_free(task_struct_cachep, tsk); | |
167 | } | |
168 | #endif | |
169 | ||
170 | void __weak arch_release_thread_stack(unsigned long *stack) | |
171 | { | |
172 | } | |
173 | ||
174 | #ifndef CONFIG_ARCH_THREAD_STACK_ALLOCATOR | |
175 | ||
176 | /* | |
177 | * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a | |
178 | * kmemcache based allocator. | |
179 | */ | |
180 | # if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK) | |
181 | ||
182 | #ifdef CONFIG_VMAP_STACK | |
183 | /* | |
184 | * vmalloc() is a bit slow, and calling vfree() enough times will force a TLB | |
185 | * flush. Try to minimize the number of calls by caching stacks. | |
186 | */ | |
187 | #define NR_CACHED_STACKS 2 | |
188 | static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]); | |
189 | ||
190 | static int free_vm_stack_cache(unsigned int cpu) | |
191 | { | |
192 | struct vm_struct **cached_vm_stacks = per_cpu_ptr(cached_stacks, cpu); | |
193 | int i; | |
194 | ||
195 | for (i = 0; i < NR_CACHED_STACKS; i++) { | |
196 | struct vm_struct *vm_stack = cached_vm_stacks[i]; | |
197 | ||
198 | if (!vm_stack) | |
199 | continue; | |
200 | ||
201 | vfree(vm_stack->addr); | |
202 | cached_vm_stacks[i] = NULL; | |
203 | } | |
204 | ||
205 | return 0; | |
206 | } | |
207 | #endif | |
208 | ||
209 | static unsigned long *alloc_thread_stack_node(struct task_struct *tsk, int node) | |
210 | { | |
211 | #ifdef CONFIG_VMAP_STACK | |
212 | void *stack; | |
213 | int i; | |
214 | ||
215 | for (i = 0; i < NR_CACHED_STACKS; i++) { | |
216 | struct vm_struct *s; | |
217 | ||
218 | s = this_cpu_xchg(cached_stacks[i], NULL); | |
219 | ||
220 | if (!s) | |
221 | continue; | |
222 | ||
223 | /* Clear stale pointers from reused stack. */ | |
224 | memset(s->addr, 0, THREAD_SIZE); | |
225 | ||
226 | tsk->stack_vm_area = s; | |
227 | return s->addr; | |
228 | } | |
229 | ||
230 | stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN, | |
231 | VMALLOC_START, VMALLOC_END, | |
232 | THREADINFO_GFP, | |
233 | PAGE_KERNEL, | |
234 | 0, node, __builtin_return_address(0)); | |
235 | ||
236 | /* | |
237 | * We can't call find_vm_area() in interrupt context, and | |
238 | * free_thread_stack() can be called in interrupt context, | |
239 | * so cache the vm_struct. | |
240 | */ | |
241 | if (stack) | |
242 | tsk->stack_vm_area = find_vm_area(stack); | |
243 | return stack; | |
244 | #else | |
245 | struct page *page = alloc_pages_node(node, THREADINFO_GFP, | |
246 | THREAD_SIZE_ORDER); | |
247 | ||
248 | return page ? page_address(page) : NULL; | |
249 | #endif | |
250 | } | |
251 | ||
252 | static inline void free_thread_stack(struct task_struct *tsk) | |
253 | { | |
254 | #ifdef CONFIG_VMAP_STACK | |
255 | if (task_stack_vm_area(tsk)) { | |
256 | int i; | |
257 | ||
258 | for (i = 0; i < NR_CACHED_STACKS; i++) { | |
259 | if (this_cpu_cmpxchg(cached_stacks[i], | |
260 | NULL, tsk->stack_vm_area) != NULL) | |
261 | continue; | |
262 | ||
263 | return; | |
264 | } | |
265 | ||
266 | vfree_atomic(tsk->stack); | |
267 | return; | |
268 | } | |
269 | #endif | |
270 | ||
271 | __free_pages(virt_to_page(tsk->stack), THREAD_SIZE_ORDER); | |
272 | } | |
273 | # else | |
274 | static struct kmem_cache *thread_stack_cache; | |
275 | ||
276 | static unsigned long *alloc_thread_stack_node(struct task_struct *tsk, | |
277 | int node) | |
278 | { | |
279 | return kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node); | |
280 | } | |
281 | ||
282 | static void free_thread_stack(struct task_struct *tsk) | |
283 | { | |
284 | kmem_cache_free(thread_stack_cache, tsk->stack); | |
285 | } | |
286 | ||
287 | void thread_stack_cache_init(void) | |
288 | { | |
289 | thread_stack_cache = kmem_cache_create("thread_stack", THREAD_SIZE, | |
290 | THREAD_SIZE, 0, NULL); | |
291 | BUG_ON(thread_stack_cache == NULL); | |
292 | } | |
293 | # endif | |
294 | #endif | |
295 | ||
296 | /* SLAB cache for signal_struct structures (tsk->signal) */ | |
297 | static struct kmem_cache *signal_cachep; | |
298 | ||
299 | /* SLAB cache for sighand_struct structures (tsk->sighand) */ | |
300 | struct kmem_cache *sighand_cachep; | |
301 | ||
302 | /* SLAB cache for files_struct structures (tsk->files) */ | |
303 | struct kmem_cache *files_cachep; | |
304 | ||
305 | /* SLAB cache for fs_struct structures (tsk->fs) */ | |
306 | struct kmem_cache *fs_cachep; | |
307 | ||
308 | /* SLAB cache for vm_area_struct structures */ | |
309 | static struct kmem_cache *vm_area_cachep; | |
310 | ||
311 | /* SLAB cache for mm_struct structures (tsk->mm) */ | |
312 | static struct kmem_cache *mm_cachep; | |
313 | ||
314 | struct vm_area_struct *vm_area_alloc(struct mm_struct *mm) | |
315 | { | |
316 | struct vm_area_struct *vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL); | |
317 | ||
318 | if (vma) { | |
319 | vma->vm_mm = mm; | |
320 | INIT_LIST_HEAD(&vma->anon_vma_chain); | |
321 | } | |
322 | return vma; | |
323 | } | |
324 | ||
325 | struct vm_area_struct *vm_area_dup(struct vm_area_struct *orig) | |
326 | { | |
327 | struct vm_area_struct *new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL); | |
328 | ||
329 | if (new) { | |
330 | *new = *orig; | |
331 | INIT_LIST_HEAD(&new->anon_vma_chain); | |
332 | } | |
333 | return new; | |
334 | } | |
335 | ||
336 | void vm_area_free(struct vm_area_struct *vma) | |
337 | { | |
338 | kmem_cache_free(vm_area_cachep, vma); | |
339 | } | |
340 | ||
341 | static void account_kernel_stack(struct task_struct *tsk, int account) | |
342 | { | |
343 | void *stack = task_stack_page(tsk); | |
344 | struct vm_struct *vm = task_stack_vm_area(tsk); | |
345 | ||
346 | BUILD_BUG_ON(IS_ENABLED(CONFIG_VMAP_STACK) && PAGE_SIZE % 1024 != 0); | |
347 | ||
348 | if (vm) { | |
349 | int i; | |
350 | ||
351 | BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE); | |
352 | ||
353 | for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) { | |
354 | mod_zone_page_state(page_zone(vm->pages[i]), | |
355 | NR_KERNEL_STACK_KB, | |
356 | PAGE_SIZE / 1024 * account); | |
357 | } | |
358 | ||
359 | /* All stack pages belong to the same memcg. */ | |
360 | mod_memcg_page_state(vm->pages[0], MEMCG_KERNEL_STACK_KB, | |
361 | account * (THREAD_SIZE / 1024)); | |
362 | } else { | |
363 | /* | |
364 | * All stack pages are in the same zone and belong to the | |
365 | * same memcg. | |
366 | */ | |
367 | struct page *first_page = virt_to_page(stack); | |
368 | ||
369 | mod_zone_page_state(page_zone(first_page), NR_KERNEL_STACK_KB, | |
370 | THREAD_SIZE / 1024 * account); | |
371 | ||
372 | mod_memcg_page_state(first_page, MEMCG_KERNEL_STACK_KB, | |
373 | account * (THREAD_SIZE / 1024)); | |
374 | } | |
375 | } | |
376 | ||
377 | static void release_task_stack(struct task_struct *tsk) | |
378 | { | |
379 | if (WARN_ON(tsk->state != TASK_DEAD)) | |
380 | return; /* Better to leak the stack than to free prematurely */ | |
381 | ||
382 | account_kernel_stack(tsk, -1); | |
383 | arch_release_thread_stack(tsk->stack); | |
384 | free_thread_stack(tsk); | |
385 | tsk->stack = NULL; | |
386 | #ifdef CONFIG_VMAP_STACK | |
387 | tsk->stack_vm_area = NULL; | |
388 | #endif | |
389 | } | |
390 | ||
391 | #ifdef CONFIG_THREAD_INFO_IN_TASK | |
392 | void put_task_stack(struct task_struct *tsk) | |
393 | { | |
394 | if (atomic_dec_and_test(&tsk->stack_refcount)) | |
395 | release_task_stack(tsk); | |
396 | } | |
397 | #endif | |
398 | ||
399 | void free_task(struct task_struct *tsk) | |
400 | { | |
401 | #ifndef CONFIG_THREAD_INFO_IN_TASK | |
402 | /* | |
403 | * The task is finally done with both the stack and thread_info, | |
404 | * so free both. | |
405 | */ | |
406 | release_task_stack(tsk); | |
407 | #else | |
408 | /* | |
409 | * If the task had a separate stack allocation, it should be gone | |
410 | * by now. | |
411 | */ | |
412 | WARN_ON_ONCE(atomic_read(&tsk->stack_refcount) != 0); | |
413 | #endif | |
414 | rt_mutex_debug_task_free(tsk); | |
415 | ftrace_graph_exit_task(tsk); | |
416 | put_seccomp_filter(tsk); | |
417 | arch_release_task_struct(tsk); | |
418 | if (tsk->flags & PF_KTHREAD) | |
419 | free_kthread_struct(tsk); | |
420 | free_task_struct(tsk); | |
421 | } | |
422 | EXPORT_SYMBOL(free_task); | |
423 | ||
424 | static inline void free_signal_struct(struct signal_struct *sig) | |
425 | { | |
426 | taskstats_tgid_free(sig); | |
427 | sched_autogroup_exit(sig); | |
428 | /* | |
429 | * __mmdrop is not safe to call from softirq context on x86 due to | |
430 | * pgd_dtor so postpone it to the async context | |
431 | */ | |
432 | if (sig->oom_mm) | |
433 | mmdrop_async(sig->oom_mm); | |
434 | kmem_cache_free(signal_cachep, sig); | |
435 | } | |
436 | ||
437 | static inline void put_signal_struct(struct signal_struct *sig) | |
438 | { | |
439 | if (atomic_dec_and_test(&sig->sigcnt)) | |
440 | free_signal_struct(sig); | |
441 | } | |
442 | ||
443 | void __put_task_struct(struct task_struct *tsk) | |
444 | { | |
445 | WARN_ON(!tsk->exit_state); | |
446 | WARN_ON(atomic_read(&tsk->usage)); | |
447 | WARN_ON(tsk == current); | |
448 | ||
449 | cgroup_free(tsk); | |
450 | task_numa_free(tsk, true); | |
451 | security_task_free(tsk); | |
452 | exit_creds(tsk); | |
453 | delayacct_tsk_free(tsk); | |
454 | put_signal_struct(tsk->signal); | |
455 | ||
456 | if (!profile_handoff_task(tsk)) | |
457 | free_task(tsk); | |
458 | } | |
459 | EXPORT_SYMBOL_GPL(__put_task_struct); | |
460 | ||
461 | void __init __weak arch_task_cache_init(void) { } | |
462 | ||
463 | /* | |
464 | * set_max_threads | |
465 | */ | |
466 | static void set_max_threads(unsigned int max_threads_suggested) | |
467 | { | |
468 | u64 threads; | |
469 | ||
470 | /* | |
471 | * The number of threads shall be limited such that the thread | |
472 | * structures may only consume a small part of the available memory. | |
473 | */ | |
474 | if (fls64(totalram_pages) + fls64(PAGE_SIZE) > 64) | |
475 | threads = MAX_THREADS; | |
476 | else | |
477 | threads = div64_u64((u64) totalram_pages * (u64) PAGE_SIZE, | |
478 | (u64) THREAD_SIZE * 8UL); | |
479 | ||
480 | if (threads > max_threads_suggested) | |
481 | threads = max_threads_suggested; | |
482 | ||
483 | max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS); | |
484 | } | |
485 | ||
486 | #ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT | |
487 | /* Initialized by the architecture: */ | |
488 | int arch_task_struct_size __read_mostly; | |
489 | #endif | |
490 | ||
491 | void __init fork_init(void) | |
492 | { | |
493 | int i; | |
494 | #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR | |
495 | #ifndef ARCH_MIN_TASKALIGN | |
496 | #define ARCH_MIN_TASKALIGN 0 | |
497 | #endif | |
498 | int align = max_t(int, L1_CACHE_BYTES, ARCH_MIN_TASKALIGN); | |
499 | ||
500 | /* create a slab on which task_structs can be allocated */ | |
501 | task_struct_cachep = kmem_cache_create("task_struct", | |
502 | arch_task_struct_size, align, | |
503 | SLAB_PANIC|SLAB_ACCOUNT, NULL); | |
504 | #endif | |
505 | ||
506 | /* do the arch specific task caches init */ | |
507 | arch_task_cache_init(); | |
508 | ||
509 | set_max_threads(MAX_THREADS); | |
510 | ||
511 | init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2; | |
512 | init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2; | |
513 | init_task.signal->rlim[RLIMIT_SIGPENDING] = | |
514 | init_task.signal->rlim[RLIMIT_NPROC]; | |
515 | ||
516 | for (i = 0; i < UCOUNT_COUNTS; i++) { | |
517 | init_user_ns.ucount_max[i] = max_threads/2; | |
518 | } | |
519 | ||
520 | #ifdef CONFIG_VMAP_STACK | |
521 | cpuhp_setup_state(CPUHP_BP_PREPARE_DYN, "fork:vm_stack_cache", | |
522 | NULL, free_vm_stack_cache); | |
523 | #endif | |
524 | ||
525 | lockdep_init_task(&init_task); | |
526 | } | |
527 | ||
528 | int __weak arch_dup_task_struct(struct task_struct *dst, | |
529 | struct task_struct *src) | |
530 | { | |
531 | *dst = *src; | |
532 | return 0; | |
533 | } | |
534 | ||
535 | void set_task_stack_end_magic(struct task_struct *tsk) | |
536 | { | |
537 | unsigned long *stackend; | |
538 | ||
539 | stackend = end_of_stack(tsk); | |
540 | *stackend = STACK_END_MAGIC; /* for overflow detection */ | |
541 | } | |
542 | ||
543 | static struct task_struct *dup_task_struct(struct task_struct *orig, int node) | |
544 | { | |
545 | struct task_struct *tsk; | |
546 | unsigned long *stack; | |
547 | struct vm_struct *stack_vm_area; | |
548 | int err; | |
549 | ||
550 | if (node == NUMA_NO_NODE) | |
551 | node = tsk_fork_get_node(orig); | |
552 | tsk = alloc_task_struct_node(node); | |
553 | if (!tsk) | |
554 | return NULL; | |
555 | ||
556 | stack = alloc_thread_stack_node(tsk, node); | |
557 | if (!stack) | |
558 | goto free_tsk; | |
559 | ||
560 | stack_vm_area = task_stack_vm_area(tsk); | |
561 | ||
562 | err = arch_dup_task_struct(tsk, orig); | |
563 | ||
564 | /* | |
565 | * arch_dup_task_struct() clobbers the stack-related fields. Make | |
566 | * sure they're properly initialized before using any stack-related | |
567 | * functions again. | |
568 | */ | |
569 | tsk->stack = stack; | |
570 | #ifdef CONFIG_VMAP_STACK | |
571 | tsk->stack_vm_area = stack_vm_area; | |
572 | #endif | |
573 | #ifdef CONFIG_THREAD_INFO_IN_TASK | |
574 | atomic_set(&tsk->stack_refcount, 1); | |
575 | #endif | |
576 | ||
577 | if (err) | |
578 | goto free_stack; | |
579 | ||
580 | #ifdef CONFIG_SECCOMP | |
581 | /* | |
582 | * We must handle setting up seccomp filters once we're under | |
583 | * the sighand lock in case orig has changed between now and | |
584 | * then. Until then, filter must be NULL to avoid messing up | |
585 | * the usage counts on the error path calling free_task. | |
586 | */ | |
587 | tsk->seccomp.filter = NULL; | |
588 | #endif | |
589 | ||
590 | setup_thread_stack(tsk, orig); | |
591 | clear_user_return_notifier(tsk); | |
592 | clear_tsk_need_resched(tsk); | |
593 | set_task_stack_end_magic(tsk); | |
594 | ||
595 | #ifdef CONFIG_CC_STACKPROTECTOR | |
596 | tsk->stack_canary = get_random_canary(); | |
597 | #endif | |
598 | ||
599 | /* | |
600 | * One for us, one for whoever does the "release_task()" (usually | |
601 | * parent) | |
602 | */ | |
603 | atomic_set(&tsk->usage, 2); | |
604 | #ifdef CONFIG_BLK_DEV_IO_TRACE | |
605 | tsk->btrace_seq = 0; | |
606 | #endif | |
607 | tsk->splice_pipe = NULL; | |
608 | tsk->task_frag.page = NULL; | |
609 | tsk->wake_q.next = NULL; | |
610 | ||
611 | account_kernel_stack(tsk, 1); | |
612 | ||
613 | kcov_task_init(tsk); | |
614 | ||
615 | #ifdef CONFIG_FAULT_INJECTION | |
616 | tsk->fail_nth = 0; | |
617 | #endif | |
618 | ||
619 | return tsk; | |
620 | ||
621 | free_stack: | |
622 | free_thread_stack(tsk); | |
623 | free_tsk: | |
624 | free_task_struct(tsk); | |
625 | return NULL; | |
626 | } | |
627 | ||
628 | #ifdef CONFIG_MMU | |
629 | static __latent_entropy int dup_mmap(struct mm_struct *mm, | |
630 | struct mm_struct *oldmm) | |
631 | { | |
632 | struct vm_area_struct *mpnt, *tmp, *prev, **pprev; | |
633 | struct rb_node **rb_link, *rb_parent; | |
634 | int retval; | |
635 | unsigned long charge; | |
636 | LIST_HEAD(uf); | |
637 | ||
638 | uprobe_start_dup_mmap(); | |
639 | if (down_write_killable(&oldmm->mmap_sem)) { | |
640 | retval = -EINTR; | |
641 | goto fail_uprobe_end; | |
642 | } | |
643 | flush_cache_dup_mm(oldmm); | |
644 | uprobe_dup_mmap(oldmm, mm); | |
645 | /* | |
646 | * Not linked in yet - no deadlock potential: | |
647 | */ | |
648 | down_write_nested(&mm->mmap_sem, SINGLE_DEPTH_NESTING); | |
649 | ||
650 | /* No ordering required: file already has been exposed. */ | |
651 | RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm)); | |
652 | ||
653 | mm->total_vm = oldmm->total_vm; | |
654 | mm->data_vm = oldmm->data_vm; | |
655 | mm->exec_vm = oldmm->exec_vm; | |
656 | mm->stack_vm = oldmm->stack_vm; | |
657 | ||
658 | rb_link = &mm->mm_rb.rb_node; | |
659 | rb_parent = NULL; | |
660 | pprev = &mm->mmap; | |
661 | retval = ksm_fork(mm, oldmm); | |
662 | if (retval) | |
663 | goto out; | |
664 | retval = khugepaged_fork(mm, oldmm); | |
665 | if (retval) | |
666 | goto out; | |
667 | ||
668 | prev = NULL; | |
669 | for (mpnt = oldmm->mmap; mpnt; mpnt = mpnt->vm_next) { | |
670 | struct file *file; | |
671 | ||
672 | if (mpnt->vm_flags & VM_DONTCOPY) { | |
673 | vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt)); | |
674 | continue; | |
675 | } | |
676 | charge = 0; | |
677 | /* | |
678 | * Don't duplicate many vmas if we've been oom-killed (for | |
679 | * example) | |
680 | */ | |
681 | if (fatal_signal_pending(current)) { | |
682 | retval = -EINTR; | |
683 | goto out; | |
684 | } | |
685 | if (mpnt->vm_flags & VM_ACCOUNT) { | |
686 | unsigned long len = vma_pages(mpnt); | |
687 | ||
688 | if (security_vm_enough_memory_mm(oldmm, len)) /* sic */ | |
689 | goto fail_nomem; | |
690 | charge = len; | |
691 | } | |
692 | tmp = vm_area_dup(mpnt); | |
693 | if (!tmp) | |
694 | goto fail_nomem; | |
695 | retval = vma_dup_policy(mpnt, tmp); | |
696 | if (retval) | |
697 | goto fail_nomem_policy; | |
698 | tmp->vm_mm = mm; | |
699 | retval = dup_userfaultfd(tmp, &uf); | |
700 | if (retval) | |
701 | goto fail_nomem_anon_vma_fork; | |
702 | if (tmp->vm_flags & VM_WIPEONFORK) { | |
703 | /* VM_WIPEONFORK gets a clean slate in the child. */ | |
704 | tmp->anon_vma = NULL; | |
705 | if (anon_vma_prepare(tmp)) | |
706 | goto fail_nomem_anon_vma_fork; | |
707 | } else if (anon_vma_fork(tmp, mpnt)) | |
708 | goto fail_nomem_anon_vma_fork; | |
709 | tmp->vm_flags &= ~(VM_LOCKED | VM_LOCKONFAULT); | |
710 | tmp->vm_next = tmp->vm_prev = NULL; | |
711 | file = tmp->vm_file; | |
712 | if (file) { | |
713 | struct inode *inode = file_inode(file); | |
714 | struct address_space *mapping = file->f_mapping; | |
715 | ||
716 | vma_get_file(tmp); | |
717 | if (tmp->vm_flags & VM_DENYWRITE) | |
718 | atomic_dec(&inode->i_writecount); | |
719 | i_mmap_lock_write(mapping); | |
720 | if (tmp->vm_flags & VM_SHARED) | |
721 | atomic_inc(&mapping->i_mmap_writable); | |
722 | flush_dcache_mmap_lock(mapping); | |
723 | /* insert tmp into the share list, just after mpnt */ | |
724 | vma_interval_tree_insert_after(tmp, mpnt, | |
725 | &mapping->i_mmap); | |
726 | flush_dcache_mmap_unlock(mapping); | |
727 | i_mmap_unlock_write(mapping); | |
728 | } | |
729 | ||
730 | /* | |
731 | * Clear hugetlb-related page reserves for children. This only | |
732 | * affects MAP_PRIVATE mappings. Faults generated by the child | |
733 | * are not guaranteed to succeed, even if read-only | |
734 | */ | |
735 | if (is_vm_hugetlb_page(tmp)) | |
736 | reset_vma_resv_huge_pages(tmp); | |
737 | ||
738 | /* | |
739 | * Link in the new vma and copy the page table entries. | |
740 | */ | |
741 | *pprev = tmp; | |
742 | pprev = &tmp->vm_next; | |
743 | tmp->vm_prev = prev; | |
744 | prev = tmp; | |
745 | ||
746 | __vma_link_rb(mm, tmp, rb_link, rb_parent); | |
747 | rb_link = &tmp->vm_rb.rb_right; | |
748 | rb_parent = &tmp->vm_rb; | |
749 | ||
750 | mm->map_count++; | |
751 | if (!(tmp->vm_flags & VM_WIPEONFORK)) | |
752 | retval = copy_page_range(mm, oldmm, mpnt); | |
753 | ||
754 | if (tmp->vm_ops && tmp->vm_ops->open) | |
755 | tmp->vm_ops->open(tmp); | |
756 | ||
757 | if (retval) | |
758 | goto out; | |
759 | } | |
760 | /* a new mm has just been created */ | |
761 | retval = arch_dup_mmap(oldmm, mm); | |
762 | out: | |
763 | up_write(&mm->mmap_sem); | |
764 | flush_tlb_mm(oldmm); | |
765 | up_write(&oldmm->mmap_sem); | |
766 | dup_userfaultfd_complete(&uf); | |
767 | fail_uprobe_end: | |
768 | uprobe_end_dup_mmap(); | |
769 | return retval; | |
770 | fail_nomem_anon_vma_fork: | |
771 | mpol_put(vma_policy(tmp)); | |
772 | fail_nomem_policy: | |
773 | vm_area_free(tmp); | |
774 | fail_nomem: | |
775 | retval = -ENOMEM; | |
776 | vm_unacct_memory(charge); | |
777 | goto out; | |
778 | } | |
779 | ||
780 | static inline int mm_alloc_pgd(struct mm_struct *mm) | |
781 | { | |
782 | mm->pgd = pgd_alloc(mm); | |
783 | if (unlikely(!mm->pgd)) | |
784 | return -ENOMEM; | |
785 | return 0; | |
786 | } | |
787 | ||
788 | static inline void mm_free_pgd(struct mm_struct *mm) | |
789 | { | |
790 | pgd_free(mm, mm->pgd); | |
791 | } | |
792 | #else | |
793 | static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm) | |
794 | { | |
795 | down_write(&oldmm->mmap_sem); | |
796 | RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm)); | |
797 | up_write(&oldmm->mmap_sem); | |
798 | return 0; | |
799 | } | |
800 | #define mm_alloc_pgd(mm) (0) | |
801 | #define mm_free_pgd(mm) | |
802 | #endif /* CONFIG_MMU */ | |
803 | ||
804 | __cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock); | |
805 | ||
806 | #define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL)) | |
807 | #define free_mm(mm) (kmem_cache_free(mm_cachep, (mm))) | |
808 | ||
809 | static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT; | |
810 | ||
811 | static int __init coredump_filter_setup(char *s) | |
812 | { | |
813 | default_dump_filter = | |
814 | (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) & | |
815 | MMF_DUMP_FILTER_MASK; | |
816 | return 1; | |
817 | } | |
818 | ||
819 | __setup("coredump_filter=", coredump_filter_setup); | |
820 | ||
821 | #include <linux/init_task.h> | |
822 | ||
823 | static void mm_init_aio(struct mm_struct *mm) | |
824 | { | |
825 | #ifdef CONFIG_AIO | |
826 | spin_lock_init(&mm->ioctx_lock); | |
827 | mm->ioctx_table = NULL; | |
828 | #endif | |
829 | } | |
830 | ||
831 | static __always_inline void mm_clear_owner(struct mm_struct *mm, | |
832 | struct task_struct *p) | |
833 | { | |
834 | #ifdef CONFIG_MEMCG | |
835 | if (mm->owner == p) | |
836 | WRITE_ONCE(mm->owner, NULL); | |
837 | #endif | |
838 | } | |
839 | ||
840 | static void mm_init_owner(struct mm_struct *mm, struct task_struct *p) | |
841 | { | |
842 | #ifdef CONFIG_MEMCG | |
843 | mm->owner = p; | |
844 | #endif | |
845 | } | |
846 | ||
847 | static void mm_init_uprobes_state(struct mm_struct *mm) | |
848 | { | |
849 | #ifdef CONFIG_UPROBES | |
850 | mm->uprobes_state.xol_area = NULL; | |
851 | #endif | |
852 | } | |
853 | ||
854 | static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p, | |
855 | struct user_namespace *user_ns) | |
856 | { | |
857 | mm->mmap = NULL; | |
858 | mm->mm_rb = RB_ROOT; | |
859 | mm->vmacache_seqnum = 0; | |
860 | atomic_set(&mm->mm_users, 1); | |
861 | atomic_set(&mm->mm_count, 1); | |
862 | init_rwsem(&mm->mmap_sem); | |
863 | INIT_LIST_HEAD(&mm->mmlist); | |
864 | mm->core_state = NULL; | |
865 | mm_pgtables_bytes_init(mm); | |
866 | mm->map_count = 0; | |
867 | mm->locked_vm = 0; | |
868 | mm->pinned_vm = 0; | |
869 | memset(&mm->rss_stat, 0, sizeof(mm->rss_stat)); | |
870 | spin_lock_init(&mm->page_table_lock); | |
871 | mm_init_cpumask(mm); | |
872 | mm_init_aio(mm); | |
873 | mm_init_owner(mm, p); | |
874 | RCU_INIT_POINTER(mm->exe_file, NULL); | |
875 | mmu_notifier_mm_init(mm); | |
876 | hmm_mm_init(mm); | |
877 | init_tlb_flush_pending(mm); | |
878 | #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS | |
879 | mm->pmd_huge_pte = NULL; | |
880 | #endif | |
881 | mm_init_uprobes_state(mm); | |
882 | ||
883 | if (current->mm) { | |
884 | mm->flags = current->mm->flags & MMF_INIT_MASK; | |
885 | mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK; | |
886 | } else { | |
887 | mm->flags = default_dump_filter; | |
888 | mm->def_flags = 0; | |
889 | } | |
890 | ||
891 | if (mm_alloc_pgd(mm)) | |
892 | goto fail_nopgd; | |
893 | ||
894 | if (init_new_context(p, mm)) | |
895 | goto fail_nocontext; | |
896 | ||
897 | mm->user_ns = get_user_ns(user_ns); | |
898 | return mm; | |
899 | ||
900 | fail_nocontext: | |
901 | mm_free_pgd(mm); | |
902 | fail_nopgd: | |
903 | free_mm(mm); | |
904 | return NULL; | |
905 | } | |
906 | ||
907 | static void check_mm(struct mm_struct *mm) | |
908 | { | |
909 | int i; | |
910 | ||
911 | for (i = 0; i < NR_MM_COUNTERS; i++) { | |
912 | long x = atomic_long_read(&mm->rss_stat.count[i]); | |
913 | ||
914 | if (unlikely(x)) | |
915 | printk(KERN_ALERT "BUG: Bad rss-counter state " | |
916 | "mm:%p idx:%d val:%ld\n", mm, i, x); | |
917 | } | |
918 | ||
919 | if (mm_pgtables_bytes(mm)) | |
920 | pr_alert("BUG: non-zero pgtables_bytes on freeing mm: %ld\n", | |
921 | mm_pgtables_bytes(mm)); | |
922 | ||
923 | #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS | |
924 | VM_BUG_ON_MM(mm->pmd_huge_pte, mm); | |
925 | #endif | |
926 | } | |
927 | ||
928 | /* | |
929 | * Allocate and initialize an mm_struct. | |
930 | */ | |
931 | struct mm_struct *mm_alloc(void) | |
932 | { | |
933 | struct mm_struct *mm; | |
934 | ||
935 | mm = allocate_mm(); | |
936 | if (!mm) | |
937 | return NULL; | |
938 | ||
939 | memset(mm, 0, sizeof(*mm)); | |
940 | return mm_init(mm, current, current_user_ns()); | |
941 | } | |
942 | ||
943 | /* | |
944 | * Called when the last reference to the mm | |
945 | * is dropped: either by a lazy thread or by | |
946 | * mmput. Free the page directory and the mm. | |
947 | */ | |
948 | void __mmdrop(struct mm_struct *mm) | |
949 | { | |
950 | BUG_ON(mm == &init_mm); | |
951 | mm_free_pgd(mm); | |
952 | destroy_context(mm); | |
953 | hmm_mm_destroy(mm); | |
954 | mmu_notifier_mm_destroy(mm); | |
955 | check_mm(mm); | |
956 | put_user_ns(mm->user_ns); | |
957 | free_mm(mm); | |
958 | } | |
959 | EXPORT_SYMBOL_GPL(__mmdrop); | |
960 | ||
961 | static inline void __mmput(struct mm_struct *mm) | |
962 | { | |
963 | VM_BUG_ON(atomic_read(&mm->mm_users)); | |
964 | ||
965 | uprobe_clear_state(mm); | |
966 | exit_aio(mm); | |
967 | ksm_exit(mm); | |
968 | khugepaged_exit(mm); /* must run before exit_mmap */ | |
969 | exit_mmap(mm); | |
970 | mm_put_huge_zero_page(mm); | |
971 | set_mm_exe_file(mm, NULL); | |
972 | if (!list_empty(&mm->mmlist)) { | |
973 | spin_lock(&mmlist_lock); | |
974 | list_del(&mm->mmlist); | |
975 | spin_unlock(&mmlist_lock); | |
976 | } | |
977 | if (mm->binfmt) | |
978 | module_put(mm->binfmt->module); | |
979 | mmdrop(mm); | |
980 | } | |
981 | ||
982 | /* | |
983 | * Decrement the use count and release all resources for an mm. | |
984 | */ | |
985 | void mmput(struct mm_struct *mm) | |
986 | { | |
987 | might_sleep(); | |
988 | ||
989 | if (atomic_dec_and_test(&mm->mm_users)) | |
990 | __mmput(mm); | |
991 | } | |
992 | EXPORT_SYMBOL_GPL(mmput); | |
993 | ||
994 | #ifdef CONFIG_MMU | |
995 | static void mmput_async_fn(struct work_struct *work) | |
996 | { | |
997 | struct mm_struct *mm = container_of(work, struct mm_struct, | |
998 | async_put_work); | |
999 | ||
1000 | __mmput(mm); | |
1001 | } | |
1002 | ||
1003 | void mmput_async(struct mm_struct *mm) | |
1004 | { | |
1005 | if (atomic_dec_and_test(&mm->mm_users)) { | |
1006 | INIT_WORK(&mm->async_put_work, mmput_async_fn); | |
1007 | schedule_work(&mm->async_put_work); | |
1008 | } | |
1009 | } | |
1010 | #endif | |
1011 | ||
1012 | /** | |
1013 | * set_mm_exe_file - change a reference to the mm's executable file | |
1014 | * | |
1015 | * This changes mm's executable file (shown as symlink /proc/[pid]/exe). | |
1016 | * | |
1017 | * Main users are mmput() and sys_execve(). Callers prevent concurrent | |
1018 | * invocations: in mmput() nobody alive left, in execve task is single | |
1019 | * threaded. sys_prctl(PR_SET_MM_MAP/EXE_FILE) also needs to set the | |
1020 | * mm->exe_file, but does so without using set_mm_exe_file() in order | |
1021 | * to do avoid the need for any locks. | |
1022 | */ | |
1023 | void set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file) | |
1024 | { | |
1025 | struct file *old_exe_file; | |
1026 | ||
1027 | /* | |
1028 | * It is safe to dereference the exe_file without RCU as | |
1029 | * this function is only called if nobody else can access | |
1030 | * this mm -- see comment above for justification. | |
1031 | */ | |
1032 | old_exe_file = rcu_dereference_raw(mm->exe_file); | |
1033 | ||
1034 | if (new_exe_file) | |
1035 | get_file(new_exe_file); | |
1036 | rcu_assign_pointer(mm->exe_file, new_exe_file); | |
1037 | if (old_exe_file) | |
1038 | fput(old_exe_file); | |
1039 | } | |
1040 | ||
1041 | /** | |
1042 | * get_mm_exe_file - acquire a reference to the mm's executable file | |
1043 | * | |
1044 | * Returns %NULL if mm has no associated executable file. | |
1045 | * User must release file via fput(). | |
1046 | */ | |
1047 | struct file *get_mm_exe_file(struct mm_struct *mm) | |
1048 | { | |
1049 | struct file *exe_file; | |
1050 | ||
1051 | rcu_read_lock(); | |
1052 | exe_file = rcu_dereference(mm->exe_file); | |
1053 | if (exe_file && !get_file_rcu(exe_file)) | |
1054 | exe_file = NULL; | |
1055 | rcu_read_unlock(); | |
1056 | return exe_file; | |
1057 | } | |
1058 | EXPORT_SYMBOL(get_mm_exe_file); | |
1059 | ||
1060 | /** | |
1061 | * get_task_exe_file - acquire a reference to the task's executable file | |
1062 | * | |
1063 | * Returns %NULL if task's mm (if any) has no associated executable file or | |
1064 | * this is a kernel thread with borrowed mm (see the comment above get_task_mm). | |
1065 | * User must release file via fput(). | |
1066 | */ | |
1067 | struct file *get_task_exe_file(struct task_struct *task) | |
1068 | { | |
1069 | struct file *exe_file = NULL; | |
1070 | struct mm_struct *mm; | |
1071 | ||
1072 | task_lock(task); | |
1073 | mm = task->mm; | |
1074 | if (mm) { | |
1075 | if (!(task->flags & PF_KTHREAD)) | |
1076 | exe_file = get_mm_exe_file(mm); | |
1077 | } | |
1078 | task_unlock(task); | |
1079 | return exe_file; | |
1080 | } | |
1081 | EXPORT_SYMBOL(get_task_exe_file); | |
1082 | ||
1083 | /** | |
1084 | * get_task_mm - acquire a reference to the task's mm | |
1085 | * | |
1086 | * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning | |
1087 | * this kernel workthread has transiently adopted a user mm with use_mm, | |
1088 | * to do its AIO) is not set and if so returns a reference to it, after | |
1089 | * bumping up the use count. User must release the mm via mmput() | |
1090 | * after use. Typically used by /proc and ptrace. | |
1091 | */ | |
1092 | struct mm_struct *get_task_mm(struct task_struct *task) | |
1093 | { | |
1094 | struct mm_struct *mm; | |
1095 | ||
1096 | task_lock(task); | |
1097 | mm = task->mm; | |
1098 | if (mm) { | |
1099 | if (task->flags & PF_KTHREAD) | |
1100 | mm = NULL; | |
1101 | else | |
1102 | mmget(mm); | |
1103 | } | |
1104 | task_unlock(task); | |
1105 | return mm; | |
1106 | } | |
1107 | EXPORT_SYMBOL_GPL(get_task_mm); | |
1108 | ||
1109 | struct mm_struct *mm_access(struct task_struct *task, unsigned int mode) | |
1110 | { | |
1111 | struct mm_struct *mm; | |
1112 | int err; | |
1113 | ||
1114 | err = mutex_lock_killable(&task->signal->cred_guard_mutex); | |
1115 | if (err) | |
1116 | return ERR_PTR(err); | |
1117 | ||
1118 | mm = get_task_mm(task); | |
1119 | if (mm && mm != current->mm && | |
1120 | !ptrace_may_access(task, mode)) { | |
1121 | mmput(mm); | |
1122 | mm = ERR_PTR(-EACCES); | |
1123 | } | |
1124 | mutex_unlock(&task->signal->cred_guard_mutex); | |
1125 | ||
1126 | return mm; | |
1127 | } | |
1128 | ||
1129 | static void complete_vfork_done(struct task_struct *tsk) | |
1130 | { | |
1131 | struct completion *vfork; | |
1132 | ||
1133 | task_lock(tsk); | |
1134 | vfork = tsk->vfork_done; | |
1135 | if (likely(vfork)) { | |
1136 | tsk->vfork_done = NULL; | |
1137 | complete(vfork); | |
1138 | } | |
1139 | task_unlock(tsk); | |
1140 | } | |
1141 | ||
1142 | static int wait_for_vfork_done(struct task_struct *child, | |
1143 | struct completion *vfork) | |
1144 | { | |
1145 | int killed; | |
1146 | ||
1147 | freezer_do_not_count(); | |
1148 | killed = wait_for_completion_killable(vfork); | |
1149 | freezer_count(); | |
1150 | ||
1151 | if (killed) { | |
1152 | task_lock(child); | |
1153 | child->vfork_done = NULL; | |
1154 | task_unlock(child); | |
1155 | } | |
1156 | ||
1157 | put_task_struct(child); | |
1158 | return killed; | |
1159 | } | |
1160 | ||
1161 | /* Please note the differences between mmput and mm_release. | |
1162 | * mmput is called whenever we stop holding onto a mm_struct, | |
1163 | * error success whatever. | |
1164 | * | |
1165 | * mm_release is called after a mm_struct has been removed | |
1166 | * from the current process. | |
1167 | * | |
1168 | * This difference is important for error handling, when we | |
1169 | * only half set up a mm_struct for a new process and need to restore | |
1170 | * the old one. Because we mmput the new mm_struct before | |
1171 | * restoring the old one. . . | |
1172 | * Eric Biederman 10 January 1998 | |
1173 | */ | |
1174 | void mm_release(struct task_struct *tsk, struct mm_struct *mm) | |
1175 | { | |
1176 | /* Get rid of any futexes when releasing the mm */ | |
1177 | #ifdef CONFIG_FUTEX | |
1178 | if (unlikely(tsk->robust_list)) { | |
1179 | exit_robust_list(tsk); | |
1180 | tsk->robust_list = NULL; | |
1181 | } | |
1182 | #ifdef CONFIG_COMPAT | |
1183 | if (unlikely(tsk->compat_robust_list)) { | |
1184 | compat_exit_robust_list(tsk); | |
1185 | tsk->compat_robust_list = NULL; | |
1186 | } | |
1187 | #endif | |
1188 | if (unlikely(!list_empty(&tsk->pi_state_list))) | |
1189 | exit_pi_state_list(tsk); | |
1190 | #endif | |
1191 | ||
1192 | uprobe_free_utask(tsk); | |
1193 | ||
1194 | /* Get rid of any cached register state */ | |
1195 | deactivate_mm(tsk, mm); | |
1196 | ||
1197 | /* | |
1198 | * Signal userspace if we're not exiting with a core dump | |
1199 | * because we want to leave the value intact for debugging | |
1200 | * purposes. | |
1201 | */ | |
1202 | if (tsk->clear_child_tid) { | |
1203 | if (!(tsk->signal->flags & SIGNAL_GROUP_COREDUMP) && | |
1204 | atomic_read(&mm->mm_users) > 1) { | |
1205 | /* | |
1206 | * We don't check the error code - if userspace has | |
1207 | * not set up a proper pointer then tough luck. | |
1208 | */ | |
1209 | put_user(0, tsk->clear_child_tid); | |
1210 | sys_futex(tsk->clear_child_tid, FUTEX_WAKE, | |
1211 | 1, NULL, NULL, 0); | |
1212 | } | |
1213 | tsk->clear_child_tid = NULL; | |
1214 | } | |
1215 | ||
1216 | /* | |
1217 | * All done, finally we can wake up parent and return this mm to him. | |
1218 | * Also kthread_stop() uses this completion for synchronization. | |
1219 | */ | |
1220 | if (tsk->vfork_done) | |
1221 | complete_vfork_done(tsk); | |
1222 | } | |
1223 | ||
1224 | /* | |
1225 | * Allocate a new mm structure and copy contents from the | |
1226 | * mm structure of the passed in task structure. | |
1227 | */ | |
1228 | static struct mm_struct *dup_mm(struct task_struct *tsk) | |
1229 | { | |
1230 | struct mm_struct *mm, *oldmm = current->mm; | |
1231 | int err; | |
1232 | ||
1233 | mm = allocate_mm(); | |
1234 | if (!mm) | |
1235 | goto fail_nomem; | |
1236 | ||
1237 | memcpy(mm, oldmm, sizeof(*mm)); | |
1238 | ||
1239 | if (!mm_init(mm, tsk, mm->user_ns)) | |
1240 | goto fail_nomem; | |
1241 | ||
1242 | err = dup_mmap(mm, oldmm); | |
1243 | if (err) | |
1244 | goto free_pt; | |
1245 | ||
1246 | mm->hiwater_rss = get_mm_rss(mm); | |
1247 | mm->hiwater_vm = mm->total_vm; | |
1248 | ||
1249 | if (mm->binfmt && !try_module_get(mm->binfmt->module)) | |
1250 | goto free_pt; | |
1251 | ||
1252 | return mm; | |
1253 | ||
1254 | free_pt: | |
1255 | /* don't put binfmt in mmput, we haven't got module yet */ | |
1256 | mm->binfmt = NULL; | |
1257 | mm_init_owner(mm, NULL); | |
1258 | mmput(mm); | |
1259 | ||
1260 | fail_nomem: | |
1261 | return NULL; | |
1262 | } | |
1263 | ||
1264 | static int copy_mm(unsigned long clone_flags, struct task_struct *tsk) | |
1265 | { | |
1266 | struct mm_struct *mm, *oldmm; | |
1267 | int retval; | |
1268 | ||
1269 | tsk->min_flt = tsk->maj_flt = 0; | |
1270 | tsk->nvcsw = tsk->nivcsw = 0; | |
1271 | #ifdef CONFIG_DETECT_HUNG_TASK | |
1272 | tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw; | |
1273 | #endif | |
1274 | ||
1275 | tsk->mm = NULL; | |
1276 | tsk->active_mm = NULL; | |
1277 | ||
1278 | /* | |
1279 | * Are we cloning a kernel thread? | |
1280 | * | |
1281 | * We need to steal a active VM for that.. | |
1282 | */ | |
1283 | oldmm = current->mm; | |
1284 | if (!oldmm) | |
1285 | return 0; | |
1286 | ||
1287 | /* initialize the new vmacache entries */ | |
1288 | vmacache_flush(tsk); | |
1289 | ||
1290 | if (clone_flags & CLONE_VM) { | |
1291 | mmget(oldmm); | |
1292 | mm = oldmm; | |
1293 | goto good_mm; | |
1294 | } | |
1295 | ||
1296 | retval = -ENOMEM; | |
1297 | mm = dup_mm(tsk); | |
1298 | if (!mm) | |
1299 | goto fail_nomem; | |
1300 | ||
1301 | good_mm: | |
1302 | tsk->mm = mm; | |
1303 | tsk->active_mm = mm; | |
1304 | return 0; | |
1305 | ||
1306 | fail_nomem: | |
1307 | return retval; | |
1308 | } | |
1309 | ||
1310 | static int copy_fs(unsigned long clone_flags, struct task_struct *tsk) | |
1311 | { | |
1312 | struct fs_struct *fs = current->fs; | |
1313 | if (clone_flags & CLONE_FS) { | |
1314 | /* tsk->fs is already what we want */ | |
1315 | spin_lock(&fs->lock); | |
1316 | if (fs->in_exec) { | |
1317 | spin_unlock(&fs->lock); | |
1318 | return -EAGAIN; | |
1319 | } | |
1320 | fs->users++; | |
1321 | spin_unlock(&fs->lock); | |
1322 | return 0; | |
1323 | } | |
1324 | tsk->fs = copy_fs_struct(fs); | |
1325 | if (!tsk->fs) | |
1326 | return -ENOMEM; | |
1327 | return 0; | |
1328 | } | |
1329 | ||
1330 | static int copy_files(unsigned long clone_flags, struct task_struct *tsk) | |
1331 | { | |
1332 | struct files_struct *oldf, *newf; | |
1333 | int error = 0; | |
1334 | ||
1335 | /* | |
1336 | * A background process may not have any files ... | |
1337 | */ | |
1338 | oldf = current->files; | |
1339 | if (!oldf) | |
1340 | goto out; | |
1341 | ||
1342 | if (clone_flags & CLONE_FILES) { | |
1343 | atomic_inc(&oldf->count); | |
1344 | goto out; | |
1345 | } | |
1346 | ||
1347 | newf = dup_fd(oldf, &error); | |
1348 | if (!newf) | |
1349 | goto out; | |
1350 | ||
1351 | tsk->files = newf; | |
1352 | error = 0; | |
1353 | out: | |
1354 | return error; | |
1355 | } | |
1356 | ||
1357 | static int copy_io(unsigned long clone_flags, struct task_struct *tsk) | |
1358 | { | |
1359 | #ifdef CONFIG_BLOCK | |
1360 | struct io_context *ioc = current->io_context; | |
1361 | struct io_context *new_ioc; | |
1362 | ||
1363 | if (!ioc) | |
1364 | return 0; | |
1365 | /* | |
1366 | * Share io context with parent, if CLONE_IO is set | |
1367 | */ | |
1368 | if (clone_flags & CLONE_IO) { | |
1369 | ioc_task_link(ioc); | |
1370 | tsk->io_context = ioc; | |
1371 | } else if (ioprio_valid(ioc->ioprio)) { | |
1372 | new_ioc = get_task_io_context(tsk, GFP_KERNEL, NUMA_NO_NODE); | |
1373 | if (unlikely(!new_ioc)) | |
1374 | return -ENOMEM; | |
1375 | ||
1376 | new_ioc->ioprio = ioc->ioprio; | |
1377 | put_io_context(new_ioc); | |
1378 | } | |
1379 | #endif | |
1380 | return 0; | |
1381 | } | |
1382 | ||
1383 | static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk) | |
1384 | { | |
1385 | struct sighand_struct *sig; | |
1386 | ||
1387 | if (clone_flags & CLONE_SIGHAND) { | |
1388 | atomic_inc(¤t->sighand->count); | |
1389 | return 0; | |
1390 | } | |
1391 | sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL); | |
1392 | rcu_assign_pointer(tsk->sighand, sig); | |
1393 | if (!sig) | |
1394 | return -ENOMEM; | |
1395 | ||
1396 | atomic_set(&sig->count, 1); | |
1397 | spin_lock_irq(¤t->sighand->siglock); | |
1398 | memcpy(sig->action, current->sighand->action, sizeof(sig->action)); | |
1399 | spin_unlock_irq(¤t->sighand->siglock); | |
1400 | return 0; | |
1401 | } | |
1402 | ||
1403 | void __cleanup_sighand(struct sighand_struct *sighand) | |
1404 | { | |
1405 | if (atomic_dec_and_test(&sighand->count)) { | |
1406 | signalfd_cleanup(sighand); | |
1407 | /* | |
1408 | * sighand_cachep is SLAB_TYPESAFE_BY_RCU so we can free it | |
1409 | * without an RCU grace period, see __lock_task_sighand(). | |
1410 | */ | |
1411 | kmem_cache_free(sighand_cachep, sighand); | |
1412 | } | |
1413 | } | |
1414 | ||
1415 | #ifdef CONFIG_POSIX_TIMERS | |
1416 | /* | |
1417 | * Initialize POSIX timer handling for a thread group. | |
1418 | */ | |
1419 | static void posix_cpu_timers_init_group(struct signal_struct *sig) | |
1420 | { | |
1421 | unsigned long cpu_limit; | |
1422 | ||
1423 | cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur); | |
1424 | if (cpu_limit != RLIM_INFINITY) { | |
1425 | sig->cputime_expires.prof_exp = cpu_limit * NSEC_PER_SEC; | |
1426 | sig->cputimer.running = true; | |
1427 | } | |
1428 | ||
1429 | /* The timer lists. */ | |
1430 | INIT_LIST_HEAD(&sig->cpu_timers[0]); | |
1431 | INIT_LIST_HEAD(&sig->cpu_timers[1]); | |
1432 | INIT_LIST_HEAD(&sig->cpu_timers[2]); | |
1433 | } | |
1434 | #else | |
1435 | static inline void posix_cpu_timers_init_group(struct signal_struct *sig) { } | |
1436 | #endif | |
1437 | ||
1438 | static int copy_signal(unsigned long clone_flags, struct task_struct *tsk) | |
1439 | { | |
1440 | struct signal_struct *sig; | |
1441 | ||
1442 | if (clone_flags & CLONE_THREAD) | |
1443 | return 0; | |
1444 | ||
1445 | sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL); | |
1446 | tsk->signal = sig; | |
1447 | if (!sig) | |
1448 | return -ENOMEM; | |
1449 | ||
1450 | sig->nr_threads = 1; | |
1451 | atomic_set(&sig->live, 1); | |
1452 | atomic_set(&sig->sigcnt, 1); | |
1453 | ||
1454 | /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */ | |
1455 | sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node); | |
1456 | tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head); | |
1457 | ||
1458 | init_waitqueue_head(&sig->wait_chldexit); | |
1459 | sig->curr_target = tsk; | |
1460 | init_sigpending(&sig->shared_pending); | |
1461 | seqlock_init(&sig->stats_lock); | |
1462 | prev_cputime_init(&sig->prev_cputime); | |
1463 | ||
1464 | #ifdef CONFIG_POSIX_TIMERS | |
1465 | INIT_LIST_HEAD(&sig->posix_timers); | |
1466 | hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); | |
1467 | sig->real_timer.function = it_real_fn; | |
1468 | #endif | |
1469 | ||
1470 | task_lock(current->group_leader); | |
1471 | memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim); | |
1472 | task_unlock(current->group_leader); | |
1473 | ||
1474 | posix_cpu_timers_init_group(sig); | |
1475 | ||
1476 | tty_audit_fork(sig); | |
1477 | sched_autogroup_fork(sig); | |
1478 | ||
1479 | sig->oom_score_adj = current->signal->oom_score_adj; | |
1480 | sig->oom_score_adj_min = current->signal->oom_score_adj_min; | |
1481 | ||
1482 | mutex_init(&sig->cred_guard_mutex); | |
1483 | ||
1484 | return 0; | |
1485 | } | |
1486 | ||
1487 | static void copy_seccomp(struct task_struct *p) | |
1488 | { | |
1489 | #ifdef CONFIG_SECCOMP | |
1490 | /* | |
1491 | * Must be called with sighand->lock held, which is common to | |
1492 | * all threads in the group. Holding cred_guard_mutex is not | |
1493 | * needed because this new task is not yet running and cannot | |
1494 | * be racing exec. | |
1495 | */ | |
1496 | assert_spin_locked(¤t->sighand->siglock); | |
1497 | ||
1498 | /* Ref-count the new filter user, and assign it. */ | |
1499 | get_seccomp_filter(current); | |
1500 | p->seccomp = current->seccomp; | |
1501 | ||
1502 | /* | |
1503 | * Explicitly enable no_new_privs here in case it got set | |
1504 | * between the task_struct being duplicated and holding the | |
1505 | * sighand lock. The seccomp state and nnp must be in sync. | |
1506 | */ | |
1507 | if (task_no_new_privs(current)) | |
1508 | task_set_no_new_privs(p); | |
1509 | ||
1510 | /* | |
1511 | * If the parent gained a seccomp mode after copying thread | |
1512 | * flags and between before we held the sighand lock, we have | |
1513 | * to manually enable the seccomp thread flag here. | |
1514 | */ | |
1515 | if (p->seccomp.mode != SECCOMP_MODE_DISABLED) | |
1516 | set_tsk_thread_flag(p, TIF_SECCOMP); | |
1517 | #endif | |
1518 | } | |
1519 | ||
1520 | SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr) | |
1521 | { | |
1522 | current->clear_child_tid = tidptr; | |
1523 | ||
1524 | return task_pid_vnr(current); | |
1525 | } | |
1526 | ||
1527 | static void rt_mutex_init_task(struct task_struct *p) | |
1528 | { | |
1529 | raw_spin_lock_init(&p->pi_lock); | |
1530 | #ifdef CONFIG_RT_MUTEXES | |
1531 | p->pi_waiters = RB_ROOT_CACHED; | |
1532 | p->pi_top_task = NULL; | |
1533 | p->pi_blocked_on = NULL; | |
1534 | #endif | |
1535 | } | |
1536 | ||
1537 | #ifdef CONFIG_POSIX_TIMERS | |
1538 | /* | |
1539 | * Initialize POSIX timer handling for a single task. | |
1540 | */ | |
1541 | static void posix_cpu_timers_init(struct task_struct *tsk) | |
1542 | { | |
1543 | tsk->cputime_expires.prof_exp = 0; | |
1544 | tsk->cputime_expires.virt_exp = 0; | |
1545 | tsk->cputime_expires.sched_exp = 0; | |
1546 | INIT_LIST_HEAD(&tsk->cpu_timers[0]); | |
1547 | INIT_LIST_HEAD(&tsk->cpu_timers[1]); | |
1548 | INIT_LIST_HEAD(&tsk->cpu_timers[2]); | |
1549 | } | |
1550 | #else | |
1551 | static inline void posix_cpu_timers_init(struct task_struct *tsk) { } | |
1552 | #endif | |
1553 | ||
1554 | static inline void | |
1555 | init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid) | |
1556 | { | |
1557 | task->pids[type].pid = pid; | |
1558 | } | |
1559 | ||
1560 | static inline void rcu_copy_process(struct task_struct *p) | |
1561 | { | |
1562 | #ifdef CONFIG_PREEMPT_RCU | |
1563 | p->rcu_read_lock_nesting = 0; | |
1564 | p->rcu_read_unlock_special.s = 0; | |
1565 | p->rcu_blocked_node = NULL; | |
1566 | INIT_LIST_HEAD(&p->rcu_node_entry); | |
1567 | #endif /* #ifdef CONFIG_PREEMPT_RCU */ | |
1568 | #ifdef CONFIG_TASKS_RCU | |
1569 | p->rcu_tasks_holdout = false; | |
1570 | INIT_LIST_HEAD(&p->rcu_tasks_holdout_list); | |
1571 | p->rcu_tasks_idle_cpu = -1; | |
1572 | #endif /* #ifdef CONFIG_TASKS_RCU */ | |
1573 | } | |
1574 | ||
1575 | static void __delayed_free_task(struct rcu_head *rhp) | |
1576 | { | |
1577 | struct task_struct *tsk = container_of(rhp, struct task_struct, rcu); | |
1578 | ||
1579 | free_task(tsk); | |
1580 | } | |
1581 | ||
1582 | static __always_inline void delayed_free_task(struct task_struct *tsk) | |
1583 | { | |
1584 | if (IS_ENABLED(CONFIG_MEMCG)) | |
1585 | call_rcu(&tsk->rcu, __delayed_free_task); | |
1586 | else | |
1587 | free_task(tsk); | |
1588 | } | |
1589 | ||
1590 | /* | |
1591 | * This creates a new process as a copy of the old one, | |
1592 | * but does not actually start it yet. | |
1593 | * | |
1594 | * It copies the registers, and all the appropriate | |
1595 | * parts of the process environment (as per the clone | |
1596 | * flags). The actual kick-off is left to the caller. | |
1597 | */ | |
1598 | static __latent_entropy struct task_struct *copy_process( | |
1599 | unsigned long clone_flags, | |
1600 | unsigned long stack_start, | |
1601 | unsigned long stack_size, | |
1602 | int __user *child_tidptr, | |
1603 | struct pid *pid, | |
1604 | int trace, | |
1605 | unsigned long tls, | |
1606 | int node) | |
1607 | { | |
1608 | int retval; | |
1609 | struct task_struct *p; | |
1610 | ||
1611 | if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS)) | |
1612 | return ERR_PTR(-EINVAL); | |
1613 | ||
1614 | if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS)) | |
1615 | return ERR_PTR(-EINVAL); | |
1616 | ||
1617 | if ((clone_flags & CLONE_NEWUSER) && !unprivileged_userns_clone) | |
1618 | if (!capable(CAP_SYS_ADMIN)) | |
1619 | return ERR_PTR(-EPERM); | |
1620 | ||
1621 | /* | |
1622 | * Thread groups must share signals as well, and detached threads | |
1623 | * can only be started up within the thread group. | |
1624 | */ | |
1625 | if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND)) | |
1626 | return ERR_PTR(-EINVAL); | |
1627 | ||
1628 | /* | |
1629 | * Shared signal handlers imply shared VM. By way of the above, | |
1630 | * thread groups also imply shared VM. Blocking this case allows | |
1631 | * for various simplifications in other code. | |
1632 | */ | |
1633 | if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM)) | |
1634 | return ERR_PTR(-EINVAL); | |
1635 | ||
1636 | /* | |
1637 | * Siblings of global init remain as zombies on exit since they are | |
1638 | * not reaped by their parent (swapper). To solve this and to avoid | |
1639 | * multi-rooted process trees, prevent global and container-inits | |
1640 | * from creating siblings. | |
1641 | */ | |
1642 | if ((clone_flags & CLONE_PARENT) && | |
1643 | current->signal->flags & SIGNAL_UNKILLABLE) | |
1644 | return ERR_PTR(-EINVAL); | |
1645 | ||
1646 | /* | |
1647 | * If the new process will be in a different pid or user namespace | |
1648 | * do not allow it to share a thread group with the forking task. | |
1649 | */ | |
1650 | if (clone_flags & CLONE_THREAD) { | |
1651 | if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) || | |
1652 | (task_active_pid_ns(current) != | |
1653 | current->nsproxy->pid_ns_for_children)) | |
1654 | return ERR_PTR(-EINVAL); | |
1655 | } | |
1656 | ||
1657 | retval = -ENOMEM; | |
1658 | p = dup_task_struct(current, node); | |
1659 | if (!p) | |
1660 | goto fork_out; | |
1661 | ||
1662 | /* | |
1663 | * This _must_ happen before we call free_task(), i.e. before we jump | |
1664 | * to any of the bad_fork_* labels. This is to avoid freeing | |
1665 | * p->set_child_tid which is (ab)used as a kthread's data pointer for | |
1666 | * kernel threads (PF_KTHREAD). | |
1667 | */ | |
1668 | p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? child_tidptr : NULL; | |
1669 | /* | |
1670 | * Clear TID on mm_release()? | |
1671 | */ | |
1672 | p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? child_tidptr : NULL; | |
1673 | ||
1674 | ftrace_graph_init_task(p); | |
1675 | ||
1676 | rt_mutex_init_task(p); | |
1677 | ||
1678 | #ifdef CONFIG_PROVE_LOCKING | |
1679 | DEBUG_LOCKS_WARN_ON(!p->hardirqs_enabled); | |
1680 | DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled); | |
1681 | #endif | |
1682 | retval = -EAGAIN; | |
1683 | if (atomic_read(&p->real_cred->user->processes) >= | |
1684 | task_rlimit(p, RLIMIT_NPROC)) { | |
1685 | if (p->real_cred->user != INIT_USER && | |
1686 | !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN)) | |
1687 | goto bad_fork_free; | |
1688 | } | |
1689 | current->flags &= ~PF_NPROC_EXCEEDED; | |
1690 | ||
1691 | retval = copy_creds(p, clone_flags); | |
1692 | if (retval < 0) | |
1693 | goto bad_fork_free; | |
1694 | ||
1695 | /* | |
1696 | * If multiple threads are within copy_process(), then this check | |
1697 | * triggers too late. This doesn't hurt, the check is only there | |
1698 | * to stop root fork bombs. | |
1699 | */ | |
1700 | retval = -EAGAIN; | |
1701 | if (nr_threads >= max_threads) | |
1702 | goto bad_fork_cleanup_count; | |
1703 | ||
1704 | delayacct_tsk_init(p); /* Must remain after dup_task_struct() */ | |
1705 | p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER | PF_IDLE); | |
1706 | p->flags |= PF_FORKNOEXEC; | |
1707 | INIT_LIST_HEAD(&p->children); | |
1708 | INIT_LIST_HEAD(&p->sibling); | |
1709 | rcu_copy_process(p); | |
1710 | p->vfork_done = NULL; | |
1711 | spin_lock_init(&p->alloc_lock); | |
1712 | ||
1713 | init_sigpending(&p->pending); | |
1714 | ||
1715 | p->utime = p->stime = p->gtime = 0; | |
1716 | #ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME | |
1717 | p->utimescaled = p->stimescaled = 0; | |
1718 | #endif | |
1719 | prev_cputime_init(&p->prev_cputime); | |
1720 | ||
1721 | #ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN | |
1722 | seqcount_init(&p->vtime.seqcount); | |
1723 | p->vtime.starttime = 0; | |
1724 | p->vtime.state = VTIME_INACTIVE; | |
1725 | #endif | |
1726 | ||
1727 | #if defined(SPLIT_RSS_COUNTING) | |
1728 | memset(&p->rss_stat, 0, sizeof(p->rss_stat)); | |
1729 | #endif | |
1730 | ||
1731 | p->default_timer_slack_ns = current->timer_slack_ns; | |
1732 | ||
1733 | task_io_accounting_init(&p->ioac); | |
1734 | acct_clear_integrals(p); | |
1735 | ||
1736 | posix_cpu_timers_init(p); | |
1737 | ||
1738 | p->io_context = NULL; | |
1739 | p->audit_context = NULL; | |
1740 | cgroup_fork(p); | |
1741 | #ifdef CONFIG_NUMA | |
1742 | p->mempolicy = mpol_dup(p->mempolicy); | |
1743 | if (IS_ERR(p->mempolicy)) { | |
1744 | retval = PTR_ERR(p->mempolicy); | |
1745 | p->mempolicy = NULL; | |
1746 | goto bad_fork_cleanup_threadgroup_lock; | |
1747 | } | |
1748 | #endif | |
1749 | #ifdef CONFIG_CPUSETS | |
1750 | p->cpuset_mem_spread_rotor = NUMA_NO_NODE; | |
1751 | p->cpuset_slab_spread_rotor = NUMA_NO_NODE; | |
1752 | seqcount_init(&p->mems_allowed_seq); | |
1753 | #endif | |
1754 | #ifdef CONFIG_TRACE_IRQFLAGS | |
1755 | p->irq_events = 0; | |
1756 | p->hardirqs_enabled = 0; | |
1757 | p->hardirq_enable_ip = 0; | |
1758 | p->hardirq_enable_event = 0; | |
1759 | p->hardirq_disable_ip = _THIS_IP_; | |
1760 | p->hardirq_disable_event = 0; | |
1761 | p->softirqs_enabled = 1; | |
1762 | p->softirq_enable_ip = _THIS_IP_; | |
1763 | p->softirq_enable_event = 0; | |
1764 | p->softirq_disable_ip = 0; | |
1765 | p->softirq_disable_event = 0; | |
1766 | p->hardirq_context = 0; | |
1767 | p->softirq_context = 0; | |
1768 | #endif | |
1769 | ||
1770 | p->pagefault_disabled = 0; | |
1771 | ||
1772 | #ifdef CONFIG_LOCKDEP | |
1773 | p->lockdep_depth = 0; /* no locks held yet */ | |
1774 | p->curr_chain_key = 0; | |
1775 | p->lockdep_recursion = 0; | |
1776 | lockdep_init_task(p); | |
1777 | #endif | |
1778 | ||
1779 | #ifdef CONFIG_DEBUG_MUTEXES | |
1780 | p->blocked_on = NULL; /* not blocked yet */ | |
1781 | #endif | |
1782 | #ifdef CONFIG_BCACHE | |
1783 | p->sequential_io = 0; | |
1784 | p->sequential_io_avg = 0; | |
1785 | #endif | |
1786 | #ifdef CONFIG_SECURITY | |
1787 | p->security = NULL; | |
1788 | #endif | |
1789 | ||
1790 | /* Perform scheduler related setup. Assign this task to a CPU. */ | |
1791 | retval = sched_fork(clone_flags, p); | |
1792 | if (retval) | |
1793 | goto bad_fork_cleanup_policy; | |
1794 | ||
1795 | retval = perf_event_init_task(p); | |
1796 | if (retval) | |
1797 | goto bad_fork_cleanup_policy; | |
1798 | retval = audit_alloc(p); | |
1799 | if (retval) | |
1800 | goto bad_fork_cleanup_perf; | |
1801 | /* copy all the process information */ | |
1802 | shm_init_task(p); | |
1803 | retval = security_task_alloc(p, clone_flags); | |
1804 | if (retval) | |
1805 | goto bad_fork_cleanup_audit; | |
1806 | retval = copy_semundo(clone_flags, p); | |
1807 | if (retval) | |
1808 | goto bad_fork_cleanup_security; | |
1809 | retval = copy_files(clone_flags, p); | |
1810 | if (retval) | |
1811 | goto bad_fork_cleanup_semundo; | |
1812 | retval = copy_fs(clone_flags, p); | |
1813 | if (retval) | |
1814 | goto bad_fork_cleanup_files; | |
1815 | retval = copy_sighand(clone_flags, p); | |
1816 | if (retval) | |
1817 | goto bad_fork_cleanup_fs; | |
1818 | retval = copy_signal(clone_flags, p); | |
1819 | if (retval) | |
1820 | goto bad_fork_cleanup_sighand; | |
1821 | retval = copy_mm(clone_flags, p); | |
1822 | if (retval) | |
1823 | goto bad_fork_cleanup_signal; | |
1824 | retval = copy_namespaces(clone_flags, p); | |
1825 | if (retval) | |
1826 | goto bad_fork_cleanup_mm; | |
1827 | retval = copy_io(clone_flags, p); | |
1828 | if (retval) | |
1829 | goto bad_fork_cleanup_namespaces; | |
1830 | retval = copy_thread_tls(clone_flags, stack_start, stack_size, p, tls); | |
1831 | if (retval) | |
1832 | goto bad_fork_cleanup_io; | |
1833 | ||
1834 | if (pid != &init_struct_pid) { | |
1835 | pid = alloc_pid(p->nsproxy->pid_ns_for_children); | |
1836 | if (IS_ERR(pid)) { | |
1837 | retval = PTR_ERR(pid); | |
1838 | goto bad_fork_cleanup_thread; | |
1839 | } | |
1840 | } | |
1841 | ||
1842 | #ifdef CONFIG_BLOCK | |
1843 | p->plug = NULL; | |
1844 | #endif | |
1845 | #ifdef CONFIG_FUTEX | |
1846 | p->robust_list = NULL; | |
1847 | #ifdef CONFIG_COMPAT | |
1848 | p->compat_robust_list = NULL; | |
1849 | #endif | |
1850 | INIT_LIST_HEAD(&p->pi_state_list); | |
1851 | p->pi_state_cache = NULL; | |
1852 | #endif | |
1853 | /* | |
1854 | * sigaltstack should be cleared when sharing the same VM | |
1855 | */ | |
1856 | if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM) | |
1857 | sas_ss_reset(p); | |
1858 | ||
1859 | /* | |
1860 | * Syscall tracing and stepping should be turned off in the | |
1861 | * child regardless of CLONE_PTRACE. | |
1862 | */ | |
1863 | user_disable_single_step(p); | |
1864 | clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE); | |
1865 | #ifdef TIF_SYSCALL_EMU | |
1866 | clear_tsk_thread_flag(p, TIF_SYSCALL_EMU); | |
1867 | #endif | |
1868 | clear_all_latency_tracing(p); | |
1869 | ||
1870 | /* ok, now we should be set up.. */ | |
1871 | p->pid = pid_nr(pid); | |
1872 | if (clone_flags & CLONE_THREAD) { | |
1873 | p->exit_signal = -1; | |
1874 | p->group_leader = current->group_leader; | |
1875 | p->tgid = current->tgid; | |
1876 | } else { | |
1877 | if (clone_flags & CLONE_PARENT) | |
1878 | p->exit_signal = current->group_leader->exit_signal; | |
1879 | else | |
1880 | p->exit_signal = (clone_flags & CSIGNAL); | |
1881 | p->group_leader = p; | |
1882 | p->tgid = p->pid; | |
1883 | } | |
1884 | ||
1885 | p->nr_dirtied = 0; | |
1886 | p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10); | |
1887 | p->dirty_paused_when = 0; | |
1888 | ||
1889 | p->pdeath_signal = 0; | |
1890 | INIT_LIST_HEAD(&p->thread_group); | |
1891 | p->task_works = NULL; | |
1892 | ||
1893 | cgroup_threadgroup_change_begin(current); | |
1894 | /* | |
1895 | * Ensure that the cgroup subsystem policies allow the new process to be | |
1896 | * forked. It should be noted the the new process's css_set can be changed | |
1897 | * between here and cgroup_post_fork() if an organisation operation is in | |
1898 | * progress. | |
1899 | */ | |
1900 | retval = cgroup_can_fork(p); | |
1901 | if (retval) | |
1902 | goto bad_fork_free_pid; | |
1903 | ||
1904 | /* | |
1905 | * From this point on we must avoid any synchronous user-space | |
1906 | * communication until we take the tasklist-lock. In particular, we do | |
1907 | * not want user-space to be able to predict the process start-time by | |
1908 | * stalling fork(2) after we recorded the start_time but before it is | |
1909 | * visible to the system. | |
1910 | */ | |
1911 | ||
1912 | p->start_time = ktime_get_ns(); | |
1913 | p->real_start_time = ktime_get_boot_ns(); | |
1914 | ||
1915 | /* | |
1916 | * Make it visible to the rest of the system, but dont wake it up yet. | |
1917 | * Need tasklist lock for parent etc handling! | |
1918 | */ | |
1919 | write_lock_irq(&tasklist_lock); | |
1920 | ||
1921 | /* CLONE_PARENT re-uses the old parent */ | |
1922 | if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) { | |
1923 | p->real_parent = current->real_parent; | |
1924 | p->parent_exec_id = current->parent_exec_id; | |
1925 | } else { | |
1926 | p->real_parent = current; | |
1927 | p->parent_exec_id = current->self_exec_id; | |
1928 | } | |
1929 | ||
1930 | klp_copy_process(p); | |
1931 | ||
1932 | spin_lock(¤t->sighand->siglock); | |
1933 | ||
1934 | /* | |
1935 | * Copy seccomp details explicitly here, in case they were changed | |
1936 | * before holding sighand lock. | |
1937 | */ | |
1938 | copy_seccomp(p); | |
1939 | ||
1940 | /* | |
1941 | * Process group and session signals need to be delivered to just the | |
1942 | * parent before the fork or both the parent and the child after the | |
1943 | * fork. Restart if a signal comes in before we add the new process to | |
1944 | * it's process group. | |
1945 | * A fatal signal pending means that current will exit, so the new | |
1946 | * thread can't slip out of an OOM kill (or normal SIGKILL). | |
1947 | */ | |
1948 | recalc_sigpending(); | |
1949 | if (signal_pending(current)) { | |
1950 | retval = -ERESTARTNOINTR; | |
1951 | goto bad_fork_cancel_cgroup; | |
1952 | } | |
1953 | if (unlikely(!(ns_of_pid(pid)->pid_allocated & PIDNS_ADDING))) { | |
1954 | retval = -ENOMEM; | |
1955 | goto bad_fork_cancel_cgroup; | |
1956 | } | |
1957 | ||
1958 | if (likely(p->pid)) { | |
1959 | ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace); | |
1960 | ||
1961 | init_task_pid(p, PIDTYPE_PID, pid); | |
1962 | if (thread_group_leader(p)) { | |
1963 | init_task_pid(p, PIDTYPE_PGID, task_pgrp(current)); | |
1964 | init_task_pid(p, PIDTYPE_SID, task_session(current)); | |
1965 | ||
1966 | if (is_child_reaper(pid)) { | |
1967 | ns_of_pid(pid)->child_reaper = p; | |
1968 | p->signal->flags |= SIGNAL_UNKILLABLE; | |
1969 | } | |
1970 | ||
1971 | p->signal->leader_pid = pid; | |
1972 | p->signal->tty = tty_kref_get(current->signal->tty); | |
1973 | /* | |
1974 | * Inherit has_child_subreaper flag under the same | |
1975 | * tasklist_lock with adding child to the process tree | |
1976 | * for propagate_has_child_subreaper optimization. | |
1977 | */ | |
1978 | p->signal->has_child_subreaper = p->real_parent->signal->has_child_subreaper || | |
1979 | p->real_parent->signal->is_child_subreaper; | |
1980 | list_add_tail(&p->sibling, &p->real_parent->children); | |
1981 | list_add_tail_rcu(&p->tasks, &init_task.tasks); | |
1982 | attach_pid(p, PIDTYPE_PGID); | |
1983 | attach_pid(p, PIDTYPE_SID); | |
1984 | __this_cpu_inc(process_counts); | |
1985 | } else { | |
1986 | current->signal->nr_threads++; | |
1987 | atomic_inc(¤t->signal->live); | |
1988 | atomic_inc(¤t->signal->sigcnt); | |
1989 | list_add_tail_rcu(&p->thread_group, | |
1990 | &p->group_leader->thread_group); | |
1991 | list_add_tail_rcu(&p->thread_node, | |
1992 | &p->signal->thread_head); | |
1993 | } | |
1994 | attach_pid(p, PIDTYPE_PID); | |
1995 | nr_threads++; | |
1996 | } | |
1997 | ||
1998 | total_forks++; | |
1999 | spin_unlock(¤t->sighand->siglock); | |
2000 | syscall_tracepoint_update(p); | |
2001 | write_unlock_irq(&tasklist_lock); | |
2002 | ||
2003 | proc_fork_connector(p); | |
2004 | cgroup_post_fork(p); | |
2005 | cgroup_threadgroup_change_end(current); | |
2006 | perf_event_fork(p); | |
2007 | ||
2008 | trace_task_newtask(p, clone_flags); | |
2009 | uprobe_copy_process(p, clone_flags); | |
2010 | ||
2011 | return p; | |
2012 | ||
2013 | bad_fork_cancel_cgroup: | |
2014 | spin_unlock(¤t->sighand->siglock); | |
2015 | write_unlock_irq(&tasklist_lock); | |
2016 | cgroup_cancel_fork(p); | |
2017 | bad_fork_free_pid: | |
2018 | cgroup_threadgroup_change_end(current); | |
2019 | if (pid != &init_struct_pid) | |
2020 | free_pid(pid); | |
2021 | bad_fork_cleanup_thread: | |
2022 | exit_thread(p); | |
2023 | bad_fork_cleanup_io: | |
2024 | if (p->io_context) | |
2025 | exit_io_context(p); | |
2026 | bad_fork_cleanup_namespaces: | |
2027 | exit_task_namespaces(p); | |
2028 | bad_fork_cleanup_mm: | |
2029 | if (p->mm) { | |
2030 | mm_clear_owner(p->mm, p); | |
2031 | mmput(p->mm); | |
2032 | } | |
2033 | bad_fork_cleanup_signal: | |
2034 | if (!(clone_flags & CLONE_THREAD)) | |
2035 | free_signal_struct(p->signal); | |
2036 | bad_fork_cleanup_sighand: | |
2037 | __cleanup_sighand(p->sighand); | |
2038 | bad_fork_cleanup_fs: | |
2039 | exit_fs(p); /* blocking */ | |
2040 | bad_fork_cleanup_files: | |
2041 | exit_files(p); /* blocking */ | |
2042 | bad_fork_cleanup_semundo: | |
2043 | exit_sem(p); | |
2044 | bad_fork_cleanup_security: | |
2045 | security_task_free(p); | |
2046 | bad_fork_cleanup_audit: | |
2047 | audit_free(p); | |
2048 | bad_fork_cleanup_perf: | |
2049 | perf_event_free_task(p); | |
2050 | bad_fork_cleanup_policy: | |
2051 | lockdep_free_task(p); | |
2052 | #ifdef CONFIG_NUMA | |
2053 | mpol_put(p->mempolicy); | |
2054 | bad_fork_cleanup_threadgroup_lock: | |
2055 | #endif | |
2056 | delayacct_tsk_free(p); | |
2057 | bad_fork_cleanup_count: | |
2058 | atomic_dec(&p->cred->user->processes); | |
2059 | exit_creds(p); | |
2060 | bad_fork_free: | |
2061 | p->state = TASK_DEAD; | |
2062 | put_task_stack(p); | |
2063 | delayed_free_task(p); | |
2064 | fork_out: | |
2065 | return ERR_PTR(retval); | |
2066 | } | |
2067 | ||
2068 | static inline void init_idle_pids(struct pid_link *links) | |
2069 | { | |
2070 | enum pid_type type; | |
2071 | ||
2072 | for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) { | |
2073 | INIT_HLIST_NODE(&links[type].node); /* not really needed */ | |
2074 | links[type].pid = &init_struct_pid; | |
2075 | } | |
2076 | } | |
2077 | ||
2078 | struct task_struct *fork_idle(int cpu) | |
2079 | { | |
2080 | struct task_struct *task; | |
2081 | task = copy_process(CLONE_VM, 0, 0, NULL, &init_struct_pid, 0, 0, | |
2082 | cpu_to_node(cpu)); | |
2083 | if (!IS_ERR(task)) { | |
2084 | init_idle_pids(task->pids); | |
2085 | init_idle(task, cpu); | |
2086 | } | |
2087 | ||
2088 | return task; | |
2089 | } | |
2090 | ||
2091 | /* | |
2092 | * Ok, this is the main fork-routine. | |
2093 | * | |
2094 | * It copies the process, and if successful kick-starts | |
2095 | * it and waits for it to finish using the VM if required. | |
2096 | */ | |
2097 | long _do_fork(unsigned long clone_flags, | |
2098 | unsigned long stack_start, | |
2099 | unsigned long stack_size, | |
2100 | int __user *parent_tidptr, | |
2101 | int __user *child_tidptr, | |
2102 | unsigned long tls) | |
2103 | { | |
2104 | struct task_struct *p; | |
2105 | int trace = 0; | |
2106 | long nr; | |
2107 | ||
2108 | /* | |
2109 | * Determine whether and which event to report to ptracer. When | |
2110 | * called from kernel_thread or CLONE_UNTRACED is explicitly | |
2111 | * requested, no event is reported; otherwise, report if the event | |
2112 | * for the type of forking is enabled. | |
2113 | */ | |
2114 | if (!(clone_flags & CLONE_UNTRACED)) { | |
2115 | if (clone_flags & CLONE_VFORK) | |
2116 | trace = PTRACE_EVENT_VFORK; | |
2117 | else if ((clone_flags & CSIGNAL) != SIGCHLD) | |
2118 | trace = PTRACE_EVENT_CLONE; | |
2119 | else | |
2120 | trace = PTRACE_EVENT_FORK; | |
2121 | ||
2122 | if (likely(!ptrace_event_enabled(current, trace))) | |
2123 | trace = 0; | |
2124 | } | |
2125 | ||
2126 | p = copy_process(clone_flags, stack_start, stack_size, | |
2127 | child_tidptr, NULL, trace, tls, NUMA_NO_NODE); | |
2128 | add_latent_entropy(); | |
2129 | /* | |
2130 | * Do this prior waking up the new thread - the thread pointer | |
2131 | * might get invalid after that point, if the thread exits quickly. | |
2132 | */ | |
2133 | if (!IS_ERR(p)) { | |
2134 | struct completion vfork; | |
2135 | struct pid *pid; | |
2136 | ||
2137 | trace_sched_process_fork(current, p); | |
2138 | ||
2139 | pid = get_task_pid(p, PIDTYPE_PID); | |
2140 | nr = pid_vnr(pid); | |
2141 | ||
2142 | if (clone_flags & CLONE_PARENT_SETTID) | |
2143 | put_user(nr, parent_tidptr); | |
2144 | ||
2145 | if (clone_flags & CLONE_VFORK) { | |
2146 | p->vfork_done = &vfork; | |
2147 | init_completion(&vfork); | |
2148 | get_task_struct(p); | |
2149 | } | |
2150 | ||
2151 | wake_up_new_task(p); | |
2152 | ||
2153 | /* forking complete and child started to run, tell ptracer */ | |
2154 | if (unlikely(trace)) | |
2155 | ptrace_event_pid(trace, pid); | |
2156 | ||
2157 | if (clone_flags & CLONE_VFORK) { | |
2158 | if (!wait_for_vfork_done(p, &vfork)) | |
2159 | ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid); | |
2160 | } | |
2161 | ||
2162 | put_pid(pid); | |
2163 | } else { | |
2164 | nr = PTR_ERR(p); | |
2165 | } | |
2166 | return nr; | |
2167 | } | |
2168 | ||
2169 | #ifndef CONFIG_HAVE_COPY_THREAD_TLS | |
2170 | /* For compatibility with architectures that call do_fork directly rather than | |
2171 | * using the syscall entry points below. */ | |
2172 | long do_fork(unsigned long clone_flags, | |
2173 | unsigned long stack_start, | |
2174 | unsigned long stack_size, | |
2175 | int __user *parent_tidptr, | |
2176 | int __user *child_tidptr) | |
2177 | { | |
2178 | return _do_fork(clone_flags, stack_start, stack_size, | |
2179 | parent_tidptr, child_tidptr, 0); | |
2180 | } | |
2181 | #endif | |
2182 | ||
2183 | /* | |
2184 | * Create a kernel thread. | |
2185 | */ | |
2186 | pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags) | |
2187 | { | |
2188 | return _do_fork(flags|CLONE_VM|CLONE_UNTRACED, (unsigned long)fn, | |
2189 | (unsigned long)arg, NULL, NULL, 0); | |
2190 | } | |
2191 | ||
2192 | #ifdef __ARCH_WANT_SYS_FORK | |
2193 | SYSCALL_DEFINE0(fork) | |
2194 | { | |
2195 | #ifdef CONFIG_MMU | |
2196 | return _do_fork(SIGCHLD, 0, 0, NULL, NULL, 0); | |
2197 | #else | |
2198 | /* can not support in nommu mode */ | |
2199 | return -EINVAL; | |
2200 | #endif | |
2201 | } | |
2202 | #endif | |
2203 | ||
2204 | #ifdef __ARCH_WANT_SYS_VFORK | |
2205 | SYSCALL_DEFINE0(vfork) | |
2206 | { | |
2207 | return _do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, 0, | |
2208 | 0, NULL, NULL, 0); | |
2209 | } | |
2210 | #endif | |
2211 | ||
2212 | #ifdef __ARCH_WANT_SYS_CLONE | |
2213 | #ifdef CONFIG_CLONE_BACKWARDS | |
2214 | SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp, | |
2215 | int __user *, parent_tidptr, | |
2216 | unsigned long, tls, | |
2217 | int __user *, child_tidptr) | |
2218 | #elif defined(CONFIG_CLONE_BACKWARDS2) | |
2219 | SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags, | |
2220 | int __user *, parent_tidptr, | |
2221 | int __user *, child_tidptr, | |
2222 | unsigned long, tls) | |
2223 | #elif defined(CONFIG_CLONE_BACKWARDS3) | |
2224 | SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp, | |
2225 | int, stack_size, | |
2226 | int __user *, parent_tidptr, | |
2227 | int __user *, child_tidptr, | |
2228 | unsigned long, tls) | |
2229 | #else | |
2230 | SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp, | |
2231 | int __user *, parent_tidptr, | |
2232 | int __user *, child_tidptr, | |
2233 | unsigned long, tls) | |
2234 | #endif | |
2235 | { | |
2236 | return _do_fork(clone_flags, newsp, 0, parent_tidptr, child_tidptr, tls); | |
2237 | } | |
2238 | #endif | |
2239 | ||
2240 | void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data) | |
2241 | { | |
2242 | struct task_struct *leader, *parent, *child; | |
2243 | int res; | |
2244 | ||
2245 | read_lock(&tasklist_lock); | |
2246 | leader = top = top->group_leader; | |
2247 | down: | |
2248 | for_each_thread(leader, parent) { | |
2249 | list_for_each_entry(child, &parent->children, sibling) { | |
2250 | res = visitor(child, data); | |
2251 | if (res) { | |
2252 | if (res < 0) | |
2253 | goto out; | |
2254 | leader = child; | |
2255 | goto down; | |
2256 | } | |
2257 | up: | |
2258 | ; | |
2259 | } | |
2260 | } | |
2261 | ||
2262 | if (leader != top) { | |
2263 | child = leader; | |
2264 | parent = child->real_parent; | |
2265 | leader = parent->group_leader; | |
2266 | goto up; | |
2267 | } | |
2268 | out: | |
2269 | read_unlock(&tasklist_lock); | |
2270 | } | |
2271 | ||
2272 | #ifndef ARCH_MIN_MMSTRUCT_ALIGN | |
2273 | #define ARCH_MIN_MMSTRUCT_ALIGN 0 | |
2274 | #endif | |
2275 | ||
2276 | static void sighand_ctor(void *data) | |
2277 | { | |
2278 | struct sighand_struct *sighand = data; | |
2279 | ||
2280 | spin_lock_init(&sighand->siglock); | |
2281 | init_waitqueue_head(&sighand->signalfd_wqh); | |
2282 | } | |
2283 | ||
2284 | void __init proc_caches_init(void) | |
2285 | { | |
2286 | sighand_cachep = kmem_cache_create("sighand_cache", | |
2287 | sizeof(struct sighand_struct), 0, | |
2288 | SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_TYPESAFE_BY_RCU| | |
2289 | SLAB_ACCOUNT, sighand_ctor); | |
2290 | signal_cachep = kmem_cache_create("signal_cache", | |
2291 | sizeof(struct signal_struct), 0, | |
2292 | SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT, | |
2293 | NULL); | |
2294 | files_cachep = kmem_cache_create("files_cache", | |
2295 | sizeof(struct files_struct), 0, | |
2296 | SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT, | |
2297 | NULL); | |
2298 | fs_cachep = kmem_cache_create("fs_cache", | |
2299 | sizeof(struct fs_struct), 0, | |
2300 | SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT, | |
2301 | NULL); | |
2302 | /* | |
2303 | * FIXME! The "sizeof(struct mm_struct)" currently includes the | |
2304 | * whole struct cpumask for the OFFSTACK case. We could change | |
2305 | * this to *only* allocate as much of it as required by the | |
2306 | * maximum number of CPU's we can ever have. The cpumask_allocation | |
2307 | * is at the end of the structure, exactly for that reason. | |
2308 | */ | |
2309 | mm_cachep = kmem_cache_create("mm_struct", | |
2310 | sizeof(struct mm_struct), ARCH_MIN_MMSTRUCT_ALIGN, | |
2311 | SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT, | |
2312 | NULL); | |
2313 | vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT); | |
2314 | mmap_init(); | |
2315 | nsproxy_cache_init(); | |
2316 | } | |
2317 | ||
2318 | /* | |
2319 | * Check constraints on flags passed to the unshare system call. | |
2320 | */ | |
2321 | static int check_unshare_flags(unsigned long unshare_flags) | |
2322 | { | |
2323 | if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND| | |
2324 | CLONE_VM|CLONE_FILES|CLONE_SYSVSEM| | |
2325 | CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET| | |
2326 | CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP)) | |
2327 | return -EINVAL; | |
2328 | /* | |
2329 | * Not implemented, but pretend it works if there is nothing | |
2330 | * to unshare. Note that unsharing the address space or the | |
2331 | * signal handlers also need to unshare the signal queues (aka | |
2332 | * CLONE_THREAD). | |
2333 | */ | |
2334 | if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) { | |
2335 | if (!thread_group_empty(current)) | |
2336 | return -EINVAL; | |
2337 | } | |
2338 | if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) { | |
2339 | if (atomic_read(¤t->sighand->count) > 1) | |
2340 | return -EINVAL; | |
2341 | } | |
2342 | if (unshare_flags & CLONE_VM) { | |
2343 | if (!current_is_single_threaded()) | |
2344 | return -EINVAL; | |
2345 | } | |
2346 | ||
2347 | return 0; | |
2348 | } | |
2349 | ||
2350 | /* | |
2351 | * Unshare the filesystem structure if it is being shared | |
2352 | */ | |
2353 | static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp) | |
2354 | { | |
2355 | struct fs_struct *fs = current->fs; | |
2356 | ||
2357 | if (!(unshare_flags & CLONE_FS) || !fs) | |
2358 | return 0; | |
2359 | ||
2360 | /* don't need lock here; in the worst case we'll do useless copy */ | |
2361 | if (fs->users == 1) | |
2362 | return 0; | |
2363 | ||
2364 | *new_fsp = copy_fs_struct(fs); | |
2365 | if (!*new_fsp) | |
2366 | return -ENOMEM; | |
2367 | ||
2368 | return 0; | |
2369 | } | |
2370 | ||
2371 | /* | |
2372 | * Unshare file descriptor table if it is being shared | |
2373 | */ | |
2374 | static int unshare_fd(unsigned long unshare_flags, struct files_struct **new_fdp) | |
2375 | { | |
2376 | struct files_struct *fd = current->files; | |
2377 | int error = 0; | |
2378 | ||
2379 | if ((unshare_flags & CLONE_FILES) && | |
2380 | (fd && atomic_read(&fd->count) > 1)) { | |
2381 | *new_fdp = dup_fd(fd, &error); | |
2382 | if (!*new_fdp) | |
2383 | return error; | |
2384 | } | |
2385 | ||
2386 | return 0; | |
2387 | } | |
2388 | ||
2389 | /* | |
2390 | * unshare allows a process to 'unshare' part of the process | |
2391 | * context which was originally shared using clone. copy_* | |
2392 | * functions used by do_fork() cannot be used here directly | |
2393 | * because they modify an inactive task_struct that is being | |
2394 | * constructed. Here we are modifying the current, active, | |
2395 | * task_struct. | |
2396 | */ | |
2397 | SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags) | |
2398 | { | |
2399 | struct fs_struct *fs, *new_fs = NULL; | |
2400 | struct files_struct *fd, *new_fd = NULL; | |
2401 | struct cred *new_cred = NULL; | |
2402 | struct nsproxy *new_nsproxy = NULL; | |
2403 | int do_sysvsem = 0; | |
2404 | int err; | |
2405 | ||
2406 | /* | |
2407 | * If unsharing a user namespace must also unshare the thread group | |
2408 | * and unshare the filesystem root and working directories. | |
2409 | */ | |
2410 | if (unshare_flags & CLONE_NEWUSER) | |
2411 | unshare_flags |= CLONE_THREAD | CLONE_FS; | |
2412 | /* | |
2413 | * If unsharing vm, must also unshare signal handlers. | |
2414 | */ | |
2415 | if (unshare_flags & CLONE_VM) | |
2416 | unshare_flags |= CLONE_SIGHAND; | |
2417 | /* | |
2418 | * If unsharing a signal handlers, must also unshare the signal queues. | |
2419 | */ | |
2420 | if (unshare_flags & CLONE_SIGHAND) | |
2421 | unshare_flags |= CLONE_THREAD; | |
2422 | /* | |
2423 | * If unsharing namespace, must also unshare filesystem information. | |
2424 | */ | |
2425 | if (unshare_flags & CLONE_NEWNS) | |
2426 | unshare_flags |= CLONE_FS; | |
2427 | ||
2428 | if ((unshare_flags & CLONE_NEWUSER) && !unprivileged_userns_clone) { | |
2429 | err = -EPERM; | |
2430 | if (!capable(CAP_SYS_ADMIN)) | |
2431 | goto bad_unshare_out; | |
2432 | } | |
2433 | ||
2434 | err = check_unshare_flags(unshare_flags); | |
2435 | if (err) | |
2436 | goto bad_unshare_out; | |
2437 | /* | |
2438 | * CLONE_NEWIPC must also detach from the undolist: after switching | |
2439 | * to a new ipc namespace, the semaphore arrays from the old | |
2440 | * namespace are unreachable. | |
2441 | */ | |
2442 | if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM)) | |
2443 | do_sysvsem = 1; | |
2444 | err = unshare_fs(unshare_flags, &new_fs); | |
2445 | if (err) | |
2446 | goto bad_unshare_out; | |
2447 | err = unshare_fd(unshare_flags, &new_fd); | |
2448 | if (err) | |
2449 | goto bad_unshare_cleanup_fs; | |
2450 | err = unshare_userns(unshare_flags, &new_cred); | |
2451 | if (err) | |
2452 | goto bad_unshare_cleanup_fd; | |
2453 | err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy, | |
2454 | new_cred, new_fs); | |
2455 | if (err) | |
2456 | goto bad_unshare_cleanup_cred; | |
2457 | ||
2458 | if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) { | |
2459 | if (do_sysvsem) { | |
2460 | /* | |
2461 | * CLONE_SYSVSEM is equivalent to sys_exit(). | |
2462 | */ | |
2463 | exit_sem(current); | |
2464 | } | |
2465 | if (unshare_flags & CLONE_NEWIPC) { | |
2466 | /* Orphan segments in old ns (see sem above). */ | |
2467 | exit_shm(current); | |
2468 | shm_init_task(current); | |
2469 | } | |
2470 | ||
2471 | if (new_nsproxy) | |
2472 | switch_task_namespaces(current, new_nsproxy); | |
2473 | ||
2474 | task_lock(current); | |
2475 | ||
2476 | if (new_fs) { | |
2477 | fs = current->fs; | |
2478 | spin_lock(&fs->lock); | |
2479 | current->fs = new_fs; | |
2480 | if (--fs->users) | |
2481 | new_fs = NULL; | |
2482 | else | |
2483 | new_fs = fs; | |
2484 | spin_unlock(&fs->lock); | |
2485 | } | |
2486 | ||
2487 | if (new_fd) { | |
2488 | fd = current->files; | |
2489 | current->files = new_fd; | |
2490 | new_fd = fd; | |
2491 | } | |
2492 | ||
2493 | task_unlock(current); | |
2494 | ||
2495 | if (new_cred) { | |
2496 | /* Install the new user namespace */ | |
2497 | commit_creds(new_cred); | |
2498 | new_cred = NULL; | |
2499 | } | |
2500 | } | |
2501 | ||
2502 | perf_event_namespaces(current); | |
2503 | ||
2504 | bad_unshare_cleanup_cred: | |
2505 | if (new_cred) | |
2506 | put_cred(new_cred); | |
2507 | bad_unshare_cleanup_fd: | |
2508 | if (new_fd) | |
2509 | put_files_struct(new_fd); | |
2510 | ||
2511 | bad_unshare_cleanup_fs: | |
2512 | if (new_fs) | |
2513 | free_fs_struct(new_fs); | |
2514 | ||
2515 | bad_unshare_out: | |
2516 | return err; | |
2517 | } | |
2518 | ||
2519 | /* | |
2520 | * Helper to unshare the files of the current task. | |
2521 | * We don't want to expose copy_files internals to | |
2522 | * the exec layer of the kernel. | |
2523 | */ | |
2524 | ||
2525 | int unshare_files(struct files_struct **displaced) | |
2526 | { | |
2527 | struct task_struct *task = current; | |
2528 | struct files_struct *copy = NULL; | |
2529 | int error; | |
2530 | ||
2531 | error = unshare_fd(CLONE_FILES, ©); | |
2532 | if (error || !copy) { | |
2533 | *displaced = NULL; | |
2534 | return error; | |
2535 | } | |
2536 | *displaced = task->files; | |
2537 | task_lock(task); | |
2538 | task->files = copy; | |
2539 | task_unlock(task); | |
2540 | return 0; | |
2541 | } | |
2542 | ||
2543 | int sysctl_max_threads(struct ctl_table *table, int write, | |
2544 | void __user *buffer, size_t *lenp, loff_t *ppos) | |
2545 | { | |
2546 | struct ctl_table t; | |
2547 | int ret; | |
2548 | int threads = max_threads; | |
2549 | int min = 1; | |
2550 | int max = MAX_THREADS; | |
2551 | ||
2552 | t = *table; | |
2553 | t.data = &threads; | |
2554 | t.extra1 = &min; | |
2555 | t.extra2 = &max; | |
2556 | ||
2557 | ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos); | |
2558 | if (ret || !write) | |
2559 | return ret; | |
2560 | ||
2561 | max_threads = threads; | |
2562 | ||
2563 | return 0; | |
2564 | } |