Linux Audio

Check our new training course

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