1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 1991, 1992 Linus Torvalds
9 * #!-checking implemented by tytso.
12 * Demand-loading implemented 01.12.91 - no need to read anything but
13 * the header into memory. The inode of the executable is put into
14 * "current->executable", and page faults do the actual loading. Clean.
16 * Once more I can proudly say that linux stood up to being changed: it
17 * was less than 2 hours work to get demand-loading completely implemented.
19 * Demand loading changed July 1993 by Eric Youngdale. Use mmap instead,
20 * current->executable is only used by the procfs. This allows a dispatch
21 * table to check for several different types of binary formats. We keep
22 * trying until we recognize the file or we run out of supported binary
26 #include <linux/kernel_read_file.h>
27 #include <linux/slab.h>
28 #include <linux/file.h>
29 #include <linux/fdtable.h>
31 #include <linux/stat.h>
32 #include <linux/fcntl.h>
33 #include <linux/swap.h>
34 #include <linux/string.h>
35 #include <linux/init.h>
36 #include <linux/sched/mm.h>
37 #include <linux/sched/coredump.h>
38 #include <linux/sched/signal.h>
39 #include <linux/sched/numa_balancing.h>
40 #include <linux/sched/task.h>
41 #include <linux/pagemap.h>
42 #include <linux/perf_event.h>
43 #include <linux/highmem.h>
44 #include <linux/spinlock.h>
45 #include <linux/key.h>
46 #include <linux/personality.h>
47 #include <linux/binfmts.h>
48 #include <linux/utsname.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/module.h>
51 #include <linux/namei.h>
52 #include <linux/mount.h>
53 #include <linux/security.h>
54 #include <linux/syscalls.h>
55 #include <linux/tsacct_kern.h>
56 #include <linux/cn_proc.h>
57 #include <linux/audit.h>
58 #include <linux/kmod.h>
59 #include <linux/fsnotify.h>
60 #include <linux/fs_struct.h>
61 #include <linux/oom.h>
62 #include <linux/compat.h>
63 #include <linux/vmalloc.h>
64 #include <linux/io_uring.h>
65 #include <linux/syscall_user_dispatch.h>
66 #include <linux/coredump.h>
67 #include <linux/time_namespace.h>
69 #include <linux/uaccess.h>
70 #include <asm/mmu_context.h>
73 #include <trace/events/task.h>
76 #include <trace/events/sched.h>
78 static int bprm_creds_from_file(struct linux_binprm *bprm);
80 int suid_dumpable = 0;
82 static LIST_HEAD(formats);
83 static DEFINE_RWLOCK(binfmt_lock);
85 void __register_binfmt(struct linux_binfmt * fmt, int insert)
87 write_lock(&binfmt_lock);
88 insert ? list_add(&fmt->lh, &formats) :
89 list_add_tail(&fmt->lh, &formats);
90 write_unlock(&binfmt_lock);
93 EXPORT_SYMBOL(__register_binfmt);
95 void unregister_binfmt(struct linux_binfmt * fmt)
97 write_lock(&binfmt_lock);
99 write_unlock(&binfmt_lock);
102 EXPORT_SYMBOL(unregister_binfmt);
104 static inline void put_binfmt(struct linux_binfmt * fmt)
106 module_put(fmt->module);
109 bool path_noexec(const struct path *path)
111 return (path->mnt->mnt_flags & MNT_NOEXEC) ||
112 (path->mnt->mnt_sb->s_iflags & SB_I_NOEXEC);
117 * Note that a shared library must be both readable and executable due to
120 * Also note that we take the address to load from the file itself.
122 SYSCALL_DEFINE1(uselib, const char __user *, library)
124 struct linux_binfmt *fmt;
126 struct filename *tmp = getname(library);
127 int error = PTR_ERR(tmp);
128 static const struct open_flags uselib_flags = {
129 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
130 .acc_mode = MAY_READ | MAY_EXEC,
131 .intent = LOOKUP_OPEN,
132 .lookup_flags = LOOKUP_FOLLOW,
138 file = do_filp_open(AT_FDCWD, tmp, &uselib_flags);
140 error = PTR_ERR(file);
145 * may_open() has already checked for this, so it should be
146 * impossible to trip now. But we need to be extra cautious
147 * and check again at the very end too.
150 if (WARN_ON_ONCE(!S_ISREG(file_inode(file)->i_mode) ||
151 path_noexec(&file->f_path)))
158 read_lock(&binfmt_lock);
159 list_for_each_entry(fmt, &formats, lh) {
160 if (!fmt->load_shlib)
162 if (!try_module_get(fmt->module))
164 read_unlock(&binfmt_lock);
165 error = fmt->load_shlib(file);
166 read_lock(&binfmt_lock);
168 if (error != -ENOEXEC)
171 read_unlock(&binfmt_lock);
177 #endif /* #ifdef CONFIG_USELIB */
181 * The nascent bprm->mm is not visible until exec_mmap() but it can
182 * use a lot of memory, account these pages in current->mm temporary
183 * for oom_badness()->get_mm_rss(). Once exec succeeds or fails, we
184 * change the counter back via acct_arg_size(0).
186 static void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
188 struct mm_struct *mm = current->mm;
189 long diff = (long)(pages - bprm->vma_pages);
194 bprm->vma_pages = pages;
195 add_mm_counter(mm, MM_ANONPAGES, diff);
198 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
203 unsigned int gup_flags = FOLL_FORCE;
205 #ifdef CONFIG_STACK_GROWSUP
207 ret = expand_downwards(bprm->vma, pos);
214 gup_flags |= FOLL_WRITE;
217 * We are doing an exec(). 'current' is the process
218 * doing the exec and bprm->mm is the new process's mm.
220 mmap_read_lock(bprm->mm);
221 ret = get_user_pages_remote(bprm->mm, pos, 1, gup_flags,
223 mmap_read_unlock(bprm->mm);
228 acct_arg_size(bprm, vma_pages(bprm->vma));
233 static void put_arg_page(struct page *page)
238 static void free_arg_pages(struct linux_binprm *bprm)
242 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
245 flush_cache_page(bprm->vma, pos, page_to_pfn(page));
248 static int __bprm_mm_init(struct linux_binprm *bprm)
251 struct vm_area_struct *vma = NULL;
252 struct mm_struct *mm = bprm->mm;
254 bprm->vma = vma = vm_area_alloc(mm);
257 vma_set_anonymous(vma);
259 if (mmap_write_lock_killable(mm)) {
265 * Place the stack at the largest stack address the architecture
266 * supports. Later, we'll move this to an appropriate place. We don't
267 * use STACK_TOP because that can depend on attributes which aren't
270 BUILD_BUG_ON(VM_STACK_FLAGS & VM_STACK_INCOMPLETE_SETUP);
271 vma->vm_end = STACK_TOP_MAX;
272 vma->vm_start = vma->vm_end - PAGE_SIZE;
273 vma->vm_flags = VM_SOFTDIRTY | VM_STACK_FLAGS | VM_STACK_INCOMPLETE_SETUP;
274 vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
276 err = insert_vm_struct(mm, vma);
280 mm->stack_vm = mm->total_vm = 1;
281 mmap_write_unlock(mm);
282 bprm->p = vma->vm_end - sizeof(void *);
285 mmap_write_unlock(mm);
292 static bool valid_arg_len(struct linux_binprm *bprm, long len)
294 return len <= MAX_ARG_STRLEN;
299 static inline void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
303 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
308 page = bprm->page[pos / PAGE_SIZE];
309 if (!page && write) {
310 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
313 bprm->page[pos / PAGE_SIZE] = page;
319 static void put_arg_page(struct page *page)
323 static void free_arg_page(struct linux_binprm *bprm, int i)
326 __free_page(bprm->page[i]);
327 bprm->page[i] = NULL;
331 static void free_arg_pages(struct linux_binprm *bprm)
335 for (i = 0; i < MAX_ARG_PAGES; i++)
336 free_arg_page(bprm, i);
339 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
344 static int __bprm_mm_init(struct linux_binprm *bprm)
346 bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
350 static bool valid_arg_len(struct linux_binprm *bprm, long len)
352 return len <= bprm->p;
355 #endif /* CONFIG_MMU */
358 * Create a new mm_struct and populate it with a temporary stack
359 * vm_area_struct. We don't have enough context at this point to set the stack
360 * flags, permissions, and offset, so we use temporary values. We'll update
361 * them later in setup_arg_pages().
363 static int bprm_mm_init(struct linux_binprm *bprm)
366 struct mm_struct *mm = NULL;
368 bprm->mm = mm = mm_alloc();
373 /* Save current stack limit for all calculations made during exec. */
374 task_lock(current->group_leader);
375 bprm->rlim_stack = current->signal->rlim[RLIMIT_STACK];
376 task_unlock(current->group_leader);
378 err = __bprm_mm_init(bprm);
393 struct user_arg_ptr {
398 const char __user *const __user *native;
400 const compat_uptr_t __user *compat;
405 static const char __user *get_user_arg_ptr(struct user_arg_ptr argv, int nr)
407 const char __user *native;
410 if (unlikely(argv.is_compat)) {
411 compat_uptr_t compat;
413 if (get_user(compat, argv.ptr.compat + nr))
414 return ERR_PTR(-EFAULT);
416 return compat_ptr(compat);
420 if (get_user(native, argv.ptr.native + nr))
421 return ERR_PTR(-EFAULT);
427 * count() counts the number of strings in array ARGV.
429 static int count(struct user_arg_ptr argv, int max)
433 if (argv.ptr.native != NULL) {
435 const char __user *p = get_user_arg_ptr(argv, i);
447 if (fatal_signal_pending(current))
448 return -ERESTARTNOHAND;
455 static int count_strings_kernel(const char *const *argv)
462 for (i = 0; argv[i]; ++i) {
463 if (i >= MAX_ARG_STRINGS)
465 if (fatal_signal_pending(current))
466 return -ERESTARTNOHAND;
472 static int bprm_stack_limits(struct linux_binprm *bprm)
474 unsigned long limit, ptr_size;
477 * Limit to 1/4 of the max stack size or 3/4 of _STK_LIM
478 * (whichever is smaller) for the argv+env strings.
480 * - the remaining binfmt code will not run out of stack space,
481 * - the program will have a reasonable amount of stack left
484 limit = _STK_LIM / 4 * 3;
485 limit = min(limit, bprm->rlim_stack.rlim_cur / 4);
487 * We've historically supported up to 32 pages (ARG_MAX)
488 * of argument strings even with small stacks
490 limit = max_t(unsigned long, limit, ARG_MAX);
492 * We must account for the size of all the argv and envp pointers to
493 * the argv and envp strings, since they will also take up space in
494 * the stack. They aren't stored until much later when we can't
495 * signal to the parent that the child has run out of stack space.
496 * Instead, calculate it here so it's possible to fail gracefully.
498 * In the case of argc = 0, make sure there is space for adding a
499 * empty string (which will bump argc to 1), to ensure confused
500 * userspace programs don't start processing from argv[1], thinking
501 * argc can never be 0, to keep them from walking envp by accident.
502 * See do_execveat_common().
504 ptr_size = (max(bprm->argc, 1) + bprm->envc) * sizeof(void *);
505 if (limit <= ptr_size)
509 bprm->argmin = bprm->p - limit;
514 * 'copy_strings()' copies argument/environment strings from the old
515 * processes's memory to the new process's stack. The call to get_user_pages()
516 * ensures the destination page is created and not swapped out.
518 static int copy_strings(int argc, struct user_arg_ptr argv,
519 struct linux_binprm *bprm)
521 struct page *kmapped_page = NULL;
523 unsigned long kpos = 0;
527 const char __user *str;
532 str = get_user_arg_ptr(argv, argc);
536 len = strnlen_user(str, MAX_ARG_STRLEN);
541 if (!valid_arg_len(bprm, len))
544 /* We're going to work our way backwards. */
549 if (bprm->p < bprm->argmin)
554 int offset, bytes_to_copy;
556 if (fatal_signal_pending(current)) {
557 ret = -ERESTARTNOHAND;
562 offset = pos % PAGE_SIZE;
566 bytes_to_copy = offset;
567 if (bytes_to_copy > len)
570 offset -= bytes_to_copy;
571 pos -= bytes_to_copy;
572 str -= bytes_to_copy;
573 len -= bytes_to_copy;
575 if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
578 page = get_arg_page(bprm, pos, 1);
585 flush_dcache_page(kmapped_page);
587 put_arg_page(kmapped_page);
590 kaddr = kmap_local_page(kmapped_page);
591 kpos = pos & PAGE_MASK;
592 flush_arg_page(bprm, kpos, kmapped_page);
594 if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
603 flush_dcache_page(kmapped_page);
605 put_arg_page(kmapped_page);
611 * Copy and argument/environment string from the kernel to the processes stack.
613 int copy_string_kernel(const char *arg, struct linux_binprm *bprm)
615 int len = strnlen(arg, MAX_ARG_STRLEN) + 1 /* terminating NUL */;
616 unsigned long pos = bprm->p;
620 if (!valid_arg_len(bprm, len))
623 /* We're going to work our way backwards. */
626 if (IS_ENABLED(CONFIG_MMU) && bprm->p < bprm->argmin)
630 unsigned int bytes_to_copy = min_t(unsigned int, len,
631 min_not_zero(offset_in_page(pos), PAGE_SIZE));
634 pos -= bytes_to_copy;
635 arg -= bytes_to_copy;
636 len -= bytes_to_copy;
638 page = get_arg_page(bprm, pos, 1);
641 flush_arg_page(bprm, pos & PAGE_MASK, page);
642 memcpy_to_page(page, offset_in_page(pos), arg, bytes_to_copy);
648 EXPORT_SYMBOL(copy_string_kernel);
650 static int copy_strings_kernel(int argc, const char *const *argv,
651 struct linux_binprm *bprm)
654 int ret = copy_string_kernel(argv[argc], bprm);
657 if (fatal_signal_pending(current))
658 return -ERESTARTNOHAND;
667 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
668 * the binfmt code determines where the new stack should reside, we shift it to
669 * its final location. The process proceeds as follows:
671 * 1) Use shift to calculate the new vma endpoints.
672 * 2) Extend vma to cover both the old and new ranges. This ensures the
673 * arguments passed to subsequent functions are consistent.
674 * 3) Move vma's page tables to the new range.
675 * 4) Free up any cleared pgd range.
676 * 5) Shrink the vma to cover only the new range.
678 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
680 struct mm_struct *mm = vma->vm_mm;
681 unsigned long old_start = vma->vm_start;
682 unsigned long old_end = vma->vm_end;
683 unsigned long length = old_end - old_start;
684 unsigned long new_start = old_start - shift;
685 unsigned long new_end = old_end - shift;
686 struct mmu_gather tlb;
688 BUG_ON(new_start > new_end);
691 * ensure there are no vmas between where we want to go
694 if (vma != find_vma(mm, new_start))
698 * cover the whole range: [new_start, old_end)
700 if (vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL))
704 * move the page tables downwards, on failure we rely on
705 * process cleanup to remove whatever mess we made.
707 if (length != move_page_tables(vma, old_start,
708 vma, new_start, length, false))
712 tlb_gather_mmu(&tlb, mm);
713 if (new_end > old_start) {
715 * when the old and new regions overlap clear from new_end.
717 free_pgd_range(&tlb, new_end, old_end, new_end,
718 vma->vm_next ? vma->vm_next->vm_start : USER_PGTABLES_CEILING);
721 * otherwise, clean from old_start; this is done to not touch
722 * the address space in [new_end, old_start) some architectures
723 * have constraints on va-space that make this illegal (IA64) -
724 * for the others its just a little faster.
726 free_pgd_range(&tlb, old_start, old_end, new_end,
727 vma->vm_next ? vma->vm_next->vm_start : USER_PGTABLES_CEILING);
729 tlb_finish_mmu(&tlb);
732 * Shrink the vma to just the new range. Always succeeds.
734 vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL);
740 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
741 * the stack is optionally relocated, and some extra space is added.
743 int setup_arg_pages(struct linux_binprm *bprm,
744 unsigned long stack_top,
745 int executable_stack)
748 unsigned long stack_shift;
749 struct mm_struct *mm = current->mm;
750 struct vm_area_struct *vma = bprm->vma;
751 struct vm_area_struct *prev = NULL;
752 unsigned long vm_flags;
753 unsigned long stack_base;
754 unsigned long stack_size;
755 unsigned long stack_expand;
756 unsigned long rlim_stack;
757 struct mmu_gather tlb;
759 #ifdef CONFIG_STACK_GROWSUP
760 /* Limit stack size */
761 stack_base = bprm->rlim_stack.rlim_max;
763 stack_base = calc_max_stack_size(stack_base);
765 /* Add space for stack randomization. */
766 stack_base += (STACK_RND_MASK << PAGE_SHIFT);
768 /* Make sure we didn't let the argument array grow too large. */
769 if (vma->vm_end - vma->vm_start > stack_base)
772 stack_base = PAGE_ALIGN(stack_top - stack_base);
774 stack_shift = vma->vm_start - stack_base;
775 mm->arg_start = bprm->p - stack_shift;
776 bprm->p = vma->vm_end - stack_shift;
778 stack_top = arch_align_stack(stack_top);
779 stack_top = PAGE_ALIGN(stack_top);
781 if (unlikely(stack_top < mmap_min_addr) ||
782 unlikely(vma->vm_end - vma->vm_start >= stack_top - mmap_min_addr))
785 stack_shift = vma->vm_end - stack_top;
787 bprm->p -= stack_shift;
788 mm->arg_start = bprm->p;
792 bprm->loader -= stack_shift;
793 bprm->exec -= stack_shift;
795 if (mmap_write_lock_killable(mm))
798 vm_flags = VM_STACK_FLAGS;
801 * Adjust stack execute permissions; explicitly enable for
802 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
803 * (arch default) otherwise.
805 if (unlikely(executable_stack == EXSTACK_ENABLE_X))
807 else if (executable_stack == EXSTACK_DISABLE_X)
808 vm_flags &= ~VM_EXEC;
809 vm_flags |= mm->def_flags;
810 vm_flags |= VM_STACK_INCOMPLETE_SETUP;
812 tlb_gather_mmu(&tlb, mm);
813 ret = mprotect_fixup(&tlb, vma, &prev, vma->vm_start, vma->vm_end,
815 tlb_finish_mmu(&tlb);
821 if (unlikely(vm_flags & VM_EXEC)) {
822 pr_warn_once("process '%pD4' started with executable stack\n",
826 /* Move stack pages down in memory. */
828 ret = shift_arg_pages(vma, stack_shift);
833 /* mprotect_fixup is overkill to remove the temporary stack flags */
834 vma->vm_flags &= ~VM_STACK_INCOMPLETE_SETUP;
836 stack_expand = 131072UL; /* randomly 32*4k (or 2*64k) pages */
837 stack_size = vma->vm_end - vma->vm_start;
839 * Align this down to a page boundary as expand_stack
842 rlim_stack = bprm->rlim_stack.rlim_cur & PAGE_MASK;
843 #ifdef CONFIG_STACK_GROWSUP
844 if (stack_size + stack_expand > rlim_stack)
845 stack_base = vma->vm_start + rlim_stack;
847 stack_base = vma->vm_end + stack_expand;
849 if (stack_size + stack_expand > rlim_stack)
850 stack_base = vma->vm_end - rlim_stack;
852 stack_base = vma->vm_start - stack_expand;
854 current->mm->start_stack = bprm->p;
855 ret = expand_stack(vma, stack_base);
860 mmap_write_unlock(mm);
863 EXPORT_SYMBOL(setup_arg_pages);
868 * Transfer the program arguments and environment from the holding pages
869 * onto the stack. The provided stack pointer is adjusted accordingly.
871 int transfer_args_to_stack(struct linux_binprm *bprm,
872 unsigned long *sp_location)
874 unsigned long index, stop, sp;
877 stop = bprm->p >> PAGE_SHIFT;
880 for (index = MAX_ARG_PAGES - 1; index >= stop; index--) {
881 unsigned int offset = index == stop ? bprm->p & ~PAGE_MASK : 0;
882 char *src = kmap_local_page(bprm->page[index]) + offset;
883 sp -= PAGE_SIZE - offset;
884 if (copy_to_user((void *) sp, src, PAGE_SIZE - offset) != 0)
896 EXPORT_SYMBOL(transfer_args_to_stack);
898 #endif /* CONFIG_MMU */
900 static struct file *do_open_execat(int fd, struct filename *name, int flags)
904 struct open_flags open_exec_flags = {
905 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
906 .acc_mode = MAY_EXEC,
907 .intent = LOOKUP_OPEN,
908 .lookup_flags = LOOKUP_FOLLOW,
911 if ((flags & ~(AT_SYMLINK_NOFOLLOW | AT_EMPTY_PATH)) != 0)
912 return ERR_PTR(-EINVAL);
913 if (flags & AT_SYMLINK_NOFOLLOW)
914 open_exec_flags.lookup_flags &= ~LOOKUP_FOLLOW;
915 if (flags & AT_EMPTY_PATH)
916 open_exec_flags.lookup_flags |= LOOKUP_EMPTY;
918 file = do_filp_open(fd, name, &open_exec_flags);
923 * may_open() has already checked for this, so it should be
924 * impossible to trip now. But we need to be extra cautious
925 * and check again at the very end too.
928 if (WARN_ON_ONCE(!S_ISREG(file_inode(file)->i_mode) ||
929 path_noexec(&file->f_path)))
932 err = deny_write_access(file);
936 if (name->name[0] != '\0')
947 struct file *open_exec(const char *name)
949 struct filename *filename = getname_kernel(name);
950 struct file *f = ERR_CAST(filename);
952 if (!IS_ERR(filename)) {
953 f = do_open_execat(AT_FDCWD, filename, 0);
958 EXPORT_SYMBOL(open_exec);
960 #if defined(CONFIG_HAVE_AOUT) || defined(CONFIG_BINFMT_FLAT) || \
961 defined(CONFIG_BINFMT_ELF_FDPIC)
962 ssize_t read_code(struct file *file, unsigned long addr, loff_t pos, size_t len)
964 ssize_t res = vfs_read(file, (void __user *)addr, len, &pos);
966 flush_icache_user_range(addr, addr + len);
969 EXPORT_SYMBOL(read_code);
973 * Maps the mm_struct mm into the current task struct.
974 * On success, this function returns with exec_update_lock
977 static int exec_mmap(struct mm_struct *mm)
979 struct task_struct *tsk;
980 struct mm_struct *old_mm, *active_mm;
984 /* Notify parent that we're no longer interested in the old VM */
986 vfork = !!tsk->vfork_done;
987 old_mm = current->mm;
988 exec_mm_release(tsk, old_mm);
992 ret = down_write_killable(&tsk->signal->exec_update_lock);
998 * If there is a pending fatal signal perhaps a signal
999 * whose default action is to create a coredump get
1000 * out and die instead of going through with the exec.
1002 ret = mmap_read_lock_killable(old_mm);
1004 up_write(&tsk->signal->exec_update_lock);
1010 membarrier_exec_mmap(mm);
1012 local_irq_disable();
1013 active_mm = tsk->active_mm;
1014 tsk->active_mm = mm;
1018 * This prevents preemption while active_mm is being loaded and
1019 * it and mm are being updated, which could cause problems for
1020 * lazy tlb mm refcounting when these are updated by context
1021 * switches. Not all architectures can handle irqs off over
1024 if (!IS_ENABLED(CONFIG_ARCH_WANT_IRQS_OFF_ACTIVATE_MM))
1026 activate_mm(active_mm, mm);
1027 if (IS_ENABLED(CONFIG_ARCH_WANT_IRQS_OFF_ACTIVATE_MM))
1033 timens_on_fork(tsk->nsproxy, tsk);
1036 mmap_read_unlock(old_mm);
1037 BUG_ON(active_mm != old_mm);
1038 setmax_mm_hiwater_rss(&tsk->signal->maxrss, old_mm);
1039 mm_update_next_owner(old_mm);
1047 static int de_thread(struct task_struct *tsk)
1049 struct signal_struct *sig = tsk->signal;
1050 struct sighand_struct *oldsighand = tsk->sighand;
1051 spinlock_t *lock = &oldsighand->siglock;
1053 if (thread_group_empty(tsk))
1054 goto no_thread_group;
1057 * Kill all other threads in the thread group.
1059 spin_lock_irq(lock);
1060 if ((sig->flags & SIGNAL_GROUP_EXIT) || sig->group_exec_task) {
1062 * Another group action in progress, just
1063 * return so that the signal is processed.
1065 spin_unlock_irq(lock);
1069 sig->group_exec_task = tsk;
1070 sig->notify_count = zap_other_threads(tsk);
1071 if (!thread_group_leader(tsk))
1072 sig->notify_count--;
1074 while (sig->notify_count) {
1075 __set_current_state(TASK_KILLABLE);
1076 spin_unlock_irq(lock);
1078 if (__fatal_signal_pending(tsk))
1080 spin_lock_irq(lock);
1082 spin_unlock_irq(lock);
1085 * At this point all other threads have exited, all we have to
1086 * do is to wait for the thread group leader to become inactive,
1087 * and to assume its PID:
1089 if (!thread_group_leader(tsk)) {
1090 struct task_struct *leader = tsk->group_leader;
1093 cgroup_threadgroup_change_begin(tsk);
1094 write_lock_irq(&tasklist_lock);
1096 * Do this under tasklist_lock to ensure that
1097 * exit_notify() can't miss ->group_exec_task
1099 sig->notify_count = -1;
1100 if (likely(leader->exit_state))
1102 __set_current_state(TASK_KILLABLE);
1103 write_unlock_irq(&tasklist_lock);
1104 cgroup_threadgroup_change_end(tsk);
1106 if (__fatal_signal_pending(tsk))
1111 * The only record we have of the real-time age of a
1112 * process, regardless of execs it's done, is start_time.
1113 * All the past CPU time is accumulated in signal_struct
1114 * from sister threads now dead. But in this non-leader
1115 * exec, nothing survives from the original leader thread,
1116 * whose birth marks the true age of this process now.
1117 * When we take on its identity by switching to its PID, we
1118 * also take its birthdate (always earlier than our own).
1120 tsk->start_time = leader->start_time;
1121 tsk->start_boottime = leader->start_boottime;
1123 BUG_ON(!same_thread_group(leader, tsk));
1125 * An exec() starts a new thread group with the
1126 * TGID of the previous thread group. Rehash the
1127 * two threads with a switched PID, and release
1128 * the former thread group leader:
1131 /* Become a process group leader with the old leader's pid.
1132 * The old leader becomes a thread of the this thread group.
1134 exchange_tids(tsk, leader);
1135 transfer_pid(leader, tsk, PIDTYPE_TGID);
1136 transfer_pid(leader, tsk, PIDTYPE_PGID);
1137 transfer_pid(leader, tsk, PIDTYPE_SID);
1139 list_replace_rcu(&leader->tasks, &tsk->tasks);
1140 list_replace_init(&leader->sibling, &tsk->sibling);
1142 tsk->group_leader = tsk;
1143 leader->group_leader = tsk;
1145 tsk->exit_signal = SIGCHLD;
1146 leader->exit_signal = -1;
1148 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
1149 leader->exit_state = EXIT_DEAD;
1152 * We are going to release_task()->ptrace_unlink() silently,
1153 * the tracer can sleep in do_wait(). EXIT_DEAD guarantees
1154 * the tracer won't block again waiting for this thread.
1156 if (unlikely(leader->ptrace))
1157 __wake_up_parent(leader, leader->parent);
1158 write_unlock_irq(&tasklist_lock);
1159 cgroup_threadgroup_change_end(tsk);
1161 release_task(leader);
1164 sig->group_exec_task = NULL;
1165 sig->notify_count = 0;
1168 /* we have changed execution domain */
1169 tsk->exit_signal = SIGCHLD;
1171 BUG_ON(!thread_group_leader(tsk));
1175 /* protects against exit_notify() and __exit_signal() */
1176 read_lock(&tasklist_lock);
1177 sig->group_exec_task = NULL;
1178 sig->notify_count = 0;
1179 read_unlock(&tasklist_lock);
1185 * This function makes sure the current process has its own signal table,
1186 * so that flush_signal_handlers can later reset the handlers without
1187 * disturbing other processes. (Other processes might share the signal
1188 * table via the CLONE_SIGHAND option to clone().)
1190 static int unshare_sighand(struct task_struct *me)
1192 struct sighand_struct *oldsighand = me->sighand;
1194 if (refcount_read(&oldsighand->count) != 1) {
1195 struct sighand_struct *newsighand;
1197 * This ->sighand is shared with the CLONE_SIGHAND
1198 * but not CLONE_THREAD task, switch to the new one.
1200 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1204 refcount_set(&newsighand->count, 1);
1205 memcpy(newsighand->action, oldsighand->action,
1206 sizeof(newsighand->action));
1208 write_lock_irq(&tasklist_lock);
1209 spin_lock(&oldsighand->siglock);
1210 rcu_assign_pointer(me->sighand, newsighand);
1211 spin_unlock(&oldsighand->siglock);
1212 write_unlock_irq(&tasklist_lock);
1214 __cleanup_sighand(oldsighand);
1219 char *__get_task_comm(char *buf, size_t buf_size, struct task_struct *tsk)
1222 /* Always NUL terminated and zero-padded */
1223 strscpy_pad(buf, tsk->comm, buf_size);
1227 EXPORT_SYMBOL_GPL(__get_task_comm);
1230 * These functions flushes out all traces of the currently running executable
1231 * so that a new one can be started
1234 void __set_task_comm(struct task_struct *tsk, const char *buf, bool exec)
1237 trace_task_rename(tsk, buf);
1238 strscpy_pad(tsk->comm, buf, sizeof(tsk->comm));
1240 perf_event_comm(tsk, exec);
1244 * Calling this is the point of no return. None of the failures will be
1245 * seen by userspace since either the process is already taking a fatal
1246 * signal (via de_thread() or coredump), or will have SEGV raised
1247 * (after exec_mmap()) by search_binary_handler (see below).
1249 int begin_new_exec(struct linux_binprm * bprm)
1251 struct task_struct *me = current;
1254 /* Once we are committed compute the creds */
1255 retval = bprm_creds_from_file(bprm);
1260 * Ensure all future errors are fatal.
1262 bprm->point_of_no_return = true;
1265 * Make this the only thread in the thread group.
1267 retval = de_thread(me);
1272 * Cancel any io_uring activity across execve
1274 io_uring_task_cancel();
1276 /* Ensure the files table is not shared. */
1277 retval = unshare_files();
1282 * Must be called _before_ exec_mmap() as bprm->mm is
1283 * not visible until then. This also enables the update
1286 retval = set_mm_exe_file(bprm->mm, bprm->file);
1290 /* If the binary is not readable then enforce mm->dumpable=0 */
1291 would_dump(bprm, bprm->file);
1292 if (bprm->have_execfd)
1293 would_dump(bprm, bprm->executable);
1296 * Release all of the old mmap stuff
1298 acct_arg_size(bprm, 0);
1299 retval = exec_mmap(bprm->mm);
1305 #ifdef CONFIG_POSIX_TIMERS
1306 spin_lock_irq(&me->sighand->siglock);
1307 posix_cpu_timers_exit(me);
1308 spin_unlock_irq(&me->sighand->siglock);
1310 flush_itimer_signals();
1314 * Make the signal table private.
1316 retval = unshare_sighand(me);
1320 me->flags &= ~(PF_RANDOMIZE | PF_FORKNOEXEC |
1321 PF_NOFREEZE | PF_NO_SETAFFINITY);
1323 me->personality &= ~bprm->per_clear;
1325 clear_syscall_work_syscall_user_dispatch(me);
1328 * We have to apply CLOEXEC before we change whether the process is
1329 * dumpable (in setup_new_exec) to avoid a race with a process in userspace
1330 * trying to access the should-be-closed file descriptors of a process
1331 * undergoing exec(2).
1333 do_close_on_exec(me->files);
1335 if (bprm->secureexec) {
1336 /* Make sure parent cannot signal privileged process. */
1337 me->pdeath_signal = 0;
1340 * For secureexec, reset the stack limit to sane default to
1341 * avoid bad behavior from the prior rlimits. This has to
1342 * happen before arch_pick_mmap_layout(), which examines
1343 * RLIMIT_STACK, but after the point of no return to avoid
1344 * needing to clean up the change on failure.
1346 if (bprm->rlim_stack.rlim_cur > _STK_LIM)
1347 bprm->rlim_stack.rlim_cur = _STK_LIM;
1350 me->sas_ss_sp = me->sas_ss_size = 0;
1353 * Figure out dumpability. Note that this checking only of current
1354 * is wrong, but userspace depends on it. This should be testing
1355 * bprm->secureexec instead.
1357 if (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP ||
1358 !(uid_eq(current_euid(), current_uid()) &&
1359 gid_eq(current_egid(), current_gid())))
1360 set_dumpable(current->mm, suid_dumpable);
1362 set_dumpable(current->mm, SUID_DUMP_USER);
1365 __set_task_comm(me, kbasename(bprm->filename), true);
1367 /* An exec changes our domain. We are no longer part of the thread
1369 WRITE_ONCE(me->self_exec_id, me->self_exec_id + 1);
1370 flush_signal_handlers(me, 0);
1372 retval = set_cred_ucounts(bprm->cred);
1377 * install the new credentials for this executable
1379 security_bprm_committing_creds(bprm);
1381 commit_creds(bprm->cred);
1385 * Disable monitoring for regular users
1386 * when executing setuid binaries. Must
1387 * wait until new credentials are committed
1388 * by commit_creds() above
1390 if (get_dumpable(me->mm) != SUID_DUMP_USER)
1391 perf_event_exit_task(me);
1393 * cred_guard_mutex must be held at least to this point to prevent
1394 * ptrace_attach() from altering our determination of the task's
1395 * credentials; any time after this it may be unlocked.
1397 security_bprm_committed_creds(bprm);
1399 /* Pass the opened binary to the interpreter. */
1400 if (bprm->have_execfd) {
1401 retval = get_unused_fd_flags(0);
1404 fd_install(retval, bprm->executable);
1405 bprm->executable = NULL;
1406 bprm->execfd = retval;
1411 up_write(&me->signal->exec_update_lock);
1415 EXPORT_SYMBOL(begin_new_exec);
1417 void would_dump(struct linux_binprm *bprm, struct file *file)
1419 struct inode *inode = file_inode(file);
1420 struct user_namespace *mnt_userns = file_mnt_user_ns(file);
1421 if (inode_permission(mnt_userns, inode, MAY_READ) < 0) {
1422 struct user_namespace *old, *user_ns;
1423 bprm->interp_flags |= BINPRM_FLAGS_ENFORCE_NONDUMP;
1425 /* Ensure mm->user_ns contains the executable */
1426 user_ns = old = bprm->mm->user_ns;
1427 while ((user_ns != &init_user_ns) &&
1428 !privileged_wrt_inode_uidgid(user_ns, mnt_userns, inode))
1429 user_ns = user_ns->parent;
1431 if (old != user_ns) {
1432 bprm->mm->user_ns = get_user_ns(user_ns);
1437 EXPORT_SYMBOL(would_dump);
1439 void setup_new_exec(struct linux_binprm * bprm)
1441 /* Setup things that can depend upon the personality */
1442 struct task_struct *me = current;
1444 arch_pick_mmap_layout(me->mm, &bprm->rlim_stack);
1446 arch_setup_new_exec();
1448 /* Set the new mm task size. We have to do that late because it may
1449 * depend on TIF_32BIT which is only updated in flush_thread() on
1450 * some architectures like powerpc
1452 me->mm->task_size = TASK_SIZE;
1453 up_write(&me->signal->exec_update_lock);
1454 mutex_unlock(&me->signal->cred_guard_mutex);
1456 EXPORT_SYMBOL(setup_new_exec);
1458 /* Runs immediately before start_thread() takes over. */
1459 void finalize_exec(struct linux_binprm *bprm)
1461 /* Store any stack rlimit changes before starting thread. */
1462 task_lock(current->group_leader);
1463 current->signal->rlim[RLIMIT_STACK] = bprm->rlim_stack;
1464 task_unlock(current->group_leader);
1466 EXPORT_SYMBOL(finalize_exec);
1469 * Prepare credentials and lock ->cred_guard_mutex.
1470 * setup_new_exec() commits the new creds and drops the lock.
1471 * Or, if exec fails before, free_bprm() should release ->cred
1474 static int prepare_bprm_creds(struct linux_binprm *bprm)
1476 if (mutex_lock_interruptible(¤t->signal->cred_guard_mutex))
1477 return -ERESTARTNOINTR;
1479 bprm->cred = prepare_exec_creds();
1480 if (likely(bprm->cred))
1483 mutex_unlock(¤t->signal->cred_guard_mutex);
1487 static void free_bprm(struct linux_binprm *bprm)
1490 acct_arg_size(bprm, 0);
1493 free_arg_pages(bprm);
1495 mutex_unlock(¤t->signal->cred_guard_mutex);
1496 abort_creds(bprm->cred);
1499 allow_write_access(bprm->file);
1502 if (bprm->executable)
1503 fput(bprm->executable);
1504 /* If a binfmt changed the interp, free it. */
1505 if (bprm->interp != bprm->filename)
1506 kfree(bprm->interp);
1507 kfree(bprm->fdpath);
1511 static struct linux_binprm *alloc_bprm(int fd, struct filename *filename)
1513 struct linux_binprm *bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1514 int retval = -ENOMEM;
1518 if (fd == AT_FDCWD || filename->name[0] == '/') {
1519 bprm->filename = filename->name;
1521 if (filename->name[0] == '\0')
1522 bprm->fdpath = kasprintf(GFP_KERNEL, "/dev/fd/%d", fd);
1524 bprm->fdpath = kasprintf(GFP_KERNEL, "/dev/fd/%d/%s",
1525 fd, filename->name);
1529 bprm->filename = bprm->fdpath;
1531 bprm->interp = bprm->filename;
1533 retval = bprm_mm_init(bprm);
1541 return ERR_PTR(retval);
1544 int bprm_change_interp(const char *interp, struct linux_binprm *bprm)
1546 /* If a binfmt changed the interp, free it first. */
1547 if (bprm->interp != bprm->filename)
1548 kfree(bprm->interp);
1549 bprm->interp = kstrdup(interp, GFP_KERNEL);
1554 EXPORT_SYMBOL(bprm_change_interp);
1557 * determine how safe it is to execute the proposed program
1558 * - the caller must hold ->cred_guard_mutex to protect against
1559 * PTRACE_ATTACH or seccomp thread-sync
1561 static void check_unsafe_exec(struct linux_binprm *bprm)
1563 struct task_struct *p = current, *t;
1567 bprm->unsafe |= LSM_UNSAFE_PTRACE;
1570 * This isn't strictly necessary, but it makes it harder for LSMs to
1573 if (task_no_new_privs(current))
1574 bprm->unsafe |= LSM_UNSAFE_NO_NEW_PRIVS;
1578 spin_lock(&p->fs->lock);
1580 while_each_thread(p, t) {
1586 if (p->fs->users > n_fs)
1587 bprm->unsafe |= LSM_UNSAFE_SHARE;
1590 spin_unlock(&p->fs->lock);
1593 static void bprm_fill_uid(struct linux_binprm *bprm, struct file *file)
1595 /* Handle suid and sgid on files */
1596 struct user_namespace *mnt_userns;
1597 struct inode *inode;
1602 if (!mnt_may_suid(file->f_path.mnt))
1605 if (task_no_new_privs(current))
1608 inode = file->f_path.dentry->d_inode;
1609 mode = READ_ONCE(inode->i_mode);
1610 if (!(mode & (S_ISUID|S_ISGID)))
1613 mnt_userns = file_mnt_user_ns(file);
1615 /* Be careful if suid/sgid is set */
1618 /* reload atomically mode/uid/gid now that lock held */
1619 mode = inode->i_mode;
1620 uid = i_uid_into_mnt(mnt_userns, inode);
1621 gid = i_gid_into_mnt(mnt_userns, inode);
1622 inode_unlock(inode);
1624 /* We ignore suid/sgid if there are no mappings for them in the ns */
1625 if (!kuid_has_mapping(bprm->cred->user_ns, uid) ||
1626 !kgid_has_mapping(bprm->cred->user_ns, gid))
1629 if (mode & S_ISUID) {
1630 bprm->per_clear |= PER_CLEAR_ON_SETID;
1631 bprm->cred->euid = uid;
1634 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1635 bprm->per_clear |= PER_CLEAR_ON_SETID;
1636 bprm->cred->egid = gid;
1641 * Compute brpm->cred based upon the final binary.
1643 static int bprm_creds_from_file(struct linux_binprm *bprm)
1645 /* Compute creds based on which file? */
1646 struct file *file = bprm->execfd_creds ? bprm->executable : bprm->file;
1648 bprm_fill_uid(bprm, file);
1649 return security_bprm_creds_from_file(bprm, file);
1653 * Fill the binprm structure from the inode.
1654 * Read the first BINPRM_BUF_SIZE bytes
1656 * This may be called multiple times for binary chains (scripts for example).
1658 static int prepare_binprm(struct linux_binprm *bprm)
1662 memset(bprm->buf, 0, BINPRM_BUF_SIZE);
1663 return kernel_read(bprm->file, bprm->buf, BINPRM_BUF_SIZE, &pos);
1667 * Arguments are '\0' separated strings found at the location bprm->p
1668 * points to; chop off the first by relocating brpm->p to right after
1669 * the first '\0' encountered.
1671 int remove_arg_zero(struct linux_binprm *bprm)
1674 unsigned long offset;
1682 offset = bprm->p & ~PAGE_MASK;
1683 page = get_arg_page(bprm, bprm->p, 0);
1688 kaddr = kmap_local_page(page);
1690 for (; offset < PAGE_SIZE && kaddr[offset];
1691 offset++, bprm->p++)
1694 kunmap_local(kaddr);
1696 } while (offset == PAGE_SIZE);
1705 EXPORT_SYMBOL(remove_arg_zero);
1707 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1709 * cycle the list of binary formats handler, until one recognizes the image
1711 static int search_binary_handler(struct linux_binprm *bprm)
1713 bool need_retry = IS_ENABLED(CONFIG_MODULES);
1714 struct linux_binfmt *fmt;
1717 retval = prepare_binprm(bprm);
1721 retval = security_bprm_check(bprm);
1727 read_lock(&binfmt_lock);
1728 list_for_each_entry(fmt, &formats, lh) {
1729 if (!try_module_get(fmt->module))
1731 read_unlock(&binfmt_lock);
1733 retval = fmt->load_binary(bprm);
1735 read_lock(&binfmt_lock);
1737 if (bprm->point_of_no_return || (retval != -ENOEXEC)) {
1738 read_unlock(&binfmt_lock);
1742 read_unlock(&binfmt_lock);
1745 if (printable(bprm->buf[0]) && printable(bprm->buf[1]) &&
1746 printable(bprm->buf[2]) && printable(bprm->buf[3]))
1748 if (request_module("binfmt-%04x", *(ushort *)(bprm->buf + 2)) < 0)
1757 static int exec_binprm(struct linux_binprm *bprm)
1759 pid_t old_pid, old_vpid;
1762 /* Need to fetch pid before load_binary changes it */
1763 old_pid = current->pid;
1765 old_vpid = task_pid_nr_ns(current, task_active_pid_ns(current->parent));
1768 /* This allows 4 levels of binfmt rewrites before failing hard. */
1769 for (depth = 0;; depth++) {
1774 ret = search_binary_handler(bprm);
1777 if (!bprm->interpreter)
1781 bprm->file = bprm->interpreter;
1782 bprm->interpreter = NULL;
1784 allow_write_access(exec);
1785 if (unlikely(bprm->have_execfd)) {
1786 if (bprm->executable) {
1790 bprm->executable = exec;
1796 trace_sched_process_exec(current, old_pid, bprm);
1797 ptrace_event(PTRACE_EVENT_EXEC, old_vpid);
1798 proc_exec_connector(current);
1803 * sys_execve() executes a new program.
1805 static int bprm_execve(struct linux_binprm *bprm,
1806 int fd, struct filename *filename, int flags)
1811 retval = prepare_bprm_creds(bprm);
1815 check_unsafe_exec(bprm);
1816 current->in_execve = 1;
1818 file = do_open_execat(fd, filename, flags);
1819 retval = PTR_ERR(file);
1827 * Record that a name derived from an O_CLOEXEC fd will be
1828 * inaccessible after exec. This allows the code in exec to
1829 * choose to fail when the executable is not mmaped into the
1830 * interpreter and an open file descriptor is not passed to
1831 * the interpreter. This makes for a better user experience
1832 * than having the interpreter start and then immediately fail
1833 * when it finds the executable is inaccessible.
1835 if (bprm->fdpath && get_close_on_exec(fd))
1836 bprm->interp_flags |= BINPRM_FLAGS_PATH_INACCESSIBLE;
1838 /* Set the unchanging part of bprm->cred */
1839 retval = security_bprm_creds_for_exec(bprm);
1843 retval = exec_binprm(bprm);
1847 /* execve succeeded */
1848 current->fs->in_exec = 0;
1849 current->in_execve = 0;
1850 rseq_execve(current);
1851 acct_update_integrals(current);
1852 task_numa_free(current, false);
1857 * If past the point of no return ensure the code never
1858 * returns to the userspace process. Use an existing fatal
1859 * signal if present otherwise terminate the process with
1862 if (bprm->point_of_no_return && !fatal_signal_pending(current))
1863 force_fatal_sig(SIGSEGV);
1866 current->fs->in_exec = 0;
1867 current->in_execve = 0;
1872 static int do_execveat_common(int fd, struct filename *filename,
1873 struct user_arg_ptr argv,
1874 struct user_arg_ptr envp,
1877 struct linux_binprm *bprm;
1880 if (IS_ERR(filename))
1881 return PTR_ERR(filename);
1884 * We move the actual failure in case of RLIMIT_NPROC excess from
1885 * set*uid() to execve() because too many poorly written programs
1886 * don't check setuid() return code. Here we additionally recheck
1887 * whether NPROC limit is still exceeded.
1889 if ((current->flags & PF_NPROC_EXCEEDED) &&
1890 is_ucounts_overlimit(current_ucounts(), UCOUNT_RLIMIT_NPROC, rlimit(RLIMIT_NPROC))) {
1895 /* We're below the limit (still or again), so we don't want to make
1896 * further execve() calls fail. */
1897 current->flags &= ~PF_NPROC_EXCEEDED;
1899 bprm = alloc_bprm(fd, filename);
1901 retval = PTR_ERR(bprm);
1905 retval = count(argv, MAX_ARG_STRINGS);
1907 pr_warn_once("process '%s' launched '%s' with NULL argv: empty string added\n",
1908 current->comm, bprm->filename);
1911 bprm->argc = retval;
1913 retval = count(envp, MAX_ARG_STRINGS);
1916 bprm->envc = retval;
1918 retval = bprm_stack_limits(bprm);
1922 retval = copy_string_kernel(bprm->filename, bprm);
1925 bprm->exec = bprm->p;
1927 retval = copy_strings(bprm->envc, envp, bprm);
1931 retval = copy_strings(bprm->argc, argv, bprm);
1936 * When argv is empty, add an empty string ("") as argv[0] to
1937 * ensure confused userspace programs that start processing
1938 * from argv[1] won't end up walking envp. See also
1939 * bprm_stack_limits().
1941 if (bprm->argc == 0) {
1942 retval = copy_string_kernel("", bprm);
1948 retval = bprm_execve(bprm, fd, filename, flags);
1957 int kernel_execve(const char *kernel_filename,
1958 const char *const *argv, const char *const *envp)
1960 struct filename *filename;
1961 struct linux_binprm *bprm;
1965 /* It is non-sense for kernel threads to call execve */
1966 if (WARN_ON_ONCE(current->flags & PF_KTHREAD))
1969 filename = getname_kernel(kernel_filename);
1970 if (IS_ERR(filename))
1971 return PTR_ERR(filename);
1973 bprm = alloc_bprm(fd, filename);
1975 retval = PTR_ERR(bprm);
1979 retval = count_strings_kernel(argv);
1980 if (WARN_ON_ONCE(retval == 0))
1984 bprm->argc = retval;
1986 retval = count_strings_kernel(envp);
1989 bprm->envc = retval;
1991 retval = bprm_stack_limits(bprm);
1995 retval = copy_string_kernel(bprm->filename, bprm);
1998 bprm->exec = bprm->p;
2000 retval = copy_strings_kernel(bprm->envc, envp, bprm);
2004 retval = copy_strings_kernel(bprm->argc, argv, bprm);
2008 retval = bprm_execve(bprm, fd, filename, 0);
2016 static int do_execve(struct filename *filename,
2017 const char __user *const __user *__argv,
2018 const char __user *const __user *__envp)
2020 struct user_arg_ptr argv = { .ptr.native = __argv };
2021 struct user_arg_ptr envp = { .ptr.native = __envp };
2022 return do_execveat_common(AT_FDCWD, filename, argv, envp, 0);
2025 static int do_execveat(int fd, struct filename *filename,
2026 const char __user *const __user *__argv,
2027 const char __user *const __user *__envp,
2030 struct user_arg_ptr argv = { .ptr.native = __argv };
2031 struct user_arg_ptr envp = { .ptr.native = __envp };
2033 return do_execveat_common(fd, filename, argv, envp, flags);
2036 #ifdef CONFIG_COMPAT
2037 static int compat_do_execve(struct filename *filename,
2038 const compat_uptr_t __user *__argv,
2039 const compat_uptr_t __user *__envp)
2041 struct user_arg_ptr argv = {
2043 .ptr.compat = __argv,
2045 struct user_arg_ptr envp = {
2047 .ptr.compat = __envp,
2049 return do_execveat_common(AT_FDCWD, filename, argv, envp, 0);
2052 static int compat_do_execveat(int fd, struct filename *filename,
2053 const compat_uptr_t __user *__argv,
2054 const compat_uptr_t __user *__envp,
2057 struct user_arg_ptr argv = {
2059 .ptr.compat = __argv,
2061 struct user_arg_ptr envp = {
2063 .ptr.compat = __envp,
2065 return do_execveat_common(fd, filename, argv, envp, flags);
2069 void set_binfmt(struct linux_binfmt *new)
2071 struct mm_struct *mm = current->mm;
2074 module_put(mm->binfmt->module);
2078 __module_get(new->module);
2080 EXPORT_SYMBOL(set_binfmt);
2083 * set_dumpable stores three-value SUID_DUMP_* into mm->flags.
2085 void set_dumpable(struct mm_struct *mm, int value)
2087 if (WARN_ON((unsigned)value > SUID_DUMP_ROOT))
2090 set_mask_bits(&mm->flags, MMF_DUMPABLE_MASK, value);
2093 SYSCALL_DEFINE3(execve,
2094 const char __user *, filename,
2095 const char __user *const __user *, argv,
2096 const char __user *const __user *, envp)
2098 return do_execve(getname(filename), argv, envp);
2101 SYSCALL_DEFINE5(execveat,
2102 int, fd, const char __user *, filename,
2103 const char __user *const __user *, argv,
2104 const char __user *const __user *, envp,
2107 return do_execveat(fd,
2108 getname_uflags(filename, flags),
2112 #ifdef CONFIG_COMPAT
2113 COMPAT_SYSCALL_DEFINE3(execve, const char __user *, filename,
2114 const compat_uptr_t __user *, argv,
2115 const compat_uptr_t __user *, envp)
2117 return compat_do_execve(getname(filename), argv, envp);
2120 COMPAT_SYSCALL_DEFINE5(execveat, int, fd,
2121 const char __user *, filename,
2122 const compat_uptr_t __user *, argv,
2123 const compat_uptr_t __user *, envp,
2126 return compat_do_execveat(fd,
2127 getname_uflags(filename, flags),
2132 #ifdef CONFIG_SYSCTL
2134 static int proc_dointvec_minmax_coredump(struct ctl_table *table, int write,
2135 void *buffer, size_t *lenp, loff_t *ppos)
2137 int error = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
2140 validate_coredump_safety();
2144 static struct ctl_table fs_exec_sysctls[] = {
2146 .procname = "suid_dumpable",
2147 .data = &suid_dumpable,
2148 .maxlen = sizeof(int),
2150 .proc_handler = proc_dointvec_minmax_coredump,
2151 .extra1 = SYSCTL_ZERO,
2152 .extra2 = SYSCTL_TWO,
2157 static int __init init_fs_exec_sysctls(void)
2159 register_sysctl_init("fs", fs_exec_sysctls);
2163 fs_initcall(init_fs_exec_sysctls);
2164 #endif /* CONFIG_SYSCTL */