Loading...
1/*
2 * linux/kernel/fork.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
6
7/*
8 * 'fork.c' contains the help-routines for the 'fork' system call
9 * (see also entry.S and others).
10 * Fork is rather simple, once you get the hang of it, but the memory
11 * management can be a bitch. See 'mm/memory.c': 'copy_page_range()'
12 */
13
14#include <linux/slab.h>
15#include <linux/sched/autogroup.h>
16#include <linux/sched/mm.h>
17#include <linux/sched/coredump.h>
18#include <linux/sched/user.h>
19#include <linux/sched/numa_balancing.h>
20#include <linux/sched/stat.h>
21#include <linux/sched/task.h>
22#include <linux/sched/task_stack.h>
23#include <linux/sched/cputime.h>
24#include <linux/rtmutex.h>
25#include <linux/init.h>
26#include <linux/unistd.h>
27#include <linux/module.h>
28#include <linux/vmalloc.h>
29#include <linux/completion.h>
30#include <linux/personality.h>
31#include <linux/mempolicy.h>
32#include <linux/sem.h>
33#include <linux/file.h>
34#include <linux/fdtable.h>
35#include <linux/iocontext.h>
36#include <linux/key.h>
37#include <linux/binfmts.h>
38#include <linux/mman.h>
39#include <linux/mmu_notifier.h>
40#include <linux/hmm.h>
41#include <linux/fs.h>
42#include <linux/mm.h>
43#include <linux/vmacache.h>
44#include <linux/nsproxy.h>
45#include <linux/capability.h>
46#include <linux/cpu.h>
47#include <linux/cgroup.h>
48#include <linux/security.h>
49#include <linux/hugetlb.h>
50#include <linux/seccomp.h>
51#include <linux/swap.h>
52#include <linux/syscalls.h>
53#include <linux/jiffies.h>
54#include <linux/futex.h>
55#include <linux/compat.h>
56#include <linux/kthread.h>
57#include <linux/task_io_accounting_ops.h>
58#include <linux/rcupdate.h>
59#include <linux/ptrace.h>
60#include <linux/mount.h>
61#include <linux/audit.h>
62#include <linux/memcontrol.h>
63#include <linux/ftrace.h>
64#include <linux/proc_fs.h>
65#include <linux/profile.h>
66#include <linux/rmap.h>
67#include <linux/ksm.h>
68#include <linux/acct.h>
69#include <linux/userfaultfd_k.h>
70#include <linux/tsacct_kern.h>
71#include <linux/cn_proc.h>
72#include <linux/freezer.h>
73#include <linux/delayacct.h>
74#include <linux/taskstats_kern.h>
75#include <linux/random.h>
76#include <linux/tty.h>
77#include <linux/blkdev.h>
78#include <linux/fs_struct.h>
79#include <linux/magic.h>
80#include <linux/sched/mm.h>
81#include <linux/perf_event.h>
82#include <linux/posix-timers.h>
83#include <linux/user-return-notifier.h>
84#include <linux/oom.h>
85#include <linux/khugepaged.h>
86#include <linux/signalfd.h>
87#include <linux/uprobes.h>
88#include <linux/aio.h>
89#include <linux/compiler.h>
90#include <linux/sysctl.h>
91#include <linux/kcov.h>
92#include <linux/livepatch.h>
93#include <linux/thread_info.h>
94
95#include <asm/pgtable.h>
96#include <asm/pgalloc.h>
97#include <linux/uaccess.h>
98#include <asm/mmu_context.h>
99#include <asm/cacheflush.h>
100#include <asm/tlbflush.h>
101
102#include <trace/events/sched.h>
103
104#define CREATE_TRACE_POINTS
105#include <trace/events/task.h>
106
107/*
108 * Minimum number of threads to boot the kernel
109 */
110#define MIN_THREADS 20
111
112/*
113 * Maximum number of threads
114 */
115#define MAX_THREADS FUTEX_TID_MASK
116
117/*
118 * Protected counters by write_lock_irq(&tasklist_lock)
119 */
120unsigned long total_forks; /* Handle normal Linux uptimes. */
121int nr_threads; /* The idle threads do not count.. */
122
123int max_threads; /* tunable limit on nr_threads */
124
125DEFINE_PER_CPU(unsigned long, process_counts) = 0;
126
127__cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
128
129#ifdef CONFIG_PROVE_RCU
130int lockdep_tasklist_lock_is_held(void)
131{
132 return lockdep_is_held(&tasklist_lock);
133}
134EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held);
135#endif /* #ifdef CONFIG_PROVE_RCU */
136
137int nr_processes(void)
138{
139 int cpu;
140 int total = 0;
141
142 for_each_possible_cpu(cpu)
143 total += per_cpu(process_counts, cpu);
144
145 return total;
146}
147
148void __weak arch_release_task_struct(struct task_struct *tsk)
149{
150}
151
152#ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
153static struct kmem_cache *task_struct_cachep;
154
155static inline struct task_struct *alloc_task_struct_node(int node)
156{
157 return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
158}
159
160static inline void free_task_struct(struct task_struct *tsk)
161{
162 kmem_cache_free(task_struct_cachep, tsk);
163}
164#endif
165
166void __weak arch_release_thread_stack(unsigned long *stack)
167{
168}
169
170#ifndef CONFIG_ARCH_THREAD_STACK_ALLOCATOR
171
172/*
173 * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a
174 * kmemcache based allocator.
175 */
176# if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)
177
178#ifdef CONFIG_VMAP_STACK
179/*
180 * vmalloc() is a bit slow, and calling vfree() enough times will force a TLB
181 * flush. Try to minimize the number of calls by caching stacks.
182 */
183#define NR_CACHED_STACKS 2
184static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]);
185
186static int free_vm_stack_cache(unsigned int cpu)
187{
188 struct vm_struct **cached_vm_stacks = per_cpu_ptr(cached_stacks, cpu);
189 int i;
190
191 for (i = 0; i < NR_CACHED_STACKS; i++) {
192 struct vm_struct *vm_stack = cached_vm_stacks[i];
193
194 if (!vm_stack)
195 continue;
196
197 vfree(vm_stack->addr);
198 cached_vm_stacks[i] = NULL;
199 }
200
201 return 0;
202}
203#endif
204
205static unsigned long *alloc_thread_stack_node(struct task_struct *tsk, int node)
206{
207#ifdef CONFIG_VMAP_STACK
208 void *stack;
209 int i;
210
211 for (i = 0; i < NR_CACHED_STACKS; i++) {
212 struct vm_struct *s;
213
214 s = this_cpu_xchg(cached_stacks[i], NULL);
215
216 if (!s)
217 continue;
218
219 /* Clear stale pointers from reused stack. */
220 memset(s->addr, 0, THREAD_SIZE);
221
222 tsk->stack_vm_area = s;
223 return s->addr;
224 }
225
226 stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN,
227 VMALLOC_START, VMALLOC_END,
228 THREADINFO_GFP,
229 PAGE_KERNEL,
230 0, node, __builtin_return_address(0));
231
232 /*
233 * We can't call find_vm_area() in interrupt context, and
234 * free_thread_stack() can be called in interrupt context,
235 * so cache the vm_struct.
236 */
237 if (stack)
238 tsk->stack_vm_area = find_vm_area(stack);
239 return stack;
240#else
241 struct page *page = alloc_pages_node(node, THREADINFO_GFP,
242 THREAD_SIZE_ORDER);
243
244 return page ? page_address(page) : NULL;
245#endif
246}
247
248static inline void free_thread_stack(struct task_struct *tsk)
249{
250#ifdef CONFIG_VMAP_STACK
251 if (task_stack_vm_area(tsk)) {
252 int i;
253
254 for (i = 0; i < NR_CACHED_STACKS; i++) {
255 if (this_cpu_cmpxchg(cached_stacks[i],
256 NULL, tsk->stack_vm_area) != NULL)
257 continue;
258
259 return;
260 }
261
262 vfree_atomic(tsk->stack);
263 return;
264 }
265#endif
266
267 __free_pages(virt_to_page(tsk->stack), THREAD_SIZE_ORDER);
268}
269# else
270static struct kmem_cache *thread_stack_cache;
271
272static unsigned long *alloc_thread_stack_node(struct task_struct *tsk,
273 int node)
274{
275 return kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node);
276}
277
278static void free_thread_stack(struct task_struct *tsk)
279{
280 kmem_cache_free(thread_stack_cache, tsk->stack);
281}
282
283void thread_stack_cache_init(void)
284{
285 thread_stack_cache = kmem_cache_create_usercopy("thread_stack",
286 THREAD_SIZE, THREAD_SIZE, 0, 0,
287 THREAD_SIZE, NULL);
288 BUG_ON(thread_stack_cache == NULL);
289}
290# endif
291#endif
292
293/* SLAB cache for signal_struct structures (tsk->signal) */
294static struct kmem_cache *signal_cachep;
295
296/* SLAB cache for sighand_struct structures (tsk->sighand) */
297struct kmem_cache *sighand_cachep;
298
299/* SLAB cache for files_struct structures (tsk->files) */
300struct kmem_cache *files_cachep;
301
302/* SLAB cache for fs_struct structures (tsk->fs) */
303struct kmem_cache *fs_cachep;
304
305/* SLAB cache for vm_area_struct structures */
306struct kmem_cache *vm_area_cachep;
307
308/* SLAB cache for mm_struct structures (tsk->mm) */
309static struct kmem_cache *mm_cachep;
310
311static void account_kernel_stack(struct task_struct *tsk, int account)
312{
313 void *stack = task_stack_page(tsk);
314 struct vm_struct *vm = task_stack_vm_area(tsk);
315
316 BUILD_BUG_ON(IS_ENABLED(CONFIG_VMAP_STACK) && PAGE_SIZE % 1024 != 0);
317
318 if (vm) {
319 int i;
320
321 BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE);
322
323 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
324 mod_zone_page_state(page_zone(vm->pages[i]),
325 NR_KERNEL_STACK_KB,
326 PAGE_SIZE / 1024 * account);
327 }
328
329 /* All stack pages belong to the same memcg. */
330 mod_memcg_page_state(vm->pages[0], MEMCG_KERNEL_STACK_KB,
331 account * (THREAD_SIZE / 1024));
332 } else {
333 /*
334 * All stack pages are in the same zone and belong to the
335 * same memcg.
336 */
337 struct page *first_page = virt_to_page(stack);
338
339 mod_zone_page_state(page_zone(first_page), NR_KERNEL_STACK_KB,
340 THREAD_SIZE / 1024 * account);
341
342 mod_memcg_page_state(first_page, MEMCG_KERNEL_STACK_KB,
343 account * (THREAD_SIZE / 1024));
344 }
345}
346
347static void release_task_stack(struct task_struct *tsk)
348{
349 if (WARN_ON(tsk->state != TASK_DEAD))
350 return; /* Better to leak the stack than to free prematurely */
351
352 account_kernel_stack(tsk, -1);
353 arch_release_thread_stack(tsk->stack);
354 free_thread_stack(tsk);
355 tsk->stack = NULL;
356#ifdef CONFIG_VMAP_STACK
357 tsk->stack_vm_area = NULL;
358#endif
359}
360
361#ifdef CONFIG_THREAD_INFO_IN_TASK
362void put_task_stack(struct task_struct *tsk)
363{
364 if (atomic_dec_and_test(&tsk->stack_refcount))
365 release_task_stack(tsk);
366}
367#endif
368
369void free_task(struct task_struct *tsk)
370{
371#ifndef CONFIG_THREAD_INFO_IN_TASK
372 /*
373 * The task is finally done with both the stack and thread_info,
374 * so free both.
375 */
376 release_task_stack(tsk);
377#else
378 /*
379 * If the task had a separate stack allocation, it should be gone
380 * by now.
381 */
382 WARN_ON_ONCE(atomic_read(&tsk->stack_refcount) != 0);
383#endif
384 rt_mutex_debug_task_free(tsk);
385 ftrace_graph_exit_task(tsk);
386 put_seccomp_filter(tsk);
387 arch_release_task_struct(tsk);
388 if (tsk->flags & PF_KTHREAD)
389 free_kthread_struct(tsk);
390 free_task_struct(tsk);
391}
392EXPORT_SYMBOL(free_task);
393
394#ifdef CONFIG_MMU
395static __latent_entropy int dup_mmap(struct mm_struct *mm,
396 struct mm_struct *oldmm)
397{
398 struct vm_area_struct *mpnt, *tmp, *prev, **pprev;
399 struct rb_node **rb_link, *rb_parent;
400 int retval;
401 unsigned long charge;
402 LIST_HEAD(uf);
403
404 uprobe_start_dup_mmap();
405 if (down_write_killable(&oldmm->mmap_sem)) {
406 retval = -EINTR;
407 goto fail_uprobe_end;
408 }
409 flush_cache_dup_mm(oldmm);
410 uprobe_dup_mmap(oldmm, mm);
411 /*
412 * Not linked in yet - no deadlock potential:
413 */
414 down_write_nested(&mm->mmap_sem, SINGLE_DEPTH_NESTING);
415
416 /* No ordering required: file already has been exposed. */
417 RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
418
419 mm->total_vm = oldmm->total_vm;
420 mm->data_vm = oldmm->data_vm;
421 mm->exec_vm = oldmm->exec_vm;
422 mm->stack_vm = oldmm->stack_vm;
423
424 rb_link = &mm->mm_rb.rb_node;
425 rb_parent = NULL;
426 pprev = &mm->mmap;
427 retval = ksm_fork(mm, oldmm);
428 if (retval)
429 goto out;
430 retval = khugepaged_fork(mm, oldmm);
431 if (retval)
432 goto out;
433
434 prev = NULL;
435 for (mpnt = oldmm->mmap; mpnt; mpnt = mpnt->vm_next) {
436 struct file *file;
437
438 if (mpnt->vm_flags & VM_DONTCOPY) {
439 vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt));
440 continue;
441 }
442 charge = 0;
443 if (mpnt->vm_flags & VM_ACCOUNT) {
444 unsigned long len = vma_pages(mpnt);
445
446 if (security_vm_enough_memory_mm(oldmm, len)) /* sic */
447 goto fail_nomem;
448 charge = len;
449 }
450 tmp = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
451 if (!tmp)
452 goto fail_nomem;
453 *tmp = *mpnt;
454 INIT_LIST_HEAD(&tmp->anon_vma_chain);
455 retval = vma_dup_policy(mpnt, tmp);
456 if (retval)
457 goto fail_nomem_policy;
458 tmp->vm_mm = mm;
459 retval = dup_userfaultfd(tmp, &uf);
460 if (retval)
461 goto fail_nomem_anon_vma_fork;
462 if (tmp->vm_flags & VM_WIPEONFORK) {
463 /* VM_WIPEONFORK gets a clean slate in the child. */
464 tmp->anon_vma = NULL;
465 if (anon_vma_prepare(tmp))
466 goto fail_nomem_anon_vma_fork;
467 } else if (anon_vma_fork(tmp, mpnt))
468 goto fail_nomem_anon_vma_fork;
469 tmp->vm_flags &= ~(VM_LOCKED | VM_LOCKONFAULT);
470 tmp->vm_next = tmp->vm_prev = NULL;
471 file = tmp->vm_file;
472 if (file) {
473 struct inode *inode = file_inode(file);
474 struct address_space *mapping = file->f_mapping;
475
476 get_file(file);
477 if (tmp->vm_flags & VM_DENYWRITE)
478 atomic_dec(&inode->i_writecount);
479 i_mmap_lock_write(mapping);
480 if (tmp->vm_flags & VM_SHARED)
481 atomic_inc(&mapping->i_mmap_writable);
482 flush_dcache_mmap_lock(mapping);
483 /* insert tmp into the share list, just after mpnt */
484 vma_interval_tree_insert_after(tmp, mpnt,
485 &mapping->i_mmap);
486 flush_dcache_mmap_unlock(mapping);
487 i_mmap_unlock_write(mapping);
488 }
489
490 /*
491 * Clear hugetlb-related page reserves for children. This only
492 * affects MAP_PRIVATE mappings. Faults generated by the child
493 * are not guaranteed to succeed, even if read-only
494 */
495 if (is_vm_hugetlb_page(tmp))
496 reset_vma_resv_huge_pages(tmp);
497
498 /*
499 * Link in the new vma and copy the page table entries.
500 */
501 *pprev = tmp;
502 pprev = &tmp->vm_next;
503 tmp->vm_prev = prev;
504 prev = tmp;
505
506 __vma_link_rb(mm, tmp, rb_link, rb_parent);
507 rb_link = &tmp->vm_rb.rb_right;
508 rb_parent = &tmp->vm_rb;
509
510 mm->map_count++;
511 if (!(tmp->vm_flags & VM_WIPEONFORK))
512 retval = copy_page_range(mm, oldmm, mpnt);
513
514 if (tmp->vm_ops && tmp->vm_ops->open)
515 tmp->vm_ops->open(tmp);
516
517 if (retval)
518 goto out;
519 }
520 /* a new mm has just been created */
521 arch_dup_mmap(oldmm, mm);
522 retval = 0;
523out:
524 up_write(&mm->mmap_sem);
525 flush_tlb_mm(oldmm);
526 up_write(&oldmm->mmap_sem);
527 dup_userfaultfd_complete(&uf);
528fail_uprobe_end:
529 uprobe_end_dup_mmap();
530 return retval;
531fail_nomem_anon_vma_fork:
532 mpol_put(vma_policy(tmp));
533fail_nomem_policy:
534 kmem_cache_free(vm_area_cachep, tmp);
535fail_nomem:
536 retval = -ENOMEM;
537 vm_unacct_memory(charge);
538 goto out;
539}
540
541static inline int mm_alloc_pgd(struct mm_struct *mm)
542{
543 mm->pgd = pgd_alloc(mm);
544 if (unlikely(!mm->pgd))
545 return -ENOMEM;
546 return 0;
547}
548
549static inline void mm_free_pgd(struct mm_struct *mm)
550{
551 pgd_free(mm, mm->pgd);
552}
553#else
554static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
555{
556 down_write(&oldmm->mmap_sem);
557 RCU_INIT_POINTER(mm->exe_file, get_mm_exe_file(oldmm));
558 up_write(&oldmm->mmap_sem);
559 return 0;
560}
561#define mm_alloc_pgd(mm) (0)
562#define mm_free_pgd(mm)
563#endif /* CONFIG_MMU */
564
565static void check_mm(struct mm_struct *mm)
566{
567 int i;
568
569 for (i = 0; i < NR_MM_COUNTERS; i++) {
570 long x = atomic_long_read(&mm->rss_stat.count[i]);
571
572 if (unlikely(x))
573 printk(KERN_ALERT "BUG: Bad rss-counter state "
574 "mm:%p idx:%d val:%ld\n", mm, i, x);
575 }
576
577 if (mm_pgtables_bytes(mm))
578 pr_alert("BUG: non-zero pgtables_bytes on freeing mm: %ld\n",
579 mm_pgtables_bytes(mm));
580
581#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
582 VM_BUG_ON_MM(mm->pmd_huge_pte, mm);
583#endif
584}
585
586#define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
587#define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
588
589/*
590 * Called when the last reference to the mm
591 * is dropped: either by a lazy thread or by
592 * mmput. Free the page directory and the mm.
593 */
594void __mmdrop(struct mm_struct *mm)
595{
596 BUG_ON(mm == &init_mm);
597 WARN_ON_ONCE(mm == current->mm);
598 WARN_ON_ONCE(mm == current->active_mm);
599 mm_free_pgd(mm);
600 destroy_context(mm);
601 hmm_mm_destroy(mm);
602 mmu_notifier_mm_destroy(mm);
603 check_mm(mm);
604 put_user_ns(mm->user_ns);
605 free_mm(mm);
606}
607EXPORT_SYMBOL_GPL(__mmdrop);
608
609static void mmdrop_async_fn(struct work_struct *work)
610{
611 struct mm_struct *mm;
612
613 mm = container_of(work, struct mm_struct, async_put_work);
614 __mmdrop(mm);
615}
616
617static void mmdrop_async(struct mm_struct *mm)
618{
619 if (unlikely(atomic_dec_and_test(&mm->mm_count))) {
620 INIT_WORK(&mm->async_put_work, mmdrop_async_fn);
621 schedule_work(&mm->async_put_work);
622 }
623}
624
625static inline void free_signal_struct(struct signal_struct *sig)
626{
627 taskstats_tgid_free(sig);
628 sched_autogroup_exit(sig);
629 /*
630 * __mmdrop is not safe to call from softirq context on x86 due to
631 * pgd_dtor so postpone it to the async context
632 */
633 if (sig->oom_mm)
634 mmdrop_async(sig->oom_mm);
635 kmem_cache_free(signal_cachep, sig);
636}
637
638static inline void put_signal_struct(struct signal_struct *sig)
639{
640 if (atomic_dec_and_test(&sig->sigcnt))
641 free_signal_struct(sig);
642}
643
644void __put_task_struct(struct task_struct *tsk)
645{
646 WARN_ON(!tsk->exit_state);
647 WARN_ON(atomic_read(&tsk->usage));
648 WARN_ON(tsk == current);
649
650 cgroup_free(tsk);
651 task_numa_free(tsk);
652 security_task_free(tsk);
653 exit_creds(tsk);
654 delayacct_tsk_free(tsk);
655 put_signal_struct(tsk->signal);
656
657 if (!profile_handoff_task(tsk))
658 free_task(tsk);
659}
660EXPORT_SYMBOL_GPL(__put_task_struct);
661
662void __init __weak arch_task_cache_init(void) { }
663
664/*
665 * set_max_threads
666 */
667static void set_max_threads(unsigned int max_threads_suggested)
668{
669 u64 threads;
670
671 /*
672 * The number of threads shall be limited such that the thread
673 * structures may only consume a small part of the available memory.
674 */
675 if (fls64(totalram_pages) + fls64(PAGE_SIZE) > 64)
676 threads = MAX_THREADS;
677 else
678 threads = div64_u64((u64) totalram_pages * (u64) PAGE_SIZE,
679 (u64) THREAD_SIZE * 8UL);
680
681 if (threads > max_threads_suggested)
682 threads = max_threads_suggested;
683
684 max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS);
685}
686
687#ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT
688/* Initialized by the architecture: */
689int arch_task_struct_size __read_mostly;
690#endif
691
692static void task_struct_whitelist(unsigned long *offset, unsigned long *size)
693{
694 /* Fetch thread_struct whitelist for the architecture. */
695 arch_thread_struct_whitelist(offset, size);
696
697 /*
698 * Handle zero-sized whitelist or empty thread_struct, otherwise
699 * adjust offset to position of thread_struct in task_struct.
700 */
701 if (unlikely(*size == 0))
702 *offset = 0;
703 else
704 *offset += offsetof(struct task_struct, thread);
705}
706
707void __init fork_init(void)
708{
709 int i;
710#ifndef CONFIG_ARCH_TASK_STRUCT_ALLOCATOR
711#ifndef ARCH_MIN_TASKALIGN
712#define ARCH_MIN_TASKALIGN 0
713#endif
714 int align = max_t(int, L1_CACHE_BYTES, ARCH_MIN_TASKALIGN);
715 unsigned long useroffset, usersize;
716
717 /* create a slab on which task_structs can be allocated */
718 task_struct_whitelist(&useroffset, &usersize);
719 task_struct_cachep = kmem_cache_create_usercopy("task_struct",
720 arch_task_struct_size, align,
721 SLAB_PANIC|SLAB_ACCOUNT,
722 useroffset, usersize, NULL);
723#endif
724
725 /* do the arch specific task caches init */
726 arch_task_cache_init();
727
728 set_max_threads(MAX_THREADS);
729
730 init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
731 init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
732 init_task.signal->rlim[RLIMIT_SIGPENDING] =
733 init_task.signal->rlim[RLIMIT_NPROC];
734
735 for (i = 0; i < UCOUNT_COUNTS; i++) {
736 init_user_ns.ucount_max[i] = max_threads/2;
737 }
738
739#ifdef CONFIG_VMAP_STACK
740 cpuhp_setup_state(CPUHP_BP_PREPARE_DYN, "fork:vm_stack_cache",
741 NULL, free_vm_stack_cache);
742#endif
743
744 lockdep_init_task(&init_task);
745}
746
747int __weak arch_dup_task_struct(struct task_struct *dst,
748 struct task_struct *src)
749{
750 *dst = *src;
751 return 0;
752}
753
754void set_task_stack_end_magic(struct task_struct *tsk)
755{
756 unsigned long *stackend;
757
758 stackend = end_of_stack(tsk);
759 *stackend = STACK_END_MAGIC; /* for overflow detection */
760}
761
762static struct task_struct *dup_task_struct(struct task_struct *orig, int node)
763{
764 struct task_struct *tsk;
765 unsigned long *stack;
766 struct vm_struct *stack_vm_area;
767 int err;
768
769 if (node == NUMA_NO_NODE)
770 node = tsk_fork_get_node(orig);
771 tsk = alloc_task_struct_node(node);
772 if (!tsk)
773 return NULL;
774
775 stack = alloc_thread_stack_node(tsk, node);
776 if (!stack)
777 goto free_tsk;
778
779 stack_vm_area = task_stack_vm_area(tsk);
780
781 err = arch_dup_task_struct(tsk, orig);
782
783 /*
784 * arch_dup_task_struct() clobbers the stack-related fields. Make
785 * sure they're properly initialized before using any stack-related
786 * functions again.
787 */
788 tsk->stack = stack;
789#ifdef CONFIG_VMAP_STACK
790 tsk->stack_vm_area = stack_vm_area;
791#endif
792#ifdef CONFIG_THREAD_INFO_IN_TASK
793 atomic_set(&tsk->stack_refcount, 1);
794#endif
795
796 if (err)
797 goto free_stack;
798
799#ifdef CONFIG_SECCOMP
800 /*
801 * We must handle setting up seccomp filters once we're under
802 * the sighand lock in case orig has changed between now and
803 * then. Until then, filter must be NULL to avoid messing up
804 * the usage counts on the error path calling free_task.
805 */
806 tsk->seccomp.filter = NULL;
807#endif
808
809 setup_thread_stack(tsk, orig);
810 clear_user_return_notifier(tsk);
811 clear_tsk_need_resched(tsk);
812 set_task_stack_end_magic(tsk);
813
814#ifdef CONFIG_CC_STACKPROTECTOR
815 tsk->stack_canary = get_random_canary();
816#endif
817
818 /*
819 * One for us, one for whoever does the "release_task()" (usually
820 * parent)
821 */
822 atomic_set(&tsk->usage, 2);
823#ifdef CONFIG_BLK_DEV_IO_TRACE
824 tsk->btrace_seq = 0;
825#endif
826 tsk->splice_pipe = NULL;
827 tsk->task_frag.page = NULL;
828 tsk->wake_q.next = NULL;
829
830 account_kernel_stack(tsk, 1);
831
832 kcov_task_init(tsk);
833
834#ifdef CONFIG_FAULT_INJECTION
835 tsk->fail_nth = 0;
836#endif
837
838 return tsk;
839
840free_stack:
841 free_thread_stack(tsk);
842free_tsk:
843 free_task_struct(tsk);
844 return NULL;
845}
846
847__cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
848
849static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT;
850
851static int __init coredump_filter_setup(char *s)
852{
853 default_dump_filter =
854 (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) &
855 MMF_DUMP_FILTER_MASK;
856 return 1;
857}
858
859__setup("coredump_filter=", coredump_filter_setup);
860
861#include <linux/init_task.h>
862
863static void mm_init_aio(struct mm_struct *mm)
864{
865#ifdef CONFIG_AIO
866 spin_lock_init(&mm->ioctx_lock);
867 mm->ioctx_table = NULL;
868#endif
869}
870
871static void mm_init_owner(struct mm_struct *mm, struct task_struct *p)
872{
873#ifdef CONFIG_MEMCG
874 mm->owner = p;
875#endif
876}
877
878static void mm_init_uprobes_state(struct mm_struct *mm)
879{
880#ifdef CONFIG_UPROBES
881 mm->uprobes_state.xol_area = NULL;
882#endif
883}
884
885static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p,
886 struct user_namespace *user_ns)
887{
888 mm->mmap = NULL;
889 mm->mm_rb = RB_ROOT;
890 mm->vmacache_seqnum = 0;
891 atomic_set(&mm->mm_users, 1);
892 atomic_set(&mm->mm_count, 1);
893 init_rwsem(&mm->mmap_sem);
894 INIT_LIST_HEAD(&mm->mmlist);
895 mm->core_state = NULL;
896 mm_pgtables_bytes_init(mm);
897 mm->map_count = 0;
898 mm->locked_vm = 0;
899 mm->pinned_vm = 0;
900 memset(&mm->rss_stat, 0, sizeof(mm->rss_stat));
901 spin_lock_init(&mm->page_table_lock);
902 mm_init_cpumask(mm);
903 mm_init_aio(mm);
904 mm_init_owner(mm, p);
905 RCU_INIT_POINTER(mm->exe_file, NULL);
906 mmu_notifier_mm_init(mm);
907 hmm_mm_init(mm);
908 init_tlb_flush_pending(mm);
909#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
910 mm->pmd_huge_pte = NULL;
911#endif
912 mm_init_uprobes_state(mm);
913
914 if (current->mm) {
915 mm->flags = current->mm->flags & MMF_INIT_MASK;
916 mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK;
917 } else {
918 mm->flags = default_dump_filter;
919 mm->def_flags = 0;
920 }
921
922 if (mm_alloc_pgd(mm))
923 goto fail_nopgd;
924
925 if (init_new_context(p, mm))
926 goto fail_nocontext;
927
928 mm->user_ns = get_user_ns(user_ns);
929 return mm;
930
931fail_nocontext:
932 mm_free_pgd(mm);
933fail_nopgd:
934 free_mm(mm);
935 return NULL;
936}
937
938/*
939 * Allocate and initialize an mm_struct.
940 */
941struct mm_struct *mm_alloc(void)
942{
943 struct mm_struct *mm;
944
945 mm = allocate_mm();
946 if (!mm)
947 return NULL;
948
949 memset(mm, 0, sizeof(*mm));
950 return mm_init(mm, current, current_user_ns());
951}
952
953static inline void __mmput(struct mm_struct *mm)
954{
955 VM_BUG_ON(atomic_read(&mm->mm_users));
956
957 uprobe_clear_state(mm);
958 exit_aio(mm);
959 ksm_exit(mm);
960 khugepaged_exit(mm); /* must run before exit_mmap */
961 exit_mmap(mm);
962 mm_put_huge_zero_page(mm);
963 set_mm_exe_file(mm, NULL);
964 if (!list_empty(&mm->mmlist)) {
965 spin_lock(&mmlist_lock);
966 list_del(&mm->mmlist);
967 spin_unlock(&mmlist_lock);
968 }
969 if (mm->binfmt)
970 module_put(mm->binfmt->module);
971 mmdrop(mm);
972}
973
974/*
975 * Decrement the use count and release all resources for an mm.
976 */
977void mmput(struct mm_struct *mm)
978{
979 might_sleep();
980
981 if (atomic_dec_and_test(&mm->mm_users))
982 __mmput(mm);
983}
984EXPORT_SYMBOL_GPL(mmput);
985
986#ifdef CONFIG_MMU
987static void mmput_async_fn(struct work_struct *work)
988{
989 struct mm_struct *mm = container_of(work, struct mm_struct,
990 async_put_work);
991
992 __mmput(mm);
993}
994
995void mmput_async(struct mm_struct *mm)
996{
997 if (atomic_dec_and_test(&mm->mm_users)) {
998 INIT_WORK(&mm->async_put_work, mmput_async_fn);
999 schedule_work(&mm->async_put_work);
1000 }
1001}
1002#endif
1003
1004/**
1005 * set_mm_exe_file - change a reference to the mm's executable file
1006 *
1007 * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
1008 *
1009 * Main users are mmput() and sys_execve(). Callers prevent concurrent
1010 * invocations: in mmput() nobody alive left, in execve task is single
1011 * threaded. sys_prctl(PR_SET_MM_MAP/EXE_FILE) also needs to set the
1012 * mm->exe_file, but does so without using set_mm_exe_file() in order
1013 * to do avoid the need for any locks.
1014 */
1015void set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1016{
1017 struct file *old_exe_file;
1018
1019 /*
1020 * It is safe to dereference the exe_file without RCU as
1021 * this function is only called if nobody else can access
1022 * this mm -- see comment above for justification.
1023 */
1024 old_exe_file = rcu_dereference_raw(mm->exe_file);
1025
1026 if (new_exe_file)
1027 get_file(new_exe_file);
1028 rcu_assign_pointer(mm->exe_file, new_exe_file);
1029 if (old_exe_file)
1030 fput(old_exe_file);
1031}
1032
1033/**
1034 * get_mm_exe_file - acquire a reference to the mm's executable file
1035 *
1036 * Returns %NULL if mm has no associated executable file.
1037 * User must release file via fput().
1038 */
1039struct file *get_mm_exe_file(struct mm_struct *mm)
1040{
1041 struct file *exe_file;
1042
1043 rcu_read_lock();
1044 exe_file = rcu_dereference(mm->exe_file);
1045 if (exe_file && !get_file_rcu(exe_file))
1046 exe_file = NULL;
1047 rcu_read_unlock();
1048 return exe_file;
1049}
1050EXPORT_SYMBOL(get_mm_exe_file);
1051
1052/**
1053 * get_task_exe_file - acquire a reference to the task's executable file
1054 *
1055 * Returns %NULL if task's mm (if any) has no associated executable file or
1056 * this is a kernel thread with borrowed mm (see the comment above get_task_mm).
1057 * User must release file via fput().
1058 */
1059struct file *get_task_exe_file(struct task_struct *task)
1060{
1061 struct file *exe_file = NULL;
1062 struct mm_struct *mm;
1063
1064 task_lock(task);
1065 mm = task->mm;
1066 if (mm) {
1067 if (!(task->flags & PF_KTHREAD))
1068 exe_file = get_mm_exe_file(mm);
1069 }
1070 task_unlock(task);
1071 return exe_file;
1072}
1073EXPORT_SYMBOL(get_task_exe_file);
1074
1075/**
1076 * get_task_mm - acquire a reference to the task's mm
1077 *
1078 * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning
1079 * this kernel workthread has transiently adopted a user mm with use_mm,
1080 * to do its AIO) is not set and if so returns a reference to it, after
1081 * bumping up the use count. User must release the mm via mmput()
1082 * after use. Typically used by /proc and ptrace.
1083 */
1084struct mm_struct *get_task_mm(struct task_struct *task)
1085{
1086 struct mm_struct *mm;
1087
1088 task_lock(task);
1089 mm = task->mm;
1090 if (mm) {
1091 if (task->flags & PF_KTHREAD)
1092 mm = NULL;
1093 else
1094 mmget(mm);
1095 }
1096 task_unlock(task);
1097 return mm;
1098}
1099EXPORT_SYMBOL_GPL(get_task_mm);
1100
1101struct mm_struct *mm_access(struct task_struct *task, unsigned int mode)
1102{
1103 struct mm_struct *mm;
1104 int err;
1105
1106 err = mutex_lock_killable(&task->signal->cred_guard_mutex);
1107 if (err)
1108 return ERR_PTR(err);
1109
1110 mm = get_task_mm(task);
1111 if (mm && mm != current->mm &&
1112 !ptrace_may_access(task, mode)) {
1113 mmput(mm);
1114 mm = ERR_PTR(-EACCES);
1115 }
1116 mutex_unlock(&task->signal->cred_guard_mutex);
1117
1118 return mm;
1119}
1120
1121static void complete_vfork_done(struct task_struct *tsk)
1122{
1123 struct completion *vfork;
1124
1125 task_lock(tsk);
1126 vfork = tsk->vfork_done;
1127 if (likely(vfork)) {
1128 tsk->vfork_done = NULL;
1129 complete(vfork);
1130 }
1131 task_unlock(tsk);
1132}
1133
1134static int wait_for_vfork_done(struct task_struct *child,
1135 struct completion *vfork)
1136{
1137 int killed;
1138
1139 freezer_do_not_count();
1140 killed = wait_for_completion_killable(vfork);
1141 freezer_count();
1142
1143 if (killed) {
1144 task_lock(child);
1145 child->vfork_done = NULL;
1146 task_unlock(child);
1147 }
1148
1149 put_task_struct(child);
1150 return killed;
1151}
1152
1153/* Please note the differences between mmput and mm_release.
1154 * mmput is called whenever we stop holding onto a mm_struct,
1155 * error success whatever.
1156 *
1157 * mm_release is called after a mm_struct has been removed
1158 * from the current process.
1159 *
1160 * This difference is important for error handling, when we
1161 * only half set up a mm_struct for a new process and need to restore
1162 * the old one. Because we mmput the new mm_struct before
1163 * restoring the old one. . .
1164 * Eric Biederman 10 January 1998
1165 */
1166void mm_release(struct task_struct *tsk, struct mm_struct *mm)
1167{
1168 /* Get rid of any futexes when releasing the mm */
1169#ifdef CONFIG_FUTEX
1170 if (unlikely(tsk->robust_list)) {
1171 exit_robust_list(tsk);
1172 tsk->robust_list = NULL;
1173 }
1174#ifdef CONFIG_COMPAT
1175 if (unlikely(tsk->compat_robust_list)) {
1176 compat_exit_robust_list(tsk);
1177 tsk->compat_robust_list = NULL;
1178 }
1179#endif
1180 if (unlikely(!list_empty(&tsk->pi_state_list)))
1181 exit_pi_state_list(tsk);
1182#endif
1183
1184 uprobe_free_utask(tsk);
1185
1186 /* Get rid of any cached register state */
1187 deactivate_mm(tsk, mm);
1188
1189 /*
1190 * Signal userspace if we're not exiting with a core dump
1191 * because we want to leave the value intact for debugging
1192 * purposes.
1193 */
1194 if (tsk->clear_child_tid) {
1195 if (!(tsk->signal->flags & SIGNAL_GROUP_COREDUMP) &&
1196 atomic_read(&mm->mm_users) > 1) {
1197 /*
1198 * We don't check the error code - if userspace has
1199 * not set up a proper pointer then tough luck.
1200 */
1201 put_user(0, tsk->clear_child_tid);
1202 do_futex(tsk->clear_child_tid, FUTEX_WAKE,
1203 1, NULL, NULL, 0, 0);
1204 }
1205 tsk->clear_child_tid = NULL;
1206 }
1207
1208 /*
1209 * All done, finally we can wake up parent and return this mm to him.
1210 * Also kthread_stop() uses this completion for synchronization.
1211 */
1212 if (tsk->vfork_done)
1213 complete_vfork_done(tsk);
1214}
1215
1216/*
1217 * Allocate a new mm structure and copy contents from the
1218 * mm structure of the passed in task structure.
1219 */
1220static struct mm_struct *dup_mm(struct task_struct *tsk)
1221{
1222 struct mm_struct *mm, *oldmm = current->mm;
1223 int err;
1224
1225 mm = allocate_mm();
1226 if (!mm)
1227 goto fail_nomem;
1228
1229 memcpy(mm, oldmm, sizeof(*mm));
1230
1231 if (!mm_init(mm, tsk, mm->user_ns))
1232 goto fail_nomem;
1233
1234 err = dup_mmap(mm, oldmm);
1235 if (err)
1236 goto free_pt;
1237
1238 mm->hiwater_rss = get_mm_rss(mm);
1239 mm->hiwater_vm = mm->total_vm;
1240
1241 if (mm->binfmt && !try_module_get(mm->binfmt->module))
1242 goto free_pt;
1243
1244 return mm;
1245
1246free_pt:
1247 /* don't put binfmt in mmput, we haven't got module yet */
1248 mm->binfmt = NULL;
1249 mmput(mm);
1250
1251fail_nomem:
1252 return NULL;
1253}
1254
1255static int copy_mm(unsigned long clone_flags, struct task_struct *tsk)
1256{
1257 struct mm_struct *mm, *oldmm;
1258 int retval;
1259
1260 tsk->min_flt = tsk->maj_flt = 0;
1261 tsk->nvcsw = tsk->nivcsw = 0;
1262#ifdef CONFIG_DETECT_HUNG_TASK
1263 tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw;
1264#endif
1265
1266 tsk->mm = NULL;
1267 tsk->active_mm = NULL;
1268
1269 /*
1270 * Are we cloning a kernel thread?
1271 *
1272 * We need to steal a active VM for that..
1273 */
1274 oldmm = current->mm;
1275 if (!oldmm)
1276 return 0;
1277
1278 /* initialize the new vmacache entries */
1279 vmacache_flush(tsk);
1280
1281 if (clone_flags & CLONE_VM) {
1282 mmget(oldmm);
1283 mm = oldmm;
1284 goto good_mm;
1285 }
1286
1287 retval = -ENOMEM;
1288 mm = dup_mm(tsk);
1289 if (!mm)
1290 goto fail_nomem;
1291
1292good_mm:
1293 tsk->mm = mm;
1294 tsk->active_mm = mm;
1295 return 0;
1296
1297fail_nomem:
1298 return retval;
1299}
1300
1301static int copy_fs(unsigned long clone_flags, struct task_struct *tsk)
1302{
1303 struct fs_struct *fs = current->fs;
1304 if (clone_flags & CLONE_FS) {
1305 /* tsk->fs is already what we want */
1306 spin_lock(&fs->lock);
1307 if (fs->in_exec) {
1308 spin_unlock(&fs->lock);
1309 return -EAGAIN;
1310 }
1311 fs->users++;
1312 spin_unlock(&fs->lock);
1313 return 0;
1314 }
1315 tsk->fs = copy_fs_struct(fs);
1316 if (!tsk->fs)
1317 return -ENOMEM;
1318 return 0;
1319}
1320
1321static int copy_files(unsigned long clone_flags, struct task_struct *tsk)
1322{
1323 struct files_struct *oldf, *newf;
1324 int error = 0;
1325
1326 /*
1327 * A background process may not have any files ...
1328 */
1329 oldf = current->files;
1330 if (!oldf)
1331 goto out;
1332
1333 if (clone_flags & CLONE_FILES) {
1334 atomic_inc(&oldf->count);
1335 goto out;
1336 }
1337
1338 newf = dup_fd(oldf, &error);
1339 if (!newf)
1340 goto out;
1341
1342 tsk->files = newf;
1343 error = 0;
1344out:
1345 return error;
1346}
1347
1348static int copy_io(unsigned long clone_flags, struct task_struct *tsk)
1349{
1350#ifdef CONFIG_BLOCK
1351 struct io_context *ioc = current->io_context;
1352 struct io_context *new_ioc;
1353
1354 if (!ioc)
1355 return 0;
1356 /*
1357 * Share io context with parent, if CLONE_IO is set
1358 */
1359 if (clone_flags & CLONE_IO) {
1360 ioc_task_link(ioc);
1361 tsk->io_context = ioc;
1362 } else if (ioprio_valid(ioc->ioprio)) {
1363 new_ioc = get_task_io_context(tsk, GFP_KERNEL, NUMA_NO_NODE);
1364 if (unlikely(!new_ioc))
1365 return -ENOMEM;
1366
1367 new_ioc->ioprio = ioc->ioprio;
1368 put_io_context(new_ioc);
1369 }
1370#endif
1371 return 0;
1372}
1373
1374static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk)
1375{
1376 struct sighand_struct *sig;
1377
1378 if (clone_flags & CLONE_SIGHAND) {
1379 atomic_inc(¤t->sighand->count);
1380 return 0;
1381 }
1382 sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1383 rcu_assign_pointer(tsk->sighand, sig);
1384 if (!sig)
1385 return -ENOMEM;
1386
1387 atomic_set(&sig->count, 1);
1388 memcpy(sig->action, current->sighand->action, sizeof(sig->action));
1389 return 0;
1390}
1391
1392void __cleanup_sighand(struct sighand_struct *sighand)
1393{
1394 if (atomic_dec_and_test(&sighand->count)) {
1395 signalfd_cleanup(sighand);
1396 /*
1397 * sighand_cachep is SLAB_TYPESAFE_BY_RCU so we can free it
1398 * without an RCU grace period, see __lock_task_sighand().
1399 */
1400 kmem_cache_free(sighand_cachep, sighand);
1401 }
1402}
1403
1404#ifdef CONFIG_POSIX_TIMERS
1405/*
1406 * Initialize POSIX timer handling for a thread group.
1407 */
1408static void posix_cpu_timers_init_group(struct signal_struct *sig)
1409{
1410 unsigned long cpu_limit;
1411
1412 cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur);
1413 if (cpu_limit != RLIM_INFINITY) {
1414 sig->cputime_expires.prof_exp = cpu_limit * NSEC_PER_SEC;
1415 sig->cputimer.running = true;
1416 }
1417
1418 /* The timer lists. */
1419 INIT_LIST_HEAD(&sig->cpu_timers[0]);
1420 INIT_LIST_HEAD(&sig->cpu_timers[1]);
1421 INIT_LIST_HEAD(&sig->cpu_timers[2]);
1422}
1423#else
1424static inline void posix_cpu_timers_init_group(struct signal_struct *sig) { }
1425#endif
1426
1427static int copy_signal(unsigned long clone_flags, struct task_struct *tsk)
1428{
1429 struct signal_struct *sig;
1430
1431 if (clone_flags & CLONE_THREAD)
1432 return 0;
1433
1434 sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL);
1435 tsk->signal = sig;
1436 if (!sig)
1437 return -ENOMEM;
1438
1439 sig->nr_threads = 1;
1440 atomic_set(&sig->live, 1);
1441 atomic_set(&sig->sigcnt, 1);
1442
1443 /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */
1444 sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node);
1445 tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head);
1446
1447 init_waitqueue_head(&sig->wait_chldexit);
1448 sig->curr_target = tsk;
1449 init_sigpending(&sig->shared_pending);
1450 seqlock_init(&sig->stats_lock);
1451 prev_cputime_init(&sig->prev_cputime);
1452
1453#ifdef CONFIG_POSIX_TIMERS
1454 INIT_LIST_HEAD(&sig->posix_timers);
1455 hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1456 sig->real_timer.function = it_real_fn;
1457#endif
1458
1459 task_lock(current->group_leader);
1460 memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
1461 task_unlock(current->group_leader);
1462
1463 posix_cpu_timers_init_group(sig);
1464
1465 tty_audit_fork(sig);
1466 sched_autogroup_fork(sig);
1467
1468 sig->oom_score_adj = current->signal->oom_score_adj;
1469 sig->oom_score_adj_min = current->signal->oom_score_adj_min;
1470
1471 mutex_init(&sig->cred_guard_mutex);
1472
1473 return 0;
1474}
1475
1476static void copy_seccomp(struct task_struct *p)
1477{
1478#ifdef CONFIG_SECCOMP
1479 /*
1480 * Must be called with sighand->lock held, which is common to
1481 * all threads in the group. Holding cred_guard_mutex is not
1482 * needed because this new task is not yet running and cannot
1483 * be racing exec.
1484 */
1485 assert_spin_locked(¤t->sighand->siglock);
1486
1487 /* Ref-count the new filter user, and assign it. */
1488 get_seccomp_filter(current);
1489 p->seccomp = current->seccomp;
1490
1491 /*
1492 * Explicitly enable no_new_privs here in case it got set
1493 * between the task_struct being duplicated and holding the
1494 * sighand lock. The seccomp state and nnp must be in sync.
1495 */
1496 if (task_no_new_privs(current))
1497 task_set_no_new_privs(p);
1498
1499 /*
1500 * If the parent gained a seccomp mode after copying thread
1501 * flags and between before we held the sighand lock, we have
1502 * to manually enable the seccomp thread flag here.
1503 */
1504 if (p->seccomp.mode != SECCOMP_MODE_DISABLED)
1505 set_tsk_thread_flag(p, TIF_SECCOMP);
1506#endif
1507}
1508
1509SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr)
1510{
1511 current->clear_child_tid = tidptr;
1512
1513 return task_pid_vnr(current);
1514}
1515
1516static void rt_mutex_init_task(struct task_struct *p)
1517{
1518 raw_spin_lock_init(&p->pi_lock);
1519#ifdef CONFIG_RT_MUTEXES
1520 p->pi_waiters = RB_ROOT_CACHED;
1521 p->pi_top_task = NULL;
1522 p->pi_blocked_on = NULL;
1523#endif
1524}
1525
1526#ifdef CONFIG_POSIX_TIMERS
1527/*
1528 * Initialize POSIX timer handling for a single task.
1529 */
1530static void posix_cpu_timers_init(struct task_struct *tsk)
1531{
1532 tsk->cputime_expires.prof_exp = 0;
1533 tsk->cputime_expires.virt_exp = 0;
1534 tsk->cputime_expires.sched_exp = 0;
1535 INIT_LIST_HEAD(&tsk->cpu_timers[0]);
1536 INIT_LIST_HEAD(&tsk->cpu_timers[1]);
1537 INIT_LIST_HEAD(&tsk->cpu_timers[2]);
1538}
1539#else
1540static inline void posix_cpu_timers_init(struct task_struct *tsk) { }
1541#endif
1542
1543static inline void
1544init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid)
1545{
1546 task->pids[type].pid = pid;
1547}
1548
1549static inline void rcu_copy_process(struct task_struct *p)
1550{
1551#ifdef CONFIG_PREEMPT_RCU
1552 p->rcu_read_lock_nesting = 0;
1553 p->rcu_read_unlock_special.s = 0;
1554 p->rcu_blocked_node = NULL;
1555 INIT_LIST_HEAD(&p->rcu_node_entry);
1556#endif /* #ifdef CONFIG_PREEMPT_RCU */
1557#ifdef CONFIG_TASKS_RCU
1558 p->rcu_tasks_holdout = false;
1559 INIT_LIST_HEAD(&p->rcu_tasks_holdout_list);
1560 p->rcu_tasks_idle_cpu = -1;
1561#endif /* #ifdef CONFIG_TASKS_RCU */
1562}
1563
1564/*
1565 * This creates a new process as a copy of the old one,
1566 * but does not actually start it yet.
1567 *
1568 * It copies the registers, and all the appropriate
1569 * parts of the process environment (as per the clone
1570 * flags). The actual kick-off is left to the caller.
1571 */
1572static __latent_entropy struct task_struct *copy_process(
1573 unsigned long clone_flags,
1574 unsigned long stack_start,
1575 unsigned long stack_size,
1576 int __user *child_tidptr,
1577 struct pid *pid,
1578 int trace,
1579 unsigned long tls,
1580 int node)
1581{
1582 int retval;
1583 struct task_struct *p;
1584
1585 /*
1586 * Don't allow sharing the root directory with processes in a different
1587 * namespace
1588 */
1589 if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
1590 return ERR_PTR(-EINVAL);
1591
1592 if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS))
1593 return ERR_PTR(-EINVAL);
1594
1595 /*
1596 * Thread groups must share signals as well, and detached threads
1597 * can only be started up within the thread group.
1598 */
1599 if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
1600 return ERR_PTR(-EINVAL);
1601
1602 /*
1603 * Shared signal handlers imply shared VM. By way of the above,
1604 * thread groups also imply shared VM. Blocking this case allows
1605 * for various simplifications in other code.
1606 */
1607 if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
1608 return ERR_PTR(-EINVAL);
1609
1610 /*
1611 * Siblings of global init remain as zombies on exit since they are
1612 * not reaped by their parent (swapper). To solve this and to avoid
1613 * multi-rooted process trees, prevent global and container-inits
1614 * from creating siblings.
1615 */
1616 if ((clone_flags & CLONE_PARENT) &&
1617 current->signal->flags & SIGNAL_UNKILLABLE)
1618 return ERR_PTR(-EINVAL);
1619
1620 /*
1621 * If the new process will be in a different pid or user namespace
1622 * do not allow it to share a thread group with the forking task.
1623 */
1624 if (clone_flags & CLONE_THREAD) {
1625 if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) ||
1626 (task_active_pid_ns(current) !=
1627 current->nsproxy->pid_ns_for_children))
1628 return ERR_PTR(-EINVAL);
1629 }
1630
1631 retval = -ENOMEM;
1632 p = dup_task_struct(current, node);
1633 if (!p)
1634 goto fork_out;
1635
1636 /*
1637 * This _must_ happen before we call free_task(), i.e. before we jump
1638 * to any of the bad_fork_* labels. This is to avoid freeing
1639 * p->set_child_tid which is (ab)used as a kthread's data pointer for
1640 * kernel threads (PF_KTHREAD).
1641 */
1642 p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? child_tidptr : NULL;
1643 /*
1644 * Clear TID on mm_release()?
1645 */
1646 p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? child_tidptr : NULL;
1647
1648 ftrace_graph_init_task(p);
1649
1650 rt_mutex_init_task(p);
1651
1652#ifdef CONFIG_PROVE_LOCKING
1653 DEBUG_LOCKS_WARN_ON(!p->hardirqs_enabled);
1654 DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
1655#endif
1656 retval = -EAGAIN;
1657 if (atomic_read(&p->real_cred->user->processes) >=
1658 task_rlimit(p, RLIMIT_NPROC)) {
1659 if (p->real_cred->user != INIT_USER &&
1660 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN))
1661 goto bad_fork_free;
1662 }
1663 current->flags &= ~PF_NPROC_EXCEEDED;
1664
1665 retval = copy_creds(p, clone_flags);
1666 if (retval < 0)
1667 goto bad_fork_free;
1668
1669 /*
1670 * If multiple threads are within copy_process(), then this check
1671 * triggers too late. This doesn't hurt, the check is only there
1672 * to stop root fork bombs.
1673 */
1674 retval = -EAGAIN;
1675 if (nr_threads >= max_threads)
1676 goto bad_fork_cleanup_count;
1677
1678 delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
1679 p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER | PF_IDLE);
1680 p->flags |= PF_FORKNOEXEC;
1681 INIT_LIST_HEAD(&p->children);
1682 INIT_LIST_HEAD(&p->sibling);
1683 rcu_copy_process(p);
1684 p->vfork_done = NULL;
1685 spin_lock_init(&p->alloc_lock);
1686
1687 init_sigpending(&p->pending);
1688
1689 p->utime = p->stime = p->gtime = 0;
1690#ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME
1691 p->utimescaled = p->stimescaled = 0;
1692#endif
1693 prev_cputime_init(&p->prev_cputime);
1694
1695#ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN
1696 seqcount_init(&p->vtime.seqcount);
1697 p->vtime.starttime = 0;
1698 p->vtime.state = VTIME_INACTIVE;
1699#endif
1700
1701#if defined(SPLIT_RSS_COUNTING)
1702 memset(&p->rss_stat, 0, sizeof(p->rss_stat));
1703#endif
1704
1705 p->default_timer_slack_ns = current->timer_slack_ns;
1706
1707 task_io_accounting_init(&p->ioac);
1708 acct_clear_integrals(p);
1709
1710 posix_cpu_timers_init(p);
1711
1712 p->start_time = ktime_get_ns();
1713 p->real_start_time = ktime_get_boot_ns();
1714 p->io_context = NULL;
1715 p->audit_context = NULL;
1716 cgroup_fork(p);
1717#ifdef CONFIG_NUMA
1718 p->mempolicy = mpol_dup(p->mempolicy);
1719 if (IS_ERR(p->mempolicy)) {
1720 retval = PTR_ERR(p->mempolicy);
1721 p->mempolicy = NULL;
1722 goto bad_fork_cleanup_threadgroup_lock;
1723 }
1724#endif
1725#ifdef CONFIG_CPUSETS
1726 p->cpuset_mem_spread_rotor = NUMA_NO_NODE;
1727 p->cpuset_slab_spread_rotor = NUMA_NO_NODE;
1728 seqcount_init(&p->mems_allowed_seq);
1729#endif
1730#ifdef CONFIG_TRACE_IRQFLAGS
1731 p->irq_events = 0;
1732 p->hardirqs_enabled = 0;
1733 p->hardirq_enable_ip = 0;
1734 p->hardirq_enable_event = 0;
1735 p->hardirq_disable_ip = _THIS_IP_;
1736 p->hardirq_disable_event = 0;
1737 p->softirqs_enabled = 1;
1738 p->softirq_enable_ip = _THIS_IP_;
1739 p->softirq_enable_event = 0;
1740 p->softirq_disable_ip = 0;
1741 p->softirq_disable_event = 0;
1742 p->hardirq_context = 0;
1743 p->softirq_context = 0;
1744#endif
1745
1746 p->pagefault_disabled = 0;
1747
1748#ifdef CONFIG_LOCKDEP
1749 p->lockdep_depth = 0; /* no locks held yet */
1750 p->curr_chain_key = 0;
1751 p->lockdep_recursion = 0;
1752 lockdep_init_task(p);
1753#endif
1754
1755#ifdef CONFIG_DEBUG_MUTEXES
1756 p->blocked_on = NULL; /* not blocked yet */
1757#endif
1758#ifdef CONFIG_BCACHE
1759 p->sequential_io = 0;
1760 p->sequential_io_avg = 0;
1761#endif
1762
1763 /* Perform scheduler related setup. Assign this task to a CPU. */
1764 retval = sched_fork(clone_flags, p);
1765 if (retval)
1766 goto bad_fork_cleanup_policy;
1767
1768 retval = perf_event_init_task(p);
1769 if (retval)
1770 goto bad_fork_cleanup_policy;
1771 retval = audit_alloc(p);
1772 if (retval)
1773 goto bad_fork_cleanup_perf;
1774 /* copy all the process information */
1775 shm_init_task(p);
1776 retval = security_task_alloc(p, clone_flags);
1777 if (retval)
1778 goto bad_fork_cleanup_audit;
1779 retval = copy_semundo(clone_flags, p);
1780 if (retval)
1781 goto bad_fork_cleanup_security;
1782 retval = copy_files(clone_flags, p);
1783 if (retval)
1784 goto bad_fork_cleanup_semundo;
1785 retval = copy_fs(clone_flags, p);
1786 if (retval)
1787 goto bad_fork_cleanup_files;
1788 retval = copy_sighand(clone_flags, p);
1789 if (retval)
1790 goto bad_fork_cleanup_fs;
1791 retval = copy_signal(clone_flags, p);
1792 if (retval)
1793 goto bad_fork_cleanup_sighand;
1794 retval = copy_mm(clone_flags, p);
1795 if (retval)
1796 goto bad_fork_cleanup_signal;
1797 retval = copy_namespaces(clone_flags, p);
1798 if (retval)
1799 goto bad_fork_cleanup_mm;
1800 retval = copy_io(clone_flags, p);
1801 if (retval)
1802 goto bad_fork_cleanup_namespaces;
1803 retval = copy_thread_tls(clone_flags, stack_start, stack_size, p, tls);
1804 if (retval)
1805 goto bad_fork_cleanup_io;
1806
1807 if (pid != &init_struct_pid) {
1808 pid = alloc_pid(p->nsproxy->pid_ns_for_children);
1809 if (IS_ERR(pid)) {
1810 retval = PTR_ERR(pid);
1811 goto bad_fork_cleanup_thread;
1812 }
1813 }
1814
1815#ifdef CONFIG_BLOCK
1816 p->plug = NULL;
1817#endif
1818#ifdef CONFIG_FUTEX
1819 p->robust_list = NULL;
1820#ifdef CONFIG_COMPAT
1821 p->compat_robust_list = NULL;
1822#endif
1823 INIT_LIST_HEAD(&p->pi_state_list);
1824 p->pi_state_cache = NULL;
1825#endif
1826 /*
1827 * sigaltstack should be cleared when sharing the same VM
1828 */
1829 if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
1830 sas_ss_reset(p);
1831
1832 /*
1833 * Syscall tracing and stepping should be turned off in the
1834 * child regardless of CLONE_PTRACE.
1835 */
1836 user_disable_single_step(p);
1837 clear_tsk_thread_flag(p, TIF_SYSCALL_TRACE);
1838#ifdef TIF_SYSCALL_EMU
1839 clear_tsk_thread_flag(p, TIF_SYSCALL_EMU);
1840#endif
1841 clear_all_latency_tracing(p);
1842
1843 /* ok, now we should be set up.. */
1844 p->pid = pid_nr(pid);
1845 if (clone_flags & CLONE_THREAD) {
1846 p->exit_signal = -1;
1847 p->group_leader = current->group_leader;
1848 p->tgid = current->tgid;
1849 } else {
1850 if (clone_flags & CLONE_PARENT)
1851 p->exit_signal = current->group_leader->exit_signal;
1852 else
1853 p->exit_signal = (clone_flags & CSIGNAL);
1854 p->group_leader = p;
1855 p->tgid = p->pid;
1856 }
1857
1858 p->nr_dirtied = 0;
1859 p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10);
1860 p->dirty_paused_when = 0;
1861
1862 p->pdeath_signal = 0;
1863 INIT_LIST_HEAD(&p->thread_group);
1864 p->task_works = NULL;
1865
1866 cgroup_threadgroup_change_begin(current);
1867 /*
1868 * Ensure that the cgroup subsystem policies allow the new process to be
1869 * forked. It should be noted the the new process's css_set can be changed
1870 * between here and cgroup_post_fork() if an organisation operation is in
1871 * progress.
1872 */
1873 retval = cgroup_can_fork(p);
1874 if (retval)
1875 goto bad_fork_free_pid;
1876
1877 /*
1878 * Make it visible to the rest of the system, but dont wake it up yet.
1879 * Need tasklist lock for parent etc handling!
1880 */
1881 write_lock_irq(&tasklist_lock);
1882
1883 /* CLONE_PARENT re-uses the old parent */
1884 if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) {
1885 p->real_parent = current->real_parent;
1886 p->parent_exec_id = current->parent_exec_id;
1887 } else {
1888 p->real_parent = current;
1889 p->parent_exec_id = current->self_exec_id;
1890 }
1891
1892 klp_copy_process(p);
1893
1894 spin_lock(¤t->sighand->siglock);
1895
1896 /*
1897 * Copy seccomp details explicitly here, in case they were changed
1898 * before holding sighand lock.
1899 */
1900 copy_seccomp(p);
1901
1902 /*
1903 * Process group and session signals need to be delivered to just the
1904 * parent before the fork or both the parent and the child after the
1905 * fork. Restart if a signal comes in before we add the new process to
1906 * it's process group.
1907 * A fatal signal pending means that current will exit, so the new
1908 * thread can't slip out of an OOM kill (or normal SIGKILL).
1909 */
1910 recalc_sigpending();
1911 if (signal_pending(current)) {
1912 retval = -ERESTARTNOINTR;
1913 goto bad_fork_cancel_cgroup;
1914 }
1915 if (unlikely(!(ns_of_pid(pid)->pid_allocated & PIDNS_ADDING))) {
1916 retval = -ENOMEM;
1917 goto bad_fork_cancel_cgroup;
1918 }
1919
1920 if (likely(p->pid)) {
1921 ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace);
1922
1923 init_task_pid(p, PIDTYPE_PID, pid);
1924 if (thread_group_leader(p)) {
1925 init_task_pid(p, PIDTYPE_PGID, task_pgrp(current));
1926 init_task_pid(p, PIDTYPE_SID, task_session(current));
1927
1928 if (is_child_reaper(pid)) {
1929 ns_of_pid(pid)->child_reaper = p;
1930 p->signal->flags |= SIGNAL_UNKILLABLE;
1931 }
1932
1933 p->signal->leader_pid = pid;
1934 p->signal->tty = tty_kref_get(current->signal->tty);
1935 /*
1936 * Inherit has_child_subreaper flag under the same
1937 * tasklist_lock with adding child to the process tree
1938 * for propagate_has_child_subreaper optimization.
1939 */
1940 p->signal->has_child_subreaper = p->real_parent->signal->has_child_subreaper ||
1941 p->real_parent->signal->is_child_subreaper;
1942 list_add_tail(&p->sibling, &p->real_parent->children);
1943 list_add_tail_rcu(&p->tasks, &init_task.tasks);
1944 attach_pid(p, PIDTYPE_PGID);
1945 attach_pid(p, PIDTYPE_SID);
1946 __this_cpu_inc(process_counts);
1947 } else {
1948 current->signal->nr_threads++;
1949 atomic_inc(¤t->signal->live);
1950 atomic_inc(¤t->signal->sigcnt);
1951 list_add_tail_rcu(&p->thread_group,
1952 &p->group_leader->thread_group);
1953 list_add_tail_rcu(&p->thread_node,
1954 &p->signal->thread_head);
1955 }
1956 attach_pid(p, PIDTYPE_PID);
1957 nr_threads++;
1958 }
1959
1960 total_forks++;
1961 spin_unlock(¤t->sighand->siglock);
1962 syscall_tracepoint_update(p);
1963 write_unlock_irq(&tasklist_lock);
1964
1965 proc_fork_connector(p);
1966 cgroup_post_fork(p);
1967 cgroup_threadgroup_change_end(current);
1968 perf_event_fork(p);
1969
1970 trace_task_newtask(p, clone_flags);
1971 uprobe_copy_process(p, clone_flags);
1972
1973 return p;
1974
1975bad_fork_cancel_cgroup:
1976 spin_unlock(¤t->sighand->siglock);
1977 write_unlock_irq(&tasklist_lock);
1978 cgroup_cancel_fork(p);
1979bad_fork_free_pid:
1980 cgroup_threadgroup_change_end(current);
1981 if (pid != &init_struct_pid)
1982 free_pid(pid);
1983bad_fork_cleanup_thread:
1984 exit_thread(p);
1985bad_fork_cleanup_io:
1986 if (p->io_context)
1987 exit_io_context(p);
1988bad_fork_cleanup_namespaces:
1989 exit_task_namespaces(p);
1990bad_fork_cleanup_mm:
1991 if (p->mm)
1992 mmput(p->mm);
1993bad_fork_cleanup_signal:
1994 if (!(clone_flags & CLONE_THREAD))
1995 free_signal_struct(p->signal);
1996bad_fork_cleanup_sighand:
1997 __cleanup_sighand(p->sighand);
1998bad_fork_cleanup_fs:
1999 exit_fs(p); /* blocking */
2000bad_fork_cleanup_files:
2001 exit_files(p); /* blocking */
2002bad_fork_cleanup_semundo:
2003 exit_sem(p);
2004bad_fork_cleanup_security:
2005 security_task_free(p);
2006bad_fork_cleanup_audit:
2007 audit_free(p);
2008bad_fork_cleanup_perf:
2009 perf_event_free_task(p);
2010bad_fork_cleanup_policy:
2011 lockdep_free_task(p);
2012#ifdef CONFIG_NUMA
2013 mpol_put(p->mempolicy);
2014bad_fork_cleanup_threadgroup_lock:
2015#endif
2016 delayacct_tsk_free(p);
2017bad_fork_cleanup_count:
2018 atomic_dec(&p->cred->user->processes);
2019 exit_creds(p);
2020bad_fork_free:
2021 p->state = TASK_DEAD;
2022 put_task_stack(p);
2023 free_task(p);
2024fork_out:
2025 return ERR_PTR(retval);
2026}
2027
2028static inline void init_idle_pids(struct pid_link *links)
2029{
2030 enum pid_type type;
2031
2032 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
2033 INIT_HLIST_NODE(&links[type].node); /* not really needed */
2034 links[type].pid = &init_struct_pid;
2035 }
2036}
2037
2038struct task_struct *fork_idle(int cpu)
2039{
2040 struct task_struct *task;
2041 task = copy_process(CLONE_VM, 0, 0, NULL, &init_struct_pid, 0, 0,
2042 cpu_to_node(cpu));
2043 if (!IS_ERR(task)) {
2044 init_idle_pids(task->pids);
2045 init_idle(task, cpu);
2046 }
2047
2048 return task;
2049}
2050
2051/*
2052 * Ok, this is the main fork-routine.
2053 *
2054 * It copies the process, and if successful kick-starts
2055 * it and waits for it to finish using the VM if required.
2056 */
2057long _do_fork(unsigned long clone_flags,
2058 unsigned long stack_start,
2059 unsigned long stack_size,
2060 int __user *parent_tidptr,
2061 int __user *child_tidptr,
2062 unsigned long tls)
2063{
2064 struct completion vfork;
2065 struct pid *pid;
2066 struct task_struct *p;
2067 int trace = 0;
2068 long nr;
2069
2070 /*
2071 * Determine whether and which event to report to ptracer. When
2072 * called from kernel_thread or CLONE_UNTRACED is explicitly
2073 * requested, no event is reported; otherwise, report if the event
2074 * for the type of forking is enabled.
2075 */
2076 if (!(clone_flags & CLONE_UNTRACED)) {
2077 if (clone_flags & CLONE_VFORK)
2078 trace = PTRACE_EVENT_VFORK;
2079 else if ((clone_flags & CSIGNAL) != SIGCHLD)
2080 trace = PTRACE_EVENT_CLONE;
2081 else
2082 trace = PTRACE_EVENT_FORK;
2083
2084 if (likely(!ptrace_event_enabled(current, trace)))
2085 trace = 0;
2086 }
2087
2088 p = copy_process(clone_flags, stack_start, stack_size,
2089 child_tidptr, NULL, trace, tls, NUMA_NO_NODE);
2090 add_latent_entropy();
2091
2092 if (IS_ERR(p))
2093 return PTR_ERR(p);
2094
2095 /*
2096 * Do this prior waking up the new thread - the thread pointer
2097 * might get invalid after that point, if the thread exits quickly.
2098 */
2099 trace_sched_process_fork(current, p);
2100
2101 pid = get_task_pid(p, PIDTYPE_PID);
2102 nr = pid_vnr(pid);
2103
2104 if (clone_flags & CLONE_PARENT_SETTID)
2105 put_user(nr, parent_tidptr);
2106
2107 if (clone_flags & CLONE_VFORK) {
2108 p->vfork_done = &vfork;
2109 init_completion(&vfork);
2110 get_task_struct(p);
2111 }
2112
2113 wake_up_new_task(p);
2114
2115 /* forking complete and child started to run, tell ptracer */
2116 if (unlikely(trace))
2117 ptrace_event_pid(trace, pid);
2118
2119 if (clone_flags & CLONE_VFORK) {
2120 if (!wait_for_vfork_done(p, &vfork))
2121 ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid);
2122 }
2123
2124 put_pid(pid);
2125 return nr;
2126}
2127
2128#ifndef CONFIG_HAVE_COPY_THREAD_TLS
2129/* For compatibility with architectures that call do_fork directly rather than
2130 * using the syscall entry points below. */
2131long do_fork(unsigned long clone_flags,
2132 unsigned long stack_start,
2133 unsigned long stack_size,
2134 int __user *parent_tidptr,
2135 int __user *child_tidptr)
2136{
2137 return _do_fork(clone_flags, stack_start, stack_size,
2138 parent_tidptr, child_tidptr, 0);
2139}
2140#endif
2141
2142/*
2143 * Create a kernel thread.
2144 */
2145pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
2146{
2147 return _do_fork(flags|CLONE_VM|CLONE_UNTRACED, (unsigned long)fn,
2148 (unsigned long)arg, NULL, NULL, 0);
2149}
2150
2151#ifdef __ARCH_WANT_SYS_FORK
2152SYSCALL_DEFINE0(fork)
2153{
2154#ifdef CONFIG_MMU
2155 return _do_fork(SIGCHLD, 0, 0, NULL, NULL, 0);
2156#else
2157 /* can not support in nommu mode */
2158 return -EINVAL;
2159#endif
2160}
2161#endif
2162
2163#ifdef __ARCH_WANT_SYS_VFORK
2164SYSCALL_DEFINE0(vfork)
2165{
2166 return _do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, 0,
2167 0, NULL, NULL, 0);
2168}
2169#endif
2170
2171#ifdef __ARCH_WANT_SYS_CLONE
2172#ifdef CONFIG_CLONE_BACKWARDS
2173SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2174 int __user *, parent_tidptr,
2175 unsigned long, tls,
2176 int __user *, child_tidptr)
2177#elif defined(CONFIG_CLONE_BACKWARDS2)
2178SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags,
2179 int __user *, parent_tidptr,
2180 int __user *, child_tidptr,
2181 unsigned long, tls)
2182#elif defined(CONFIG_CLONE_BACKWARDS3)
2183SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp,
2184 int, stack_size,
2185 int __user *, parent_tidptr,
2186 int __user *, child_tidptr,
2187 unsigned long, tls)
2188#else
2189SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
2190 int __user *, parent_tidptr,
2191 int __user *, child_tidptr,
2192 unsigned long, tls)
2193#endif
2194{
2195 return _do_fork(clone_flags, newsp, 0, parent_tidptr, child_tidptr, tls);
2196}
2197#endif
2198
2199void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data)
2200{
2201 struct task_struct *leader, *parent, *child;
2202 int res;
2203
2204 read_lock(&tasklist_lock);
2205 leader = top = top->group_leader;
2206down:
2207 for_each_thread(leader, parent) {
2208 list_for_each_entry(child, &parent->children, sibling) {
2209 res = visitor(child, data);
2210 if (res) {
2211 if (res < 0)
2212 goto out;
2213 leader = child;
2214 goto down;
2215 }
2216up:
2217 ;
2218 }
2219 }
2220
2221 if (leader != top) {
2222 child = leader;
2223 parent = child->real_parent;
2224 leader = parent->group_leader;
2225 goto up;
2226 }
2227out:
2228 read_unlock(&tasklist_lock);
2229}
2230
2231#ifndef ARCH_MIN_MMSTRUCT_ALIGN
2232#define ARCH_MIN_MMSTRUCT_ALIGN 0
2233#endif
2234
2235static void sighand_ctor(void *data)
2236{
2237 struct sighand_struct *sighand = data;
2238
2239 spin_lock_init(&sighand->siglock);
2240 init_waitqueue_head(&sighand->signalfd_wqh);
2241}
2242
2243void __init proc_caches_init(void)
2244{
2245 sighand_cachep = kmem_cache_create("sighand_cache",
2246 sizeof(struct sighand_struct), 0,
2247 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_TYPESAFE_BY_RCU|
2248 SLAB_ACCOUNT, sighand_ctor);
2249 signal_cachep = kmem_cache_create("signal_cache",
2250 sizeof(struct signal_struct), 0,
2251 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2252 NULL);
2253 files_cachep = kmem_cache_create("files_cache",
2254 sizeof(struct files_struct), 0,
2255 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2256 NULL);
2257 fs_cachep = kmem_cache_create("fs_cache",
2258 sizeof(struct fs_struct), 0,
2259 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2260 NULL);
2261 /*
2262 * FIXME! The "sizeof(struct mm_struct)" currently includes the
2263 * whole struct cpumask for the OFFSTACK case. We could change
2264 * this to *only* allocate as much of it as required by the
2265 * maximum number of CPU's we can ever have. The cpumask_allocation
2266 * is at the end of the structure, exactly for that reason.
2267 */
2268 mm_cachep = kmem_cache_create_usercopy("mm_struct",
2269 sizeof(struct mm_struct), ARCH_MIN_MMSTRUCT_ALIGN,
2270 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
2271 offsetof(struct mm_struct, saved_auxv),
2272 sizeof_field(struct mm_struct, saved_auxv),
2273 NULL);
2274 vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT);
2275 mmap_init();
2276 nsproxy_cache_init();
2277}
2278
2279/*
2280 * Check constraints on flags passed to the unshare system call.
2281 */
2282static int check_unshare_flags(unsigned long unshare_flags)
2283{
2284 if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
2285 CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
2286 CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET|
2287 CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP))
2288 return -EINVAL;
2289 /*
2290 * Not implemented, but pretend it works if there is nothing
2291 * to unshare. Note that unsharing the address space or the
2292 * signal handlers also need to unshare the signal queues (aka
2293 * CLONE_THREAD).
2294 */
2295 if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) {
2296 if (!thread_group_empty(current))
2297 return -EINVAL;
2298 }
2299 if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) {
2300 if (atomic_read(¤t->sighand->count) > 1)
2301 return -EINVAL;
2302 }
2303 if (unshare_flags & CLONE_VM) {
2304 if (!current_is_single_threaded())
2305 return -EINVAL;
2306 }
2307
2308 return 0;
2309}
2310
2311/*
2312 * Unshare the filesystem structure if it is being shared
2313 */
2314static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
2315{
2316 struct fs_struct *fs = current->fs;
2317
2318 if (!(unshare_flags & CLONE_FS) || !fs)
2319 return 0;
2320
2321 /* don't need lock here; in the worst case we'll do useless copy */
2322 if (fs->users == 1)
2323 return 0;
2324
2325 *new_fsp = copy_fs_struct(fs);
2326 if (!*new_fsp)
2327 return -ENOMEM;
2328
2329 return 0;
2330}
2331
2332/*
2333 * Unshare file descriptor table if it is being shared
2334 */
2335static int unshare_fd(unsigned long unshare_flags, struct files_struct **new_fdp)
2336{
2337 struct files_struct *fd = current->files;
2338 int error = 0;
2339
2340 if ((unshare_flags & CLONE_FILES) &&
2341 (fd && atomic_read(&fd->count) > 1)) {
2342 *new_fdp = dup_fd(fd, &error);
2343 if (!*new_fdp)
2344 return error;
2345 }
2346
2347 return 0;
2348}
2349
2350/*
2351 * unshare allows a process to 'unshare' part of the process
2352 * context which was originally shared using clone. copy_*
2353 * functions used by do_fork() cannot be used here directly
2354 * because they modify an inactive task_struct that is being
2355 * constructed. Here we are modifying the current, active,
2356 * task_struct.
2357 */
2358int ksys_unshare(unsigned long unshare_flags)
2359{
2360 struct fs_struct *fs, *new_fs = NULL;
2361 struct files_struct *fd, *new_fd = NULL;
2362 struct cred *new_cred = NULL;
2363 struct nsproxy *new_nsproxy = NULL;
2364 int do_sysvsem = 0;
2365 int err;
2366
2367 /*
2368 * If unsharing a user namespace must also unshare the thread group
2369 * and unshare the filesystem root and working directories.
2370 */
2371 if (unshare_flags & CLONE_NEWUSER)
2372 unshare_flags |= CLONE_THREAD | CLONE_FS;
2373 /*
2374 * If unsharing vm, must also unshare signal handlers.
2375 */
2376 if (unshare_flags & CLONE_VM)
2377 unshare_flags |= CLONE_SIGHAND;
2378 /*
2379 * If unsharing a signal handlers, must also unshare the signal queues.
2380 */
2381 if (unshare_flags & CLONE_SIGHAND)
2382 unshare_flags |= CLONE_THREAD;
2383 /*
2384 * If unsharing namespace, must also unshare filesystem information.
2385 */
2386 if (unshare_flags & CLONE_NEWNS)
2387 unshare_flags |= CLONE_FS;
2388
2389 err = check_unshare_flags(unshare_flags);
2390 if (err)
2391 goto bad_unshare_out;
2392 /*
2393 * CLONE_NEWIPC must also detach from the undolist: after switching
2394 * to a new ipc namespace, the semaphore arrays from the old
2395 * namespace are unreachable.
2396 */
2397 if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM))
2398 do_sysvsem = 1;
2399 err = unshare_fs(unshare_flags, &new_fs);
2400 if (err)
2401 goto bad_unshare_out;
2402 err = unshare_fd(unshare_flags, &new_fd);
2403 if (err)
2404 goto bad_unshare_cleanup_fs;
2405 err = unshare_userns(unshare_flags, &new_cred);
2406 if (err)
2407 goto bad_unshare_cleanup_fd;
2408 err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy,
2409 new_cred, new_fs);
2410 if (err)
2411 goto bad_unshare_cleanup_cred;
2412
2413 if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) {
2414 if (do_sysvsem) {
2415 /*
2416 * CLONE_SYSVSEM is equivalent to sys_exit().
2417 */
2418 exit_sem(current);
2419 }
2420 if (unshare_flags & CLONE_NEWIPC) {
2421 /* Orphan segments in old ns (see sem above). */
2422 exit_shm(current);
2423 shm_init_task(current);
2424 }
2425
2426 if (new_nsproxy)
2427 switch_task_namespaces(current, new_nsproxy);
2428
2429 task_lock(current);
2430
2431 if (new_fs) {
2432 fs = current->fs;
2433 spin_lock(&fs->lock);
2434 current->fs = new_fs;
2435 if (--fs->users)
2436 new_fs = NULL;
2437 else
2438 new_fs = fs;
2439 spin_unlock(&fs->lock);
2440 }
2441
2442 if (new_fd) {
2443 fd = current->files;
2444 current->files = new_fd;
2445 new_fd = fd;
2446 }
2447
2448 task_unlock(current);
2449
2450 if (new_cred) {
2451 /* Install the new user namespace */
2452 commit_creds(new_cred);
2453 new_cred = NULL;
2454 }
2455 }
2456
2457 perf_event_namespaces(current);
2458
2459bad_unshare_cleanup_cred:
2460 if (new_cred)
2461 put_cred(new_cred);
2462bad_unshare_cleanup_fd:
2463 if (new_fd)
2464 put_files_struct(new_fd);
2465
2466bad_unshare_cleanup_fs:
2467 if (new_fs)
2468 free_fs_struct(new_fs);
2469
2470bad_unshare_out:
2471 return err;
2472}
2473
2474SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags)
2475{
2476 return ksys_unshare(unshare_flags);
2477}
2478
2479/*
2480 * Helper to unshare the files of the current task.
2481 * We don't want to expose copy_files internals to
2482 * the exec layer of the kernel.
2483 */
2484
2485int unshare_files(struct files_struct **displaced)
2486{
2487 struct task_struct *task = current;
2488 struct files_struct *copy = NULL;
2489 int error;
2490
2491 error = unshare_fd(CLONE_FILES, ©);
2492 if (error || !copy) {
2493 *displaced = NULL;
2494 return error;
2495 }
2496 *displaced = task->files;
2497 task_lock(task);
2498 task->files = copy;
2499 task_unlock(task);
2500 return 0;
2501}
2502
2503int sysctl_max_threads(struct ctl_table *table, int write,
2504 void __user *buffer, size_t *lenp, loff_t *ppos)
2505{
2506 struct ctl_table t;
2507 int ret;
2508 int threads = max_threads;
2509 int min = MIN_THREADS;
2510 int max = MAX_THREADS;
2511
2512 t = *table;
2513 t.data = &threads;
2514 t.extra1 = &min;
2515 t.extra2 = &max;
2516
2517 ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
2518 if (ret || !write)
2519 return ret;
2520
2521 set_max_threads(threads);
2522
2523 return 0;
2524}
1// SPDX-License-Identifier: GPL-2.0-only
2/*
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
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>
44#include <linux/fs.h>
45#include <linux/mm.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/syscall_user_dispatch.h>
57#include <linux/jiffies.h>
58#include <linux/futex.h>
59#include <linux/compat.h>
60#include <linux/kthread.h>
61#include <linux/task_io_accounting_ops.h>
62#include <linux/rcupdate.h>
63#include <linux/ptrace.h>
64#include <linux/mount.h>
65#include <linux/audit.h>
66#include <linux/memcontrol.h>
67#include <linux/ftrace.h>
68#include <linux/proc_fs.h>
69#include <linux/profile.h>
70#include <linux/rmap.h>
71#include <linux/ksm.h>
72#include <linux/acct.h>
73#include <linux/userfaultfd_k.h>
74#include <linux/tsacct_kern.h>
75#include <linux/cn_proc.h>
76#include <linux/freezer.h>
77#include <linux/delayacct.h>
78#include <linux/taskstats_kern.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>
100#include <linux/stackprotector.h>
101#include <linux/user_events.h>
102#include <linux/iommu.h>
103#include <linux/rseq.h>
104
105#include <asm/pgalloc.h>
106#include <linux/uaccess.h>
107#include <asm/mmu_context.h>
108#include <asm/cacheflush.h>
109#include <asm/tlbflush.h>
110
111#include <trace/events/sched.h>
112
113#define CREATE_TRACE_POINTS
114#include <trace/events/task.h>
115
116/*
117 * Minimum number of threads to boot the kernel
118 */
119#define MIN_THREADS 20
120
121/*
122 * Maximum number of threads
123 */
124#define MAX_THREADS FUTEX_TID_MASK
125
126/*
127 * Protected counters by write_lock_irq(&tasklist_lock)
128 */
129unsigned long total_forks; /* Handle normal Linux uptimes. */
130int nr_threads; /* The idle threads do not count.. */
131
132static int max_threads; /* tunable limit on nr_threads */
133
134#define NAMED_ARRAY_INDEX(x) [x] = __stringify(x)
135
136static const char * const resident_page_types[] = {
137 NAMED_ARRAY_INDEX(MM_FILEPAGES),
138 NAMED_ARRAY_INDEX(MM_ANONPAGES),
139 NAMED_ARRAY_INDEX(MM_SWAPENTS),
140 NAMED_ARRAY_INDEX(MM_SHMEMPAGES),
141};
142
143DEFINE_PER_CPU(unsigned long, process_counts) = 0;
144
145__cacheline_aligned DEFINE_RWLOCK(tasklist_lock); /* outer */
146
147#ifdef CONFIG_PROVE_RCU
148int lockdep_tasklist_lock_is_held(void)
149{
150 return lockdep_is_held(&tasklist_lock);
151}
152EXPORT_SYMBOL_GPL(lockdep_tasklist_lock_is_held);
153#endif /* #ifdef CONFIG_PROVE_RCU */
154
155int nr_processes(void)
156{
157 int cpu;
158 int total = 0;
159
160 for_each_possible_cpu(cpu)
161 total += per_cpu(process_counts, cpu);
162
163 return total;
164}
165
166void __weak arch_release_task_struct(struct task_struct *tsk)
167{
168}
169
170static struct kmem_cache *task_struct_cachep;
171
172static inline struct task_struct *alloc_task_struct_node(int node)
173{
174 return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
175}
176
177static inline void free_task_struct(struct task_struct *tsk)
178{
179 kmem_cache_free(task_struct_cachep, tsk);
180}
181
182/*
183 * Allocate pages if THREAD_SIZE is >= PAGE_SIZE, otherwise use a
184 * kmemcache based allocator.
185 */
186# if THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)
187
188# ifdef CONFIG_VMAP_STACK
189/*
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.
192 */
193#define NR_CACHED_STACKS 2
194static DEFINE_PER_CPU(struct vm_struct *, cached_stacks[NR_CACHED_STACKS]);
195
196struct vm_stack {
197 struct rcu_head rcu;
198 struct vm_struct *stack_vm_area;
199};
200
201static bool try_release_thread_stack_to_cache(struct vm_struct *vm)
202{
203 unsigned int i;
204
205 for (i = 0; i < NR_CACHED_STACKS; i++) {
206 if (this_cpu_cmpxchg(cached_stacks[i], NULL, vm) != NULL)
207 continue;
208 return true;
209 }
210 return false;
211}
212
213static void thread_stack_free_rcu(struct rcu_head *rh)
214{
215 struct vm_stack *vm_stack = container_of(rh, struct vm_stack, rcu);
216
217 if (try_release_thread_stack_to_cache(vm_stack->stack_vm_area))
218 return;
219
220 vfree(vm_stack);
221}
222
223static void thread_stack_delayed_free(struct task_struct *tsk)
224{
225 struct vm_stack *vm_stack = tsk->stack;
226
227 vm_stack->stack_vm_area = tsk->stack_vm_area;
228 call_rcu(&vm_stack->rcu, thread_stack_free_rcu);
229}
230
231static int free_vm_stack_cache(unsigned int cpu)
232{
233 struct vm_struct **cached_vm_stacks = per_cpu_ptr(cached_stacks, cpu);
234 int i;
235
236 for (i = 0; i < NR_CACHED_STACKS; i++) {
237 struct vm_struct *vm_stack = cached_vm_stacks[i];
238
239 if (!vm_stack)
240 continue;
241
242 vfree(vm_stack->addr);
243 cached_vm_stacks[i] = NULL;
244 }
245
246 return 0;
247}
248
249static int memcg_charge_kernel_stack(struct vm_struct *vm)
250{
251 int i;
252 int ret;
253 int nr_charged = 0;
254
255 BUG_ON(vm->nr_pages != THREAD_SIZE / PAGE_SIZE);
256
257 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++) {
258 ret = memcg_kmem_charge_page(vm->pages[i], GFP_KERNEL, 0);
259 if (ret)
260 goto err;
261 nr_charged++;
262 }
263 return 0;
264err:
265 for (i = 0; i < nr_charged; i++)
266 memcg_kmem_uncharge_page(vm->pages[i], 0);
267 return ret;
268}
269
270static int alloc_thread_stack_node(struct task_struct *tsk, int node)
271{
272 struct vm_struct *vm;
273 void *stack;
274 int i;
275
276 for (i = 0; i < NR_CACHED_STACKS; i++) {
277 struct vm_struct *s;
278
279 s = this_cpu_xchg(cached_stacks[i], NULL);
280
281 if (!s)
282 continue;
283
284 /* Reset stack metadata. */
285 kasan_unpoison_range(s->addr, THREAD_SIZE);
286
287 stack = kasan_reset_tag(s->addr);
288
289 /* Clear stale pointers from reused stack. */
290 memset(stack, 0, THREAD_SIZE);
291
292 if (memcg_charge_kernel_stack(s)) {
293 vfree(s->addr);
294 return -ENOMEM;
295 }
296
297 tsk->stack_vm_area = s;
298 tsk->stack = stack;
299 return 0;
300 }
301
302 /*
303 * Allocated stacks are cached and later reused by new threads,
304 * so memcg accounting is performed manually on assigning/releasing
305 * stacks to tasks. Drop __GFP_ACCOUNT.
306 */
307 stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN,
308 VMALLOC_START, VMALLOC_END,
309 THREADINFO_GFP & ~__GFP_ACCOUNT,
310 PAGE_KERNEL,
311 0, node, __builtin_return_address(0));
312 if (!stack)
313 return -ENOMEM;
314
315 vm = find_vm_area(stack);
316 if (memcg_charge_kernel_stack(vm)) {
317 vfree(stack);
318 return -ENOMEM;
319 }
320 /*
321 * We can't call find_vm_area() in interrupt context, and
322 * free_thread_stack() can be called in interrupt context,
323 * so cache the vm_struct.
324 */
325 tsk->stack_vm_area = vm;
326 stack = kasan_reset_tag(stack);
327 tsk->stack = stack;
328 return 0;
329}
330
331static void free_thread_stack(struct task_struct *tsk)
332{
333 if (!try_release_thread_stack_to_cache(tsk->stack_vm_area))
334 thread_stack_delayed_free(tsk);
335
336 tsk->stack = NULL;
337 tsk->stack_vm_area = NULL;
338}
339
340# else /* !CONFIG_VMAP_STACK */
341
342static void thread_stack_free_rcu(struct rcu_head *rh)
343{
344 __free_pages(virt_to_page(rh), THREAD_SIZE_ORDER);
345}
346
347static void thread_stack_delayed_free(struct task_struct *tsk)
348{
349 struct rcu_head *rh = tsk->stack;
350
351 call_rcu(rh, thread_stack_free_rcu);
352}
353
354static int alloc_thread_stack_node(struct task_struct *tsk, int node)
355{
356 struct page *page = alloc_pages_node(node, THREADINFO_GFP,
357 THREAD_SIZE_ORDER);
358
359 if (likely(page)) {
360 tsk->stack = kasan_reset_tag(page_address(page));
361 return 0;
362 }
363 return -ENOMEM;
364}
365
366static void free_thread_stack(struct task_struct *tsk)
367{
368 thread_stack_delayed_free(tsk);
369 tsk->stack = NULL;
370}
371
372# endif /* CONFIG_VMAP_STACK */
373# else /* !(THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK)) */
374
375static struct kmem_cache *thread_stack_cache;
376
377static void thread_stack_free_rcu(struct rcu_head *rh)
378{
379 kmem_cache_free(thread_stack_cache, rh);
380}
381
382static void thread_stack_delayed_free(struct task_struct *tsk)
383{
384 struct rcu_head *rh = tsk->stack;
385
386 call_rcu(rh, thread_stack_free_rcu);
387}
388
389static int alloc_thread_stack_node(struct task_struct *tsk, int node)
390{
391 unsigned long *stack;
392 stack = kmem_cache_alloc_node(thread_stack_cache, THREADINFO_GFP, node);
393 stack = kasan_reset_tag(stack);
394 tsk->stack = stack;
395 return stack ? 0 : -ENOMEM;
396}
397
398static void free_thread_stack(struct task_struct *tsk)
399{
400 thread_stack_delayed_free(tsk);
401 tsk->stack = NULL;
402}
403
404void thread_stack_cache_init(void)
405{
406 thread_stack_cache = kmem_cache_create_usercopy("thread_stack",
407 THREAD_SIZE, THREAD_SIZE, 0, 0,
408 THREAD_SIZE, NULL);
409 BUG_ON(thread_stack_cache == NULL);
410}
411
412# endif /* THREAD_SIZE >= PAGE_SIZE || defined(CONFIG_VMAP_STACK) */
413
414/* SLAB cache for signal_struct structures (tsk->signal) */
415static struct kmem_cache *signal_cachep;
416
417/* SLAB cache for sighand_struct structures (tsk->sighand) */
418struct kmem_cache *sighand_cachep;
419
420/* SLAB cache for files_struct structures (tsk->files) */
421struct kmem_cache *files_cachep;
422
423/* SLAB cache for fs_struct structures (tsk->fs) */
424struct kmem_cache *fs_cachep;
425
426/* SLAB cache for vm_area_struct structures */
427static struct kmem_cache *vm_area_cachep;
428
429/* SLAB cache for mm_struct structures (tsk->mm) */
430static struct kmem_cache *mm_cachep;
431
432#ifdef CONFIG_PER_VMA_LOCK
433
434/* SLAB cache for vm_area_struct.lock */
435static struct kmem_cache *vma_lock_cachep;
436
437static bool vma_lock_alloc(struct vm_area_struct *vma)
438{
439 vma->vm_lock = kmem_cache_alloc(vma_lock_cachep, GFP_KERNEL);
440 if (!vma->vm_lock)
441 return false;
442
443 init_rwsem(&vma->vm_lock->lock);
444 vma->vm_lock_seq = -1;
445
446 return true;
447}
448
449static inline void vma_lock_free(struct vm_area_struct *vma)
450{
451 kmem_cache_free(vma_lock_cachep, vma->vm_lock);
452}
453
454#else /* CONFIG_PER_VMA_LOCK */
455
456static inline bool vma_lock_alloc(struct vm_area_struct *vma) { return true; }
457static inline void vma_lock_free(struct vm_area_struct *vma) {}
458
459#endif /* CONFIG_PER_VMA_LOCK */
460
461struct vm_area_struct *vm_area_alloc(struct mm_struct *mm)
462{
463 struct vm_area_struct *vma;
464
465 vma = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
466 if (!vma)
467 return NULL;
468
469 vma_init(vma, mm);
470 if (!vma_lock_alloc(vma)) {
471 kmem_cache_free(vm_area_cachep, vma);
472 return NULL;
473 }
474
475 return vma;
476}
477
478struct vm_area_struct *vm_area_dup(struct vm_area_struct *orig)
479{
480 struct vm_area_struct *new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
481
482 if (!new)
483 return NULL;
484
485 ASSERT_EXCLUSIVE_WRITER(orig->vm_flags);
486 ASSERT_EXCLUSIVE_WRITER(orig->vm_file);
487 /*
488 * orig->shared.rb may be modified concurrently, but the clone
489 * will be reinitialized.
490 */
491 data_race(memcpy(new, orig, sizeof(*new)));
492 if (!vma_lock_alloc(new)) {
493 kmem_cache_free(vm_area_cachep, new);
494 return NULL;
495 }
496 INIT_LIST_HEAD(&new->anon_vma_chain);
497 vma_numab_state_init(new);
498 dup_anon_vma_name(orig, new);
499
500 return new;
501}
502
503void __vm_area_free(struct vm_area_struct *vma)
504{
505 vma_numab_state_free(vma);
506 free_anon_vma_name(vma);
507 vma_lock_free(vma);
508 kmem_cache_free(vm_area_cachep, vma);
509}
510
511#ifdef CONFIG_PER_VMA_LOCK
512static void vm_area_free_rcu_cb(struct rcu_head *head)
513{
514 struct vm_area_struct *vma = container_of(head, struct vm_area_struct,
515 vm_rcu);
516
517 /* The vma should not be locked while being destroyed. */
518 VM_BUG_ON_VMA(rwsem_is_locked(&vma->vm_lock->lock), vma);
519 __vm_area_free(vma);
520}
521#endif
522
523void vm_area_free(struct vm_area_struct *vma)
524{
525#ifdef CONFIG_PER_VMA_LOCK
526 call_rcu(&vma->vm_rcu, vm_area_free_rcu_cb);
527#else
528 __vm_area_free(vma);
529#endif
530}
531
532static void account_kernel_stack(struct task_struct *tsk, int account)
533{
534 if (IS_ENABLED(CONFIG_VMAP_STACK)) {
535 struct vm_struct *vm = task_stack_vm_area(tsk);
536 int i;
537
538 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++)
539 mod_lruvec_page_state(vm->pages[i], NR_KERNEL_STACK_KB,
540 account * (PAGE_SIZE / 1024));
541 } else {
542 void *stack = task_stack_page(tsk);
543
544 /* All stack pages are in the same node. */
545 mod_lruvec_kmem_state(stack, NR_KERNEL_STACK_KB,
546 account * (THREAD_SIZE / 1024));
547 }
548}
549
550void exit_task_stack_account(struct task_struct *tsk)
551{
552 account_kernel_stack(tsk, -1);
553
554 if (IS_ENABLED(CONFIG_VMAP_STACK)) {
555 struct vm_struct *vm;
556 int i;
557
558 vm = task_stack_vm_area(tsk);
559 for (i = 0; i < THREAD_SIZE / PAGE_SIZE; i++)
560 memcg_kmem_uncharge_page(vm->pages[i], 0);
561 }
562}
563
564static void release_task_stack(struct task_struct *tsk)
565{
566 if (WARN_ON(READ_ONCE(tsk->__state) != TASK_DEAD))
567 return; /* Better to leak the stack than to free prematurely */
568
569 free_thread_stack(tsk);
570}
571
572#ifdef CONFIG_THREAD_INFO_IN_TASK
573void put_task_stack(struct task_struct *tsk)
574{
575 if (refcount_dec_and_test(&tsk->stack_refcount))
576 release_task_stack(tsk);
577}
578#endif
579
580void free_task(struct task_struct *tsk)
581{
582#ifdef CONFIG_SECCOMP
583 WARN_ON_ONCE(tsk->seccomp.filter);
584#endif
585 release_user_cpus_ptr(tsk);
586 scs_release(tsk);
587
588#ifndef CONFIG_THREAD_INFO_IN_TASK
589 /*
590 * The task is finally done with both the stack and thread_info,
591 * so free both.
592 */
593 release_task_stack(tsk);
594#else
595 /*
596 * If the task had a separate stack allocation, it should be gone
597 * by now.
598 */
599 WARN_ON_ONCE(refcount_read(&tsk->stack_refcount) != 0);
600#endif
601 rt_mutex_debug_task_free(tsk);
602 ftrace_graph_exit_task(tsk);
603 arch_release_task_struct(tsk);
604 if (tsk->flags & PF_KTHREAD)
605 free_kthread_struct(tsk);
606 bpf_task_storage_free(tsk);
607 free_task_struct(tsk);
608}
609EXPORT_SYMBOL(free_task);
610
611static void dup_mm_exe_file(struct mm_struct *mm, struct mm_struct *oldmm)
612{
613 struct file *exe_file;
614
615 exe_file = get_mm_exe_file(oldmm);
616 RCU_INIT_POINTER(mm->exe_file, exe_file);
617 /*
618 * We depend on the oldmm having properly denied write access to the
619 * exe_file already.
620 */
621 if (exe_file && deny_write_access(exe_file))
622 pr_warn_once("deny_write_access() failed in %s\n", __func__);
623}
624
625#ifdef CONFIG_MMU
626static __latent_entropy int dup_mmap(struct mm_struct *mm,
627 struct mm_struct *oldmm)
628{
629 struct vm_area_struct *mpnt, *tmp;
630 int retval;
631 unsigned long charge = 0;
632 LIST_HEAD(uf);
633 VMA_ITERATOR(vmi, mm, 0);
634
635 uprobe_start_dup_mmap();
636 if (mmap_write_lock_killable(oldmm)) {
637 retval = -EINTR;
638 goto fail_uprobe_end;
639 }
640 flush_cache_dup_mm(oldmm);
641 uprobe_dup_mmap(oldmm, mm);
642 /*
643 * Not linked in yet - no deadlock potential:
644 */
645 mmap_write_lock_nested(mm, SINGLE_DEPTH_NESTING);
646
647 /* No ordering required: file already has been exposed. */
648 dup_mm_exe_file(mm, oldmm);
649
650 mm->total_vm = oldmm->total_vm;
651 mm->data_vm = oldmm->data_vm;
652 mm->exec_vm = oldmm->exec_vm;
653 mm->stack_vm = oldmm->stack_vm;
654
655 retval = ksm_fork(mm, oldmm);
656 if (retval)
657 goto out;
658 khugepaged_fork(mm, oldmm);
659
660 /* Use __mt_dup() to efficiently build an identical maple tree. */
661 retval = __mt_dup(&oldmm->mm_mt, &mm->mm_mt, GFP_KERNEL);
662 if (unlikely(retval))
663 goto out;
664
665 mt_clear_in_rcu(vmi.mas.tree);
666 for_each_vma(vmi, mpnt) {
667 struct file *file;
668
669 vma_start_write(mpnt);
670 if (mpnt->vm_flags & VM_DONTCOPY) {
671 retval = vma_iter_clear_gfp(&vmi, mpnt->vm_start,
672 mpnt->vm_end, GFP_KERNEL);
673 if (retval)
674 goto loop_out;
675
676 vm_stat_account(mm, mpnt->vm_flags, -vma_pages(mpnt));
677 continue;
678 }
679 charge = 0;
680 /*
681 * Don't duplicate many vmas if we've been oom-killed (for
682 * example)
683 */
684 if (fatal_signal_pending(current)) {
685 retval = -EINTR;
686 goto loop_out;
687 }
688 if (mpnt->vm_flags & VM_ACCOUNT) {
689 unsigned long len = vma_pages(mpnt);
690
691 if (security_vm_enough_memory_mm(oldmm, len)) /* sic */
692 goto fail_nomem;
693 charge = len;
694 }
695 tmp = vm_area_dup(mpnt);
696 if (!tmp)
697 goto fail_nomem;
698 retval = vma_dup_policy(mpnt, tmp);
699 if (retval)
700 goto fail_nomem_policy;
701 tmp->vm_mm = mm;
702 retval = dup_userfaultfd(tmp, &uf);
703 if (retval)
704 goto fail_nomem_anon_vma_fork;
705 if (tmp->vm_flags & VM_WIPEONFORK) {
706 /*
707 * VM_WIPEONFORK gets a clean slate in the child.
708 * Don't prepare anon_vma until fault since we don't
709 * copy page for current vma.
710 */
711 tmp->anon_vma = NULL;
712 } else if (anon_vma_fork(tmp, mpnt))
713 goto fail_nomem_anon_vma_fork;
714 vm_flags_clear(tmp, VM_LOCKED_MASK);
715 file = tmp->vm_file;
716 if (file) {
717 struct address_space *mapping = file->f_mapping;
718
719 get_file(file);
720 i_mmap_lock_write(mapping);
721 if (vma_is_shared_maywrite(tmp))
722 mapping_allow_writable(mapping);
723 flush_dcache_mmap_lock(mapping);
724 /* insert tmp into the share list, just after mpnt */
725 vma_interval_tree_insert_after(tmp, mpnt,
726 &mapping->i_mmap);
727 flush_dcache_mmap_unlock(mapping);
728 i_mmap_unlock_write(mapping);
729 }
730
731 /*
732 * Copy/update hugetlb private vma information.
733 */
734 if (is_vm_hugetlb_page(tmp))
735 hugetlb_dup_vma_private(tmp);
736
737 /*
738 * Link the vma into the MT. After using __mt_dup(), memory
739 * allocation is not necessary here, so it cannot fail.
740 */
741 vma_iter_bulk_store(&vmi, tmp);
742
743 mm->map_count++;
744 if (!(tmp->vm_flags & VM_WIPEONFORK))
745 retval = copy_page_range(tmp, mpnt);
746
747 if (tmp->vm_ops && tmp->vm_ops->open)
748 tmp->vm_ops->open(tmp);
749
750 if (retval) {
751 mpnt = vma_next(&vmi);
752 goto loop_out;
753 }
754 }
755 /* a new mm has just been created */
756 retval = arch_dup_mmap(oldmm, mm);
757loop_out:
758 vma_iter_free(&vmi);
759 if (!retval) {
760 mt_set_in_rcu(vmi.mas.tree);
761 } else if (mpnt) {
762 /*
763 * The entire maple tree has already been duplicated. If the
764 * mmap duplication fails, mark the failure point with
765 * XA_ZERO_ENTRY. In exit_mmap(), if this marker is encountered,
766 * stop releasing VMAs that have not been duplicated after this
767 * point.
768 */
769 mas_set_range(&vmi.mas, mpnt->vm_start, mpnt->vm_end - 1);
770 mas_store(&vmi.mas, XA_ZERO_ENTRY);
771 }
772out:
773 mmap_write_unlock(mm);
774 flush_tlb_mm(oldmm);
775 mmap_write_unlock(oldmm);
776 dup_userfaultfd_complete(&uf);
777fail_uprobe_end:
778 uprobe_end_dup_mmap();
779 return retval;
780
781fail_nomem_anon_vma_fork:
782 mpol_put(vma_policy(tmp));
783fail_nomem_policy:
784 vm_area_free(tmp);
785fail_nomem:
786 retval = -ENOMEM;
787 vm_unacct_memory(charge);
788 goto loop_out;
789}
790
791static inline int mm_alloc_pgd(struct mm_struct *mm)
792{
793 mm->pgd = pgd_alloc(mm);
794 if (unlikely(!mm->pgd))
795 return -ENOMEM;
796 return 0;
797}
798
799static inline void mm_free_pgd(struct mm_struct *mm)
800{
801 pgd_free(mm, mm->pgd);
802}
803#else
804static int dup_mmap(struct mm_struct *mm, struct mm_struct *oldmm)
805{
806 mmap_write_lock(oldmm);
807 dup_mm_exe_file(mm, oldmm);
808 mmap_write_unlock(oldmm);
809 return 0;
810}
811#define mm_alloc_pgd(mm) (0)
812#define mm_free_pgd(mm)
813#endif /* CONFIG_MMU */
814
815static void check_mm(struct mm_struct *mm)
816{
817 int i;
818
819 BUILD_BUG_ON_MSG(ARRAY_SIZE(resident_page_types) != NR_MM_COUNTERS,
820 "Please make sure 'struct resident_page_types[]' is updated as well");
821
822 for (i = 0; i < NR_MM_COUNTERS; i++) {
823 long x = percpu_counter_sum(&mm->rss_stat[i]);
824
825 if (unlikely(x))
826 pr_alert("BUG: Bad rss-counter state mm:%p type:%s val:%ld\n",
827 mm, resident_page_types[i], x);
828 }
829
830 if (mm_pgtables_bytes(mm))
831 pr_alert("BUG: non-zero pgtables_bytes on freeing mm: %ld\n",
832 mm_pgtables_bytes(mm));
833
834#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
835 VM_BUG_ON_MM(mm->pmd_huge_pte, mm);
836#endif
837}
838
839#define allocate_mm() (kmem_cache_alloc(mm_cachep, GFP_KERNEL))
840#define free_mm(mm) (kmem_cache_free(mm_cachep, (mm)))
841
842static void do_check_lazy_tlb(void *arg)
843{
844 struct mm_struct *mm = arg;
845
846 WARN_ON_ONCE(current->active_mm == mm);
847}
848
849static void do_shoot_lazy_tlb(void *arg)
850{
851 struct mm_struct *mm = arg;
852
853 if (current->active_mm == mm) {
854 WARN_ON_ONCE(current->mm);
855 current->active_mm = &init_mm;
856 switch_mm(mm, &init_mm, current);
857 }
858}
859
860static void cleanup_lazy_tlbs(struct mm_struct *mm)
861{
862 if (!IS_ENABLED(CONFIG_MMU_LAZY_TLB_SHOOTDOWN)) {
863 /*
864 * In this case, lazy tlb mms are refounted and would not reach
865 * __mmdrop until all CPUs have switched away and mmdrop()ed.
866 */
867 return;
868 }
869
870 /*
871 * Lazy mm shootdown does not refcount "lazy tlb mm" usage, rather it
872 * requires lazy mm users to switch to another mm when the refcount
873 * drops to zero, before the mm is freed. This requires IPIs here to
874 * switch kernel threads to init_mm.
875 *
876 * archs that use IPIs to flush TLBs can piggy-back that lazy tlb mm
877 * switch with the final userspace teardown TLB flush which leaves the
878 * mm lazy on this CPU but no others, reducing the need for additional
879 * IPIs here. There are cases where a final IPI is still required here,
880 * such as the final mmdrop being performed on a different CPU than the
881 * one exiting, or kernel threads using the mm when userspace exits.
882 *
883 * IPI overheads have not found to be expensive, but they could be
884 * reduced in a number of possible ways, for example (roughly
885 * increasing order of complexity):
886 * - The last lazy reference created by exit_mm() could instead switch
887 * to init_mm, however it's probable this will run on the same CPU
888 * immediately afterwards, so this may not reduce IPIs much.
889 * - A batch of mms requiring IPIs could be gathered and freed at once.
890 * - CPUs store active_mm where it can be remotely checked without a
891 * lock, to filter out false-positives in the cpumask.
892 * - After mm_users or mm_count reaches zero, switching away from the
893 * mm could clear mm_cpumask to reduce some IPIs, perhaps together
894 * with some batching or delaying of the final IPIs.
895 * - A delayed freeing and RCU-like quiescing sequence based on mm
896 * switching to avoid IPIs completely.
897 */
898 on_each_cpu_mask(mm_cpumask(mm), do_shoot_lazy_tlb, (void *)mm, 1);
899 if (IS_ENABLED(CONFIG_DEBUG_VM_SHOOT_LAZIES))
900 on_each_cpu(do_check_lazy_tlb, (void *)mm, 1);
901}
902
903/*
904 * Called when the last reference to the mm
905 * is dropped: either by a lazy thread or by
906 * mmput. Free the page directory and the mm.
907 */
908void __mmdrop(struct mm_struct *mm)
909{
910 BUG_ON(mm == &init_mm);
911 WARN_ON_ONCE(mm == current->mm);
912
913 /* Ensure no CPUs are using this as their lazy tlb mm */
914 cleanup_lazy_tlbs(mm);
915
916 WARN_ON_ONCE(mm == current->active_mm);
917 mm_free_pgd(mm);
918 destroy_context(mm);
919 mmu_notifier_subscriptions_destroy(mm);
920 check_mm(mm);
921 put_user_ns(mm->user_ns);
922 mm_pasid_drop(mm);
923 mm_destroy_cid(mm);
924 percpu_counter_destroy_many(mm->rss_stat, NR_MM_COUNTERS);
925
926 free_mm(mm);
927}
928EXPORT_SYMBOL_GPL(__mmdrop);
929
930static void mmdrop_async_fn(struct work_struct *work)
931{
932 struct mm_struct *mm;
933
934 mm = container_of(work, struct mm_struct, async_put_work);
935 __mmdrop(mm);
936}
937
938static void mmdrop_async(struct mm_struct *mm)
939{
940 if (unlikely(atomic_dec_and_test(&mm->mm_count))) {
941 INIT_WORK(&mm->async_put_work, mmdrop_async_fn);
942 schedule_work(&mm->async_put_work);
943 }
944}
945
946static inline void free_signal_struct(struct signal_struct *sig)
947{
948 taskstats_tgid_free(sig);
949 sched_autogroup_exit(sig);
950 /*
951 * __mmdrop is not safe to call from softirq context on x86 due to
952 * pgd_dtor so postpone it to the async context
953 */
954 if (sig->oom_mm)
955 mmdrop_async(sig->oom_mm);
956 kmem_cache_free(signal_cachep, sig);
957}
958
959static inline void put_signal_struct(struct signal_struct *sig)
960{
961 if (refcount_dec_and_test(&sig->sigcnt))
962 free_signal_struct(sig);
963}
964
965void __put_task_struct(struct task_struct *tsk)
966{
967 WARN_ON(!tsk->exit_state);
968 WARN_ON(refcount_read(&tsk->usage));
969 WARN_ON(tsk == current);
970
971 io_uring_free(tsk);
972 cgroup_free(tsk);
973 task_numa_free(tsk, true);
974 security_task_free(tsk);
975 exit_creds(tsk);
976 delayacct_tsk_free(tsk);
977 put_signal_struct(tsk->signal);
978 sched_core_free(tsk);
979 free_task(tsk);
980}
981EXPORT_SYMBOL_GPL(__put_task_struct);
982
983void __put_task_struct_rcu_cb(struct rcu_head *rhp)
984{
985 struct task_struct *task = container_of(rhp, struct task_struct, rcu);
986
987 __put_task_struct(task);
988}
989EXPORT_SYMBOL_GPL(__put_task_struct_rcu_cb);
990
991void __init __weak arch_task_cache_init(void) { }
992
993/*
994 * set_max_threads
995 */
996static void set_max_threads(unsigned int max_threads_suggested)
997{
998 u64 threads;
999 unsigned long nr_pages = totalram_pages();
1000
1001 /*
1002 * The number of threads shall be limited such that the thread
1003 * structures may only consume a small part of the available memory.
1004 */
1005 if (fls64(nr_pages) + fls64(PAGE_SIZE) > 64)
1006 threads = MAX_THREADS;
1007 else
1008 threads = div64_u64((u64) nr_pages * (u64) PAGE_SIZE,
1009 (u64) THREAD_SIZE * 8UL);
1010
1011 if (threads > max_threads_suggested)
1012 threads = max_threads_suggested;
1013
1014 max_threads = clamp_t(u64, threads, MIN_THREADS, MAX_THREADS);
1015}
1016
1017#ifdef CONFIG_ARCH_WANTS_DYNAMIC_TASK_STRUCT
1018/* Initialized by the architecture: */
1019int arch_task_struct_size __read_mostly;
1020#endif
1021
1022static void task_struct_whitelist(unsigned long *offset, unsigned long *size)
1023{
1024 /* Fetch thread_struct whitelist for the architecture. */
1025 arch_thread_struct_whitelist(offset, size);
1026
1027 /*
1028 * Handle zero-sized whitelist or empty thread_struct, otherwise
1029 * adjust offset to position of thread_struct in task_struct.
1030 */
1031 if (unlikely(*size == 0))
1032 *offset = 0;
1033 else
1034 *offset += offsetof(struct task_struct, thread);
1035}
1036
1037void __init fork_init(void)
1038{
1039 int i;
1040#ifndef ARCH_MIN_TASKALIGN
1041#define ARCH_MIN_TASKALIGN 0
1042#endif
1043 int align = max_t(int, L1_CACHE_BYTES, ARCH_MIN_TASKALIGN);
1044 unsigned long useroffset, usersize;
1045
1046 /* create a slab on which task_structs can be allocated */
1047 task_struct_whitelist(&useroffset, &usersize);
1048 task_struct_cachep = kmem_cache_create_usercopy("task_struct",
1049 arch_task_struct_size, align,
1050 SLAB_PANIC|SLAB_ACCOUNT,
1051 useroffset, usersize, NULL);
1052
1053 /* do the arch specific task caches init */
1054 arch_task_cache_init();
1055
1056 set_max_threads(MAX_THREADS);
1057
1058 init_task.signal->rlim[RLIMIT_NPROC].rlim_cur = max_threads/2;
1059 init_task.signal->rlim[RLIMIT_NPROC].rlim_max = max_threads/2;
1060 init_task.signal->rlim[RLIMIT_SIGPENDING] =
1061 init_task.signal->rlim[RLIMIT_NPROC];
1062
1063 for (i = 0; i < UCOUNT_COUNTS; i++)
1064 init_user_ns.ucount_max[i] = max_threads/2;
1065
1066 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_NPROC, RLIM_INFINITY);
1067 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_MSGQUEUE, RLIM_INFINITY);
1068 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_SIGPENDING, RLIM_INFINITY);
1069 set_userns_rlimit_max(&init_user_ns, UCOUNT_RLIMIT_MEMLOCK, RLIM_INFINITY);
1070
1071#ifdef CONFIG_VMAP_STACK
1072 cpuhp_setup_state(CPUHP_BP_PREPARE_DYN, "fork:vm_stack_cache",
1073 NULL, free_vm_stack_cache);
1074#endif
1075
1076 scs_init();
1077
1078 lockdep_init_task(&init_task);
1079 uprobes_init();
1080}
1081
1082int __weak arch_dup_task_struct(struct task_struct *dst,
1083 struct task_struct *src)
1084{
1085 *dst = *src;
1086 return 0;
1087}
1088
1089void set_task_stack_end_magic(struct task_struct *tsk)
1090{
1091 unsigned long *stackend;
1092
1093 stackend = end_of_stack(tsk);
1094 *stackend = STACK_END_MAGIC; /* for overflow detection */
1095}
1096
1097static struct task_struct *dup_task_struct(struct task_struct *orig, int node)
1098{
1099 struct task_struct *tsk;
1100 int err;
1101
1102 if (node == NUMA_NO_NODE)
1103 node = tsk_fork_get_node(orig);
1104 tsk = alloc_task_struct_node(node);
1105 if (!tsk)
1106 return NULL;
1107
1108 err = arch_dup_task_struct(tsk, orig);
1109 if (err)
1110 goto free_tsk;
1111
1112 err = alloc_thread_stack_node(tsk, node);
1113 if (err)
1114 goto free_tsk;
1115
1116#ifdef CONFIG_THREAD_INFO_IN_TASK
1117 refcount_set(&tsk->stack_refcount, 1);
1118#endif
1119 account_kernel_stack(tsk, 1);
1120
1121 err = scs_prepare(tsk, node);
1122 if (err)
1123 goto free_stack;
1124
1125#ifdef CONFIG_SECCOMP
1126 /*
1127 * We must handle setting up seccomp filters once we're under
1128 * the sighand lock in case orig has changed between now and
1129 * then. Until then, filter must be NULL to avoid messing up
1130 * the usage counts on the error path calling free_task.
1131 */
1132 tsk->seccomp.filter = NULL;
1133#endif
1134
1135 setup_thread_stack(tsk, orig);
1136 clear_user_return_notifier(tsk);
1137 clear_tsk_need_resched(tsk);
1138 set_task_stack_end_magic(tsk);
1139 clear_syscall_work_syscall_user_dispatch(tsk);
1140
1141#ifdef CONFIG_STACKPROTECTOR
1142 tsk->stack_canary = get_random_canary();
1143#endif
1144 if (orig->cpus_ptr == &orig->cpus_mask)
1145 tsk->cpus_ptr = &tsk->cpus_mask;
1146 dup_user_cpus_ptr(tsk, orig, node);
1147
1148 /*
1149 * One for the user space visible state that goes away when reaped.
1150 * One for the scheduler.
1151 */
1152 refcount_set(&tsk->rcu_users, 2);
1153 /* One for the rcu users */
1154 refcount_set(&tsk->usage, 1);
1155#ifdef CONFIG_BLK_DEV_IO_TRACE
1156 tsk->btrace_seq = 0;
1157#endif
1158 tsk->splice_pipe = NULL;
1159 tsk->task_frag.page = NULL;
1160 tsk->wake_q.next = NULL;
1161 tsk->worker_private = NULL;
1162
1163 kcov_task_init(tsk);
1164 kmsan_task_create(tsk);
1165 kmap_local_fork(tsk);
1166
1167#ifdef CONFIG_FAULT_INJECTION
1168 tsk->fail_nth = 0;
1169#endif
1170
1171#ifdef CONFIG_BLK_CGROUP
1172 tsk->throttle_disk = NULL;
1173 tsk->use_memdelay = 0;
1174#endif
1175
1176#ifdef CONFIG_ARCH_HAS_CPU_PASID
1177 tsk->pasid_activated = 0;
1178#endif
1179
1180#ifdef CONFIG_MEMCG
1181 tsk->active_memcg = NULL;
1182#endif
1183
1184#ifdef CONFIG_CPU_SUP_INTEL
1185 tsk->reported_split_lock = 0;
1186#endif
1187
1188#ifdef CONFIG_SCHED_MM_CID
1189 tsk->mm_cid = -1;
1190 tsk->last_mm_cid = -1;
1191 tsk->mm_cid_active = 0;
1192 tsk->migrate_from_cpu = -1;
1193#endif
1194 return tsk;
1195
1196free_stack:
1197 exit_task_stack_account(tsk);
1198 free_thread_stack(tsk);
1199free_tsk:
1200 free_task_struct(tsk);
1201 return NULL;
1202}
1203
1204__cacheline_aligned_in_smp DEFINE_SPINLOCK(mmlist_lock);
1205
1206static unsigned long default_dump_filter = MMF_DUMP_FILTER_DEFAULT;
1207
1208static int __init coredump_filter_setup(char *s)
1209{
1210 default_dump_filter =
1211 (simple_strtoul(s, NULL, 0) << MMF_DUMP_FILTER_SHIFT) &
1212 MMF_DUMP_FILTER_MASK;
1213 return 1;
1214}
1215
1216__setup("coredump_filter=", coredump_filter_setup);
1217
1218#include <linux/init_task.h>
1219
1220static void mm_init_aio(struct mm_struct *mm)
1221{
1222#ifdef CONFIG_AIO
1223 spin_lock_init(&mm->ioctx_lock);
1224 mm->ioctx_table = NULL;
1225#endif
1226}
1227
1228static __always_inline void mm_clear_owner(struct mm_struct *mm,
1229 struct task_struct *p)
1230{
1231#ifdef CONFIG_MEMCG
1232 if (mm->owner == p)
1233 WRITE_ONCE(mm->owner, NULL);
1234#endif
1235}
1236
1237static void mm_init_owner(struct mm_struct *mm, struct task_struct *p)
1238{
1239#ifdef CONFIG_MEMCG
1240 mm->owner = p;
1241#endif
1242}
1243
1244static void mm_init_uprobes_state(struct mm_struct *mm)
1245{
1246#ifdef CONFIG_UPROBES
1247 mm->uprobes_state.xol_area = NULL;
1248#endif
1249}
1250
1251static struct mm_struct *mm_init(struct mm_struct *mm, struct task_struct *p,
1252 struct user_namespace *user_ns)
1253{
1254 mt_init_flags(&mm->mm_mt, MM_MT_FLAGS);
1255 mt_set_external_lock(&mm->mm_mt, &mm->mmap_lock);
1256 atomic_set(&mm->mm_users, 1);
1257 atomic_set(&mm->mm_count, 1);
1258 seqcount_init(&mm->write_protect_seq);
1259 mmap_init_lock(mm);
1260 INIT_LIST_HEAD(&mm->mmlist);
1261#ifdef CONFIG_PER_VMA_LOCK
1262 mm->mm_lock_seq = 0;
1263#endif
1264 mm_pgtables_bytes_init(mm);
1265 mm->map_count = 0;
1266 mm->locked_vm = 0;
1267 atomic64_set(&mm->pinned_vm, 0);
1268 memset(&mm->rss_stat, 0, sizeof(mm->rss_stat));
1269 spin_lock_init(&mm->page_table_lock);
1270 spin_lock_init(&mm->arg_lock);
1271 mm_init_cpumask(mm);
1272 mm_init_aio(mm);
1273 mm_init_owner(mm, p);
1274 mm_pasid_init(mm);
1275 RCU_INIT_POINTER(mm->exe_file, NULL);
1276 mmu_notifier_subscriptions_init(mm);
1277 init_tlb_flush_pending(mm);
1278#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && !USE_SPLIT_PMD_PTLOCKS
1279 mm->pmd_huge_pte = NULL;
1280#endif
1281 mm_init_uprobes_state(mm);
1282 hugetlb_count_init(mm);
1283
1284 if (current->mm) {
1285 mm->flags = mmf_init_flags(current->mm->flags);
1286 mm->def_flags = current->mm->def_flags & VM_INIT_DEF_MASK;
1287 } else {
1288 mm->flags = default_dump_filter;
1289 mm->def_flags = 0;
1290 }
1291
1292 if (mm_alloc_pgd(mm))
1293 goto fail_nopgd;
1294
1295 if (init_new_context(p, mm))
1296 goto fail_nocontext;
1297
1298 if (mm_alloc_cid(mm))
1299 goto fail_cid;
1300
1301 if (percpu_counter_init_many(mm->rss_stat, 0, GFP_KERNEL_ACCOUNT,
1302 NR_MM_COUNTERS))
1303 goto fail_pcpu;
1304
1305 mm->user_ns = get_user_ns(user_ns);
1306 lru_gen_init_mm(mm);
1307 return mm;
1308
1309fail_pcpu:
1310 mm_destroy_cid(mm);
1311fail_cid:
1312 destroy_context(mm);
1313fail_nocontext:
1314 mm_free_pgd(mm);
1315fail_nopgd:
1316 free_mm(mm);
1317 return NULL;
1318}
1319
1320/*
1321 * Allocate and initialize an mm_struct.
1322 */
1323struct mm_struct *mm_alloc(void)
1324{
1325 struct mm_struct *mm;
1326
1327 mm = allocate_mm();
1328 if (!mm)
1329 return NULL;
1330
1331 memset(mm, 0, sizeof(*mm));
1332 return mm_init(mm, current, current_user_ns());
1333}
1334
1335static inline void __mmput(struct mm_struct *mm)
1336{
1337 VM_BUG_ON(atomic_read(&mm->mm_users));
1338
1339 uprobe_clear_state(mm);
1340 exit_aio(mm);
1341 ksm_exit(mm);
1342 khugepaged_exit(mm); /* must run before exit_mmap */
1343 exit_mmap(mm);
1344 mm_put_huge_zero_page(mm);
1345 set_mm_exe_file(mm, NULL);
1346 if (!list_empty(&mm->mmlist)) {
1347 spin_lock(&mmlist_lock);
1348 list_del(&mm->mmlist);
1349 spin_unlock(&mmlist_lock);
1350 }
1351 if (mm->binfmt)
1352 module_put(mm->binfmt->module);
1353 lru_gen_del_mm(mm);
1354 mmdrop(mm);
1355}
1356
1357/*
1358 * Decrement the use count and release all resources for an mm.
1359 */
1360void mmput(struct mm_struct *mm)
1361{
1362 might_sleep();
1363
1364 if (atomic_dec_and_test(&mm->mm_users))
1365 __mmput(mm);
1366}
1367EXPORT_SYMBOL_GPL(mmput);
1368
1369#ifdef CONFIG_MMU
1370static void mmput_async_fn(struct work_struct *work)
1371{
1372 struct mm_struct *mm = container_of(work, struct mm_struct,
1373 async_put_work);
1374
1375 __mmput(mm);
1376}
1377
1378void mmput_async(struct mm_struct *mm)
1379{
1380 if (atomic_dec_and_test(&mm->mm_users)) {
1381 INIT_WORK(&mm->async_put_work, mmput_async_fn);
1382 schedule_work(&mm->async_put_work);
1383 }
1384}
1385EXPORT_SYMBOL_GPL(mmput_async);
1386#endif
1387
1388/**
1389 * set_mm_exe_file - change a reference to the mm's executable file
1390 * @mm: The mm to change.
1391 * @new_exe_file: The new file to use.
1392 *
1393 * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
1394 *
1395 * Main users are mmput() and sys_execve(). Callers prevent concurrent
1396 * invocations: in mmput() nobody alive left, in execve it happens before
1397 * the new mm is made visible to anyone.
1398 *
1399 * Can only fail if new_exe_file != NULL.
1400 */
1401int set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1402{
1403 struct file *old_exe_file;
1404
1405 /*
1406 * It is safe to dereference the exe_file without RCU as
1407 * this function is only called if nobody else can access
1408 * this mm -- see comment above for justification.
1409 */
1410 old_exe_file = rcu_dereference_raw(mm->exe_file);
1411
1412 if (new_exe_file) {
1413 /*
1414 * We expect the caller (i.e., sys_execve) to already denied
1415 * write access, so this is unlikely to fail.
1416 */
1417 if (unlikely(deny_write_access(new_exe_file)))
1418 return -EACCES;
1419 get_file(new_exe_file);
1420 }
1421 rcu_assign_pointer(mm->exe_file, new_exe_file);
1422 if (old_exe_file) {
1423 allow_write_access(old_exe_file);
1424 fput(old_exe_file);
1425 }
1426 return 0;
1427}
1428
1429/**
1430 * replace_mm_exe_file - replace a reference to the mm's executable file
1431 * @mm: The mm to change.
1432 * @new_exe_file: The new file to use.
1433 *
1434 * This changes mm's executable file (shown as symlink /proc/[pid]/exe).
1435 *
1436 * Main user is sys_prctl(PR_SET_MM_MAP/EXE_FILE).
1437 */
1438int replace_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
1439{
1440 struct vm_area_struct *vma;
1441 struct file *old_exe_file;
1442 int ret = 0;
1443
1444 /* Forbid mm->exe_file change if old file still mapped. */
1445 old_exe_file = get_mm_exe_file(mm);
1446 if (old_exe_file) {
1447 VMA_ITERATOR(vmi, mm, 0);
1448 mmap_read_lock(mm);
1449 for_each_vma(vmi, vma) {
1450 if (!vma->vm_file)
1451 continue;
1452 if (path_equal(&vma->vm_file->f_path,
1453 &old_exe_file->f_path)) {
1454 ret = -EBUSY;
1455 break;
1456 }
1457 }
1458 mmap_read_unlock(mm);
1459 fput(old_exe_file);
1460 if (ret)
1461 return ret;
1462 }
1463
1464 ret = deny_write_access(new_exe_file);
1465 if (ret)
1466 return -EACCES;
1467 get_file(new_exe_file);
1468
1469 /* set the new file */
1470 mmap_write_lock(mm);
1471 old_exe_file = rcu_dereference_raw(mm->exe_file);
1472 rcu_assign_pointer(mm->exe_file, new_exe_file);
1473 mmap_write_unlock(mm);
1474
1475 if (old_exe_file) {
1476 allow_write_access(old_exe_file);
1477 fput(old_exe_file);
1478 }
1479 return 0;
1480}
1481
1482/**
1483 * get_mm_exe_file - acquire a reference to the mm's executable file
1484 * @mm: The mm of interest.
1485 *
1486 * Returns %NULL if mm has no associated executable file.
1487 * User must release file via fput().
1488 */
1489struct file *get_mm_exe_file(struct mm_struct *mm)
1490{
1491 struct file *exe_file;
1492
1493 rcu_read_lock();
1494 exe_file = get_file_rcu(&mm->exe_file);
1495 rcu_read_unlock();
1496 return exe_file;
1497}
1498
1499/**
1500 * get_task_exe_file - acquire a reference to the task's executable file
1501 * @task: The task.
1502 *
1503 * Returns %NULL if task's mm (if any) has no associated executable file or
1504 * this is a kernel thread with borrowed mm (see the comment above get_task_mm).
1505 * User must release file via fput().
1506 */
1507struct file *get_task_exe_file(struct task_struct *task)
1508{
1509 struct file *exe_file = NULL;
1510 struct mm_struct *mm;
1511
1512 task_lock(task);
1513 mm = task->mm;
1514 if (mm) {
1515 if (!(task->flags & PF_KTHREAD))
1516 exe_file = get_mm_exe_file(mm);
1517 }
1518 task_unlock(task);
1519 return exe_file;
1520}
1521
1522/**
1523 * get_task_mm - acquire a reference to the task's mm
1524 * @task: The task.
1525 *
1526 * Returns %NULL if the task has no mm. Checks PF_KTHREAD (meaning
1527 * this kernel workthread has transiently adopted a user mm with use_mm,
1528 * to do its AIO) is not set and if so returns a reference to it, after
1529 * bumping up the use count. User must release the mm via mmput()
1530 * after use. Typically used by /proc and ptrace.
1531 */
1532struct mm_struct *get_task_mm(struct task_struct *task)
1533{
1534 struct mm_struct *mm;
1535
1536 task_lock(task);
1537 mm = task->mm;
1538 if (mm) {
1539 if (task->flags & PF_KTHREAD)
1540 mm = NULL;
1541 else
1542 mmget(mm);
1543 }
1544 task_unlock(task);
1545 return mm;
1546}
1547EXPORT_SYMBOL_GPL(get_task_mm);
1548
1549struct mm_struct *mm_access(struct task_struct *task, unsigned int mode)
1550{
1551 struct mm_struct *mm;
1552 int err;
1553
1554 err = down_read_killable(&task->signal->exec_update_lock);
1555 if (err)
1556 return ERR_PTR(err);
1557
1558 mm = get_task_mm(task);
1559 if (mm && mm != current->mm &&
1560 !ptrace_may_access(task, mode)) {
1561 mmput(mm);
1562 mm = ERR_PTR(-EACCES);
1563 }
1564 up_read(&task->signal->exec_update_lock);
1565
1566 return mm;
1567}
1568
1569static void complete_vfork_done(struct task_struct *tsk)
1570{
1571 struct completion *vfork;
1572
1573 task_lock(tsk);
1574 vfork = tsk->vfork_done;
1575 if (likely(vfork)) {
1576 tsk->vfork_done = NULL;
1577 complete(vfork);
1578 }
1579 task_unlock(tsk);
1580}
1581
1582static int wait_for_vfork_done(struct task_struct *child,
1583 struct completion *vfork)
1584{
1585 unsigned int state = TASK_KILLABLE|TASK_FREEZABLE;
1586 int killed;
1587
1588 cgroup_enter_frozen();
1589 killed = wait_for_completion_state(vfork, state);
1590 cgroup_leave_frozen(false);
1591
1592 if (killed) {
1593 task_lock(child);
1594 child->vfork_done = NULL;
1595 task_unlock(child);
1596 }
1597
1598 put_task_struct(child);
1599 return killed;
1600}
1601
1602/* Please note the differences between mmput and mm_release.
1603 * mmput is called whenever we stop holding onto a mm_struct,
1604 * error success whatever.
1605 *
1606 * mm_release is called after a mm_struct has been removed
1607 * from the current process.
1608 *
1609 * This difference is important for error handling, when we
1610 * only half set up a mm_struct for a new process and need to restore
1611 * the old one. Because we mmput the new mm_struct before
1612 * restoring the old one. . .
1613 * Eric Biederman 10 January 1998
1614 */
1615static void mm_release(struct task_struct *tsk, struct mm_struct *mm)
1616{
1617 uprobe_free_utask(tsk);
1618
1619 /* Get rid of any cached register state */
1620 deactivate_mm(tsk, mm);
1621
1622 /*
1623 * Signal userspace if we're not exiting with a core dump
1624 * because we want to leave the value intact for debugging
1625 * purposes.
1626 */
1627 if (tsk->clear_child_tid) {
1628 if (atomic_read(&mm->mm_users) > 1) {
1629 /*
1630 * We don't check the error code - if userspace has
1631 * not set up a proper pointer then tough luck.
1632 */
1633 put_user(0, tsk->clear_child_tid);
1634 do_futex(tsk->clear_child_tid, FUTEX_WAKE,
1635 1, NULL, NULL, 0, 0);
1636 }
1637 tsk->clear_child_tid = NULL;
1638 }
1639
1640 /*
1641 * All done, finally we can wake up parent and return this mm to him.
1642 * Also kthread_stop() uses this completion for synchronization.
1643 */
1644 if (tsk->vfork_done)
1645 complete_vfork_done(tsk);
1646}
1647
1648void exit_mm_release(struct task_struct *tsk, struct mm_struct *mm)
1649{
1650 futex_exit_release(tsk);
1651 mm_release(tsk, mm);
1652}
1653
1654void exec_mm_release(struct task_struct *tsk, struct mm_struct *mm)
1655{
1656 futex_exec_release(tsk);
1657 mm_release(tsk, mm);
1658}
1659
1660/**
1661 * dup_mm() - duplicates an existing mm structure
1662 * @tsk: the task_struct with which the new mm will be associated.
1663 * @oldmm: the mm to duplicate.
1664 *
1665 * Allocates a new mm structure and duplicates the provided @oldmm structure
1666 * content into it.
1667 *
1668 * Return: the duplicated mm or NULL on failure.
1669 */
1670static struct mm_struct *dup_mm(struct task_struct *tsk,
1671 struct mm_struct *oldmm)
1672{
1673 struct mm_struct *mm;
1674 int err;
1675
1676 mm = allocate_mm();
1677 if (!mm)
1678 goto fail_nomem;
1679
1680 memcpy(mm, oldmm, sizeof(*mm));
1681
1682 if (!mm_init(mm, tsk, mm->user_ns))
1683 goto fail_nomem;
1684
1685 err = dup_mmap(mm, oldmm);
1686 if (err)
1687 goto free_pt;
1688
1689 mm->hiwater_rss = get_mm_rss(mm);
1690 mm->hiwater_vm = mm->total_vm;
1691
1692 if (mm->binfmt && !try_module_get(mm->binfmt->module))
1693 goto free_pt;
1694
1695 return mm;
1696
1697free_pt:
1698 /* don't put binfmt in mmput, we haven't got module yet */
1699 mm->binfmt = NULL;
1700 mm_init_owner(mm, NULL);
1701 mmput(mm);
1702
1703fail_nomem:
1704 return NULL;
1705}
1706
1707static int copy_mm(unsigned long clone_flags, struct task_struct *tsk)
1708{
1709 struct mm_struct *mm, *oldmm;
1710
1711 tsk->min_flt = tsk->maj_flt = 0;
1712 tsk->nvcsw = tsk->nivcsw = 0;
1713#ifdef CONFIG_DETECT_HUNG_TASK
1714 tsk->last_switch_count = tsk->nvcsw + tsk->nivcsw;
1715 tsk->last_switch_time = 0;
1716#endif
1717
1718 tsk->mm = NULL;
1719 tsk->active_mm = NULL;
1720
1721 /*
1722 * Are we cloning a kernel thread?
1723 *
1724 * We need to steal a active VM for that..
1725 */
1726 oldmm = current->mm;
1727 if (!oldmm)
1728 return 0;
1729
1730 if (clone_flags & CLONE_VM) {
1731 mmget(oldmm);
1732 mm = oldmm;
1733 } else {
1734 mm = dup_mm(tsk, current->mm);
1735 if (!mm)
1736 return -ENOMEM;
1737 }
1738
1739 tsk->mm = mm;
1740 tsk->active_mm = mm;
1741 sched_mm_cid_fork(tsk);
1742 return 0;
1743}
1744
1745static int copy_fs(unsigned long clone_flags, struct task_struct *tsk)
1746{
1747 struct fs_struct *fs = current->fs;
1748 if (clone_flags & CLONE_FS) {
1749 /* tsk->fs is already what we want */
1750 spin_lock(&fs->lock);
1751 /* "users" and "in_exec" locked for check_unsafe_exec() */
1752 if (fs->in_exec) {
1753 spin_unlock(&fs->lock);
1754 return -EAGAIN;
1755 }
1756 fs->users++;
1757 spin_unlock(&fs->lock);
1758 return 0;
1759 }
1760 tsk->fs = copy_fs_struct(fs);
1761 if (!tsk->fs)
1762 return -ENOMEM;
1763 return 0;
1764}
1765
1766static int copy_files(unsigned long clone_flags, struct task_struct *tsk,
1767 int no_files)
1768{
1769 struct files_struct *oldf, *newf;
1770 int error = 0;
1771
1772 /*
1773 * A background process may not have any files ...
1774 */
1775 oldf = current->files;
1776 if (!oldf)
1777 goto out;
1778
1779 if (no_files) {
1780 tsk->files = NULL;
1781 goto out;
1782 }
1783
1784 if (clone_flags & CLONE_FILES) {
1785 atomic_inc(&oldf->count);
1786 goto out;
1787 }
1788
1789 newf = dup_fd(oldf, NR_OPEN_MAX, &error);
1790 if (!newf)
1791 goto out;
1792
1793 tsk->files = newf;
1794 error = 0;
1795out:
1796 return error;
1797}
1798
1799static int copy_sighand(unsigned long clone_flags, struct task_struct *tsk)
1800{
1801 struct sighand_struct *sig;
1802
1803 if (clone_flags & CLONE_SIGHAND) {
1804 refcount_inc(¤t->sighand->count);
1805 return 0;
1806 }
1807 sig = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1808 RCU_INIT_POINTER(tsk->sighand, sig);
1809 if (!sig)
1810 return -ENOMEM;
1811
1812 refcount_set(&sig->count, 1);
1813 spin_lock_irq(¤t->sighand->siglock);
1814 memcpy(sig->action, current->sighand->action, sizeof(sig->action));
1815 spin_unlock_irq(¤t->sighand->siglock);
1816
1817 /* Reset all signal handler not set to SIG_IGN to SIG_DFL. */
1818 if (clone_flags & CLONE_CLEAR_SIGHAND)
1819 flush_signal_handlers(tsk, 0);
1820
1821 return 0;
1822}
1823
1824void __cleanup_sighand(struct sighand_struct *sighand)
1825{
1826 if (refcount_dec_and_test(&sighand->count)) {
1827 signalfd_cleanup(sighand);
1828 /*
1829 * sighand_cachep is SLAB_TYPESAFE_BY_RCU so we can free it
1830 * without an RCU grace period, see __lock_task_sighand().
1831 */
1832 kmem_cache_free(sighand_cachep, sighand);
1833 }
1834}
1835
1836/*
1837 * Initialize POSIX timer handling for a thread group.
1838 */
1839static void posix_cpu_timers_init_group(struct signal_struct *sig)
1840{
1841 struct posix_cputimers *pct = &sig->posix_cputimers;
1842 unsigned long cpu_limit;
1843
1844 cpu_limit = READ_ONCE(sig->rlim[RLIMIT_CPU].rlim_cur);
1845 posix_cputimers_group_init(pct, cpu_limit);
1846}
1847
1848static int copy_signal(unsigned long clone_flags, struct task_struct *tsk)
1849{
1850 struct signal_struct *sig;
1851
1852 if (clone_flags & CLONE_THREAD)
1853 return 0;
1854
1855 sig = kmem_cache_zalloc(signal_cachep, GFP_KERNEL);
1856 tsk->signal = sig;
1857 if (!sig)
1858 return -ENOMEM;
1859
1860 sig->nr_threads = 1;
1861 sig->quick_threads = 1;
1862 atomic_set(&sig->live, 1);
1863 refcount_set(&sig->sigcnt, 1);
1864
1865 /* list_add(thread_node, thread_head) without INIT_LIST_HEAD() */
1866 sig->thread_head = (struct list_head)LIST_HEAD_INIT(tsk->thread_node);
1867 tsk->thread_node = (struct list_head)LIST_HEAD_INIT(sig->thread_head);
1868
1869 init_waitqueue_head(&sig->wait_chldexit);
1870 sig->curr_target = tsk;
1871 init_sigpending(&sig->shared_pending);
1872 INIT_HLIST_HEAD(&sig->multiprocess);
1873 seqlock_init(&sig->stats_lock);
1874 prev_cputime_init(&sig->prev_cputime);
1875
1876#ifdef CONFIG_POSIX_TIMERS
1877 INIT_LIST_HEAD(&sig->posix_timers);
1878 hrtimer_init(&sig->real_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1879 sig->real_timer.function = it_real_fn;
1880#endif
1881
1882 task_lock(current->group_leader);
1883 memcpy(sig->rlim, current->signal->rlim, sizeof sig->rlim);
1884 task_unlock(current->group_leader);
1885
1886 posix_cpu_timers_init_group(sig);
1887
1888 tty_audit_fork(sig);
1889 sched_autogroup_fork(sig);
1890
1891 sig->oom_score_adj = current->signal->oom_score_adj;
1892 sig->oom_score_adj_min = current->signal->oom_score_adj_min;
1893
1894 mutex_init(&sig->cred_guard_mutex);
1895 init_rwsem(&sig->exec_update_lock);
1896
1897 return 0;
1898}
1899
1900static void copy_seccomp(struct task_struct *p)
1901{
1902#ifdef CONFIG_SECCOMP
1903 /*
1904 * Must be called with sighand->lock held, which is common to
1905 * all threads in the group. Holding cred_guard_mutex is not
1906 * needed because this new task is not yet running and cannot
1907 * be racing exec.
1908 */
1909 assert_spin_locked(¤t->sighand->siglock);
1910
1911 /* Ref-count the new filter user, and assign it. */
1912 get_seccomp_filter(current);
1913 p->seccomp = current->seccomp;
1914
1915 /*
1916 * Explicitly enable no_new_privs here in case it got set
1917 * between the task_struct being duplicated and holding the
1918 * sighand lock. The seccomp state and nnp must be in sync.
1919 */
1920 if (task_no_new_privs(current))
1921 task_set_no_new_privs(p);
1922
1923 /*
1924 * If the parent gained a seccomp mode after copying thread
1925 * flags and between before we held the sighand lock, we have
1926 * to manually enable the seccomp thread flag here.
1927 */
1928 if (p->seccomp.mode != SECCOMP_MODE_DISABLED)
1929 set_task_syscall_work(p, SECCOMP);
1930#endif
1931}
1932
1933SYSCALL_DEFINE1(set_tid_address, int __user *, tidptr)
1934{
1935 current->clear_child_tid = tidptr;
1936
1937 return task_pid_vnr(current);
1938}
1939
1940static void rt_mutex_init_task(struct task_struct *p)
1941{
1942 raw_spin_lock_init(&p->pi_lock);
1943#ifdef CONFIG_RT_MUTEXES
1944 p->pi_waiters = RB_ROOT_CACHED;
1945 p->pi_top_task = NULL;
1946 p->pi_blocked_on = NULL;
1947#endif
1948}
1949
1950static inline void init_task_pid_links(struct task_struct *task)
1951{
1952 enum pid_type type;
1953
1954 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type)
1955 INIT_HLIST_NODE(&task->pid_links[type]);
1956}
1957
1958static inline void
1959init_task_pid(struct task_struct *task, enum pid_type type, struct pid *pid)
1960{
1961 if (type == PIDTYPE_PID)
1962 task->thread_pid = pid;
1963 else
1964 task->signal->pids[type] = pid;
1965}
1966
1967static inline void rcu_copy_process(struct task_struct *p)
1968{
1969#ifdef CONFIG_PREEMPT_RCU
1970 p->rcu_read_lock_nesting = 0;
1971 p->rcu_read_unlock_special.s = 0;
1972 p->rcu_blocked_node = NULL;
1973 INIT_LIST_HEAD(&p->rcu_node_entry);
1974#endif /* #ifdef CONFIG_PREEMPT_RCU */
1975#ifdef CONFIG_TASKS_RCU
1976 p->rcu_tasks_holdout = false;
1977 INIT_LIST_HEAD(&p->rcu_tasks_holdout_list);
1978 p->rcu_tasks_idle_cpu = -1;
1979#endif /* #ifdef CONFIG_TASKS_RCU */
1980#ifdef CONFIG_TASKS_TRACE_RCU
1981 p->trc_reader_nesting = 0;
1982 p->trc_reader_special.s = 0;
1983 INIT_LIST_HEAD(&p->trc_holdout_list);
1984 INIT_LIST_HEAD(&p->trc_blkd_node);
1985#endif /* #ifdef CONFIG_TASKS_TRACE_RCU */
1986}
1987
1988struct pid *pidfd_pid(const struct file *file)
1989{
1990 if (file->f_op == &pidfd_fops)
1991 return file->private_data;
1992
1993 return ERR_PTR(-EBADF);
1994}
1995
1996static int pidfd_release(struct inode *inode, struct file *file)
1997{
1998 struct pid *pid = file->private_data;
1999
2000 file->private_data = NULL;
2001 put_pid(pid);
2002 return 0;
2003}
2004
2005#ifdef CONFIG_PROC_FS
2006/**
2007 * pidfd_show_fdinfo - print information about a pidfd
2008 * @m: proc fdinfo file
2009 * @f: file referencing a pidfd
2010 *
2011 * Pid:
2012 * This function will print the pid that a given pidfd refers to in the
2013 * pid namespace of the procfs instance.
2014 * If the pid namespace of the process is not a descendant of the pid
2015 * namespace of the procfs instance 0 will be shown as its pid. This is
2016 * similar to calling getppid() on a process whose parent is outside of
2017 * its pid namespace.
2018 *
2019 * NSpid:
2020 * If pid namespaces are supported then this function will also print
2021 * the pid of a given pidfd refers to for all descendant pid namespaces
2022 * starting from the current pid namespace of the instance, i.e. the
2023 * Pid field and the first entry in the NSpid field will be identical.
2024 * If the pid namespace of the process is not a descendant of the pid
2025 * namespace of the procfs instance 0 will be shown as its first NSpid
2026 * entry and no others will be shown.
2027 * Note that this differs from the Pid and NSpid fields in
2028 * /proc/<pid>/status where Pid and NSpid are always shown relative to
2029 * the pid namespace of the procfs instance. The difference becomes
2030 * obvious when sending around a pidfd between pid namespaces from a
2031 * different branch of the tree, i.e. where no ancestral relation is
2032 * present between the pid namespaces:
2033 * - create two new pid namespaces ns1 and ns2 in the initial pid
2034 * namespace (also take care to create new mount namespaces in the
2035 * new pid namespace and mount procfs)
2036 * - create a process with a pidfd in ns1
2037 * - send pidfd from ns1 to ns2
2038 * - read /proc/self/fdinfo/<pidfd> and observe that both Pid and NSpid
2039 * have exactly one entry, which is 0
2040 */
2041static void pidfd_show_fdinfo(struct seq_file *m, struct file *f)
2042{
2043 struct pid *pid = f->private_data;
2044 struct pid_namespace *ns;
2045 pid_t nr = -1;
2046
2047 if (likely(pid_has_task(pid, PIDTYPE_PID))) {
2048 ns = proc_pid_ns(file_inode(m->file)->i_sb);
2049 nr = pid_nr_ns(pid, ns);
2050 }
2051
2052 seq_put_decimal_ll(m, "Pid:\t", nr);
2053
2054#ifdef CONFIG_PID_NS
2055 seq_put_decimal_ll(m, "\nNSpid:\t", nr);
2056 if (nr > 0) {
2057 int i;
2058
2059 /* If nr is non-zero it means that 'pid' is valid and that
2060 * ns, i.e. the pid namespace associated with the procfs
2061 * instance, is in the pid namespace hierarchy of pid.
2062 * Start at one below the already printed level.
2063 */
2064 for (i = ns->level + 1; i <= pid->level; i++)
2065 seq_put_decimal_ll(m, "\t", pid->numbers[i].nr);
2066 }
2067#endif
2068 seq_putc(m, '\n');
2069}
2070#endif
2071
2072/*
2073 * Poll support for process exit notification.
2074 */
2075static __poll_t pidfd_poll(struct file *file, struct poll_table_struct *pts)
2076{
2077 struct pid *pid = file->private_data;
2078 __poll_t poll_flags = 0;
2079
2080 poll_wait(file, &pid->wait_pidfd, pts);
2081
2082 /*
2083 * Inform pollers only when the whole thread group exits.
2084 * If the thread group leader exits before all other threads in the
2085 * group, then poll(2) should block, similar to the wait(2) family.
2086 */
2087 if (thread_group_exited(pid))
2088 poll_flags = EPOLLIN | EPOLLRDNORM;
2089
2090 return poll_flags;
2091}
2092
2093const struct file_operations pidfd_fops = {
2094 .release = pidfd_release,
2095 .poll = pidfd_poll,
2096#ifdef CONFIG_PROC_FS
2097 .show_fdinfo = pidfd_show_fdinfo,
2098#endif
2099};
2100
2101/**
2102 * __pidfd_prepare - allocate a new pidfd_file and reserve a pidfd
2103 * @pid: the struct pid for which to create a pidfd
2104 * @flags: flags of the new @pidfd
2105 * @ret: Where to return the file for the pidfd.
2106 *
2107 * Allocate a new file that stashes @pid and reserve a new pidfd number in the
2108 * caller's file descriptor table. The pidfd is reserved but not installed yet.
2109 *
2110 * The helper doesn't perform checks on @pid which makes it useful for pidfds
2111 * created via CLONE_PIDFD where @pid has no task attached when the pidfd and
2112 * pidfd file are prepared.
2113 *
2114 * If this function returns successfully the caller is responsible to either
2115 * call fd_install() passing the returned pidfd and pidfd file as arguments in
2116 * order to install the pidfd into its file descriptor table or they must use
2117 * put_unused_fd() and fput() on the returned pidfd and pidfd file
2118 * respectively.
2119 *
2120 * This function is useful when a pidfd must already be reserved but there
2121 * might still be points of failure afterwards and the caller wants to ensure
2122 * that no pidfd is leaked into its file descriptor table.
2123 *
2124 * Return: On success, a reserved pidfd is returned from the function and a new
2125 * pidfd file is returned in the last argument to the function. On
2126 * error, a negative error code is returned from the function and the
2127 * last argument remains unchanged.
2128 */
2129static int __pidfd_prepare(struct pid *pid, unsigned int flags, struct file **ret)
2130{
2131 int pidfd;
2132 struct file *pidfd_file;
2133
2134 if (flags & ~(O_NONBLOCK | O_RDWR | O_CLOEXEC))
2135 return -EINVAL;
2136
2137 pidfd = get_unused_fd_flags(O_RDWR | O_CLOEXEC);
2138 if (pidfd < 0)
2139 return pidfd;
2140
2141 pidfd_file = anon_inode_getfile("[pidfd]", &pidfd_fops, pid,
2142 flags | O_RDWR | O_CLOEXEC);
2143 if (IS_ERR(pidfd_file)) {
2144 put_unused_fd(pidfd);
2145 return PTR_ERR(pidfd_file);
2146 }
2147 get_pid(pid); /* held by pidfd_file now */
2148 *ret = pidfd_file;
2149 return pidfd;
2150}
2151
2152/**
2153 * pidfd_prepare - allocate a new pidfd_file and reserve a pidfd
2154 * @pid: the struct pid for which to create a pidfd
2155 * @flags: flags of the new @pidfd
2156 * @ret: Where to return the pidfd.
2157 *
2158 * Allocate a new file that stashes @pid and reserve a new pidfd number in the
2159 * caller's file descriptor table. The pidfd is reserved but not installed yet.
2160 *
2161 * The helper verifies that @pid is used as a thread group leader.
2162 *
2163 * If this function returns successfully the caller is responsible to either
2164 * call fd_install() passing the returned pidfd and pidfd file as arguments in
2165 * order to install the pidfd into its file descriptor table or they must use
2166 * put_unused_fd() and fput() on the returned pidfd and pidfd file
2167 * respectively.
2168 *
2169 * This function is useful when a pidfd must already be reserved but there
2170 * might still be points of failure afterwards and the caller wants to ensure
2171 * that no pidfd is leaked into its file descriptor table.
2172 *
2173 * Return: On success, a reserved pidfd is returned from the function and a new
2174 * pidfd file is returned in the last argument to the function. On
2175 * error, a negative error code is returned from the function and the
2176 * last argument remains unchanged.
2177 */
2178int pidfd_prepare(struct pid *pid, unsigned int flags, struct file **ret)
2179{
2180 if (!pid || !pid_has_task(pid, PIDTYPE_TGID))
2181 return -EINVAL;
2182
2183 return __pidfd_prepare(pid, flags, ret);
2184}
2185
2186static void __delayed_free_task(struct rcu_head *rhp)
2187{
2188 struct task_struct *tsk = container_of(rhp, struct task_struct, rcu);
2189
2190 free_task(tsk);
2191}
2192
2193static __always_inline void delayed_free_task(struct task_struct *tsk)
2194{
2195 if (IS_ENABLED(CONFIG_MEMCG))
2196 call_rcu(&tsk->rcu, __delayed_free_task);
2197 else
2198 free_task(tsk);
2199}
2200
2201static void copy_oom_score_adj(u64 clone_flags, struct task_struct *tsk)
2202{
2203 /* Skip if kernel thread */
2204 if (!tsk->mm)
2205 return;
2206
2207 /* Skip if spawning a thread or using vfork */
2208 if ((clone_flags & (CLONE_VM | CLONE_THREAD | CLONE_VFORK)) != CLONE_VM)
2209 return;
2210
2211 /* We need to synchronize with __set_oom_adj */
2212 mutex_lock(&oom_adj_mutex);
2213 set_bit(MMF_MULTIPROCESS, &tsk->mm->flags);
2214 /* Update the values in case they were changed after copy_signal */
2215 tsk->signal->oom_score_adj = current->signal->oom_score_adj;
2216 tsk->signal->oom_score_adj_min = current->signal->oom_score_adj_min;
2217 mutex_unlock(&oom_adj_mutex);
2218}
2219
2220#ifdef CONFIG_RV
2221static void rv_task_fork(struct task_struct *p)
2222{
2223 int i;
2224
2225 for (i = 0; i < RV_PER_TASK_MONITORS; i++)
2226 p->rv[i].da_mon.monitoring = false;
2227}
2228#else
2229#define rv_task_fork(p) do {} while (0)
2230#endif
2231
2232/*
2233 * This creates a new process as a copy of the old one,
2234 * but does not actually start it yet.
2235 *
2236 * It copies the registers, and all the appropriate
2237 * parts of the process environment (as per the clone
2238 * flags). The actual kick-off is left to the caller.
2239 */
2240__latent_entropy struct task_struct *copy_process(
2241 struct pid *pid,
2242 int trace,
2243 int node,
2244 struct kernel_clone_args *args)
2245{
2246 int pidfd = -1, retval;
2247 struct task_struct *p;
2248 struct multiprocess_signals delayed;
2249 struct file *pidfile = NULL;
2250 const u64 clone_flags = args->flags;
2251 struct nsproxy *nsp = current->nsproxy;
2252
2253 /*
2254 * Don't allow sharing the root directory with processes in a different
2255 * namespace
2256 */
2257 if ((clone_flags & (CLONE_NEWNS|CLONE_FS)) == (CLONE_NEWNS|CLONE_FS))
2258 return ERR_PTR(-EINVAL);
2259
2260 if ((clone_flags & (CLONE_NEWUSER|CLONE_FS)) == (CLONE_NEWUSER|CLONE_FS))
2261 return ERR_PTR(-EINVAL);
2262
2263 /*
2264 * Thread groups must share signals as well, and detached threads
2265 * can only be started up within the thread group.
2266 */
2267 if ((clone_flags & CLONE_THREAD) && !(clone_flags & CLONE_SIGHAND))
2268 return ERR_PTR(-EINVAL);
2269
2270 /*
2271 * Shared signal handlers imply shared VM. By way of the above,
2272 * thread groups also imply shared VM. Blocking this case allows
2273 * for various simplifications in other code.
2274 */
2275 if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM))
2276 return ERR_PTR(-EINVAL);
2277
2278 /*
2279 * Siblings of global init remain as zombies on exit since they are
2280 * not reaped by their parent (swapper). To solve this and to avoid
2281 * multi-rooted process trees, prevent global and container-inits
2282 * from creating siblings.
2283 */
2284 if ((clone_flags & CLONE_PARENT) &&
2285 current->signal->flags & SIGNAL_UNKILLABLE)
2286 return ERR_PTR(-EINVAL);
2287
2288 /*
2289 * If the new process will be in a different pid or user namespace
2290 * do not allow it to share a thread group with the forking task.
2291 */
2292 if (clone_flags & CLONE_THREAD) {
2293 if ((clone_flags & (CLONE_NEWUSER | CLONE_NEWPID)) ||
2294 (task_active_pid_ns(current) != nsp->pid_ns_for_children))
2295 return ERR_PTR(-EINVAL);
2296 }
2297
2298 if (clone_flags & CLONE_PIDFD) {
2299 /*
2300 * - CLONE_DETACHED is blocked so that we can potentially
2301 * reuse it later for CLONE_PIDFD.
2302 * - CLONE_THREAD is blocked until someone really needs it.
2303 */
2304 if (clone_flags & (CLONE_DETACHED | CLONE_THREAD))
2305 return ERR_PTR(-EINVAL);
2306 }
2307
2308 /*
2309 * Force any signals received before this point to be delivered
2310 * before the fork happens. Collect up signals sent to multiple
2311 * processes that happen during the fork and delay them so that
2312 * they appear to happen after the fork.
2313 */
2314 sigemptyset(&delayed.signal);
2315 INIT_HLIST_NODE(&delayed.node);
2316
2317 spin_lock_irq(¤t->sighand->siglock);
2318 if (!(clone_flags & CLONE_THREAD))
2319 hlist_add_head(&delayed.node, ¤t->signal->multiprocess);
2320 recalc_sigpending();
2321 spin_unlock_irq(¤t->sighand->siglock);
2322 retval = -ERESTARTNOINTR;
2323 if (task_sigpending(current))
2324 goto fork_out;
2325
2326 retval = -ENOMEM;
2327 p = dup_task_struct(current, node);
2328 if (!p)
2329 goto fork_out;
2330 p->flags &= ~PF_KTHREAD;
2331 if (args->kthread)
2332 p->flags |= PF_KTHREAD;
2333 if (args->user_worker) {
2334 /*
2335 * Mark us a user worker, and block any signal that isn't
2336 * fatal or STOP
2337 */
2338 p->flags |= PF_USER_WORKER;
2339 siginitsetinv(&p->blocked, sigmask(SIGKILL)|sigmask(SIGSTOP));
2340 }
2341 if (args->io_thread)
2342 p->flags |= PF_IO_WORKER;
2343
2344 if (args->name)
2345 strscpy_pad(p->comm, args->name, sizeof(p->comm));
2346
2347 p->set_child_tid = (clone_flags & CLONE_CHILD_SETTID) ? args->child_tid : NULL;
2348 /*
2349 * Clear TID on mm_release()?
2350 */
2351 p->clear_child_tid = (clone_flags & CLONE_CHILD_CLEARTID) ? args->child_tid : NULL;
2352
2353 ftrace_graph_init_task(p);
2354
2355 rt_mutex_init_task(p);
2356
2357 lockdep_assert_irqs_enabled();
2358#ifdef CONFIG_PROVE_LOCKING
2359 DEBUG_LOCKS_WARN_ON(!p->softirqs_enabled);
2360#endif
2361 retval = copy_creds(p, clone_flags);
2362 if (retval < 0)
2363 goto bad_fork_free;
2364
2365 retval = -EAGAIN;
2366 if (is_rlimit_overlimit(task_ucounts(p), UCOUNT_RLIMIT_NPROC, rlimit(RLIMIT_NPROC))) {
2367 if (p->real_cred->user != INIT_USER &&
2368 !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN))
2369 goto bad_fork_cleanup_count;
2370 }
2371 current->flags &= ~PF_NPROC_EXCEEDED;
2372
2373 /*
2374 * If multiple threads are within copy_process(), then this check
2375 * triggers too late. This doesn't hurt, the check is only there
2376 * to stop root fork bombs.
2377 */
2378 retval = -EAGAIN;
2379 if (data_race(nr_threads >= max_threads))
2380 goto bad_fork_cleanup_count;
2381
2382 delayacct_tsk_init(p); /* Must remain after dup_task_struct() */
2383 p->flags &= ~(PF_SUPERPRIV | PF_WQ_WORKER | PF_IDLE | PF_NO_SETAFFINITY);
2384 p->flags |= PF_FORKNOEXEC;
2385 INIT_LIST_HEAD(&p->children);
2386 INIT_LIST_HEAD(&p->sibling);
2387 rcu_copy_process(p);
2388 p->vfork_done = NULL;
2389 spin_lock_init(&p->alloc_lock);
2390
2391 init_sigpending(&p->pending);
2392
2393 p->utime = p->stime = p->gtime = 0;
2394#ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME
2395 p->utimescaled = p->stimescaled = 0;
2396#endif
2397 prev_cputime_init(&p->prev_cputime);
2398
2399#ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN
2400 seqcount_init(&p->vtime.seqcount);
2401 p->vtime.starttime = 0;
2402 p->vtime.state = VTIME_INACTIVE;
2403#endif
2404
2405#ifdef CONFIG_IO_URING
2406 p->io_uring = NULL;
2407#endif
2408
2409 p->default_timer_slack_ns = current->timer_slack_ns;
2410
2411#ifdef CONFIG_PSI
2412 p->psi_flags = 0;
2413#endif
2414
2415 task_io_accounting_init(&p->ioac);
2416 acct_clear_integrals(p);
2417
2418 posix_cputimers_init(&p->posix_cputimers);
2419
2420 p->io_context = NULL;
2421 audit_set_context(p, NULL);
2422 cgroup_fork(p);
2423 if (args->kthread) {
2424 if (!set_kthread_struct(p))
2425 goto bad_fork_cleanup_delayacct;
2426 }
2427#ifdef CONFIG_NUMA
2428 p->mempolicy = mpol_dup(p->mempolicy);
2429 if (IS_ERR(p->mempolicy)) {
2430 retval = PTR_ERR(p->mempolicy);
2431 p->mempolicy = NULL;
2432 goto bad_fork_cleanup_delayacct;
2433 }
2434#endif
2435#ifdef CONFIG_CPUSETS
2436 p->cpuset_mem_spread_rotor = NUMA_NO_NODE;
2437 p->cpuset_slab_spread_rotor = NUMA_NO_NODE;
2438 seqcount_spinlock_init(&p->mems_allowed_seq, &p->alloc_lock);
2439#endif
2440#ifdef CONFIG_TRACE_IRQFLAGS
2441 memset(&p->irqtrace, 0, sizeof(p->irqtrace));
2442 p->irqtrace.hardirq_disable_ip = _THIS_IP_;
2443 p->irqtrace.softirq_enable_ip = _THIS_IP_;
2444 p->softirqs_enabled = 1;
2445 p->softirq_context = 0;
2446#endif
2447
2448 p->pagefault_disabled = 0;
2449
2450#ifdef CONFIG_LOCKDEP
2451 lockdep_init_task(p);
2452#endif
2453
2454#ifdef CONFIG_DEBUG_MUTEXES
2455 p->blocked_on = NULL; /* not blocked yet */
2456#endif
2457#ifdef CONFIG_BCACHE
2458 p->sequential_io = 0;
2459 p->sequential_io_avg = 0;
2460#endif
2461#ifdef CONFIG_BPF_SYSCALL
2462 RCU_INIT_POINTER(p->bpf_storage, NULL);
2463 p->bpf_ctx = NULL;
2464#endif
2465
2466 /* Perform scheduler related setup. Assign this task to a CPU. */
2467 retval = sched_fork(clone_flags, p);
2468 if (retval)
2469 goto bad_fork_cleanup_policy;
2470
2471 retval = perf_event_init_task(p, clone_flags);
2472 if (retval)
2473 goto bad_fork_cleanup_policy;
2474 retval = audit_alloc(p);
2475 if (retval)
2476 goto bad_fork_cleanup_perf;
2477 /* copy all the process information */
2478 shm_init_task(p);
2479 retval = security_task_alloc(p, clone_flags);
2480 if (retval)
2481 goto bad_fork_cleanup_audit;
2482 retval = copy_semundo(clone_flags, p);
2483 if (retval)
2484 goto bad_fork_cleanup_security;
2485 retval = copy_files(clone_flags, p, args->no_files);
2486 if (retval)
2487 goto bad_fork_cleanup_semundo;
2488 retval = copy_fs(clone_flags, p);
2489 if (retval)
2490 goto bad_fork_cleanup_files;
2491 retval = copy_sighand(clone_flags, p);
2492 if (retval)
2493 goto bad_fork_cleanup_fs;
2494 retval = copy_signal(clone_flags, p);
2495 if (retval)
2496 goto bad_fork_cleanup_sighand;
2497 retval = copy_mm(clone_flags, p);
2498 if (retval)
2499 goto bad_fork_cleanup_signal;
2500 retval = copy_namespaces(clone_flags, p);
2501 if (retval)
2502 goto bad_fork_cleanup_mm;
2503 retval = copy_io(clone_flags, p);
2504 if (retval)
2505 goto bad_fork_cleanup_namespaces;
2506 retval = copy_thread(p, args);
2507 if (retval)
2508 goto bad_fork_cleanup_io;
2509
2510 stackleak_task_init(p);
2511
2512 if (pid != &init_struct_pid) {
2513 pid = alloc_pid(p->nsproxy->pid_ns_for_children, args->set_tid,
2514 args->set_tid_size);
2515 if (IS_ERR(pid)) {
2516 retval = PTR_ERR(pid);
2517 goto bad_fork_cleanup_thread;
2518 }
2519 }
2520
2521 /*
2522 * This has to happen after we've potentially unshared the file
2523 * descriptor table (so that the pidfd doesn't leak into the child
2524 * if the fd table isn't shared).
2525 */
2526 if (clone_flags & CLONE_PIDFD) {
2527 /* Note that no task has been attached to @pid yet. */
2528 retval = __pidfd_prepare(pid, O_RDWR | O_CLOEXEC, &pidfile);
2529 if (retval < 0)
2530 goto bad_fork_free_pid;
2531 pidfd = retval;
2532
2533 retval = put_user(pidfd, args->pidfd);
2534 if (retval)
2535 goto bad_fork_put_pidfd;
2536 }
2537
2538#ifdef CONFIG_BLOCK
2539 p->plug = NULL;
2540#endif
2541 futex_init_task(p);
2542
2543 /*
2544 * sigaltstack should be cleared when sharing the same VM
2545 */
2546 if ((clone_flags & (CLONE_VM|CLONE_VFORK)) == CLONE_VM)
2547 sas_ss_reset(p);
2548
2549 /*
2550 * Syscall tracing and stepping should be turned off in the
2551 * child regardless of CLONE_PTRACE.
2552 */
2553 user_disable_single_step(p);
2554 clear_task_syscall_work(p, SYSCALL_TRACE);
2555#if defined(CONFIG_GENERIC_ENTRY) || defined(TIF_SYSCALL_EMU)
2556 clear_task_syscall_work(p, SYSCALL_EMU);
2557#endif
2558 clear_tsk_latency_tracing(p);
2559
2560 /* ok, now we should be set up.. */
2561 p->pid = pid_nr(pid);
2562 if (clone_flags & CLONE_THREAD) {
2563 p->group_leader = current->group_leader;
2564 p->tgid = current->tgid;
2565 } else {
2566 p->group_leader = p;
2567 p->tgid = p->pid;
2568 }
2569
2570 p->nr_dirtied = 0;
2571 p->nr_dirtied_pause = 128 >> (PAGE_SHIFT - 10);
2572 p->dirty_paused_when = 0;
2573
2574 p->pdeath_signal = 0;
2575 p->task_works = NULL;
2576 clear_posix_cputimers_work(p);
2577
2578#ifdef CONFIG_KRETPROBES
2579 p->kretprobe_instances.first = NULL;
2580#endif
2581#ifdef CONFIG_RETHOOK
2582 p->rethooks.first = NULL;
2583#endif
2584
2585 /*
2586 * Ensure that the cgroup subsystem policies allow the new process to be
2587 * forked. It should be noted that the new process's css_set can be changed
2588 * between here and cgroup_post_fork() if an organisation operation is in
2589 * progress.
2590 */
2591 retval = cgroup_can_fork(p, args);
2592 if (retval)
2593 goto bad_fork_put_pidfd;
2594
2595 /*
2596 * Now that the cgroups are pinned, re-clone the parent cgroup and put
2597 * the new task on the correct runqueue. All this *before* the task
2598 * becomes visible.
2599 *
2600 * This isn't part of ->can_fork() because while the re-cloning is
2601 * cgroup specific, it unconditionally needs to place the task on a
2602 * runqueue.
2603 */
2604 sched_cgroup_fork(p, args);
2605
2606 /*
2607 * From this point on we must avoid any synchronous user-space
2608 * communication until we take the tasklist-lock. In particular, we do
2609 * not want user-space to be able to predict the process start-time by
2610 * stalling fork(2) after we recorded the start_time but before it is
2611 * visible to the system.
2612 */
2613
2614 p->start_time = ktime_get_ns();
2615 p->start_boottime = ktime_get_boottime_ns();
2616
2617 /*
2618 * Make it visible to the rest of the system, but dont wake it up yet.
2619 * Need tasklist lock for parent etc handling!
2620 */
2621 write_lock_irq(&tasklist_lock);
2622
2623 /* CLONE_PARENT re-uses the old parent */
2624 if (clone_flags & (CLONE_PARENT|CLONE_THREAD)) {
2625 p->real_parent = current->real_parent;
2626 p->parent_exec_id = current->parent_exec_id;
2627 if (clone_flags & CLONE_THREAD)
2628 p->exit_signal = -1;
2629 else
2630 p->exit_signal = current->group_leader->exit_signal;
2631 } else {
2632 p->real_parent = current;
2633 p->parent_exec_id = current->self_exec_id;
2634 p->exit_signal = args->exit_signal;
2635 }
2636
2637 klp_copy_process(p);
2638
2639 sched_core_fork(p);
2640
2641 spin_lock(¤t->sighand->siglock);
2642
2643 rv_task_fork(p);
2644
2645 rseq_fork(p, clone_flags);
2646
2647 /* Don't start children in a dying pid namespace */
2648 if (unlikely(!(ns_of_pid(pid)->pid_allocated & PIDNS_ADDING))) {
2649 retval = -ENOMEM;
2650 goto bad_fork_cancel_cgroup;
2651 }
2652
2653 /* Let kill terminate clone/fork in the middle */
2654 if (fatal_signal_pending(current)) {
2655 retval = -EINTR;
2656 goto bad_fork_cancel_cgroup;
2657 }
2658
2659 /* No more failure paths after this point. */
2660
2661 /*
2662 * Copy seccomp details explicitly here, in case they were changed
2663 * before holding sighand lock.
2664 */
2665 copy_seccomp(p);
2666
2667 init_task_pid_links(p);
2668 if (likely(p->pid)) {
2669 ptrace_init_task(p, (clone_flags & CLONE_PTRACE) || trace);
2670
2671 init_task_pid(p, PIDTYPE_PID, pid);
2672 if (thread_group_leader(p)) {
2673 init_task_pid(p, PIDTYPE_TGID, pid);
2674 init_task_pid(p, PIDTYPE_PGID, task_pgrp(current));
2675 init_task_pid(p, PIDTYPE_SID, task_session(current));
2676
2677 if (is_child_reaper(pid)) {
2678 ns_of_pid(pid)->child_reaper = p;
2679 p->signal->flags |= SIGNAL_UNKILLABLE;
2680 }
2681 p->signal->shared_pending.signal = delayed.signal;
2682 p->signal->tty = tty_kref_get(current->signal->tty);
2683 /*
2684 * Inherit has_child_subreaper flag under the same
2685 * tasklist_lock with adding child to the process tree
2686 * for propagate_has_child_subreaper optimization.
2687 */
2688 p->signal->has_child_subreaper = p->real_parent->signal->has_child_subreaper ||
2689 p->real_parent->signal->is_child_subreaper;
2690 list_add_tail(&p->sibling, &p->real_parent->children);
2691 list_add_tail_rcu(&p->tasks, &init_task.tasks);
2692 attach_pid(p, PIDTYPE_TGID);
2693 attach_pid(p, PIDTYPE_PGID);
2694 attach_pid(p, PIDTYPE_SID);
2695 __this_cpu_inc(process_counts);
2696 } else {
2697 current->signal->nr_threads++;
2698 current->signal->quick_threads++;
2699 atomic_inc(¤t->signal->live);
2700 refcount_inc(¤t->signal->sigcnt);
2701 task_join_group_stop(p);
2702 list_add_tail_rcu(&p->thread_node,
2703 &p->signal->thread_head);
2704 }
2705 attach_pid(p, PIDTYPE_PID);
2706 nr_threads++;
2707 }
2708 total_forks++;
2709 hlist_del_init(&delayed.node);
2710 spin_unlock(¤t->sighand->siglock);
2711 syscall_tracepoint_update(p);
2712 write_unlock_irq(&tasklist_lock);
2713
2714 if (pidfile)
2715 fd_install(pidfd, pidfile);
2716
2717 proc_fork_connector(p);
2718 sched_post_fork(p);
2719 cgroup_post_fork(p, args);
2720 perf_event_fork(p);
2721
2722 trace_task_newtask(p, clone_flags);
2723 uprobe_copy_process(p, clone_flags);
2724 user_events_fork(p, clone_flags);
2725
2726 copy_oom_score_adj(clone_flags, p);
2727
2728 return p;
2729
2730bad_fork_cancel_cgroup:
2731 sched_core_free(p);
2732 spin_unlock(¤t->sighand->siglock);
2733 write_unlock_irq(&tasklist_lock);
2734 cgroup_cancel_fork(p, args);
2735bad_fork_put_pidfd:
2736 if (clone_flags & CLONE_PIDFD) {
2737 fput(pidfile);
2738 put_unused_fd(pidfd);
2739 }
2740bad_fork_free_pid:
2741 if (pid != &init_struct_pid)
2742 free_pid(pid);
2743bad_fork_cleanup_thread:
2744 exit_thread(p);
2745bad_fork_cleanup_io:
2746 if (p->io_context)
2747 exit_io_context(p);
2748bad_fork_cleanup_namespaces:
2749 exit_task_namespaces(p);
2750bad_fork_cleanup_mm:
2751 if (p->mm) {
2752 mm_clear_owner(p->mm, p);
2753 mmput(p->mm);
2754 }
2755bad_fork_cleanup_signal:
2756 if (!(clone_flags & CLONE_THREAD))
2757 free_signal_struct(p->signal);
2758bad_fork_cleanup_sighand:
2759 __cleanup_sighand(p->sighand);
2760bad_fork_cleanup_fs:
2761 exit_fs(p); /* blocking */
2762bad_fork_cleanup_files:
2763 exit_files(p); /* blocking */
2764bad_fork_cleanup_semundo:
2765 exit_sem(p);
2766bad_fork_cleanup_security:
2767 security_task_free(p);
2768bad_fork_cleanup_audit:
2769 audit_free(p);
2770bad_fork_cleanup_perf:
2771 perf_event_free_task(p);
2772bad_fork_cleanup_policy:
2773 lockdep_free_task(p);
2774#ifdef CONFIG_NUMA
2775 mpol_put(p->mempolicy);
2776#endif
2777bad_fork_cleanup_delayacct:
2778 delayacct_tsk_free(p);
2779bad_fork_cleanup_count:
2780 dec_rlimit_ucounts(task_ucounts(p), UCOUNT_RLIMIT_NPROC, 1);
2781 exit_creds(p);
2782bad_fork_free:
2783 WRITE_ONCE(p->__state, TASK_DEAD);
2784 exit_task_stack_account(p);
2785 put_task_stack(p);
2786 delayed_free_task(p);
2787fork_out:
2788 spin_lock_irq(¤t->sighand->siglock);
2789 hlist_del_init(&delayed.node);
2790 spin_unlock_irq(¤t->sighand->siglock);
2791 return ERR_PTR(retval);
2792}
2793
2794static inline void init_idle_pids(struct task_struct *idle)
2795{
2796 enum pid_type type;
2797
2798 for (type = PIDTYPE_PID; type < PIDTYPE_MAX; ++type) {
2799 INIT_HLIST_NODE(&idle->pid_links[type]); /* not really needed */
2800 init_task_pid(idle, type, &init_struct_pid);
2801 }
2802}
2803
2804static int idle_dummy(void *dummy)
2805{
2806 /* This function is never called */
2807 return 0;
2808}
2809
2810struct task_struct * __init fork_idle(int cpu)
2811{
2812 struct task_struct *task;
2813 struct kernel_clone_args args = {
2814 .flags = CLONE_VM,
2815 .fn = &idle_dummy,
2816 .fn_arg = NULL,
2817 .kthread = 1,
2818 .idle = 1,
2819 };
2820
2821 task = copy_process(&init_struct_pid, 0, cpu_to_node(cpu), &args);
2822 if (!IS_ERR(task)) {
2823 init_idle_pids(task);
2824 init_idle(task, cpu);
2825 }
2826
2827 return task;
2828}
2829
2830/*
2831 * This is like kernel_clone(), but shaved down and tailored to just
2832 * creating io_uring workers. It returns a created task, or an error pointer.
2833 * The returned task is inactive, and the caller must fire it up through
2834 * wake_up_new_task(p). All signals are blocked in the created task.
2835 */
2836struct task_struct *create_io_thread(int (*fn)(void *), void *arg, int node)
2837{
2838 unsigned long flags = CLONE_FS|CLONE_FILES|CLONE_SIGHAND|CLONE_THREAD|
2839 CLONE_IO;
2840 struct kernel_clone_args args = {
2841 .flags = ((lower_32_bits(flags) | CLONE_VM |
2842 CLONE_UNTRACED) & ~CSIGNAL),
2843 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2844 .fn = fn,
2845 .fn_arg = arg,
2846 .io_thread = 1,
2847 .user_worker = 1,
2848 };
2849
2850 return copy_process(NULL, 0, node, &args);
2851}
2852
2853/*
2854 * Ok, this is the main fork-routine.
2855 *
2856 * It copies the process, and if successful kick-starts
2857 * it and waits for it to finish using the VM if required.
2858 *
2859 * args->exit_signal is expected to be checked for sanity by the caller.
2860 */
2861pid_t kernel_clone(struct kernel_clone_args *args)
2862{
2863 u64 clone_flags = args->flags;
2864 struct completion vfork;
2865 struct pid *pid;
2866 struct task_struct *p;
2867 int trace = 0;
2868 pid_t nr;
2869
2870 /*
2871 * For legacy clone() calls, CLONE_PIDFD uses the parent_tid argument
2872 * to return the pidfd. Hence, CLONE_PIDFD and CLONE_PARENT_SETTID are
2873 * mutually exclusive. With clone3() CLONE_PIDFD has grown a separate
2874 * field in struct clone_args and it still doesn't make sense to have
2875 * them both point at the same memory location. Performing this check
2876 * here has the advantage that we don't need to have a separate helper
2877 * to check for legacy clone().
2878 */
2879 if ((args->flags & CLONE_PIDFD) &&
2880 (args->flags & CLONE_PARENT_SETTID) &&
2881 (args->pidfd == args->parent_tid))
2882 return -EINVAL;
2883
2884 /*
2885 * Determine whether and which event to report to ptracer. When
2886 * called from kernel_thread or CLONE_UNTRACED is explicitly
2887 * requested, no event is reported; otherwise, report if the event
2888 * for the type of forking is enabled.
2889 */
2890 if (!(clone_flags & CLONE_UNTRACED)) {
2891 if (clone_flags & CLONE_VFORK)
2892 trace = PTRACE_EVENT_VFORK;
2893 else if (args->exit_signal != SIGCHLD)
2894 trace = PTRACE_EVENT_CLONE;
2895 else
2896 trace = PTRACE_EVENT_FORK;
2897
2898 if (likely(!ptrace_event_enabled(current, trace)))
2899 trace = 0;
2900 }
2901
2902 p = copy_process(NULL, trace, NUMA_NO_NODE, args);
2903 add_latent_entropy();
2904
2905 if (IS_ERR(p))
2906 return PTR_ERR(p);
2907
2908 /*
2909 * Do this prior waking up the new thread - the thread pointer
2910 * might get invalid after that point, if the thread exits quickly.
2911 */
2912 trace_sched_process_fork(current, p);
2913
2914 pid = get_task_pid(p, PIDTYPE_PID);
2915 nr = pid_vnr(pid);
2916
2917 if (clone_flags & CLONE_PARENT_SETTID)
2918 put_user(nr, args->parent_tid);
2919
2920 if (clone_flags & CLONE_VFORK) {
2921 p->vfork_done = &vfork;
2922 init_completion(&vfork);
2923 get_task_struct(p);
2924 }
2925
2926 if (IS_ENABLED(CONFIG_LRU_GEN_WALKS_MMU) && !(clone_flags & CLONE_VM)) {
2927 /* lock the task to synchronize with memcg migration */
2928 task_lock(p);
2929 lru_gen_add_mm(p->mm);
2930 task_unlock(p);
2931 }
2932
2933 wake_up_new_task(p);
2934
2935 /* forking complete and child started to run, tell ptracer */
2936 if (unlikely(trace))
2937 ptrace_event_pid(trace, pid);
2938
2939 if (clone_flags & CLONE_VFORK) {
2940 if (!wait_for_vfork_done(p, &vfork))
2941 ptrace_event_pid(PTRACE_EVENT_VFORK_DONE, pid);
2942 }
2943
2944 put_pid(pid);
2945 return nr;
2946}
2947
2948/*
2949 * Create a kernel thread.
2950 */
2951pid_t kernel_thread(int (*fn)(void *), void *arg, const char *name,
2952 unsigned long flags)
2953{
2954 struct kernel_clone_args args = {
2955 .flags = ((lower_32_bits(flags) | CLONE_VM |
2956 CLONE_UNTRACED) & ~CSIGNAL),
2957 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2958 .fn = fn,
2959 .fn_arg = arg,
2960 .name = name,
2961 .kthread = 1,
2962 };
2963
2964 return kernel_clone(&args);
2965}
2966
2967/*
2968 * Create a user mode thread.
2969 */
2970pid_t user_mode_thread(int (*fn)(void *), void *arg, unsigned long flags)
2971{
2972 struct kernel_clone_args args = {
2973 .flags = ((lower_32_bits(flags) | CLONE_VM |
2974 CLONE_UNTRACED) & ~CSIGNAL),
2975 .exit_signal = (lower_32_bits(flags) & CSIGNAL),
2976 .fn = fn,
2977 .fn_arg = arg,
2978 };
2979
2980 return kernel_clone(&args);
2981}
2982
2983#ifdef __ARCH_WANT_SYS_FORK
2984SYSCALL_DEFINE0(fork)
2985{
2986#ifdef CONFIG_MMU
2987 struct kernel_clone_args args = {
2988 .exit_signal = SIGCHLD,
2989 };
2990
2991 return kernel_clone(&args);
2992#else
2993 /* can not support in nommu mode */
2994 return -EINVAL;
2995#endif
2996}
2997#endif
2998
2999#ifdef __ARCH_WANT_SYS_VFORK
3000SYSCALL_DEFINE0(vfork)
3001{
3002 struct kernel_clone_args args = {
3003 .flags = CLONE_VFORK | CLONE_VM,
3004 .exit_signal = SIGCHLD,
3005 };
3006
3007 return kernel_clone(&args);
3008}
3009#endif
3010
3011#ifdef __ARCH_WANT_SYS_CLONE
3012#ifdef CONFIG_CLONE_BACKWARDS
3013SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
3014 int __user *, parent_tidptr,
3015 unsigned long, tls,
3016 int __user *, child_tidptr)
3017#elif defined(CONFIG_CLONE_BACKWARDS2)
3018SYSCALL_DEFINE5(clone, unsigned long, newsp, unsigned long, clone_flags,
3019 int __user *, parent_tidptr,
3020 int __user *, child_tidptr,
3021 unsigned long, tls)
3022#elif defined(CONFIG_CLONE_BACKWARDS3)
3023SYSCALL_DEFINE6(clone, unsigned long, clone_flags, unsigned long, newsp,
3024 int, stack_size,
3025 int __user *, parent_tidptr,
3026 int __user *, child_tidptr,
3027 unsigned long, tls)
3028#else
3029SYSCALL_DEFINE5(clone, unsigned long, clone_flags, unsigned long, newsp,
3030 int __user *, parent_tidptr,
3031 int __user *, child_tidptr,
3032 unsigned long, tls)
3033#endif
3034{
3035 struct kernel_clone_args args = {
3036 .flags = (lower_32_bits(clone_flags) & ~CSIGNAL),
3037 .pidfd = parent_tidptr,
3038 .child_tid = child_tidptr,
3039 .parent_tid = parent_tidptr,
3040 .exit_signal = (lower_32_bits(clone_flags) & CSIGNAL),
3041 .stack = newsp,
3042 .tls = tls,
3043 };
3044
3045 return kernel_clone(&args);
3046}
3047#endif
3048
3049#ifdef __ARCH_WANT_SYS_CLONE3
3050
3051noinline static int copy_clone_args_from_user(struct kernel_clone_args *kargs,
3052 struct clone_args __user *uargs,
3053 size_t usize)
3054{
3055 int err;
3056 struct clone_args args;
3057 pid_t *kset_tid = kargs->set_tid;
3058
3059 BUILD_BUG_ON(offsetofend(struct clone_args, tls) !=
3060 CLONE_ARGS_SIZE_VER0);
3061 BUILD_BUG_ON(offsetofend(struct clone_args, set_tid_size) !=
3062 CLONE_ARGS_SIZE_VER1);
3063 BUILD_BUG_ON(offsetofend(struct clone_args, cgroup) !=
3064 CLONE_ARGS_SIZE_VER2);
3065 BUILD_BUG_ON(sizeof(struct clone_args) != CLONE_ARGS_SIZE_VER2);
3066
3067 if (unlikely(usize > PAGE_SIZE))
3068 return -E2BIG;
3069 if (unlikely(usize < CLONE_ARGS_SIZE_VER0))
3070 return -EINVAL;
3071
3072 err = copy_struct_from_user(&args, sizeof(args), uargs, usize);
3073 if (err)
3074 return err;
3075
3076 if (unlikely(args.set_tid_size > MAX_PID_NS_LEVEL))
3077 return -EINVAL;
3078
3079 if (unlikely(!args.set_tid && args.set_tid_size > 0))
3080 return -EINVAL;
3081
3082 if (unlikely(args.set_tid && args.set_tid_size == 0))
3083 return -EINVAL;
3084
3085 /*
3086 * Verify that higher 32bits of exit_signal are unset and that
3087 * it is a valid signal
3088 */
3089 if (unlikely((args.exit_signal & ~((u64)CSIGNAL)) ||
3090 !valid_signal(args.exit_signal)))
3091 return -EINVAL;
3092
3093 if ((args.flags & CLONE_INTO_CGROUP) &&
3094 (args.cgroup > INT_MAX || usize < CLONE_ARGS_SIZE_VER2))
3095 return -EINVAL;
3096
3097 *kargs = (struct kernel_clone_args){
3098 .flags = args.flags,
3099 .pidfd = u64_to_user_ptr(args.pidfd),
3100 .child_tid = u64_to_user_ptr(args.child_tid),
3101 .parent_tid = u64_to_user_ptr(args.parent_tid),
3102 .exit_signal = args.exit_signal,
3103 .stack = args.stack,
3104 .stack_size = args.stack_size,
3105 .tls = args.tls,
3106 .set_tid_size = args.set_tid_size,
3107 .cgroup = args.cgroup,
3108 };
3109
3110 if (args.set_tid &&
3111 copy_from_user(kset_tid, u64_to_user_ptr(args.set_tid),
3112 (kargs->set_tid_size * sizeof(pid_t))))
3113 return -EFAULT;
3114
3115 kargs->set_tid = kset_tid;
3116
3117 return 0;
3118}
3119
3120/**
3121 * clone3_stack_valid - check and prepare stack
3122 * @kargs: kernel clone args
3123 *
3124 * Verify that the stack arguments userspace gave us are sane.
3125 * In addition, set the stack direction for userspace since it's easy for us to
3126 * determine.
3127 */
3128static inline bool clone3_stack_valid(struct kernel_clone_args *kargs)
3129{
3130 if (kargs->stack == 0) {
3131 if (kargs->stack_size > 0)
3132 return false;
3133 } else {
3134 if (kargs->stack_size == 0)
3135 return false;
3136
3137 if (!access_ok((void __user *)kargs->stack, kargs->stack_size))
3138 return false;
3139
3140#if !defined(CONFIG_STACK_GROWSUP)
3141 kargs->stack += kargs->stack_size;
3142#endif
3143 }
3144
3145 return true;
3146}
3147
3148static bool clone3_args_valid(struct kernel_clone_args *kargs)
3149{
3150 /* Verify that no unknown flags are passed along. */
3151 if (kargs->flags &
3152 ~(CLONE_LEGACY_FLAGS | CLONE_CLEAR_SIGHAND | CLONE_INTO_CGROUP))
3153 return false;
3154
3155 /*
3156 * - make the CLONE_DETACHED bit reusable for clone3
3157 * - make the CSIGNAL bits reusable for clone3
3158 */
3159 if (kargs->flags & (CLONE_DETACHED | (CSIGNAL & (~CLONE_NEWTIME))))
3160 return false;
3161
3162 if ((kargs->flags & (CLONE_SIGHAND | CLONE_CLEAR_SIGHAND)) ==
3163 (CLONE_SIGHAND | CLONE_CLEAR_SIGHAND))
3164 return false;
3165
3166 if ((kargs->flags & (CLONE_THREAD | CLONE_PARENT)) &&
3167 kargs->exit_signal)
3168 return false;
3169
3170 if (!clone3_stack_valid(kargs))
3171 return false;
3172
3173 return true;
3174}
3175
3176/**
3177 * sys_clone3 - create a new process with specific properties
3178 * @uargs: argument structure
3179 * @size: size of @uargs
3180 *
3181 * clone3() is the extensible successor to clone()/clone2().
3182 * It takes a struct as argument that is versioned by its size.
3183 *
3184 * Return: On success, a positive PID for the child process.
3185 * On error, a negative errno number.
3186 */
3187SYSCALL_DEFINE2(clone3, struct clone_args __user *, uargs, size_t, size)
3188{
3189 int err;
3190
3191 struct kernel_clone_args kargs;
3192 pid_t set_tid[MAX_PID_NS_LEVEL];
3193
3194 kargs.set_tid = set_tid;
3195
3196 err = copy_clone_args_from_user(&kargs, uargs, size);
3197 if (err)
3198 return err;
3199
3200 if (!clone3_args_valid(&kargs))
3201 return -EINVAL;
3202
3203 return kernel_clone(&kargs);
3204}
3205#endif
3206
3207void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data)
3208{
3209 struct task_struct *leader, *parent, *child;
3210 int res;
3211
3212 read_lock(&tasklist_lock);
3213 leader = top = top->group_leader;
3214down:
3215 for_each_thread(leader, parent) {
3216 list_for_each_entry(child, &parent->children, sibling) {
3217 res = visitor(child, data);
3218 if (res) {
3219 if (res < 0)
3220 goto out;
3221 leader = child;
3222 goto down;
3223 }
3224up:
3225 ;
3226 }
3227 }
3228
3229 if (leader != top) {
3230 child = leader;
3231 parent = child->real_parent;
3232 leader = parent->group_leader;
3233 goto up;
3234 }
3235out:
3236 read_unlock(&tasklist_lock);
3237}
3238
3239#ifndef ARCH_MIN_MMSTRUCT_ALIGN
3240#define ARCH_MIN_MMSTRUCT_ALIGN 0
3241#endif
3242
3243static void sighand_ctor(void *data)
3244{
3245 struct sighand_struct *sighand = data;
3246
3247 spin_lock_init(&sighand->siglock);
3248 init_waitqueue_head(&sighand->signalfd_wqh);
3249}
3250
3251void __init mm_cache_init(void)
3252{
3253 unsigned int mm_size;
3254
3255 /*
3256 * The mm_cpumask is located at the end of mm_struct, and is
3257 * dynamically sized based on the maximum CPU number this system
3258 * can have, taking hotplug into account (nr_cpu_ids).
3259 */
3260 mm_size = sizeof(struct mm_struct) + cpumask_size() + mm_cid_size();
3261
3262 mm_cachep = kmem_cache_create_usercopy("mm_struct",
3263 mm_size, ARCH_MIN_MMSTRUCT_ALIGN,
3264 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3265 offsetof(struct mm_struct, saved_auxv),
3266 sizeof_field(struct mm_struct, saved_auxv),
3267 NULL);
3268}
3269
3270void __init proc_caches_init(void)
3271{
3272 sighand_cachep = kmem_cache_create("sighand_cache",
3273 sizeof(struct sighand_struct), 0,
3274 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_TYPESAFE_BY_RCU|
3275 SLAB_ACCOUNT, sighand_ctor);
3276 signal_cachep = kmem_cache_create("signal_cache",
3277 sizeof(struct signal_struct), 0,
3278 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3279 NULL);
3280 files_cachep = kmem_cache_create("files_cache",
3281 sizeof(struct files_struct), 0,
3282 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3283 NULL);
3284 fs_cachep = kmem_cache_create("fs_cache",
3285 sizeof(struct fs_struct), 0,
3286 SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT,
3287 NULL);
3288
3289 vm_area_cachep = KMEM_CACHE(vm_area_struct, SLAB_PANIC|SLAB_ACCOUNT);
3290#ifdef CONFIG_PER_VMA_LOCK
3291 vma_lock_cachep = KMEM_CACHE(vma_lock, SLAB_PANIC|SLAB_ACCOUNT);
3292#endif
3293 mmap_init();
3294 nsproxy_cache_init();
3295}
3296
3297/*
3298 * Check constraints on flags passed to the unshare system call.
3299 */
3300static int check_unshare_flags(unsigned long unshare_flags)
3301{
3302 if (unshare_flags & ~(CLONE_THREAD|CLONE_FS|CLONE_NEWNS|CLONE_SIGHAND|
3303 CLONE_VM|CLONE_FILES|CLONE_SYSVSEM|
3304 CLONE_NEWUTS|CLONE_NEWIPC|CLONE_NEWNET|
3305 CLONE_NEWUSER|CLONE_NEWPID|CLONE_NEWCGROUP|
3306 CLONE_NEWTIME))
3307 return -EINVAL;
3308 /*
3309 * Not implemented, but pretend it works if there is nothing
3310 * to unshare. Note that unsharing the address space or the
3311 * signal handlers also need to unshare the signal queues (aka
3312 * CLONE_THREAD).
3313 */
3314 if (unshare_flags & (CLONE_THREAD | CLONE_SIGHAND | CLONE_VM)) {
3315 if (!thread_group_empty(current))
3316 return -EINVAL;
3317 }
3318 if (unshare_flags & (CLONE_SIGHAND | CLONE_VM)) {
3319 if (refcount_read(¤t->sighand->count) > 1)
3320 return -EINVAL;
3321 }
3322 if (unshare_flags & CLONE_VM) {
3323 if (!current_is_single_threaded())
3324 return -EINVAL;
3325 }
3326
3327 return 0;
3328}
3329
3330/*
3331 * Unshare the filesystem structure if it is being shared
3332 */
3333static int unshare_fs(unsigned long unshare_flags, struct fs_struct **new_fsp)
3334{
3335 struct fs_struct *fs = current->fs;
3336
3337 if (!(unshare_flags & CLONE_FS) || !fs)
3338 return 0;
3339
3340 /* don't need lock here; in the worst case we'll do useless copy */
3341 if (fs->users == 1)
3342 return 0;
3343
3344 *new_fsp = copy_fs_struct(fs);
3345 if (!*new_fsp)
3346 return -ENOMEM;
3347
3348 return 0;
3349}
3350
3351/*
3352 * Unshare file descriptor table if it is being shared
3353 */
3354int unshare_fd(unsigned long unshare_flags, unsigned int max_fds,
3355 struct files_struct **new_fdp)
3356{
3357 struct files_struct *fd = current->files;
3358 int error = 0;
3359
3360 if ((unshare_flags & CLONE_FILES) &&
3361 (fd && atomic_read(&fd->count) > 1)) {
3362 *new_fdp = dup_fd(fd, max_fds, &error);
3363 if (!*new_fdp)
3364 return error;
3365 }
3366
3367 return 0;
3368}
3369
3370/*
3371 * unshare allows a process to 'unshare' part of the process
3372 * context which was originally shared using clone. copy_*
3373 * functions used by kernel_clone() cannot be used here directly
3374 * because they modify an inactive task_struct that is being
3375 * constructed. Here we are modifying the current, active,
3376 * task_struct.
3377 */
3378int ksys_unshare(unsigned long unshare_flags)
3379{
3380 struct fs_struct *fs, *new_fs = NULL;
3381 struct files_struct *new_fd = NULL;
3382 struct cred *new_cred = NULL;
3383 struct nsproxy *new_nsproxy = NULL;
3384 int do_sysvsem = 0;
3385 int err;
3386
3387 /*
3388 * If unsharing a user namespace must also unshare the thread group
3389 * and unshare the filesystem root and working directories.
3390 */
3391 if (unshare_flags & CLONE_NEWUSER)
3392 unshare_flags |= CLONE_THREAD | CLONE_FS;
3393 /*
3394 * If unsharing vm, must also unshare signal handlers.
3395 */
3396 if (unshare_flags & CLONE_VM)
3397 unshare_flags |= CLONE_SIGHAND;
3398 /*
3399 * If unsharing a signal handlers, must also unshare the signal queues.
3400 */
3401 if (unshare_flags & CLONE_SIGHAND)
3402 unshare_flags |= CLONE_THREAD;
3403 /*
3404 * If unsharing namespace, must also unshare filesystem information.
3405 */
3406 if (unshare_flags & CLONE_NEWNS)
3407 unshare_flags |= CLONE_FS;
3408
3409 err = check_unshare_flags(unshare_flags);
3410 if (err)
3411 goto bad_unshare_out;
3412 /*
3413 * CLONE_NEWIPC must also detach from the undolist: after switching
3414 * to a new ipc namespace, the semaphore arrays from the old
3415 * namespace are unreachable.
3416 */
3417 if (unshare_flags & (CLONE_NEWIPC|CLONE_SYSVSEM))
3418 do_sysvsem = 1;
3419 err = unshare_fs(unshare_flags, &new_fs);
3420 if (err)
3421 goto bad_unshare_out;
3422 err = unshare_fd(unshare_flags, NR_OPEN_MAX, &new_fd);
3423 if (err)
3424 goto bad_unshare_cleanup_fs;
3425 err = unshare_userns(unshare_flags, &new_cred);
3426 if (err)
3427 goto bad_unshare_cleanup_fd;
3428 err = unshare_nsproxy_namespaces(unshare_flags, &new_nsproxy,
3429 new_cred, new_fs);
3430 if (err)
3431 goto bad_unshare_cleanup_cred;
3432
3433 if (new_cred) {
3434 err = set_cred_ucounts(new_cred);
3435 if (err)
3436 goto bad_unshare_cleanup_cred;
3437 }
3438
3439 if (new_fs || new_fd || do_sysvsem || new_cred || new_nsproxy) {
3440 if (do_sysvsem) {
3441 /*
3442 * CLONE_SYSVSEM is equivalent to sys_exit().
3443 */
3444 exit_sem(current);
3445 }
3446 if (unshare_flags & CLONE_NEWIPC) {
3447 /* Orphan segments in old ns (see sem above). */
3448 exit_shm(current);
3449 shm_init_task(current);
3450 }
3451
3452 if (new_nsproxy)
3453 switch_task_namespaces(current, new_nsproxy);
3454
3455 task_lock(current);
3456
3457 if (new_fs) {
3458 fs = current->fs;
3459 spin_lock(&fs->lock);
3460 current->fs = new_fs;
3461 if (--fs->users)
3462 new_fs = NULL;
3463 else
3464 new_fs = fs;
3465 spin_unlock(&fs->lock);
3466 }
3467
3468 if (new_fd)
3469 swap(current->files, new_fd);
3470
3471 task_unlock(current);
3472
3473 if (new_cred) {
3474 /* Install the new user namespace */
3475 commit_creds(new_cred);
3476 new_cred = NULL;
3477 }
3478 }
3479
3480 perf_event_namespaces(current);
3481
3482bad_unshare_cleanup_cred:
3483 if (new_cred)
3484 put_cred(new_cred);
3485bad_unshare_cleanup_fd:
3486 if (new_fd)
3487 put_files_struct(new_fd);
3488
3489bad_unshare_cleanup_fs:
3490 if (new_fs)
3491 free_fs_struct(new_fs);
3492
3493bad_unshare_out:
3494 return err;
3495}
3496
3497SYSCALL_DEFINE1(unshare, unsigned long, unshare_flags)
3498{
3499 return ksys_unshare(unshare_flags);
3500}
3501
3502/*
3503 * Helper to unshare the files of the current task.
3504 * We don't want to expose copy_files internals to
3505 * the exec layer of the kernel.
3506 */
3507
3508int unshare_files(void)
3509{
3510 struct task_struct *task = current;
3511 struct files_struct *old, *copy = NULL;
3512 int error;
3513
3514 error = unshare_fd(CLONE_FILES, NR_OPEN_MAX, ©);
3515 if (error || !copy)
3516 return error;
3517
3518 old = task->files;
3519 task_lock(task);
3520 task->files = copy;
3521 task_unlock(task);
3522 put_files_struct(old);
3523 return 0;
3524}
3525
3526int sysctl_max_threads(struct ctl_table *table, int write,
3527 void *buffer, size_t *lenp, loff_t *ppos)
3528{
3529 struct ctl_table t;
3530 int ret;
3531 int threads = max_threads;
3532 int min = 1;
3533 int max = MAX_THREADS;
3534
3535 t = *table;
3536 t.data = &threads;
3537 t.extra1 = &min;
3538 t.extra2 = &max;
3539
3540 ret = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
3541 if (ret || !write)
3542 return ret;
3543
3544 max_threads = threads;
3545
3546 return 0;
3547}