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