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>
68 #include <linux/user_events.h>
69 #include <linux/rseq.h>
71 #include <linux/uaccess.h>
72 #include <asm/mmu_context.h>
75 #include <trace/events/task.h>
78 #include <trace/events/sched.h>
80 static int bprm_creds_from_file(struct linux_binprm *bprm);
82 int suid_dumpable = 0;
84 static LIST_HEAD(formats);
85 static DEFINE_RWLOCK(binfmt_lock);
87 void __register_binfmt(struct linux_binfmt * fmt, int insert)
89 write_lock(&binfmt_lock);
90 insert ? list_add(&fmt->lh, &formats) :
91 list_add_tail(&fmt->lh, &formats);
92 write_unlock(&binfmt_lock);
95 EXPORT_SYMBOL(__register_binfmt);
97 void unregister_binfmt(struct linux_binfmt * fmt)
99 write_lock(&binfmt_lock);
101 write_unlock(&binfmt_lock);
104 EXPORT_SYMBOL(unregister_binfmt);
106 static inline void put_binfmt(struct linux_binfmt * fmt)
108 module_put(fmt->module);
111 bool path_noexec(const struct path *path)
113 return (path->mnt->mnt_flags & MNT_NOEXEC) ||
114 (path->mnt->mnt_sb->s_iflags & SB_I_NOEXEC);
119 * Note that a shared library must be both readable and executable due to
122 * Also note that we take the address to load from the file itself.
124 SYSCALL_DEFINE1(uselib, const char __user *, library)
126 struct linux_binfmt *fmt;
128 struct filename *tmp = getname(library);
129 int error = PTR_ERR(tmp);
130 static const struct open_flags uselib_flags = {
131 .open_flag = O_LARGEFILE | O_RDONLY,
132 .acc_mode = MAY_READ | MAY_EXEC,
133 .intent = LOOKUP_OPEN,
134 .lookup_flags = LOOKUP_FOLLOW,
140 file = do_filp_open(AT_FDCWD, tmp, &uselib_flags);
142 error = PTR_ERR(file);
147 * may_open() has already checked for this, so it should be
148 * impossible to trip now. But we need to be extra cautious
149 * and check again at the very end too.
152 if (WARN_ON_ONCE(!S_ISREG(file_inode(file)->i_mode) ||
153 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,
202 struct vm_area_struct *vma = bprm->vma;
203 struct mm_struct *mm = bprm->mm;
207 * Avoid relying on expanding the stack down in GUP (which
208 * does not work for STACK_GROWSUP anyway), and just do it
209 * by hand ahead of time.
211 if (write && pos < vma->vm_start) {
213 ret = expand_downwards(vma, pos);
214 if (unlikely(ret < 0)) {
215 mmap_write_unlock(mm);
218 mmap_write_downgrade(mm);
223 * We are doing an exec(). 'current' is the process
224 * doing the exec and 'mm' is the new process's mm.
226 ret = get_user_pages_remote(mm, pos, 1,
227 write ? FOLL_WRITE : 0,
229 mmap_read_unlock(mm);
234 acct_arg_size(bprm, vma_pages(vma));
239 static void put_arg_page(struct page *page)
244 static void free_arg_pages(struct linux_binprm *bprm)
248 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
251 flush_cache_page(bprm->vma, pos, page_to_pfn(page));
254 static int __bprm_mm_init(struct linux_binprm *bprm)
257 struct vm_area_struct *vma = NULL;
258 struct mm_struct *mm = bprm->mm;
260 bprm->vma = vma = vm_area_alloc(mm);
263 vma_set_anonymous(vma);
265 if (mmap_write_lock_killable(mm)) {
271 * Place the stack at the largest stack address the architecture
272 * supports. Later, we'll move this to an appropriate place. We don't
273 * use STACK_TOP because that can depend on attributes which aren't
276 BUILD_BUG_ON(VM_STACK_FLAGS & VM_STACK_INCOMPLETE_SETUP);
277 vma->vm_end = STACK_TOP_MAX;
278 vma->vm_start = vma->vm_end - PAGE_SIZE;
279 vm_flags_init(vma, VM_SOFTDIRTY | VM_STACK_FLAGS | VM_STACK_INCOMPLETE_SETUP);
280 vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
282 err = insert_vm_struct(mm, vma);
286 mm->stack_vm = mm->total_vm = 1;
287 mmap_write_unlock(mm);
288 bprm->p = vma->vm_end - sizeof(void *);
291 mmap_write_unlock(mm);
298 static bool valid_arg_len(struct linux_binprm *bprm, long len)
300 return len <= MAX_ARG_STRLEN;
305 static inline void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
309 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
314 page = bprm->page[pos / PAGE_SIZE];
315 if (!page && write) {
316 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
319 bprm->page[pos / PAGE_SIZE] = page;
325 static void put_arg_page(struct page *page)
329 static void free_arg_page(struct linux_binprm *bprm, int i)
332 __free_page(bprm->page[i]);
333 bprm->page[i] = NULL;
337 static void free_arg_pages(struct linux_binprm *bprm)
341 for (i = 0; i < MAX_ARG_PAGES; i++)
342 free_arg_page(bprm, i);
345 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
350 static int __bprm_mm_init(struct linux_binprm *bprm)
352 bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
356 static bool valid_arg_len(struct linux_binprm *bprm, long len)
358 return len <= bprm->p;
361 #endif /* CONFIG_MMU */
364 * Create a new mm_struct and populate it with a temporary stack
365 * vm_area_struct. We don't have enough context at this point to set the stack
366 * flags, permissions, and offset, so we use temporary values. We'll update
367 * them later in setup_arg_pages().
369 static int bprm_mm_init(struct linux_binprm *bprm)
372 struct mm_struct *mm = NULL;
374 bprm->mm = mm = mm_alloc();
379 /* Save current stack limit for all calculations made during exec. */
380 task_lock(current->group_leader);
381 bprm->rlim_stack = current->signal->rlim[RLIMIT_STACK];
382 task_unlock(current->group_leader);
384 err = __bprm_mm_init(bprm);
399 struct user_arg_ptr {
404 const char __user *const __user *native;
406 const compat_uptr_t __user *compat;
411 static const char __user *get_user_arg_ptr(struct user_arg_ptr argv, int nr)
413 const char __user *native;
416 if (unlikely(argv.is_compat)) {
417 compat_uptr_t compat;
419 if (get_user(compat, argv.ptr.compat + nr))
420 return ERR_PTR(-EFAULT);
422 return compat_ptr(compat);
426 if (get_user(native, argv.ptr.native + nr))
427 return ERR_PTR(-EFAULT);
433 * count() counts the number of strings in array ARGV.
435 static int count(struct user_arg_ptr argv, int max)
439 if (argv.ptr.native != NULL) {
441 const char __user *p = get_user_arg_ptr(argv, i);
453 if (fatal_signal_pending(current))
454 return -ERESTARTNOHAND;
461 static int count_strings_kernel(const char *const *argv)
468 for (i = 0; argv[i]; ++i) {
469 if (i >= MAX_ARG_STRINGS)
471 if (fatal_signal_pending(current))
472 return -ERESTARTNOHAND;
478 static int bprm_stack_limits(struct linux_binprm *bprm)
480 unsigned long limit, ptr_size;
483 * Limit to 1/4 of the max stack size or 3/4 of _STK_LIM
484 * (whichever is smaller) for the argv+env strings.
486 * - the remaining binfmt code will not run out of stack space,
487 * - the program will have a reasonable amount of stack left
490 limit = _STK_LIM / 4 * 3;
491 limit = min(limit, bprm->rlim_stack.rlim_cur / 4);
493 * We've historically supported up to 32 pages (ARG_MAX)
494 * of argument strings even with small stacks
496 limit = max_t(unsigned long, limit, ARG_MAX);
498 * We must account for the size of all the argv and envp pointers to
499 * the argv and envp strings, since they will also take up space in
500 * the stack. They aren't stored until much later when we can't
501 * signal to the parent that the child has run out of stack space.
502 * Instead, calculate it here so it's possible to fail gracefully.
504 * In the case of argc = 0, make sure there is space for adding a
505 * empty string (which will bump argc to 1), to ensure confused
506 * userspace programs don't start processing from argv[1], thinking
507 * argc can never be 0, to keep them from walking envp by accident.
508 * See do_execveat_common().
510 ptr_size = (max(bprm->argc, 1) + bprm->envc) * sizeof(void *);
511 if (limit <= ptr_size)
515 bprm->argmin = bprm->p - limit;
520 * 'copy_strings()' copies argument/environment strings from the old
521 * processes's memory to the new process's stack. The call to get_user_pages()
522 * ensures the destination page is created and not swapped out.
524 static int copy_strings(int argc, struct user_arg_ptr argv,
525 struct linux_binprm *bprm)
527 struct page *kmapped_page = NULL;
529 unsigned long kpos = 0;
533 const char __user *str;
538 str = get_user_arg_ptr(argv, argc);
542 len = strnlen_user(str, MAX_ARG_STRLEN);
547 if (!valid_arg_len(bprm, len))
550 /* We're going to work our way backwards. */
555 if (bprm->p < bprm->argmin)
560 int offset, bytes_to_copy;
562 if (fatal_signal_pending(current)) {
563 ret = -ERESTARTNOHAND;
568 offset = pos % PAGE_SIZE;
572 bytes_to_copy = offset;
573 if (bytes_to_copy > len)
576 offset -= bytes_to_copy;
577 pos -= bytes_to_copy;
578 str -= bytes_to_copy;
579 len -= bytes_to_copy;
581 if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
584 page = get_arg_page(bprm, pos, 1);
591 flush_dcache_page(kmapped_page);
593 put_arg_page(kmapped_page);
596 kaddr = kmap_local_page(kmapped_page);
597 kpos = pos & PAGE_MASK;
598 flush_arg_page(bprm, kpos, kmapped_page);
600 if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
609 flush_dcache_page(kmapped_page);
611 put_arg_page(kmapped_page);
617 * Copy and argument/environment string from the kernel to the processes stack.
619 int copy_string_kernel(const char *arg, struct linux_binprm *bprm)
621 int len = strnlen(arg, MAX_ARG_STRLEN) + 1 /* terminating NUL */;
622 unsigned long pos = bprm->p;
626 if (!valid_arg_len(bprm, len))
629 /* We're going to work our way backwards. */
632 if (IS_ENABLED(CONFIG_MMU) && bprm->p < bprm->argmin)
636 unsigned int bytes_to_copy = min_t(unsigned int, len,
637 min_not_zero(offset_in_page(pos), PAGE_SIZE));
640 pos -= bytes_to_copy;
641 arg -= bytes_to_copy;
642 len -= bytes_to_copy;
644 page = get_arg_page(bprm, pos, 1);
647 flush_arg_page(bprm, pos & PAGE_MASK, page);
648 memcpy_to_page(page, offset_in_page(pos), arg, bytes_to_copy);
654 EXPORT_SYMBOL(copy_string_kernel);
656 static int copy_strings_kernel(int argc, const char *const *argv,
657 struct linux_binprm *bprm)
660 int ret = copy_string_kernel(argv[argc], bprm);
663 if (fatal_signal_pending(current))
664 return -ERESTARTNOHAND;
673 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
674 * the binfmt code determines where the new stack should reside, we shift it to
675 * its final location. The process proceeds as follows:
677 * 1) Use shift to calculate the new vma endpoints.
678 * 2) Extend vma to cover both the old and new ranges. This ensures the
679 * arguments passed to subsequent functions are consistent.
680 * 3) Move vma's page tables to the new range.
681 * 4) Free up any cleared pgd range.
682 * 5) Shrink the vma to cover only the new range.
684 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
686 struct mm_struct *mm = vma->vm_mm;
687 unsigned long old_start = vma->vm_start;
688 unsigned long old_end = vma->vm_end;
689 unsigned long length = old_end - old_start;
690 unsigned long new_start = old_start - shift;
691 unsigned long new_end = old_end - shift;
692 VMA_ITERATOR(vmi, mm, new_start);
693 struct vm_area_struct *next;
694 struct mmu_gather tlb;
696 BUG_ON(new_start > new_end);
699 * ensure there are no vmas between where we want to go
702 if (vma != vma_next(&vmi))
705 vma_iter_prev_range(&vmi);
707 * cover the whole range: [new_start, old_end)
709 if (vma_expand(&vmi, vma, new_start, old_end, vma->vm_pgoff, NULL))
713 * move the page tables downwards, on failure we rely on
714 * process cleanup to remove whatever mess we made.
716 if (length != move_page_tables(vma, old_start,
717 vma, new_start, length, false, true))
721 tlb_gather_mmu(&tlb, mm);
722 next = vma_next(&vmi);
723 if (new_end > old_start) {
725 * when the old and new regions overlap clear from new_end.
727 free_pgd_range(&tlb, new_end, old_end, new_end,
728 next ? next->vm_start : USER_PGTABLES_CEILING);
731 * otherwise, clean from old_start; this is done to not touch
732 * the address space in [new_end, old_start) some architectures
733 * have constraints on va-space that make this illegal (IA64) -
734 * for the others its just a little faster.
736 free_pgd_range(&tlb, old_start, old_end, new_end,
737 next ? next->vm_start : USER_PGTABLES_CEILING);
739 tlb_finish_mmu(&tlb);
742 /* Shrink the vma to just the new range */
743 return vma_shrink(&vmi, vma, new_start, new_end, vma->vm_pgoff);
747 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
748 * the stack is optionally relocated, and some extra space is added.
750 int setup_arg_pages(struct linux_binprm *bprm,
751 unsigned long stack_top,
752 int executable_stack)
755 unsigned long stack_shift;
756 struct mm_struct *mm = current->mm;
757 struct vm_area_struct *vma = bprm->vma;
758 struct vm_area_struct *prev = NULL;
759 unsigned long vm_flags;
760 unsigned long stack_base;
761 unsigned long stack_size;
762 unsigned long stack_expand;
763 unsigned long rlim_stack;
764 struct mmu_gather tlb;
765 struct vma_iterator vmi;
767 #ifdef CONFIG_STACK_GROWSUP
768 /* Limit stack size */
769 stack_base = bprm->rlim_stack.rlim_max;
771 stack_base = calc_max_stack_size(stack_base);
773 /* Add space for stack randomization. */
774 stack_base += (STACK_RND_MASK << PAGE_SHIFT);
776 /* Make sure we didn't let the argument array grow too large. */
777 if (vma->vm_end - vma->vm_start > stack_base)
780 stack_base = PAGE_ALIGN(stack_top - stack_base);
782 stack_shift = vma->vm_start - stack_base;
783 mm->arg_start = bprm->p - stack_shift;
784 bprm->p = vma->vm_end - stack_shift;
786 stack_top = arch_align_stack(stack_top);
787 stack_top = PAGE_ALIGN(stack_top);
789 if (unlikely(stack_top < mmap_min_addr) ||
790 unlikely(vma->vm_end - vma->vm_start >= stack_top - mmap_min_addr))
793 stack_shift = vma->vm_end - stack_top;
795 bprm->p -= stack_shift;
796 mm->arg_start = bprm->p;
800 bprm->loader -= stack_shift;
801 bprm->exec -= stack_shift;
803 if (mmap_write_lock_killable(mm))
806 vm_flags = VM_STACK_FLAGS;
809 * Adjust stack execute permissions; explicitly enable for
810 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
811 * (arch default) otherwise.
813 if (unlikely(executable_stack == EXSTACK_ENABLE_X))
815 else if (executable_stack == EXSTACK_DISABLE_X)
816 vm_flags &= ~VM_EXEC;
817 vm_flags |= mm->def_flags;
818 vm_flags |= VM_STACK_INCOMPLETE_SETUP;
820 vma_iter_init(&vmi, mm, vma->vm_start);
822 tlb_gather_mmu(&tlb, mm);
823 ret = mprotect_fixup(&vmi, &tlb, vma, &prev, vma->vm_start, vma->vm_end,
825 tlb_finish_mmu(&tlb);
831 if (unlikely(vm_flags & VM_EXEC)) {
832 pr_warn_once("process '%pD4' started with executable stack\n",
836 /* Move stack pages down in memory. */
838 ret = shift_arg_pages(vma, stack_shift);
843 /* mprotect_fixup is overkill to remove the temporary stack flags */
844 vm_flags_clear(vma, VM_STACK_INCOMPLETE_SETUP);
846 stack_expand = 131072UL; /* randomly 32*4k (or 2*64k) pages */
847 stack_size = vma->vm_end - vma->vm_start;
849 * Align this down to a page boundary as expand_stack
852 rlim_stack = bprm->rlim_stack.rlim_cur & PAGE_MASK;
854 stack_expand = min(rlim_stack, stack_size + stack_expand);
856 #ifdef CONFIG_STACK_GROWSUP
857 stack_base = vma->vm_start + stack_expand;
859 stack_base = vma->vm_end - stack_expand;
861 current->mm->start_stack = bprm->p;
862 ret = expand_stack_locked(vma, stack_base);
867 mmap_write_unlock(mm);
870 EXPORT_SYMBOL(setup_arg_pages);
875 * Transfer the program arguments and environment from the holding pages
876 * onto the stack. The provided stack pointer is adjusted accordingly.
878 int transfer_args_to_stack(struct linux_binprm *bprm,
879 unsigned long *sp_location)
881 unsigned long index, stop, sp;
884 stop = bprm->p >> PAGE_SHIFT;
887 for (index = MAX_ARG_PAGES - 1; index >= stop; index--) {
888 unsigned int offset = index == stop ? bprm->p & ~PAGE_MASK : 0;
889 char *src = kmap_local_page(bprm->page[index]) + offset;
890 sp -= PAGE_SIZE - offset;
891 if (copy_to_user((void *) sp, src, PAGE_SIZE - offset) != 0)
903 EXPORT_SYMBOL(transfer_args_to_stack);
905 #endif /* CONFIG_MMU */
908 * On success, caller must call do_close_execat() on the returned
909 * struct file to close it.
911 static struct file *do_open_execat(int fd, struct filename *name, int flags)
915 struct open_flags open_exec_flags = {
916 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
917 .acc_mode = MAY_EXEC,
918 .intent = LOOKUP_OPEN,
919 .lookup_flags = LOOKUP_FOLLOW,
922 if ((flags & ~(AT_SYMLINK_NOFOLLOW | AT_EMPTY_PATH)) != 0)
923 return ERR_PTR(-EINVAL);
924 if (flags & AT_SYMLINK_NOFOLLOW)
925 open_exec_flags.lookup_flags &= ~LOOKUP_FOLLOW;
926 if (flags & AT_EMPTY_PATH)
927 open_exec_flags.lookup_flags |= LOOKUP_EMPTY;
929 file = do_filp_open(fd, name, &open_exec_flags);
934 * may_open() has already checked for this, so it should be
935 * impossible to trip now. But we need to be extra cautious
936 * and check again at the very end too.
939 if (WARN_ON_ONCE(!S_ISREG(file_inode(file)->i_mode) ||
940 path_noexec(&file->f_path)))
943 err = deny_write_access(file);
956 * open_exec - Open a path name for execution
958 * @name: path name to open with the intent of executing it.
960 * Returns ERR_PTR on failure or allocated struct file on success.
962 * As this is a wrapper for the internal do_open_execat(), callers
963 * must call allow_write_access() before fput() on release. Also see
966 struct file *open_exec(const char *name)
968 struct filename *filename = getname_kernel(name);
969 struct file *f = ERR_CAST(filename);
971 if (!IS_ERR(filename)) {
972 f = do_open_execat(AT_FDCWD, filename, 0);
977 EXPORT_SYMBOL(open_exec);
979 #if defined(CONFIG_BINFMT_FLAT) || defined(CONFIG_BINFMT_ELF_FDPIC)
980 ssize_t read_code(struct file *file, unsigned long addr, loff_t pos, size_t len)
982 ssize_t res = vfs_read(file, (void __user *)addr, len, &pos);
984 flush_icache_user_range(addr, addr + len);
987 EXPORT_SYMBOL(read_code);
991 * Maps the mm_struct mm into the current task struct.
992 * On success, this function returns with exec_update_lock
995 static int exec_mmap(struct mm_struct *mm)
997 struct task_struct *tsk;
998 struct mm_struct *old_mm, *active_mm;
1001 /* Notify parent that we're no longer interested in the old VM */
1003 old_mm = current->mm;
1004 exec_mm_release(tsk, old_mm);
1006 ret = down_write_killable(&tsk->signal->exec_update_lock);
1012 * If there is a pending fatal signal perhaps a signal
1013 * whose default action is to create a coredump get
1014 * out and die instead of going through with the exec.
1016 ret = mmap_read_lock_killable(old_mm);
1018 up_write(&tsk->signal->exec_update_lock);
1024 membarrier_exec_mmap(mm);
1026 local_irq_disable();
1027 active_mm = tsk->active_mm;
1028 tsk->active_mm = mm;
1032 * This prevents preemption while active_mm is being loaded and
1033 * it and mm are being updated, which could cause problems for
1034 * lazy tlb mm refcounting when these are updated by context
1035 * switches. Not all architectures can handle irqs off over
1038 if (!IS_ENABLED(CONFIG_ARCH_WANT_IRQS_OFF_ACTIVATE_MM))
1040 activate_mm(active_mm, mm);
1041 if (IS_ENABLED(CONFIG_ARCH_WANT_IRQS_OFF_ACTIVATE_MM))
1047 mmap_read_unlock(old_mm);
1048 BUG_ON(active_mm != old_mm);
1049 setmax_mm_hiwater_rss(&tsk->signal->maxrss, old_mm);
1050 mm_update_next_owner(old_mm);
1054 mmdrop_lazy_tlb(active_mm);
1058 static int de_thread(struct task_struct *tsk)
1060 struct signal_struct *sig = tsk->signal;
1061 struct sighand_struct *oldsighand = tsk->sighand;
1062 spinlock_t *lock = &oldsighand->siglock;
1064 if (thread_group_empty(tsk))
1065 goto no_thread_group;
1068 * Kill all other threads in the thread group.
1070 spin_lock_irq(lock);
1071 if ((sig->flags & SIGNAL_GROUP_EXIT) || sig->group_exec_task) {
1073 * Another group action in progress, just
1074 * return so that the signal is processed.
1076 spin_unlock_irq(lock);
1080 sig->group_exec_task = tsk;
1081 sig->notify_count = zap_other_threads(tsk);
1082 if (!thread_group_leader(tsk))
1083 sig->notify_count--;
1085 while (sig->notify_count) {
1086 __set_current_state(TASK_KILLABLE);
1087 spin_unlock_irq(lock);
1089 if (__fatal_signal_pending(tsk))
1091 spin_lock_irq(lock);
1093 spin_unlock_irq(lock);
1096 * At this point all other threads have exited, all we have to
1097 * do is to wait for the thread group leader to become inactive,
1098 * and to assume its PID:
1100 if (!thread_group_leader(tsk)) {
1101 struct task_struct *leader = tsk->group_leader;
1104 cgroup_threadgroup_change_begin(tsk);
1105 write_lock_irq(&tasklist_lock);
1107 * Do this under tasklist_lock to ensure that
1108 * exit_notify() can't miss ->group_exec_task
1110 sig->notify_count = -1;
1111 if (likely(leader->exit_state))
1113 __set_current_state(TASK_KILLABLE);
1114 write_unlock_irq(&tasklist_lock);
1115 cgroup_threadgroup_change_end(tsk);
1117 if (__fatal_signal_pending(tsk))
1122 * The only record we have of the real-time age of a
1123 * process, regardless of execs it's done, is start_time.
1124 * All the past CPU time is accumulated in signal_struct
1125 * from sister threads now dead. But in this non-leader
1126 * exec, nothing survives from the original leader thread,
1127 * whose birth marks the true age of this process now.
1128 * When we take on its identity by switching to its PID, we
1129 * also take its birthdate (always earlier than our own).
1131 tsk->start_time = leader->start_time;
1132 tsk->start_boottime = leader->start_boottime;
1134 BUG_ON(!same_thread_group(leader, tsk));
1136 * An exec() starts a new thread group with the
1137 * TGID of the previous thread group. Rehash the
1138 * two threads with a switched PID, and release
1139 * the former thread group leader:
1142 /* Become a process group leader with the old leader's pid.
1143 * The old leader becomes a thread of the this thread group.
1145 exchange_tids(tsk, leader);
1146 transfer_pid(leader, tsk, PIDTYPE_TGID);
1147 transfer_pid(leader, tsk, PIDTYPE_PGID);
1148 transfer_pid(leader, tsk, PIDTYPE_SID);
1150 list_replace_rcu(&leader->tasks, &tsk->tasks);
1151 list_replace_init(&leader->sibling, &tsk->sibling);
1153 tsk->group_leader = tsk;
1154 leader->group_leader = tsk;
1156 tsk->exit_signal = SIGCHLD;
1157 leader->exit_signal = -1;
1159 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
1160 leader->exit_state = EXIT_DEAD;
1163 * We are going to release_task()->ptrace_unlink() silently,
1164 * the tracer can sleep in do_wait(). EXIT_DEAD guarantees
1165 * the tracer won't block again waiting for this thread.
1167 if (unlikely(leader->ptrace))
1168 __wake_up_parent(leader, leader->parent);
1169 write_unlock_irq(&tasklist_lock);
1170 cgroup_threadgroup_change_end(tsk);
1172 release_task(leader);
1175 sig->group_exec_task = NULL;
1176 sig->notify_count = 0;
1179 /* we have changed execution domain */
1180 tsk->exit_signal = SIGCHLD;
1182 BUG_ON(!thread_group_leader(tsk));
1186 /* protects against exit_notify() and __exit_signal() */
1187 read_lock(&tasklist_lock);
1188 sig->group_exec_task = NULL;
1189 sig->notify_count = 0;
1190 read_unlock(&tasklist_lock);
1196 * This function makes sure the current process has its own signal table,
1197 * so that flush_signal_handlers can later reset the handlers without
1198 * disturbing other processes. (Other processes might share the signal
1199 * table via the CLONE_SIGHAND option to clone().)
1201 static int unshare_sighand(struct task_struct *me)
1203 struct sighand_struct *oldsighand = me->sighand;
1205 if (refcount_read(&oldsighand->count) != 1) {
1206 struct sighand_struct *newsighand;
1208 * This ->sighand is shared with the CLONE_SIGHAND
1209 * but not CLONE_THREAD task, switch to the new one.
1211 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
1215 refcount_set(&newsighand->count, 1);
1217 write_lock_irq(&tasklist_lock);
1218 spin_lock(&oldsighand->siglock);
1219 memcpy(newsighand->action, oldsighand->action,
1220 sizeof(newsighand->action));
1221 rcu_assign_pointer(me->sighand, newsighand);
1222 spin_unlock(&oldsighand->siglock);
1223 write_unlock_irq(&tasklist_lock);
1225 __cleanup_sighand(oldsighand);
1230 char *__get_task_comm(char *buf, size_t buf_size, struct task_struct *tsk)
1233 /* Always NUL terminated and zero-padded */
1234 strscpy_pad(buf, tsk->comm, buf_size);
1238 EXPORT_SYMBOL_GPL(__get_task_comm);
1241 * These functions flushes out all traces of the currently running executable
1242 * so that a new one can be started
1245 void __set_task_comm(struct task_struct *tsk, const char *buf, bool exec)
1248 trace_task_rename(tsk, buf);
1249 strscpy_pad(tsk->comm, buf, sizeof(tsk->comm));
1251 perf_event_comm(tsk, exec);
1255 * Calling this is the point of no return. None of the failures will be
1256 * seen by userspace since either the process is already taking a fatal
1257 * signal (via de_thread() or coredump), or will have SEGV raised
1258 * (after exec_mmap()) by search_binary_handler (see below).
1260 int begin_new_exec(struct linux_binprm * bprm)
1262 struct task_struct *me = current;
1265 /* Once we are committed compute the creds */
1266 retval = bprm_creds_from_file(bprm);
1271 * Ensure all future errors are fatal.
1273 bprm->point_of_no_return = true;
1276 * Make this the only thread in the thread group.
1278 retval = de_thread(me);
1283 * Cancel any io_uring activity across execve
1285 io_uring_task_cancel();
1287 /* Ensure the files table is not shared. */
1288 retval = unshare_files();
1293 * Must be called _before_ exec_mmap() as bprm->mm is
1294 * not visible until then. Doing it here also ensures
1295 * we don't race against replace_mm_exe_file().
1297 retval = set_mm_exe_file(bprm->mm, bprm->file);
1301 /* If the binary is not readable then enforce mm->dumpable=0 */
1302 would_dump(bprm, bprm->file);
1303 if (bprm->have_execfd)
1304 would_dump(bprm, bprm->executable);
1307 * Release all of the old mmap stuff
1309 acct_arg_size(bprm, 0);
1310 retval = exec_mmap(bprm->mm);
1316 retval = exec_task_namespaces();
1320 #ifdef CONFIG_POSIX_TIMERS
1321 spin_lock_irq(&me->sighand->siglock);
1322 posix_cpu_timers_exit(me);
1323 spin_unlock_irq(&me->sighand->siglock);
1325 flush_itimer_signals();
1329 * Make the signal table private.
1331 retval = unshare_sighand(me);
1335 me->flags &= ~(PF_RANDOMIZE | PF_FORKNOEXEC |
1336 PF_NOFREEZE | PF_NO_SETAFFINITY);
1338 me->personality &= ~bprm->per_clear;
1340 clear_syscall_work_syscall_user_dispatch(me);
1343 * We have to apply CLOEXEC before we change whether the process is
1344 * dumpable (in setup_new_exec) to avoid a race with a process in userspace
1345 * trying to access the should-be-closed file descriptors of a process
1346 * undergoing exec(2).
1348 do_close_on_exec(me->files);
1350 if (bprm->secureexec) {
1351 /* Make sure parent cannot signal privileged process. */
1352 me->pdeath_signal = 0;
1355 * For secureexec, reset the stack limit to sane default to
1356 * avoid bad behavior from the prior rlimits. This has to
1357 * happen before arch_pick_mmap_layout(), which examines
1358 * RLIMIT_STACK, but after the point of no return to avoid
1359 * needing to clean up the change on failure.
1361 if (bprm->rlim_stack.rlim_cur > _STK_LIM)
1362 bprm->rlim_stack.rlim_cur = _STK_LIM;
1365 me->sas_ss_sp = me->sas_ss_size = 0;
1368 * Figure out dumpability. Note that this checking only of current
1369 * is wrong, but userspace depends on it. This should be testing
1370 * bprm->secureexec instead.
1372 if (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP ||
1373 !(uid_eq(current_euid(), current_uid()) &&
1374 gid_eq(current_egid(), current_gid())))
1375 set_dumpable(current->mm, suid_dumpable);
1377 set_dumpable(current->mm, SUID_DUMP_USER);
1380 __set_task_comm(me, kbasename(bprm->filename), true);
1382 /* An exec changes our domain. We are no longer part of the thread
1384 WRITE_ONCE(me->self_exec_id, me->self_exec_id + 1);
1385 flush_signal_handlers(me, 0);
1387 retval = set_cred_ucounts(bprm->cred);
1392 * install the new credentials for this executable
1394 security_bprm_committing_creds(bprm);
1396 commit_creds(bprm->cred);
1400 * Disable monitoring for regular users
1401 * when executing setuid binaries. Must
1402 * wait until new credentials are committed
1403 * by commit_creds() above
1405 if (get_dumpable(me->mm) != SUID_DUMP_USER)
1406 perf_event_exit_task(me);
1408 * cred_guard_mutex must be held at least to this point to prevent
1409 * ptrace_attach() from altering our determination of the task's
1410 * credentials; any time after this it may be unlocked.
1412 security_bprm_committed_creds(bprm);
1414 /* Pass the opened binary to the interpreter. */
1415 if (bprm->have_execfd) {
1416 retval = get_unused_fd_flags(0);
1419 fd_install(retval, bprm->executable);
1420 bprm->executable = NULL;
1421 bprm->execfd = retval;
1426 up_write(&me->signal->exec_update_lock);
1428 mutex_unlock(&me->signal->cred_guard_mutex);
1433 EXPORT_SYMBOL(begin_new_exec);
1435 void would_dump(struct linux_binprm *bprm, struct file *file)
1437 struct inode *inode = file_inode(file);
1438 struct mnt_idmap *idmap = file_mnt_idmap(file);
1439 if (inode_permission(idmap, inode, MAY_READ) < 0) {
1440 struct user_namespace *old, *user_ns;
1441 bprm->interp_flags |= BINPRM_FLAGS_ENFORCE_NONDUMP;
1443 /* Ensure mm->user_ns contains the executable */
1444 user_ns = old = bprm->mm->user_ns;
1445 while ((user_ns != &init_user_ns) &&
1446 !privileged_wrt_inode_uidgid(user_ns, idmap, inode))
1447 user_ns = user_ns->parent;
1449 if (old != user_ns) {
1450 bprm->mm->user_ns = get_user_ns(user_ns);
1455 EXPORT_SYMBOL(would_dump);
1457 void setup_new_exec(struct linux_binprm * bprm)
1459 /* Setup things that can depend upon the personality */
1460 struct task_struct *me = current;
1462 arch_pick_mmap_layout(me->mm, &bprm->rlim_stack);
1464 arch_setup_new_exec();
1466 /* Set the new mm task size. We have to do that late because it may
1467 * depend on TIF_32BIT which is only updated in flush_thread() on
1468 * some architectures like powerpc
1470 me->mm->task_size = TASK_SIZE;
1471 up_write(&me->signal->exec_update_lock);
1472 mutex_unlock(&me->signal->cred_guard_mutex);
1474 EXPORT_SYMBOL(setup_new_exec);
1476 /* Runs immediately before start_thread() takes over. */
1477 void finalize_exec(struct linux_binprm *bprm)
1479 /* Store any stack rlimit changes before starting thread. */
1480 task_lock(current->group_leader);
1481 current->signal->rlim[RLIMIT_STACK] = bprm->rlim_stack;
1482 task_unlock(current->group_leader);
1484 EXPORT_SYMBOL(finalize_exec);
1487 * Prepare credentials and lock ->cred_guard_mutex.
1488 * setup_new_exec() commits the new creds and drops the lock.
1489 * Or, if exec fails before, free_bprm() should release ->cred
1492 static int prepare_bprm_creds(struct linux_binprm *bprm)
1494 if (mutex_lock_interruptible(¤t->signal->cred_guard_mutex))
1495 return -ERESTARTNOINTR;
1497 bprm->cred = prepare_exec_creds();
1498 if (likely(bprm->cred))
1501 mutex_unlock(¤t->signal->cred_guard_mutex);
1505 /* Matches do_open_execat() */
1506 static void do_close_execat(struct file *file)
1510 allow_write_access(file);
1514 static void free_bprm(struct linux_binprm *bprm)
1517 acct_arg_size(bprm, 0);
1520 free_arg_pages(bprm);
1522 mutex_unlock(¤t->signal->cred_guard_mutex);
1523 abort_creds(bprm->cred);
1525 do_close_execat(bprm->file);
1526 if (bprm->executable)
1527 fput(bprm->executable);
1528 /* If a binfmt changed the interp, free it. */
1529 if (bprm->interp != bprm->filename)
1530 kfree(bprm->interp);
1531 kfree(bprm->fdpath);
1535 static struct linux_binprm *alloc_bprm(int fd, struct filename *filename, int flags)
1537 struct linux_binprm *bprm;
1539 int retval = -ENOMEM;
1541 file = do_open_execat(fd, filename, flags);
1543 return ERR_CAST(file);
1545 bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1547 do_close_execat(file);
1548 return ERR_PTR(-ENOMEM);
1553 if (fd == AT_FDCWD || filename->name[0] == '/') {
1554 bprm->filename = filename->name;
1556 if (filename->name[0] == '\0')
1557 bprm->fdpath = kasprintf(GFP_KERNEL, "/dev/fd/%d", fd);
1559 bprm->fdpath = kasprintf(GFP_KERNEL, "/dev/fd/%d/%s",
1560 fd, filename->name);
1565 * Record that a name derived from an O_CLOEXEC fd will be
1566 * inaccessible after exec. This allows the code in exec to
1567 * choose to fail when the executable is not mmaped into the
1568 * interpreter and an open file descriptor is not passed to
1569 * the interpreter. This makes for a better user experience
1570 * than having the interpreter start and then immediately fail
1571 * when it finds the executable is inaccessible.
1573 if (get_close_on_exec(fd))
1574 bprm->interp_flags |= BINPRM_FLAGS_PATH_INACCESSIBLE;
1576 bprm->filename = bprm->fdpath;
1578 bprm->interp = bprm->filename;
1580 retval = bprm_mm_init(bprm);
1586 return ERR_PTR(retval);
1589 int bprm_change_interp(const char *interp, struct linux_binprm *bprm)
1591 /* If a binfmt changed the interp, free it first. */
1592 if (bprm->interp != bprm->filename)
1593 kfree(bprm->interp);
1594 bprm->interp = kstrdup(interp, GFP_KERNEL);
1599 EXPORT_SYMBOL(bprm_change_interp);
1602 * determine how safe it is to execute the proposed program
1603 * - the caller must hold ->cred_guard_mutex to protect against
1604 * PTRACE_ATTACH or seccomp thread-sync
1606 static void check_unsafe_exec(struct linux_binprm *bprm)
1608 struct task_struct *p = current, *t;
1612 bprm->unsafe |= LSM_UNSAFE_PTRACE;
1615 * This isn't strictly necessary, but it makes it harder for LSMs to
1618 if (task_no_new_privs(current))
1619 bprm->unsafe |= LSM_UNSAFE_NO_NEW_PRIVS;
1622 * If another task is sharing our fs, we cannot safely
1623 * suid exec because the differently privileged task
1624 * will be able to manipulate the current directory, etc.
1625 * It would be nice to force an unshare instead...
1628 spin_lock(&p->fs->lock);
1630 for_other_threads(p, t) {
1636 /* "users" and "in_exec" locked for copy_fs() */
1637 if (p->fs->users > n_fs)
1638 bprm->unsafe |= LSM_UNSAFE_SHARE;
1641 spin_unlock(&p->fs->lock);
1644 static void bprm_fill_uid(struct linux_binprm *bprm, struct file *file)
1646 /* Handle suid and sgid on files */
1647 struct mnt_idmap *idmap;
1648 struct inode *inode = file_inode(file);
1653 if (!mnt_may_suid(file->f_path.mnt))
1656 if (task_no_new_privs(current))
1659 mode = READ_ONCE(inode->i_mode);
1660 if (!(mode & (S_ISUID|S_ISGID)))
1663 idmap = file_mnt_idmap(file);
1665 /* Be careful if suid/sgid is set */
1668 /* reload atomically mode/uid/gid now that lock held */
1669 mode = inode->i_mode;
1670 vfsuid = i_uid_into_vfsuid(idmap, inode);
1671 vfsgid = i_gid_into_vfsgid(idmap, inode);
1672 inode_unlock(inode);
1674 /* We ignore suid/sgid if there are no mappings for them in the ns */
1675 if (!vfsuid_has_mapping(bprm->cred->user_ns, vfsuid) ||
1676 !vfsgid_has_mapping(bprm->cred->user_ns, vfsgid))
1679 if (mode & S_ISUID) {
1680 bprm->per_clear |= PER_CLEAR_ON_SETID;
1681 bprm->cred->euid = vfsuid_into_kuid(vfsuid);
1684 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1685 bprm->per_clear |= PER_CLEAR_ON_SETID;
1686 bprm->cred->egid = vfsgid_into_kgid(vfsgid);
1691 * Compute brpm->cred based upon the final binary.
1693 static int bprm_creds_from_file(struct linux_binprm *bprm)
1695 /* Compute creds based on which file? */
1696 struct file *file = bprm->execfd_creds ? bprm->executable : bprm->file;
1698 bprm_fill_uid(bprm, file);
1699 return security_bprm_creds_from_file(bprm, file);
1703 * Fill the binprm structure from the inode.
1704 * Read the first BINPRM_BUF_SIZE bytes
1706 * This may be called multiple times for binary chains (scripts for example).
1708 static int prepare_binprm(struct linux_binprm *bprm)
1712 memset(bprm->buf, 0, BINPRM_BUF_SIZE);
1713 return kernel_read(bprm->file, bprm->buf, BINPRM_BUF_SIZE, &pos);
1717 * Arguments are '\0' separated strings found at the location bprm->p
1718 * points to; chop off the first by relocating brpm->p to right after
1719 * the first '\0' encountered.
1721 int remove_arg_zero(struct linux_binprm *bprm)
1724 unsigned long offset;
1732 offset = bprm->p & ~PAGE_MASK;
1733 page = get_arg_page(bprm, bprm->p, 0);
1738 kaddr = kmap_local_page(page);
1740 for (; offset < PAGE_SIZE && kaddr[offset];
1741 offset++, bprm->p++)
1744 kunmap_local(kaddr);
1746 } while (offset == PAGE_SIZE);
1755 EXPORT_SYMBOL(remove_arg_zero);
1757 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1759 * cycle the list of binary formats handler, until one recognizes the image
1761 static int search_binary_handler(struct linux_binprm *bprm)
1763 bool need_retry = IS_ENABLED(CONFIG_MODULES);
1764 struct linux_binfmt *fmt;
1767 retval = prepare_binprm(bprm);
1771 retval = security_bprm_check(bprm);
1777 read_lock(&binfmt_lock);
1778 list_for_each_entry(fmt, &formats, lh) {
1779 if (!try_module_get(fmt->module))
1781 read_unlock(&binfmt_lock);
1783 retval = fmt->load_binary(bprm);
1785 read_lock(&binfmt_lock);
1787 if (bprm->point_of_no_return || (retval != -ENOEXEC)) {
1788 read_unlock(&binfmt_lock);
1792 read_unlock(&binfmt_lock);
1795 if (printable(bprm->buf[0]) && printable(bprm->buf[1]) &&
1796 printable(bprm->buf[2]) && printable(bprm->buf[3]))
1798 if (request_module("binfmt-%04x", *(ushort *)(bprm->buf + 2)) < 0)
1807 /* binfmt handlers will call back into begin_new_exec() on success. */
1808 static int exec_binprm(struct linux_binprm *bprm)
1810 pid_t old_pid, old_vpid;
1813 /* Need to fetch pid before load_binary changes it */
1814 old_pid = current->pid;
1816 old_vpid = task_pid_nr_ns(current, task_active_pid_ns(current->parent));
1819 /* This allows 4 levels of binfmt rewrites before failing hard. */
1820 for (depth = 0;; depth++) {
1825 ret = search_binary_handler(bprm);
1828 if (!bprm->interpreter)
1832 bprm->file = bprm->interpreter;
1833 bprm->interpreter = NULL;
1835 allow_write_access(exec);
1836 if (unlikely(bprm->have_execfd)) {
1837 if (bprm->executable) {
1841 bprm->executable = exec;
1847 trace_sched_process_exec(current, old_pid, bprm);
1848 ptrace_event(PTRACE_EVENT_EXEC, old_vpid);
1849 proc_exec_connector(current);
1853 static int bprm_execve(struct linux_binprm *bprm)
1857 retval = prepare_bprm_creds(bprm);
1862 * Check for unsafe execution states before exec_binprm(), which
1863 * will call back into begin_new_exec(), into bprm_creds_from_file(),
1864 * where setuid-ness is evaluated.
1866 check_unsafe_exec(bprm);
1867 current->in_execve = 1;
1868 sched_mm_cid_before_execve(current);
1872 /* Set the unchanging part of bprm->cred */
1873 retval = security_bprm_creds_for_exec(bprm);
1877 retval = exec_binprm(bprm);
1881 sched_mm_cid_after_execve(current);
1882 /* execve succeeded */
1883 current->fs->in_exec = 0;
1884 current->in_execve = 0;
1885 rseq_execve(current);
1886 user_events_execve(current);
1887 acct_update_integrals(current);
1888 task_numa_free(current, false);
1893 * If past the point of no return ensure the code never
1894 * returns to the userspace process. Use an existing fatal
1895 * signal if present otherwise terminate the process with
1898 if (bprm->point_of_no_return && !fatal_signal_pending(current))
1899 force_fatal_sig(SIGSEGV);
1901 sched_mm_cid_after_execve(current);
1902 current->fs->in_exec = 0;
1903 current->in_execve = 0;
1908 static int do_execveat_common(int fd, struct filename *filename,
1909 struct user_arg_ptr argv,
1910 struct user_arg_ptr envp,
1913 struct linux_binprm *bprm;
1916 if (IS_ERR(filename))
1917 return PTR_ERR(filename);
1920 * We move the actual failure in case of RLIMIT_NPROC excess from
1921 * set*uid() to execve() because too many poorly written programs
1922 * don't check setuid() return code. Here we additionally recheck
1923 * whether NPROC limit is still exceeded.
1925 if ((current->flags & PF_NPROC_EXCEEDED) &&
1926 is_rlimit_overlimit(current_ucounts(), UCOUNT_RLIMIT_NPROC, rlimit(RLIMIT_NPROC))) {
1931 /* We're below the limit (still or again), so we don't want to make
1932 * further execve() calls fail. */
1933 current->flags &= ~PF_NPROC_EXCEEDED;
1935 bprm = alloc_bprm(fd, filename, flags);
1937 retval = PTR_ERR(bprm);
1941 retval = count(argv, MAX_ARG_STRINGS);
1943 pr_warn_once("process '%s' launched '%s' with NULL argv: empty string added\n",
1944 current->comm, bprm->filename);
1947 bprm->argc = retval;
1949 retval = count(envp, MAX_ARG_STRINGS);
1952 bprm->envc = retval;
1954 retval = bprm_stack_limits(bprm);
1958 retval = copy_string_kernel(bprm->filename, bprm);
1961 bprm->exec = bprm->p;
1963 retval = copy_strings(bprm->envc, envp, bprm);
1967 retval = copy_strings(bprm->argc, argv, bprm);
1972 * When argv is empty, add an empty string ("") as argv[0] to
1973 * ensure confused userspace programs that start processing
1974 * from argv[1] won't end up walking envp. See also
1975 * bprm_stack_limits().
1977 if (bprm->argc == 0) {
1978 retval = copy_string_kernel("", bprm);
1984 retval = bprm_execve(bprm);
1993 int kernel_execve(const char *kernel_filename,
1994 const char *const *argv, const char *const *envp)
1996 struct filename *filename;
1997 struct linux_binprm *bprm;
2001 /* It is non-sense for kernel threads to call execve */
2002 if (WARN_ON_ONCE(current->flags & PF_KTHREAD))
2005 filename = getname_kernel(kernel_filename);
2006 if (IS_ERR(filename))
2007 return PTR_ERR(filename);
2009 bprm = alloc_bprm(fd, filename, 0);
2011 retval = PTR_ERR(bprm);
2015 retval = count_strings_kernel(argv);
2016 if (WARN_ON_ONCE(retval == 0))
2020 bprm->argc = retval;
2022 retval = count_strings_kernel(envp);
2025 bprm->envc = retval;
2027 retval = bprm_stack_limits(bprm);
2031 retval = copy_string_kernel(bprm->filename, bprm);
2034 bprm->exec = bprm->p;
2036 retval = copy_strings_kernel(bprm->envc, envp, bprm);
2040 retval = copy_strings_kernel(bprm->argc, argv, bprm);
2044 retval = bprm_execve(bprm);
2052 static int do_execve(struct filename *filename,
2053 const char __user *const __user *__argv,
2054 const char __user *const __user *__envp)
2056 struct user_arg_ptr argv = { .ptr.native = __argv };
2057 struct user_arg_ptr envp = { .ptr.native = __envp };
2058 return do_execveat_common(AT_FDCWD, filename, argv, envp, 0);
2061 static int do_execveat(int fd, struct filename *filename,
2062 const char __user *const __user *__argv,
2063 const char __user *const __user *__envp,
2066 struct user_arg_ptr argv = { .ptr.native = __argv };
2067 struct user_arg_ptr envp = { .ptr.native = __envp };
2069 return do_execveat_common(fd, filename, argv, envp, flags);
2072 #ifdef CONFIG_COMPAT
2073 static int compat_do_execve(struct filename *filename,
2074 const compat_uptr_t __user *__argv,
2075 const compat_uptr_t __user *__envp)
2077 struct user_arg_ptr argv = {
2079 .ptr.compat = __argv,
2081 struct user_arg_ptr envp = {
2083 .ptr.compat = __envp,
2085 return do_execveat_common(AT_FDCWD, filename, argv, envp, 0);
2088 static int compat_do_execveat(int fd, struct filename *filename,
2089 const compat_uptr_t __user *__argv,
2090 const compat_uptr_t __user *__envp,
2093 struct user_arg_ptr argv = {
2095 .ptr.compat = __argv,
2097 struct user_arg_ptr envp = {
2099 .ptr.compat = __envp,
2101 return do_execveat_common(fd, filename, argv, envp, flags);
2105 void set_binfmt(struct linux_binfmt *new)
2107 struct mm_struct *mm = current->mm;
2110 module_put(mm->binfmt->module);
2114 __module_get(new->module);
2116 EXPORT_SYMBOL(set_binfmt);
2119 * set_dumpable stores three-value SUID_DUMP_* into mm->flags.
2121 void set_dumpable(struct mm_struct *mm, int value)
2123 if (WARN_ON((unsigned)value > SUID_DUMP_ROOT))
2126 set_mask_bits(&mm->flags, MMF_DUMPABLE_MASK, value);
2129 SYSCALL_DEFINE3(execve,
2130 const char __user *, filename,
2131 const char __user *const __user *, argv,
2132 const char __user *const __user *, envp)
2134 return do_execve(getname(filename), argv, envp);
2137 SYSCALL_DEFINE5(execveat,
2138 int, fd, const char __user *, filename,
2139 const char __user *const __user *, argv,
2140 const char __user *const __user *, envp,
2143 return do_execveat(fd,
2144 getname_uflags(filename, flags),
2148 #ifdef CONFIG_COMPAT
2149 COMPAT_SYSCALL_DEFINE3(execve, const char __user *, filename,
2150 const compat_uptr_t __user *, argv,
2151 const compat_uptr_t __user *, envp)
2153 return compat_do_execve(getname(filename), argv, envp);
2156 COMPAT_SYSCALL_DEFINE5(execveat, int, fd,
2157 const char __user *, filename,
2158 const compat_uptr_t __user *, argv,
2159 const compat_uptr_t __user *, envp,
2162 return compat_do_execveat(fd,
2163 getname_uflags(filename, flags),
2168 #ifdef CONFIG_SYSCTL
2170 static int proc_dointvec_minmax_coredump(struct ctl_table *table, int write,
2171 void *buffer, size_t *lenp, loff_t *ppos)
2173 int error = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
2176 validate_coredump_safety();
2180 static struct ctl_table fs_exec_sysctls[] = {
2182 .procname = "suid_dumpable",
2183 .data = &suid_dumpable,
2184 .maxlen = sizeof(int),
2186 .proc_handler = proc_dointvec_minmax_coredump,
2187 .extra1 = SYSCTL_ZERO,
2188 .extra2 = SYSCTL_TWO,
2192 static int __init init_fs_exec_sysctls(void)
2194 register_sysctl_init("fs", fs_exec_sysctls);
2198 fs_initcall(init_fs_exec_sysctls);
2199 #endif /* CONFIG_SYSCTL */