4 * Copyright (C) 1991, 1992 Linus Torvalds
8 * #!-checking implemented by tytso.
11 * Demand-loading implemented 01.12.91 - no need to read anything but
12 * the header into memory. The inode of the executable is put into
13 * "current->executable", and page faults do the actual loading. Clean.
15 * Once more I can proudly say that linux stood up to being changed: it
16 * was less than 2 hours work to get demand-loading completely implemented.
18 * Demand loading changed July 1993 by Eric Youngdale. Use mmap instead,
19 * current->executable is only used by the procfs. This allows a dispatch
20 * table to check for several different types of binary formats. We keep
21 * trying until we recognize the file or we run out of supported binary
25 #include <linux/slab.h>
26 #include <linux/file.h>
27 #include <linux/fdtable.h>
29 #include <linux/stat.h>
30 #include <linux/fcntl.h>
31 #include <linux/swap.h>
32 #include <linux/string.h>
33 #include <linux/init.h>
34 #include <linux/pagemap.h>
35 #include <linux/perf_event.h>
36 #include <linux/highmem.h>
37 #include <linux/spinlock.h>
38 #include <linux/key.h>
39 #include <linux/personality.h>
40 #include <linux/binfmts.h>
41 #include <linux/utsname.h>
42 #include <linux/pid_namespace.h>
43 #include <linux/module.h>
44 #include <linux/namei.h>
45 #include <linux/mount.h>
46 #include <linux/security.h>
47 #include <linux/syscalls.h>
48 #include <linux/tsacct_kern.h>
49 #include <linux/cn_proc.h>
50 #include <linux/audit.h>
51 #include <linux/tracehook.h>
52 #include <linux/kmod.h>
53 #include <linux/fsnotify.h>
54 #include <linux/fs_struct.h>
55 #include <linux/pipe_fs_i.h>
56 #include <linux/oom.h>
57 #include <linux/compat.h>
59 #include <asm/uaccess.h>
60 #include <asm/mmu_context.h>
63 #include <trace/events/task.h>
67 char core_pattern[CORENAME_MAX_SIZE] = "core";
68 unsigned int core_pipe_limit;
69 int suid_dumpable = 0;
75 static atomic_t call_count = ATOMIC_INIT(1);
77 /* The maximal length of core_pattern is also specified in sysctl.c */
79 static LIST_HEAD(formats);
80 static DEFINE_RWLOCK(binfmt_lock);
82 int __register_binfmt(struct linux_binfmt * fmt, int insert)
86 write_lock(&binfmt_lock);
87 insert ? list_add(&fmt->lh, &formats) :
88 list_add_tail(&fmt->lh, &formats);
89 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);
110 * Note that a shared library must be both readable and executable due to
113 * Also note that we take the address to load from from the file itself.
115 SYSCALL_DEFINE1(uselib, const char __user *, library)
118 char *tmp = getname(library);
119 int error = PTR_ERR(tmp);
120 static const struct open_flags uselib_flags = {
121 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
122 .acc_mode = MAY_READ | MAY_EXEC | MAY_OPEN,
123 .intent = LOOKUP_OPEN
129 file = do_filp_open(AT_FDCWD, tmp, &uselib_flags, LOOKUP_FOLLOW);
131 error = PTR_ERR(file);
136 if (!S_ISREG(file->f_path.dentry->d_inode->i_mode))
140 if (file->f_path.mnt->mnt_flags & MNT_NOEXEC)
147 struct linux_binfmt * fmt;
149 read_lock(&binfmt_lock);
150 list_for_each_entry(fmt, &formats, lh) {
151 if (!fmt->load_shlib)
153 if (!try_module_get(fmt->module))
155 read_unlock(&binfmt_lock);
156 error = fmt->load_shlib(file);
157 read_lock(&binfmt_lock);
159 if (error != -ENOEXEC)
162 read_unlock(&binfmt_lock);
172 * The nascent bprm->mm is not visible until exec_mmap() but it can
173 * use a lot of memory, account these pages in current->mm temporary
174 * for oom_badness()->get_mm_rss(). Once exec succeeds or fails, we
175 * change the counter back via acct_arg_size(0).
177 static void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
179 struct mm_struct *mm = current->mm;
180 long diff = (long)(pages - bprm->vma_pages);
185 bprm->vma_pages = pages;
186 add_mm_counter(mm, MM_ANONPAGES, diff);
189 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
195 #ifdef CONFIG_STACK_GROWSUP
197 ret = expand_downwards(bprm->vma, pos);
202 ret = get_user_pages(current, bprm->mm, pos,
203 1, write, 1, &page, NULL);
208 unsigned long size = bprm->vma->vm_end - bprm->vma->vm_start;
211 acct_arg_size(bprm, size / PAGE_SIZE);
214 * We've historically supported up to 32 pages (ARG_MAX)
215 * of argument strings even with small stacks
221 * Limit to 1/4-th the stack size for the argv+env strings.
223 * - the remaining binfmt code will not run out of stack space,
224 * - the program will have a reasonable amount of stack left
227 rlim = current->signal->rlim;
228 if (size > ACCESS_ONCE(rlim[RLIMIT_STACK].rlim_cur) / 4) {
237 static void put_arg_page(struct page *page)
242 static void free_arg_page(struct linux_binprm *bprm, int i)
246 static void free_arg_pages(struct linux_binprm *bprm)
250 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
253 flush_cache_page(bprm->vma, pos, page_to_pfn(page));
256 static int __bprm_mm_init(struct linux_binprm *bprm)
259 struct vm_area_struct *vma = NULL;
260 struct mm_struct *mm = bprm->mm;
262 bprm->vma = vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
266 down_write(&mm->mmap_sem);
270 * Place the stack at the largest stack address the architecture
271 * supports. Later, we'll move this to an appropriate place. We don't
272 * use STACK_TOP because that can depend on attributes which aren't
275 BUILD_BUG_ON(VM_STACK_FLAGS & VM_STACK_INCOMPLETE_SETUP);
276 vma->vm_end = STACK_TOP_MAX;
277 vma->vm_start = vma->vm_end - PAGE_SIZE;
278 vma->vm_flags = VM_STACK_FLAGS | VM_STACK_INCOMPLETE_SETUP;
279 vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
280 INIT_LIST_HEAD(&vma->anon_vma_chain);
282 err = security_file_mmap(NULL, 0, 0, 0, vma->vm_start, 1);
286 err = insert_vm_struct(mm, vma);
290 mm->stack_vm = mm->total_vm = 1;
291 up_write(&mm->mmap_sem);
292 bprm->p = vma->vm_end - sizeof(void *);
295 up_write(&mm->mmap_sem);
297 kmem_cache_free(vm_area_cachep, vma);
301 static bool valid_arg_len(struct linux_binprm *bprm, long len)
303 return len <= MAX_ARG_STRLEN;
308 static inline void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
312 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
317 page = bprm->page[pos / PAGE_SIZE];
318 if (!page && write) {
319 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
322 bprm->page[pos / PAGE_SIZE] = page;
328 static void put_arg_page(struct page *page)
332 static void free_arg_page(struct linux_binprm *bprm, int i)
335 __free_page(bprm->page[i]);
336 bprm->page[i] = NULL;
340 static void free_arg_pages(struct linux_binprm *bprm)
344 for (i = 0; i < MAX_ARG_PAGES; i++)
345 free_arg_page(bprm, i);
348 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
353 static int __bprm_mm_init(struct linux_binprm *bprm)
355 bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
359 static bool valid_arg_len(struct linux_binprm *bprm, long len)
361 return len <= bprm->p;
364 #endif /* CONFIG_MMU */
367 * Create a new mm_struct and populate it with a temporary stack
368 * vm_area_struct. We don't have enough context at this point to set the stack
369 * flags, permissions, and offset, so we use temporary values. We'll update
370 * them later in setup_arg_pages().
372 int bprm_mm_init(struct linux_binprm *bprm)
375 struct mm_struct *mm = NULL;
377 bprm->mm = mm = mm_alloc();
382 err = init_new_context(current, mm);
386 err = __bprm_mm_init(bprm);
401 struct user_arg_ptr {
406 const char __user *const __user *native;
408 compat_uptr_t __user *compat;
413 static const char __user *get_user_arg_ptr(struct user_arg_ptr argv, int nr)
415 const char __user *native;
418 if (unlikely(argv.is_compat)) {
419 compat_uptr_t compat;
421 if (get_user(compat, argv.ptr.compat + nr))
422 return ERR_PTR(-EFAULT);
424 return compat_ptr(compat);
428 if (get_user(native, argv.ptr.native + nr))
429 return ERR_PTR(-EFAULT);
435 * count() counts the number of strings in array ARGV.
437 static int count(struct user_arg_ptr argv, int max)
441 if (argv.ptr.native != NULL) {
443 const char __user *p = get_user_arg_ptr(argv, i);
454 if (fatal_signal_pending(current))
455 return -ERESTARTNOHAND;
463 * 'copy_strings()' copies argument/environment strings from the old
464 * processes's memory to the new process's stack. The call to get_user_pages()
465 * ensures the destination page is created and not swapped out.
467 static int copy_strings(int argc, struct user_arg_ptr argv,
468 struct linux_binprm *bprm)
470 struct page *kmapped_page = NULL;
472 unsigned long kpos = 0;
476 const char __user *str;
481 str = get_user_arg_ptr(argv, argc);
485 len = strnlen_user(str, MAX_ARG_STRLEN);
490 if (!valid_arg_len(bprm, len))
493 /* We're going to work our way backwords. */
499 int offset, bytes_to_copy;
501 if (fatal_signal_pending(current)) {
502 ret = -ERESTARTNOHAND;
507 offset = pos % PAGE_SIZE;
511 bytes_to_copy = offset;
512 if (bytes_to_copy > len)
515 offset -= bytes_to_copy;
516 pos -= bytes_to_copy;
517 str -= bytes_to_copy;
518 len -= bytes_to_copy;
520 if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
523 page = get_arg_page(bprm, pos, 1);
530 flush_kernel_dcache_page(kmapped_page);
531 kunmap(kmapped_page);
532 put_arg_page(kmapped_page);
535 kaddr = kmap(kmapped_page);
536 kpos = pos & PAGE_MASK;
537 flush_arg_page(bprm, kpos, kmapped_page);
539 if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
548 flush_kernel_dcache_page(kmapped_page);
549 kunmap(kmapped_page);
550 put_arg_page(kmapped_page);
556 * Like copy_strings, but get argv and its values from kernel memory.
558 int copy_strings_kernel(int argc, const char *const *__argv,
559 struct linux_binprm *bprm)
562 mm_segment_t oldfs = get_fs();
563 struct user_arg_ptr argv = {
564 .ptr.native = (const char __user *const __user *)__argv,
568 r = copy_strings(argc, argv, bprm);
573 EXPORT_SYMBOL(copy_strings_kernel);
578 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
579 * the binfmt code determines where the new stack should reside, we shift it to
580 * its final location. The process proceeds as follows:
582 * 1) Use shift to calculate the new vma endpoints.
583 * 2) Extend vma to cover both the old and new ranges. This ensures the
584 * arguments passed to subsequent functions are consistent.
585 * 3) Move vma's page tables to the new range.
586 * 4) Free up any cleared pgd range.
587 * 5) Shrink the vma to cover only the new range.
589 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
591 struct mm_struct *mm = vma->vm_mm;
592 unsigned long old_start = vma->vm_start;
593 unsigned long old_end = vma->vm_end;
594 unsigned long length = old_end - old_start;
595 unsigned long new_start = old_start - shift;
596 unsigned long new_end = old_end - shift;
597 struct mmu_gather tlb;
599 BUG_ON(new_start > new_end);
602 * ensure there are no vmas between where we want to go
605 if (vma != find_vma(mm, new_start))
609 * cover the whole range: [new_start, old_end)
611 if (vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL))
615 * move the page tables downwards, on failure we rely on
616 * process cleanup to remove whatever mess we made.
618 if (length != move_page_tables(vma, old_start,
619 vma, new_start, length))
623 tlb_gather_mmu(&tlb, mm, 0);
624 if (new_end > old_start) {
626 * when the old and new regions overlap clear from new_end.
628 free_pgd_range(&tlb, new_end, old_end, new_end,
629 vma->vm_next ? vma->vm_next->vm_start : 0);
632 * otherwise, clean from old_start; this is done to not touch
633 * the address space in [new_end, old_start) some architectures
634 * have constraints on va-space that make this illegal (IA64) -
635 * for the others its just a little faster.
637 free_pgd_range(&tlb, old_start, old_end, new_end,
638 vma->vm_next ? vma->vm_next->vm_start : 0);
640 tlb_finish_mmu(&tlb, new_end, old_end);
643 * Shrink the vma to just the new range. Always succeeds.
645 vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL);
651 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
652 * the stack is optionally relocated, and some extra space is added.
654 int setup_arg_pages(struct linux_binprm *bprm,
655 unsigned long stack_top,
656 int executable_stack)
659 unsigned long stack_shift;
660 struct mm_struct *mm = current->mm;
661 struct vm_area_struct *vma = bprm->vma;
662 struct vm_area_struct *prev = NULL;
663 unsigned long vm_flags;
664 unsigned long stack_base;
665 unsigned long stack_size;
666 unsigned long stack_expand;
667 unsigned long rlim_stack;
669 #ifdef CONFIG_STACK_GROWSUP
670 /* Limit stack size to 1GB */
671 stack_base = rlimit_max(RLIMIT_STACK);
672 if (stack_base > (1 << 30))
673 stack_base = 1 << 30;
675 /* Make sure we didn't let the argument array grow too large. */
676 if (vma->vm_end - vma->vm_start > stack_base)
679 stack_base = PAGE_ALIGN(stack_top - stack_base);
681 stack_shift = vma->vm_start - stack_base;
682 mm->arg_start = bprm->p - stack_shift;
683 bprm->p = vma->vm_end - stack_shift;
685 stack_top = arch_align_stack(stack_top);
686 stack_top = PAGE_ALIGN(stack_top);
688 if (unlikely(stack_top < mmap_min_addr) ||
689 unlikely(vma->vm_end - vma->vm_start >= stack_top - mmap_min_addr))
692 stack_shift = vma->vm_end - stack_top;
694 bprm->p -= stack_shift;
695 mm->arg_start = bprm->p;
699 bprm->loader -= stack_shift;
700 bprm->exec -= stack_shift;
702 down_write(&mm->mmap_sem);
703 vm_flags = VM_STACK_FLAGS;
706 * Adjust stack execute permissions; explicitly enable for
707 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
708 * (arch default) otherwise.
710 if (unlikely(executable_stack == EXSTACK_ENABLE_X))
712 else if (executable_stack == EXSTACK_DISABLE_X)
713 vm_flags &= ~VM_EXEC;
714 vm_flags |= mm->def_flags;
715 vm_flags |= VM_STACK_INCOMPLETE_SETUP;
717 ret = mprotect_fixup(vma, &prev, vma->vm_start, vma->vm_end,
723 /* Move stack pages down in memory. */
725 ret = shift_arg_pages(vma, stack_shift);
730 /* mprotect_fixup is overkill to remove the temporary stack flags */
731 vma->vm_flags &= ~VM_STACK_INCOMPLETE_SETUP;
733 stack_expand = 131072UL; /* randomly 32*4k (or 2*64k) pages */
734 stack_size = vma->vm_end - vma->vm_start;
736 * Align this down to a page boundary as expand_stack
739 rlim_stack = rlimit(RLIMIT_STACK) & PAGE_MASK;
740 #ifdef CONFIG_STACK_GROWSUP
741 if (stack_size + stack_expand > rlim_stack)
742 stack_base = vma->vm_start + rlim_stack;
744 stack_base = vma->vm_end + stack_expand;
746 if (stack_size + stack_expand > rlim_stack)
747 stack_base = vma->vm_end - rlim_stack;
749 stack_base = vma->vm_start - stack_expand;
751 current->mm->start_stack = bprm->p;
752 ret = expand_stack(vma, stack_base);
757 up_write(&mm->mmap_sem);
760 EXPORT_SYMBOL(setup_arg_pages);
762 #endif /* CONFIG_MMU */
764 struct file *open_exec(const char *name)
768 static const struct open_flags open_exec_flags = {
769 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
770 .acc_mode = MAY_EXEC | MAY_OPEN,
771 .intent = LOOKUP_OPEN
774 file = do_filp_open(AT_FDCWD, name, &open_exec_flags, LOOKUP_FOLLOW);
779 if (!S_ISREG(file->f_path.dentry->d_inode->i_mode))
782 if (file->f_path.mnt->mnt_flags & MNT_NOEXEC)
787 err = deny_write_access(file);
798 EXPORT_SYMBOL(open_exec);
800 int kernel_read(struct file *file, loff_t offset,
801 char *addr, unsigned long count)
809 /* The cast to a user pointer is valid due to the set_fs() */
810 result = vfs_read(file, (void __user *)addr, count, &pos);
815 EXPORT_SYMBOL(kernel_read);
817 static int exec_mmap(struct mm_struct *mm)
819 struct task_struct *tsk;
820 struct mm_struct * old_mm, *active_mm;
822 /* Notify parent that we're no longer interested in the old VM */
824 old_mm = current->mm;
825 sync_mm_rss(tsk, old_mm);
826 mm_release(tsk, old_mm);
830 * Make sure that if there is a core dump in progress
831 * for the old mm, we get out and die instead of going
832 * through with the exec. We must hold mmap_sem around
833 * checking core_state and changing tsk->mm.
835 down_read(&old_mm->mmap_sem);
836 if (unlikely(old_mm->core_state)) {
837 up_read(&old_mm->mmap_sem);
842 active_mm = tsk->active_mm;
845 activate_mm(active_mm, mm);
847 arch_pick_mmap_layout(mm);
849 up_read(&old_mm->mmap_sem);
850 BUG_ON(active_mm != old_mm);
851 mm_update_next_owner(old_mm);
860 * This function makes sure the current process has its own signal table,
861 * so that flush_signal_handlers can later reset the handlers without
862 * disturbing other processes. (Other processes might share the signal
863 * table via the CLONE_SIGHAND option to clone().)
865 static int de_thread(struct task_struct *tsk)
867 struct signal_struct *sig = tsk->signal;
868 struct sighand_struct *oldsighand = tsk->sighand;
869 spinlock_t *lock = &oldsighand->siglock;
871 if (thread_group_empty(tsk))
872 goto no_thread_group;
875 * Kill all other threads in the thread group.
878 if (signal_group_exit(sig)) {
880 * Another group action in progress, just
881 * return so that the signal is processed.
883 spin_unlock_irq(lock);
887 sig->group_exit_task = tsk;
888 sig->notify_count = zap_other_threads(tsk);
889 if (!thread_group_leader(tsk))
892 while (sig->notify_count) {
893 __set_current_state(TASK_UNINTERRUPTIBLE);
894 spin_unlock_irq(lock);
898 spin_unlock_irq(lock);
901 * At this point all other threads have exited, all we have to
902 * do is to wait for the thread group leader to become inactive,
903 * and to assume its PID:
905 if (!thread_group_leader(tsk)) {
906 struct task_struct *leader = tsk->group_leader;
908 sig->notify_count = -1; /* for exit_notify() */
910 write_lock_irq(&tasklist_lock);
911 if (likely(leader->exit_state))
913 __set_current_state(TASK_UNINTERRUPTIBLE);
914 write_unlock_irq(&tasklist_lock);
919 * The only record we have of the real-time age of a
920 * process, regardless of execs it's done, is start_time.
921 * All the past CPU time is accumulated in signal_struct
922 * from sister threads now dead. But in this non-leader
923 * exec, nothing survives from the original leader thread,
924 * whose birth marks the true age of this process now.
925 * When we take on its identity by switching to its PID, we
926 * also take its birthdate (always earlier than our own).
928 tsk->start_time = leader->start_time;
930 BUG_ON(!same_thread_group(leader, tsk));
931 BUG_ON(has_group_leader_pid(tsk));
933 * An exec() starts a new thread group with the
934 * TGID of the previous thread group. Rehash the
935 * two threads with a switched PID, and release
936 * the former thread group leader:
939 /* Become a process group leader with the old leader's pid.
940 * The old leader becomes a thread of the this thread group.
941 * Note: The old leader also uses this pid until release_task
942 * is called. Odd but simple and correct.
944 detach_pid(tsk, PIDTYPE_PID);
945 tsk->pid = leader->pid;
946 attach_pid(tsk, PIDTYPE_PID, task_pid(leader));
947 transfer_pid(leader, tsk, PIDTYPE_PGID);
948 transfer_pid(leader, tsk, PIDTYPE_SID);
950 list_replace_rcu(&leader->tasks, &tsk->tasks);
951 list_replace_init(&leader->sibling, &tsk->sibling);
953 tsk->group_leader = tsk;
954 leader->group_leader = tsk;
956 tsk->exit_signal = SIGCHLD;
957 leader->exit_signal = -1;
959 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
960 leader->exit_state = EXIT_DEAD;
963 * We are going to release_task()->ptrace_unlink() silently,
964 * the tracer can sleep in do_wait(). EXIT_DEAD guarantees
965 * the tracer wont't block again waiting for this thread.
967 if (unlikely(leader->ptrace))
968 __wake_up_parent(leader, leader->parent);
969 write_unlock_irq(&tasklist_lock);
971 release_task(leader);
974 sig->group_exit_task = NULL;
975 sig->notify_count = 0;
979 setmax_mm_hiwater_rss(&sig->maxrss, current->mm);
982 flush_itimer_signals();
984 if (atomic_read(&oldsighand->count) != 1) {
985 struct sighand_struct *newsighand;
987 * This ->sighand is shared with the CLONE_SIGHAND
988 * but not CLONE_THREAD task, switch to the new one.
990 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
994 atomic_set(&newsighand->count, 1);
995 memcpy(newsighand->action, oldsighand->action,
996 sizeof(newsighand->action));
998 write_lock_irq(&tasklist_lock);
999 spin_lock(&oldsighand->siglock);
1000 rcu_assign_pointer(tsk->sighand, newsighand);
1001 spin_unlock(&oldsighand->siglock);
1002 write_unlock_irq(&tasklist_lock);
1004 __cleanup_sighand(oldsighand);
1007 BUG_ON(!thread_group_leader(tsk));
1012 * These functions flushes out all traces of the currently running executable
1013 * so that a new one can be started
1015 static void flush_old_files(struct files_struct * files)
1018 struct fdtable *fdt;
1020 spin_lock(&files->file_lock);
1022 unsigned long set, i;
1026 fdt = files_fdtable(files);
1027 if (i >= fdt->max_fds)
1029 set = fdt->close_on_exec->fds_bits[j];
1032 fdt->close_on_exec->fds_bits[j] = 0;
1033 spin_unlock(&files->file_lock);
1034 for ( ; set ; i++,set >>= 1) {
1039 spin_lock(&files->file_lock);
1042 spin_unlock(&files->file_lock);
1045 char *get_task_comm(char *buf, struct task_struct *tsk)
1047 /* buf must be at least sizeof(tsk->comm) in size */
1049 strncpy(buf, tsk->comm, sizeof(tsk->comm));
1053 EXPORT_SYMBOL_GPL(get_task_comm);
1055 void set_task_comm(struct task_struct *tsk, char *buf)
1059 trace_task_rename(tsk, buf);
1062 * Threads may access current->comm without holding
1063 * the task lock, so write the string carefully.
1064 * Readers without a lock may see incomplete new
1065 * names but are safe from non-terminating string reads.
1067 memset(tsk->comm, 0, TASK_COMM_LEN);
1069 strlcpy(tsk->comm, buf, sizeof(tsk->comm));
1071 perf_event_comm(tsk);
1074 static void filename_to_taskname(char *tcomm, const char *fn, unsigned int len)
1078 /* Copies the binary name from after last slash */
1079 for (i = 0; (ch = *(fn++)) != '\0';) {
1081 i = 0; /* overwrite what we wrote */
1089 int flush_old_exec(struct linux_binprm * bprm)
1094 * Make sure we have a private signal table and that
1095 * we are unassociated from the previous thread group.
1097 retval = de_thread(current);
1101 set_mm_exe_file(bprm->mm, bprm->file);
1103 filename_to_taskname(bprm->tcomm, bprm->filename, sizeof(bprm->tcomm));
1105 * Release all of the old mmap stuff
1107 acct_arg_size(bprm, 0);
1108 retval = exec_mmap(bprm->mm);
1112 bprm->mm = NULL; /* We're using it now */
1115 current->flags &= ~(PF_RANDOMIZE | PF_KTHREAD);
1117 current->personality &= ~bprm->per_clear;
1124 EXPORT_SYMBOL(flush_old_exec);
1126 void would_dump(struct linux_binprm *bprm, struct file *file)
1128 if (inode_permission(file->f_path.dentry->d_inode, MAY_READ) < 0)
1129 bprm->interp_flags |= BINPRM_FLAGS_ENFORCE_NONDUMP;
1131 EXPORT_SYMBOL(would_dump);
1133 void setup_new_exec(struct linux_binprm * bprm)
1135 arch_pick_mmap_layout(current->mm);
1137 /* This is the point of no return */
1138 current->sas_ss_sp = current->sas_ss_size = 0;
1140 if (current_euid() == current_uid() && current_egid() == current_gid())
1141 set_dumpable(current->mm, 1);
1143 set_dumpable(current->mm, suid_dumpable);
1145 set_task_comm(current, bprm->tcomm);
1147 /* Set the new mm task size. We have to do that late because it may
1148 * depend on TIF_32BIT which is only updated in flush_thread() on
1149 * some architectures like powerpc
1151 current->mm->task_size = TASK_SIZE;
1153 /* install the new credentials */
1154 if (bprm->cred->uid != current_euid() ||
1155 bprm->cred->gid != current_egid()) {
1156 current->pdeath_signal = 0;
1158 would_dump(bprm, bprm->file);
1159 if (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP)
1160 set_dumpable(current->mm, suid_dumpable);
1164 * Flush performance counters when crossing a
1167 if (!get_dumpable(current->mm))
1168 perf_event_exit_task(current);
1170 /* An exec changes our domain. We are no longer part of the thread
1173 current->self_exec_id++;
1175 flush_signal_handlers(current, 0);
1176 flush_old_files(current->files);
1178 EXPORT_SYMBOL(setup_new_exec);
1181 * Prepare credentials and lock ->cred_guard_mutex.
1182 * install_exec_creds() commits the new creds and drops the lock.
1183 * Or, if exec fails before, free_bprm() should release ->cred and
1186 int prepare_bprm_creds(struct linux_binprm *bprm)
1188 if (mutex_lock_interruptible(¤t->signal->cred_guard_mutex))
1189 return -ERESTARTNOINTR;
1191 bprm->cred = prepare_exec_creds();
1192 if (likely(bprm->cred))
1195 mutex_unlock(¤t->signal->cred_guard_mutex);
1199 void free_bprm(struct linux_binprm *bprm)
1201 free_arg_pages(bprm);
1203 mutex_unlock(¤t->signal->cred_guard_mutex);
1204 abort_creds(bprm->cred);
1210 * install the new credentials for this executable
1212 void install_exec_creds(struct linux_binprm *bprm)
1214 security_bprm_committing_creds(bprm);
1216 commit_creds(bprm->cred);
1219 * cred_guard_mutex must be held at least to this point to prevent
1220 * ptrace_attach() from altering our determination of the task's
1221 * credentials; any time after this it may be unlocked.
1223 security_bprm_committed_creds(bprm);
1224 mutex_unlock(¤t->signal->cred_guard_mutex);
1226 EXPORT_SYMBOL(install_exec_creds);
1229 * determine how safe it is to execute the proposed program
1230 * - the caller must hold ->cred_guard_mutex to protect against
1233 static int check_unsafe_exec(struct linux_binprm *bprm)
1235 struct task_struct *p = current, *t;
1240 if (p->ptrace & PT_PTRACE_CAP)
1241 bprm->unsafe |= LSM_UNSAFE_PTRACE_CAP;
1243 bprm->unsafe |= LSM_UNSAFE_PTRACE;
1247 spin_lock(&p->fs->lock);
1249 for (t = next_thread(p); t != p; t = next_thread(t)) {
1255 if (p->fs->users > n_fs) {
1256 bprm->unsafe |= LSM_UNSAFE_SHARE;
1259 if (!p->fs->in_exec) {
1264 spin_unlock(&p->fs->lock);
1270 * Fill the binprm structure from the inode.
1271 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
1273 * This may be called multiple times for binary chains (scripts for example).
1275 int prepare_binprm(struct linux_binprm *bprm)
1278 struct inode * inode = bprm->file->f_path.dentry->d_inode;
1281 mode = inode->i_mode;
1282 if (bprm->file->f_op == NULL)
1285 /* clear any previous set[ug]id data from a previous binary */
1286 bprm->cred->euid = current_euid();
1287 bprm->cred->egid = current_egid();
1289 if (!(bprm->file->f_path.mnt->mnt_flags & MNT_NOSUID)) {
1291 if (mode & S_ISUID) {
1292 bprm->per_clear |= PER_CLEAR_ON_SETID;
1293 bprm->cred->euid = inode->i_uid;
1298 * If setgid is set but no group execute bit then this
1299 * is a candidate for mandatory locking, not a setgid
1302 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1303 bprm->per_clear |= PER_CLEAR_ON_SETID;
1304 bprm->cred->egid = inode->i_gid;
1308 /* fill in binprm security blob */
1309 retval = security_bprm_set_creds(bprm);
1312 bprm->cred_prepared = 1;
1314 memset(bprm->buf, 0, BINPRM_BUF_SIZE);
1315 return kernel_read(bprm->file, 0, bprm->buf, BINPRM_BUF_SIZE);
1318 EXPORT_SYMBOL(prepare_binprm);
1321 * Arguments are '\0' separated strings found at the location bprm->p
1322 * points to; chop off the first by relocating brpm->p to right after
1323 * the first '\0' encountered.
1325 int remove_arg_zero(struct linux_binprm *bprm)
1328 unsigned long offset;
1336 offset = bprm->p & ~PAGE_MASK;
1337 page = get_arg_page(bprm, bprm->p, 0);
1342 kaddr = kmap_atomic(page, KM_USER0);
1344 for (; offset < PAGE_SIZE && kaddr[offset];
1345 offset++, bprm->p++)
1348 kunmap_atomic(kaddr, KM_USER0);
1351 if (offset == PAGE_SIZE)
1352 free_arg_page(bprm, (bprm->p >> PAGE_SHIFT) - 1);
1353 } while (offset == PAGE_SIZE);
1362 EXPORT_SYMBOL(remove_arg_zero);
1365 * cycle the list of binary formats handler, until one recognizes the image
1367 int search_binary_handler(struct linux_binprm *bprm,struct pt_regs *regs)
1369 unsigned int depth = bprm->recursion_depth;
1371 struct linux_binfmt *fmt;
1374 retval = security_bprm_check(bprm);
1378 retval = audit_bprm(bprm);
1382 /* Need to fetch pid before load_binary changes it */
1384 old_pid = task_pid_nr_ns(current, task_active_pid_ns(current->parent));
1388 for (try=0; try<2; try++) {
1389 read_lock(&binfmt_lock);
1390 list_for_each_entry(fmt, &formats, lh) {
1391 int (*fn)(struct linux_binprm *, struct pt_regs *) = fmt->load_binary;
1394 if (!try_module_get(fmt->module))
1396 read_unlock(&binfmt_lock);
1397 retval = fn(bprm, regs);
1399 * Restore the depth counter to its starting value
1400 * in this call, so we don't have to rely on every
1401 * load_binary function to restore it on return.
1403 bprm->recursion_depth = depth;
1406 ptrace_event(PTRACE_EVENT_EXEC,
1409 allow_write_access(bprm->file);
1413 current->did_exec = 1;
1414 proc_exec_connector(current);
1417 read_lock(&binfmt_lock);
1419 if (retval != -ENOEXEC || bprm->mm == NULL)
1422 read_unlock(&binfmt_lock);
1426 read_unlock(&binfmt_lock);
1427 #ifdef CONFIG_MODULES
1428 if (retval != -ENOEXEC || bprm->mm == NULL) {
1431 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1432 if (printable(bprm->buf[0]) &&
1433 printable(bprm->buf[1]) &&
1434 printable(bprm->buf[2]) &&
1435 printable(bprm->buf[3]))
1436 break; /* -ENOEXEC */
1438 break; /* -ENOEXEC */
1439 request_module("binfmt-%04x", *(unsigned short *)(&bprm->buf[2]));
1448 EXPORT_SYMBOL(search_binary_handler);
1451 * sys_execve() executes a new program.
1453 static int do_execve_common(const char *filename,
1454 struct user_arg_ptr argv,
1455 struct user_arg_ptr envp,
1456 struct pt_regs *regs)
1458 struct linux_binprm *bprm;
1460 struct files_struct *displaced;
1463 const struct cred *cred = current_cred();
1466 * We move the actual failure in case of RLIMIT_NPROC excess from
1467 * set*uid() to execve() because too many poorly written programs
1468 * don't check setuid() return code. Here we additionally recheck
1469 * whether NPROC limit is still exceeded.
1471 if ((current->flags & PF_NPROC_EXCEEDED) &&
1472 atomic_read(&cred->user->processes) > rlimit(RLIMIT_NPROC)) {
1477 /* We're below the limit (still or again), so we don't want to make
1478 * further execve() calls fail. */
1479 current->flags &= ~PF_NPROC_EXCEEDED;
1481 retval = unshare_files(&displaced);
1486 bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1490 retval = prepare_bprm_creds(bprm);
1494 retval = check_unsafe_exec(bprm);
1497 clear_in_exec = retval;
1498 current->in_execve = 1;
1500 file = open_exec(filename);
1501 retval = PTR_ERR(file);
1508 bprm->filename = filename;
1509 bprm->interp = filename;
1511 retval = bprm_mm_init(bprm);
1515 bprm->argc = count(argv, MAX_ARG_STRINGS);
1516 if ((retval = bprm->argc) < 0)
1519 bprm->envc = count(envp, MAX_ARG_STRINGS);
1520 if ((retval = bprm->envc) < 0)
1523 retval = prepare_binprm(bprm);
1527 retval = copy_strings_kernel(1, &bprm->filename, bprm);
1531 bprm->exec = bprm->p;
1532 retval = copy_strings(bprm->envc, envp, bprm);
1536 retval = copy_strings(bprm->argc, argv, bprm);
1540 retval = search_binary_handler(bprm,regs);
1544 /* execve succeeded */
1545 current->fs->in_exec = 0;
1546 current->in_execve = 0;
1547 acct_update_integrals(current);
1550 put_files_struct(displaced);
1555 acct_arg_size(bprm, 0);
1561 allow_write_access(bprm->file);
1567 current->fs->in_exec = 0;
1568 current->in_execve = 0;
1575 reset_files_struct(displaced);
1580 int do_execve(const char *filename,
1581 const char __user *const __user *__argv,
1582 const char __user *const __user *__envp,
1583 struct pt_regs *regs)
1585 struct user_arg_ptr argv = { .ptr.native = __argv };
1586 struct user_arg_ptr envp = { .ptr.native = __envp };
1587 return do_execve_common(filename, argv, envp, regs);
1590 #ifdef CONFIG_COMPAT
1591 int compat_do_execve(char *filename,
1592 compat_uptr_t __user *__argv,
1593 compat_uptr_t __user *__envp,
1594 struct pt_regs *regs)
1596 struct user_arg_ptr argv = {
1598 .ptr.compat = __argv,
1600 struct user_arg_ptr envp = {
1602 .ptr.compat = __envp,
1604 return do_execve_common(filename, argv, envp, regs);
1608 void set_binfmt(struct linux_binfmt *new)
1610 struct mm_struct *mm = current->mm;
1613 module_put(mm->binfmt->module);
1617 __module_get(new->module);
1620 EXPORT_SYMBOL(set_binfmt);
1622 static int expand_corename(struct core_name *cn)
1624 char *old_corename = cn->corename;
1626 cn->size = CORENAME_MAX_SIZE * atomic_inc_return(&call_count);
1627 cn->corename = krealloc(old_corename, cn->size, GFP_KERNEL);
1629 if (!cn->corename) {
1630 kfree(old_corename);
1637 static int cn_printf(struct core_name *cn, const char *fmt, ...)
1645 need = vsnprintf(NULL, 0, fmt, arg);
1648 if (likely(need < cn->size - cn->used - 1))
1651 ret = expand_corename(cn);
1656 cur = cn->corename + cn->used;
1658 vsnprintf(cur, need + 1, fmt, arg);
1667 static void cn_escape(char *str)
1674 static int cn_print_exe_file(struct core_name *cn)
1676 struct file *exe_file;
1677 char *pathbuf, *path;
1680 exe_file = get_mm_exe_file(current->mm);
1682 char *commstart = cn->corename + cn->used;
1683 ret = cn_printf(cn, "%s (path unknown)", current->comm);
1684 cn_escape(commstart);
1688 pathbuf = kmalloc(PATH_MAX, GFP_TEMPORARY);
1694 path = d_path(&exe_file->f_path, pathbuf, PATH_MAX);
1696 ret = PTR_ERR(path);
1702 ret = cn_printf(cn, "%s", path);
1711 /* format_corename will inspect the pattern parameter, and output a
1712 * name into corename, which must have space for at least
1713 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1715 static int format_corename(struct core_name *cn, long signr)
1717 const struct cred *cred = current_cred();
1718 const char *pat_ptr = core_pattern;
1719 int ispipe = (*pat_ptr == '|');
1720 int pid_in_pattern = 0;
1723 cn->size = CORENAME_MAX_SIZE * atomic_read(&call_count);
1724 cn->corename = kmalloc(cn->size, GFP_KERNEL);
1730 /* Repeat as long as we have more pattern to process and more output
1733 if (*pat_ptr != '%') {
1736 err = cn_printf(cn, "%c", *pat_ptr++);
1738 switch (*++pat_ptr) {
1739 /* single % at the end, drop that */
1742 /* Double percent, output one percent */
1744 err = cn_printf(cn, "%c", '%');
1749 err = cn_printf(cn, "%d",
1750 task_tgid_vnr(current));
1754 err = cn_printf(cn, "%d", cred->uid);
1758 err = cn_printf(cn, "%d", cred->gid);
1760 /* signal that caused the coredump */
1762 err = cn_printf(cn, "%ld", signr);
1764 /* UNIX time of coredump */
1767 do_gettimeofday(&tv);
1768 err = cn_printf(cn, "%lu", tv.tv_sec);
1773 char *namestart = cn->corename + cn->used;
1774 down_read(&uts_sem);
1775 err = cn_printf(cn, "%s",
1776 utsname()->nodename);
1778 cn_escape(namestart);
1783 char *commstart = cn->corename + cn->used;
1784 err = cn_printf(cn, "%s", current->comm);
1785 cn_escape(commstart);
1789 err = cn_print_exe_file(cn);
1791 /* core limit size */
1793 err = cn_printf(cn, "%lu",
1794 rlimit(RLIMIT_CORE));
1806 /* Backward compatibility with core_uses_pid:
1808 * If core_pattern does not include a %p (as is the default)
1809 * and core_uses_pid is set, then .%pid will be appended to
1810 * the filename. Do not do this for piped commands. */
1811 if (!ispipe && !pid_in_pattern && core_uses_pid) {
1812 err = cn_printf(cn, ".%d", task_tgid_vnr(current));
1820 static int zap_process(struct task_struct *start, int exit_code)
1822 struct task_struct *t;
1825 start->signal->flags = SIGNAL_GROUP_EXIT;
1826 start->signal->group_exit_code = exit_code;
1827 start->signal->group_stop_count = 0;
1831 task_clear_jobctl_pending(t, JOBCTL_PENDING_MASK);
1832 if (t != current && t->mm) {
1833 sigaddset(&t->pending.signal, SIGKILL);
1834 signal_wake_up(t, 1);
1837 } while_each_thread(start, t);
1842 static inline int zap_threads(struct task_struct *tsk, struct mm_struct *mm,
1843 struct core_state *core_state, int exit_code)
1845 struct task_struct *g, *p;
1846 unsigned long flags;
1849 spin_lock_irq(&tsk->sighand->siglock);
1850 if (!signal_group_exit(tsk->signal)) {
1851 mm->core_state = core_state;
1852 nr = zap_process(tsk, exit_code);
1854 spin_unlock_irq(&tsk->sighand->siglock);
1855 if (unlikely(nr < 0))
1858 if (atomic_read(&mm->mm_users) == nr + 1)
1861 * We should find and kill all tasks which use this mm, and we should
1862 * count them correctly into ->nr_threads. We don't take tasklist
1863 * lock, but this is safe wrt:
1866 * None of sub-threads can fork after zap_process(leader). All
1867 * processes which were created before this point should be
1868 * visible to zap_threads() because copy_process() adds the new
1869 * process to the tail of init_task.tasks list, and lock/unlock
1870 * of ->siglock provides a memory barrier.
1873 * The caller holds mm->mmap_sem. This means that the task which
1874 * uses this mm can't pass exit_mm(), so it can't exit or clear
1878 * It does list_replace_rcu(&leader->tasks, ¤t->tasks),
1879 * we must see either old or new leader, this does not matter.
1880 * However, it can change p->sighand, so lock_task_sighand(p)
1881 * must be used. Since p->mm != NULL and we hold ->mmap_sem
1884 * Note also that "g" can be the old leader with ->mm == NULL
1885 * and already unhashed and thus removed from ->thread_group.
1886 * This is OK, __unhash_process()->list_del_rcu() does not
1887 * clear the ->next pointer, we will find the new leader via
1891 for_each_process(g) {
1892 if (g == tsk->group_leader)
1894 if (g->flags & PF_KTHREAD)
1899 if (unlikely(p->mm == mm)) {
1900 lock_task_sighand(p, &flags);
1901 nr += zap_process(p, exit_code);
1902 unlock_task_sighand(p, &flags);
1906 } while_each_thread(g, p);
1910 atomic_set(&core_state->nr_threads, nr);
1914 static int coredump_wait(int exit_code, struct core_state *core_state)
1916 struct task_struct *tsk = current;
1917 struct mm_struct *mm = tsk->mm;
1918 int core_waiters = -EBUSY;
1920 init_completion(&core_state->startup);
1921 core_state->dumper.task = tsk;
1922 core_state->dumper.next = NULL;
1924 down_write(&mm->mmap_sem);
1925 if (!mm->core_state)
1926 core_waiters = zap_threads(tsk, mm, core_state, exit_code);
1927 up_write(&mm->mmap_sem);
1929 if (unlikely(core_waiters < 0))
1933 * Make sure nobody is waiting for us to release the VM,
1934 * otherwise we can deadlock when we wait on each other
1936 if (tsk->vfork_done)
1937 complete_vfork_done(tsk);
1940 wait_for_completion(&core_state->startup);
1942 return core_waiters;
1945 static void coredump_finish(struct mm_struct *mm)
1947 struct core_thread *curr, *next;
1948 struct task_struct *task;
1950 next = mm->core_state->dumper.next;
1951 while ((curr = next) != NULL) {
1955 * see exit_mm(), curr->task must not see
1956 * ->task == NULL before we read ->next.
1960 wake_up_process(task);
1963 mm->core_state = NULL;
1967 * set_dumpable converts traditional three-value dumpable to two flags and
1968 * stores them into mm->flags. It modifies lower two bits of mm->flags, but
1969 * these bits are not changed atomically. So get_dumpable can observe the
1970 * intermediate state. To avoid doing unexpected behavior, get get_dumpable
1971 * return either old dumpable or new one by paying attention to the order of
1972 * modifying the bits.
1974 * dumpable | mm->flags (binary)
1975 * old new | initial interim final
1976 * ---------+-----------------------
1984 * (*) get_dumpable regards interim value of 10 as 11.
1986 void set_dumpable(struct mm_struct *mm, int value)
1990 clear_bit(MMF_DUMPABLE, &mm->flags);
1992 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1995 set_bit(MMF_DUMPABLE, &mm->flags);
1997 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
2000 set_bit(MMF_DUMP_SECURELY, &mm->flags);
2002 set_bit(MMF_DUMPABLE, &mm->flags);
2007 static int __get_dumpable(unsigned long mm_flags)
2011 ret = mm_flags & MMF_DUMPABLE_MASK;
2012 return (ret >= 2) ? 2 : ret;
2015 int get_dumpable(struct mm_struct *mm)
2017 return __get_dumpable(mm->flags);
2020 static void wait_for_dump_helpers(struct file *file)
2022 struct pipe_inode_info *pipe;
2024 pipe = file->f_path.dentry->d_inode->i_pipe;
2030 while ((pipe->readers > 1) && (!signal_pending(current))) {
2031 wake_up_interruptible_sync(&pipe->wait);
2032 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
2045 * helper function to customize the process used
2046 * to collect the core in userspace. Specifically
2047 * it sets up a pipe and installs it as fd 0 (stdin)
2048 * for the process. Returns 0 on success, or
2049 * PTR_ERR on failure.
2050 * Note that it also sets the core limit to 1. This
2051 * is a special value that we use to trap recursive
2054 static int umh_pipe_setup(struct subprocess_info *info, struct cred *new)
2056 struct file *rp, *wp;
2057 struct fdtable *fdt;
2058 struct coredump_params *cp = (struct coredump_params *)info->data;
2059 struct files_struct *cf = current->files;
2061 wp = create_write_pipe(0);
2065 rp = create_read_pipe(wp, 0);
2067 free_write_pipe(wp);
2075 spin_lock(&cf->file_lock);
2076 fdt = files_fdtable(cf);
2077 FD_SET(0, fdt->open_fds);
2078 FD_CLR(0, fdt->close_on_exec);
2079 spin_unlock(&cf->file_lock);
2081 /* and disallow core files too */
2082 current->signal->rlim[RLIMIT_CORE] = (struct rlimit){1, 1};
2087 void do_coredump(long signr, int exit_code, struct pt_regs *regs)
2089 struct core_state core_state;
2090 struct core_name cn;
2091 struct mm_struct *mm = current->mm;
2092 struct linux_binfmt * binfmt;
2093 const struct cred *old_cred;
2098 static atomic_t core_dump_count = ATOMIC_INIT(0);
2099 struct coredump_params cprm = {
2102 .limit = rlimit(RLIMIT_CORE),
2104 * We must use the same mm->flags while dumping core to avoid
2105 * inconsistency of bit flags, since this flag is not protected
2108 .mm_flags = mm->flags,
2111 audit_core_dumps(signr);
2113 binfmt = mm->binfmt;
2114 if (!binfmt || !binfmt->core_dump)
2116 if (!__get_dumpable(cprm.mm_flags))
2119 cred = prepare_creds();
2123 * We cannot trust fsuid as being the "true" uid of the
2124 * process nor do we know its entire history. We only know it
2125 * was tainted so we dump it as root in mode 2.
2127 if (__get_dumpable(cprm.mm_flags) == 2) {
2128 /* Setuid core dump mode */
2129 flag = O_EXCL; /* Stop rewrite attacks */
2130 cred->fsuid = 0; /* Dump root private */
2133 retval = coredump_wait(exit_code, &core_state);
2137 old_cred = override_creds(cred);
2140 * Clear any false indication of pending signals that might
2141 * be seen by the filesystem code called to write the core file.
2143 clear_thread_flag(TIF_SIGPENDING);
2145 ispipe = format_corename(&cn, signr);
2152 printk(KERN_WARNING "format_corename failed\n");
2153 printk(KERN_WARNING "Aborting core\n");
2157 if (cprm.limit == 1) {
2159 * Normally core limits are irrelevant to pipes, since
2160 * we're not writing to the file system, but we use
2161 * cprm.limit of 1 here as a speacial value. Any
2162 * non-1 limit gets set to RLIM_INFINITY below, but
2163 * a limit of 0 skips the dump. This is a consistent
2164 * way to catch recursive crashes. We can still crash
2165 * if the core_pattern binary sets RLIM_CORE = !1
2166 * but it runs as root, and can do lots of stupid things
2167 * Note that we use task_tgid_vnr here to grab the pid
2168 * of the process group leader. That way we get the
2169 * right pid if a thread in a multi-threaded
2170 * core_pattern process dies.
2173 "Process %d(%s) has RLIMIT_CORE set to 1\n",
2174 task_tgid_vnr(current), current->comm);
2175 printk(KERN_WARNING "Aborting core\n");
2178 cprm.limit = RLIM_INFINITY;
2180 dump_count = atomic_inc_return(&core_dump_count);
2181 if (core_pipe_limit && (core_pipe_limit < dump_count)) {
2182 printk(KERN_WARNING "Pid %d(%s) over core_pipe_limit\n",
2183 task_tgid_vnr(current), current->comm);
2184 printk(KERN_WARNING "Skipping core dump\n");
2185 goto fail_dropcount;
2188 helper_argv = argv_split(GFP_KERNEL, cn.corename+1, NULL);
2190 printk(KERN_WARNING "%s failed to allocate memory\n",
2192 goto fail_dropcount;
2195 retval = call_usermodehelper_fns(helper_argv[0], helper_argv,
2196 NULL, UMH_WAIT_EXEC, umh_pipe_setup,
2198 argv_free(helper_argv);
2200 printk(KERN_INFO "Core dump to %s pipe failed\n",
2205 struct inode *inode;
2207 if (cprm.limit < binfmt->min_coredump)
2210 cprm.file = filp_open(cn.corename,
2211 O_CREAT | 2 | O_NOFOLLOW | O_LARGEFILE | flag,
2213 if (IS_ERR(cprm.file))
2216 inode = cprm.file->f_path.dentry->d_inode;
2217 if (inode->i_nlink > 1)
2219 if (d_unhashed(cprm.file->f_path.dentry))
2222 * AK: actually i see no reason to not allow this for named
2223 * pipes etc, but keep the previous behaviour for now.
2225 if (!S_ISREG(inode->i_mode))
2228 * Dont allow local users get cute and trick others to coredump
2229 * into their pre-created files.
2231 if (inode->i_uid != current_fsuid())
2233 if (!cprm.file->f_op || !cprm.file->f_op->write)
2235 if (do_truncate(cprm.file->f_path.dentry, 0, 0, cprm.file))
2239 retval = binfmt->core_dump(&cprm);
2241 current->signal->group_exit_code |= 0x80;
2243 if (ispipe && core_pipe_limit)
2244 wait_for_dump_helpers(cprm.file);
2247 filp_close(cprm.file, NULL);
2250 atomic_dec(&core_dump_count);
2254 coredump_finish(mm);
2255 revert_creds(old_cred);
2263 * Core dumping helper functions. These are the only things you should
2264 * do on a core-file: use only these functions to write out all the
2267 int dump_write(struct file *file, const void *addr, int nr)
2269 return access_ok(VERIFY_READ, addr, nr) && file->f_op->write(file, addr, nr, &file->f_pos) == nr;
2271 EXPORT_SYMBOL(dump_write);
2273 int dump_seek(struct file *file, loff_t off)
2277 if (file->f_op->llseek && file->f_op->llseek != no_llseek) {
2278 if (file->f_op->llseek(file, off, SEEK_CUR) < 0)
2281 char *buf = (char *)get_zeroed_page(GFP_KERNEL);
2286 unsigned long n = off;
2290 if (!dump_write(file, buf, n)) {
2296 free_page((unsigned long)buf);
2300 EXPORT_SYMBOL(dump_seek);