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 EXPORT_SYMBOL(suid_dumpable
);
68 /* The maximal length of core_pattern is also specified in sysctl.c */
70 static LIST_HEAD(formats
);
71 static DEFINE_RWLOCK(binfmt_lock
);
73 int register_binfmt(struct linux_binfmt
* fmt
)
77 write_lock(&binfmt_lock
);
78 list_add(&fmt
->lh
, &formats
);
79 write_unlock(&binfmt_lock
);
83 EXPORT_SYMBOL(register_binfmt
);
85 void unregister_binfmt(struct linux_binfmt
* fmt
)
87 write_lock(&binfmt_lock
);
89 write_unlock(&binfmt_lock
);
92 EXPORT_SYMBOL(unregister_binfmt
);
94 static inline void put_binfmt(struct linux_binfmt
* fmt
)
96 module_put(fmt
->module
);
100 * Note that a shared library must be both readable and executable due to
103 * Also note that we take the address to load from from the file itself.
105 asmlinkage
long sys_uselib(const char __user
* library
)
111 error
= __user_path_lookup_open(library
, LOOKUP_FOLLOW
, &nd
, FMODE_READ
|FMODE_EXEC
);
116 if (!S_ISREG(nd
.dentry
->d_inode
->i_mode
))
119 error
= vfs_permission(&nd
, MAY_READ
| MAY_EXEC
);
123 file
= nameidata_to_filp(&nd
, O_RDONLY
);
124 error
= PTR_ERR(file
);
130 struct linux_binfmt
* fmt
;
132 read_lock(&binfmt_lock
);
133 list_for_each_entry(fmt
, &formats
, lh
) {
134 if (!fmt
->load_shlib
)
136 if (!try_module_get(fmt
->module
))
138 read_unlock(&binfmt_lock
);
139 error
= fmt
->load_shlib(file
);
140 read_lock(&binfmt_lock
);
142 if (error
!= -ENOEXEC
)
145 read_unlock(&binfmt_lock
);
151 release_open_intent(&nd
);
158 static struct page
*get_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
164 #ifdef CONFIG_STACK_GROWSUP
166 ret
= expand_stack_downwards(bprm
->vma
, pos
);
171 ret
= get_user_pages(current
, bprm
->mm
, pos
,
172 1, write
, 1, &page
, NULL
);
177 struct rlimit
*rlim
= current
->signal
->rlim
;
178 unsigned long size
= bprm
->vma
->vm_end
- bprm
->vma
->vm_start
;
181 * Limit to 1/4-th the stack size for the argv+env strings.
183 * - the remaining binfmt code will not run out of stack space,
184 * - the program will have a reasonable amount of stack left
187 if (size
> rlim
[RLIMIT_STACK
].rlim_cur
/ 4) {
196 static void put_arg_page(struct page
*page
)
201 static void free_arg_page(struct linux_binprm
*bprm
, int i
)
205 static void free_arg_pages(struct linux_binprm
*bprm
)
209 static void flush_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
212 flush_cache_page(bprm
->vma
, pos
, page_to_pfn(page
));
215 static int __bprm_mm_init(struct linux_binprm
*bprm
)
218 struct vm_area_struct
*vma
= NULL
;
219 struct mm_struct
*mm
= bprm
->mm
;
221 bprm
->vma
= vma
= kmem_cache_zalloc(vm_area_cachep
, GFP_KERNEL
);
225 down_write(&mm
->mmap_sem
);
229 * Place the stack at the largest stack address the architecture
230 * supports. Later, we'll move this to an appropriate place. We don't
231 * use STACK_TOP because that can depend on attributes which aren't
234 vma
->vm_end
= STACK_TOP_MAX
;
235 vma
->vm_start
= vma
->vm_end
- PAGE_SIZE
;
237 vma
->vm_flags
= VM_STACK_FLAGS
;
238 vma
->vm_page_prot
= protection_map
[vma
->vm_flags
& 0x7];
239 err
= insert_vm_struct(mm
, vma
);
241 up_write(&mm
->mmap_sem
);
245 mm
->stack_vm
= mm
->total_vm
= 1;
246 up_write(&mm
->mmap_sem
);
248 bprm
->p
= vma
->vm_end
- sizeof(void *);
255 kmem_cache_free(vm_area_cachep
, vma
);
261 static bool valid_arg_len(struct linux_binprm
*bprm
, long len
)
263 return len
<= MAX_ARG_STRLEN
;
268 static struct page
*get_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
273 page
= bprm
->page
[pos
/ PAGE_SIZE
];
274 if (!page
&& write
) {
275 page
= alloc_page(GFP_HIGHUSER
|__GFP_ZERO
);
278 bprm
->page
[pos
/ PAGE_SIZE
] = page
;
284 static void put_arg_page(struct page
*page
)
288 static void free_arg_page(struct linux_binprm
*bprm
, int i
)
291 __free_page(bprm
->page
[i
]);
292 bprm
->page
[i
] = NULL
;
296 static void free_arg_pages(struct linux_binprm
*bprm
)
300 for (i
= 0; i
< MAX_ARG_PAGES
; i
++)
301 free_arg_page(bprm
, i
);
304 static void flush_arg_page(struct linux_binprm
*bprm
, unsigned long pos
,
309 static int __bprm_mm_init(struct linux_binprm
*bprm
)
311 bprm
->p
= PAGE_SIZE
* MAX_ARG_PAGES
- sizeof(void *);
315 static bool valid_arg_len(struct linux_binprm
*bprm
, long len
)
317 return len
<= bprm
->p
;
320 #endif /* CONFIG_MMU */
323 * Create a new mm_struct and populate it with a temporary stack
324 * vm_area_struct. We don't have enough context at this point to set the stack
325 * flags, permissions, and offset, so we use temporary values. We'll update
326 * them later in setup_arg_pages().
328 int bprm_mm_init(struct linux_binprm
*bprm
)
331 struct mm_struct
*mm
= NULL
;
333 bprm
->mm
= mm
= mm_alloc();
338 err
= init_new_context(current
, mm
);
342 err
= __bprm_mm_init(bprm
);
358 * count() counts the number of strings in array ARGV.
360 static int count(char __user
* __user
* argv
, int max
)
368 if (get_user(p
, argv
))
382 * 'copy_strings()' copies argument/environment strings from the old
383 * processes's memory to the new process's stack. The call to get_user_pages()
384 * ensures the destination page is created and not swapped out.
386 static int copy_strings(int argc
, char __user
* __user
* argv
,
387 struct linux_binprm
*bprm
)
389 struct page
*kmapped_page
= NULL
;
391 unsigned long kpos
= 0;
399 if (get_user(str
, argv
+argc
) ||
400 !(len
= strnlen_user(str
, MAX_ARG_STRLEN
))) {
405 if (!valid_arg_len(bprm
, len
)) {
410 /* We're going to work our way backwords. */
416 int offset
, bytes_to_copy
;
418 offset
= pos
% PAGE_SIZE
;
422 bytes_to_copy
= offset
;
423 if (bytes_to_copy
> len
)
426 offset
-= bytes_to_copy
;
427 pos
-= bytes_to_copy
;
428 str
-= bytes_to_copy
;
429 len
-= bytes_to_copy
;
431 if (!kmapped_page
|| kpos
!= (pos
& PAGE_MASK
)) {
434 page
= get_arg_page(bprm
, pos
, 1);
441 flush_kernel_dcache_page(kmapped_page
);
442 kunmap(kmapped_page
);
443 put_arg_page(kmapped_page
);
446 kaddr
= kmap(kmapped_page
);
447 kpos
= pos
& PAGE_MASK
;
448 flush_arg_page(bprm
, kpos
, kmapped_page
);
450 if (copy_from_user(kaddr
+offset
, str
, bytes_to_copy
)) {
459 flush_kernel_dcache_page(kmapped_page
);
460 kunmap(kmapped_page
);
461 put_arg_page(kmapped_page
);
467 * Like copy_strings, but get argv and its values from kernel memory.
469 int copy_strings_kernel(int argc
,char ** argv
, struct linux_binprm
*bprm
)
472 mm_segment_t oldfs
= get_fs();
474 r
= copy_strings(argc
, (char __user
* __user
*)argv
, bprm
);
478 EXPORT_SYMBOL(copy_strings_kernel
);
483 * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once
484 * the binfmt code determines where the new stack should reside, we shift it to
485 * its final location. The process proceeds as follows:
487 * 1) Use shift to calculate the new vma endpoints.
488 * 2) Extend vma to cover both the old and new ranges. This ensures the
489 * arguments passed to subsequent functions are consistent.
490 * 3) Move vma's page tables to the new range.
491 * 4) Free up any cleared pgd range.
492 * 5) Shrink the vma to cover only the new range.
494 static int shift_arg_pages(struct vm_area_struct
*vma
, unsigned long shift
)
496 struct mm_struct
*mm
= vma
->vm_mm
;
497 unsigned long old_start
= vma
->vm_start
;
498 unsigned long old_end
= vma
->vm_end
;
499 unsigned long length
= old_end
- old_start
;
500 unsigned long new_start
= old_start
- shift
;
501 unsigned long new_end
= old_end
- shift
;
502 struct mmu_gather
*tlb
;
504 BUG_ON(new_start
> new_end
);
507 * ensure there are no vmas between where we want to go
510 if (vma
!= find_vma(mm
, new_start
))
514 * cover the whole range: [new_start, old_end)
516 vma_adjust(vma
, new_start
, old_end
, vma
->vm_pgoff
, NULL
);
519 * move the page tables downwards, on failure we rely on
520 * process cleanup to remove whatever mess we made.
522 if (length
!= move_page_tables(vma
, old_start
,
523 vma
, new_start
, length
))
527 tlb
= tlb_gather_mmu(mm
, 0);
528 if (new_end
> old_start
) {
530 * when the old and new regions overlap clear from new_end.
532 free_pgd_range(&tlb
, new_end
, old_end
, new_end
,
533 vma
->vm_next
? vma
->vm_next
->vm_start
: 0);
536 * otherwise, clean from old_start; this is done to not touch
537 * the address space in [new_end, old_start) some architectures
538 * have constraints on va-space that make this illegal (IA64) -
539 * for the others its just a little faster.
541 free_pgd_range(&tlb
, old_start
, old_end
, new_end
,
542 vma
->vm_next
? vma
->vm_next
->vm_start
: 0);
544 tlb_finish_mmu(tlb
, new_end
, old_end
);
547 * shrink the vma to just the new range.
549 vma_adjust(vma
, new_start
, new_end
, vma
->vm_pgoff
, NULL
);
554 #define EXTRA_STACK_VM_PAGES 20 /* random */
557 * Finalizes the stack vm_area_struct. The flags and permissions are updated,
558 * the stack is optionally relocated, and some extra space is added.
560 int setup_arg_pages(struct linux_binprm
*bprm
,
561 unsigned long stack_top
,
562 int executable_stack
)
565 unsigned long stack_shift
;
566 struct mm_struct
*mm
= current
->mm
;
567 struct vm_area_struct
*vma
= bprm
->vma
;
568 struct vm_area_struct
*prev
= NULL
;
569 unsigned long vm_flags
;
570 unsigned long stack_base
;
572 #ifdef CONFIG_STACK_GROWSUP
573 /* Limit stack size to 1GB */
574 stack_base
= current
->signal
->rlim
[RLIMIT_STACK
].rlim_max
;
575 if (stack_base
> (1 << 30))
576 stack_base
= 1 << 30;
578 /* Make sure we didn't let the argument array grow too large. */
579 if (vma
->vm_end
- vma
->vm_start
> stack_base
)
582 stack_base
= PAGE_ALIGN(stack_top
- stack_base
);
584 stack_shift
= vma
->vm_start
- stack_base
;
585 mm
->arg_start
= bprm
->p
- stack_shift
;
586 bprm
->p
= vma
->vm_end
- stack_shift
;
588 stack_top
= arch_align_stack(stack_top
);
589 stack_top
= PAGE_ALIGN(stack_top
);
590 stack_shift
= vma
->vm_end
- stack_top
;
592 bprm
->p
-= stack_shift
;
593 mm
->arg_start
= bprm
->p
;
597 bprm
->loader
-= stack_shift
;
598 bprm
->exec
-= stack_shift
;
600 down_write(&mm
->mmap_sem
);
601 vm_flags
= vma
->vm_flags
;
604 * Adjust stack execute permissions; explicitly enable for
605 * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
606 * (arch default) otherwise.
608 if (unlikely(executable_stack
== EXSTACK_ENABLE_X
))
610 else if (executable_stack
== EXSTACK_DISABLE_X
)
611 vm_flags
&= ~VM_EXEC
;
612 vm_flags
|= mm
->def_flags
;
614 ret
= mprotect_fixup(vma
, &prev
, vma
->vm_start
, vma
->vm_end
,
620 /* Move stack pages down in memory. */
622 ret
= shift_arg_pages(vma
, stack_shift
);
624 up_write(&mm
->mmap_sem
);
629 #ifdef CONFIG_STACK_GROWSUP
630 stack_base
= vma
->vm_end
+ EXTRA_STACK_VM_PAGES
* PAGE_SIZE
;
632 stack_base
= vma
->vm_start
- EXTRA_STACK_VM_PAGES
* PAGE_SIZE
;
634 ret
= expand_stack(vma
, stack_base
);
639 up_write(&mm
->mmap_sem
);
642 EXPORT_SYMBOL(setup_arg_pages
);
644 #endif /* CONFIG_MMU */
646 struct file
*open_exec(const char *name
)
652 err
= path_lookup_open(AT_FDCWD
, name
, LOOKUP_FOLLOW
, &nd
, FMODE_READ
|FMODE_EXEC
);
656 struct inode
*inode
= nd
.dentry
->d_inode
;
657 file
= ERR_PTR(-EACCES
);
658 if (S_ISREG(inode
->i_mode
)) {
659 int err
= vfs_permission(&nd
, MAY_EXEC
);
662 file
= nameidata_to_filp(&nd
, O_RDONLY
);
664 err
= deny_write_access(file
);
674 release_open_intent(&nd
);
680 EXPORT_SYMBOL(open_exec
);
682 int kernel_read(struct file
*file
, unsigned long offset
,
683 char *addr
, unsigned long count
)
691 /* The cast to a user pointer is valid due to the set_fs() */
692 result
= vfs_read(file
, (void __user
*)addr
, count
, &pos
);
697 EXPORT_SYMBOL(kernel_read
);
699 static int exec_mmap(struct mm_struct
*mm
)
701 struct task_struct
*tsk
;
702 struct mm_struct
* old_mm
, *active_mm
;
704 /* Notify parent that we're no longer interested in the old VM */
706 old_mm
= current
->mm
;
707 mm_release(tsk
, old_mm
);
711 * Make sure that if there is a core dump in progress
712 * for the old mm, we get out and die instead of going
713 * through with the exec. We must hold mmap_sem around
714 * checking core_waiters and changing tsk->mm. The
715 * core-inducing thread will increment core_waiters for
716 * each thread whose ->mm == old_mm.
718 down_read(&old_mm
->mmap_sem
);
719 if (unlikely(old_mm
->core_waiters
)) {
720 up_read(&old_mm
->mmap_sem
);
725 active_mm
= tsk
->active_mm
;
728 activate_mm(active_mm
, mm
);
730 arch_pick_mmap_layout(mm
);
732 up_read(&old_mm
->mmap_sem
);
733 BUG_ON(active_mm
!= old_mm
);
742 * This function makes sure the current process has its own signal table,
743 * so that flush_signal_handlers can later reset the handlers without
744 * disturbing other processes. (Other processes might share the signal
745 * table via the CLONE_SIGHAND option to clone().)
747 static int de_thread(struct task_struct
*tsk
)
749 struct signal_struct
*sig
= tsk
->signal
;
750 struct sighand_struct
*oldsighand
= tsk
->sighand
;
751 spinlock_t
*lock
= &oldsighand
->siglock
;
752 struct task_struct
*leader
= NULL
;
756 * If we don't share sighandlers, then we aren't sharing anything
757 * and we can just re-use it all.
759 if (atomic_read(&oldsighand
->count
) <= 1) {
764 if (thread_group_empty(tsk
))
765 goto no_thread_group
;
768 * Kill all other threads in the thread group.
769 * We must hold tasklist_lock to call zap_other_threads.
771 read_lock(&tasklist_lock
);
773 if (sig
->flags
& SIGNAL_GROUP_EXIT
) {
775 * Another group action in progress, just
776 * return so that the signal is processed.
778 spin_unlock_irq(lock
);
779 read_unlock(&tasklist_lock
);
784 * child_reaper ignores SIGKILL, change it now.
785 * Reparenting needs write_lock on tasklist_lock,
786 * so it is safe to do it under read_lock.
788 if (unlikely(tsk
->group_leader
== child_reaper(tsk
)))
789 tsk
->nsproxy
->pid_ns
->child_reaper
= tsk
;
791 zap_other_threads(tsk
);
792 read_unlock(&tasklist_lock
);
795 * Account for the thread group leader hanging around:
798 if (!thread_group_leader(tsk
)) {
801 * The SIGALRM timer survives the exec, but needs to point
802 * at us as the new group leader now. We have a race with
803 * a timer firing now getting the old leader, so we need to
804 * synchronize with any firing (by calling del_timer_sync)
805 * before we can safely let the old group leader die.
808 spin_unlock_irq(lock
);
809 if (hrtimer_cancel(&sig
->real_timer
))
810 hrtimer_restart(&sig
->real_timer
);
813 while (atomic_read(&sig
->count
) > count
) {
814 sig
->group_exit_task
= tsk
;
815 sig
->notify_count
= count
;
816 __set_current_state(TASK_UNINTERRUPTIBLE
);
817 spin_unlock_irq(lock
);
821 sig
->group_exit_task
= NULL
;
822 sig
->notify_count
= 0;
823 spin_unlock_irq(lock
);
826 * At this point all other threads have exited, all we have to
827 * do is to wait for the thread group leader to become inactive,
828 * and to assume its PID:
830 if (!thread_group_leader(tsk
)) {
832 * Wait for the thread group leader to be a zombie.
833 * It should already be zombie at this point, most
836 leader
= tsk
->group_leader
;
837 while (leader
->exit_state
!= EXIT_ZOMBIE
)
841 * The only record we have of the real-time age of a
842 * process, regardless of execs it's done, is start_time.
843 * All the past CPU time is accumulated in signal_struct
844 * from sister threads now dead. But in this non-leader
845 * exec, nothing survives from the original leader thread,
846 * whose birth marks the true age of this process now.
847 * When we take on its identity by switching to its PID, we
848 * also take its birthdate (always earlier than our own).
850 tsk
->start_time
= leader
->start_time
;
852 write_lock_irq(&tasklist_lock
);
854 BUG_ON(leader
->tgid
!= tsk
->tgid
);
855 BUG_ON(tsk
->pid
== tsk
->tgid
);
857 * An exec() starts a new thread group with the
858 * TGID of the previous thread group. Rehash the
859 * two threads with a switched PID, and release
860 * the former thread group leader:
863 /* Become a process group leader with the old leader's pid.
864 * The old leader becomes a thread of the this thread group.
865 * Note: The old leader also uses this pid until release_task
866 * is called. Odd but simple and correct.
868 detach_pid(tsk
, PIDTYPE_PID
);
869 tsk
->pid
= leader
->pid
;
870 attach_pid(tsk
, PIDTYPE_PID
, find_pid(tsk
->pid
));
871 transfer_pid(leader
, tsk
, PIDTYPE_PGID
);
872 transfer_pid(leader
, tsk
, PIDTYPE_SID
);
873 list_replace_rcu(&leader
->tasks
, &tsk
->tasks
);
875 tsk
->group_leader
= tsk
;
876 leader
->group_leader
= tsk
;
878 tsk
->exit_signal
= SIGCHLD
;
880 BUG_ON(leader
->exit_state
!= EXIT_ZOMBIE
);
881 leader
->exit_state
= EXIT_DEAD
;
883 write_unlock_irq(&tasklist_lock
);
887 * There may be one thread left which is just exiting,
888 * but it's safe to stop telling the group to kill themselves.
895 release_task(leader
);
897 if (atomic_read(&oldsighand
->count
) != 1) {
898 struct sighand_struct
*newsighand
;
900 * This ->sighand is shared with the CLONE_SIGHAND
901 * but not CLONE_THREAD task, switch to the new one.
903 newsighand
= kmem_cache_alloc(sighand_cachep
, GFP_KERNEL
);
907 atomic_set(&newsighand
->count
, 1);
908 memcpy(newsighand
->action
, oldsighand
->action
,
909 sizeof(newsighand
->action
));
911 write_lock_irq(&tasklist_lock
);
912 spin_lock(&oldsighand
->siglock
);
913 rcu_assign_pointer(tsk
->sighand
, newsighand
);
914 spin_unlock(&oldsighand
->siglock
);
915 write_unlock_irq(&tasklist_lock
);
917 __cleanup_sighand(oldsighand
);
920 BUG_ON(!thread_group_leader(tsk
));
925 * These functions flushes out all traces of the currently running executable
926 * so that a new one can be started
928 static void flush_old_files(struct files_struct
* files
)
933 spin_lock(&files
->file_lock
);
935 unsigned long set
, i
;
939 fdt
= files_fdtable(files
);
940 if (i
>= fdt
->max_fds
)
942 set
= fdt
->close_on_exec
->fds_bits
[j
];
945 fdt
->close_on_exec
->fds_bits
[j
] = 0;
946 spin_unlock(&files
->file_lock
);
947 for ( ; set
; i
++,set
>>= 1) {
952 spin_lock(&files
->file_lock
);
955 spin_unlock(&files
->file_lock
);
958 void get_task_comm(char *buf
, struct task_struct
*tsk
)
960 /* buf must be at least sizeof(tsk->comm) in size */
962 strncpy(buf
, tsk
->comm
, sizeof(tsk
->comm
));
966 void set_task_comm(struct task_struct
*tsk
, char *buf
)
969 strlcpy(tsk
->comm
, buf
, sizeof(tsk
->comm
));
973 int flush_old_exec(struct linux_binprm
* bprm
)
977 struct files_struct
*files
;
978 char tcomm
[sizeof(current
->comm
)];
981 * Make sure we have a private signal table and that
982 * we are unassociated from the previous thread group.
984 retval
= de_thread(current
);
989 * Make sure we have private file handles. Ask the
990 * fork helper to do the work for us and the exit
991 * helper to do the cleanup of the old one.
993 files
= current
->files
; /* refcounted so safe to hold */
994 retval
= unshare_files();
998 * Release all of the old mmap stuff
1000 retval
= exec_mmap(bprm
->mm
);
1004 bprm
->mm
= NULL
; /* We're using it now */
1006 /* This is the point of no return */
1007 put_files_struct(files
);
1009 current
->sas_ss_sp
= current
->sas_ss_size
= 0;
1011 if (current
->euid
== current
->uid
&& current
->egid
== current
->gid
)
1012 set_dumpable(current
->mm
, 1);
1014 set_dumpable(current
->mm
, suid_dumpable
);
1016 name
= bprm
->filename
;
1018 /* Copies the binary name from after last slash */
1019 for (i
=0; (ch
= *(name
++)) != '\0';) {
1021 i
= 0; /* overwrite what we wrote */
1023 if (i
< (sizeof(tcomm
) - 1))
1027 set_task_comm(current
, tcomm
);
1029 current
->flags
&= ~PF_RANDOMIZE
;
1032 /* Set the new mm task size. We have to do that late because it may
1033 * depend on TIF_32BIT which is only updated in flush_thread() on
1034 * some architectures like powerpc
1036 current
->mm
->task_size
= TASK_SIZE
;
1038 if (bprm
->e_uid
!= current
->euid
|| bprm
->e_gid
!= current
->egid
) {
1040 set_dumpable(current
->mm
, suid_dumpable
);
1041 current
->pdeath_signal
= 0;
1042 } else if (file_permission(bprm
->file
, MAY_READ
) ||
1043 (bprm
->interp_flags
& BINPRM_FLAGS_ENFORCE_NONDUMP
)) {
1045 set_dumpable(current
->mm
, suid_dumpable
);
1048 /* An exec changes our domain. We are no longer part of the thread
1051 current
->self_exec_id
++;
1053 flush_signal_handlers(current
, 0);
1054 flush_old_files(current
->files
);
1059 reset_files_struct(current
, files
);
1064 EXPORT_SYMBOL(flush_old_exec
);
1067 * Fill the binprm structure from the inode.
1068 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
1070 int prepare_binprm(struct linux_binprm
*bprm
)
1073 struct inode
* inode
= bprm
->file
->f_path
.dentry
->d_inode
;
1076 mode
= inode
->i_mode
;
1077 if (bprm
->file
->f_op
== NULL
)
1080 bprm
->e_uid
= current
->euid
;
1081 bprm
->e_gid
= current
->egid
;
1083 if(!(bprm
->file
->f_path
.mnt
->mnt_flags
& MNT_NOSUID
)) {
1085 if (mode
& S_ISUID
) {
1086 current
->personality
&= ~PER_CLEAR_ON_SETID
;
1087 bprm
->e_uid
= inode
->i_uid
;
1092 * If setgid is set but no group execute bit then this
1093 * is a candidate for mandatory locking, not a setgid
1096 if ((mode
& (S_ISGID
| S_IXGRP
)) == (S_ISGID
| S_IXGRP
)) {
1097 current
->personality
&= ~PER_CLEAR_ON_SETID
;
1098 bprm
->e_gid
= inode
->i_gid
;
1102 /* fill in binprm security blob */
1103 retval
= security_bprm_set(bprm
);
1107 memset(bprm
->buf
,0,BINPRM_BUF_SIZE
);
1108 return kernel_read(bprm
->file
,0,bprm
->buf
,BINPRM_BUF_SIZE
);
1111 EXPORT_SYMBOL(prepare_binprm
);
1113 static int unsafe_exec(struct task_struct
*p
)
1116 if (p
->ptrace
& PT_PTRACED
) {
1117 if (p
->ptrace
& PT_PTRACE_CAP
)
1118 unsafe
|= LSM_UNSAFE_PTRACE_CAP
;
1120 unsafe
|= LSM_UNSAFE_PTRACE
;
1122 if (atomic_read(&p
->fs
->count
) > 1 ||
1123 atomic_read(&p
->files
->count
) > 1 ||
1124 atomic_read(&p
->sighand
->count
) > 1)
1125 unsafe
|= LSM_UNSAFE_SHARE
;
1130 void compute_creds(struct linux_binprm
*bprm
)
1134 if (bprm
->e_uid
!= current
->uid
) {
1136 current
->pdeath_signal
= 0;
1141 unsafe
= unsafe_exec(current
);
1142 security_bprm_apply_creds(bprm
, unsafe
);
1143 task_unlock(current
);
1144 security_bprm_post_apply_creds(bprm
);
1146 EXPORT_SYMBOL(compute_creds
);
1149 * Arguments are '\0' separated strings found at the location bprm->p
1150 * points to; chop off the first by relocating brpm->p to right after
1151 * the first '\0' encountered.
1153 int remove_arg_zero(struct linux_binprm
*bprm
)
1156 unsigned long offset
;
1164 offset
= bprm
->p
& ~PAGE_MASK
;
1165 page
= get_arg_page(bprm
, bprm
->p
, 0);
1170 kaddr
= kmap_atomic(page
, KM_USER0
);
1172 for (; offset
< PAGE_SIZE
&& kaddr
[offset
];
1173 offset
++, bprm
->p
++)
1176 kunmap_atomic(kaddr
, KM_USER0
);
1179 if (offset
== PAGE_SIZE
)
1180 free_arg_page(bprm
, (bprm
->p
>> PAGE_SHIFT
) - 1);
1181 } while (offset
== PAGE_SIZE
);
1190 EXPORT_SYMBOL(remove_arg_zero
);
1193 * cycle the list of binary formats handler, until one recognizes the image
1195 int search_binary_handler(struct linux_binprm
*bprm
,struct pt_regs
*regs
)
1198 struct linux_binfmt
*fmt
;
1200 /* handle /sbin/loader.. */
1202 struct exec
* eh
= (struct exec
*) bprm
->buf
;
1204 if (!bprm
->loader
&& eh
->fh
.f_magic
== 0x183 &&
1205 (eh
->fh
.f_flags
& 0x3000) == 0x3000)
1208 unsigned long loader
;
1210 allow_write_access(bprm
->file
);
1214 loader
= bprm
->vma
->vm_end
- sizeof(void *);
1216 file
= open_exec("/sbin/loader");
1217 retval
= PTR_ERR(file
);
1221 /* Remember if the application is TASO. */
1222 bprm
->sh_bang
= eh
->ah
.entry
< 0x100000000UL
;
1225 bprm
->loader
= loader
;
1226 retval
= prepare_binprm(bprm
);
1229 /* should call search_binary_handler recursively here,
1230 but it does not matter */
1234 retval
= security_bprm_check(bprm
);
1238 /* kernel module loader fixup */
1239 /* so we don't try to load run modprobe in kernel space. */
1242 retval
= audit_bprm(bprm
);
1247 for (try=0; try<2; try++) {
1248 read_lock(&binfmt_lock
);
1249 list_for_each_entry(fmt
, &formats
, lh
) {
1250 int (*fn
)(struct linux_binprm
*, struct pt_regs
*) = fmt
->load_binary
;
1253 if (!try_module_get(fmt
->module
))
1255 read_unlock(&binfmt_lock
);
1256 retval
= fn(bprm
, regs
);
1259 allow_write_access(bprm
->file
);
1263 current
->did_exec
= 1;
1264 proc_exec_connector(current
);
1267 read_lock(&binfmt_lock
);
1269 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
)
1272 read_unlock(&binfmt_lock
);
1276 read_unlock(&binfmt_lock
);
1277 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
) {
1281 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1282 if (printable(bprm
->buf
[0]) &&
1283 printable(bprm
->buf
[1]) &&
1284 printable(bprm
->buf
[2]) &&
1285 printable(bprm
->buf
[3]))
1286 break; /* -ENOEXEC */
1287 request_module("binfmt-%04x", *(unsigned short *)(&bprm
->buf
[2]));
1294 EXPORT_SYMBOL(search_binary_handler
);
1297 * sys_execve() executes a new program.
1299 int do_execve(char * filename
,
1300 char __user
*__user
*argv
,
1301 char __user
*__user
*envp
,
1302 struct pt_regs
* regs
)
1304 struct linux_binprm
*bprm
;
1306 unsigned long env_p
;
1310 bprm
= kzalloc(sizeof(*bprm
), GFP_KERNEL
);
1314 file
= open_exec(filename
);
1315 retval
= PTR_ERR(file
);
1322 bprm
->filename
= filename
;
1323 bprm
->interp
= filename
;
1325 retval
= bprm_mm_init(bprm
);
1329 bprm
->argc
= count(argv
, MAX_ARG_STRINGS
);
1330 if ((retval
= bprm
->argc
) < 0)
1333 bprm
->envc
= count(envp
, MAX_ARG_STRINGS
);
1334 if ((retval
= bprm
->envc
) < 0)
1337 retval
= security_bprm_alloc(bprm
);
1341 retval
= prepare_binprm(bprm
);
1345 retval
= copy_strings_kernel(1, &bprm
->filename
, bprm
);
1349 bprm
->exec
= bprm
->p
;
1350 retval
= copy_strings(bprm
->envc
, envp
, bprm
);
1355 retval
= copy_strings(bprm
->argc
, argv
, bprm
);
1358 bprm
->argv_len
= env_p
- bprm
->p
;
1360 retval
= search_binary_handler(bprm
,regs
);
1362 /* execve success */
1363 free_arg_pages(bprm
);
1364 security_bprm_free(bprm
);
1365 acct_update_integrals(current
);
1371 free_arg_pages(bprm
);
1373 security_bprm_free(bprm
);
1381 allow_write_access(bprm
->file
);
1391 int set_binfmt(struct linux_binfmt
*new)
1393 struct linux_binfmt
*old
= current
->binfmt
;
1396 if (!try_module_get(new->module
))
1399 current
->binfmt
= new;
1401 module_put(old
->module
);
1405 EXPORT_SYMBOL(set_binfmt
);
1407 /* format_corename will inspect the pattern parameter, and output a
1408 * name into corename, which must have space for at least
1409 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1411 static int format_corename(char *corename
, const char *pattern
, long signr
)
1413 const char *pat_ptr
= pattern
;
1414 char *out_ptr
= corename
;
1415 char *const out_end
= corename
+ CORENAME_MAX_SIZE
;
1417 int pid_in_pattern
= 0;
1420 if (*pattern
== '|')
1423 /* Repeat as long as we have more pattern to process and more output
1426 if (*pat_ptr
!= '%') {
1427 if (out_ptr
== out_end
)
1429 *out_ptr
++ = *pat_ptr
++;
1431 switch (*++pat_ptr
) {
1434 /* Double percent, output one percent */
1436 if (out_ptr
== out_end
)
1443 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1444 "%d", current
->tgid
);
1445 if (rc
> out_end
- out_ptr
)
1451 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1452 "%d", current
->uid
);
1453 if (rc
> out_end
- out_ptr
)
1459 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1460 "%d", current
->gid
);
1461 if (rc
> out_end
- out_ptr
)
1465 /* signal that caused the coredump */
1467 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1469 if (rc
> out_end
- out_ptr
)
1473 /* UNIX time of coredump */
1476 do_gettimeofday(&tv
);
1477 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1479 if (rc
> out_end
- out_ptr
)
1486 down_read(&uts_sem
);
1487 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1488 "%s", utsname()->nodename
);
1490 if (rc
> out_end
- out_ptr
)
1496 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1497 "%s", current
->comm
);
1498 if (rc
> out_end
- out_ptr
)
1502 /* core limit size */
1504 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1505 "%lu", current
->signal
->rlim
[RLIMIT_CORE
].rlim_cur
);
1506 if (rc
> out_end
- out_ptr
)
1516 /* Backward compatibility with core_uses_pid:
1518 * If core_pattern does not include a %p (as is the default)
1519 * and core_uses_pid is set, then .%pid will be appended to
1520 * the filename. Do not do this for piped commands. */
1521 if (!ispipe
&& !pid_in_pattern
1522 && (core_uses_pid
|| atomic_read(¤t
->mm
->mm_users
) != 1)) {
1523 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1524 ".%d", current
->tgid
);
1525 if (rc
> out_end
- out_ptr
)
1534 static void zap_process(struct task_struct
*start
)
1536 struct task_struct
*t
;
1538 start
->signal
->flags
= SIGNAL_GROUP_EXIT
;
1539 start
->signal
->group_stop_count
= 0;
1543 if (t
!= current
&& t
->mm
) {
1544 t
->mm
->core_waiters
++;
1545 sigaddset(&t
->pending
.signal
, SIGKILL
);
1546 signal_wake_up(t
, 1);
1548 } while ((t
= next_thread(t
)) != start
);
1551 static inline int zap_threads(struct task_struct
*tsk
, struct mm_struct
*mm
,
1554 struct task_struct
*g
, *p
;
1555 unsigned long flags
;
1558 spin_lock_irq(&tsk
->sighand
->siglock
);
1559 if (!(tsk
->signal
->flags
& SIGNAL_GROUP_EXIT
)) {
1560 tsk
->signal
->group_exit_code
= exit_code
;
1564 spin_unlock_irq(&tsk
->sighand
->siglock
);
1568 if (atomic_read(&mm
->mm_users
) == mm
->core_waiters
+ 1)
1572 for_each_process(g
) {
1573 if (g
== tsk
->group_leader
)
1581 * p->sighand can't disappear, but
1582 * may be changed by de_thread()
1584 lock_task_sighand(p
, &flags
);
1586 unlock_task_sighand(p
, &flags
);
1590 } while ((p
= next_thread(p
)) != g
);
1594 return mm
->core_waiters
;
1597 static int coredump_wait(int exit_code
)
1599 struct task_struct
*tsk
= current
;
1600 struct mm_struct
*mm
= tsk
->mm
;
1601 struct completion startup_done
;
1602 struct completion
*vfork_done
;
1605 init_completion(&mm
->core_done
);
1606 init_completion(&startup_done
);
1607 mm
->core_startup_done
= &startup_done
;
1609 core_waiters
= zap_threads(tsk
, mm
, exit_code
);
1610 up_write(&mm
->mmap_sem
);
1612 if (unlikely(core_waiters
< 0))
1616 * Make sure nobody is waiting for us to release the VM,
1617 * otherwise we can deadlock when we wait on each other
1619 vfork_done
= tsk
->vfork_done
;
1621 tsk
->vfork_done
= NULL
;
1622 complete(vfork_done
);
1626 wait_for_completion(&startup_done
);
1628 BUG_ON(mm
->core_waiters
);
1629 return core_waiters
;
1633 * set_dumpable converts traditional three-value dumpable to two flags and
1634 * stores them into mm->flags. It modifies lower two bits of mm->flags, but
1635 * these bits are not changed atomically. So get_dumpable can observe the
1636 * intermediate state. To avoid doing unexpected behavior, get get_dumpable
1637 * return either old dumpable or new one by paying attention to the order of
1638 * modifying the bits.
1640 * dumpable | mm->flags (binary)
1641 * old new | initial interim final
1642 * ---------+-----------------------
1650 * (*) get_dumpable regards interim value of 10 as 11.
1652 void set_dumpable(struct mm_struct
*mm
, int value
)
1656 clear_bit(MMF_DUMPABLE
, &mm
->flags
);
1658 clear_bit(MMF_DUMP_SECURELY
, &mm
->flags
);
1661 set_bit(MMF_DUMPABLE
, &mm
->flags
);
1663 clear_bit(MMF_DUMP_SECURELY
, &mm
->flags
);
1666 set_bit(MMF_DUMP_SECURELY
, &mm
->flags
);
1668 set_bit(MMF_DUMPABLE
, &mm
->flags
);
1672 EXPORT_SYMBOL_GPL(set_dumpable
);
1674 int get_dumpable(struct mm_struct
*mm
)
1678 ret
= mm
->flags
& 0x3;
1679 return (ret
>= 2) ? 2 : ret
;
1682 int do_coredump(long signr
, int exit_code
, struct pt_regs
* regs
)
1684 char corename
[CORENAME_MAX_SIZE
+ 1];
1685 struct mm_struct
*mm
= current
->mm
;
1686 struct linux_binfmt
* binfmt
;
1687 struct inode
* inode
;
1690 int fsuid
= current
->fsuid
;
1693 unsigned long core_limit
= current
->signal
->rlim
[RLIMIT_CORE
].rlim_cur
;
1694 char **helper_argv
= NULL
;
1695 int helper_argc
= 0;
1698 audit_core_dumps(signr
);
1700 binfmt
= current
->binfmt
;
1701 if (!binfmt
|| !binfmt
->core_dump
)
1703 down_write(&mm
->mmap_sem
);
1704 if (!get_dumpable(mm
)) {
1705 up_write(&mm
->mmap_sem
);
1710 * We cannot trust fsuid as being the "true" uid of the
1711 * process nor do we know its entire history. We only know it
1712 * was tainted so we dump it as root in mode 2.
1714 if (get_dumpable(mm
) == 2) { /* Setuid core dump mode */
1715 flag
= O_EXCL
; /* Stop rewrite attacks */
1716 current
->fsuid
= 0; /* Dump root private */
1718 set_dumpable(mm
, 0);
1720 retval
= coredump_wait(exit_code
);
1725 * Clear any false indication of pending signals that might
1726 * be seen by the filesystem code called to write the core file.
1728 clear_thread_flag(TIF_SIGPENDING
);
1731 * lock_kernel() because format_corename() is controlled by sysctl, which
1732 * uses lock_kernel()
1735 ispipe
= format_corename(corename
, core_pattern
, signr
);
1738 * Don't bother to check the RLIMIT_CORE value if core_pattern points
1739 * to a pipe. Since we're not writing directly to the filesystem
1740 * RLIMIT_CORE doesn't really apply, as no actual core file will be
1741 * created unless the pipe reader choses to write out the core file
1742 * at which point file size limits and permissions will be imposed
1743 * as it does with any other process
1745 if ((!ispipe
) && (core_limit
< binfmt
->min_coredump
))
1749 helper_argv
= argv_split(GFP_KERNEL
, corename
+1, &helper_argc
);
1750 /* Terminate the string before the first option */
1751 delimit
= strchr(corename
, ' ');
1754 delimit
= strrchr(helper_argv
[0], '/');
1758 delimit
= helper_argv
[0];
1759 if (!strcmp(delimit
, current
->comm
)) {
1760 printk(KERN_NOTICE
"Recursive core dump detected, "
1765 core_limit
= RLIM_INFINITY
;
1767 /* SIGPIPE can happen, but it's just never processed */
1768 if (call_usermodehelper_pipe(corename
+1, helper_argv
, NULL
,
1770 printk(KERN_INFO
"Core dump to %s pipe failed\n",
1775 file
= filp_open(corename
,
1776 O_CREAT
| 2 | O_NOFOLLOW
| O_LARGEFILE
| flag
,
1780 inode
= file
->f_path
.dentry
->d_inode
;
1781 if (inode
->i_nlink
> 1)
1782 goto close_fail
; /* multiple links - don't dump */
1783 if (!ispipe
&& d_unhashed(file
->f_path
.dentry
))
1786 /* AK: actually i see no reason to not allow this for named pipes etc.,
1787 but keep the previous behaviour for now. */
1788 if (!ispipe
&& !S_ISREG(inode
->i_mode
))
1792 if (!file
->f_op
->write
)
1794 if (!ispipe
&& do_truncate(file
->f_path
.dentry
, 0, 0, file
) != 0)
1797 retval
= binfmt
->core_dump(signr
, regs
, file
, core_limit
);
1800 current
->signal
->group_exit_code
|= 0x80;
1802 filp_close(file
, NULL
);
1805 argv_free(helper_argv
);
1807 current
->fsuid
= fsuid
;
1808 complete_all(&mm
->core_done
);