1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 1991, 1992 Linus Torvalds
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()'
15 #include <linux/anon_inodes.h>
16 #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>
26 #include <linux/seq_file.h>
27 #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/kmsan.h>
41 #include <linux/binfmts.h>
42 #include <linux/mman.h>
43 #include <linux/mmu_notifier.h>
46 #include <linux/mm_inline.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/fs_struct.h>
81 #include <linux/magic.h>
82 #include <linux/perf_event.h>
83 #include <linux/posix-timers.h>
84 #include <linux/user-return-notifier.h>
85 #include <linux/oom.h>
86 #include <linux/khugepaged.h>
87 #include <linux/signalfd.h>
88 #include <linux/uprobes.h>
89 #include <linux/aio.h>
90 #include <linux/compiler.h>
91 #include <linux/sysctl.h>
92 #include <linux/kcov.h>
93 #include <linux/livepatch.h>
94 #include <linux/thread_info.h>
95 #include <linux/stackleak.h>
96 #include <linux/kasan.h>
97 #include <linux/scs.h>
98 #include <linux/io_uring.h>
99 #include <linux/bpf.h>
101 #include <asm/pgalloc.h>
102 #include <linux/uaccess.h>
103 #include <asm/mmu_context.h>
104 #include <asm/cacheflush.h>
105 #include <asm/tlbflush.h>
107 #include <trace/events/sched.h>
109 #define CREATE_TRACE_POINTS
110 #include <trace/events/task.h>
113 * Minimum number of threads to boot the kernel
115 #define MIN_THREADS 20
118 * Maximum number of threads
120 #define MAX_THREADS FUTEX_TID_MASK
123 * Protected counters by write_lock_irq(&tasklist_lock)
125 unsigned long total_forks; /* Handle normal Linux uptimes. */
126 int nr_threads; /* The idle threads do not count.. */
128 static int max_threads; /* tunable limit on nr_threads */
130 #define NAMED_ARRAY_INDEX(x) [x] = __stringify(x)
132 static const char * const resident_page_types[] = {
133 NAMED_ARRAY_INDEX(MM_FILEPAGES),
134 NAMED_ARRAY_INDEX(MM_ANONPAGES),
135 NAMED_ARRAY_INDEX(MM_SWAPENTS),
136 NAMED_ARRAY_INDEX(MM_SHMEMPAGES),
139 DEFINE_PER_CPU(unsigned long, process_counts) = 0;
141 __cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
143 #ifdef CONFIG_PROVE_RCU
144 int lockdep_tasklist_lock_is_held(void)
146 return lockdep_is_held(&tasklist_lock);
148 EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held);
149 #endif /* #ifdef CONFIG_PROVE_RCU */
151 int nr_processes(void)
156 for_each_possible_cpu(cpu)
157 total += per_cpu(process_counts, cpu);
162 void __weak arch_release_task_struct(struct task_struct *tsk)
166 #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
167 static struct kmem_cache *task_struct_cachep;
169 static inline struct task_struct *alloc_task_struct_node(int node)
171 return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
174 static inline void free_task_struct(struct task_struct *tsk)
176 kmem_cache_free(task_struct_cachep, tsk);
180 #ifndef CONFIG_ARCH_THREAD_STACK_ALLOCATOR
183 * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a
184 * kmemcache based allocator.
186 # if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)
188 # ifdef CONFIG_VMAP_STACK
190 * vmalloc() is a bit slow, and calling vfree() enough times will force a TLB
191 * flush. Try to minimize the number of calls by caching stacks.
193 #define NR_CACHED_STACKS 2
194 static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]);
198 struct vm_struct *stack_vm_area;
201 static bool try_release_thread_stack_to_cache(struct vm_struct *vm)
205 for (i = 0; i < NR_CACHED_STACKS; i++) {
206 if (this_cpu_cmpxchg(cached_stacks[i], NULL, vm) != NULL)
213 static void thread_stack_free_rcu(struct rcu_head *rh)
215 struct vm_stack *vm_stack = container_of(rh, struct vm_stack, rcu);
217 if (try_release_thread_stack_to_cache(vm_stack->stack_vm_area))
223 static void thread_stack_delayed_free(struct task_struct *tsk)
225 struct vm_stack *vm_stack = tsk->stack;
227 vm_stack->stack_vm_area = tsk->stack_vm_area;
228 call_rcu(&vm_stack->rcu, thread_stack_free_rcu);
231 static int free_vm_stack_cache(unsigned int cpu)
233 struct vm_struct **cached_vm_stacks = per_cpu_ptr(cached_stacks, cpu);
236 for (i = 0; i < NR_CACHED_STACKS; i++) {
237 struct vm_struct *vm_stack = cached_vm_stacks[i];
242 vfree(vm_stack->addr);
243 cached_vm_stacks[i] = NULL;
249 static int memcg_charge_kernel_stack(struct vm_struct *vm)
254 BUILD_BUG_ON(IS_ENABLED(CONFIG_VMAP_STACK) && PAGE_SIZE % 1024 != 0);
255 BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE);
257 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
258 ret = memcg_kmem_charge_page(vm->pages[i], GFP_KERNEL, 0);
265 * If memcg_kmem_charge_page() fails, page's memory cgroup pointer is
266 * NULL, and memcg_kmem_uncharge_page() in free_thread_stack() will
269 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++)
270 memcg_kmem_uncharge_page(vm->pages[i], 0);
274 static int alloc_thread_stack_node(struct task_struct *tsk, int node)
276 struct vm_struct *vm;
280 for (i = 0; i < NR_CACHED_STACKS; i++) {
283 s = this_cpu_xchg(cached_stacks[i], NULL);
288 /* Reset stack metadata. */
289 kasan_unpoison_range(s->addr, THREAD_SIZE);
291 stack = kasan_reset_tag(s->addr);
293 /* Clear stale pointers from reused stack. */
294 memset(stack, 0, THREAD_SIZE);
296 if (memcg_charge_kernel_stack(s)) {
301 tsk->stack_vm_area = s;
307 * Allocated stacks are cached and later reused by new threads,
308 * so memcg accounting is performed manually on assigning/releasing
309 * stacks to tasks. Drop __GFP_ACCOUNT.
311 stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN,
312 VMALLOC_START, VMALLOC_END,
313 THREADINFO_GFP & ~__GFP_ACCOUNT,
315 0, node, __builtin_return_address(0));
319 vm = find_vm_area(stack);
320 if (memcg_charge_kernel_stack(vm)) {
325 * We can't call find_vm_area() in interrupt context, and
326 * free_thread_stack() can be called in interrupt context,
327 * so cache the vm_struct.
329 tsk->stack_vm_area = vm;
330 stack = kasan_reset_tag(stack);
335 static void free_thread_stack(struct task_struct *tsk)
337 if (!try_release_thread_stack_to_cache(tsk->stack_vm_area))
338 thread_stack_delayed_free(tsk);
341 tsk->stack_vm_area = NULL;
344 # else /* !CONFIG_VMAP_STACK */
346 static void thread_stack_free_rcu(struct rcu_head *rh)
348 __free_pages(virt_to_page(rh), THREAD_SIZE_ORDER);
351 static void thread_stack_delayed_free(struct task_struct *tsk)
353 struct rcu_head *rh = tsk->stack;
355 call_rcu(rh, thread_stack_free_rcu);
358 static int alloc_thread_stack_node(struct task_struct *tsk, int node)
360 struct page *page = alloc_pages_node(node, THREADINFO_GFP,
364 tsk->stack = kasan_reset_tag(page_address(page));
370 static void free_thread_stack(struct task_struct *tsk)
372 thread_stack_delayed_free(tsk);
376 # endif /* CONFIG_VMAP_STACK */
377 # else /* !(THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)) */
379 static struct kmem_cache *thread_stack_cache;
381 static void thread_stack_free_rcu(struct rcu_head *rh)
383 kmem_cache_free(thread_stack_cache, rh);
386 static void thread_stack_delayed_free(struct task_struct *tsk)
388 struct rcu_head *rh = tsk->stack;
390 call_rcu(rh, thread_stack_free_rcu);
393 static int alloc_thread_stack_node(struct task_struct *tsk, int node)
395 unsigned long *stack;
396 stack = kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node);
397 stack = kasan_reset_tag(stack);
399 return stack ? 0 : -ENOMEM;
402 static void free_thread_stack(struct task_struct *tsk)
404 thread_stack_delayed_free(tsk);
408 void thread_stack_cache_init(void)
410 thread_stack_cache = kmem_cache_create_usercopy("thread_stack",
411 THREAD_SIZE, THREAD_SIZE, 0, 0,
413 BUG_ON(thread_stack_cache == NULL);
416 # endif /* THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK) */
417 #else /* CONFIG_ARCH_THREAD_STACK_ALLOCATOR */
419 static int alloc_thread_stack_node(struct task_struct *tsk, int node)
421 unsigned long *stack;
423 stack = arch_alloc_thread_stack_node(tsk, node);
425 return stack ? 0 : -ENOMEM;
428 static void free_thread_stack(struct task_struct *tsk)
430 arch_free_thread_stack(tsk);
434 #endif /* !CONFIG_ARCH_THREAD_STACK_ALLOCATOR */
436 /* SLAB cache for signal_struct structures (tsk->signal) */
437 static struct kmem_cache *signal_cachep;
439 /* SLAB cache for sighand_struct structures (tsk->sighand) */
440 struct kmem_cache *sighand_cachep;
442 /* SLAB cache for files_struct structures (tsk->files) */
443 struct kmem_cache *files_cachep;
445 /* SLAB cache for fs_struct structures (tsk->fs) */
446 struct kmem_cache *fs_cachep;
448 /* SLAB cache for vm_area_struct structures */
449 static struct kmem_cache *vm_area_cachep;
451 /* SLAB cache for mm_struct structures (tsk->mm) */
452 static struct kmem_cache *mm_cachep;
454 struct vm_area_struct *vm_area_alloc(struct mm_struct *mm)
456 struct vm_area_struct *vma;
458 vma = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
464 struct vm_area_struct *vm_area_dup(struct vm_area_struct *orig)
466 struct vm_area_struct *new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
469 ASSERT_EXCLUSIVE_WRITER(orig->vm_flags);
470 ASSERT_EXCLUSIVE_WRITER(orig->vm_file);
472 * orig->shared.rb may be modified concurrently, but the clone
473 * will be reinitialized.
475 *new = data_race(*orig);
476 INIT_LIST_HEAD(&new->anon_vma_chain);
477 dup_anon_vma_name(orig, new);
482 void vm_area_free(struct vm_area_struct *vma)
484 free_anon_vma_name(vma);
485 kmem_cache_free(vm_area_cachep, vma);
488 static void account_kernel_stack(struct task_struct *tsk, int account)
490 if (IS_ENABLED(CONFIG_VMAP_STACK)) {
491 struct vm_struct *vm = task_stack_vm_area(tsk);
494 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++)
495 mod_lruvec_page_state(vm->pages[i], NR_KERNEL_STACK_KB,
496 account * (PAGE_SIZE / 1024));
498 void *stack = task_stack_page(tsk);
500 /* All stack pages are in the same node. */
501 mod_lruvec_kmem_state(stack, NR_KERNEL_STACK_KB,
502 account * (THREAD_SIZE / 1024));
506 void exit_task_stack_account(struct task_struct *tsk)
508 account_kernel_stack(tsk, -1);
510 if (IS_ENABLED(CONFIG_VMAP_STACK)) {
511 struct vm_struct *vm;
514 vm = task_stack_vm_area(tsk);
515 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++)
516 memcg_kmem_uncharge_page(vm->pages[i], 0);
520 static void release_task_stack(struct task_struct *tsk)
522 if (WARN_ON(READ_ONCE(tsk->__state) != TASK_DEAD))
523 return; /* Better to leak the stack than to free prematurely */
525 free_thread_stack(tsk);
528 #ifdef CONFIG_THREAD_INFO_IN_TASK
529 void put_task_stack(struct task_struct *tsk)
531 if (refcount_dec_and_test(&tsk->stack_refcount))
532 release_task_stack(tsk);
536 void free_task(struct task_struct *tsk)
538 #ifdef CONFIG_SECCOMP
539 WARN_ON_ONCE(tsk->seccomp.filter);
541 release_user_cpus_ptr(tsk);
544 #ifndef CONFIG_THREAD_INFO_IN_TASK
546 * The task is finally done with both the stack and thread_info,
549 release_task_stack(tsk);
552 * If the task had a separate stack allocation, it should be gone
555 WARN_ON_ONCE(refcount_read(&tsk->stack_refcount) != 0);
557 rt_mutex_debug_task_free(tsk);
558 ftrace_graph_exit_task(tsk);
559 arch_release_task_struct(tsk);
560 if (tsk->flags & PF_KTHREAD)
561 free_kthread_struct(tsk);
562 bpf_task_storage_free(tsk);
563 free_task_struct(tsk);
565 EXPORT_SYMBOL(free_task);
567 static void dup_mm_exe_file(struct mm_struct *mm, struct mm_struct *oldmm)
569 struct file *exe_file;
571 exe_file = get_mm_exe_file(oldmm);
572 RCU_INIT_POINTER(mm->exe_file, exe_file);
574 * We depend on the oldmm having properly denied write access to the
577 if (exe_file && deny_write_access(exe_file))
578 pr_warn_once("deny_write_access() failed in %s\n", __func__);
582 static __latent_entropy int dup_mmap(struct mm_struct *mm,
583 struct mm_struct *oldmm)
585 struct vm_area_struct *mpnt, *tmp;
587 unsigned long charge = 0;
589 MA_STATE(old_mas, &oldmm->mm_mt, 0, 0);
590 MA_STATE(mas, &mm->mm_mt, 0, 0);
592 uprobe_start_dup_mmap();
593 if (mmap_write_lock_killable(oldmm)) {
595 goto fail_uprobe_end;
597 flush_cache_dup_mm(oldmm);
598 uprobe_dup_mmap(oldmm, mm);
600 * Not linked in yet - no deadlock potential:
602 mmap_write_lock_nested(mm, SINGLE_DEPTH_NESTING);
604 /* No ordering required: file already has been exposed. */
605 dup_mm_exe_file(mm, oldmm);
607 mm->total_vm = oldmm->total_vm;
608 mm->data_vm = oldmm->data_vm;
609 mm->exec_vm = oldmm->exec_vm;
610 mm->stack_vm = oldmm->stack_vm;
612 retval = ksm_fork(mm, oldmm);
615 khugepaged_fork(mm, oldmm);
617 retval = mas_expected_entries(&mas, oldmm->map_count);
621 mt_clear_in_rcu(mas.tree);
622 mas_for_each(&old_mas, mpnt, ULONG_MAX) {
625 if (mpnt->vm_flags & VM_DONTCOPY) {
626 vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt));
631 * Don't duplicate many vmas if we've been oom-killed (for
634 if (fatal_signal_pending(current)) {
638 if (mpnt->vm_flags & VM_ACCOUNT) {
639 unsigned long len = vma_pages(mpnt);
641 if (security_vm_enough_memory_mm(oldmm, len)) /* sic */
645 tmp = vm_area_dup(mpnt);
648 retval = vma_dup_policy(mpnt, tmp);
650 goto fail_nomem_policy;
652 retval = dup_userfaultfd(tmp, &uf);
654 goto fail_nomem_anon_vma_fork;
655 if (tmp->vm_flags & VM_WIPEONFORK) {
657 * VM_WIPEONFORK gets a clean slate in the child.
658 * Don't prepare anon_vma until fault since we don't
659 * copy page for current vma.
661 tmp->anon_vma = NULL;
662 } else if (anon_vma_fork(tmp, mpnt))
663 goto fail_nomem_anon_vma_fork;
664 tmp->vm_flags &= ~(VM_LOCKED | VM_LOCKONFAULT);
667 struct address_space *mapping = file->f_mapping;
670 i_mmap_lock_write(mapping);
671 if (tmp->vm_flags & VM_SHARED)
672 mapping_allow_writable(mapping);
673 flush_dcache_mmap_lock(mapping);
674 /* insert tmp into the share list, just after mpnt */
675 vma_interval_tree_insert_after(tmp, mpnt,
677 flush_dcache_mmap_unlock(mapping);
678 i_mmap_unlock_write(mapping);
682 * Copy/update hugetlb private vma information.
684 if (is_vm_hugetlb_page(tmp))
685 hugetlb_dup_vma_private(tmp);
687 /* Link the vma into the MT */
688 mas.index = tmp->vm_start;
689 mas.last = tmp->vm_end - 1;
690 mas_store(&mas, tmp);
691 if (mas_is_err(&mas))
692 goto fail_nomem_mas_store;
695 if (!(tmp->vm_flags & VM_WIPEONFORK))
696 retval = copy_page_range(tmp, mpnt);
698 if (tmp->vm_ops && tmp->vm_ops->open)
699 tmp->vm_ops->open(tmp);
704 /* a new mm has just been created */
705 retval = arch_dup_mmap(oldmm, mm);
709 mt_set_in_rcu(mas.tree);
711 mmap_write_unlock(mm);
713 mmap_write_unlock(oldmm);
714 dup_userfaultfd_complete(&uf);
716 uprobe_end_dup_mmap();
719 fail_nomem_mas_store:
720 unlink_anon_vmas(tmp);
721 fail_nomem_anon_vma_fork:
722 mpol_put(vma_policy(tmp));
727 vm_unacct_memory(charge);
731 static inline int mm_alloc_pgd(struct mm_struct *mm)
733 mm->pgd = pgd_alloc(mm);
734 if (unlikely(!mm->pgd))
739 static inline void mm_free_pgd(struct mm_struct *mm)
741 pgd_free(mm, mm->pgd);
744 static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
746 mmap_write_lock(oldmm);
747 dup_mm_exe_file(mm, oldmm);
748 mmap_write_unlock(oldmm);
751 #define mm_alloc_pgd(mm) (0)
752 #define mm_free_pgd(mm)
753 #endif /* CONFIG_MMU */
755 static void check_mm(struct mm_struct *mm)
759 BUILD_BUG_ON_MSG(ARRAY_SIZE(resident_page_types) != NR_MM_COUNTERS,
760 "Please make sure 'struct resident_page_types[]' is updated as well");
762 for (i = 0; i < NR_MM_COUNTERS; i++) {
763 long x = atomic_long_read(&mm->rss_stat.count[i]);
766 pr_alert("BUG: Bad rss-counter state mm:%p type:%s val:%ld\n",
767 mm, resident_page_types[i], x);
770 if (mm_pgtables_bytes(mm))
771 pr_alert("BUG: non-zero pgtables_bytes on freeing mm: %ld\n",
772 mm_pgtables_bytes(mm));
774 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
775 VM_BUG_ON_MM(mm->pmd_huge_pte, mm);
779 #define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
780 #define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
783 * Called when the last reference to the mm
784 * is dropped: either by a lazy thread or by
785 * mmput. Free the page directory and the mm.
787 void __mmdrop(struct mm_struct *mm)
789 BUG_ON(mm == &init_mm);
790 WARN_ON_ONCE(mm == current->mm);
791 WARN_ON_ONCE(mm == current->active_mm);
794 mmu_notifier_subscriptions_destroy(mm);
796 put_user_ns(mm->user_ns);
800 EXPORT_SYMBOL_GPL(__mmdrop);
802 static void mmdrop_async_fn(struct work_struct *work)
804 struct mm_struct *mm;
806 mm = container_of(work, struct mm_struct, async_put_work);
810 static void mmdrop_async(struct mm_struct *mm)
812 if (unlikely(atomic_dec_and_test(&mm->mm_count))) {
813 INIT_WORK(&mm->async_put_work, mmdrop_async_fn);
814 schedule_work(&mm->async_put_work);
818 static inline void free_signal_struct(struct signal_struct *sig)
820 taskstats_tgid_free(sig);
821 sched_autogroup_exit(sig);
823 * __mmdrop is not safe to call from softirq context on x86 due to
824 * pgd_dtor so postpone it to the async context
827 mmdrop_async(sig->oom_mm);
828 kmem_cache_free(signal_cachep, sig);
831 static inline void put_signal_struct(struct signal_struct *sig)
833 if (refcount_dec_and_test(&sig->sigcnt))
834 free_signal_struct(sig);
837 void __put_task_struct(struct task_struct *tsk)
839 WARN_ON(!tsk->exit_state);
840 WARN_ON(refcount_read(&tsk->usage));
841 WARN_ON(tsk == current);
845 task_numa_free(tsk, true);
846 security_task_free(tsk);
848 delayacct_tsk_free(tsk);
849 put_signal_struct(tsk->signal);
850 sched_core_free(tsk);
853 EXPORT_SYMBOL_GPL(__put_task_struct);
855 void __init __weak arch_task_cache_init(void) { }
860 static void set_max_threads(unsigned int max_threads_suggested)
863 unsigned long nr_pages = totalram_pages();
866 * The number of threads shall be limited such that the thread
867 * structures may only consume a small part of the available memory.
869 if (fls64(nr_pages) + fls64(PAGE_SIZE) > 64)
870 threads = MAX_THREADS;
872 threads = div64_u64((u64) nr_pages * (u64) PAGE_SIZE,
873 (u64) THREAD_SIZE * 8UL);
875 if (threads > max_threads_suggested)
876 threads = max_threads_suggested;
878 max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS);
881 #ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT
882 /* Initialized by the architecture: */
883 int arch_task_struct_size __read_mostly;
886 #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
887 static void task_struct_whitelist(unsigned long *offset, unsigned long *size)
889 /* Fetch thread_struct whitelist for the architecture. */
890 arch_thread_struct_whitelist(offset, size);
893 * Handle zero-sized whitelist or empty thread_struct, otherwise
894 * adjust offset to position of thread_struct in task_struct.
896 if (unlikely(*size == 0))
899 *offset += offsetof(struct task_struct, thread);
901 #endif /* CONFIG_ARCH_TASK_STRUCT_ALLOCATOR */
903 void __init fork_init(void)
906 #ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
907 #ifndef ARCH_MIN_TASKALIGN
908 #define ARCH_MIN_TASKALIGN 0
910 int align = max_t(int, L1_CACHE_BYTES, ARCH_MIN_TASKALIGN);
911 unsigned long useroffset, usersize;
913 /* create a slab on which task_structs can be allocated */
914 task_struct_whitelist(&useroffset, &usersize);
915 task_struct_cachep = kmem_cache_create_usercopy("task_struct",
916 arch_task_struct_size, align,
917 SLAB_PANIC|SLAB_ACCOUNT,
918 useroffset, usersize, NULL);
921 /* do the arch specific task caches init */
922 arch_task_cache_init();
924 set_max_threads(MAX_THREADS);
926 init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
927 init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
928 init_task.signal->rlim[RLIMIT_SIGPENDING] =
929 init_task.signal->rlim[RLIMIT_NPROC];
931 for (i = 0; i < UCOUNT_COUNTS; i++)
932 init_user_ns.ucount_max[i] = max_threads/2;
934 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_NPROC, RLIM_INFINITY);
935 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_MSGQUEUE, RLIM_INFINITY);
936 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_SIGPENDING, RLIM_INFINITY);
937 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_MEMLOCK, RLIM_INFINITY);
939 #ifdef CONFIG_VMAP_STACK
940 cpuhp_setup_state(CPUHP_BP_PREPARE_DYN, "fork:vm_stack_cache",
941 NULL, free_vm_stack_cache);
946 lockdep_init_task(&init_task);
950 int __weak arch_dup_task_struct(struct task_struct *dst,
951 struct task_struct *src)
957 void set_task_stack_end_magic(struct task_struct *tsk)
959 unsigned long *stackend;
961 stackend = end_of_stack(tsk);
962 *stackend = STACK_END_MAGIC; /* for overflow detection */
965 static struct task_struct *dup_task_struct(struct task_struct *orig, int node)
967 struct task_struct *tsk;
970 if (node == NUMA_NO_NODE)
971 node = tsk_fork_get_node(orig);
972 tsk = alloc_task_struct_node(node);
976 err = arch_dup_task_struct(tsk, orig);
980 err = alloc_thread_stack_node(tsk, node);
984 #ifdef CONFIG_THREAD_INFO_IN_TASK
985 refcount_set(&tsk->stack_refcount, 1);
987 account_kernel_stack(tsk, 1);
989 err = scs_prepare(tsk, node);
993 #ifdef CONFIG_SECCOMP
995 * We must handle setting up seccomp filters once we're under
996 * the sighand lock in case orig has changed between now and
997 * then. Until then, filter must be NULL to avoid messing up
998 * the usage counts on the error path calling free_task.
1000 tsk->seccomp.filter = NULL;
1003 setup_thread_stack(tsk, orig);
1004 clear_user_return_notifier(tsk);
1005 clear_tsk_need_resched(tsk);
1006 set_task_stack_end_magic(tsk);
1007 clear_syscall_work_syscall_user_dispatch(tsk);
1009 #ifdef CONFIG_STACKPROTECTOR
1010 tsk->stack_canary = get_random_canary();
1012 if (orig->cpus_ptr == &orig->cpus_mask)
1013 tsk->cpus_ptr = &tsk->cpus_mask;
1014 dup_user_cpus_ptr(tsk, orig, node);
1017 * One for the user space visible state that goes away when reaped.
1018 * One for the scheduler.
1020 refcount_set(&tsk->rcu_users, 2);
1021 /* One for the rcu users */
1022 refcount_set(&tsk->usage, 1);
1023 #ifdef CONFIG_BLK_DEV_IO_TRACE
1024 tsk->btrace_seq = 0;
1026 tsk->splice_pipe = NULL;
1027 tsk->task_frag.page = NULL;
1028 tsk->wake_q.next = NULL;
1029 tsk->worker_private = NULL;
1031 kcov_task_init(tsk);
1032 kmsan_task_create(tsk);
1033 kmap_local_fork(tsk);
1035 #ifdef CONFIG_FAULT_INJECTION
1039 #ifdef CONFIG_BLK_CGROUP
1040 tsk->throttle_queue = NULL;
1041 tsk->use_memdelay = 0;
1044 #ifdef CONFIG_IOMMU_SVA
1045 tsk->pasid_activated = 0;
1049 tsk->active_memcg = NULL;
1052 #ifdef CONFIG_CPU_SUP_INTEL
1053 tsk->reported_split_lock = 0;
1059 exit_task_stack_account(tsk);
1060 free_thread_stack(tsk);
1062 free_task_struct(tsk);
1066 __cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
1068 static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT;
1070 static int __init coredump_filter_setup(char *s)
1072 default_dump_filter =
1073 (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) &
1074 MMF_DUMP_FILTER_MASK;
1078 __setup("coredump_filter=", coredump_filter_setup);
1080 #include <linux/init_task.h>
1082 static void mm_init_aio(struct mm_struct *mm)
1085 spin_lock_init(&mm->ioctx_lock);
1086 mm->ioctx_table = NULL;
1090 static __always_inline void mm_clear_owner(struct mm_struct *mm,
1091 struct task_struct *p)
1095 WRITE_ONCE(mm->owner, NULL);
1099 static void mm_init_owner(struct mm_struct *mm, struct task_struct *p)
1106 static void mm_init_uprobes_state(struct mm_struct *mm)
1108 #ifdef CONFIG_UPROBES
1109 mm->uprobes_state.xol_area = NULL;
1113 static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p,
1114 struct user_namespace *user_ns)
1116 mt_init_flags(&mm->mm_mt, MM_MT_FLAGS);
1117 mt_set_external_lock(&mm->mm_mt, &mm->mmap_lock);
1118 atomic_set(&mm->mm_users, 1);
1119 atomic_set(&mm->mm_count, 1);
1120 seqcount_init(&mm->write_protect_seq);
1122 INIT_LIST_HEAD(&mm->mmlist);
1123 mm_pgtables_bytes_init(mm);
1126 atomic64_set(&mm->pinned_vm, 0);
1127 memset(&mm->rss_stat, 0, sizeof(mm->rss_stat));
1128 spin_lock_init(&mm->page_table_lock);
1129 spin_lock_init(&mm->arg_lock);
1130 mm_init_cpumask(mm);
1132 mm_init_owner(mm, p);
1134 RCU_INIT_POINTER(mm->exe_file, NULL);
1135 mmu_notifier_subscriptions_init(mm);
1136 init_tlb_flush_pending(mm);
1137 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
1138 mm->pmd_huge_pte = NULL;
1140 mm_init_uprobes_state(mm);
1141 hugetlb_count_init(mm);
1144 mm->flags = current->mm->flags & MMF_INIT_MASK;
1145 mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK;
1147 mm->flags = default_dump_filter;
1151 if (mm_alloc_pgd(mm))
1154 if (init_new_context(p, mm))
1155 goto fail_nocontext;
1157 mm->user_ns = get_user_ns(user_ns);
1158 lru_gen_init_mm(mm);
1169 * Allocate and initialize an mm_struct.
1171 struct mm_struct *mm_alloc(void)
1173 struct mm_struct *mm;
1179 memset(mm, 0, sizeof(*mm));
1180 return mm_init(mm, current, current_user_ns());
1183 static inline void __mmput(struct mm_struct *mm)
1185 VM_BUG_ON(atomic_read(&mm->mm_users));
1187 uprobe_clear_state(mm);
1190 khugepaged_exit(mm); /* must run before exit_mmap */
1192 mm_put_huge_zero_page(mm);
1193 set_mm_exe_file(mm, NULL);
1194 if (!list_empty(&mm->mmlist)) {
1195 spin_lock(&mmlist_lock);
1196 list_del(&mm->mmlist);
1197 spin_unlock(&mmlist_lock);
1200 module_put(mm->binfmt->module);
1206 * Decrement the use count and release all resources for an mm.
1208 void mmput(struct mm_struct *mm)
1212 if (atomic_dec_and_test(&mm->mm_users))
1215 EXPORT_SYMBOL_GPL(mmput);
1218 static void mmput_async_fn(struct work_struct *work)
1220 struct mm_struct *mm = container_of(work, struct mm_struct,
1226 void mmput_async(struct mm_struct *mm)
1228 if (atomic_dec_and_test(&mm->mm_users)) {
1229 INIT_WORK(&mm->async_put_work, mmput_async_fn);
1230 schedule_work(&mm->async_put_work);
1233 EXPORT_SYMBOL_GPL(mmput_async);
1237 * set_mm_exe_file - change a reference to the mm's executable file
1239 * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
1241 * Main users are mmput() and sys_execve(). Callers prevent concurrent
1242 * invocations: in mmput() nobody alive left, in execve task is single
1245 * Can only fail if new_exe_file != NULL.
1247 int set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1249 struct file *old_exe_file;
1252 * It is safe to dereference the exe_file without RCU as
1253 * this function is only called if nobody else can access
1254 * this mm -- see comment above for justification.
1256 old_exe_file = rcu_dereference_raw(mm->exe_file);
1260 * We expect the caller (i.e., sys_execve) to already denied
1261 * write access, so this is unlikely to fail.
1263 if (unlikely(deny_write_access(new_exe_file)))
1265 get_file(new_exe_file);
1267 rcu_assign_pointer(mm->exe_file, new_exe_file);
1269 allow_write_access(old_exe_file);
1276 * replace_mm_exe_file - replace a reference to the mm's executable file
1278 * This changes mm's executable file (shown as symlink /proc/[pid]/exe),
1279 * dealing with concurrent invocation and without grabbing the mmap lock in
1282 * Main user is sys_prctl(PR_SET_MM_MAP/EXE_FILE).
1284 int replace_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1286 struct vm_area_struct *vma;
1287 struct file *old_exe_file;
1290 /* Forbid mm->exe_file change if old file still mapped. */
1291 old_exe_file = get_mm_exe_file(mm);
1293 VMA_ITERATOR(vmi, mm, 0);
1295 for_each_vma(vmi, vma) {
1298 if (path_equal(&vma->vm_file->f_path,
1299 &old_exe_file->f_path)) {
1304 mmap_read_unlock(mm);
1310 /* set the new file, lockless */
1311 ret = deny_write_access(new_exe_file);
1314 get_file(new_exe_file);
1316 old_exe_file = xchg(&mm->exe_file, new_exe_file);
1319 * Don't race with dup_mmap() getting the file and disallowing
1320 * write access while someone might open the file writable.
1323 allow_write_access(old_exe_file);
1325 mmap_read_unlock(mm);
1331 * get_mm_exe_file - acquire a reference to the mm's executable file
1333 * Returns %NULL if mm has no associated executable file.
1334 * User must release file via fput().
1336 struct file *get_mm_exe_file(struct mm_struct *mm)
1338 struct file *exe_file;
1341 exe_file = rcu_dereference(mm->exe_file);
1342 if (exe_file && !get_file_rcu(exe_file))
1349 * get_task_exe_file - acquire a reference to the task's executable file
1351 * Returns %NULL if task's mm (if any) has no associated executable file or
1352 * this is a kernel thread with borrowed mm (see the comment above get_task_mm).
1353 * User must release file via fput().
1355 struct file *get_task_exe_file(struct task_struct *task)
1357 struct file *exe_file = NULL;
1358 struct mm_struct *mm;
1363 if (!(task->flags & PF_KTHREAD))
1364 exe_file = get_mm_exe_file(mm);
1371 * get_task_mm - acquire a reference to the task's mm
1373 * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning
1374 * this kernel workthread has transiently adopted a user mm with use_mm,
1375 * to do its AIO) is not set and if so returns a reference to it, after
1376 * bumping up the use count. User must release the mm via mmput()
1377 * after use. Typically used by /proc and ptrace.
1379 struct mm_struct *get_task_mm(struct task_struct *task)
1381 struct mm_struct *mm;
1386 if (task->flags & PF_KTHREAD)
1394 EXPORT_SYMBOL_GPL(get_task_mm);
1396 struct mm_struct *mm_access(struct task_struct *task, unsigned int mode)
1398 struct mm_struct *mm;
1401 err = down_read_killable(&task->signal->exec_update_lock);
1403 return ERR_PTR(err);
1405 mm = get_task_mm(task);
1406 if (mm && mm != current->mm &&
1407 !ptrace_may_access(task, mode)) {
1409 mm = ERR_PTR(-EACCES);
1411 up_read(&task->signal->exec_update_lock);
1416 static void complete_vfork_done(struct task_struct *tsk)
1418 struct completion *vfork;
1421 vfork = tsk->vfork_done;
1422 if (likely(vfork)) {
1423 tsk->vfork_done = NULL;
1429 static int wait_for_vfork_done(struct task_struct *child,
1430 struct completion *vfork)
1432 unsigned int state = TASK_UNINTERRUPTIBLE|TASK_KILLABLE|TASK_FREEZABLE;
1435 cgroup_enter_frozen();
1436 killed = wait_for_completion_state(vfork, state);
1437 cgroup_leave_frozen(false);
1441 child->vfork_done = NULL;
1445 put_task_struct(child);
1449 /* Please note the differences between mmput and mm_release.
1450 * mmput is called whenever we stop holding onto a mm_struct,
1451 * error success whatever.
1453 * mm_release is called after a mm_struct has been removed
1454 * from the current process.
1456 * This difference is important for error handling, when we
1457 * only half set up a mm_struct for a new process and need to restore
1458 * the old one. Because we mmput the new mm_struct before
1459 * restoring the old one. . .
1460 * Eric Biederman 10 January 1998
1462 static void mm_release(struct task_struct *tsk, struct mm_struct *mm)
1464 uprobe_free_utask(tsk);
1466 /* Get rid of any cached register state */
1467 deactivate_mm(tsk, mm);
1470 * Signal userspace if we're not exiting with a core dump
1471 * because we want to leave the value intact for debugging
1474 if (tsk->clear_child_tid) {
1475 if (atomic_read(&mm->mm_users) > 1) {
1477 * We don't check the error code - if userspace has
1478 * not set up a proper pointer then tough luck.
1480 put_user(0, tsk->clear_child_tid);
1481 do_futex(tsk->clear_child_tid, FUTEX_WAKE,
1482 1, NULL, NULL, 0, 0);
1484 tsk->clear_child_tid = NULL;
1488 * All done, finally we can wake up parent and return this mm to him.
1489 * Also kthread_stop() uses this completion for synchronization.
1491 if (tsk->vfork_done)
1492 complete_vfork_done(tsk);
1495 void exit_mm_release(struct task_struct *tsk, struct mm_struct *mm)
1497 futex_exit_release(tsk);
1498 mm_release(tsk, mm);
1501 void exec_mm_release(struct task_struct *tsk, struct mm_struct *mm)
1503 futex_exec_release(tsk);
1504 mm_release(tsk, mm);
1508 * dup_mm() - duplicates an existing mm structure
1509 * @tsk: the task_struct with which the new mm will be associated.
1510 * @oldmm: the mm to duplicate.
1512 * Allocates a new mm structure and duplicates the provided @oldmm structure
1515 * Return: the duplicated mm or NULL on failure.
1517 static struct mm_struct *dup_mm(struct task_struct *tsk,
1518 struct mm_struct *oldmm)
1520 struct mm_struct *mm;
1527 memcpy(mm, oldmm, sizeof(*mm));
1529 if (!mm_init(mm, tsk, mm->user_ns))
1532 err = dup_mmap(mm, oldmm);
1536 mm->hiwater_rss = get_mm_rss(mm);
1537 mm->hiwater_vm = mm->total_vm;
1539 if (mm->binfmt && !try_module_get(mm->binfmt->module))
1545 /* don't put binfmt in mmput, we haven't got module yet */
1547 mm_init_owner(mm, NULL);
1554 static int copy_mm(unsigned long clone_flags, struct task_struct *tsk)
1556 struct mm_struct *mm, *oldmm;
1558 tsk->min_flt = tsk->maj_flt = 0;
1559 tsk->nvcsw = tsk->nivcsw = 0;
1560 #ifdef CONFIG_DETECT_HUNG_TASK
1561 tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw;
1562 tsk->last_switch_time = 0;
1566 tsk->active_mm = NULL;
1569 * Are we cloning a kernel thread?
1571 * We need to steal a active VM for that..
1573 oldmm = current->mm;
1577 if (clone_flags & CLONE_VM) {
1581 mm = dup_mm(tsk, current->mm);
1587 tsk->active_mm = mm;
1591 static int copy_fs(unsigned long clone_flags, struct task_struct *tsk)
1593 struct fs_struct *fs = current->fs;
1594 if (clone_flags & CLONE_FS) {
1595 /* tsk->fs is already what we want */
1596 spin_lock(&fs->lock);
1598 spin_unlock(&fs->lock);
1602 spin_unlock(&fs->lock);
1605 tsk->fs = copy_fs_struct(fs);
1611 static int copy_files(unsigned long clone_flags, struct task_struct *tsk)
1613 struct files_struct *oldf, *newf;
1617 * A background process may not have any files ...
1619 oldf = current->files;
1623 if (clone_flags & CLONE_FILES) {
1624 atomic_inc(&oldf->count);
1628 newf = dup_fd(oldf, NR_OPEN_MAX, &error);
1638 static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk)
1640 struct sighand_struct *sig;
1642 if (clone_flags & CLONE_SIGHAND) {
1643 refcount_inc(¤t->sighand->count);
1646 sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1647 RCU_INIT_POINTER(tsk->sighand, sig);
1651 refcount_set(&sig->count, 1);
1652 spin_lock_irq(¤t->sighand->siglock);
1653 memcpy(sig->action, current->sighand->action, sizeof(sig->action));
1654 spin_unlock_irq(¤t->sighand->siglock);
1656 /* Reset all signal handler not set to SIG_IGN to SIG_DFL. */
1657 if (clone_flags & CLONE_CLEAR_SIGHAND)
1658 flush_signal_handlers(tsk, 0);
1663 void __cleanup_sighand(struct sighand_struct *sighand)
1665 if (refcount_dec_and_test(&sighand->count)) {
1666 signalfd_cleanup(sighand);
1668 * sighand_cachep is SLAB_TYPESAFE_BY_RCU so we can free it
1669 * without an RCU grace period, see __lock_task_sighand().
1671 kmem_cache_free(sighand_cachep, sighand);
1676 * Initialize POSIX timer handling for a thread group.
1678 static void posix_cpu_timers_init_group(struct signal_struct *sig)
1680 struct posix_cputimers *pct = &sig->posix_cputimers;
1681 unsigned long cpu_limit;
1683 cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur);
1684 posix_cputimers_group_init(pct, cpu_limit);
1687 static int copy_signal(unsigned long clone_flags, struct task_struct *tsk)
1689 struct signal_struct *sig;
1691 if (clone_flags & CLONE_THREAD)
1694 sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL);
1699 sig->nr_threads = 1;
1700 sig->quick_threads = 1;
1701 atomic_set(&sig->live, 1);
1702 refcount_set(&sig->sigcnt, 1);
1704 /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */
1705 sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node);
1706 tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head);
1708 init_waitqueue_head(&sig->wait_chldexit);
1709 sig->curr_target = tsk;
1710 init_sigpending(&sig->shared_pending);
1711 INIT_HLIST_HEAD(&sig->multiprocess);
1712 seqlock_init(&sig->stats_lock);
1713 prev_cputime_init(&sig->prev_cputime);
1715 #ifdef CONFIG_POSIX_TIMERS
1716 INIT_LIST_HEAD(&sig->posix_timers);
1717 hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1718 sig->real_timer.function = it_real_fn;
1721 task_lock(current->group_leader);
1722 memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
1723 task_unlock(current->group_leader);
1725 posix_cpu_timers_init_group(sig);
1727 tty_audit_fork(sig);
1728 sched_autogroup_fork(sig);
1730 sig->oom_score_adj = current->signal->oom_score_adj;
1731 sig->oom_score_adj_min = current->signal->oom_score_adj_min;
1733 mutex_init(&sig->cred_guard_mutex);
1734 init_rwsem(&sig->exec_update_lock);
1739 static void copy_seccomp(struct task_struct *p)
1741 #ifdef CONFIG_SECCOMP
1743 * Must be called with sighand->lock held, which is common to
1744 * all threads in the group. Holding cred_guard_mutex is not
1745 * needed because this new task is not yet running and cannot
1748 assert_spin_locked(¤t->sighand->siglock);
1750 /* Ref-count the new filter user, and assign it. */
1751 get_seccomp_filter(current);
1752 p->seccomp = current->seccomp;
1755 * Explicitly enable no_new_privs here in case it got set
1756 * between the task_struct being duplicated and holding the
1757 * sighand lock. The seccomp state and nnp must be in sync.
1759 if (task_no_new_privs(current))
1760 task_set_no_new_privs(p);
1763 * If the parent gained a seccomp mode after copying thread
1764 * flags and between before we held the sighand lock, we have
1765 * to manually enable the seccomp thread flag here.
1767 if (p->seccomp.mode != SECCOMP_MODE_DISABLED)
1768 set_task_syscall_work(p, SECCOMP);
1772 SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr)
1774 current->clear_child_tid = tidptr;
1776 return task_pid_vnr(current);
1779 static void rt_mutex_init_task(struct task_struct *p)
1781 raw_spin_lock_init(&p->pi_lock);
1782 #ifdef CONFIG_RT_MUTEXES
1783 p->pi_waiters = RB_ROOT_CACHED;
1784 p->pi_top_task = NULL;
1785 p->pi_blocked_on = NULL;
1789 static inline void init_task_pid_links(struct task_struct *task)
1793 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type)
1794 INIT_HLIST_NODE(&task->pid_links[type]);
1798 init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid)
1800 if (type == PIDTYPE_PID)
1801 task->thread_pid = pid;
1803 task->signal->pids[type] = pid;
1806 static inline void rcu_copy_process(struct task_struct *p)
1808 #ifdef CONFIG_PREEMPT_RCU
1809 p->rcu_read_lock_nesting = 0;
1810 p->rcu_read_unlock_special.s = 0;
1811 p->rcu_blocked_node = NULL;
1812 INIT_LIST_HEAD(&p->rcu_node_entry);
1813 #endif /* #ifdef CONFIG_PREEMPT_RCU */
1814 #ifdef CONFIG_TASKS_RCU
1815 p->rcu_tasks_holdout = false;
1816 INIT_LIST_HEAD(&p->rcu_tasks_holdout_list);
1817 p->rcu_tasks_idle_cpu = -1;
1818 #endif /* #ifdef CONFIG_TASKS_RCU */
1819 #ifdef CONFIG_TASKS_TRACE_RCU
1820 p->trc_reader_nesting = 0;
1821 p->trc_reader_special.s = 0;
1822 INIT_LIST_HEAD(&p->trc_holdout_list);
1823 INIT_LIST_HEAD(&p->trc_blkd_node);
1824 #endif /* #ifdef CONFIG_TASKS_TRACE_RCU */
1827 struct pid *pidfd_pid(const struct file *file)
1829 if (file->f_op == &pidfd_fops)
1830 return file->private_data;
1832 return ERR_PTR(-EBADF);
1835 static int pidfd_release(struct inode *inode, struct file *file)
1837 struct pid *pid = file->private_data;
1839 file->private_data = NULL;
1844 #ifdef CONFIG_PROC_FS
1846 * pidfd_show_fdinfo - print information about a pidfd
1847 * @m: proc fdinfo file
1848 * @f: file referencing a pidfd
1851 * This function will print the pid that a given pidfd refers to in the
1852 * pid namespace of the procfs instance.
1853 * If the pid namespace of the process is not a descendant of the pid
1854 * namespace of the procfs instance 0 will be shown as its pid. This is
1855 * similar to calling getppid() on a process whose parent is outside of
1856 * its pid namespace.
1859 * If pid namespaces are supported then this function will also print
1860 * the pid of a given pidfd refers to for all descendant pid namespaces
1861 * starting from the current pid namespace of the instance, i.e. the
1862 * Pid field and the first entry in the NSpid field will be identical.
1863 * If the pid namespace of the process is not a descendant of the pid
1864 * namespace of the procfs instance 0 will be shown as its first NSpid
1865 * entry and no others will be shown.
1866 * Note that this differs from the Pid and NSpid fields in
1867 * /proc/<pid>/status where Pid and NSpid are always shown relative to
1868 * the pid namespace of the procfs instance. The difference becomes
1869 * obvious when sending around a pidfd between pid namespaces from a
1870 * different branch of the tree, i.e. where no ancestral relation is
1871 * present between the pid namespaces:
1872 * - create two new pid namespaces ns1 and ns2 in the initial pid
1873 * namespace (also take care to create new mount namespaces in the
1874 * new pid namespace and mount procfs)
1875 * - create a process with a pidfd in ns1
1876 * - send pidfd from ns1 to ns2
1877 * - read /proc/self/fdinfo/<pidfd> and observe that both Pid and NSpid
1878 * have exactly one entry, which is 0
1880 static void pidfd_show_fdinfo(struct seq_file *m, struct file *f)
1882 struct pid *pid = f->private_data;
1883 struct pid_namespace *ns;
1886 if (likely(pid_has_task(pid, PIDTYPE_PID))) {
1887 ns = proc_pid_ns(file_inode(m->file)->i_sb);
1888 nr = pid_nr_ns(pid, ns);
1891 seq_put_decimal_ll(m, "Pid:\t", nr);
1893 #ifdef CONFIG_PID_NS
1894 seq_put_decimal_ll(m, "\nNSpid:\t", nr);
1898 /* If nr is non-zero it means that 'pid' is valid and that
1899 * ns, i.e. the pid namespace associated with the procfs
1900 * instance, is in the pid namespace hierarchy of pid.
1901 * Start at one below the already printed level.
1903 for (i = ns->level + 1; i <= pid->level; i++)
1904 seq_put_decimal_ll(m, "\t", pid->numbers[i].nr);
1912 * Poll support for process exit notification.
1914 static __poll_t pidfd_poll(struct file *file, struct poll_table_struct *pts)
1916 struct pid *pid = file->private_data;
1917 __poll_t poll_flags = 0;
1919 poll_wait(file, &pid->wait_pidfd, pts);
1922 * Inform pollers only when the whole thread group exits.
1923 * If the thread group leader exits before all other threads in the
1924 * group, then poll(2) should block, similar to the wait(2) family.
1926 if (thread_group_exited(pid))
1927 poll_flags = EPOLLIN | EPOLLRDNORM;
1932 const struct file_operations pidfd_fops = {
1933 .release = pidfd_release,
1935 #ifdef CONFIG_PROC_FS
1936 .show_fdinfo = pidfd_show_fdinfo,
1940 static void __delayed_free_task(struct rcu_head *rhp)
1942 struct task_struct *tsk = container_of(rhp, struct task_struct, rcu);
1947 static __always_inline void delayed_free_task(struct task_struct *tsk)
1949 if (IS_ENABLED(CONFIG_MEMCG))
1950 call_rcu(&tsk->rcu, __delayed_free_task);
1955 static void copy_oom_score_adj(u64 clone_flags, struct task_struct *tsk)
1957 /* Skip if kernel thread */
1961 /* Skip if spawning a thread or using vfork */
1962 if ((clone_flags & (CLONE_VM | CLONE_THREAD | CLONE_VFORK)) != CLONE_VM)
1965 /* We need to synchronize with __set_oom_adj */
1966 mutex_lock(&oom_adj_mutex);
1967 set_bit(MMF_MULTIPROCESS, &tsk->mm->flags);
1968 /* Update the values in case they were changed after copy_signal */
1969 tsk->signal->oom_score_adj = current->signal->oom_score_adj;
1970 tsk->signal->oom_score_adj_min = current->signal->oom_score_adj_min;
1971 mutex_unlock(&oom_adj_mutex);
1975 static void rv_task_fork(struct task_struct *p)
1979 for (i = 0; i < RV_PER_TASK_MONITORS; i++)
1980 p->rv[i].da_mon.monitoring = false;
1983 #define rv_task_fork(p) do {} while (0)
1987 * This creates a new process as a copy of the old one,
1988 * but does not actually start it yet.
1990 * It copies the registers, and all the appropriate
1991 * parts of the process environment (as per the clone
1992 * flags). The actual kick-off is left to the caller.
1994 static __latent_entropy struct task_struct *copy_process(
1998 struct kernel_clone_args *args)
2000 int pidfd = -1, retval;
2001 struct task_struct *p;
2002 struct multiprocess_signals delayed;
2003 struct file *pidfile = NULL;
2004 const u64 clone_flags = args->flags;
2005 struct nsproxy *nsp = current->nsproxy;
2008 * Don't allow sharing the root directory with processes in a different
2011 if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
2012 return ERR_PTR(-EINVAL);
2014 if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS))
2015 return ERR_PTR(-EINVAL);
2018 * Thread groups must share signals as well, and detached threads
2019 * can only be started up within the thread group.
2021 if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
2022 return ERR_PTR(-EINVAL);
2025 * Shared signal handlers imply shared VM. By way of the above,
2026 * thread groups also imply shared VM. Blocking this case allows
2027 * for various simplifications in other code.
2029 if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
2030 return ERR_PTR(-EINVAL);
2033 * Siblings of global init remain as zombies on exit since they are
2034 * not reaped by their parent (swapper). To solve this and to avoid
2035 * multi-rooted process trees, prevent global and container-inits
2036 * from creating siblings.
2038 if ((clone_flags & CLONE_PARENT) &&
2039 current->signal->flags & SIGNAL_UNKILLABLE)
2040 return ERR_PTR(-EINVAL);
2043 * If the new process will be in a different pid or user namespace
2044 * do not allow it to share a thread group with the forking task.
2046 if (clone_flags & CLONE_THREAD) {
2047 if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) ||
2048 (task_active_pid_ns(current) != nsp->pid_ns_for_children))
2049 return ERR_PTR(-EINVAL);
2053 * If the new process will be in a different time namespace
2054 * do not allow it to share VM or a thread group with the forking task.
2056 if (clone_flags & (CLONE_THREAD | CLONE_VM)) {
2057 if (nsp->time_ns != nsp->time_ns_for_children)
2058 return ERR_PTR(-EINVAL);
2061 if (clone_flags & CLONE_PIDFD) {
2063 * - CLONE_DETACHED is blocked so that we can potentially
2064 * reuse it later for CLONE_PIDFD.
2065 * - CLONE_THREAD is blocked until someone really needs it.
2067 if (clone_flags & (CLONE_DETACHED | CLONE_THREAD))
2068 return ERR_PTR(-EINVAL);
2072 * Force any signals received before this point to be delivered
2073 * before the fork happens. Collect up signals sent to multiple
2074 * processes that happen during the fork and delay them so that
2075 * they appear to happen after the fork.
2077 sigemptyset(&delayed.signal);
2078 INIT_HLIST_NODE(&delayed.node);
2080 spin_lock_irq(¤t->sighand->siglock);
2081 if (!(clone_flags & CLONE_THREAD))
2082 hlist_add_head(&delayed.node, ¤t->signal->multiprocess);
2083 recalc_sigpending();
2084 spin_unlock_irq(¤t->sighand->siglock);
2085 retval = -ERESTARTNOINTR;
2086 if (task_sigpending(current))
2090 p = dup_task_struct(current, node);
2093 p->flags &= ~PF_KTHREAD;
2095 p->flags |= PF_KTHREAD;
2096 if (args->io_thread) {
2098 * Mark us an IO worker, and block any signal that isn't
2101 p->flags |= PF_IO_WORKER;
2102 siginitsetinv(&p->blocked, sigmask(SIGKILL)|sigmask(SIGSTOP));
2105 p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? args->child_tid : NULL;
2107 * Clear TID on mm_release()?
2109 p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? args->child_tid : NULL;
2111 ftrace_graph_init_task(p);
2113 rt_mutex_init_task(p);
2115 lockdep_assert_irqs_enabled();
2116 #ifdef CONFIG_PROVE_LOCKING
2117 DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
2119 retval = copy_creds(p, clone_flags);
2124 if (is_rlimit_overlimit(task_ucounts(p), UCOUNT_RLIMIT_NPROC, rlimit(RLIMIT_NPROC))) {
2125 if (p->real_cred->user != INIT_USER &&
2126 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN))
2127 goto bad_fork_cleanup_count;
2129 current->flags &= ~PF_NPROC_EXCEEDED;
2132 * If multiple threads are within copy_process(), then this check
2133 * triggers too late. This doesn't hurt, the check is only there
2134 * to stop root fork bombs.
2137 if (data_race(nr_threads >= max_threads))
2138 goto bad_fork_cleanup_count;
2140 delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
2141 p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER | PF_IDLE | PF_NO_SETAFFINITY);
2142 p->flags |= PF_FORKNOEXEC;
2143 INIT_LIST_HEAD(&p->children);
2144 INIT_LIST_HEAD(&p->sibling);
2145 rcu_copy_process(p);
2146 p->vfork_done = NULL;
2147 spin_lock_init(&p->alloc_lock);
2149 init_sigpending(&p->pending);
2151 p->utime = p->stime = p->gtime = 0;
2152 #ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME
2153 p->utimescaled = p->stimescaled = 0;
2155 prev_cputime_init(&p->prev_cputime);
2157 #ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN
2158 seqcount_init(&p->vtime.seqcount);
2159 p->vtime.starttime = 0;
2160 p->vtime.state = VTIME_INACTIVE;
2163 #ifdef CONFIG_IO_URING
2167 #if defined(SPLIT_RSS_COUNTING)
2168 memset(&p->rss_stat, 0, sizeof(p->rss_stat));
2171 p->default_timer_slack_ns = current->timer_slack_ns;
2177 task_io_accounting_init(&p->ioac);
2178 acct_clear_integrals(p);
2180 posix_cputimers_init(&p->posix_cputimers);
2182 p->io_context = NULL;
2183 audit_set_context(p, NULL);
2185 if (args->kthread) {
2186 if (!set_kthread_struct(p))
2187 goto bad_fork_cleanup_delayacct;
2190 p->mempolicy = mpol_dup(p->mempolicy);
2191 if (IS_ERR(p->mempolicy)) {
2192 retval = PTR_ERR(p->mempolicy);
2193 p->mempolicy = NULL;
2194 goto bad_fork_cleanup_delayacct;
2197 #ifdef CONFIG_CPUSETS
2198 p->cpuset_mem_spread_rotor = NUMA_NO_NODE;
2199 p->cpuset_slab_spread_rotor = NUMA_NO_NODE;
2200 seqcount_spinlock_init(&p->mems_allowed_seq, &p->alloc_lock);
2202 #ifdef CONFIG_TRACE_IRQFLAGS
2203 memset(&p->irqtrace, 0, sizeof(p->irqtrace));
2204 p->irqtrace.hardirq_disable_ip = _THIS_IP_;
2205 p->irqtrace.softirq_enable_ip = _THIS_IP_;
2206 p->softirqs_enabled = 1;
2207 p->softirq_context = 0;
2210 p->pagefault_disabled = 0;
2212 #ifdef CONFIG_LOCKDEP
2213 lockdep_init_task(p);
2216 #ifdef CONFIG_DEBUG_MUTEXES
2217 p->blocked_on = NULL; /* not blocked yet */
2219 #ifdef CONFIG_BCACHE
2220 p->sequential_io = 0;
2221 p->sequential_io_avg = 0;
2223 #ifdef CONFIG_BPF_SYSCALL
2224 RCU_INIT_POINTER(p->bpf_storage, NULL);
2228 /* Perform scheduler related setup. Assign this task to a CPU. */
2229 retval = sched_fork(clone_flags, p);
2231 goto bad_fork_cleanup_policy;
2233 retval = perf_event_init_task(p, clone_flags);
2235 goto bad_fork_cleanup_policy;
2236 retval = audit_alloc(p);
2238 goto bad_fork_cleanup_perf;
2239 /* copy all the process information */
2241 retval = security_task_alloc(p, clone_flags);
2243 goto bad_fork_cleanup_audit;
2244 retval = copy_semundo(clone_flags, p);
2246 goto bad_fork_cleanup_security;
2247 retval = copy_files(clone_flags, p);
2249 goto bad_fork_cleanup_semundo;
2250 retval = copy_fs(clone_flags, p);
2252 goto bad_fork_cleanup_files;
2253 retval = copy_sighand(clone_flags, p);
2255 goto bad_fork_cleanup_fs;
2256 retval = copy_signal(clone_flags, p);
2258 goto bad_fork_cleanup_sighand;
2259 retval = copy_mm(clone_flags, p);
2261 goto bad_fork_cleanup_signal;
2262 retval = copy_namespaces(clone_flags, p);
2264 goto bad_fork_cleanup_mm;
2265 retval = copy_io(clone_flags, p);
2267 goto bad_fork_cleanup_namespaces;
2268 retval = copy_thread(p, args);
2270 goto bad_fork_cleanup_io;
2272 stackleak_task_init(p);
2274 if (pid != &init_struct_pid) {
2275 pid = alloc_pid(p->nsproxy->pid_ns_for_children, args->set_tid,
2276 args->set_tid_size);
2278 retval = PTR_ERR(pid);
2279 goto bad_fork_cleanup_thread;
2284 * This has to happen after we've potentially unshared the file
2285 * descriptor table (so that the pidfd doesn't leak into the child
2286 * if the fd table isn't shared).
2288 if (clone_flags & CLONE_PIDFD) {
2289 retval = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
2291 goto bad_fork_free_pid;
2295 pidfile = anon_inode_getfile("[pidfd]", &pidfd_fops, pid,
2296 O_RDWR | O_CLOEXEC);
2297 if (IS_ERR(pidfile)) {
2298 put_unused_fd(pidfd);
2299 retval = PTR_ERR(pidfile);
2300 goto bad_fork_free_pid;
2302 get_pid(pid); /* held by pidfile now */
2304 retval = put_user(pidfd, args->pidfd);
2306 goto bad_fork_put_pidfd;
2315 * sigaltstack should be cleared when sharing the same VM
2317 if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
2321 * Syscall tracing and stepping should be turned off in the
2322 * child regardless of CLONE_PTRACE.
2324 user_disable_single_step(p);
2325 clear_task_syscall_work(p, SYSCALL_TRACE);
2326 #if defined(CONFIG_GENERIC_ENTRY) || defined(TIF_SYSCALL_EMU)
2327 clear_task_syscall_work(p, SYSCALL_EMU);
2329 clear_tsk_latency_tracing(p);
2331 /* ok, now we should be set up.. */
2332 p->pid = pid_nr(pid);
2333 if (clone_flags & CLONE_THREAD) {
2334 p->group_leader = current->group_leader;
2335 p->tgid = current->tgid;
2337 p->group_leader = p;
2342 p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10);
2343 p->dirty_paused_when = 0;
2345 p->pdeath_signal = 0;
2346 INIT_LIST_HEAD(&p->thread_group);
2347 p->task_works = NULL;
2348 clear_posix_cputimers_work(p);
2350 #ifdef CONFIG_KRETPROBES
2351 p->kretprobe_instances.first = NULL;
2353 #ifdef CONFIG_RETHOOK
2354 p->rethooks.first = NULL;
2358 * Ensure that the cgroup subsystem policies allow the new process to be
2359 * forked. It should be noted that the new process's css_set can be changed
2360 * between here and cgroup_post_fork() if an organisation operation is in
2363 retval = cgroup_can_fork(p, args);
2365 goto bad_fork_put_pidfd;
2368 * Now that the cgroups are pinned, re-clone the parent cgroup and put
2369 * the new task on the correct runqueue. All this *before* the task
2372 * This isn't part of ->can_fork() because while the re-cloning is
2373 * cgroup specific, it unconditionally needs to place the task on a
2376 sched_cgroup_fork(p, args);
2379 * From this point on we must avoid any synchronous user-space
2380 * communication until we take the tasklist-lock. In particular, we do
2381 * not want user-space to be able to predict the process start-time by
2382 * stalling fork(2) after we recorded the start_time but before it is
2383 * visible to the system.
2386 p->start_time = ktime_get_ns();
2387 p->start_boottime = ktime_get_boottime_ns();
2390 * Make it visible to the rest of the system, but dont wake it up yet.
2391 * Need tasklist lock for parent etc handling!
2393 write_lock_irq(&tasklist_lock);
2395 /* CLONE_PARENT re-uses the old parent */
2396 if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) {
2397 p->real_parent = current->real_parent;
2398 p->parent_exec_id = current->parent_exec_id;
2399 if (clone_flags & CLONE_THREAD)
2400 p->exit_signal = -1;
2402 p->exit_signal = current->group_leader->exit_signal;
2404 p->real_parent = current;
2405 p->parent_exec_id = current->self_exec_id;
2406 p->exit_signal = args->exit_signal;
2409 klp_copy_process(p);
2413 spin_lock(¤t->sighand->siglock);
2417 rseq_fork(p, clone_flags);
2419 /* Don't start children in a dying pid namespace */
2420 if (unlikely(!(ns_of_pid(pid)->pid_allocated & PIDNS_ADDING))) {
2422 goto bad_fork_cancel_cgroup;
2425 /* Let kill terminate clone/fork in the middle */
2426 if (fatal_signal_pending(current)) {
2428 goto bad_fork_cancel_cgroup;
2431 /* No more failure paths after this point. */
2434 * Copy seccomp details explicitly here, in case they were changed
2435 * before holding sighand lock.
2439 init_task_pid_links(p);
2440 if (likely(p->pid)) {
2441 ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace);
2443 init_task_pid(p, PIDTYPE_PID, pid);
2444 if (thread_group_leader(p)) {
2445 init_task_pid(p, PIDTYPE_TGID, pid);
2446 init_task_pid(p, PIDTYPE_PGID, task_pgrp(current));
2447 init_task_pid(p, PIDTYPE_SID, task_session(current));
2449 if (is_child_reaper(pid)) {
2450 ns_of_pid(pid)->child_reaper = p;
2451 p->signal->flags |= SIGNAL_UNKILLABLE;
2453 p->signal->shared_pending.signal = delayed.signal;
2454 p->signal->tty = tty_kref_get(current->signal->tty);
2456 * Inherit has_child_subreaper flag under the same
2457 * tasklist_lock with adding child to the process tree
2458 * for propagate_has_child_subreaper optimization.
2460 p->signal->has_child_subreaper = p->real_parent->signal->has_child_subreaper ||
2461 p->real_parent->signal->is_child_subreaper;
2462 list_add_tail(&p->sibling, &p->real_parent->children);
2463 list_add_tail_rcu(&p->tasks, &init_task.tasks);
2464 attach_pid(p, PIDTYPE_TGID);
2465 attach_pid(p, PIDTYPE_PGID);
2466 attach_pid(p, PIDTYPE_SID);
2467 __this_cpu_inc(process_counts);
2469 current->signal->nr_threads++;
2470 current->signal->quick_threads++;
2471 atomic_inc(¤t->signal->live);
2472 refcount_inc(¤t->signal->sigcnt);
2473 task_join_group_stop(p);
2474 list_add_tail_rcu(&p->thread_group,
2475 &p->group_leader->thread_group);
2476 list_add_tail_rcu(&p->thread_node,
2477 &p->signal->thread_head);
2479 attach_pid(p, PIDTYPE_PID);
2483 hlist_del_init(&delayed.node);
2484 spin_unlock(¤t->sighand->siglock);
2485 syscall_tracepoint_update(p);
2486 write_unlock_irq(&tasklist_lock);
2489 fd_install(pidfd, pidfile);
2491 proc_fork_connector(p);
2493 cgroup_post_fork(p, args);
2496 trace_task_newtask(p, clone_flags);
2497 uprobe_copy_process(p, clone_flags);
2499 copy_oom_score_adj(clone_flags, p);
2503 bad_fork_cancel_cgroup:
2505 spin_unlock(¤t->sighand->siglock);
2506 write_unlock_irq(&tasklist_lock);
2507 cgroup_cancel_fork(p, args);
2509 if (clone_flags & CLONE_PIDFD) {
2511 put_unused_fd(pidfd);
2514 if (pid != &init_struct_pid)
2516 bad_fork_cleanup_thread:
2518 bad_fork_cleanup_io:
2521 bad_fork_cleanup_namespaces:
2522 exit_task_namespaces(p);
2523 bad_fork_cleanup_mm:
2525 mm_clear_owner(p->mm, p);
2528 bad_fork_cleanup_signal:
2529 if (!(clone_flags & CLONE_THREAD))
2530 free_signal_struct(p->signal);
2531 bad_fork_cleanup_sighand:
2532 __cleanup_sighand(p->sighand);
2533 bad_fork_cleanup_fs:
2534 exit_fs(p); /* blocking */
2535 bad_fork_cleanup_files:
2536 exit_files(p); /* blocking */
2537 bad_fork_cleanup_semundo:
2539 bad_fork_cleanup_security:
2540 security_task_free(p);
2541 bad_fork_cleanup_audit:
2543 bad_fork_cleanup_perf:
2544 perf_event_free_task(p);
2545 bad_fork_cleanup_policy:
2546 lockdep_free_task(p);
2548 mpol_put(p->mempolicy);
2550 bad_fork_cleanup_delayacct:
2551 delayacct_tsk_free(p);
2552 bad_fork_cleanup_count:
2553 dec_rlimit_ucounts(task_ucounts(p), UCOUNT_RLIMIT_NPROC, 1);
2556 WRITE_ONCE(p->__state, TASK_DEAD);
2557 exit_task_stack_account(p);
2559 delayed_free_task(p);
2561 spin_lock_irq(¤t->sighand->siglock);
2562 hlist_del_init(&delayed.node);
2563 spin_unlock_irq(¤t->sighand->siglock);
2564 return ERR_PTR(retval);
2567 static inline void init_idle_pids(struct task_struct *idle)
2571 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
2572 INIT_HLIST_NODE(&idle->pid_links[type]); /* not really needed */
2573 init_task_pid(idle, type, &init_struct_pid);
2577 static int idle_dummy(void *dummy)
2579 /* This function is never called */
2583 struct task_struct * __init fork_idle(int cpu)
2585 struct task_struct *task;
2586 struct kernel_clone_args args = {
2594 task = copy_process(&init_struct_pid, 0, cpu_to_node(cpu), &args);
2595 if (!IS_ERR(task)) {
2596 init_idle_pids(task);
2597 init_idle(task, cpu);
2604 * This is like kernel_clone(), but shaved down and tailored to just
2605 * creating io_uring workers. It returns a created task, or an error pointer.
2606 * The returned task is inactive, and the caller must fire it up through
2607 * wake_up_new_task(p). All signals are blocked in the created task.
2609 struct task_struct *create_io_thread(int (*fn)(void *), void *arg, int node)
2611 unsigned long flags = CLONE_FS|CLONE_FILES|CLONE_SIGHAND|CLONE_THREAD|
2613 struct kernel_clone_args args = {
2614 .flags = ((lower_32_bits(flags) | CLONE_VM |
2615 CLONE_UNTRACED) & ~CSIGNAL),
2616 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2622 return copy_process(NULL, 0, node, &args);
2626 * Ok, this is the main fork-routine.
2628 * It copies the process, and if successful kick-starts
2629 * it and waits for it to finish using the VM if required.
2631 * args->exit_signal is expected to be checked for sanity by the caller.
2633 pid_t kernel_clone(struct kernel_clone_args *args)
2635 u64 clone_flags = args->flags;
2636 struct completion vfork;
2638 struct task_struct *p;
2643 * For legacy clone() calls, CLONE_PIDFD uses the parent_tid argument
2644 * to return the pidfd. Hence, CLONE_PIDFD and CLONE_PARENT_SETTID are
2645 * mutually exclusive. With clone3() CLONE_PIDFD has grown a separate
2646 * field in struct clone_args and it still doesn't make sense to have
2647 * them both point at the same memory location. Performing this check
2648 * here has the advantage that we don't need to have a separate helper
2649 * to check for legacy clone().
2651 if ((args->flags & CLONE_PIDFD) &&
2652 (args->flags & CLONE_PARENT_SETTID) &&
2653 (args->pidfd == args->parent_tid))
2657 * Determine whether and which event to report to ptracer. When
2658 * called from kernel_thread or CLONE_UNTRACED is explicitly
2659 * requested, no event is reported; otherwise, report if the event
2660 * for the type of forking is enabled.
2662 if (!(clone_flags & CLONE_UNTRACED)) {
2663 if (clone_flags & CLONE_VFORK)
2664 trace = PTRACE_EVENT_VFORK;
2665 else if (args->exit_signal != SIGCHLD)
2666 trace = PTRACE_EVENT_CLONE;
2668 trace = PTRACE_EVENT_FORK;
2670 if (likely(!ptrace_event_enabled(current, trace)))
2674 p = copy_process(NULL, trace, NUMA_NO_NODE, args);
2675 add_latent_entropy();
2681 * Do this prior waking up the new thread - the thread pointer
2682 * might get invalid after that point, if the thread exits quickly.
2684 trace_sched_process_fork(current, p);
2686 pid = get_task_pid(p, PIDTYPE_PID);
2689 if (clone_flags & CLONE_PARENT_SETTID)
2690 put_user(nr, args->parent_tid);
2692 if (clone_flags & CLONE_VFORK) {
2693 p->vfork_done = &vfork;
2694 init_completion(&vfork);
2698 if (IS_ENABLED(CONFIG_LRU_GEN) && !(clone_flags & CLONE_VM)) {
2699 /* lock the task to synchronize with memcg migration */
2701 lru_gen_add_mm(p->mm);
2705 wake_up_new_task(p);
2707 /* forking complete and child started to run, tell ptracer */
2708 if (unlikely(trace))
2709 ptrace_event_pid(trace, pid);
2711 if (clone_flags & CLONE_VFORK) {
2712 if (!wait_for_vfork_done(p, &vfork))
2713 ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid);
2721 * Create a kernel thread.
2723 pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
2725 struct kernel_clone_args args = {
2726 .flags = ((lower_32_bits(flags) | CLONE_VM |
2727 CLONE_UNTRACED) & ~CSIGNAL),
2728 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2734 return kernel_clone(&args);
2738 * Create a user mode thread.
2740 pid_t user_mode_thread(int (*fn)(void *), void *arg, unsigned long flags)
2742 struct kernel_clone_args args = {
2743 .flags = ((lower_32_bits(flags) | CLONE_VM |
2744 CLONE_UNTRACED) & ~CSIGNAL),
2745 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2750 return kernel_clone(&args);
2753 #ifdef __ARCH_WANT_SYS_FORK
2754 SYSCALL_DEFINE0(fork)
2757 struct kernel_clone_args args = {
2758 .exit_signal = SIGCHLD,
2761 return kernel_clone(&args);
2763 /* can not support in nommu mode */
2769 #ifdef __ARCH_WANT_SYS_VFORK
2770 SYSCALL_DEFINE0(vfork)
2772 struct kernel_clone_args args = {
2773 .flags = CLONE_VFORK | CLONE_VM,
2774 .exit_signal = SIGCHLD,
2777 return kernel_clone(&args);
2781 #ifdef __ARCH_WANT_SYS_CLONE
2782 #ifdef CONFIG_CLONE_BACKWARDS
2783 SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2784 int __user *, parent_tidptr,
2786 int __user *, child_tidptr)
2787 #elif defined(CONFIG_CLONE_BACKWARDS2)
2788 SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags,
2789 int __user *, parent_tidptr,
2790 int __user *, child_tidptr,
2792 #elif defined(CONFIG_CLONE_BACKWARDS3)
2793 SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp,
2795 int __user *, parent_tidptr,
2796 int __user *, child_tidptr,
2799 SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2800 int __user *, parent_tidptr,
2801 int __user *, child_tidptr,
2805 struct kernel_clone_args args = {
2806 .flags = (lower_32_bits(clone_flags) & ~CSIGNAL),
2807 .pidfd = parent_tidptr,
2808 .child_tid = child_tidptr,
2809 .parent_tid = parent_tidptr,
2810 .exit_signal = (lower_32_bits(clone_flags) & CSIGNAL),
2815 return kernel_clone(&args);
2819 #ifdef __ARCH_WANT_SYS_CLONE3
2821 noinline static int copy_clone_args_from_user(struct kernel_clone_args *kargs,
2822 struct clone_args __user *uargs,
2826 struct clone_args args;
2827 pid_t *kset_tid = kargs->set_tid;
2829 BUILD_BUG_ON(offsetofend(struct clone_args, tls) !=
2830 CLONE_ARGS_SIZE_VER0);
2831 BUILD_BUG_ON(offsetofend(struct clone_args, set_tid_size) !=
2832 CLONE_ARGS_SIZE_VER1);
2833 BUILD_BUG_ON(offsetofend(struct clone_args, cgroup) !=
2834 CLONE_ARGS_SIZE_VER2);
2835 BUILD_BUG_ON(sizeof(struct clone_args) != CLONE_ARGS_SIZE_VER2);
2837 if (unlikely(usize > PAGE_SIZE))
2839 if (unlikely(usize < CLONE_ARGS_SIZE_VER0))
2842 err = copy_struct_from_user(&args, sizeof(args), uargs, usize);
2846 if (unlikely(args.set_tid_size > MAX_PID_NS_LEVEL))
2849 if (unlikely(!args.set_tid && args.set_tid_size > 0))
2852 if (unlikely(args.set_tid && args.set_tid_size == 0))
2856 * Verify that higher 32bits of exit_signal are unset and that
2857 * it is a valid signal
2859 if (unlikely((args.exit_signal & ~((u64)CSIGNAL)) ||
2860 !valid_signal(args.exit_signal)))
2863 if ((args.flags & CLONE_INTO_CGROUP) &&
2864 (args.cgroup > INT_MAX || usize < CLONE_ARGS_SIZE_VER2))
2867 *kargs = (struct kernel_clone_args){
2868 .flags = args.flags,
2869 .pidfd = u64_to_user_ptr(args.pidfd),
2870 .child_tid = u64_to_user_ptr(args.child_tid),
2871 .parent_tid = u64_to_user_ptr(args.parent_tid),
2872 .exit_signal = args.exit_signal,
2873 .stack = args.stack,
2874 .stack_size = args.stack_size,
2876 .set_tid_size = args.set_tid_size,
2877 .cgroup = args.cgroup,
2881 copy_from_user(kset_tid, u64_to_user_ptr(args.set_tid),
2882 (kargs->set_tid_size * sizeof(pid_t))))
2885 kargs->set_tid = kset_tid;
2891 * clone3_stack_valid - check and prepare stack
2892 * @kargs: kernel clone args
2894 * Verify that the stack arguments userspace gave us are sane.
2895 * In addition, set the stack direction for userspace since it's easy for us to
2898 static inline bool clone3_stack_valid(struct kernel_clone_args *kargs)
2900 if (kargs->stack == 0) {
2901 if (kargs->stack_size > 0)
2904 if (kargs->stack_size == 0)
2907 if (!access_ok((void __user *)kargs->stack, kargs->stack_size))
2910 #if !defined(CONFIG_STACK_GROWSUP) && !defined(CONFIG_IA64)
2911 kargs->stack += kargs->stack_size;
2918 static bool clone3_args_valid(struct kernel_clone_args *kargs)
2920 /* Verify that no unknown flags are passed along. */
2922 ~(CLONE_LEGACY_FLAGS | CLONE_CLEAR_SIGHAND | CLONE_INTO_CGROUP))
2926 * - make the CLONE_DETACHED bit reusable for clone3
2927 * - make the CSIGNAL bits reusable for clone3
2929 if (kargs->flags & (CLONE_DETACHED | (CSIGNAL & (~CLONE_NEWTIME))))
2932 if ((kargs->flags & (CLONE_SIGHAND | CLONE_CLEAR_SIGHAND)) ==
2933 (CLONE_SIGHAND | CLONE_CLEAR_SIGHAND))
2936 if ((kargs->flags & (CLONE_THREAD | CLONE_PARENT)) &&
2940 if (!clone3_stack_valid(kargs))
2947 * clone3 - create a new process with specific properties
2948 * @uargs: argument structure
2949 * @size: size of @uargs
2951 * clone3() is the extensible successor to clone()/clone2().
2952 * It takes a struct as argument that is versioned by its size.
2954 * Return: On success, a positive PID for the child process.
2955 * On error, a negative errno number.
2957 SYSCALL_DEFINE2(clone3, struct clone_args __user *, uargs, size_t, size)
2961 struct kernel_clone_args kargs;
2962 pid_t set_tid[MAX_PID_NS_LEVEL];
2964 kargs.set_tid = set_tid;
2966 err = copy_clone_args_from_user(&kargs, uargs, size);
2970 if (!clone3_args_valid(&kargs))
2973 return kernel_clone(&kargs);
2977 void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data)
2979 struct task_struct *leader, *parent, *child;
2982 read_lock(&tasklist_lock);
2983 leader = top = top->group_leader;
2985 for_each_thread(leader, parent) {
2986 list_for_each_entry(child, &parent->children, sibling) {
2987 res = visitor(child, data);
2999 if (leader != top) {
3001 parent = child->real_parent;
3002 leader = parent->group_leader;
3006 read_unlock(&tasklist_lock);
3009 #ifndef ARCH_MIN_MMSTRUCT_ALIGN
3010 #define ARCH_MIN_MMSTRUCT_ALIGN 0
3013 static void sighand_ctor(void *data)
3015 struct sighand_struct *sighand = data;
3017 spin_lock_init(&sighand->siglock);
3018 init_waitqueue_head(&sighand->signalfd_wqh);
3021 void __init mm_cache_init(void)
3023 unsigned int mm_size;
3026 * The mm_cpumask is located at the end of mm_struct, and is
3027 * dynamically sized based on the maximum CPU number this system
3028 * can have, taking hotplug into account (nr_cpu_ids).
3030 mm_size = sizeof(struct mm_struct) + cpumask_size();
3032 mm_cachep = kmem_cache_create_usercopy("mm_struct",
3033 mm_size, ARCH_MIN_MMSTRUCT_ALIGN,
3034 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3035 offsetof(struct mm_struct, saved_auxv),
3036 sizeof_field(struct mm_struct, saved_auxv),
3040 void __init proc_caches_init(void)
3042 sighand_cachep = kmem_cache_create("sighand_cache",
3043 sizeof(struct sighand_struct), 0,
3044 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_TYPESAFE_BY_RCU|
3045 SLAB_ACCOUNT, sighand_ctor);
3046 signal_cachep = kmem_cache_create("signal_cache",
3047 sizeof(struct signal_struct), 0,
3048 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3050 files_cachep = kmem_cache_create("files_cache",
3051 sizeof(struct files_struct), 0,
3052 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3054 fs_cachep = kmem_cache_create("fs_cache",
3055 sizeof(struct fs_struct), 0,
3056 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3059 vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT);
3061 nsproxy_cache_init();
3065 * Check constraints on flags passed to the unshare system call.
3067 static int check_unshare_flags(unsigned long unshare_flags)
3069 if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
3070 CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
3071 CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET|
3072 CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP|
3076 * Not implemented, but pretend it works if there is nothing
3077 * to unshare. Note that unsharing the address space or the
3078 * signal handlers also need to unshare the signal queues (aka
3081 if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) {
3082 if (!thread_group_empty(current))
3085 if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) {
3086 if (refcount_read(¤t->sighand->count) > 1)
3089 if (unshare_flags & CLONE_VM) {
3090 if (!current_is_single_threaded())
3098 * Unshare the filesystem structure if it is being shared
3100 static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
3102 struct fs_struct *fs = current->fs;
3104 if (!(unshare_flags & CLONE_FS) || !fs)
3107 /* don't need lock here; in the worst case we'll do useless copy */
3111 *new_fsp = copy_fs_struct(fs);
3119 * Unshare file descriptor table if it is being shared
3121 int unshare_fd(unsigned long unshare_flags, unsigned int max_fds,
3122 struct files_struct **new_fdp)
3124 struct files_struct *fd = current->files;
3127 if ((unshare_flags & CLONE_FILES) &&
3128 (fd && atomic_read(&fd->count) > 1)) {
3129 *new_fdp = dup_fd(fd, max_fds, &error);
3138 * unshare allows a process to 'unshare' part of the process
3139 * context which was originally shared using clone. copy_*
3140 * functions used by kernel_clone() cannot be used here directly
3141 * because they modify an inactive task_struct that is being
3142 * constructed. Here we are modifying the current, active,
3145 int ksys_unshare(unsigned long unshare_flags)
3147 struct fs_struct *fs, *new_fs = NULL;
3148 struct files_struct *new_fd = NULL;
3149 struct cred *new_cred = NULL;
3150 struct nsproxy *new_nsproxy = NULL;
3155 * If unsharing a user namespace must also unshare the thread group
3156 * and unshare the filesystem root and working directories.
3158 if (unshare_flags & CLONE_NEWUSER)
3159 unshare_flags |= CLONE_THREAD | CLONE_FS;
3161 * If unsharing vm, must also unshare signal handlers.
3163 if (unshare_flags & CLONE_VM)
3164 unshare_flags |= CLONE_SIGHAND;
3166 * If unsharing a signal handlers, must also unshare the signal queues.
3168 if (unshare_flags & CLONE_SIGHAND)
3169 unshare_flags |= CLONE_THREAD;
3171 * If unsharing namespace, must also unshare filesystem information.
3173 if (unshare_flags & CLONE_NEWNS)
3174 unshare_flags |= CLONE_FS;
3176 err = check_unshare_flags(unshare_flags);
3178 goto bad_unshare_out;
3180 * CLONE_NEWIPC must also detach from the undolist: after switching
3181 * to a new ipc namespace, the semaphore arrays from the old
3182 * namespace are unreachable.
3184 if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM))
3186 err = unshare_fs(unshare_flags, &new_fs);
3188 goto bad_unshare_out;
3189 err = unshare_fd(unshare_flags, NR_OPEN_MAX, &new_fd);
3191 goto bad_unshare_cleanup_fs;
3192 err = unshare_userns(unshare_flags, &new_cred);
3194 goto bad_unshare_cleanup_fd;
3195 err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy,
3198 goto bad_unshare_cleanup_cred;
3201 err = set_cred_ucounts(new_cred);
3203 goto bad_unshare_cleanup_cred;
3206 if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) {
3209 * CLONE_SYSVSEM is equivalent to sys_exit().
3213 if (unshare_flags & CLONE_NEWIPC) {
3214 /* Orphan segments in old ns (see sem above). */
3216 shm_init_task(current);
3220 switch_task_namespaces(current, new_nsproxy);
3226 spin_lock(&fs->lock);
3227 current->fs = new_fs;
3232 spin_unlock(&fs->lock);
3236 swap(current->files, new_fd);
3238 task_unlock(current);
3241 /* Install the new user namespace */
3242 commit_creds(new_cred);
3247 perf_event_namespaces(current);
3249 bad_unshare_cleanup_cred:
3252 bad_unshare_cleanup_fd:
3254 put_files_struct(new_fd);
3256 bad_unshare_cleanup_fs:
3258 free_fs_struct(new_fs);
3264 SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags)
3266 return ksys_unshare(unshare_flags);
3270 * Helper to unshare the files of the current task.
3271 * We don't want to expose copy_files internals to
3272 * the exec layer of the kernel.
3275 int unshare_files(void)
3277 struct task_struct *task = current;
3278 struct files_struct *old, *copy = NULL;
3281 error = unshare_fd(CLONE_FILES, NR_OPEN_MAX, ©);
3289 put_files_struct(old);
3293 int sysctl_max_threads(struct ctl_table *table, int write,
3294 void *buffer, size_t *lenp, loff_t *ppos)
3298 int threads = max_threads;
3300 int max = MAX_THREADS;
3307 ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
3311 max_threads = threads;