blob: cf2cebd214b92f7476339b21dacb01d8e29e64da [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001// SPDX-License-Identifier: GPL-2.0-only
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002/*
3 * linux/kernel/fork.c
4 *
5 * Copyright (C) 1991, 1992 Linus Torvalds
6 */
7
8/*
9 * 'fork.c' contains the help-routines for the 'fork' system call
10 * (see also entry.S and others).
11 * Fork is rather simple, once you get the hang of it, but the memory
12 * management can be a bitch. See 'mm/memory.c': 'copy_page_range()'
13 */
14
David Brazdil0f672f62019-12-10 10:32:29 +000015#include <linux/anon_inodes.h>
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000016#include <linux/slab.h>
17#include <linux/sched/autogroup.h>
18#include <linux/sched/mm.h>
19#include <linux/sched/coredump.h>
20#include <linux/sched/user.h>
21#include <linux/sched/numa_balancing.h>
22#include <linux/sched/stat.h>
23#include <linux/sched/task.h>
24#include <linux/sched/task_stack.h>
25#include <linux/sched/cputime.h>
David Brazdil0f672f62019-12-10 10:32:29 +000026#include <linux/seq_file.h>
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000027#include <linux/rtmutex.h>
28#include <linux/init.h>
29#include <linux/unistd.h>
30#include <linux/module.h>
31#include <linux/vmalloc.h>
32#include <linux/completion.h>
33#include <linux/personality.h>
34#include <linux/mempolicy.h>
35#include <linux/sem.h>
36#include <linux/file.h>
37#include <linux/fdtable.h>
38#include <linux/iocontext.h>
39#include <linux/key.h>
40#include <linux/binfmts.h>
41#include <linux/mman.h>
42#include <linux/mmu_notifier.h>
43#include <linux/hmm.h>
44#include <linux/fs.h>
45#include <linux/mm.h>
46#include <linux/vmacache.h>
47#include <linux/nsproxy.h>
48#include <linux/capability.h>
49#include <linux/cpu.h>
50#include <linux/cgroup.h>
51#include <linux/security.h>
52#include <linux/hugetlb.h>
53#include <linux/seccomp.h>
54#include <linux/swap.h>
55#include <linux/syscalls.h>
56#include <linux/jiffies.h>
57#include <linux/futex.h>
58#include <linux/compat.h>
59#include <linux/kthread.h>
60#include <linux/task_io_accounting_ops.h>
61#include <linux/rcupdate.h>
62#include <linux/ptrace.h>
63#include <linux/mount.h>
64#include <linux/audit.h>
65#include <linux/memcontrol.h>
66#include <linux/ftrace.h>
67#include <linux/proc_fs.h>
68#include <linux/profile.h>
69#include <linux/rmap.h>
70#include <linux/ksm.h>
71#include <linux/acct.h>
72#include <linux/userfaultfd_k.h>
73#include <linux/tsacct_kern.h>
74#include <linux/cn_proc.h>
75#include <linux/freezer.h>
76#include <linux/delayacct.h>
77#include <linux/taskstats_kern.h>
78#include <linux/random.h>
79#include <linux/tty.h>
80#include <linux/blkdev.h>
81#include <linux/fs_struct.h>
82#include <linux/magic.h>
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000083#include <linux/perf_event.h>
84#include <linux/posix-timers.h>
85#include <linux/user-return-notifier.h>
86#include <linux/oom.h>
87#include <linux/khugepaged.h>
88#include <linux/signalfd.h>
89#include <linux/uprobes.h>
90#include <linux/aio.h>
91#include <linux/compiler.h>
92#include <linux/sysctl.h>
93#include <linux/kcov.h>
94#include <linux/livepatch.h>
95#include <linux/thread_info.h>
David Brazdil0f672f62019-12-10 10:32:29 +000096#include <linux/stackleak.h>
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000097
98#include <asm/pgtable.h>
99#include <asm/pgalloc.h>
100#include <linux/uaccess.h>
101#include <asm/mmu_context.h>
102#include <asm/cacheflush.h>
103#include <asm/tlbflush.h>
104
105#include <trace/events/sched.h>
106
107#define CREATE_TRACE_POINTS
108#include <trace/events/task.h>
109
110/*
111 * Minimum number of threads to boot the kernel
112 */
113#define MIN_THREADS 20
114
115/*
116 * Maximum number of threads
117 */
118#define MAX_THREADS FUTEX_TID_MASK
119
120/*
121 * Protected counters by write_lock_irq(&tasklist_lock)
122 */
123unsigned long total_forks; /* Handle normal Linux uptimes. */
124int nr_threads; /* The idle threads do not count.. */
125
David Brazdil0f672f62019-12-10 10:32:29 +0000126static int max_threads; /* tunable limit on nr_threads */
127
128#define NAMED_ARRAY_INDEX(x) [x] = __stringify(x)
129
130static const char * const resident_page_types[] = {
131 NAMED_ARRAY_INDEX(MM_FILEPAGES),
132 NAMED_ARRAY_INDEX(MM_ANONPAGES),
133 NAMED_ARRAY_INDEX(MM_SWAPENTS),
134 NAMED_ARRAY_INDEX(MM_SHMEMPAGES),
135};
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000136
137DEFINE_PER_CPU(unsigned long, process_counts) = 0;
138
139__cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
140
141#ifdef CONFIG_PROVE_RCU
142int lockdep_tasklist_lock_is_held(void)
143{
144 return lockdep_is_held(&tasklist_lock);
145}
146EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held);
147#endif /* #ifdef CONFIG_PROVE_RCU */
148
149int nr_processes(void)
150{
151 int cpu;
152 int total = 0;
153
154 for_each_possible_cpu(cpu)
155 total += per_cpu(process_counts, cpu);
156
157 return total;
158}
159
160void __weak arch_release_task_struct(struct task_struct *tsk)
161{
162}
163
164#ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
165static struct kmem_cache *task_struct_cachep;
166
167static inline struct task_struct *alloc_task_struct_node(int node)
168{
169 return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
170}
171
172static inline void free_task_struct(struct task_struct *tsk)
173{
174 kmem_cache_free(task_struct_cachep, tsk);
175}
176#endif
177
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000178#ifndef CONFIG_ARCH_THREAD_STACK_ALLOCATOR
179
180/*
181 * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a
182 * kmemcache based allocator.
183 */
184# if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)
185
186#ifdef CONFIG_VMAP_STACK
187/*
188 * vmalloc() is a bit slow, and calling vfree() enough times will force a TLB
189 * flush. Try to minimize the number of calls by caching stacks.
190 */
191#define NR_CACHED_STACKS 2
192static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]);
193
194static int free_vm_stack_cache(unsigned int cpu)
195{
196 struct vm_struct **cached_vm_stacks = per_cpu_ptr(cached_stacks, cpu);
197 int i;
198
199 for (i = 0; i < NR_CACHED_STACKS; i++) {
200 struct vm_struct *vm_stack = cached_vm_stacks[i];
201
202 if (!vm_stack)
203 continue;
204
205 vfree(vm_stack->addr);
206 cached_vm_stacks[i] = NULL;
207 }
208
209 return 0;
210}
211#endif
212
213static unsigned long *alloc_thread_stack_node(struct task_struct *tsk, int node)
214{
215#ifdef CONFIG_VMAP_STACK
216 void *stack;
217 int i;
218
219 for (i = 0; i < NR_CACHED_STACKS; i++) {
220 struct vm_struct *s;
221
222 s = this_cpu_xchg(cached_stacks[i], NULL);
223
224 if (!s)
225 continue;
226
227 /* Clear stale pointers from reused stack. */
228 memset(s->addr, 0, THREAD_SIZE);
229
230 tsk->stack_vm_area = s;
David Brazdil0f672f62019-12-10 10:32:29 +0000231 tsk->stack = s->addr;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000232 return s->addr;
233 }
234
David Brazdil0f672f62019-12-10 10:32:29 +0000235 /*
236 * Allocated stacks are cached and later reused by new threads,
237 * so memcg accounting is performed manually on assigning/releasing
238 * stacks to tasks. Drop __GFP_ACCOUNT.
239 */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000240 stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN,
241 VMALLOC_START, VMALLOC_END,
David Brazdil0f672f62019-12-10 10:32:29 +0000242 THREADINFO_GFP & ~__GFP_ACCOUNT,
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000243 PAGE_KERNEL,
244 0, node, __builtin_return_address(0));
245
246 /*
247 * We can't call find_vm_area() in interrupt context, and
248 * free_thread_stack() can be called in interrupt context,
249 * so cache the vm_struct.
250 */
David Brazdil0f672f62019-12-10 10:32:29 +0000251 if (stack) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000252 tsk->stack_vm_area = find_vm_area(stack);
David Brazdil0f672f62019-12-10 10:32:29 +0000253 tsk->stack = stack;
254 }
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000255 return stack;
256#else
257 struct page *page = alloc_pages_node(node, THREADINFO_GFP,
258 THREAD_SIZE_ORDER);
259
David Brazdil0f672f62019-12-10 10:32:29 +0000260 if (likely(page)) {
261 tsk->stack = page_address(page);
262 return tsk->stack;
263 }
264 return NULL;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000265#endif
266}
267
268static inline void free_thread_stack(struct task_struct *tsk)
269{
270#ifdef CONFIG_VMAP_STACK
David Brazdil0f672f62019-12-10 10:32:29 +0000271 struct vm_struct *vm = task_stack_vm_area(tsk);
272
273 if (vm) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000274 int i;
275
David Brazdil0f672f62019-12-10 10:32:29 +0000276 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
277 mod_memcg_page_state(vm->pages[i],
278 MEMCG_KERNEL_STACK_KB,
279 -(int)(PAGE_SIZE / 1024));
280
281 memcg_kmem_uncharge(vm->pages[i], 0);
282 }
283
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000284 for (i = 0; i < NR_CACHED_STACKS; i++) {
285 if (this_cpu_cmpxchg(cached_stacks[i],
286 NULL, tsk->stack_vm_area) != NULL)
287 continue;
288
289 return;
290 }
291
292 vfree_atomic(tsk->stack);
293 return;
294 }
295#endif
296
297 __free_pages(virt_to_page(tsk->stack), THREAD_SIZE_ORDER);
298}
299# else
300static struct kmem_cache *thread_stack_cache;
301
302static unsigned long *alloc_thread_stack_node(struct task_struct *tsk,
303 int node)
304{
David Brazdil0f672f62019-12-10 10:32:29 +0000305 unsigned long *stack;
306 stack = kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node);
307 tsk->stack = stack;
308 return stack;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000309}
310
311static void free_thread_stack(struct task_struct *tsk)
312{
313 kmem_cache_free(thread_stack_cache, tsk->stack);
314}
315
316void thread_stack_cache_init(void)
317{
318 thread_stack_cache = kmem_cache_create_usercopy("thread_stack",
319 THREAD_SIZE, THREAD_SIZE, 0, 0,
320 THREAD_SIZE, NULL);
321 BUG_ON(thread_stack_cache == NULL);
322}
323# endif
324#endif
325
326/* SLAB cache for signal_struct structures (tsk->signal) */
327static struct kmem_cache *signal_cachep;
328
329/* SLAB cache for sighand_struct structures (tsk->sighand) */
330struct kmem_cache *sighand_cachep;
331
332/* SLAB cache for files_struct structures (tsk->files) */
333struct kmem_cache *files_cachep;
334
335/* SLAB cache for fs_struct structures (tsk->fs) */
336struct kmem_cache *fs_cachep;
337
338/* SLAB cache for vm_area_struct structures */
339static struct kmem_cache *vm_area_cachep;
340
341/* SLAB cache for mm_struct structures (tsk->mm) */
342static struct kmem_cache *mm_cachep;
343
344struct vm_area_struct *vm_area_alloc(struct mm_struct *mm)
345{
346 struct vm_area_struct *vma;
347
348 vma = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
349 if (vma)
350 vma_init(vma, mm);
351 return vma;
352}
353
354struct vm_area_struct *vm_area_dup(struct vm_area_struct *orig)
355{
356 struct vm_area_struct *new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
357
358 if (new) {
359 *new = *orig;
360 INIT_LIST_HEAD(&new->anon_vma_chain);
361 }
362 return new;
363}
364
365void vm_area_free(struct vm_area_struct *vma)
366{
367 kmem_cache_free(vm_area_cachep, vma);
368}
369
370static void account_kernel_stack(struct task_struct *tsk, int account)
371{
372 void *stack = task_stack_page(tsk);
373 struct vm_struct *vm = task_stack_vm_area(tsk);
374
375 BUILD_BUG_ON(IS_ENABLED(CONFIG_VMAP_STACK) && PAGE_SIZE % 1024 != 0);
376
377 if (vm) {
378 int i;
379
380 BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE);
381
382 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
383 mod_zone_page_state(page_zone(vm->pages[i]),
384 NR_KERNEL_STACK_KB,
385 PAGE_SIZE / 1024 * account);
386 }
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000387 } else {
388 /*
389 * All stack pages are in the same zone and belong to the
390 * same memcg.
391 */
392 struct page *first_page = virt_to_page(stack);
393
394 mod_zone_page_state(page_zone(first_page), NR_KERNEL_STACK_KB,
395 THREAD_SIZE / 1024 * account);
396
Olivier Deprez0e641232021-09-23 10:07:05 +0200397 mod_memcg_obj_state(stack, MEMCG_KERNEL_STACK_KB,
398 account * (THREAD_SIZE / 1024));
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000399 }
400}
401
David Brazdil0f672f62019-12-10 10:32:29 +0000402static int memcg_charge_kernel_stack(struct task_struct *tsk)
403{
404#ifdef CONFIG_VMAP_STACK
405 struct vm_struct *vm = task_stack_vm_area(tsk);
406 int ret;
407
408 if (vm) {
409 int i;
410
411 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
412 /*
413 * If memcg_kmem_charge() fails, page->mem_cgroup
414 * pointer is NULL, and both memcg_kmem_uncharge()
415 * and mod_memcg_page_state() in free_thread_stack()
416 * will ignore this page. So it's safe.
417 */
418 ret = memcg_kmem_charge(vm->pages[i], GFP_KERNEL, 0);
419 if (ret)
420 return ret;
421
422 mod_memcg_page_state(vm->pages[i],
423 MEMCG_KERNEL_STACK_KB,
424 PAGE_SIZE / 1024);
425 }
426 }
427#endif
428 return 0;
429}
430
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000431static void release_task_stack(struct task_struct *tsk)
432{
433 if (WARN_ON(tsk->state != TASK_DEAD))
434 return; /* Better to leak the stack than to free prematurely */
435
436 account_kernel_stack(tsk, -1);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000437 free_thread_stack(tsk);
438 tsk->stack = NULL;
439#ifdef CONFIG_VMAP_STACK
440 tsk->stack_vm_area = NULL;
441#endif
442}
443
444#ifdef CONFIG_THREAD_INFO_IN_TASK
445void put_task_stack(struct task_struct *tsk)
446{
David Brazdil0f672f62019-12-10 10:32:29 +0000447 if (refcount_dec_and_test(&tsk->stack_refcount))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000448 release_task_stack(tsk);
449}
450#endif
451
452void free_task(struct task_struct *tsk)
453{
454#ifndef CONFIG_THREAD_INFO_IN_TASK
455 /*
456 * The task is finally done with both the stack and thread_info,
457 * so free both.
458 */
459 release_task_stack(tsk);
460#else
461 /*
462 * If the task had a separate stack allocation, it should be gone
463 * by now.
464 */
David Brazdil0f672f62019-12-10 10:32:29 +0000465 WARN_ON_ONCE(refcount_read(&tsk->stack_refcount) != 0);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000466#endif
467 rt_mutex_debug_task_free(tsk);
468 ftrace_graph_exit_task(tsk);
469 put_seccomp_filter(tsk);
470 arch_release_task_struct(tsk);
471 if (tsk->flags & PF_KTHREAD)
472 free_kthread_struct(tsk);
473 free_task_struct(tsk);
474}
475EXPORT_SYMBOL(free_task);
476
477#ifdef CONFIG_MMU
478static __latent_entropy int dup_mmap(struct mm_struct *mm,
479 struct mm_struct *oldmm)
480{
481 struct vm_area_struct *mpnt, *tmp, *prev, **pprev;
482 struct rb_node **rb_link, *rb_parent;
483 int retval;
484 unsigned long charge;
485 LIST_HEAD(uf);
486
487 uprobe_start_dup_mmap();
488 if (down_write_killable(&oldmm->mmap_sem)) {
489 retval = -EINTR;
490 goto fail_uprobe_end;
491 }
492 flush_cache_dup_mm(oldmm);
493 uprobe_dup_mmap(oldmm, mm);
494 /*
495 * Not linked in yet - no deadlock potential:
496 */
497 down_write_nested(&mm->mmap_sem, SINGLE_DEPTH_NESTING);
498
499 /* No ordering required: file already has been exposed. */
500 RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
501
502 mm->total_vm = oldmm->total_vm;
503 mm->data_vm = oldmm->data_vm;
504 mm->exec_vm = oldmm->exec_vm;
505 mm->stack_vm = oldmm->stack_vm;
506
507 rb_link = &mm->mm_rb.rb_node;
508 rb_parent = NULL;
509 pprev = &mm->mmap;
510 retval = ksm_fork(mm, oldmm);
511 if (retval)
512 goto out;
513 retval = khugepaged_fork(mm, oldmm);
514 if (retval)
515 goto out;
516
517 prev = NULL;
518 for (mpnt = oldmm->mmap; mpnt; mpnt = mpnt->vm_next) {
519 struct file *file;
520
521 if (mpnt->vm_flags & VM_DONTCOPY) {
522 vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt));
523 continue;
524 }
525 charge = 0;
526 /*
527 * Don't duplicate many vmas if we've been oom-killed (for
528 * example)
529 */
530 if (fatal_signal_pending(current)) {
531 retval = -EINTR;
532 goto out;
533 }
534 if (mpnt->vm_flags & VM_ACCOUNT) {
535 unsigned long len = vma_pages(mpnt);
536
537 if (security_vm_enough_memory_mm(oldmm, len)) /* sic */
538 goto fail_nomem;
539 charge = len;
540 }
541 tmp = vm_area_dup(mpnt);
542 if (!tmp)
543 goto fail_nomem;
544 retval = vma_dup_policy(mpnt, tmp);
545 if (retval)
546 goto fail_nomem_policy;
547 tmp->vm_mm = mm;
548 retval = dup_userfaultfd(tmp, &uf);
549 if (retval)
550 goto fail_nomem_anon_vma_fork;
551 if (tmp->vm_flags & VM_WIPEONFORK) {
552 /* VM_WIPEONFORK gets a clean slate in the child. */
553 tmp->anon_vma = NULL;
554 if (anon_vma_prepare(tmp))
555 goto fail_nomem_anon_vma_fork;
556 } else if (anon_vma_fork(tmp, mpnt))
557 goto fail_nomem_anon_vma_fork;
558 tmp->vm_flags &= ~(VM_LOCKED | VM_LOCKONFAULT);
559 tmp->vm_next = tmp->vm_prev = NULL;
560 file = tmp->vm_file;
561 if (file) {
562 struct inode *inode = file_inode(file);
563 struct address_space *mapping = file->f_mapping;
564
565 get_file(file);
566 if (tmp->vm_flags & VM_DENYWRITE)
567 atomic_dec(&inode->i_writecount);
568 i_mmap_lock_write(mapping);
569 if (tmp->vm_flags & VM_SHARED)
570 atomic_inc(&mapping->i_mmap_writable);
571 flush_dcache_mmap_lock(mapping);
572 /* insert tmp into the share list, just after mpnt */
573 vma_interval_tree_insert_after(tmp, mpnt,
574 &mapping->i_mmap);
575 flush_dcache_mmap_unlock(mapping);
576 i_mmap_unlock_write(mapping);
577 }
578
579 /*
580 * Clear hugetlb-related page reserves for children. This only
581 * affects MAP_PRIVATE mappings. Faults generated by the child
582 * are not guaranteed to succeed, even if read-only
583 */
584 if (is_vm_hugetlb_page(tmp))
585 reset_vma_resv_huge_pages(tmp);
586
587 /*
588 * Link in the new vma and copy the page table entries.
589 */
590 *pprev = tmp;
591 pprev = &tmp->vm_next;
592 tmp->vm_prev = prev;
593 prev = tmp;
594
595 __vma_link_rb(mm, tmp, rb_link, rb_parent);
596 rb_link = &tmp->vm_rb.rb_right;
597 rb_parent = &tmp->vm_rb;
598
599 mm->map_count++;
600 if (!(tmp->vm_flags & VM_WIPEONFORK))
601 retval = copy_page_range(mm, oldmm, mpnt);
602
603 if (tmp->vm_ops && tmp->vm_ops->open)
604 tmp->vm_ops->open(tmp);
605
606 if (retval)
607 goto out;
608 }
609 /* a new mm has just been created */
610 retval = arch_dup_mmap(oldmm, mm);
611out:
612 up_write(&mm->mmap_sem);
613 flush_tlb_mm(oldmm);
614 up_write(&oldmm->mmap_sem);
615 dup_userfaultfd_complete(&uf);
616fail_uprobe_end:
617 uprobe_end_dup_mmap();
618 return retval;
619fail_nomem_anon_vma_fork:
620 mpol_put(vma_policy(tmp));
621fail_nomem_policy:
622 vm_area_free(tmp);
623fail_nomem:
624 retval = -ENOMEM;
625 vm_unacct_memory(charge);
626 goto out;
627}
628
629static inline int mm_alloc_pgd(struct mm_struct *mm)
630{
631 mm->pgd = pgd_alloc(mm);
632 if (unlikely(!mm->pgd))
633 return -ENOMEM;
634 return 0;
635}
636
637static inline void mm_free_pgd(struct mm_struct *mm)
638{
639 pgd_free(mm, mm->pgd);
640}
641#else
642static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
643{
644 down_write(&oldmm->mmap_sem);
645 RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
646 up_write(&oldmm->mmap_sem);
647 return 0;
648}
649#define mm_alloc_pgd(mm) (0)
650#define mm_free_pgd(mm)
651#endif /* CONFIG_MMU */
652
653static void check_mm(struct mm_struct *mm)
654{
655 int i;
656
David Brazdil0f672f62019-12-10 10:32:29 +0000657 BUILD_BUG_ON_MSG(ARRAY_SIZE(resident_page_types) != NR_MM_COUNTERS,
658 "Please make sure 'struct resident_page_types[]' is updated as well");
659
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000660 for (i = 0; i < NR_MM_COUNTERS; i++) {
661 long x = atomic_long_read(&mm->rss_stat.count[i]);
662
663 if (unlikely(x))
David Brazdil0f672f62019-12-10 10:32:29 +0000664 pr_alert("BUG: Bad rss-counter state mm:%p type:%s val:%ld\n",
665 mm, resident_page_types[i], x);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000666 }
667
668 if (mm_pgtables_bytes(mm))
669 pr_alert("BUG: non-zero pgtables_bytes on freeing mm: %ld\n",
670 mm_pgtables_bytes(mm));
671
672#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
673 VM_BUG_ON_MM(mm->pmd_huge_pte, mm);
674#endif
675}
676
677#define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
678#define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
679
680/*
681 * Called when the last reference to the mm
682 * is dropped: either by a lazy thread or by
683 * mmput. Free the page directory and the mm.
684 */
685void __mmdrop(struct mm_struct *mm)
686{
687 BUG_ON(mm == &init_mm);
688 WARN_ON_ONCE(mm == current->mm);
689 WARN_ON_ONCE(mm == current->active_mm);
690 mm_free_pgd(mm);
691 destroy_context(mm);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000692 mmu_notifier_mm_destroy(mm);
693 check_mm(mm);
694 put_user_ns(mm->user_ns);
695 free_mm(mm);
696}
697EXPORT_SYMBOL_GPL(__mmdrop);
698
699static void mmdrop_async_fn(struct work_struct *work)
700{
701 struct mm_struct *mm;
702
703 mm = container_of(work, struct mm_struct, async_put_work);
704 __mmdrop(mm);
705}
706
707static void mmdrop_async(struct mm_struct *mm)
708{
709 if (unlikely(atomic_dec_and_test(&mm->mm_count))) {
710 INIT_WORK(&mm->async_put_work, mmdrop_async_fn);
711 schedule_work(&mm->async_put_work);
712 }
713}
714
715static inline void free_signal_struct(struct signal_struct *sig)
716{
717 taskstats_tgid_free(sig);
718 sched_autogroup_exit(sig);
719 /*
720 * __mmdrop is not safe to call from softirq context on x86 due to
721 * pgd_dtor so postpone it to the async context
722 */
723 if (sig->oom_mm)
724 mmdrop_async(sig->oom_mm);
725 kmem_cache_free(signal_cachep, sig);
726}
727
728static inline void put_signal_struct(struct signal_struct *sig)
729{
David Brazdil0f672f62019-12-10 10:32:29 +0000730 if (refcount_dec_and_test(&sig->sigcnt))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000731 free_signal_struct(sig);
732}
733
734void __put_task_struct(struct task_struct *tsk)
735{
736 WARN_ON(!tsk->exit_state);
David Brazdil0f672f62019-12-10 10:32:29 +0000737 WARN_ON(refcount_read(&tsk->usage));
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000738 WARN_ON(tsk == current);
739
740 cgroup_free(tsk);
David Brazdil0f672f62019-12-10 10:32:29 +0000741 task_numa_free(tsk, true);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000742 security_task_free(tsk);
743 exit_creds(tsk);
744 delayacct_tsk_free(tsk);
745 put_signal_struct(tsk->signal);
746
747 if (!profile_handoff_task(tsk))
748 free_task(tsk);
749}
750EXPORT_SYMBOL_GPL(__put_task_struct);
751
752void __init __weak arch_task_cache_init(void) { }
753
754/*
755 * set_max_threads
756 */
757static void set_max_threads(unsigned int max_threads_suggested)
758{
759 u64 threads;
David Brazdil0f672f62019-12-10 10:32:29 +0000760 unsigned long nr_pages = totalram_pages();
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000761
762 /*
763 * The number of threads shall be limited such that the thread
764 * structures may only consume a small part of the available memory.
765 */
David Brazdil0f672f62019-12-10 10:32:29 +0000766 if (fls64(nr_pages) + fls64(PAGE_SIZE) > 64)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000767 threads = MAX_THREADS;
768 else
David Brazdil0f672f62019-12-10 10:32:29 +0000769 threads = div64_u64((u64) nr_pages * (u64) PAGE_SIZE,
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000770 (u64) THREAD_SIZE * 8UL);
771
772 if (threads > max_threads_suggested)
773 threads = max_threads_suggested;
774
775 max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS);
776}
777
778#ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT
779/* Initialized by the architecture: */
780int arch_task_struct_size __read_mostly;
781#endif
782
David Brazdil0f672f62019-12-10 10:32:29 +0000783#ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000784static void task_struct_whitelist(unsigned long *offset, unsigned long *size)
785{
786 /* Fetch thread_struct whitelist for the architecture. */
787 arch_thread_struct_whitelist(offset, size);
788
789 /*
790 * Handle zero-sized whitelist or empty thread_struct, otherwise
791 * adjust offset to position of thread_struct in task_struct.
792 */
793 if (unlikely(*size == 0))
794 *offset = 0;
795 else
796 *offset += offsetof(struct task_struct, thread);
797}
David Brazdil0f672f62019-12-10 10:32:29 +0000798#endif /* CONFIG_ARCH_TASK_STRUCT_ALLOCATOR */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000799
800void __init fork_init(void)
801{
802 int i;
803#ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
804#ifndef ARCH_MIN_TASKALIGN
805#define ARCH_MIN_TASKALIGN 0
806#endif
807 int align = max_t(int, L1_CACHE_BYTES, ARCH_MIN_TASKALIGN);
808 unsigned long useroffset, usersize;
809
810 /* create a slab on which task_structs can be allocated */
811 task_struct_whitelist(&useroffset, &usersize);
812 task_struct_cachep = kmem_cache_create_usercopy("task_struct",
813 arch_task_struct_size, align,
814 SLAB_PANIC|SLAB_ACCOUNT,
815 useroffset, usersize, NULL);
816#endif
817
818 /* do the arch specific task caches init */
819 arch_task_cache_init();
820
821 set_max_threads(MAX_THREADS);
822
823 init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
824 init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
825 init_task.signal->rlim[RLIMIT_SIGPENDING] =
826 init_task.signal->rlim[RLIMIT_NPROC];
827
828 for (i = 0; i < UCOUNT_COUNTS; i++) {
829 init_user_ns.ucount_max[i] = max_threads/2;
830 }
831
832#ifdef CONFIG_VMAP_STACK
833 cpuhp_setup_state(CPUHP_BP_PREPARE_DYN, "fork:vm_stack_cache",
834 NULL, free_vm_stack_cache);
835#endif
836
837 lockdep_init_task(&init_task);
David Brazdil0f672f62019-12-10 10:32:29 +0000838 uprobes_init();
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000839}
840
841int __weak arch_dup_task_struct(struct task_struct *dst,
842 struct task_struct *src)
843{
844 *dst = *src;
845 return 0;
846}
847
848void set_task_stack_end_magic(struct task_struct *tsk)
849{
850 unsigned long *stackend;
851
852 stackend = end_of_stack(tsk);
853 *stackend = STACK_END_MAGIC; /* for overflow detection */
854}
855
856static struct task_struct *dup_task_struct(struct task_struct *orig, int node)
857{
858 struct task_struct *tsk;
859 unsigned long *stack;
David Brazdil0f672f62019-12-10 10:32:29 +0000860 struct vm_struct *stack_vm_area __maybe_unused;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000861 int err;
862
863 if (node == NUMA_NO_NODE)
864 node = tsk_fork_get_node(orig);
865 tsk = alloc_task_struct_node(node);
866 if (!tsk)
867 return NULL;
868
869 stack = alloc_thread_stack_node(tsk, node);
870 if (!stack)
871 goto free_tsk;
872
David Brazdil0f672f62019-12-10 10:32:29 +0000873 if (memcg_charge_kernel_stack(tsk))
874 goto free_stack;
875
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000876 stack_vm_area = task_stack_vm_area(tsk);
877
878 err = arch_dup_task_struct(tsk, orig);
879
880 /*
881 * arch_dup_task_struct() clobbers the stack-related fields. Make
882 * sure they're properly initialized before using any stack-related
883 * functions again.
884 */
885 tsk->stack = stack;
886#ifdef CONFIG_VMAP_STACK
887 tsk->stack_vm_area = stack_vm_area;
888#endif
889#ifdef CONFIG_THREAD_INFO_IN_TASK
David Brazdil0f672f62019-12-10 10:32:29 +0000890 refcount_set(&tsk->stack_refcount, 1);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000891#endif
892
893 if (err)
894 goto free_stack;
895
896#ifdef CONFIG_SECCOMP
897 /*
898 * We must handle setting up seccomp filters once we're under
899 * the sighand lock in case orig has changed between now and
900 * then. Until then, filter must be NULL to avoid messing up
901 * the usage counts on the error path calling free_task.
902 */
903 tsk->seccomp.filter = NULL;
904#endif
905
906 setup_thread_stack(tsk, orig);
907 clear_user_return_notifier(tsk);
908 clear_tsk_need_resched(tsk);
909 set_task_stack_end_magic(tsk);
910
911#ifdef CONFIG_STACKPROTECTOR
912 tsk->stack_canary = get_random_canary();
913#endif
David Brazdil0f672f62019-12-10 10:32:29 +0000914 if (orig->cpus_ptr == &orig->cpus_mask)
915 tsk->cpus_ptr = &tsk->cpus_mask;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000916
917 /*
David Brazdil0f672f62019-12-10 10:32:29 +0000918 * One for the user space visible state that goes away when reaped.
919 * One for the scheduler.
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000920 */
David Brazdil0f672f62019-12-10 10:32:29 +0000921 refcount_set(&tsk->rcu_users, 2);
922 /* One for the rcu users */
923 refcount_set(&tsk->usage, 1);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000924#ifdef CONFIG_BLK_DEV_IO_TRACE
925 tsk->btrace_seq = 0;
926#endif
927 tsk->splice_pipe = NULL;
928 tsk->task_frag.page = NULL;
929 tsk->wake_q.next = NULL;
930
931 account_kernel_stack(tsk, 1);
932
933 kcov_task_init(tsk);
934
935#ifdef CONFIG_FAULT_INJECTION
936 tsk->fail_nth = 0;
937#endif
938
939#ifdef CONFIG_BLK_CGROUP
940 tsk->throttle_queue = NULL;
941 tsk->use_memdelay = 0;
942#endif
943
944#ifdef CONFIG_MEMCG
945 tsk->active_memcg = NULL;
946#endif
947 return tsk;
948
949free_stack:
950 free_thread_stack(tsk);
951free_tsk:
952 free_task_struct(tsk);
953 return NULL;
954}
955
956__cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
957
958static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT;
959
960static int __init coredump_filter_setup(char *s)
961{
962 default_dump_filter =
963 (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) &
964 MMF_DUMP_FILTER_MASK;
965 return 1;
966}
967
968__setup("coredump_filter=", coredump_filter_setup);
969
970#include <linux/init_task.h>
971
972static void mm_init_aio(struct mm_struct *mm)
973{
974#ifdef CONFIG_AIO
975 spin_lock_init(&mm->ioctx_lock);
976 mm->ioctx_table = NULL;
977#endif
978}
979
David Brazdil0f672f62019-12-10 10:32:29 +0000980static __always_inline void mm_clear_owner(struct mm_struct *mm,
981 struct task_struct *p)
982{
983#ifdef CONFIG_MEMCG
984 if (mm->owner == p)
985 WRITE_ONCE(mm->owner, NULL);
986#endif
987}
988
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000989static void mm_init_owner(struct mm_struct *mm, struct task_struct *p)
990{
991#ifdef CONFIG_MEMCG
992 mm->owner = p;
993#endif
994}
995
996static void mm_init_uprobes_state(struct mm_struct *mm)
997{
998#ifdef CONFIG_UPROBES
999 mm->uprobes_state.xol_area = NULL;
1000#endif
1001}
1002
1003static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p,
1004 struct user_namespace *user_ns)
1005{
1006 mm->mmap = NULL;
1007 mm->mm_rb = RB_ROOT;
1008 mm->vmacache_seqnum = 0;
1009 atomic_set(&mm->mm_users, 1);
1010 atomic_set(&mm->mm_count, 1);
1011 init_rwsem(&mm->mmap_sem);
1012 INIT_LIST_HEAD(&mm->mmlist);
1013 mm->core_state = NULL;
1014 mm_pgtables_bytes_init(mm);
1015 mm->map_count = 0;
1016 mm->locked_vm = 0;
David Brazdil0f672f62019-12-10 10:32:29 +00001017 atomic64_set(&mm->pinned_vm, 0);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001018 memset(&mm->rss_stat, 0, sizeof(mm->rss_stat));
1019 spin_lock_init(&mm->page_table_lock);
1020 spin_lock_init(&mm->arg_lock);
1021 mm_init_cpumask(mm);
1022 mm_init_aio(mm);
1023 mm_init_owner(mm, p);
1024 RCU_INIT_POINTER(mm->exe_file, NULL);
1025 mmu_notifier_mm_init(mm);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001026 init_tlb_flush_pending(mm);
1027#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
1028 mm->pmd_huge_pte = NULL;
1029#endif
1030 mm_init_uprobes_state(mm);
Olivier Deprez0e641232021-09-23 10:07:05 +02001031 hugetlb_count_init(mm);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001032
1033 if (current->mm) {
1034 mm->flags = current->mm->flags & MMF_INIT_MASK;
1035 mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK;
1036 } else {
1037 mm->flags = default_dump_filter;
1038 mm->def_flags = 0;
1039 }
1040
1041 if (mm_alloc_pgd(mm))
1042 goto fail_nopgd;
1043
1044 if (init_new_context(p, mm))
1045 goto fail_nocontext;
1046
1047 mm->user_ns = get_user_ns(user_ns);
1048 return mm;
1049
1050fail_nocontext:
1051 mm_free_pgd(mm);
1052fail_nopgd:
1053 free_mm(mm);
1054 return NULL;
1055}
1056
1057/*
1058 * Allocate and initialize an mm_struct.
1059 */
1060struct mm_struct *mm_alloc(void)
1061{
1062 struct mm_struct *mm;
1063
1064 mm = allocate_mm();
1065 if (!mm)
1066 return NULL;
1067
1068 memset(mm, 0, sizeof(*mm));
1069 return mm_init(mm, current, current_user_ns());
1070}
1071
1072static inline void __mmput(struct mm_struct *mm)
1073{
1074 VM_BUG_ON(atomic_read(&mm->mm_users));
1075
1076 uprobe_clear_state(mm);
1077 exit_aio(mm);
1078 ksm_exit(mm);
1079 khugepaged_exit(mm); /* must run before exit_mmap */
1080 exit_mmap(mm);
1081 mm_put_huge_zero_page(mm);
1082 set_mm_exe_file(mm, NULL);
1083 if (!list_empty(&mm->mmlist)) {
1084 spin_lock(&mmlist_lock);
1085 list_del(&mm->mmlist);
1086 spin_unlock(&mmlist_lock);
1087 }
1088 if (mm->binfmt)
1089 module_put(mm->binfmt->module);
1090 mmdrop(mm);
1091}
1092
1093/*
1094 * Decrement the use count and release all resources for an mm.
1095 */
1096void mmput(struct mm_struct *mm)
1097{
1098 might_sleep();
1099
1100 if (atomic_dec_and_test(&mm->mm_users))
1101 __mmput(mm);
1102}
1103EXPORT_SYMBOL_GPL(mmput);
1104
1105#ifdef CONFIG_MMU
1106static void mmput_async_fn(struct work_struct *work)
1107{
1108 struct mm_struct *mm = container_of(work, struct mm_struct,
1109 async_put_work);
1110
1111 __mmput(mm);
1112}
1113
1114void mmput_async(struct mm_struct *mm)
1115{
1116 if (atomic_dec_and_test(&mm->mm_users)) {
1117 INIT_WORK(&mm->async_put_work, mmput_async_fn);
1118 schedule_work(&mm->async_put_work);
1119 }
1120}
1121#endif
1122
1123/**
1124 * set_mm_exe_file - change a reference to the mm's executable file
1125 *
1126 * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
1127 *
1128 * Main users are mmput() and sys_execve(). Callers prevent concurrent
1129 * invocations: in mmput() nobody alive left, in execve task is single
1130 * threaded. sys_prctl(PR_SET_MM_MAP/EXE_FILE) also needs to set the
1131 * mm->exe_file, but does so without using set_mm_exe_file() in order
1132 * to do avoid the need for any locks.
1133 */
1134void set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1135{
1136 struct file *old_exe_file;
1137
1138 /*
1139 * It is safe to dereference the exe_file without RCU as
1140 * this function is only called if nobody else can access
1141 * this mm -- see comment above for justification.
1142 */
1143 old_exe_file = rcu_dereference_raw(mm->exe_file);
1144
1145 if (new_exe_file)
1146 get_file(new_exe_file);
1147 rcu_assign_pointer(mm->exe_file, new_exe_file);
1148 if (old_exe_file)
1149 fput(old_exe_file);
1150}
1151
1152/**
1153 * get_mm_exe_file - acquire a reference to the mm's executable file
1154 *
1155 * Returns %NULL if mm has no associated executable file.
1156 * User must release file via fput().
1157 */
1158struct file *get_mm_exe_file(struct mm_struct *mm)
1159{
1160 struct file *exe_file;
1161
1162 rcu_read_lock();
1163 exe_file = rcu_dereference(mm->exe_file);
1164 if (exe_file && !get_file_rcu(exe_file))
1165 exe_file = NULL;
1166 rcu_read_unlock();
1167 return exe_file;
1168}
1169EXPORT_SYMBOL(get_mm_exe_file);
1170
1171/**
1172 * get_task_exe_file - acquire a reference to the task's executable file
1173 *
1174 * Returns %NULL if task's mm (if any) has no associated executable file or
1175 * this is a kernel thread with borrowed mm (see the comment above get_task_mm).
1176 * User must release file via fput().
1177 */
1178struct file *get_task_exe_file(struct task_struct *task)
1179{
1180 struct file *exe_file = NULL;
1181 struct mm_struct *mm;
1182
1183 task_lock(task);
1184 mm = task->mm;
1185 if (mm) {
1186 if (!(task->flags & PF_KTHREAD))
1187 exe_file = get_mm_exe_file(mm);
1188 }
1189 task_unlock(task);
1190 return exe_file;
1191}
1192EXPORT_SYMBOL(get_task_exe_file);
1193
1194/**
1195 * get_task_mm - acquire a reference to the task's mm
1196 *
1197 * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning
1198 * this kernel workthread has transiently adopted a user mm with use_mm,
1199 * to do its AIO) is not set and if so returns a reference to it, after
1200 * bumping up the use count. User must release the mm via mmput()
1201 * after use. Typically used by /proc and ptrace.
1202 */
1203struct mm_struct *get_task_mm(struct task_struct *task)
1204{
1205 struct mm_struct *mm;
1206
1207 task_lock(task);
1208 mm = task->mm;
1209 if (mm) {
1210 if (task->flags & PF_KTHREAD)
1211 mm = NULL;
1212 else
1213 mmget(mm);
1214 }
1215 task_unlock(task);
1216 return mm;
1217}
1218EXPORT_SYMBOL_GPL(get_task_mm);
1219
1220struct mm_struct *mm_access(struct task_struct *task, unsigned int mode)
1221{
1222 struct mm_struct *mm;
1223 int err;
1224
Olivier Deprez0e641232021-09-23 10:07:05 +02001225 err = down_read_killable(&task->signal->exec_update_lock);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001226 if (err)
1227 return ERR_PTR(err);
1228
1229 mm = get_task_mm(task);
1230 if (mm && mm != current->mm &&
1231 !ptrace_may_access(task, mode)) {
1232 mmput(mm);
1233 mm = ERR_PTR(-EACCES);
1234 }
Olivier Deprez0e641232021-09-23 10:07:05 +02001235 up_read(&task->signal->exec_update_lock);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001236
1237 return mm;
1238}
1239
1240static void complete_vfork_done(struct task_struct *tsk)
1241{
1242 struct completion *vfork;
1243
1244 task_lock(tsk);
1245 vfork = tsk->vfork_done;
1246 if (likely(vfork)) {
1247 tsk->vfork_done = NULL;
1248 complete(vfork);
1249 }
1250 task_unlock(tsk);
1251}
1252
1253static int wait_for_vfork_done(struct task_struct *child,
1254 struct completion *vfork)
1255{
1256 int killed;
1257
1258 freezer_do_not_count();
David Brazdil0f672f62019-12-10 10:32:29 +00001259 cgroup_enter_frozen();
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001260 killed = wait_for_completion_killable(vfork);
David Brazdil0f672f62019-12-10 10:32:29 +00001261 cgroup_leave_frozen(false);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001262 freezer_count();
1263
1264 if (killed) {
1265 task_lock(child);
1266 child->vfork_done = NULL;
1267 task_unlock(child);
1268 }
1269
1270 put_task_struct(child);
1271 return killed;
1272}
1273
1274/* Please note the differences between mmput and mm_release.
1275 * mmput is called whenever we stop holding onto a mm_struct,
1276 * error success whatever.
1277 *
1278 * mm_release is called after a mm_struct has been removed
1279 * from the current process.
1280 *
1281 * This difference is important for error handling, when we
1282 * only half set up a mm_struct for a new process and need to restore
1283 * the old one. Because we mmput the new mm_struct before
1284 * restoring the old one. . .
1285 * Eric Biederman 10 January 1998
1286 */
David Brazdil0f672f62019-12-10 10:32:29 +00001287static void mm_release(struct task_struct *tsk, struct mm_struct *mm)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001288{
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001289 uprobe_free_utask(tsk);
1290
1291 /* Get rid of any cached register state */
1292 deactivate_mm(tsk, mm);
1293
1294 /*
1295 * Signal userspace if we're not exiting with a core dump
1296 * because we want to leave the value intact for debugging
1297 * purposes.
1298 */
1299 if (tsk->clear_child_tid) {
1300 if (!(tsk->signal->flags & SIGNAL_GROUP_COREDUMP) &&
1301 atomic_read(&mm->mm_users) > 1) {
1302 /*
1303 * We don't check the error code - if userspace has
1304 * not set up a proper pointer then tough luck.
1305 */
1306 put_user(0, tsk->clear_child_tid);
1307 do_futex(tsk->clear_child_tid, FUTEX_WAKE,
1308 1, NULL, NULL, 0, 0);
1309 }
1310 tsk->clear_child_tid = NULL;
1311 }
1312
1313 /*
1314 * All done, finally we can wake up parent and return this mm to him.
1315 * Also kthread_stop() uses this completion for synchronization.
1316 */
1317 if (tsk->vfork_done)
1318 complete_vfork_done(tsk);
1319}
1320
David Brazdil0f672f62019-12-10 10:32:29 +00001321void exit_mm_release(struct task_struct *tsk, struct mm_struct *mm)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001322{
David Brazdil0f672f62019-12-10 10:32:29 +00001323 futex_exit_release(tsk);
1324 mm_release(tsk, mm);
1325}
1326
1327void exec_mm_release(struct task_struct *tsk, struct mm_struct *mm)
1328{
1329 futex_exec_release(tsk);
1330 mm_release(tsk, mm);
1331}
1332
1333/**
1334 * dup_mm() - duplicates an existing mm structure
1335 * @tsk: the task_struct with which the new mm will be associated.
1336 * @oldmm: the mm to duplicate.
1337 *
1338 * Allocates a new mm structure and duplicates the provided @oldmm structure
1339 * content into it.
1340 *
1341 * Return: the duplicated mm or NULL on failure.
1342 */
1343static struct mm_struct *dup_mm(struct task_struct *tsk,
1344 struct mm_struct *oldmm)
1345{
1346 struct mm_struct *mm;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001347 int err;
1348
1349 mm = allocate_mm();
1350 if (!mm)
1351 goto fail_nomem;
1352
1353 memcpy(mm, oldmm, sizeof(*mm));
1354
1355 if (!mm_init(mm, tsk, mm->user_ns))
1356 goto fail_nomem;
1357
1358 err = dup_mmap(mm, oldmm);
1359 if (err)
1360 goto free_pt;
1361
1362 mm->hiwater_rss = get_mm_rss(mm);
1363 mm->hiwater_vm = mm->total_vm;
1364
1365 if (mm->binfmt && !try_module_get(mm->binfmt->module))
1366 goto free_pt;
1367
1368 return mm;
1369
1370free_pt:
1371 /* don't put binfmt in mmput, we haven't got module yet */
1372 mm->binfmt = NULL;
David Brazdil0f672f62019-12-10 10:32:29 +00001373 mm_init_owner(mm, NULL);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001374 mmput(mm);
1375
1376fail_nomem:
1377 return NULL;
1378}
1379
1380static int copy_mm(unsigned long clone_flags, struct task_struct *tsk)
1381{
1382 struct mm_struct *mm, *oldmm;
1383 int retval;
1384
1385 tsk->min_flt = tsk->maj_flt = 0;
1386 tsk->nvcsw = tsk->nivcsw = 0;
1387#ifdef CONFIG_DETECT_HUNG_TASK
1388 tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw;
1389 tsk->last_switch_time = 0;
1390#endif
1391
1392 tsk->mm = NULL;
1393 tsk->active_mm = NULL;
1394
1395 /*
1396 * Are we cloning a kernel thread?
1397 *
1398 * We need to steal a active VM for that..
1399 */
1400 oldmm = current->mm;
1401 if (!oldmm)
1402 return 0;
1403
1404 /* initialize the new vmacache entries */
1405 vmacache_flush(tsk);
1406
1407 if (clone_flags & CLONE_VM) {
1408 mmget(oldmm);
1409 mm = oldmm;
1410 goto good_mm;
1411 }
1412
1413 retval = -ENOMEM;
David Brazdil0f672f62019-12-10 10:32:29 +00001414 mm = dup_mm(tsk, current->mm);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001415 if (!mm)
1416 goto fail_nomem;
1417
1418good_mm:
1419 tsk->mm = mm;
1420 tsk->active_mm = mm;
1421 return 0;
1422
1423fail_nomem:
1424 return retval;
1425}
1426
1427static int copy_fs(unsigned long clone_flags, struct task_struct *tsk)
1428{
1429 struct fs_struct *fs = current->fs;
1430 if (clone_flags & CLONE_FS) {
1431 /* tsk->fs is already what we want */
1432 spin_lock(&fs->lock);
1433 if (fs->in_exec) {
1434 spin_unlock(&fs->lock);
1435 return -EAGAIN;
1436 }
1437 fs->users++;
1438 spin_unlock(&fs->lock);
1439 return 0;
1440 }
1441 tsk->fs = copy_fs_struct(fs);
1442 if (!tsk->fs)
1443 return -ENOMEM;
1444 return 0;
1445}
1446
1447static int copy_files(unsigned long clone_flags, struct task_struct *tsk)
1448{
1449 struct files_struct *oldf, *newf;
1450 int error = 0;
1451
1452 /*
1453 * A background process may not have any files ...
1454 */
1455 oldf = current->files;
1456 if (!oldf)
1457 goto out;
1458
1459 if (clone_flags & CLONE_FILES) {
1460 atomic_inc(&oldf->count);
1461 goto out;
1462 }
1463
1464 newf = dup_fd(oldf, &error);
1465 if (!newf)
1466 goto out;
1467
1468 tsk->files = newf;
1469 error = 0;
1470out:
1471 return error;
1472}
1473
1474static int copy_io(unsigned long clone_flags, struct task_struct *tsk)
1475{
1476#ifdef CONFIG_BLOCK
1477 struct io_context *ioc = current->io_context;
1478 struct io_context *new_ioc;
1479
1480 if (!ioc)
1481 return 0;
1482 /*
1483 * Share io context with parent, if CLONE_IO is set
1484 */
1485 if (clone_flags & CLONE_IO) {
1486 ioc_task_link(ioc);
1487 tsk->io_context = ioc;
1488 } else if (ioprio_valid(ioc->ioprio)) {
1489 new_ioc = get_task_io_context(tsk, GFP_KERNEL, NUMA_NO_NODE);
1490 if (unlikely(!new_ioc))
1491 return -ENOMEM;
1492
1493 new_ioc->ioprio = ioc->ioprio;
1494 put_io_context(new_ioc);
1495 }
1496#endif
1497 return 0;
1498}
1499
1500static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk)
1501{
1502 struct sighand_struct *sig;
1503
1504 if (clone_flags & CLONE_SIGHAND) {
David Brazdil0f672f62019-12-10 10:32:29 +00001505 refcount_inc(&current->sighand->count);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001506 return 0;
1507 }
1508 sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1509 rcu_assign_pointer(tsk->sighand, sig);
1510 if (!sig)
1511 return -ENOMEM;
1512
David Brazdil0f672f62019-12-10 10:32:29 +00001513 refcount_set(&sig->count, 1);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001514 spin_lock_irq(&current->sighand->siglock);
1515 memcpy(sig->action, current->sighand->action, sizeof(sig->action));
1516 spin_unlock_irq(&current->sighand->siglock);
1517 return 0;
1518}
1519
1520void __cleanup_sighand(struct sighand_struct *sighand)
1521{
David Brazdil0f672f62019-12-10 10:32:29 +00001522 if (refcount_dec_and_test(&sighand->count)) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001523 signalfd_cleanup(sighand);
1524 /*
1525 * sighand_cachep is SLAB_TYPESAFE_BY_RCU so we can free it
1526 * without an RCU grace period, see __lock_task_sighand().
1527 */
1528 kmem_cache_free(sighand_cachep, sighand);
1529 }
1530}
1531
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001532/*
1533 * Initialize POSIX timer handling for a thread group.
1534 */
1535static void posix_cpu_timers_init_group(struct signal_struct *sig)
1536{
David Brazdil0f672f62019-12-10 10:32:29 +00001537 struct posix_cputimers *pct = &sig->posix_cputimers;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001538 unsigned long cpu_limit;
1539
1540 cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur);
David Brazdil0f672f62019-12-10 10:32:29 +00001541 posix_cputimers_group_init(pct, cpu_limit);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001542}
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001543
1544static int copy_signal(unsigned long clone_flags, struct task_struct *tsk)
1545{
1546 struct signal_struct *sig;
1547
1548 if (clone_flags & CLONE_THREAD)
1549 return 0;
1550
1551 sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL);
1552 tsk->signal = sig;
1553 if (!sig)
1554 return -ENOMEM;
1555
1556 sig->nr_threads = 1;
1557 atomic_set(&sig->live, 1);
David Brazdil0f672f62019-12-10 10:32:29 +00001558 refcount_set(&sig->sigcnt, 1);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001559
1560 /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */
1561 sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node);
1562 tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head);
1563
1564 init_waitqueue_head(&sig->wait_chldexit);
1565 sig->curr_target = tsk;
1566 init_sigpending(&sig->shared_pending);
1567 INIT_HLIST_HEAD(&sig->multiprocess);
1568 seqlock_init(&sig->stats_lock);
1569 prev_cputime_init(&sig->prev_cputime);
1570
1571#ifdef CONFIG_POSIX_TIMERS
1572 INIT_LIST_HEAD(&sig->posix_timers);
1573 hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1574 sig->real_timer.function = it_real_fn;
1575#endif
1576
1577 task_lock(current->group_leader);
1578 memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
1579 task_unlock(current->group_leader);
1580
1581 posix_cpu_timers_init_group(sig);
1582
1583 tty_audit_fork(sig);
1584 sched_autogroup_fork(sig);
1585
1586 sig->oom_score_adj = current->signal->oom_score_adj;
1587 sig->oom_score_adj_min = current->signal->oom_score_adj_min;
1588
1589 mutex_init(&sig->cred_guard_mutex);
Olivier Deprez0e641232021-09-23 10:07:05 +02001590 init_rwsem(&sig->exec_update_lock);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001591
1592 return 0;
1593}
1594
1595static void copy_seccomp(struct task_struct *p)
1596{
1597#ifdef CONFIG_SECCOMP
1598 /*
1599 * Must be called with sighand->lock held, which is common to
1600 * all threads in the group. Holding cred_guard_mutex is not
1601 * needed because this new task is not yet running and cannot
1602 * be racing exec.
1603 */
1604 assert_spin_locked(&current->sighand->siglock);
1605
1606 /* Ref-count the new filter user, and assign it. */
1607 get_seccomp_filter(current);
1608 p->seccomp = current->seccomp;
1609
1610 /*
1611 * Explicitly enable no_new_privs here in case it got set
1612 * between the task_struct being duplicated and holding the
1613 * sighand lock. The seccomp state and nnp must be in sync.
1614 */
1615 if (task_no_new_privs(current))
1616 task_set_no_new_privs(p);
1617
1618 /*
1619 * If the parent gained a seccomp mode after copying thread
1620 * flags and between before we held the sighand lock, we have
1621 * to manually enable the seccomp thread flag here.
1622 */
1623 if (p->seccomp.mode != SECCOMP_MODE_DISABLED)
1624 set_tsk_thread_flag(p, TIF_SECCOMP);
1625#endif
1626}
1627
1628SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr)
1629{
1630 current->clear_child_tid = tidptr;
1631
1632 return task_pid_vnr(current);
1633}
1634
1635static void rt_mutex_init_task(struct task_struct *p)
1636{
1637 raw_spin_lock_init(&p->pi_lock);
1638#ifdef CONFIG_RT_MUTEXES
1639 p->pi_waiters = RB_ROOT_CACHED;
1640 p->pi_top_task = NULL;
1641 p->pi_blocked_on = NULL;
1642#endif
1643}
1644
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001645static inline void init_task_pid_links(struct task_struct *task)
1646{
1647 enum pid_type type;
1648
1649 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
1650 INIT_HLIST_NODE(&task->pid_links[type]);
1651 }
1652}
1653
1654static inline void
1655init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid)
1656{
1657 if (type == PIDTYPE_PID)
1658 task->thread_pid = pid;
1659 else
1660 task->signal->pids[type] = pid;
1661}
1662
1663static inline void rcu_copy_process(struct task_struct *p)
1664{
1665#ifdef CONFIG_PREEMPT_RCU
1666 p->rcu_read_lock_nesting = 0;
1667 p->rcu_read_unlock_special.s = 0;
1668 p->rcu_blocked_node = NULL;
1669 INIT_LIST_HEAD(&p->rcu_node_entry);
1670#endif /* #ifdef CONFIG_PREEMPT_RCU */
1671#ifdef CONFIG_TASKS_RCU
1672 p->rcu_tasks_holdout = false;
1673 INIT_LIST_HEAD(&p->rcu_tasks_holdout_list);
1674 p->rcu_tasks_idle_cpu = -1;
1675#endif /* #ifdef CONFIG_TASKS_RCU */
1676}
1677
David Brazdil0f672f62019-12-10 10:32:29 +00001678struct pid *pidfd_pid(const struct file *file)
1679{
1680 if (file->f_op == &pidfd_fops)
1681 return file->private_data;
1682
1683 return ERR_PTR(-EBADF);
1684}
1685
1686static int pidfd_release(struct inode *inode, struct file *file)
1687{
1688 struct pid *pid = file->private_data;
1689
1690 file->private_data = NULL;
1691 put_pid(pid);
1692 return 0;
1693}
1694
1695#ifdef CONFIG_PROC_FS
1696static void pidfd_show_fdinfo(struct seq_file *m, struct file *f)
1697{
1698 struct pid_namespace *ns = proc_pid_ns(file_inode(m->file));
1699 struct pid *pid = f->private_data;
1700
1701 seq_put_decimal_ull(m, "Pid:\t", pid_nr_ns(pid, ns));
1702 seq_putc(m, '\n');
1703}
1704#endif
1705
1706/*
1707 * Poll support for process exit notification.
1708 */
1709static __poll_t pidfd_poll(struct file *file, struct poll_table_struct *pts)
1710{
1711 struct task_struct *task;
1712 struct pid *pid = file->private_data;
1713 __poll_t poll_flags = 0;
1714
1715 poll_wait(file, &pid->wait_pidfd, pts);
1716
1717 rcu_read_lock();
1718 task = pid_task(pid, PIDTYPE_PID);
1719 /*
1720 * Inform pollers only when the whole thread group exits.
1721 * If the thread group leader exits before all other threads in the
1722 * group, then poll(2) should block, similar to the wait(2) family.
1723 */
1724 if (!task || (task->exit_state && thread_group_empty(task)))
1725 poll_flags = EPOLLIN | EPOLLRDNORM;
1726 rcu_read_unlock();
1727
1728 return poll_flags;
1729}
1730
1731const struct file_operations pidfd_fops = {
1732 .release = pidfd_release,
1733 .poll = pidfd_poll,
1734#ifdef CONFIG_PROC_FS
1735 .show_fdinfo = pidfd_show_fdinfo,
1736#endif
1737};
1738
1739static void __delayed_free_task(struct rcu_head *rhp)
1740{
1741 struct task_struct *tsk = container_of(rhp, struct task_struct, rcu);
1742
1743 free_task(tsk);
1744}
1745
1746static __always_inline void delayed_free_task(struct task_struct *tsk)
1747{
1748 if (IS_ENABLED(CONFIG_MEMCG))
1749 call_rcu(&tsk->rcu, __delayed_free_task);
1750 else
1751 free_task(tsk);
1752}
1753
Olivier Deprez0e641232021-09-23 10:07:05 +02001754static void copy_oom_score_adj(u64 clone_flags, struct task_struct *tsk)
1755{
1756 /* Skip if kernel thread */
1757 if (!tsk->mm)
1758 return;
1759
1760 /* Skip if spawning a thread or using vfork */
1761 if ((clone_flags & (CLONE_VM | CLONE_THREAD | CLONE_VFORK)) != CLONE_VM)
1762 return;
1763
1764 /* We need to synchronize with __set_oom_adj */
1765 mutex_lock(&oom_adj_mutex);
1766 set_bit(MMF_MULTIPROCESS, &tsk->mm->flags);
1767 /* Update the values in case they were changed after copy_signal */
1768 tsk->signal->oom_score_adj = current->signal->oom_score_adj;
1769 tsk->signal->oom_score_adj_min = current->signal->oom_score_adj_min;
1770 mutex_unlock(&oom_adj_mutex);
1771}
1772
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001773/*
1774 * This creates a new process as a copy of the old one,
1775 * but does not actually start it yet.
1776 *
1777 * It copies the registers, and all the appropriate
1778 * parts of the process environment (as per the clone
1779 * flags). The actual kick-off is left to the caller.
1780 */
1781static __latent_entropy struct task_struct *copy_process(
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001782 struct pid *pid,
1783 int trace,
David Brazdil0f672f62019-12-10 10:32:29 +00001784 int node,
1785 struct kernel_clone_args *args)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001786{
David Brazdil0f672f62019-12-10 10:32:29 +00001787 int pidfd = -1, retval;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001788 struct task_struct *p;
1789 struct multiprocess_signals delayed;
David Brazdil0f672f62019-12-10 10:32:29 +00001790 struct file *pidfile = NULL;
1791 u64 clone_flags = args->flags;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001792
1793 /*
1794 * Don't allow sharing the root directory with processes in a different
1795 * namespace
1796 */
1797 if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
1798 return ERR_PTR(-EINVAL);
1799
1800 if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS))
1801 return ERR_PTR(-EINVAL);
1802
1803 /*
1804 * Thread groups must share signals as well, and detached threads
1805 * can only be started up within the thread group.
1806 */
1807 if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
1808 return ERR_PTR(-EINVAL);
1809
1810 /*
1811 * Shared signal handlers imply shared VM. By way of the above,
1812 * thread groups also imply shared VM. Blocking this case allows
1813 * for various simplifications in other code.
1814 */
1815 if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
1816 return ERR_PTR(-EINVAL);
1817
1818 /*
1819 * Siblings of global init remain as zombies on exit since they are
1820 * not reaped by their parent (swapper). To solve this and to avoid
1821 * multi-rooted process trees, prevent global and container-inits
1822 * from creating siblings.
1823 */
1824 if ((clone_flags & CLONE_PARENT) &&
1825 current->signal->flags & SIGNAL_UNKILLABLE)
1826 return ERR_PTR(-EINVAL);
1827
1828 /*
1829 * If the new process will be in a different pid or user namespace
1830 * do not allow it to share a thread group with the forking task.
1831 */
1832 if (clone_flags & CLONE_THREAD) {
1833 if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) ||
1834 (task_active_pid_ns(current) !=
1835 current->nsproxy->pid_ns_for_children))
1836 return ERR_PTR(-EINVAL);
1837 }
1838
David Brazdil0f672f62019-12-10 10:32:29 +00001839 if (clone_flags & CLONE_PIDFD) {
1840 /*
1841 * - CLONE_DETACHED is blocked so that we can potentially
1842 * reuse it later for CLONE_PIDFD.
1843 * - CLONE_THREAD is blocked until someone really needs it.
1844 */
1845 if (clone_flags & (CLONE_DETACHED | CLONE_THREAD))
1846 return ERR_PTR(-EINVAL);
1847 }
1848
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001849 /*
1850 * Force any signals received before this point to be delivered
1851 * before the fork happens. Collect up signals sent to multiple
1852 * processes that happen during the fork and delay them so that
1853 * they appear to happen after the fork.
1854 */
1855 sigemptyset(&delayed.signal);
1856 INIT_HLIST_NODE(&delayed.node);
1857
1858 spin_lock_irq(&current->sighand->siglock);
1859 if (!(clone_flags & CLONE_THREAD))
1860 hlist_add_head(&delayed.node, &current->signal->multiprocess);
1861 recalc_sigpending();
1862 spin_unlock_irq(&current->sighand->siglock);
1863 retval = -ERESTARTNOINTR;
1864 if (signal_pending(current))
1865 goto fork_out;
1866
1867 retval = -ENOMEM;
1868 p = dup_task_struct(current, node);
1869 if (!p)
1870 goto fork_out;
1871
1872 /*
1873 * This _must_ happen before we call free_task(), i.e. before we jump
1874 * to any of the bad_fork_* labels. This is to avoid freeing
1875 * p->set_child_tid which is (ab)used as a kthread's data pointer for
1876 * kernel threads (PF_KTHREAD).
1877 */
David Brazdil0f672f62019-12-10 10:32:29 +00001878 p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? args->child_tid : NULL;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001879 /*
1880 * Clear TID on mm_release()?
1881 */
David Brazdil0f672f62019-12-10 10:32:29 +00001882 p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? args->child_tid : NULL;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001883
1884 ftrace_graph_init_task(p);
1885
1886 rt_mutex_init_task(p);
1887
1888#ifdef CONFIG_PROVE_LOCKING
1889 DEBUG_LOCKS_WARN_ON(!p->hardirqs_enabled);
1890 DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
1891#endif
1892 retval = -EAGAIN;
1893 if (atomic_read(&p->real_cred->user->processes) >=
1894 task_rlimit(p, RLIMIT_NPROC)) {
1895 if (p->real_cred->user != INIT_USER &&
1896 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN))
1897 goto bad_fork_free;
1898 }
1899 current->flags &= ~PF_NPROC_EXCEEDED;
1900
1901 retval = copy_creds(p, clone_flags);
1902 if (retval < 0)
1903 goto bad_fork_free;
1904
1905 /*
1906 * If multiple threads are within copy_process(), then this check
1907 * triggers too late. This doesn't hurt, the check is only there
1908 * to stop root fork bombs.
1909 */
1910 retval = -EAGAIN;
1911 if (nr_threads >= max_threads)
1912 goto bad_fork_cleanup_count;
1913
1914 delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
1915 p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER | PF_IDLE);
1916 p->flags |= PF_FORKNOEXEC;
1917 INIT_LIST_HEAD(&p->children);
1918 INIT_LIST_HEAD(&p->sibling);
1919 rcu_copy_process(p);
1920 p->vfork_done = NULL;
1921 spin_lock_init(&p->alloc_lock);
1922
1923 init_sigpending(&p->pending);
1924
1925 p->utime = p->stime = p->gtime = 0;
1926#ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME
1927 p->utimescaled = p->stimescaled = 0;
1928#endif
1929 prev_cputime_init(&p->prev_cputime);
1930
1931#ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN
1932 seqcount_init(&p->vtime.seqcount);
1933 p->vtime.starttime = 0;
1934 p->vtime.state = VTIME_INACTIVE;
1935#endif
1936
1937#if defined(SPLIT_RSS_COUNTING)
1938 memset(&p->rss_stat, 0, sizeof(p->rss_stat));
1939#endif
1940
1941 p->default_timer_slack_ns = current->timer_slack_ns;
1942
David Brazdil0f672f62019-12-10 10:32:29 +00001943#ifdef CONFIG_PSI
1944 p->psi_flags = 0;
1945#endif
1946
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001947 task_io_accounting_init(&p->ioac);
1948 acct_clear_integrals(p);
1949
David Brazdil0f672f62019-12-10 10:32:29 +00001950 posix_cputimers_init(&p->posix_cputimers);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001951
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001952 p->io_context = NULL;
1953 audit_set_context(p, NULL);
1954 cgroup_fork(p);
1955#ifdef CONFIG_NUMA
1956 p->mempolicy = mpol_dup(p->mempolicy);
1957 if (IS_ERR(p->mempolicy)) {
1958 retval = PTR_ERR(p->mempolicy);
1959 p->mempolicy = NULL;
1960 goto bad_fork_cleanup_threadgroup_lock;
1961 }
1962#endif
1963#ifdef CONFIG_CPUSETS
1964 p->cpuset_mem_spread_rotor = NUMA_NO_NODE;
1965 p->cpuset_slab_spread_rotor = NUMA_NO_NODE;
1966 seqcount_init(&p->mems_allowed_seq);
1967#endif
1968#ifdef CONFIG_TRACE_IRQFLAGS
1969 p->irq_events = 0;
1970 p->hardirqs_enabled = 0;
1971 p->hardirq_enable_ip = 0;
1972 p->hardirq_enable_event = 0;
1973 p->hardirq_disable_ip = _THIS_IP_;
1974 p->hardirq_disable_event = 0;
1975 p->softirqs_enabled = 1;
1976 p->softirq_enable_ip = _THIS_IP_;
1977 p->softirq_enable_event = 0;
1978 p->softirq_disable_ip = 0;
1979 p->softirq_disable_event = 0;
1980 p->hardirq_context = 0;
1981 p->softirq_context = 0;
1982#endif
1983
1984 p->pagefault_disabled = 0;
1985
1986#ifdef CONFIG_LOCKDEP
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001987 lockdep_init_task(p);
1988#endif
1989
1990#ifdef CONFIG_DEBUG_MUTEXES
1991 p->blocked_on = NULL; /* not blocked yet */
1992#endif
1993#ifdef CONFIG_BCACHE
1994 p->sequential_io = 0;
1995 p->sequential_io_avg = 0;
1996#endif
1997
1998 /* Perform scheduler related setup. Assign this task to a CPU. */
1999 retval = sched_fork(clone_flags, p);
2000 if (retval)
2001 goto bad_fork_cleanup_policy;
2002
2003 retval = perf_event_init_task(p);
2004 if (retval)
2005 goto bad_fork_cleanup_policy;
2006 retval = audit_alloc(p);
2007 if (retval)
2008 goto bad_fork_cleanup_perf;
2009 /* copy all the process information */
2010 shm_init_task(p);
2011 retval = security_task_alloc(p, clone_flags);
2012 if (retval)
2013 goto bad_fork_cleanup_audit;
2014 retval = copy_semundo(clone_flags, p);
2015 if (retval)
2016 goto bad_fork_cleanup_security;
2017 retval = copy_files(clone_flags, p);
2018 if (retval)
2019 goto bad_fork_cleanup_semundo;
2020 retval = copy_fs(clone_flags, p);
2021 if (retval)
2022 goto bad_fork_cleanup_files;
2023 retval = copy_sighand(clone_flags, p);
2024 if (retval)
2025 goto bad_fork_cleanup_fs;
2026 retval = copy_signal(clone_flags, p);
2027 if (retval)
2028 goto bad_fork_cleanup_sighand;
2029 retval = copy_mm(clone_flags, p);
2030 if (retval)
2031 goto bad_fork_cleanup_signal;
2032 retval = copy_namespaces(clone_flags, p);
2033 if (retval)
2034 goto bad_fork_cleanup_mm;
2035 retval = copy_io(clone_flags, p);
2036 if (retval)
2037 goto bad_fork_cleanup_namespaces;
David Brazdil0f672f62019-12-10 10:32:29 +00002038 retval = copy_thread_tls(clone_flags, args->stack, args->stack_size, p,
2039 args->tls);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002040 if (retval)
2041 goto bad_fork_cleanup_io;
2042
David Brazdil0f672f62019-12-10 10:32:29 +00002043 stackleak_task_init(p);
2044
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002045 if (pid != &init_struct_pid) {
2046 pid = alloc_pid(p->nsproxy->pid_ns_for_children);
2047 if (IS_ERR(pid)) {
2048 retval = PTR_ERR(pid);
2049 goto bad_fork_cleanup_thread;
2050 }
2051 }
2052
David Brazdil0f672f62019-12-10 10:32:29 +00002053 /*
2054 * This has to happen after we've potentially unshared the file
2055 * descriptor table (so that the pidfd doesn't leak into the child
2056 * if the fd table isn't shared).
2057 */
2058 if (clone_flags & CLONE_PIDFD) {
2059 retval = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
2060 if (retval < 0)
2061 goto bad_fork_free_pid;
2062
2063 pidfd = retval;
2064
2065 pidfile = anon_inode_getfile("[pidfd]", &pidfd_fops, pid,
2066 O_RDWR | O_CLOEXEC);
2067 if (IS_ERR(pidfile)) {
2068 put_unused_fd(pidfd);
2069 retval = PTR_ERR(pidfile);
2070 goto bad_fork_free_pid;
2071 }
2072 get_pid(pid); /* held by pidfile now */
2073
2074 retval = put_user(pidfd, args->pidfd);
2075 if (retval)
2076 goto bad_fork_put_pidfd;
2077 }
2078
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002079#ifdef CONFIG_BLOCK
2080 p->plug = NULL;
2081#endif
David Brazdil0f672f62019-12-10 10:32:29 +00002082 futex_init_task(p);
2083
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002084 /*
2085 * sigaltstack should be cleared when sharing the same VM
2086 */
2087 if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
2088 sas_ss_reset(p);
2089
2090 /*
2091 * Syscall tracing and stepping should be turned off in the
2092 * child regardless of CLONE_PTRACE.
2093 */
2094 user_disable_single_step(p);
2095 clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE);
2096#ifdef TIF_SYSCALL_EMU
2097 clear_tsk_thread_flag(p, TIF_SYSCALL_EMU);
2098#endif
David Brazdil0f672f62019-12-10 10:32:29 +00002099 clear_tsk_latency_tracing(p);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002100
2101 /* ok, now we should be set up.. */
2102 p->pid = pid_nr(pid);
2103 if (clone_flags & CLONE_THREAD) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002104 p->group_leader = current->group_leader;
2105 p->tgid = current->tgid;
2106 } else {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002107 p->group_leader = p;
2108 p->tgid = p->pid;
2109 }
2110
2111 p->nr_dirtied = 0;
2112 p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10);
2113 p->dirty_paused_when = 0;
2114
2115 p->pdeath_signal = 0;
2116 INIT_LIST_HEAD(&p->thread_group);
2117 p->task_works = NULL;
2118
2119 cgroup_threadgroup_change_begin(current);
2120 /*
2121 * Ensure that the cgroup subsystem policies allow the new process to be
2122 * forked. It should be noted the the new process's css_set can be changed
2123 * between here and cgroup_post_fork() if an organisation operation is in
2124 * progress.
2125 */
2126 retval = cgroup_can_fork(p);
2127 if (retval)
David Brazdil0f672f62019-12-10 10:32:29 +00002128 goto bad_fork_cgroup_threadgroup_change_end;
2129
2130 /*
2131 * From this point on we must avoid any synchronous user-space
2132 * communication until we take the tasklist-lock. In particular, we do
2133 * not want user-space to be able to predict the process start-time by
2134 * stalling fork(2) after we recorded the start_time but before it is
2135 * visible to the system.
2136 */
2137
2138 p->start_time = ktime_get_ns();
2139 p->real_start_time = ktime_get_boottime_ns();
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002140
2141 /*
2142 * Make it visible to the rest of the system, but dont wake it up yet.
2143 * Need tasklist lock for parent etc handling!
2144 */
2145 write_lock_irq(&tasklist_lock);
2146
2147 /* CLONE_PARENT re-uses the old parent */
2148 if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) {
2149 p->real_parent = current->real_parent;
2150 p->parent_exec_id = current->parent_exec_id;
Olivier Deprez0e641232021-09-23 10:07:05 +02002151 if (clone_flags & CLONE_THREAD)
2152 p->exit_signal = -1;
2153 else
2154 p->exit_signal = current->group_leader->exit_signal;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002155 } else {
2156 p->real_parent = current;
2157 p->parent_exec_id = current->self_exec_id;
Olivier Deprez0e641232021-09-23 10:07:05 +02002158 p->exit_signal = args->exit_signal;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002159 }
2160
2161 klp_copy_process(p);
2162
2163 spin_lock(&current->sighand->siglock);
2164
2165 /*
2166 * Copy seccomp details explicitly here, in case they were changed
2167 * before holding sighand lock.
2168 */
2169 copy_seccomp(p);
2170
2171 rseq_fork(p, clone_flags);
2172
2173 /* Don't start children in a dying pid namespace */
2174 if (unlikely(!(ns_of_pid(pid)->pid_allocated & PIDNS_ADDING))) {
2175 retval = -ENOMEM;
2176 goto bad_fork_cancel_cgroup;
2177 }
2178
2179 /* Let kill terminate clone/fork in the middle */
2180 if (fatal_signal_pending(current)) {
2181 retval = -EINTR;
2182 goto bad_fork_cancel_cgroup;
2183 }
2184
David Brazdil0f672f62019-12-10 10:32:29 +00002185 /* past the last point of failure */
2186 if (pidfile)
2187 fd_install(pidfd, pidfile);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002188
2189 init_task_pid_links(p);
2190 if (likely(p->pid)) {
2191 ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace);
2192
2193 init_task_pid(p, PIDTYPE_PID, pid);
2194 if (thread_group_leader(p)) {
2195 init_task_pid(p, PIDTYPE_TGID, pid);
2196 init_task_pid(p, PIDTYPE_PGID, task_pgrp(current));
2197 init_task_pid(p, PIDTYPE_SID, task_session(current));
2198
2199 if (is_child_reaper(pid)) {
2200 ns_of_pid(pid)->child_reaper = p;
2201 p->signal->flags |= SIGNAL_UNKILLABLE;
2202 }
2203 p->signal->shared_pending.signal = delayed.signal;
2204 p->signal->tty = tty_kref_get(current->signal->tty);
2205 /*
2206 * Inherit has_child_subreaper flag under the same
2207 * tasklist_lock with adding child to the process tree
2208 * for propagate_has_child_subreaper optimization.
2209 */
2210 p->signal->has_child_subreaper = p->real_parent->signal->has_child_subreaper ||
2211 p->real_parent->signal->is_child_subreaper;
2212 list_add_tail(&p->sibling, &p->real_parent->children);
2213 list_add_tail_rcu(&p->tasks, &init_task.tasks);
2214 attach_pid(p, PIDTYPE_TGID);
2215 attach_pid(p, PIDTYPE_PGID);
2216 attach_pid(p, PIDTYPE_SID);
2217 __this_cpu_inc(process_counts);
2218 } else {
2219 current->signal->nr_threads++;
2220 atomic_inc(&current->signal->live);
David Brazdil0f672f62019-12-10 10:32:29 +00002221 refcount_inc(&current->signal->sigcnt);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002222 task_join_group_stop(p);
2223 list_add_tail_rcu(&p->thread_group,
2224 &p->group_leader->thread_group);
2225 list_add_tail_rcu(&p->thread_node,
2226 &p->signal->thread_head);
2227 }
2228 attach_pid(p, PIDTYPE_PID);
2229 nr_threads++;
2230 }
2231 total_forks++;
2232 hlist_del_init(&delayed.node);
2233 spin_unlock(&current->sighand->siglock);
2234 syscall_tracepoint_update(p);
2235 write_unlock_irq(&tasklist_lock);
2236
2237 proc_fork_connector(p);
2238 cgroup_post_fork(p);
2239 cgroup_threadgroup_change_end(current);
2240 perf_event_fork(p);
2241
2242 trace_task_newtask(p, clone_flags);
2243 uprobe_copy_process(p, clone_flags);
2244
Olivier Deprez0e641232021-09-23 10:07:05 +02002245 copy_oom_score_adj(clone_flags, p);
2246
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002247 return p;
2248
2249bad_fork_cancel_cgroup:
2250 spin_unlock(&current->sighand->siglock);
2251 write_unlock_irq(&tasklist_lock);
2252 cgroup_cancel_fork(p);
David Brazdil0f672f62019-12-10 10:32:29 +00002253bad_fork_cgroup_threadgroup_change_end:
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002254 cgroup_threadgroup_change_end(current);
David Brazdil0f672f62019-12-10 10:32:29 +00002255bad_fork_put_pidfd:
2256 if (clone_flags & CLONE_PIDFD) {
2257 fput(pidfile);
2258 put_unused_fd(pidfd);
2259 }
2260bad_fork_free_pid:
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002261 if (pid != &init_struct_pid)
2262 free_pid(pid);
2263bad_fork_cleanup_thread:
2264 exit_thread(p);
2265bad_fork_cleanup_io:
2266 if (p->io_context)
2267 exit_io_context(p);
2268bad_fork_cleanup_namespaces:
2269 exit_task_namespaces(p);
2270bad_fork_cleanup_mm:
David Brazdil0f672f62019-12-10 10:32:29 +00002271 if (p->mm) {
2272 mm_clear_owner(p->mm, p);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002273 mmput(p->mm);
David Brazdil0f672f62019-12-10 10:32:29 +00002274 }
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002275bad_fork_cleanup_signal:
2276 if (!(clone_flags & CLONE_THREAD))
2277 free_signal_struct(p->signal);
2278bad_fork_cleanup_sighand:
2279 __cleanup_sighand(p->sighand);
2280bad_fork_cleanup_fs:
2281 exit_fs(p); /* blocking */
2282bad_fork_cleanup_files:
2283 exit_files(p); /* blocking */
2284bad_fork_cleanup_semundo:
2285 exit_sem(p);
2286bad_fork_cleanup_security:
2287 security_task_free(p);
2288bad_fork_cleanup_audit:
2289 audit_free(p);
2290bad_fork_cleanup_perf:
2291 perf_event_free_task(p);
2292bad_fork_cleanup_policy:
2293 lockdep_free_task(p);
2294#ifdef CONFIG_NUMA
2295 mpol_put(p->mempolicy);
2296bad_fork_cleanup_threadgroup_lock:
2297#endif
2298 delayacct_tsk_free(p);
2299bad_fork_cleanup_count:
2300 atomic_dec(&p->cred->user->processes);
2301 exit_creds(p);
2302bad_fork_free:
2303 p->state = TASK_DEAD;
2304 put_task_stack(p);
David Brazdil0f672f62019-12-10 10:32:29 +00002305 delayed_free_task(p);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002306fork_out:
2307 spin_lock_irq(&current->sighand->siglock);
2308 hlist_del_init(&delayed.node);
2309 spin_unlock_irq(&current->sighand->siglock);
2310 return ERR_PTR(retval);
2311}
2312
2313static inline void init_idle_pids(struct task_struct *idle)
2314{
2315 enum pid_type type;
2316
2317 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
2318 INIT_HLIST_NODE(&idle->pid_links[type]); /* not really needed */
2319 init_task_pid(idle, type, &init_struct_pid);
2320 }
2321}
2322
2323struct task_struct *fork_idle(int cpu)
2324{
2325 struct task_struct *task;
David Brazdil0f672f62019-12-10 10:32:29 +00002326 struct kernel_clone_args args = {
2327 .flags = CLONE_VM,
2328 };
2329
2330 task = copy_process(&init_struct_pid, 0, cpu_to_node(cpu), &args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002331 if (!IS_ERR(task)) {
2332 init_idle_pids(task);
2333 init_idle(task, cpu);
2334 }
2335
2336 return task;
2337}
2338
David Brazdil0f672f62019-12-10 10:32:29 +00002339struct mm_struct *copy_init_mm(void)
2340{
2341 return dup_mm(NULL, &init_mm);
2342}
2343
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002344/*
2345 * Ok, this is the main fork-routine.
2346 *
2347 * It copies the process, and if successful kick-starts
2348 * it and waits for it to finish using the VM if required.
David Brazdil0f672f62019-12-10 10:32:29 +00002349 *
2350 * args->exit_signal is expected to be checked for sanity by the caller.
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002351 */
David Brazdil0f672f62019-12-10 10:32:29 +00002352long _do_fork(struct kernel_clone_args *args)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002353{
David Brazdil0f672f62019-12-10 10:32:29 +00002354 u64 clone_flags = args->flags;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002355 struct completion vfork;
2356 struct pid *pid;
2357 struct task_struct *p;
2358 int trace = 0;
2359 long nr;
2360
2361 /*
2362 * Determine whether and which event to report to ptracer. When
2363 * called from kernel_thread or CLONE_UNTRACED is explicitly
2364 * requested, no event is reported; otherwise, report if the event
2365 * for the type of forking is enabled.
2366 */
2367 if (!(clone_flags & CLONE_UNTRACED)) {
2368 if (clone_flags & CLONE_VFORK)
2369 trace = PTRACE_EVENT_VFORK;
David Brazdil0f672f62019-12-10 10:32:29 +00002370 else if (args->exit_signal != SIGCHLD)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002371 trace = PTRACE_EVENT_CLONE;
2372 else
2373 trace = PTRACE_EVENT_FORK;
2374
2375 if (likely(!ptrace_event_enabled(current, trace)))
2376 trace = 0;
2377 }
2378
David Brazdil0f672f62019-12-10 10:32:29 +00002379 p = copy_process(NULL, trace, NUMA_NO_NODE, args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002380 add_latent_entropy();
2381
2382 if (IS_ERR(p))
2383 return PTR_ERR(p);
2384
2385 /*
2386 * Do this prior waking up the new thread - the thread pointer
2387 * might get invalid after that point, if the thread exits quickly.
2388 */
2389 trace_sched_process_fork(current, p);
2390
2391 pid = get_task_pid(p, PIDTYPE_PID);
2392 nr = pid_vnr(pid);
2393
2394 if (clone_flags & CLONE_PARENT_SETTID)
David Brazdil0f672f62019-12-10 10:32:29 +00002395 put_user(nr, args->parent_tid);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002396
2397 if (clone_flags & CLONE_VFORK) {
2398 p->vfork_done = &vfork;
2399 init_completion(&vfork);
2400 get_task_struct(p);
2401 }
2402
2403 wake_up_new_task(p);
2404
2405 /* forking complete and child started to run, tell ptracer */
2406 if (unlikely(trace))
2407 ptrace_event_pid(trace, pid);
2408
2409 if (clone_flags & CLONE_VFORK) {
2410 if (!wait_for_vfork_done(p, &vfork))
2411 ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid);
2412 }
2413
2414 put_pid(pid);
2415 return nr;
2416}
2417
David Brazdil0f672f62019-12-10 10:32:29 +00002418bool legacy_clone_args_valid(const struct kernel_clone_args *kargs)
2419{
2420 /* clone(CLONE_PIDFD) uses parent_tidptr to return a pidfd */
2421 if ((kargs->flags & CLONE_PIDFD) &&
2422 (kargs->flags & CLONE_PARENT_SETTID))
2423 return false;
2424
2425 return true;
2426}
2427
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002428#ifndef CONFIG_HAVE_COPY_THREAD_TLS
2429/* For compatibility with architectures that call do_fork directly rather than
2430 * using the syscall entry points below. */
2431long do_fork(unsigned long clone_flags,
2432 unsigned long stack_start,
2433 unsigned long stack_size,
2434 int __user *parent_tidptr,
2435 int __user *child_tidptr)
2436{
David Brazdil0f672f62019-12-10 10:32:29 +00002437 struct kernel_clone_args args = {
Olivier Deprez0e641232021-09-23 10:07:05 +02002438 .flags = (lower_32_bits(clone_flags) & ~CSIGNAL),
David Brazdil0f672f62019-12-10 10:32:29 +00002439 .pidfd = parent_tidptr,
2440 .child_tid = child_tidptr,
2441 .parent_tid = parent_tidptr,
Olivier Deprez0e641232021-09-23 10:07:05 +02002442 .exit_signal = (lower_32_bits(clone_flags) & CSIGNAL),
David Brazdil0f672f62019-12-10 10:32:29 +00002443 .stack = stack_start,
2444 .stack_size = stack_size,
2445 };
2446
2447 if (!legacy_clone_args_valid(&args))
2448 return -EINVAL;
2449
2450 return _do_fork(&args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002451}
2452#endif
2453
2454/*
2455 * Create a kernel thread.
2456 */
2457pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
2458{
David Brazdil0f672f62019-12-10 10:32:29 +00002459 struct kernel_clone_args args = {
Olivier Deprez0e641232021-09-23 10:07:05 +02002460 .flags = ((lower_32_bits(flags) | CLONE_VM |
2461 CLONE_UNTRACED) & ~CSIGNAL),
2462 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
David Brazdil0f672f62019-12-10 10:32:29 +00002463 .stack = (unsigned long)fn,
2464 .stack_size = (unsigned long)arg,
2465 };
2466
2467 return _do_fork(&args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002468}
2469
2470#ifdef __ARCH_WANT_SYS_FORK
2471SYSCALL_DEFINE0(fork)
2472{
2473#ifdef CONFIG_MMU
David Brazdil0f672f62019-12-10 10:32:29 +00002474 struct kernel_clone_args args = {
2475 .exit_signal = SIGCHLD,
2476 };
2477
2478 return _do_fork(&args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002479#else
2480 /* can not support in nommu mode */
2481 return -EINVAL;
2482#endif
2483}
2484#endif
2485
2486#ifdef __ARCH_WANT_SYS_VFORK
2487SYSCALL_DEFINE0(vfork)
2488{
David Brazdil0f672f62019-12-10 10:32:29 +00002489 struct kernel_clone_args args = {
2490 .flags = CLONE_VFORK | CLONE_VM,
2491 .exit_signal = SIGCHLD,
2492 };
2493
2494 return _do_fork(&args);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002495}
2496#endif
2497
2498#ifdef __ARCH_WANT_SYS_CLONE
2499#ifdef CONFIG_CLONE_BACKWARDS
2500SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2501 int __user *, parent_tidptr,
2502 unsigned long, tls,
2503 int __user *, child_tidptr)
2504#elif defined(CONFIG_CLONE_BACKWARDS2)
2505SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags,
2506 int __user *, parent_tidptr,
2507 int __user *, child_tidptr,
2508 unsigned long, tls)
2509#elif defined(CONFIG_CLONE_BACKWARDS3)
2510SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp,
2511 int, stack_size,
2512 int __user *, parent_tidptr,
2513 int __user *, child_tidptr,
2514 unsigned long, tls)
2515#else
2516SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2517 int __user *, parent_tidptr,
2518 int __user *, child_tidptr,
2519 unsigned long, tls)
2520#endif
2521{
David Brazdil0f672f62019-12-10 10:32:29 +00002522 struct kernel_clone_args args = {
Olivier Deprez0e641232021-09-23 10:07:05 +02002523 .flags = (lower_32_bits(clone_flags) & ~CSIGNAL),
David Brazdil0f672f62019-12-10 10:32:29 +00002524 .pidfd = parent_tidptr,
2525 .child_tid = child_tidptr,
2526 .parent_tid = parent_tidptr,
Olivier Deprez0e641232021-09-23 10:07:05 +02002527 .exit_signal = (lower_32_bits(clone_flags) & CSIGNAL),
David Brazdil0f672f62019-12-10 10:32:29 +00002528 .stack = newsp,
2529 .tls = tls,
2530 };
2531
2532 if (!legacy_clone_args_valid(&args))
2533 return -EINVAL;
2534
2535 return _do_fork(&args);
2536}
2537#endif
2538
2539#ifdef __ARCH_WANT_SYS_CLONE3
Olivier Deprez0e641232021-09-23 10:07:05 +02002540
2541/*
2542 * copy_thread implementations handle CLONE_SETTLS by reading the TLS value from
2543 * the registers containing the syscall arguments for clone. This doesn't work
2544 * with clone3 since the TLS value is passed in clone_args instead.
2545 */
2546#ifndef CONFIG_HAVE_COPY_THREAD_TLS
2547#error clone3 requires copy_thread_tls support in arch
2548#endif
2549
David Brazdil0f672f62019-12-10 10:32:29 +00002550noinline static int copy_clone_args_from_user(struct kernel_clone_args *kargs,
2551 struct clone_args __user *uargs,
2552 size_t usize)
2553{
2554 int err;
2555 struct clone_args args;
2556
2557 if (unlikely(usize > PAGE_SIZE))
2558 return -E2BIG;
2559 if (unlikely(usize < CLONE_ARGS_SIZE_VER0))
2560 return -EINVAL;
2561
2562 err = copy_struct_from_user(&args, sizeof(args), uargs, usize);
2563 if (err)
2564 return err;
2565
2566 /*
2567 * Verify that higher 32bits of exit_signal are unset and that
2568 * it is a valid signal
2569 */
2570 if (unlikely((args.exit_signal & ~((u64)CSIGNAL)) ||
2571 !valid_signal(args.exit_signal)))
2572 return -EINVAL;
2573
2574 *kargs = (struct kernel_clone_args){
2575 .flags = args.flags,
2576 .pidfd = u64_to_user_ptr(args.pidfd),
2577 .child_tid = u64_to_user_ptr(args.child_tid),
2578 .parent_tid = u64_to_user_ptr(args.parent_tid),
2579 .exit_signal = args.exit_signal,
2580 .stack = args.stack,
2581 .stack_size = args.stack_size,
2582 .tls = args.tls,
2583 };
2584
2585 return 0;
2586}
2587
2588/**
2589 * clone3_stack_valid - check and prepare stack
2590 * @kargs: kernel clone args
2591 *
2592 * Verify that the stack arguments userspace gave us are sane.
2593 * In addition, set the stack direction for userspace since it's easy for us to
2594 * determine.
2595 */
2596static inline bool clone3_stack_valid(struct kernel_clone_args *kargs)
2597{
2598 if (kargs->stack == 0) {
2599 if (kargs->stack_size > 0)
2600 return false;
2601 } else {
2602 if (kargs->stack_size == 0)
2603 return false;
2604
2605 if (!access_ok((void __user *)kargs->stack, kargs->stack_size))
2606 return false;
2607
2608#if !defined(CONFIG_STACK_GROWSUP) && !defined(CONFIG_IA64)
2609 kargs->stack += kargs->stack_size;
2610#endif
2611 }
2612
2613 return true;
2614}
2615
2616static bool clone3_args_valid(struct kernel_clone_args *kargs)
2617{
2618 /*
2619 * All lower bits of the flag word are taken.
2620 * Verify that no other unknown flags are passed along.
2621 */
2622 if (kargs->flags & ~CLONE_LEGACY_FLAGS)
2623 return false;
2624
2625 /*
2626 * - make the CLONE_DETACHED bit reuseable for clone3
2627 * - make the CSIGNAL bits reuseable for clone3
2628 */
2629 if (kargs->flags & (CLONE_DETACHED | CSIGNAL))
2630 return false;
2631
2632 if ((kargs->flags & (CLONE_THREAD | CLONE_PARENT)) &&
2633 kargs->exit_signal)
2634 return false;
2635
2636 if (!clone3_stack_valid(kargs))
2637 return false;
2638
2639 return true;
2640}
2641
2642/**
2643 * clone3 - create a new process with specific properties
2644 * @uargs: argument structure
2645 * @size: size of @uargs
2646 *
2647 * clone3() is the extensible successor to clone()/clone2().
2648 * It takes a struct as argument that is versioned by its size.
2649 *
2650 * Return: On success, a positive PID for the child process.
2651 * On error, a negative errno number.
2652 */
2653SYSCALL_DEFINE2(clone3, struct clone_args __user *, uargs, size_t, size)
2654{
2655 int err;
2656
2657 struct kernel_clone_args kargs;
2658
2659 err = copy_clone_args_from_user(&kargs, uargs, size);
2660 if (err)
2661 return err;
2662
2663 if (!clone3_args_valid(&kargs))
2664 return -EINVAL;
2665
2666 return _do_fork(&kargs);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002667}
2668#endif
2669
2670void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data)
2671{
2672 struct task_struct *leader, *parent, *child;
2673 int res;
2674
2675 read_lock(&tasklist_lock);
2676 leader = top = top->group_leader;
2677down:
2678 for_each_thread(leader, parent) {
2679 list_for_each_entry(child, &parent->children, sibling) {
2680 res = visitor(child, data);
2681 if (res) {
2682 if (res < 0)
2683 goto out;
2684 leader = child;
2685 goto down;
2686 }
2687up:
2688 ;
2689 }
2690 }
2691
2692 if (leader != top) {
2693 child = leader;
2694 parent = child->real_parent;
2695 leader = parent->group_leader;
2696 goto up;
2697 }
2698out:
2699 read_unlock(&tasklist_lock);
2700}
2701
2702#ifndef ARCH_MIN_MMSTRUCT_ALIGN
2703#define ARCH_MIN_MMSTRUCT_ALIGN 0
2704#endif
2705
2706static void sighand_ctor(void *data)
2707{
2708 struct sighand_struct *sighand = data;
2709
2710 spin_lock_init(&sighand->siglock);
2711 init_waitqueue_head(&sighand->signalfd_wqh);
2712}
2713
2714void __init proc_caches_init(void)
2715{
2716 unsigned int mm_size;
2717
2718 sighand_cachep = kmem_cache_create("sighand_cache",
2719 sizeof(struct sighand_struct), 0,
2720 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_TYPESAFE_BY_RCU|
2721 SLAB_ACCOUNT, sighand_ctor);
2722 signal_cachep = kmem_cache_create("signal_cache",
2723 sizeof(struct signal_struct), 0,
2724 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2725 NULL);
2726 files_cachep = kmem_cache_create("files_cache",
2727 sizeof(struct files_struct), 0,
2728 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2729 NULL);
2730 fs_cachep = kmem_cache_create("fs_cache",
2731 sizeof(struct fs_struct), 0,
2732 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2733 NULL);
2734
2735 /*
2736 * The mm_cpumask is located at the end of mm_struct, and is
2737 * dynamically sized based on the maximum CPU number this system
2738 * can have, taking hotplug into account (nr_cpu_ids).
2739 */
2740 mm_size = sizeof(struct mm_struct) + cpumask_size();
2741
2742 mm_cachep = kmem_cache_create_usercopy("mm_struct",
2743 mm_size, ARCH_MIN_MMSTRUCT_ALIGN,
2744 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2745 offsetof(struct mm_struct, saved_auxv),
2746 sizeof_field(struct mm_struct, saved_auxv),
2747 NULL);
2748 vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT);
2749 mmap_init();
2750 nsproxy_cache_init();
2751}
2752
2753/*
2754 * Check constraints on flags passed to the unshare system call.
2755 */
2756static int check_unshare_flags(unsigned long unshare_flags)
2757{
2758 if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
2759 CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
2760 CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET|
2761 CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP))
2762 return -EINVAL;
2763 /*
2764 * Not implemented, but pretend it works if there is nothing
2765 * to unshare. Note that unsharing the address space or the
2766 * signal handlers also need to unshare the signal queues (aka
2767 * CLONE_THREAD).
2768 */
2769 if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) {
2770 if (!thread_group_empty(current))
2771 return -EINVAL;
2772 }
2773 if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) {
David Brazdil0f672f62019-12-10 10:32:29 +00002774 if (refcount_read(&current->sighand->count) > 1)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002775 return -EINVAL;
2776 }
2777 if (unshare_flags & CLONE_VM) {
2778 if (!current_is_single_threaded())
2779 return -EINVAL;
2780 }
2781
2782 return 0;
2783}
2784
2785/*
2786 * Unshare the filesystem structure if it is being shared
2787 */
2788static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
2789{
2790 struct fs_struct *fs = current->fs;
2791
2792 if (!(unshare_flags & CLONE_FS) || !fs)
2793 return 0;
2794
2795 /* don't need lock here; in the worst case we'll do useless copy */
2796 if (fs->users == 1)
2797 return 0;
2798
2799 *new_fsp = copy_fs_struct(fs);
2800 if (!*new_fsp)
2801 return -ENOMEM;
2802
2803 return 0;
2804}
2805
2806/*
2807 * Unshare file descriptor table if it is being shared
2808 */
2809static int unshare_fd(unsigned long unshare_flags, struct files_struct **new_fdp)
2810{
2811 struct files_struct *fd = current->files;
2812 int error = 0;
2813
2814 if ((unshare_flags & CLONE_FILES) &&
2815 (fd && atomic_read(&fd->count) > 1)) {
2816 *new_fdp = dup_fd(fd, &error);
2817 if (!*new_fdp)
2818 return error;
2819 }
2820
2821 return 0;
2822}
2823
2824/*
2825 * unshare allows a process to 'unshare' part of the process
2826 * context which was originally shared using clone. copy_*
2827 * functions used by do_fork() cannot be used here directly
2828 * because they modify an inactive task_struct that is being
2829 * constructed. Here we are modifying the current, active,
2830 * task_struct.
2831 */
2832int ksys_unshare(unsigned long unshare_flags)
2833{
2834 struct fs_struct *fs, *new_fs = NULL;
2835 struct files_struct *fd, *new_fd = NULL;
2836 struct cred *new_cred = NULL;
2837 struct nsproxy *new_nsproxy = NULL;
2838 int do_sysvsem = 0;
2839 int err;
2840
2841 /*
2842 * If unsharing a user namespace must also unshare the thread group
2843 * and unshare the filesystem root and working directories.
2844 */
2845 if (unshare_flags & CLONE_NEWUSER)
2846 unshare_flags |= CLONE_THREAD | CLONE_FS;
2847 /*
2848 * If unsharing vm, must also unshare signal handlers.
2849 */
2850 if (unshare_flags & CLONE_VM)
2851 unshare_flags |= CLONE_SIGHAND;
2852 /*
2853 * If unsharing a signal handlers, must also unshare the signal queues.
2854 */
2855 if (unshare_flags & CLONE_SIGHAND)
2856 unshare_flags |= CLONE_THREAD;
2857 /*
2858 * If unsharing namespace, must also unshare filesystem information.
2859 */
2860 if (unshare_flags & CLONE_NEWNS)
2861 unshare_flags |= CLONE_FS;
2862
2863 err = check_unshare_flags(unshare_flags);
2864 if (err)
2865 goto bad_unshare_out;
2866 /*
2867 * CLONE_NEWIPC must also detach from the undolist: after switching
2868 * to a new ipc namespace, the semaphore arrays from the old
2869 * namespace are unreachable.
2870 */
2871 if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM))
2872 do_sysvsem = 1;
2873 err = unshare_fs(unshare_flags, &new_fs);
2874 if (err)
2875 goto bad_unshare_out;
2876 err = unshare_fd(unshare_flags, &new_fd);
2877 if (err)
2878 goto bad_unshare_cleanup_fs;
2879 err = unshare_userns(unshare_flags, &new_cred);
2880 if (err)
2881 goto bad_unshare_cleanup_fd;
2882 err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy,
2883 new_cred, new_fs);
2884 if (err)
2885 goto bad_unshare_cleanup_cred;
2886
2887 if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) {
2888 if (do_sysvsem) {
2889 /*
2890 * CLONE_SYSVSEM is equivalent to sys_exit().
2891 */
2892 exit_sem(current);
2893 }
2894 if (unshare_flags & CLONE_NEWIPC) {
2895 /* Orphan segments in old ns (see sem above). */
2896 exit_shm(current);
2897 shm_init_task(current);
2898 }
2899
2900 if (new_nsproxy)
2901 switch_task_namespaces(current, new_nsproxy);
2902
2903 task_lock(current);
2904
2905 if (new_fs) {
2906 fs = current->fs;
2907 spin_lock(&fs->lock);
2908 current->fs = new_fs;
2909 if (--fs->users)
2910 new_fs = NULL;
2911 else
2912 new_fs = fs;
2913 spin_unlock(&fs->lock);
2914 }
2915
2916 if (new_fd) {
2917 fd = current->files;
2918 current->files = new_fd;
2919 new_fd = fd;
2920 }
2921
2922 task_unlock(current);
2923
2924 if (new_cred) {
2925 /* Install the new user namespace */
2926 commit_creds(new_cred);
2927 new_cred = NULL;
2928 }
2929 }
2930
2931 perf_event_namespaces(current);
2932
2933bad_unshare_cleanup_cred:
2934 if (new_cred)
2935 put_cred(new_cred);
2936bad_unshare_cleanup_fd:
2937 if (new_fd)
2938 put_files_struct(new_fd);
2939
2940bad_unshare_cleanup_fs:
2941 if (new_fs)
2942 free_fs_struct(new_fs);
2943
2944bad_unshare_out:
2945 return err;
2946}
2947
2948SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags)
2949{
2950 return ksys_unshare(unshare_flags);
2951}
2952
2953/*
2954 * Helper to unshare the files of the current task.
2955 * We don't want to expose copy_files internals to
2956 * the exec layer of the kernel.
2957 */
2958
2959int unshare_files(struct files_struct **displaced)
2960{
2961 struct task_struct *task = current;
2962 struct files_struct *copy = NULL;
2963 int error;
2964
2965 error = unshare_fd(CLONE_FILES, &copy);
2966 if (error || !copy) {
2967 *displaced = NULL;
2968 return error;
2969 }
2970 *displaced = task->files;
2971 task_lock(task);
2972 task->files = copy;
2973 task_unlock(task);
2974 return 0;
2975}
2976
2977int sysctl_max_threads(struct ctl_table *table, int write,
2978 void __user *buffer, size_t *lenp, loff_t *ppos)
2979{
2980 struct ctl_table t;
2981 int ret;
2982 int threads = max_threads;
David Brazdil0f672f62019-12-10 10:32:29 +00002983 int min = 1;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002984 int max = MAX_THREADS;
2985
2986 t = *table;
2987 t.data = &threads;
2988 t.extra1 = &min;
2989 t.extra2 = &max;
2990
2991 ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
2992 if (ret || !write)
2993 return ret;
2994
David Brazdil0f672f62019-12-10 10:32:29 +00002995 max_threads = threads;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002996
2997 return 0;
2998}