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/mman.h>
28 #include <linux/a.out.h>
29 #include <linux/stat.h>
30 #include <linux/fcntl.h>
31 #include <linux/smp_lock.h>
32 #include <linux/string.h>
33 #include <linux/init.h>
34 #include <linux/pagemap.h>
35 #include <linux/highmem.h>
36 #include <linux/spinlock.h>
37 #include <linux/key.h>
38 #include <linux/personality.h>
39 #include <linux/binfmts.h>
40 #include <linux/swap.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/proc_fs.h>
46 #include <linux/ptrace.h>
47 #include <linux/mount.h>
48 #include <linux/security.h>
49 #include <linux/syscalls.h>
50 #include <linux/rmap.h>
51 #include <linux/tsacct_kern.h>
52 #include <linux/cn_proc.h>
53 #include <linux/audit.h>
55 #include <asm/uaccess.h>
56 #include <asm/mmu_context.h>
60 #include <linux/kmod.h>
64 char core_pattern[CORENAME_MAX_SIZE] = "core";
65 int suid_dumpable = 0;
67 /* The maximal length of core_pattern is also specified in sysctl.c */
69 static LIST_HEAD(formats);
70 static DEFINE_RWLOCK(binfmt_lock);
72 int register_binfmt(struct linux_binfmt * fmt)
76 write_lock(&binfmt_lock);
77 list_add(&fmt->lh, &formats);
78 write_unlock(&binfmt_lock);
82 EXPORT_SYMBOL(register_binfmt);
84 void unregister_binfmt(struct linux_binfmt * fmt)
86 write_lock(&binfmt_lock);
88 write_unlock(&binfmt_lock);
91 EXPORT_SYMBOL(unregister_binfmt);
93 static inline void put_binfmt(struct linux_binfmt * fmt)
95 module_put(fmt->module);
99 * Note that a shared library must be both readable and executable due to
102 * Also note that we take the address to load from from the file itself.
104 asmlinkage long sys_uselib(const char __user * library)
110 error = __user_path_lookup_open(library, LOOKUP_FOLLOW, &nd, FMODE_READ|FMODE_EXEC);
115 if (!S_ISREG(nd.dentry->d_inode->i_mode))
118 error = vfs_permission(&nd, MAY_READ | MAY_EXEC);
122 file = nameidata_to_filp(&nd, O_RDONLY);
123 error = PTR_ERR(file);
129 struct linux_binfmt * fmt;
131 read_lock(&binfmt_lock);
132 list_for_each_entry(fmt, &formats, lh) {
133 if (!fmt->load_shlib)
135 if (!try_module_get(fmt->module))
137 read_unlock(&binfmt_lock);
138 error = fmt->load_shlib(file);
139 read_lock(&binfmt_lock);
141 if (error != -ENOEXEC)
144 read_unlock(&binfmt_lock);
150 release_open_intent(&nd);
157 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
163 #ifdef CONFIG_STACK_GROWSUP
165 ret = expand_stack_downwards(bprm->vma, pos);
170 ret = get_user_pages(current, bprm->mm, pos,
171 1, write, 1, &page, NULL);
176 struct rlimit *rlim = current->signal->rlim;
177 unsigned long size = bprm->vma->vm_end - bprm->vma->vm_start;
180 * Limit to 1/4-th the stack size for the argv+env strings.
182 * - the remaining binfmt code will not run out of stack space,
183 * - the program will have a reasonable amount of stack left
186 if (size > rlim[RLIMIT_STACK].rlim_cur / 4) {
195 static void put_arg_page(struct page *page)
200 static void free_arg_page(struct linux_binprm *bprm, int i)
204 static void free_arg_pages(struct linux_binprm *bprm)
208 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
211 flush_cache_page(bprm->vma, pos, page_to_pfn(page));
214 static int __bprm_mm_init(struct linux_binprm *bprm)
217 struct vm_area_struct *vma = NULL;
218 struct mm_struct *mm = bprm->mm;
220 bprm->vma = vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
224 down_write(&mm->mmap_sem);
228 * Place the stack at the largest stack address the architecture
229 * supports. Later, we'll move this to an appropriate place. We don't
230 * use STACK_TOP because that can depend on attributes which aren't
233 vma->vm_end = STACK_TOP_MAX;
234 vma->vm_start = vma->vm_end - PAGE_SIZE;
236 vma->vm_flags = VM_STACK_FLAGS;
237 vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
238 err = insert_vm_struct(mm, vma);
240 up_write(&mm->mmap_sem);
244 mm->stack_vm = mm->total_vm = 1;
245 up_write(&mm->mmap_sem);
247 bprm->p = vma->vm_end - sizeof(void *);
254 kmem_cache_free(vm_area_cachep, vma);
260 static bool valid_arg_len(struct linux_binprm *bprm, long len)
262 return len <= MAX_ARG_STRLEN;
267 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
272 page = bprm->page[pos / PAGE_SIZE];
273 if (!page && write) {
274 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
277 bprm->page[pos / PAGE_SIZE] = page;
283 static void put_arg_page(struct page *page)
287 static void free_arg_page(struct linux_binprm *bprm, int i)
290 __free_page(bprm->page[i]);
291 bprm->page[i] = NULL;
295 static void free_arg_pages(struct linux_binprm *bprm)
299 for (i = 0; i < MAX_ARG_PAGES; i++)
300 free_arg_page(bprm, i);
303 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
308 static int __bprm_mm_init(struct linux_binprm *bprm)
310 bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
314 static bool valid_arg_len(struct linux_binprm *bprm, long len)
316 return len <= bprm->p;
319 #endif /* CONFIG_MMU */
322 * Create a new mm_struct and populate it with a temporary stack
323 * vm_area_struct. We don't have enough context at this point to set the stack
324 * flags, permissions, and offset, so we use temporary values. We'll update
325 * them later in setup_arg_pages().
327 int bprm_mm_init(struct linux_binprm *bprm)
330 struct mm_struct *mm = NULL;
332 bprm->mm = mm = mm_alloc();
337 err = init_new_context(current, mm);
341 err = __bprm_mm_init(bprm);
357 * count() counts the number of strings in array ARGV.
359 static int count(char __user * __user * argv, int max)
367 if (get_user(p, argv))
381 * 'copy_strings()' copies argument/environment strings from the old
382 * processes's memory to the new process's stack. The call to get_user_pages()
383 * ensures the destination page is created and not swapped out.
385 static int copy_strings(int argc, char __user * __user * argv,
386 struct linux_binprm *bprm)
388 struct page *kmapped_page = NULL;
390 unsigned long kpos = 0;
398 if (get_user(str, argv+argc) ||
399 !(len = strnlen_user(str, MAX_ARG_STRLEN))) {
404 if (!valid_arg_len(bprm, len)) {
409 /* We're going to work our way backwords. */
415 int offset, bytes_to_copy;
417 offset = pos % PAGE_SIZE;
421 bytes_to_copy = offset;
422 if (bytes_to_copy > len)
425 offset -= bytes_to_copy;
426 pos -= bytes_to_copy;
427 str -= bytes_to_copy;
428 len -= bytes_to_copy;
430 if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
433 page = get_arg_page(bprm, pos, 1);
440 flush_kernel_dcache_page(kmapped_page);
441 kunmap(kmapped_page);
442 put_arg_page(kmapped_page);
445 kaddr = kmap(kmapped_page);
446 kpos = pos & PAGE_MASK;
447 flush_arg_page(bprm, kpos, kmapped_page);
449 if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
458 flush_kernel_dcache_page(kmapped_page);
459 kunmap(kmapped_page);
460 put_arg_page(kmapped_page);
466 * Like copy_strings, but get argv and its values from kernel memory.
468 int copy_strings_kernel(int argc,char ** argv, struct linux_binprm *bprm)
471 mm_segment_t oldfs = get_fs();
473 r = copy_strings(argc, (char __user * __user *)argv, bprm);
477 EXPORT_SYMBOL(copy_strings_kernel);
482 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
483 * the binfmt code determines where the new stack should reside, we shift it to
484 * its final location. The process proceeds as follows:
486 * 1) Use shift to calculate the new vma endpoints.
487 * 2) Extend vma to cover both the old and new ranges. This ensures the
488 * arguments passed to subsequent functions are consistent.
489 * 3) Move vma's page tables to the new range.
490 * 4) Free up any cleared pgd range.
491 * 5) Shrink the vma to cover only the new range.
493 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
495 struct mm_struct *mm = vma->vm_mm;
496 unsigned long old_start = vma->vm_start;
497 unsigned long old_end = vma->vm_end;
498 unsigned long length = old_end - old_start;
499 unsigned long new_start = old_start - shift;
500 unsigned long new_end = old_end - shift;
501 struct mmu_gather *tlb;
503 BUG_ON(new_start > new_end);
506 * ensure there are no vmas between where we want to go
509 if (vma != find_vma(mm, new_start))
513 * cover the whole range: [new_start, old_end)
515 vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL);
518 * move the page tables downwards, on failure we rely on
519 * process cleanup to remove whatever mess we made.
521 if (length != move_page_tables(vma, old_start,
522 vma, new_start, length))
526 tlb = tlb_gather_mmu(mm, 0);
527 if (new_end > old_start) {
529 * when the old and new regions overlap clear from new_end.
531 free_pgd_range(&tlb, new_end, old_end, new_end,
532 vma->vm_next ? vma->vm_next->vm_start : 0);
535 * otherwise, clean from old_start; this is done to not touch
536 * the address space in [new_end, old_start) some architectures
537 * have constraints on va-space that make this illegal (IA64) -
538 * for the others its just a little faster.
540 free_pgd_range(&tlb, old_start, old_end, new_end,
541 vma->vm_next ? vma->vm_next->vm_start : 0);
543 tlb_finish_mmu(tlb, new_end, old_end);
546 * shrink the vma to just the new range.
548 vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL);
553 #define EXTRA_STACK_VM_PAGES 20 /* random */
556 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
557 * the stack is optionally relocated, and some extra space is added.
559 int setup_arg_pages(struct linux_binprm *bprm,
560 unsigned long stack_top,
561 int executable_stack)
564 unsigned long stack_shift;
565 struct mm_struct *mm = current->mm;
566 struct vm_area_struct *vma = bprm->vma;
567 struct vm_area_struct *prev = NULL;
568 unsigned long vm_flags;
569 unsigned long stack_base;
571 #ifdef CONFIG_STACK_GROWSUP
572 /* Limit stack size to 1GB */
573 stack_base = current->signal->rlim[RLIMIT_STACK].rlim_max;
574 if (stack_base > (1 << 30))
575 stack_base = 1 << 30;
577 /* Make sure we didn't let the argument array grow too large. */
578 if (vma->vm_end - vma->vm_start > stack_base)
581 stack_base = PAGE_ALIGN(stack_top - stack_base);
583 stack_shift = vma->vm_start - stack_base;
584 mm->arg_start = bprm->p - stack_shift;
585 bprm->p = vma->vm_end - stack_shift;
587 stack_top = arch_align_stack(stack_top);
588 stack_top = PAGE_ALIGN(stack_top);
589 stack_shift = vma->vm_end - stack_top;
591 bprm->p -= stack_shift;
592 mm->arg_start = bprm->p;
596 bprm->loader -= stack_shift;
597 bprm->exec -= stack_shift;
599 down_write(&mm->mmap_sem);
600 vm_flags = vma->vm_flags;
603 * Adjust stack execute permissions; explicitly enable for
604 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
605 * (arch default) otherwise.
607 if (unlikely(executable_stack == EXSTACK_ENABLE_X))
609 else if (executable_stack == EXSTACK_DISABLE_X)
610 vm_flags &= ~VM_EXEC;
611 vm_flags |= mm->def_flags;
613 ret = mprotect_fixup(vma, &prev, vma->vm_start, vma->vm_end,
619 /* Move stack pages down in memory. */
621 ret = shift_arg_pages(vma, stack_shift);
623 up_write(&mm->mmap_sem);
628 #ifdef CONFIG_STACK_GROWSUP
629 stack_base = vma->vm_end + EXTRA_STACK_VM_PAGES * PAGE_SIZE;
631 stack_base = vma->vm_start - EXTRA_STACK_VM_PAGES * PAGE_SIZE;
633 ret = expand_stack(vma, stack_base);
638 up_write(&mm->mmap_sem);
641 EXPORT_SYMBOL(setup_arg_pages);
643 #endif /* CONFIG_MMU */
645 struct file *open_exec(const char *name)
651 err = path_lookup_open(AT_FDCWD, name, LOOKUP_FOLLOW, &nd, FMODE_READ|FMODE_EXEC);
655 struct inode *inode = nd.dentry->d_inode;
656 file = ERR_PTR(-EACCES);
657 if (S_ISREG(inode->i_mode)) {
658 int err = vfs_permission(&nd, MAY_EXEC);
661 file = nameidata_to_filp(&nd, O_RDONLY);
663 err = deny_write_access(file);
673 release_open_intent(&nd);
679 EXPORT_SYMBOL(open_exec);
681 int kernel_read(struct file *file, unsigned long offset,
682 char *addr, unsigned long count)
690 /* The cast to a user pointer is valid due to the set_fs() */
691 result = vfs_read(file, (void __user *)addr, count, &pos);
696 EXPORT_SYMBOL(kernel_read);
698 static int exec_mmap(struct mm_struct *mm)
700 struct task_struct *tsk;
701 struct mm_struct * old_mm, *active_mm;
703 /* Notify parent that we're no longer interested in the old VM */
705 old_mm = current->mm;
706 mm_release(tsk, old_mm);
710 * Make sure that if there is a core dump in progress
711 * for the old mm, we get out and die instead of going
712 * through with the exec. We must hold mmap_sem around
713 * checking core_waiters and changing tsk->mm. The
714 * core-inducing thread will increment core_waiters for
715 * each thread whose ->mm == old_mm.
717 down_read(&old_mm->mmap_sem);
718 if (unlikely(old_mm->core_waiters)) {
719 up_read(&old_mm->mmap_sem);
724 active_mm = tsk->active_mm;
727 activate_mm(active_mm, mm);
729 arch_pick_mmap_layout(mm);
731 up_read(&old_mm->mmap_sem);
732 BUG_ON(active_mm != old_mm);
741 * This function makes sure the current process has its own signal table,
742 * so that flush_signal_handlers can later reset the handlers without
743 * disturbing other processes. (Other processes might share the signal
744 * table via the CLONE_SIGHAND option to clone().)
746 static int de_thread(struct task_struct *tsk)
748 struct signal_struct *sig = tsk->signal;
749 struct sighand_struct *oldsighand = tsk->sighand;
750 spinlock_t *lock = &oldsighand->siglock;
751 struct task_struct *leader = NULL;
754 if (thread_group_empty(tsk))
755 goto no_thread_group;
758 * Kill all other threads in the thread group.
759 * We must hold tasklist_lock to call zap_other_threads.
761 read_lock(&tasklist_lock);
763 if (signal_group_exit(sig)) {
765 * Another group action in progress, just
766 * return so that the signal is processed.
768 spin_unlock_irq(lock);
769 read_unlock(&tasklist_lock);
774 * child_reaper ignores SIGKILL, change it now.
775 * Reparenting needs write_lock on tasklist_lock,
776 * so it is safe to do it under read_lock.
778 if (unlikely(tsk->group_leader == task_child_reaper(tsk)))
779 task_active_pid_ns(tsk)->child_reaper = tsk;
781 sig->group_exit_task = tsk;
782 zap_other_threads(tsk);
783 read_unlock(&tasklist_lock);
785 /* Account for the thread group leader hanging around: */
786 count = thread_group_leader(tsk) ? 1 : 2;
787 sig->notify_count = count;
788 while (atomic_read(&sig->count) > count) {
789 __set_current_state(TASK_UNINTERRUPTIBLE);
790 spin_unlock_irq(lock);
794 spin_unlock_irq(lock);
797 * At this point all other threads have exited, all we have to
798 * do is to wait for the thread group leader to become inactive,
799 * and to assume its PID:
801 if (!thread_group_leader(tsk)) {
802 leader = tsk->group_leader;
804 sig->notify_count = -1;
806 write_lock_irq(&tasklist_lock);
807 if (likely(leader->exit_state))
809 __set_current_state(TASK_UNINTERRUPTIBLE);
810 write_unlock_irq(&tasklist_lock);
815 * The only record we have of the real-time age of a
816 * process, regardless of execs it's done, is start_time.
817 * All the past CPU time is accumulated in signal_struct
818 * from sister threads now dead. But in this non-leader
819 * exec, nothing survives from the original leader thread,
820 * whose birth marks the true age of this process now.
821 * When we take on its identity by switching to its PID, we
822 * also take its birthdate (always earlier than our own).
824 tsk->start_time = leader->start_time;
826 BUG_ON(!same_thread_group(leader, tsk));
827 BUG_ON(has_group_leader_pid(tsk));
829 * An exec() starts a new thread group with the
830 * TGID of the previous thread group. Rehash the
831 * two threads with a switched PID, and release
832 * the former thread group leader:
835 /* Become a process group leader with the old leader's pid.
836 * The old leader becomes a thread of the this thread group.
837 * Note: The old leader also uses this pid until release_task
838 * is called. Odd but simple and correct.
840 detach_pid(tsk, PIDTYPE_PID);
841 tsk->pid = leader->pid;
842 attach_pid(tsk, PIDTYPE_PID, task_pid(leader));
843 transfer_pid(leader, tsk, PIDTYPE_PGID);
844 transfer_pid(leader, tsk, PIDTYPE_SID);
845 list_replace_rcu(&leader->tasks, &tsk->tasks);
847 tsk->group_leader = tsk;
848 leader->group_leader = tsk;
850 tsk->exit_signal = SIGCHLD;
852 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
853 leader->exit_state = EXIT_DEAD;
855 write_unlock_irq(&tasklist_lock);
858 sig->group_exit_task = NULL;
859 sig->notify_count = 0;
864 release_task(leader);
866 if (atomic_read(&oldsighand->count) != 1) {
867 struct sighand_struct *newsighand;
869 * This ->sighand is shared with the CLONE_SIGHAND
870 * but not CLONE_THREAD task, switch to the new one.
872 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
876 atomic_set(&newsighand->count, 1);
877 memcpy(newsighand->action, oldsighand->action,
878 sizeof(newsighand->action));
880 write_lock_irq(&tasklist_lock);
881 spin_lock(&oldsighand->siglock);
882 rcu_assign_pointer(tsk->sighand, newsighand);
883 spin_unlock(&oldsighand->siglock);
884 write_unlock_irq(&tasklist_lock);
886 __cleanup_sighand(oldsighand);
889 BUG_ON(!thread_group_leader(tsk));
894 * These functions flushes out all traces of the currently running executable
895 * so that a new one can be started
897 static void flush_old_files(struct files_struct * files)
902 spin_lock(&files->file_lock);
904 unsigned long set, i;
908 fdt = files_fdtable(files);
909 if (i >= fdt->max_fds)
911 set = fdt->close_on_exec->fds_bits[j];
914 fdt->close_on_exec->fds_bits[j] = 0;
915 spin_unlock(&files->file_lock);
916 for ( ; set ; i++,set >>= 1) {
921 spin_lock(&files->file_lock);
924 spin_unlock(&files->file_lock);
927 char *get_task_comm(char *buf, struct task_struct *tsk)
929 /* buf must be at least sizeof(tsk->comm) in size */
931 strncpy(buf, tsk->comm, sizeof(tsk->comm));
936 void set_task_comm(struct task_struct *tsk, char *buf)
939 strlcpy(tsk->comm, buf, sizeof(tsk->comm));
943 int flush_old_exec(struct linux_binprm * bprm)
947 struct files_struct *files;
948 char tcomm[sizeof(current->comm)];
951 * Make sure we have a private signal table and that
952 * we are unassociated from the previous thread group.
954 retval = de_thread(current);
959 * Make sure we have private file handles. Ask the
960 * fork helper to do the work for us and the exit
961 * helper to do the cleanup of the old one.
963 files = current->files; /* refcounted so safe to hold */
964 retval = unshare_files();
968 * Release all of the old mmap stuff
970 retval = exec_mmap(bprm->mm);
974 bprm->mm = NULL; /* We're using it now */
976 /* This is the point of no return */
977 put_files_struct(files);
979 current->sas_ss_sp = current->sas_ss_size = 0;
981 if (current->euid == current->uid && current->egid == current->gid)
982 set_dumpable(current->mm, 1);
984 set_dumpable(current->mm, suid_dumpable);
986 name = bprm->filename;
988 /* Copies the binary name from after last slash */
989 for (i=0; (ch = *(name++)) != '\0';) {
991 i = 0; /* overwrite what we wrote */
993 if (i < (sizeof(tcomm) - 1))
997 set_task_comm(current, tcomm);
999 current->flags &= ~PF_RANDOMIZE;
1002 /* Set the new mm task size. We have to do that late because it may
1003 * depend on TIF_32BIT which is only updated in flush_thread() on
1004 * some architectures like powerpc
1006 current->mm->task_size = TASK_SIZE;
1008 if (bprm->e_uid != current->euid || bprm->e_gid != current->egid) {
1010 set_dumpable(current->mm, suid_dumpable);
1011 current->pdeath_signal = 0;
1012 } else if (file_permission(bprm->file, MAY_READ) ||
1013 (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP)) {
1015 set_dumpable(current->mm, suid_dumpable);
1018 /* An exec changes our domain. We are no longer part of the thread
1021 current->self_exec_id++;
1023 flush_signal_handlers(current, 0);
1024 flush_old_files(current->files);
1029 reset_files_struct(current, files);
1034 EXPORT_SYMBOL(flush_old_exec);
1037 * Fill the binprm structure from the inode.
1038 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
1040 int prepare_binprm(struct linux_binprm *bprm)
1043 struct inode * inode = bprm->file->f_path.dentry->d_inode;
1046 mode = inode->i_mode;
1047 if (bprm->file->f_op == NULL)
1050 bprm->e_uid = current->euid;
1051 bprm->e_gid = current->egid;
1053 if(!(bprm->file->f_path.mnt->mnt_flags & MNT_NOSUID)) {
1055 if (mode & S_ISUID) {
1056 current->personality &= ~PER_CLEAR_ON_SETID;
1057 bprm->e_uid = inode->i_uid;
1062 * If setgid is set but no group execute bit then this
1063 * is a candidate for mandatory locking, not a setgid
1066 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1067 current->personality &= ~PER_CLEAR_ON_SETID;
1068 bprm->e_gid = inode->i_gid;
1072 /* fill in binprm security blob */
1073 retval = security_bprm_set(bprm);
1077 memset(bprm->buf,0,BINPRM_BUF_SIZE);
1078 return kernel_read(bprm->file,0,bprm->buf,BINPRM_BUF_SIZE);
1081 EXPORT_SYMBOL(prepare_binprm);
1083 static int unsafe_exec(struct task_struct *p)
1086 if (p->ptrace & PT_PTRACED) {
1087 if (p->ptrace & PT_PTRACE_CAP)
1088 unsafe |= LSM_UNSAFE_PTRACE_CAP;
1090 unsafe |= LSM_UNSAFE_PTRACE;
1092 if (atomic_read(&p->fs->count) > 1 ||
1093 atomic_read(&p->files->count) > 1 ||
1094 atomic_read(&p->sighand->count) > 1)
1095 unsafe |= LSM_UNSAFE_SHARE;
1100 void compute_creds(struct linux_binprm *bprm)
1104 if (bprm->e_uid != current->uid) {
1106 current->pdeath_signal = 0;
1111 unsafe = unsafe_exec(current);
1112 security_bprm_apply_creds(bprm, unsafe);
1113 task_unlock(current);
1114 security_bprm_post_apply_creds(bprm);
1116 EXPORT_SYMBOL(compute_creds);
1119 * Arguments are '\0' separated strings found at the location bprm->p
1120 * points to; chop off the first by relocating brpm->p to right after
1121 * the first '\0' encountered.
1123 int remove_arg_zero(struct linux_binprm *bprm)
1126 unsigned long offset;
1134 offset = bprm->p & ~PAGE_MASK;
1135 page = get_arg_page(bprm, bprm->p, 0);
1140 kaddr = kmap_atomic(page, KM_USER0);
1142 for (; offset < PAGE_SIZE && kaddr[offset];
1143 offset++, bprm->p++)
1146 kunmap_atomic(kaddr, KM_USER0);
1149 if (offset == PAGE_SIZE)
1150 free_arg_page(bprm, (bprm->p >> PAGE_SHIFT) - 1);
1151 } while (offset == PAGE_SIZE);
1160 EXPORT_SYMBOL(remove_arg_zero);
1163 * cycle the list of binary formats handler, until one recognizes the image
1165 int search_binary_handler(struct linux_binprm *bprm,struct pt_regs *regs)
1168 struct linux_binfmt *fmt;
1170 /* handle /sbin/loader.. */
1172 struct exec * eh = (struct exec *) bprm->buf;
1174 if (!bprm->loader && eh->fh.f_magic == 0x183 &&
1175 (eh->fh.f_flags & 0x3000) == 0x3000)
1178 unsigned long loader;
1180 allow_write_access(bprm->file);
1184 loader = bprm->vma->vm_end - sizeof(void *);
1186 file = open_exec("/sbin/loader");
1187 retval = PTR_ERR(file);
1191 /* Remember if the application is TASO. */
1192 bprm->sh_bang = eh->ah.entry < 0x100000000UL;
1195 bprm->loader = loader;
1196 retval = prepare_binprm(bprm);
1199 /* should call search_binary_handler recursively here,
1200 but it does not matter */
1204 retval = security_bprm_check(bprm);
1208 /* kernel module loader fixup */
1209 /* so we don't try to load run modprobe in kernel space. */
1212 retval = audit_bprm(bprm);
1217 for (try=0; try<2; try++) {
1218 read_lock(&binfmt_lock);
1219 list_for_each_entry(fmt, &formats, lh) {
1220 int (*fn)(struct linux_binprm *, struct pt_regs *) = fmt->load_binary;
1223 if (!try_module_get(fmt->module))
1225 read_unlock(&binfmt_lock);
1226 retval = fn(bprm, regs);
1229 allow_write_access(bprm->file);
1233 current->did_exec = 1;
1234 proc_exec_connector(current);
1237 read_lock(&binfmt_lock);
1239 if (retval != -ENOEXEC || bprm->mm == NULL)
1242 read_unlock(&binfmt_lock);
1246 read_unlock(&binfmt_lock);
1247 if (retval != -ENOEXEC || bprm->mm == NULL) {
1251 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1252 if (printable(bprm->buf[0]) &&
1253 printable(bprm->buf[1]) &&
1254 printable(bprm->buf[2]) &&
1255 printable(bprm->buf[3]))
1256 break; /* -ENOEXEC */
1257 request_module("binfmt-%04x", *(unsigned short *)(&bprm->buf[2]));
1264 EXPORT_SYMBOL(search_binary_handler);
1267 * sys_execve() executes a new program.
1269 int do_execve(char * filename,
1270 char __user *__user *argv,
1271 char __user *__user *envp,
1272 struct pt_regs * regs)
1274 struct linux_binprm *bprm;
1276 unsigned long env_p;
1280 bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1284 file = open_exec(filename);
1285 retval = PTR_ERR(file);
1292 bprm->filename = filename;
1293 bprm->interp = filename;
1295 retval = bprm_mm_init(bprm);
1299 bprm->argc = count(argv, MAX_ARG_STRINGS);
1300 if ((retval = bprm->argc) < 0)
1303 bprm->envc = count(envp, MAX_ARG_STRINGS);
1304 if ((retval = bprm->envc) < 0)
1307 retval = security_bprm_alloc(bprm);
1311 retval = prepare_binprm(bprm);
1315 retval = copy_strings_kernel(1, &bprm->filename, bprm);
1319 bprm->exec = bprm->p;
1320 retval = copy_strings(bprm->envc, envp, bprm);
1325 retval = copy_strings(bprm->argc, argv, bprm);
1328 bprm->argv_len = env_p - bprm->p;
1330 retval = search_binary_handler(bprm,regs);
1332 /* execve success */
1333 free_arg_pages(bprm);
1334 security_bprm_free(bprm);
1335 acct_update_integrals(current);
1341 free_arg_pages(bprm);
1343 security_bprm_free(bprm);
1351 allow_write_access(bprm->file);
1361 int set_binfmt(struct linux_binfmt *new)
1363 struct linux_binfmt *old = current->binfmt;
1366 if (!try_module_get(new->module))
1369 current->binfmt = new;
1371 module_put(old->module);
1375 EXPORT_SYMBOL(set_binfmt);
1377 /* format_corename will inspect the pattern parameter, and output a
1378 * name into corename, which must have space for at least
1379 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1381 static int format_corename(char *corename, const char *pattern, long signr)
1383 const char *pat_ptr = pattern;
1384 char *out_ptr = corename;
1385 char *const out_end = corename + CORENAME_MAX_SIZE;
1387 int pid_in_pattern = 0;
1390 if (*pattern == '|')
1393 /* Repeat as long as we have more pattern to process and more output
1396 if (*pat_ptr != '%') {
1397 if (out_ptr == out_end)
1399 *out_ptr++ = *pat_ptr++;
1401 switch (*++pat_ptr) {
1404 /* Double percent, output one percent */
1406 if (out_ptr == out_end)
1413 rc = snprintf(out_ptr, out_end - out_ptr,
1414 "%d", task_tgid_vnr(current));
1415 if (rc > out_end - out_ptr)
1421 rc = snprintf(out_ptr, out_end - out_ptr,
1422 "%d", current->uid);
1423 if (rc > out_end - out_ptr)
1429 rc = snprintf(out_ptr, out_end - out_ptr,
1430 "%d", current->gid);
1431 if (rc > out_end - out_ptr)
1435 /* signal that caused the coredump */
1437 rc = snprintf(out_ptr, out_end - out_ptr,
1439 if (rc > out_end - out_ptr)
1443 /* UNIX time of coredump */
1446 do_gettimeofday(&tv);
1447 rc = snprintf(out_ptr, out_end - out_ptr,
1449 if (rc > out_end - out_ptr)
1456 down_read(&uts_sem);
1457 rc = snprintf(out_ptr, out_end - out_ptr,
1458 "%s", utsname()->nodename);
1460 if (rc > out_end - out_ptr)
1466 rc = snprintf(out_ptr, out_end - out_ptr,
1467 "%s", current->comm);
1468 if (rc > out_end - out_ptr)
1472 /* core limit size */
1474 rc = snprintf(out_ptr, out_end - out_ptr,
1475 "%lu", current->signal->rlim[RLIMIT_CORE].rlim_cur);
1476 if (rc > out_end - out_ptr)
1486 /* Backward compatibility with core_uses_pid:
1488 * If core_pattern does not include a %p (as is the default)
1489 * and core_uses_pid is set, then .%pid will be appended to
1490 * the filename. Do not do this for piped commands. */
1491 if (!ispipe && !pid_in_pattern
1492 && (core_uses_pid || atomic_read(¤t->mm->mm_users) != 1)) {
1493 rc = snprintf(out_ptr, out_end - out_ptr,
1494 ".%d", task_tgid_vnr(current));
1495 if (rc > out_end - out_ptr)
1504 static void zap_process(struct task_struct *start)
1506 struct task_struct *t;
1508 start->signal->flags = SIGNAL_GROUP_EXIT;
1509 start->signal->group_stop_count = 0;
1513 if (t != current && t->mm) {
1514 t->mm->core_waiters++;
1515 sigaddset(&t->pending.signal, SIGKILL);
1516 signal_wake_up(t, 1);
1518 } while ((t = next_thread(t)) != start);
1521 static inline int zap_threads(struct task_struct *tsk, struct mm_struct *mm,
1524 struct task_struct *g, *p;
1525 unsigned long flags;
1528 spin_lock_irq(&tsk->sighand->siglock);
1529 if (!signal_group_exit(tsk->signal)) {
1530 tsk->signal->group_exit_code = exit_code;
1534 spin_unlock_irq(&tsk->sighand->siglock);
1538 if (atomic_read(&mm->mm_users) == mm->core_waiters + 1)
1542 for_each_process(g) {
1543 if (g == tsk->group_leader)
1551 * p->sighand can't disappear, but
1552 * may be changed by de_thread()
1554 lock_task_sighand(p, &flags);
1556 unlock_task_sighand(p, &flags);
1560 } while ((p = next_thread(p)) != g);
1564 return mm->core_waiters;
1567 static int coredump_wait(int exit_code)
1569 struct task_struct *tsk = current;
1570 struct mm_struct *mm = tsk->mm;
1571 struct completion startup_done;
1572 struct completion *vfork_done;
1575 init_completion(&mm->core_done);
1576 init_completion(&startup_done);
1577 mm->core_startup_done = &startup_done;
1579 core_waiters = zap_threads(tsk, mm, exit_code);
1580 up_write(&mm->mmap_sem);
1582 if (unlikely(core_waiters < 0))
1586 * Make sure nobody is waiting for us to release the VM,
1587 * otherwise we can deadlock when we wait on each other
1589 vfork_done = tsk->vfork_done;
1591 tsk->vfork_done = NULL;
1592 complete(vfork_done);
1596 wait_for_completion(&startup_done);
1598 BUG_ON(mm->core_waiters);
1599 return core_waiters;
1603 * set_dumpable converts traditional three-value dumpable to two flags and
1604 * stores them into mm->flags. It modifies lower two bits of mm->flags, but
1605 * these bits are not changed atomically. So get_dumpable can observe the
1606 * intermediate state. To avoid doing unexpected behavior, get get_dumpable
1607 * return either old dumpable or new one by paying attention to the order of
1608 * modifying the bits.
1610 * dumpable | mm->flags (binary)
1611 * old new | initial interim final
1612 * ---------+-----------------------
1620 * (*) get_dumpable regards interim value of 10 as 11.
1622 void set_dumpable(struct mm_struct *mm, int value)
1626 clear_bit(MMF_DUMPABLE, &mm->flags);
1628 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1631 set_bit(MMF_DUMPABLE, &mm->flags);
1633 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1636 set_bit(MMF_DUMP_SECURELY, &mm->flags);
1638 set_bit(MMF_DUMPABLE, &mm->flags);
1643 int get_dumpable(struct mm_struct *mm)
1647 ret = mm->flags & 0x3;
1648 return (ret >= 2) ? 2 : ret;
1651 int do_coredump(long signr, int exit_code, struct pt_regs * regs)
1653 char corename[CORENAME_MAX_SIZE + 1];
1654 struct mm_struct *mm = current->mm;
1655 struct linux_binfmt * binfmt;
1656 struct inode * inode;
1659 int fsuid = current->fsuid;
1662 unsigned long core_limit = current->signal->rlim[RLIMIT_CORE].rlim_cur;
1663 char **helper_argv = NULL;
1664 int helper_argc = 0;
1667 audit_core_dumps(signr);
1669 binfmt = current->binfmt;
1670 if (!binfmt || !binfmt->core_dump)
1672 down_write(&mm->mmap_sem);
1674 * If another thread got here first, or we are not dumpable, bail out.
1676 if (mm->core_waiters || !get_dumpable(mm)) {
1677 up_write(&mm->mmap_sem);
1682 * We cannot trust fsuid as being the "true" uid of the
1683 * process nor do we know its entire history. We only know it
1684 * was tainted so we dump it as root in mode 2.
1686 if (get_dumpable(mm) == 2) { /* Setuid core dump mode */
1687 flag = O_EXCL; /* Stop rewrite attacks */
1688 current->fsuid = 0; /* Dump root private */
1691 retval = coredump_wait(exit_code);
1696 * Clear any false indication of pending signals that might
1697 * be seen by the filesystem code called to write the core file.
1699 clear_thread_flag(TIF_SIGPENDING);
1702 * lock_kernel() because format_corename() is controlled by sysctl, which
1703 * uses lock_kernel()
1706 ispipe = format_corename(corename, core_pattern, signr);
1709 * Don't bother to check the RLIMIT_CORE value if core_pattern points
1710 * to a pipe. Since we're not writing directly to the filesystem
1711 * RLIMIT_CORE doesn't really apply, as no actual core file will be
1712 * created unless the pipe reader choses to write out the core file
1713 * at which point file size limits and permissions will be imposed
1714 * as it does with any other process
1716 if ((!ispipe) && (core_limit < binfmt->min_coredump))
1720 helper_argv = argv_split(GFP_KERNEL, corename+1, &helper_argc);
1721 /* Terminate the string before the first option */
1722 delimit = strchr(corename, ' ');
1725 delimit = strrchr(helper_argv[0], '/');
1729 delimit = helper_argv[0];
1730 if (!strcmp(delimit, current->comm)) {
1731 printk(KERN_NOTICE "Recursive core dump detected, "
1736 core_limit = RLIM_INFINITY;
1738 /* SIGPIPE can happen, but it's just never processed */
1739 if (call_usermodehelper_pipe(corename+1, helper_argv, NULL,
1741 printk(KERN_INFO "Core dump to %s pipe failed\n",
1746 file = filp_open(corename,
1747 O_CREAT | 2 | O_NOFOLLOW | O_LARGEFILE | flag,
1751 inode = file->f_path.dentry->d_inode;
1752 if (inode->i_nlink > 1)
1753 goto close_fail; /* multiple links - don't dump */
1754 if (!ispipe && d_unhashed(file->f_path.dentry))
1757 /* AK: actually i see no reason to not allow this for named pipes etc.,
1758 but keep the previous behaviour for now. */
1759 if (!ispipe && !S_ISREG(inode->i_mode))
1762 * Dont allow local users get cute and trick others to coredump
1763 * into their pre-created files:
1765 if (inode->i_uid != current->fsuid)
1769 if (!file->f_op->write)
1771 if (!ispipe && do_truncate(file->f_path.dentry, 0, 0, file) != 0)
1774 retval = binfmt->core_dump(signr, regs, file, core_limit);
1777 current->signal->group_exit_code |= 0x80;
1779 filp_close(file, NULL);
1782 argv_free(helper_argv);
1784 current->fsuid = fsuid;
1785 complete_all(&mm->core_done);