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