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/vmacache.h>
32 #include <linux/stat.h>
33 #include <linux/fcntl.h>
34 #include <linux/swap.h>
35 #include <linux/string.h>
36 #include <linux/init.h>
37 #include <linux/sched/mm.h>
38 #include <linux/sched/coredump.h>
39 #include <linux/sched/signal.h>
40 #include <linux/sched/numa_balancing.h>
41 #include <linux/sched/task.h>
42 #include <linux/pagemap.h>
43 #include <linux/perf_event.h>
44 #include <linux/highmem.h>
45 #include <linux/spinlock.h>
46 #include <linux/key.h>
47 #include <linux/personality.h>
48 #include <linux/binfmts.h>
49 #include <linux/utsname.h>
50 #include <linux/pid_namespace.h>
51 #include <linux/module.h>
52 #include <linux/namei.h>
53 #include <linux/mount.h>
54 #include <linux/security.h>
55 #include <linux/syscalls.h>
56 #include <linux/tsacct_kern.h>
57 #include <linux/cn_proc.h>
58 #include <linux/audit.h>
59 #include <linux/tracehook.h>
60 #include <linux/kmod.h>
61 #include <linux/fsnotify.h>
62 #include <linux/fs_struct.h>
63 #include <linux/oom.h>
64 #include <linux/compat.h>
65 #include <linux/vmalloc.h>
66 #include <linux/io_uring.h>
67 #include <linux/syscall_user_dispatch.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
);
114 EXPORT_SYMBOL_GPL(path_noexec
);
118 * Note that a shared library must be both readable and executable due to
121 * Also note that we take the address to load from from the file itself.
123 SYSCALL_DEFINE1(uselib
, const char __user
*, library
)
125 struct linux_binfmt
*fmt
;
127 struct filename
*tmp
= getname(library
);
128 int error
= PTR_ERR(tmp
);
129 static const struct open_flags uselib_flags
= {
130 .open_flag
= O_LARGEFILE
| O_RDONLY
| __FMODE_EXEC
,
131 .acc_mode
= MAY_READ
| MAY_EXEC
,
132 .intent
= LOOKUP_OPEN
,
133 .lookup_flags
= LOOKUP_FOLLOW
,
139 file
= do_filp_open(AT_FDCWD
, tmp
, &uselib_flags
);
141 error
= PTR_ERR(file
);
146 * may_open() has already checked for this, so it should be
147 * impossible to trip now. But we need to be extra cautious
148 * and check again at the very end too.
151 if (WARN_ON_ONCE(!S_ISREG(file_inode(file
)->i_mode
) ||
152 path_noexec(&file
->f_path
)))
159 read_lock(&binfmt_lock
);
160 list_for_each_entry(fmt
, &formats
, lh
) {
161 if (!fmt
->load_shlib
)
163 if (!try_module_get(fmt
->module
))
165 read_unlock(&binfmt_lock
);
166 error
= fmt
->load_shlib(file
);
167 read_lock(&binfmt_lock
);
169 if (error
!= -ENOEXEC
)
172 read_unlock(&binfmt_lock
);
178 #endif /* #ifdef CONFIG_USELIB */
182 * The nascent bprm->mm is not visible until exec_mmap() but it can
183 * use a lot of memory, account these pages in current->mm temporary
184 * for oom_badness()->get_mm_rss(). Once exec succeeds or fails, we
185 * change the counter back via acct_arg_size(0).
187 static void acct_arg_size(struct linux_binprm
*bprm
, unsigned long pages
)
189 struct mm_struct
*mm
= current
->mm
;
190 long diff
= (long)(pages
- bprm
->vma_pages
);
195 bprm
->vma_pages
= pages
;
196 add_mm_counter(mm
, MM_ANONPAGES
, diff
);
199 static struct page
*get_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
204 unsigned int gup_flags
= FOLL_FORCE
;
206 #ifdef CONFIG_STACK_GROWSUP
208 ret
= expand_downwards(bprm
->vma
, pos
);
215 gup_flags
|= FOLL_WRITE
;
218 * We are doing an exec(). 'current' is the process
219 * doing the exec and bprm->mm is the new process's mm.
221 mmap_read_lock(bprm
->mm
);
222 ret
= get_user_pages_remote(bprm
->mm
, pos
, 1, gup_flags
,
224 mmap_read_unlock(bprm
->mm
);
229 acct_arg_size(bprm
, vma_pages(bprm
->vma
));
234 static void put_arg_page(struct page
*page
)
239 static void free_arg_pages(struct linux_binprm
*bprm
)
243 static void flush_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
246 flush_cache_page(bprm
->vma
, pos
, page_to_pfn(page
));
249 static int __bprm_mm_init(struct linux_binprm
*bprm
)
252 struct vm_area_struct
*vma
= NULL
;
253 struct mm_struct
*mm
= bprm
->mm
;
255 bprm
->vma
= vma
= vm_area_alloc(mm
);
258 vma_set_anonymous(vma
);
260 if (mmap_write_lock_killable(mm
)) {
266 * Place the stack at the largest stack address the architecture
267 * supports. Later, we'll move this to an appropriate place. We don't
268 * use STACK_TOP because that can depend on attributes which aren't
271 BUILD_BUG_ON(VM_STACK_FLAGS
& VM_STACK_INCOMPLETE_SETUP
);
272 vma
->vm_end
= STACK_TOP_MAX
;
273 vma
->vm_start
= vma
->vm_end
- PAGE_SIZE
;
274 vma
->vm_flags
= VM_SOFTDIRTY
| VM_STACK_FLAGS
| VM_STACK_INCOMPLETE_SETUP
;
275 vma
->vm_page_prot
= vm_get_page_prot(vma
->vm_flags
);
277 err
= insert_vm_struct(mm
, vma
);
281 mm
->stack_vm
= mm
->total_vm
= 1;
282 mmap_write_unlock(mm
);
283 bprm
->p
= vma
->vm_end
- sizeof(void *);
286 mmap_write_unlock(mm
);
293 static bool valid_arg_len(struct linux_binprm
*bprm
, long len
)
295 return len
<= MAX_ARG_STRLEN
;
300 static inline void acct_arg_size(struct linux_binprm
*bprm
, unsigned long pages
)
304 static struct page
*get_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
309 page
= bprm
->page
[pos
/ PAGE_SIZE
];
310 if (!page
&& write
) {
311 page
= alloc_page(GFP_HIGHUSER
|__GFP_ZERO
);
314 bprm
->page
[pos
/ PAGE_SIZE
] = page
;
320 static void put_arg_page(struct page
*page
)
324 static void free_arg_page(struct linux_binprm
*bprm
, int i
)
327 __free_page(bprm
->page
[i
]);
328 bprm
->page
[i
] = NULL
;
332 static void free_arg_pages(struct linux_binprm
*bprm
)
336 for (i
= 0; i
< MAX_ARG_PAGES
; i
++)
337 free_arg_page(bprm
, i
);
340 static void flush_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
345 static int __bprm_mm_init(struct linux_binprm
*bprm
)
347 bprm
->p
= PAGE_SIZE
* MAX_ARG_PAGES
- sizeof(void *);
351 static bool valid_arg_len(struct linux_binprm
*bprm
, long len
)
353 return len
<= bprm
->p
;
356 #endif /* CONFIG_MMU */
359 * Create a new mm_struct and populate it with a temporary stack
360 * vm_area_struct. We don't have enough context at this point to set the stack
361 * flags, permissions, and offset, so we use temporary values. We'll update
362 * them later in setup_arg_pages().
364 static int bprm_mm_init(struct linux_binprm
*bprm
)
367 struct mm_struct
*mm
= NULL
;
369 bprm
->mm
= mm
= mm_alloc();
374 /* Save current stack limit for all calculations made during exec. */
375 task_lock(current
->group_leader
);
376 bprm
->rlim_stack
= current
->signal
->rlim
[RLIMIT_STACK
];
377 task_unlock(current
->group_leader
);
379 err
= __bprm_mm_init(bprm
);
394 struct user_arg_ptr
{
399 const char __user
*const __user
*native
;
401 const compat_uptr_t __user
*compat
;
406 static const char __user
*get_user_arg_ptr(struct user_arg_ptr argv
, int nr
)
408 const char __user
*native
;
411 if (unlikely(argv
.is_compat
)) {
412 compat_uptr_t compat
;
414 if (get_user(compat
, argv
.ptr
.compat
+ nr
))
415 return ERR_PTR(-EFAULT
);
417 return compat_ptr(compat
);
421 if (get_user(native
, argv
.ptr
.native
+ nr
))
422 return ERR_PTR(-EFAULT
);
428 * count() counts the number of strings in array ARGV.
430 static int count(struct user_arg_ptr argv
, int max
)
434 if (argv
.ptr
.native
!= NULL
) {
436 const char __user
*p
= get_user_arg_ptr(argv
, i
);
448 if (fatal_signal_pending(current
))
449 return -ERESTARTNOHAND
;
456 static int count_strings_kernel(const char *const *argv
)
463 for (i
= 0; argv
[i
]; ++i
) {
464 if (i
>= MAX_ARG_STRINGS
)
466 if (fatal_signal_pending(current
))
467 return -ERESTARTNOHAND
;
473 static int bprm_stack_limits(struct linux_binprm
*bprm
)
475 unsigned long limit
, ptr_size
;
478 * Limit to 1/4 of the max stack size or 3/4 of _STK_LIM
479 * (whichever is smaller) for the argv+env strings.
481 * - the remaining binfmt code will not run out of stack space,
482 * - the program will have a reasonable amount of stack left
485 limit
= _STK_LIM
/ 4 * 3;
486 limit
= min(limit
, bprm
->rlim_stack
.rlim_cur
/ 4);
488 * We've historically supported up to 32 pages (ARG_MAX)
489 * of argument strings even with small stacks
491 limit
= max_t(unsigned long, limit
, ARG_MAX
);
493 * We must account for the size of all the argv and envp pointers to
494 * the argv and envp strings, since they will also take up space in
495 * the stack. They aren't stored until much later when we can't
496 * signal to the parent that the child has run out of stack space.
497 * Instead, calculate it here so it's possible to fail gracefully.
499 * In the case of argc = 0, make sure there is space for adding a
500 * empty string (which will bump argc to 1), to ensure confused
501 * userspace programs don't start processing from argv[1], thinking
502 * argc can never be 0, to keep them from walking envp by accident.
503 * See do_execveat_common().
505 ptr_size
= (max(bprm
->argc
, 1) + bprm
->envc
) * sizeof(void *);
506 if (limit
<= ptr_size
)
510 bprm
->argmin
= bprm
->p
- limit
;
515 * 'copy_strings()' copies argument/environment strings from the old
516 * processes's memory to the new process's stack. The call to get_user_pages()
517 * ensures the destination page is created and not swapped out.
519 static int copy_strings(int argc
, struct user_arg_ptr argv
,
520 struct linux_binprm
*bprm
)
522 struct page
*kmapped_page
= NULL
;
524 unsigned long kpos
= 0;
528 const char __user
*str
;
533 str
= get_user_arg_ptr(argv
, argc
);
537 len
= strnlen_user(str
, MAX_ARG_STRLEN
);
542 if (!valid_arg_len(bprm
, len
))
545 /* We're going to work our way backwords. */
550 if (bprm
->p
< bprm
->argmin
)
555 int offset
, bytes_to_copy
;
557 if (fatal_signal_pending(current
)) {
558 ret
= -ERESTARTNOHAND
;
563 offset
= pos
% PAGE_SIZE
;
567 bytes_to_copy
= offset
;
568 if (bytes_to_copy
> len
)
571 offset
-= bytes_to_copy
;
572 pos
-= bytes_to_copy
;
573 str
-= bytes_to_copy
;
574 len
-= bytes_to_copy
;
576 if (!kmapped_page
|| kpos
!= (pos
& PAGE_MASK
)) {
579 page
= get_arg_page(bprm
, pos
, 1);
586 flush_dcache_page(kmapped_page
);
587 kunmap(kmapped_page
);
588 put_arg_page(kmapped_page
);
591 kaddr
= kmap(kmapped_page
);
592 kpos
= pos
& PAGE_MASK
;
593 flush_arg_page(bprm
, kpos
, kmapped_page
);
595 if (copy_from_user(kaddr
+offset
, str
, bytes_to_copy
)) {
604 flush_dcache_page(kmapped_page
);
605 kunmap(kmapped_page
);
606 put_arg_page(kmapped_page
);
612 * Copy and argument/environment string from the kernel to the processes stack.
614 int copy_string_kernel(const char *arg
, struct linux_binprm
*bprm
)
616 int len
= strnlen(arg
, MAX_ARG_STRLEN
) + 1 /* terminating NUL */;
617 unsigned long pos
= bprm
->p
;
621 if (!valid_arg_len(bprm
, len
))
624 /* We're going to work our way backwards. */
627 if (IS_ENABLED(CONFIG_MMU
) && bprm
->p
< bprm
->argmin
)
631 unsigned int bytes_to_copy
= min_t(unsigned int, len
,
632 min_not_zero(offset_in_page(pos
), PAGE_SIZE
));
636 pos
-= bytes_to_copy
;
637 arg
-= bytes_to_copy
;
638 len
-= bytes_to_copy
;
640 page
= get_arg_page(bprm
, pos
, 1);
643 kaddr
= kmap_atomic(page
);
644 flush_arg_page(bprm
, pos
& PAGE_MASK
, page
);
645 memcpy(kaddr
+ offset_in_page(pos
), arg
, bytes_to_copy
);
646 flush_dcache_page(page
);
647 kunmap_atomic(kaddr
);
653 EXPORT_SYMBOL(copy_string_kernel
);
655 static int copy_strings_kernel(int argc
, const char *const *argv
,
656 struct linux_binprm
*bprm
)
659 int ret
= copy_string_kernel(argv
[argc
], bprm
);
662 if (fatal_signal_pending(current
))
663 return -ERESTARTNOHAND
;
672 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
673 * the binfmt code determines where the new stack should reside, we shift it to
674 * its final location. The process proceeds as follows:
676 * 1) Use shift to calculate the new vma endpoints.
677 * 2) Extend vma to cover both the old and new ranges. This ensures the
678 * arguments passed to subsequent functions are consistent.
679 * 3) Move vma's page tables to the new range.
680 * 4) Free up any cleared pgd range.
681 * 5) Shrink the vma to cover only the new range.
683 static int shift_arg_pages(struct vm_area_struct
*vma
, unsigned long shift
)
685 struct mm_struct
*mm
= vma
->vm_mm
;
686 unsigned long old_start
= vma
->vm_start
;
687 unsigned long old_end
= vma
->vm_end
;
688 unsigned long length
= old_end
- old_start
;
689 unsigned long new_start
= old_start
- shift
;
690 unsigned long new_end
= old_end
- shift
;
691 struct mmu_gather tlb
;
693 BUG_ON(new_start
> new_end
);
696 * ensure there are no vmas between where we want to go
699 if (vma
!= find_vma(mm
, new_start
))
703 * cover the whole range: [new_start, old_end)
705 if (vma_adjust(vma
, new_start
, old_end
, vma
->vm_pgoff
, NULL
))
709 * move the page tables downwards, on failure we rely on
710 * process cleanup to remove whatever mess we made.
712 if (length
!= move_page_tables(vma
, old_start
,
713 vma
, new_start
, length
, false))
717 tlb_gather_mmu(&tlb
, mm
);
718 if (new_end
> old_start
) {
720 * when the old and new regions overlap clear from new_end.
722 free_pgd_range(&tlb
, new_end
, old_end
, new_end
,
723 vma
->vm_next
? vma
->vm_next
->vm_start
: USER_PGTABLES_CEILING
);
726 * otherwise, clean from old_start; this is done to not touch
727 * the address space in [new_end, old_start) some architectures
728 * have constraints on va-space that make this illegal (IA64) -
729 * for the others its just a little faster.
731 free_pgd_range(&tlb
, old_start
, old_end
, new_end
,
732 vma
->vm_next
? vma
->vm_next
->vm_start
: USER_PGTABLES_CEILING
);
734 tlb_finish_mmu(&tlb
);
737 * Shrink the vma to just the new range. Always succeeds.
739 vma_adjust(vma
, new_start
, new_end
, vma
->vm_pgoff
, NULL
);
745 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
746 * the stack is optionally relocated, and some extra space is added.
748 int setup_arg_pages(struct linux_binprm
*bprm
,
749 unsigned long stack_top
,
750 int executable_stack
)
753 unsigned long stack_shift
;
754 struct mm_struct
*mm
= current
->mm
;
755 struct vm_area_struct
*vma
= bprm
->vma
;
756 struct vm_area_struct
*prev
= NULL
;
757 unsigned long vm_flags
;
758 unsigned long stack_base
;
759 unsigned long stack_size
;
760 unsigned long stack_expand
;
761 unsigned long rlim_stack
;
763 #ifdef CONFIG_STACK_GROWSUP
764 /* Limit stack size */
765 stack_base
= bprm
->rlim_stack
.rlim_max
;
767 stack_base
= calc_max_stack_size(stack_base
);
769 /* Add space for stack randomization. */
770 stack_base
+= (STACK_RND_MASK
<< PAGE_SHIFT
);
772 /* Make sure we didn't let the argument array grow too large. */
773 if (vma
->vm_end
- vma
->vm_start
> stack_base
)
776 stack_base
= PAGE_ALIGN(stack_top
- stack_base
);
778 stack_shift
= vma
->vm_start
- stack_base
;
779 mm
->arg_start
= bprm
->p
- stack_shift
;
780 bprm
->p
= vma
->vm_end
- stack_shift
;
782 stack_top
= arch_align_stack(stack_top
);
783 stack_top
= PAGE_ALIGN(stack_top
);
785 if (unlikely(stack_top
< mmap_min_addr
) ||
786 unlikely(vma
->vm_end
- vma
->vm_start
>= stack_top
- mmap_min_addr
))
789 stack_shift
= vma
->vm_end
- stack_top
;
791 bprm
->p
-= stack_shift
;
792 mm
->arg_start
= bprm
->p
;
796 bprm
->loader
-= stack_shift
;
797 bprm
->exec
-= stack_shift
;
799 if (mmap_write_lock_killable(mm
))
802 vm_flags
= VM_STACK_FLAGS
;
805 * Adjust stack execute permissions; explicitly enable for
806 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
807 * (arch default) otherwise.
809 if (unlikely(executable_stack
== EXSTACK_ENABLE_X
))
811 else if (executable_stack
== EXSTACK_DISABLE_X
)
812 vm_flags
&= ~VM_EXEC
;
813 vm_flags
|= mm
->def_flags
;
814 vm_flags
|= VM_STACK_INCOMPLETE_SETUP
;
816 ret
= mprotect_fixup(vma
, &prev
, vma
->vm_start
, vma
->vm_end
,
822 if (unlikely(vm_flags
& VM_EXEC
)) {
823 pr_warn_once("process '%pD4' started with executable stack\n",
827 /* Move stack pages down in memory. */
829 ret
= shift_arg_pages(vma
, stack_shift
);
834 /* mprotect_fixup is overkill to remove the temporary stack flags */
835 vma
->vm_flags
&= ~VM_STACK_INCOMPLETE_SETUP
;
837 stack_expand
= 131072UL; /* randomly 32*4k (or 2*64k) pages */
838 stack_size
= vma
->vm_end
- vma
->vm_start
;
840 * Align this down to a page boundary as expand_stack
843 rlim_stack
= bprm
->rlim_stack
.rlim_cur
& PAGE_MASK
;
844 #ifdef CONFIG_STACK_GROWSUP
845 if (stack_size
+ stack_expand
> rlim_stack
)
846 stack_base
= vma
->vm_start
+ rlim_stack
;
848 stack_base
= vma
->vm_end
+ stack_expand
;
850 if (stack_size
+ stack_expand
> rlim_stack
)
851 stack_base
= vma
->vm_end
- rlim_stack
;
853 stack_base
= vma
->vm_start
- stack_expand
;
855 current
->mm
->start_stack
= bprm
->p
;
856 ret
= expand_stack(vma
, stack_base
);
861 mmap_write_unlock(mm
);
864 EXPORT_SYMBOL(setup_arg_pages
);
869 * Transfer the program arguments and environment from the holding pages
870 * onto the stack. The provided stack pointer is adjusted accordingly.
872 int transfer_args_to_stack(struct linux_binprm
*bprm
,
873 unsigned long *sp_location
)
875 unsigned long index
, stop
, sp
;
878 stop
= bprm
->p
>> PAGE_SHIFT
;
881 for (index
= MAX_ARG_PAGES
- 1; index
>= stop
; index
--) {
882 unsigned int offset
= index
== stop
? bprm
->p
& ~PAGE_MASK
: 0;
883 char *src
= kmap(bprm
->page
[index
]) + offset
;
884 sp
-= PAGE_SIZE
- offset
;
885 if (copy_to_user((void *) sp
, src
, PAGE_SIZE
- offset
) != 0)
887 kunmap(bprm
->page
[index
]);
897 EXPORT_SYMBOL(transfer_args_to_stack
);
899 #endif /* CONFIG_MMU */
901 static struct file
*do_open_execat(int fd
, struct filename
*name
, int flags
)
905 struct open_flags open_exec_flags
= {
906 .open_flag
= O_LARGEFILE
| O_RDONLY
| __FMODE_EXEC
,
907 .acc_mode
= MAY_EXEC
,
908 .intent
= LOOKUP_OPEN
,
909 .lookup_flags
= LOOKUP_FOLLOW
,
912 if ((flags
& ~(AT_SYMLINK_NOFOLLOW
| AT_EMPTY_PATH
)) != 0)
913 return ERR_PTR(-EINVAL
);
914 if (flags
& AT_SYMLINK_NOFOLLOW
)
915 open_exec_flags
.lookup_flags
&= ~LOOKUP_FOLLOW
;
916 if (flags
& AT_EMPTY_PATH
)
917 open_exec_flags
.lookup_flags
|= LOOKUP_EMPTY
;
919 file
= do_filp_open(fd
, name
, &open_exec_flags
);
924 * may_open() has already checked for this, so it should be
925 * impossible to trip now. But we need to be extra cautious
926 * and check again at the very end too.
929 if (WARN_ON_ONCE(!S_ISREG(file_inode(file
)->i_mode
) ||
930 path_noexec(&file
->f_path
)))
933 err
= deny_write_access(file
);
937 if (name
->name
[0] != '\0')
948 struct file
*open_exec(const char *name
)
950 struct filename
*filename
= getname_kernel(name
);
951 struct file
*f
= ERR_CAST(filename
);
953 if (!IS_ERR(filename
)) {
954 f
= do_open_execat(AT_FDCWD
, filename
, 0);
959 EXPORT_SYMBOL(open_exec
);
961 #if defined(CONFIG_HAVE_AOUT) || defined(CONFIG_BINFMT_FLAT) || \
962 defined(CONFIG_BINFMT_ELF_FDPIC)
963 ssize_t
read_code(struct file
*file
, unsigned long addr
, loff_t pos
, size_t len
)
965 ssize_t res
= vfs_read(file
, (void __user
*)addr
, len
, &pos
);
967 flush_icache_user_range(addr
, addr
+ len
);
970 EXPORT_SYMBOL(read_code
);
974 * Maps the mm_struct mm into the current task struct.
975 * On success, this function returns with exec_update_lock
978 static int exec_mmap(struct mm_struct
*mm
)
980 struct task_struct
*tsk
;
981 struct mm_struct
*old_mm
, *active_mm
;
984 /* Notify parent that we're no longer interested in the old VM */
986 old_mm
= current
->mm
;
987 exec_mm_release(tsk
, old_mm
);
991 ret
= down_write_killable(&tsk
->signal
->exec_update_lock
);
997 * Make sure that if there is a core dump in progress
998 * for the old mm, we get out and die instead of going
999 * through with the exec. We must hold mmap_lock around
1000 * checking core_state and changing tsk->mm.
1002 mmap_read_lock(old_mm
);
1003 if (unlikely(old_mm
->core_state
)) {
1004 mmap_read_unlock(old_mm
);
1005 up_write(&tsk
->signal
->exec_update_lock
);
1011 membarrier_exec_mmap(mm
);
1013 local_irq_disable();
1014 active_mm
= tsk
->active_mm
;
1015 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
))
1029 tsk
->mm
->vmacache_seqnum
= 0;
1030 vmacache_flush(tsk
);
1033 mmap_read_unlock(old_mm
);
1034 BUG_ON(active_mm
!= old_mm
);
1035 setmax_mm_hiwater_rss(&tsk
->signal
->maxrss
, old_mm
);
1036 mm_update_next_owner(old_mm
);
1044 static int de_thread(struct task_struct
*tsk
)
1046 struct signal_struct
*sig
= tsk
->signal
;
1047 struct sighand_struct
*oldsighand
= tsk
->sighand
;
1048 spinlock_t
*lock
= &oldsighand
->siglock
;
1050 if (thread_group_empty(tsk
))
1051 goto no_thread_group
;
1054 * Kill all other threads in the thread group.
1056 spin_lock_irq(lock
);
1057 if (signal_group_exit(sig
)) {
1059 * Another group action in progress, just
1060 * return so that the signal is processed.
1062 spin_unlock_irq(lock
);
1066 sig
->group_exit_task
= tsk
;
1067 sig
->notify_count
= zap_other_threads(tsk
);
1068 if (!thread_group_leader(tsk
))
1069 sig
->notify_count
--;
1071 while (sig
->notify_count
) {
1072 __set_current_state(TASK_KILLABLE
);
1073 spin_unlock_irq(lock
);
1075 if (__fatal_signal_pending(tsk
))
1077 spin_lock_irq(lock
);
1079 spin_unlock_irq(lock
);
1082 * At this point all other threads have exited, all we have to
1083 * do is to wait for the thread group leader to become inactive,
1084 * and to assume its PID:
1086 if (!thread_group_leader(tsk
)) {
1087 struct task_struct
*leader
= tsk
->group_leader
;
1090 cgroup_threadgroup_change_begin(tsk
);
1091 write_lock_irq(&tasklist_lock
);
1093 * Do this under tasklist_lock to ensure that
1094 * exit_notify() can't miss ->group_exit_task
1096 sig
->notify_count
= -1;
1097 if (likely(leader
->exit_state
))
1099 __set_current_state(TASK_KILLABLE
);
1100 write_unlock_irq(&tasklist_lock
);
1101 cgroup_threadgroup_change_end(tsk
);
1103 if (__fatal_signal_pending(tsk
))
1108 * The only record we have of the real-time age of a
1109 * process, regardless of execs it's done, is start_time.
1110 * All the past CPU time is accumulated in signal_struct
1111 * from sister threads now dead. But in this non-leader
1112 * exec, nothing survives from the original leader thread,
1113 * whose birth marks the true age of this process now.
1114 * When we take on its identity by switching to its PID, we
1115 * also take its birthdate (always earlier than our own).
1117 tsk
->start_time
= leader
->start_time
;
1118 tsk
->start_boottime
= leader
->start_boottime
;
1120 BUG_ON(!same_thread_group(leader
, tsk
));
1122 * An exec() starts a new thread group with the
1123 * TGID of the previous thread group. Rehash the
1124 * two threads with a switched PID, and release
1125 * the former thread group leader:
1128 /* Become a process group leader with the old leader's pid.
1129 * The old leader becomes a thread of the this thread group.
1131 exchange_tids(tsk
, leader
);
1132 transfer_pid(leader
, tsk
, PIDTYPE_TGID
);
1133 transfer_pid(leader
, tsk
, PIDTYPE_PGID
);
1134 transfer_pid(leader
, tsk
, PIDTYPE_SID
);
1136 list_replace_rcu(&leader
->tasks
, &tsk
->tasks
);
1137 list_replace_init(&leader
->sibling
, &tsk
->sibling
);
1139 tsk
->group_leader
= tsk
;
1140 leader
->group_leader
= tsk
;
1142 tsk
->exit_signal
= SIGCHLD
;
1143 leader
->exit_signal
= -1;
1145 BUG_ON(leader
->exit_state
!= EXIT_ZOMBIE
);
1146 leader
->exit_state
= EXIT_DEAD
;
1149 * We are going to release_task()->ptrace_unlink() silently,
1150 * the tracer can sleep in do_wait(). EXIT_DEAD guarantees
1151 * the tracer wont't block again waiting for this thread.
1153 if (unlikely(leader
->ptrace
))
1154 __wake_up_parent(leader
, leader
->parent
);
1155 write_unlock_irq(&tasklist_lock
);
1156 cgroup_threadgroup_change_end(tsk
);
1158 release_task(leader
);
1161 sig
->group_exit_task
= NULL
;
1162 sig
->notify_count
= 0;
1165 /* we have changed execution domain */
1166 tsk
->exit_signal
= SIGCHLD
;
1168 BUG_ON(!thread_group_leader(tsk
));
1172 /* protects against exit_notify() and __exit_signal() */
1173 read_lock(&tasklist_lock
);
1174 sig
->group_exit_task
= NULL
;
1175 sig
->notify_count
= 0;
1176 read_unlock(&tasklist_lock
);
1182 * This function makes sure the current process has its own signal table,
1183 * so that flush_signal_handlers can later reset the handlers without
1184 * disturbing other processes. (Other processes might share the signal
1185 * table via the CLONE_SIGHAND option to clone().)
1187 static int unshare_sighand(struct task_struct
*me
)
1189 struct sighand_struct
*oldsighand
= me
->sighand
;
1191 if (refcount_read(&oldsighand
->count
) != 1) {
1192 struct sighand_struct
*newsighand
;
1194 * This ->sighand is shared with the CLONE_SIGHAND
1195 * but not CLONE_THREAD task, switch to the new one.
1197 newsighand
= kmem_cache_alloc(sighand_cachep
, GFP_KERNEL
);
1201 refcount_set(&newsighand
->count
, 1);
1202 memcpy(newsighand
->action
, oldsighand
->action
,
1203 sizeof(newsighand
->action
));
1205 write_lock_irq(&tasklist_lock
);
1206 spin_lock(&oldsighand
->siglock
);
1207 rcu_assign_pointer(me
->sighand
, newsighand
);
1208 spin_unlock(&oldsighand
->siglock
);
1209 write_unlock_irq(&tasklist_lock
);
1211 __cleanup_sighand(oldsighand
);
1216 char *__get_task_comm(char *buf
, size_t buf_size
, struct task_struct
*tsk
)
1219 strncpy(buf
, tsk
->comm
, buf_size
);
1223 EXPORT_SYMBOL_GPL(__get_task_comm
);
1226 * These functions flushes out all traces of the currently running executable
1227 * so that a new one can be started
1230 void __set_task_comm(struct task_struct
*tsk
, const char *buf
, bool exec
)
1233 trace_task_rename(tsk
, buf
);
1234 strlcpy(tsk
->comm
, buf
, sizeof(tsk
->comm
));
1236 perf_event_comm(tsk
, exec
);
1240 * Calling this is the point of no return. None of the failures will be
1241 * seen by userspace since either the process is already taking a fatal
1242 * signal (via de_thread() or coredump), or will have SEGV raised
1243 * (after exec_mmap()) by search_binary_handler (see below).
1245 int begin_new_exec(struct linux_binprm
* bprm
)
1247 struct task_struct
*me
= current
;
1250 /* Once we are committed compute the creds */
1251 retval
= bprm_creds_from_file(bprm
);
1256 * Ensure all future errors are fatal.
1258 bprm
->point_of_no_return
= true;
1261 * Make this the only thread in the thread group.
1263 retval
= de_thread(me
);
1268 * Cancel any io_uring activity across execve
1270 io_uring_task_cancel();
1272 /* Ensure the files table is not shared. */
1273 retval
= unshare_files();
1278 * Must be called _before_ exec_mmap() as bprm->mm is
1279 * not visibile until then. This also enables the update
1282 retval
= set_mm_exe_file(bprm
->mm
, bprm
->file
);
1286 /* If the binary is not readable then enforce mm->dumpable=0 */
1287 would_dump(bprm
, bprm
->file
);
1288 if (bprm
->have_execfd
)
1289 would_dump(bprm
, bprm
->executable
);
1292 * Release all of the old mmap stuff
1294 acct_arg_size(bprm
, 0);
1295 retval
= exec_mmap(bprm
->mm
);
1301 #ifdef CONFIG_POSIX_TIMERS
1302 spin_lock_irq(&me
->sighand
->siglock
);
1303 posix_cpu_timers_exit(me
);
1304 spin_unlock_irq(&me
->sighand
->siglock
);
1306 flush_itimer_signals();
1310 * Make the signal table private.
1312 retval
= unshare_sighand(me
);
1317 * Ensure that the uaccess routines can actually operate on userspace
1320 force_uaccess_begin();
1322 me
->flags
&= ~(PF_RANDOMIZE
| PF_FORKNOEXEC
| PF_KTHREAD
|
1323 PF_NOFREEZE
| PF_NO_SETAFFINITY
);
1325 me
->personality
&= ~bprm
->per_clear
;
1327 clear_syscall_work_syscall_user_dispatch(me
);
1330 * We have to apply CLOEXEC before we change whether the process is
1331 * dumpable (in setup_new_exec) to avoid a race with a process in userspace
1332 * trying to access the should-be-closed file descriptors of a process
1333 * undergoing exec(2).
1335 do_close_on_exec(me
->files
);
1337 if (bprm
->secureexec
) {
1338 /* Make sure parent cannot signal privileged process. */
1339 me
->pdeath_signal
= 0;
1342 * For secureexec, reset the stack limit to sane default to
1343 * avoid bad behavior from the prior rlimits. This has to
1344 * happen before arch_pick_mmap_layout(), which examines
1345 * RLIMIT_STACK, but after the point of no return to avoid
1346 * needing to clean up the change on failure.
1348 if (bprm
->rlim_stack
.rlim_cur
> _STK_LIM
)
1349 bprm
->rlim_stack
.rlim_cur
= _STK_LIM
;
1352 me
->sas_ss_sp
= me
->sas_ss_size
= 0;
1355 * Figure out dumpability. Note that this checking only of current
1356 * is wrong, but userspace depends on it. This should be testing
1357 * bprm->secureexec instead.
1359 if (bprm
->interp_flags
& BINPRM_FLAGS_ENFORCE_NONDUMP
||
1360 !(uid_eq(current_euid(), current_uid()) &&
1361 gid_eq(current_egid(), current_gid())))
1362 set_dumpable(current
->mm
, suid_dumpable
);
1364 set_dumpable(current
->mm
, SUID_DUMP_USER
);
1367 __set_task_comm(me
, kbasename(bprm
->filename
), true);
1369 /* An exec changes our domain. We are no longer part of the thread
1371 WRITE_ONCE(me
->self_exec_id
, me
->self_exec_id
+ 1);
1372 flush_signal_handlers(me
, 0);
1374 retval
= set_cred_ucounts(bprm
->cred
);
1379 * install the new credentials for this executable
1381 security_bprm_committing_creds(bprm
);
1383 commit_creds(bprm
->cred
);
1387 * Disable monitoring for regular users
1388 * when executing setuid binaries. Must
1389 * wait until new credentials are committed
1390 * by commit_creds() above
1392 if (get_dumpable(me
->mm
) != SUID_DUMP_USER
)
1393 perf_event_exit_task(me
);
1395 * cred_guard_mutex must be held at least to this point to prevent
1396 * ptrace_attach() from altering our determination of the task's
1397 * credentials; any time after this it may be unlocked.
1399 security_bprm_committed_creds(bprm
);
1401 /* Pass the opened binary to the interpreter. */
1402 if (bprm
->have_execfd
) {
1403 retval
= get_unused_fd_flags(0);
1406 fd_install(retval
, bprm
->executable
);
1407 bprm
->executable
= NULL
;
1408 bprm
->execfd
= retval
;
1413 up_write(&me
->signal
->exec_update_lock
);
1417 EXPORT_SYMBOL(begin_new_exec
);
1419 void would_dump(struct linux_binprm
*bprm
, struct file
*file
)
1421 struct inode
*inode
= file_inode(file
);
1422 struct user_namespace
*mnt_userns
= file_mnt_user_ns(file
);
1423 if (inode_permission(mnt_userns
, inode
, MAY_READ
) < 0) {
1424 struct user_namespace
*old
, *user_ns
;
1425 bprm
->interp_flags
|= BINPRM_FLAGS_ENFORCE_NONDUMP
;
1427 /* Ensure mm->user_ns contains the executable */
1428 user_ns
= old
= bprm
->mm
->user_ns
;
1429 while ((user_ns
!= &init_user_ns
) &&
1430 !privileged_wrt_inode_uidgid(user_ns
, mnt_userns
, inode
))
1431 user_ns
= user_ns
->parent
;
1433 if (old
!= user_ns
) {
1434 bprm
->mm
->user_ns
= get_user_ns(user_ns
);
1439 EXPORT_SYMBOL(would_dump
);
1441 void setup_new_exec(struct linux_binprm
* bprm
)
1443 /* Setup things that can depend upon the personality */
1444 struct task_struct
*me
= current
;
1446 arch_pick_mmap_layout(me
->mm
, &bprm
->rlim_stack
);
1448 arch_setup_new_exec();
1450 /* Set the new mm task size. We have to do that late because it may
1451 * depend on TIF_32BIT which is only updated in flush_thread() on
1452 * some architectures like powerpc
1454 me
->mm
->task_size
= TASK_SIZE
;
1455 up_write(&me
->signal
->exec_update_lock
);
1456 mutex_unlock(&me
->signal
->cred_guard_mutex
);
1458 EXPORT_SYMBOL(setup_new_exec
);
1460 /* Runs immediately before start_thread() takes over. */
1461 void finalize_exec(struct linux_binprm
*bprm
)
1463 /* Store any stack rlimit changes before starting thread. */
1464 task_lock(current
->group_leader
);
1465 current
->signal
->rlim
[RLIMIT_STACK
] = bprm
->rlim_stack
;
1466 task_unlock(current
->group_leader
);
1468 EXPORT_SYMBOL(finalize_exec
);
1471 * Prepare credentials and lock ->cred_guard_mutex.
1472 * setup_new_exec() commits the new creds and drops the lock.
1473 * Or, if exec fails before, free_bprm() should release ->cred
1476 static int prepare_bprm_creds(struct linux_binprm
*bprm
)
1478 if (mutex_lock_interruptible(¤t
->signal
->cred_guard_mutex
))
1479 return -ERESTARTNOINTR
;
1481 bprm
->cred
= prepare_exec_creds();
1482 if (likely(bprm
->cred
))
1485 mutex_unlock(¤t
->signal
->cred_guard_mutex
);
1489 static void free_bprm(struct linux_binprm
*bprm
)
1492 acct_arg_size(bprm
, 0);
1495 free_arg_pages(bprm
);
1497 mutex_unlock(¤t
->signal
->cred_guard_mutex
);
1498 abort_creds(bprm
->cred
);
1501 allow_write_access(bprm
->file
);
1504 if (bprm
->executable
)
1505 fput(bprm
->executable
);
1506 /* If a binfmt changed the interp, free it. */
1507 if (bprm
->interp
!= bprm
->filename
)
1508 kfree(bprm
->interp
);
1509 kfree(bprm
->fdpath
);
1513 static struct linux_binprm
*alloc_bprm(int fd
, struct filename
*filename
)
1515 struct linux_binprm
*bprm
= kzalloc(sizeof(*bprm
), GFP_KERNEL
);
1516 int retval
= -ENOMEM
;
1520 if (fd
== AT_FDCWD
|| filename
->name
[0] == '/') {
1521 bprm
->filename
= filename
->name
;
1523 if (filename
->name
[0] == '\0')
1524 bprm
->fdpath
= kasprintf(GFP_KERNEL
, "/dev/fd/%d", fd
);
1526 bprm
->fdpath
= kasprintf(GFP_KERNEL
, "/dev/fd/%d/%s",
1527 fd
, filename
->name
);
1531 bprm
->filename
= bprm
->fdpath
;
1533 bprm
->interp
= bprm
->filename
;
1535 retval
= bprm_mm_init(bprm
);
1543 return ERR_PTR(retval
);
1546 int bprm_change_interp(const char *interp
, struct linux_binprm
*bprm
)
1548 /* If a binfmt changed the interp, free it first. */
1549 if (bprm
->interp
!= bprm
->filename
)
1550 kfree(bprm
->interp
);
1551 bprm
->interp
= kstrdup(interp
, GFP_KERNEL
);
1556 EXPORT_SYMBOL(bprm_change_interp
);
1559 * determine how safe it is to execute the proposed program
1560 * - the caller must hold ->cred_guard_mutex to protect against
1561 * PTRACE_ATTACH or seccomp thread-sync
1563 static void check_unsafe_exec(struct linux_binprm
*bprm
)
1565 struct task_struct
*p
= current
, *t
;
1569 bprm
->unsafe
|= LSM_UNSAFE_PTRACE
;
1572 * This isn't strictly necessary, but it makes it harder for LSMs to
1575 if (task_no_new_privs(current
))
1576 bprm
->unsafe
|= LSM_UNSAFE_NO_NEW_PRIVS
;
1580 spin_lock(&p
->fs
->lock
);
1582 while_each_thread(p
, t
) {
1588 if (p
->fs
->users
> n_fs
)
1589 bprm
->unsafe
|= LSM_UNSAFE_SHARE
;
1592 spin_unlock(&p
->fs
->lock
);
1595 static void bprm_fill_uid(struct linux_binprm
*bprm
, struct file
*file
)
1597 /* Handle suid and sgid on files */
1598 struct user_namespace
*mnt_userns
;
1599 struct inode
*inode
;
1604 if (!mnt_may_suid(file
->f_path
.mnt
))
1607 if (task_no_new_privs(current
))
1610 inode
= file
->f_path
.dentry
->d_inode
;
1611 mode
= READ_ONCE(inode
->i_mode
);
1612 if (!(mode
& (S_ISUID
|S_ISGID
)))
1615 mnt_userns
= file_mnt_user_ns(file
);
1617 /* Be careful if suid/sgid is set */
1620 /* reload atomically mode/uid/gid now that lock held */
1621 mode
= inode
->i_mode
;
1622 uid
= i_uid_into_mnt(mnt_userns
, inode
);
1623 gid
= i_gid_into_mnt(mnt_userns
, inode
);
1624 inode_unlock(inode
);
1626 /* We ignore suid/sgid if there are no mappings for them in the ns */
1627 if (!kuid_has_mapping(bprm
->cred
->user_ns
, uid
) ||
1628 !kgid_has_mapping(bprm
->cred
->user_ns
, gid
))
1631 if (mode
& S_ISUID
) {
1632 bprm
->per_clear
|= PER_CLEAR_ON_SETID
;
1633 bprm
->cred
->euid
= uid
;
1636 if ((mode
& (S_ISGID
| S_IXGRP
)) == (S_ISGID
| S_IXGRP
)) {
1637 bprm
->per_clear
|= PER_CLEAR_ON_SETID
;
1638 bprm
->cred
->egid
= gid
;
1643 * Compute brpm->cred based upon the final binary.
1645 static int bprm_creds_from_file(struct linux_binprm
*bprm
)
1647 /* Compute creds based on which file? */
1648 struct file
*file
= bprm
->execfd_creds
? bprm
->executable
: bprm
->file
;
1650 bprm_fill_uid(bprm
, file
);
1651 return security_bprm_creds_from_file(bprm
, file
);
1655 * Fill the binprm structure from the inode.
1656 * Read the first BINPRM_BUF_SIZE bytes
1658 * This may be called multiple times for binary chains (scripts for example).
1660 static int prepare_binprm(struct linux_binprm
*bprm
)
1664 memset(bprm
->buf
, 0, BINPRM_BUF_SIZE
);
1665 return kernel_read(bprm
->file
, bprm
->buf
, BINPRM_BUF_SIZE
, &pos
);
1669 * Arguments are '\0' separated strings found at the location bprm->p
1670 * points to; chop off the first by relocating brpm->p to right after
1671 * the first '\0' encountered.
1673 int remove_arg_zero(struct linux_binprm
*bprm
)
1676 unsigned long offset
;
1684 offset
= bprm
->p
& ~PAGE_MASK
;
1685 page
= get_arg_page(bprm
, bprm
->p
, 0);
1690 kaddr
= kmap_atomic(page
);
1692 for (; offset
< PAGE_SIZE
&& kaddr
[offset
];
1693 offset
++, bprm
->p
++)
1696 kunmap_atomic(kaddr
);
1698 } while (offset
== PAGE_SIZE
);
1707 EXPORT_SYMBOL(remove_arg_zero
);
1709 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1711 * cycle the list of binary formats handler, until one recognizes the image
1713 static int search_binary_handler(struct linux_binprm
*bprm
)
1715 bool need_retry
= IS_ENABLED(CONFIG_MODULES
);
1716 struct linux_binfmt
*fmt
;
1719 retval
= prepare_binprm(bprm
);
1723 retval
= security_bprm_check(bprm
);
1729 read_lock(&binfmt_lock
);
1730 list_for_each_entry(fmt
, &formats
, lh
) {
1731 if (!try_module_get(fmt
->module
))
1733 read_unlock(&binfmt_lock
);
1735 retval
= fmt
->load_binary(bprm
);
1737 read_lock(&binfmt_lock
);
1739 if (bprm
->point_of_no_return
|| (retval
!= -ENOEXEC
)) {
1740 read_unlock(&binfmt_lock
);
1744 read_unlock(&binfmt_lock
);
1747 if (printable(bprm
->buf
[0]) && printable(bprm
->buf
[1]) &&
1748 printable(bprm
->buf
[2]) && printable(bprm
->buf
[3]))
1750 if (request_module("binfmt-%04x", *(ushort
*)(bprm
->buf
+ 2)) < 0)
1759 static int exec_binprm(struct linux_binprm
*bprm
)
1761 pid_t old_pid
, old_vpid
;
1764 /* Need to fetch pid before load_binary changes it */
1765 old_pid
= current
->pid
;
1767 old_vpid
= task_pid_nr_ns(current
, task_active_pid_ns(current
->parent
));
1770 /* This allows 4 levels of binfmt rewrites before failing hard. */
1771 for (depth
= 0;; depth
++) {
1776 ret
= search_binary_handler(bprm
);
1779 if (!bprm
->interpreter
)
1783 bprm
->file
= bprm
->interpreter
;
1784 bprm
->interpreter
= NULL
;
1786 allow_write_access(exec
);
1787 if (unlikely(bprm
->have_execfd
)) {
1788 if (bprm
->executable
) {
1792 bprm
->executable
= exec
;
1798 trace_sched_process_exec(current
, old_pid
, bprm
);
1799 ptrace_event(PTRACE_EVENT_EXEC
, old_vpid
);
1800 proc_exec_connector(current
);
1805 * sys_execve() executes a new program.
1807 static int bprm_execve(struct linux_binprm
*bprm
,
1808 int fd
, struct filename
*filename
, int flags
)
1813 retval
= prepare_bprm_creds(bprm
);
1817 check_unsafe_exec(bprm
);
1818 current
->in_execve
= 1;
1820 file
= do_open_execat(fd
, filename
, flags
);
1821 retval
= PTR_ERR(file
);
1829 * Record that a name derived from an O_CLOEXEC fd will be
1830 * inaccessible after exec. This allows the code in exec to
1831 * choose to fail when the executable is not mmaped into the
1832 * interpreter and an open file descriptor is not passed to
1833 * the interpreter. This makes for a better user experience
1834 * than having the interpreter start and then immediately fail
1835 * when it finds the executable is inaccessible.
1837 if (bprm
->fdpath
&& get_close_on_exec(fd
))
1838 bprm
->interp_flags
|= BINPRM_FLAGS_PATH_INACCESSIBLE
;
1840 /* Set the unchanging part of bprm->cred */
1841 retval
= security_bprm_creds_for_exec(bprm
);
1845 retval
= exec_binprm(bprm
);
1849 /* execve succeeded */
1850 current
->fs
->in_exec
= 0;
1851 current
->in_execve
= 0;
1852 rseq_execve(current
);
1853 acct_update_integrals(current
);
1854 task_numa_free(current
, false);
1859 * If past the point of no return ensure the code never
1860 * returns to the userspace process. Use an existing fatal
1861 * signal if present otherwise terminate the process with
1864 if (bprm
->point_of_no_return
&& !fatal_signal_pending(current
))
1865 force_fatal_sig(SIGSEGV
);
1868 current
->fs
->in_exec
= 0;
1869 current
->in_execve
= 0;
1874 static int do_execveat_common(int fd
, struct filename
*filename
,
1875 struct user_arg_ptr argv
,
1876 struct user_arg_ptr envp
,
1879 struct linux_binprm
*bprm
;
1882 if (IS_ERR(filename
))
1883 return PTR_ERR(filename
);
1886 * We move the actual failure in case of RLIMIT_NPROC excess from
1887 * set*uid() to execve() because too many poorly written programs
1888 * don't check setuid() return code. Here we additionally recheck
1889 * whether NPROC limit is still exceeded.
1891 if ((current
->flags
& PF_NPROC_EXCEEDED
) &&
1892 is_ucounts_overlimit(current_ucounts(), UCOUNT_RLIMIT_NPROC
, rlimit(RLIMIT_NPROC
))) {
1897 /* We're below the limit (still or again), so we don't want to make
1898 * further execve() calls fail. */
1899 current
->flags
&= ~PF_NPROC_EXCEEDED
;
1901 bprm
= alloc_bprm(fd
, filename
);
1903 retval
= PTR_ERR(bprm
);
1907 retval
= count(argv
, MAX_ARG_STRINGS
);
1909 pr_warn_once("process '%s' launched '%s' with NULL argv: empty string added\n",
1910 current
->comm
, bprm
->filename
);
1913 bprm
->argc
= retval
;
1915 retval
= count(envp
, MAX_ARG_STRINGS
);
1918 bprm
->envc
= retval
;
1920 retval
= bprm_stack_limits(bprm
);
1924 retval
= copy_string_kernel(bprm
->filename
, bprm
);
1927 bprm
->exec
= bprm
->p
;
1929 retval
= copy_strings(bprm
->envc
, envp
, bprm
);
1933 retval
= copy_strings(bprm
->argc
, argv
, bprm
);
1938 * When argv is empty, add an empty string ("") as argv[0] to
1939 * ensure confused userspace programs that start processing
1940 * from argv[1] won't end up walking envp. See also
1941 * bprm_stack_limits().
1943 if (bprm
->argc
== 0) {
1944 retval
= copy_string_kernel("", bprm
);
1950 retval
= bprm_execve(bprm
, fd
, filename
, flags
);
1959 int kernel_execve(const char *kernel_filename
,
1960 const char *const *argv
, const char *const *envp
)
1962 struct filename
*filename
;
1963 struct linux_binprm
*bprm
;
1967 filename
= getname_kernel(kernel_filename
);
1968 if (IS_ERR(filename
))
1969 return PTR_ERR(filename
);
1971 bprm
= alloc_bprm(fd
, filename
);
1973 retval
= PTR_ERR(bprm
);
1977 retval
= count_strings_kernel(argv
);
1978 if (WARN_ON_ONCE(retval
== 0))
1982 bprm
->argc
= retval
;
1984 retval
= count_strings_kernel(envp
);
1987 bprm
->envc
= retval
;
1989 retval
= bprm_stack_limits(bprm
);
1993 retval
= copy_string_kernel(bprm
->filename
, bprm
);
1996 bprm
->exec
= bprm
->p
;
1998 retval
= copy_strings_kernel(bprm
->envc
, envp
, bprm
);
2002 retval
= copy_strings_kernel(bprm
->argc
, argv
, bprm
);
2006 retval
= bprm_execve(bprm
, fd
, filename
, 0);
2014 static int do_execve(struct filename
*filename
,
2015 const char __user
*const __user
*__argv
,
2016 const char __user
*const __user
*__envp
)
2018 struct user_arg_ptr argv
= { .ptr
.native
= __argv
};
2019 struct user_arg_ptr envp
= { .ptr
.native
= __envp
};
2020 return do_execveat_common(AT_FDCWD
, filename
, argv
, envp
, 0);
2023 static int do_execveat(int fd
, struct filename
*filename
,
2024 const char __user
*const __user
*__argv
,
2025 const char __user
*const __user
*__envp
,
2028 struct user_arg_ptr argv
= { .ptr
.native
= __argv
};
2029 struct user_arg_ptr envp
= { .ptr
.native
= __envp
};
2031 return do_execveat_common(fd
, filename
, argv
, envp
, flags
);
2034 #ifdef CONFIG_COMPAT
2035 static int compat_do_execve(struct filename
*filename
,
2036 const compat_uptr_t __user
*__argv
,
2037 const compat_uptr_t __user
*__envp
)
2039 struct user_arg_ptr argv
= {
2041 .ptr
.compat
= __argv
,
2043 struct user_arg_ptr envp
= {
2045 .ptr
.compat
= __envp
,
2047 return do_execveat_common(AT_FDCWD
, filename
, argv
, envp
, 0);
2050 static int compat_do_execveat(int fd
, struct filename
*filename
,
2051 const compat_uptr_t __user
*__argv
,
2052 const compat_uptr_t __user
*__envp
,
2055 struct user_arg_ptr argv
= {
2057 .ptr
.compat
= __argv
,
2059 struct user_arg_ptr envp
= {
2061 .ptr
.compat
= __envp
,
2063 return do_execveat_common(fd
, filename
, argv
, envp
, flags
);
2067 void set_binfmt(struct linux_binfmt
*new)
2069 struct mm_struct
*mm
= current
->mm
;
2072 module_put(mm
->binfmt
->module
);
2076 __module_get(new->module
);
2078 EXPORT_SYMBOL(set_binfmt
);
2081 * set_dumpable stores three-value SUID_DUMP_* into mm->flags.
2083 void set_dumpable(struct mm_struct
*mm
, int value
)
2085 if (WARN_ON((unsigned)value
> SUID_DUMP_ROOT
))
2088 set_mask_bits(&mm
->flags
, MMF_DUMPABLE_MASK
, value
);
2091 SYSCALL_DEFINE3(execve
,
2092 const char __user
*, filename
,
2093 const char __user
*const __user
*, argv
,
2094 const char __user
*const __user
*, envp
)
2096 return do_execve(getname(filename
), argv
, envp
);
2099 SYSCALL_DEFINE5(execveat
,
2100 int, fd
, const char __user
*, filename
,
2101 const char __user
*const __user
*, argv
,
2102 const char __user
*const __user
*, envp
,
2105 return do_execveat(fd
,
2106 getname_uflags(filename
, flags
),
2110 #ifdef CONFIG_COMPAT
2111 COMPAT_SYSCALL_DEFINE3(execve
, const char __user
*, filename
,
2112 const compat_uptr_t __user
*, argv
,
2113 const compat_uptr_t __user
*, envp
)
2115 return compat_do_execve(getname(filename
), argv
, envp
);
2118 COMPAT_SYSCALL_DEFINE5(execveat
, int, fd
,
2119 const char __user
*, filename
,
2120 const compat_uptr_t __user
*, argv
,
2121 const compat_uptr_t __user
*, envp
,
2124 return compat_do_execveat(fd
,
2125 getname_uflags(filename
, flags
),