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/config.h>
26 #include <linux/slab.h>
27 #include <linux/file.h>
28 #include <linux/mman.h>
29 #include <linux/a.out.h>
30 #include <linux/stat.h>
31 #include <linux/fcntl.h>
32 #include <linux/smp_lock.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/module.h>
43 #include <linux/namei.h>
44 #include <linux/proc_fs.h>
45 #include <linux/ptrace.h>
46 #include <linux/mount.h>
47 #include <linux/security.h>
48 #include <linux/syscalls.h>
49 #include <linux/rmap.h>
50 #include <linux/acct.h>
52 #include <asm/uaccess.h>
53 #include <asm/mmu_context.h>
56 #include <linux/kmod.h>
60 char core_pattern
[65] = "core";
61 int suid_dumpable
= 0;
63 EXPORT_SYMBOL(suid_dumpable
);
64 /* The maximal length of core_pattern is also specified in sysctl.c */
66 static struct linux_binfmt
*formats
;
67 static DEFINE_RWLOCK(binfmt_lock
);
69 int register_binfmt(struct linux_binfmt
* fmt
)
71 struct linux_binfmt
** tmp
= &formats
;
77 write_lock(&binfmt_lock
);
80 write_unlock(&binfmt_lock
);
87 write_unlock(&binfmt_lock
);
91 EXPORT_SYMBOL(register_binfmt
);
93 int unregister_binfmt(struct linux_binfmt
* fmt
)
95 struct linux_binfmt
** tmp
= &formats
;
97 write_lock(&binfmt_lock
);
101 write_unlock(&binfmt_lock
);
106 write_unlock(&binfmt_lock
);
110 EXPORT_SYMBOL(unregister_binfmt
);
112 static inline void put_binfmt(struct linux_binfmt
* fmt
)
114 module_put(fmt
->module
);
118 * Note that a shared library must be both readable and executable due to
121 * Also note that we take the address to load from from the file itself.
123 asmlinkage
long sys_uselib(const char __user
* library
)
129 nd
.intent
.open
.flags
= FMODE_READ
;
130 error
= __user_walk(library
, LOOKUP_FOLLOW
|LOOKUP_OPEN
, &nd
);
135 if (!S_ISREG(nd
.dentry
->d_inode
->i_mode
))
138 error
= permission(nd
.dentry
->d_inode
, MAY_READ
| MAY_EXEC
, &nd
);
142 file
= dentry_open(nd
.dentry
, nd
.mnt
, O_RDONLY
);
143 error
= PTR_ERR(file
);
149 struct linux_binfmt
* fmt
;
151 read_lock(&binfmt_lock
);
152 for (fmt
= formats
; fmt
; fmt
= fmt
->next
) {
153 if (!fmt
->load_shlib
)
155 if (!try_module_get(fmt
->module
))
157 read_unlock(&binfmt_lock
);
158 error
= fmt
->load_shlib(file
);
159 read_lock(&binfmt_lock
);
161 if (error
!= -ENOEXEC
)
164 read_unlock(&binfmt_lock
);
175 * count() counts the number of strings in array ARGV.
177 static int count(char __user
* __user
* argv
, int max
)
185 if (get_user(p
, argv
))
199 * 'copy_strings()' copies argument/environment strings from user
200 * memory to free pages in kernel mem. These are in a format ready
201 * to be put directly into the top of new user memory.
203 static int copy_strings(int argc
, char __user
* __user
* argv
,
204 struct linux_binprm
*bprm
)
206 struct page
*kmapped_page
= NULL
;
215 if (get_user(str
, argv
+argc
) ||
216 !(len
= strnlen_user(str
, bprm
->p
))) {
227 /* XXX: add architecture specific overflow check here. */
232 int offset
, bytes_to_copy
;
235 offset
= pos
% PAGE_SIZE
;
237 page
= bprm
->page
[i
];
240 page
= alloc_page(GFP_HIGHUSER
);
241 bprm
->page
[i
] = page
;
249 if (page
!= kmapped_page
) {
251 kunmap(kmapped_page
);
253 kaddr
= kmap(kmapped_page
);
256 memset(kaddr
, 0, offset
);
257 bytes_to_copy
= PAGE_SIZE
- offset
;
258 if (bytes_to_copy
> len
) {
261 memset(kaddr
+offset
+len
, 0,
262 PAGE_SIZE
-offset
-len
);
264 err
= copy_from_user(kaddr
+offset
, str
, bytes_to_copy
);
270 pos
+= bytes_to_copy
;
271 str
+= bytes_to_copy
;
272 len
-= bytes_to_copy
;
278 kunmap(kmapped_page
);
283 * Like copy_strings, but get argv and its values from kernel memory.
285 int copy_strings_kernel(int argc
,char ** argv
, struct linux_binprm
*bprm
)
288 mm_segment_t oldfs
= get_fs();
290 r
= copy_strings(argc
, (char __user
* __user
*)argv
, bprm
);
295 EXPORT_SYMBOL(copy_strings_kernel
);
299 * This routine is used to map in a page into an address space: needed by
300 * execve() for the initial stack and environment pages.
302 * vma->vm_mm->mmap_sem is held for writing.
304 void install_arg_page(struct vm_area_struct
*vma
,
305 struct page
*page
, unsigned long address
)
307 struct mm_struct
*mm
= vma
->vm_mm
;
313 if (unlikely(anon_vma_prepare(vma
)))
316 flush_dcache_page(page
);
317 pgd
= pgd_offset(mm
, address
);
319 spin_lock(&mm
->page_table_lock
);
320 pud
= pud_alloc(mm
, pgd
, address
);
323 pmd
= pmd_alloc(mm
, pud
, address
);
326 pte
= pte_alloc_map(mm
, pmd
, address
);
329 if (!pte_none(*pte
)) {
333 inc_mm_counter(mm
, rss
);
334 lru_cache_add_active(page
);
335 set_pte_at(mm
, address
, pte
, pte_mkdirty(pte_mkwrite(mk_pte(
336 page
, vma
->vm_page_prot
))));
337 page_add_anon_rmap(page
, vma
, address
);
339 spin_unlock(&mm
->page_table_lock
);
341 /* no need for flush_tlb */
344 spin_unlock(&mm
->page_table_lock
);
347 force_sig(SIGKILL
, current
);
350 #define EXTRA_STACK_VM_PAGES 20 /* random */
352 int setup_arg_pages(struct linux_binprm
*bprm
,
353 unsigned long stack_top
,
354 int executable_stack
)
356 unsigned long stack_base
;
357 struct vm_area_struct
*mpnt
;
358 struct mm_struct
*mm
= current
->mm
;
362 #ifdef CONFIG_STACK_GROWSUP
363 /* Move the argument and environment strings to the bottom of the
369 /* Start by shifting all the pages down */
371 for (j
= 0; j
< MAX_ARG_PAGES
; j
++) {
372 struct page
*page
= bprm
->page
[j
];
375 bprm
->page
[i
++] = page
;
378 /* Now move them within their pages */
379 offset
= bprm
->p
% PAGE_SIZE
;
380 to
= kmap(bprm
->page
[0]);
381 for (j
= 1; j
< i
; j
++) {
382 memmove(to
, to
+ offset
, PAGE_SIZE
- offset
);
383 from
= kmap(bprm
->page
[j
]);
384 memcpy(to
+ PAGE_SIZE
- offset
, from
, offset
);
385 kunmap(bprm
->page
[j
- 1]);
388 memmove(to
, to
+ offset
, PAGE_SIZE
- offset
);
389 kunmap(bprm
->page
[j
- 1]);
391 /* Limit stack size to 1GB */
392 stack_base
= current
->signal
->rlim
[RLIMIT_STACK
].rlim_max
;
393 if (stack_base
> (1 << 30))
394 stack_base
= 1 << 30;
395 stack_base
= PAGE_ALIGN(stack_top
- stack_base
);
397 /* Adjust bprm->p to point to the end of the strings. */
398 bprm
->p
= stack_base
+ PAGE_SIZE
* i
- offset
;
400 mm
->arg_start
= stack_base
;
401 arg_size
= i
<< PAGE_SHIFT
;
403 /* zero pages that were copied above */
404 while (i
< MAX_ARG_PAGES
)
405 bprm
->page
[i
++] = NULL
;
407 stack_base
= arch_align_stack(stack_top
- MAX_ARG_PAGES
*PAGE_SIZE
);
408 stack_base
= PAGE_ALIGN(stack_base
);
409 bprm
->p
+= stack_base
;
410 mm
->arg_start
= bprm
->p
;
411 arg_size
= stack_top
- (PAGE_MASK
& (unsigned long) mm
->arg_start
);
414 arg_size
+= EXTRA_STACK_VM_PAGES
* PAGE_SIZE
;
417 bprm
->loader
+= stack_base
;
418 bprm
->exec
+= stack_base
;
420 mpnt
= kmem_cache_alloc(vm_area_cachep
, SLAB_KERNEL
);
424 if (security_vm_enough_memory(arg_size
>> PAGE_SHIFT
)) {
425 kmem_cache_free(vm_area_cachep
, mpnt
);
429 memset(mpnt
, 0, sizeof(*mpnt
));
431 down_write(&mm
->mmap_sem
);
434 #ifdef CONFIG_STACK_GROWSUP
435 mpnt
->vm_start
= stack_base
;
436 mpnt
->vm_end
= stack_base
+ arg_size
;
438 mpnt
->vm_end
= stack_top
;
439 mpnt
->vm_start
= mpnt
->vm_end
- arg_size
;
441 /* Adjust stack execute permissions; explicitly enable
442 * for EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X
443 * and leave alone (arch default) otherwise. */
444 if (unlikely(executable_stack
== EXSTACK_ENABLE_X
))
445 mpnt
->vm_flags
= VM_STACK_FLAGS
| VM_EXEC
;
446 else if (executable_stack
== EXSTACK_DISABLE_X
)
447 mpnt
->vm_flags
= VM_STACK_FLAGS
& ~VM_EXEC
;
449 mpnt
->vm_flags
= VM_STACK_FLAGS
;
450 mpnt
->vm_flags
|= mm
->def_flags
;
451 mpnt
->vm_page_prot
= protection_map
[mpnt
->vm_flags
& 0x7];
452 if ((ret
= insert_vm_struct(mm
, mpnt
))) {
453 up_write(&mm
->mmap_sem
);
454 kmem_cache_free(vm_area_cachep
, mpnt
);
457 mm
->stack_vm
= mm
->total_vm
= vma_pages(mpnt
);
460 for (i
= 0 ; i
< MAX_ARG_PAGES
; i
++) {
461 struct page
*page
= bprm
->page
[i
];
463 bprm
->page
[i
] = NULL
;
464 install_arg_page(mpnt
, page
, stack_base
);
466 stack_base
+= PAGE_SIZE
;
468 up_write(&mm
->mmap_sem
);
473 EXPORT_SYMBOL(setup_arg_pages
);
475 #define free_arg_pages(bprm) do { } while (0)
479 static inline void free_arg_pages(struct linux_binprm
*bprm
)
483 for (i
= 0; i
< MAX_ARG_PAGES
; i
++) {
485 __free_page(bprm
->page
[i
]);
486 bprm
->page
[i
] = NULL
;
490 #endif /* CONFIG_MMU */
492 struct file
*open_exec(const char *name
)
498 nd
.intent
.open
.flags
= FMODE_READ
;
499 err
= path_lookup(name
, LOOKUP_FOLLOW
|LOOKUP_OPEN
, &nd
);
503 struct inode
*inode
= nd
.dentry
->d_inode
;
504 file
= ERR_PTR(-EACCES
);
505 if (!(nd
.mnt
->mnt_flags
& MNT_NOEXEC
) &&
506 S_ISREG(inode
->i_mode
)) {
507 int err
= permission(inode
, MAY_EXEC
, &nd
);
508 if (!err
&& !(inode
->i_mode
& 0111))
512 file
= dentry_open(nd
.dentry
, nd
.mnt
, O_RDONLY
);
514 err
= deny_write_access(file
);
529 EXPORT_SYMBOL(open_exec
);
531 int kernel_read(struct file
*file
, unsigned long offset
,
532 char *addr
, unsigned long count
)
540 /* The cast to a user pointer is valid due to the set_fs() */
541 result
= vfs_read(file
, (void __user
*)addr
, count
, &pos
);
546 EXPORT_SYMBOL(kernel_read
);
548 static int exec_mmap(struct mm_struct
*mm
)
550 struct task_struct
*tsk
;
551 struct mm_struct
* old_mm
, *active_mm
;
553 /* Notify parent that we're no longer interested in the old VM */
555 old_mm
= current
->mm
;
556 mm_release(tsk
, old_mm
);
560 * Make sure that if there is a core dump in progress
561 * for the old mm, we get out and die instead of going
562 * through with the exec. We must hold mmap_sem around
563 * checking core_waiters and changing tsk->mm. The
564 * core-inducing thread will increment core_waiters for
565 * each thread whose ->mm == old_mm.
567 down_read(&old_mm
->mmap_sem
);
568 if (unlikely(old_mm
->core_waiters
)) {
569 up_read(&old_mm
->mmap_sem
);
574 active_mm
= tsk
->active_mm
;
577 activate_mm(active_mm
, mm
);
579 arch_pick_mmap_layout(mm
);
581 up_read(&old_mm
->mmap_sem
);
582 if (active_mm
!= old_mm
) BUG();
591 * This function makes sure the current process has its own signal table,
592 * so that flush_signal_handlers can later reset the handlers without
593 * disturbing other processes. (Other processes might share the signal
594 * table via the CLONE_SIGHAND option to clone().)
596 static inline int de_thread(struct task_struct
*tsk
)
598 struct signal_struct
*sig
= tsk
->signal
;
599 struct sighand_struct
*newsighand
, *oldsighand
= tsk
->sighand
;
600 spinlock_t
*lock
= &oldsighand
->siglock
;
604 * If we don't share sighandlers, then we aren't sharing anything
605 * and we can just re-use it all.
607 if (atomic_read(&oldsighand
->count
) <= 1) {
608 BUG_ON(atomic_read(&sig
->count
) != 1);
613 newsighand
= kmem_cache_alloc(sighand_cachep
, GFP_KERNEL
);
617 if (thread_group_empty(current
))
618 goto no_thread_group
;
621 * Kill all other threads in the thread group.
622 * We must hold tasklist_lock to call zap_other_threads.
624 read_lock(&tasklist_lock
);
626 if (sig
->flags
& SIGNAL_GROUP_EXIT
) {
628 * Another group action in progress, just
629 * return so that the signal is processed.
631 spin_unlock_irq(lock
);
632 read_unlock(&tasklist_lock
);
633 kmem_cache_free(sighand_cachep
, newsighand
);
636 zap_other_threads(current
);
637 read_unlock(&tasklist_lock
);
640 * Account for the thread group leader hanging around:
643 if (thread_group_leader(current
))
645 while (atomic_read(&sig
->count
) > count
) {
646 sig
->group_exit_task
= current
;
647 sig
->notify_count
= count
;
648 __set_current_state(TASK_UNINTERRUPTIBLE
);
649 spin_unlock_irq(lock
);
653 sig
->group_exit_task
= NULL
;
654 sig
->notify_count
= 0;
655 sig
->real_timer
.data
= (unsigned long)current
;
656 spin_unlock_irq(lock
);
659 * At this point all other threads have exited, all we have to
660 * do is to wait for the thread group leader to become inactive,
661 * and to assume its PID:
663 if (!thread_group_leader(current
)) {
664 struct task_struct
*leader
= current
->group_leader
, *parent
;
665 struct dentry
*proc_dentry1
, *proc_dentry2
;
666 unsigned long exit_state
, ptrace
;
669 * Wait for the thread group leader to be a zombie.
670 * It should already be zombie at this point, most
673 while (leader
->exit_state
!= EXIT_ZOMBIE
)
676 spin_lock(&leader
->proc_lock
);
677 spin_lock(¤t
->proc_lock
);
678 proc_dentry1
= proc_pid_unhash(current
);
679 proc_dentry2
= proc_pid_unhash(leader
);
680 write_lock_irq(&tasklist_lock
);
682 BUG_ON(leader
->tgid
!= current
->tgid
);
683 BUG_ON(current
->pid
== current
->tgid
);
685 * An exec() starts a new thread group with the
686 * TGID of the previous thread group. Rehash the
687 * two threads with a switched PID, and release
688 * the former thread group leader:
690 ptrace
= leader
->ptrace
;
691 parent
= leader
->parent
;
692 if (unlikely(ptrace
) && unlikely(parent
== current
)) {
694 * Joker was ptracing his own group leader,
695 * and now he wants to be his own parent!
696 * We can't have that.
701 ptrace_unlink(current
);
702 ptrace_unlink(leader
);
703 remove_parent(current
);
704 remove_parent(leader
);
706 switch_exec_pids(leader
, current
);
708 current
->parent
= current
->real_parent
= leader
->real_parent
;
709 leader
->parent
= leader
->real_parent
= child_reaper
;
710 current
->group_leader
= current
;
711 leader
->group_leader
= leader
;
713 add_parent(current
, current
->parent
);
714 add_parent(leader
, leader
->parent
);
716 current
->ptrace
= ptrace
;
717 __ptrace_link(current
, parent
);
720 list_del(¤t
->tasks
);
721 list_add_tail(¤t
->tasks
, &init_task
.tasks
);
722 current
->exit_signal
= SIGCHLD
;
723 exit_state
= leader
->exit_state
;
725 write_unlock_irq(&tasklist_lock
);
726 spin_unlock(&leader
->proc_lock
);
727 spin_unlock(¤t
->proc_lock
);
728 proc_pid_flush(proc_dentry1
);
729 proc_pid_flush(proc_dentry2
);
731 BUG_ON(exit_state
!= EXIT_ZOMBIE
);
732 release_task(leader
);
736 * Now there are really no other threads at all,
737 * so it's safe to stop telling them to kill themselves.
742 BUG_ON(atomic_read(&sig
->count
) != 1);
745 if (atomic_read(&oldsighand
->count
) == 1) {
747 * Now that we nuked the rest of the thread group,
748 * it turns out we are not sharing sighand any more either.
749 * So we can just keep it.
751 kmem_cache_free(sighand_cachep
, newsighand
);
754 * Move our state over to newsighand and switch it in.
756 spin_lock_init(&newsighand
->siglock
);
757 atomic_set(&newsighand
->count
, 1);
758 memcpy(newsighand
->action
, oldsighand
->action
,
759 sizeof(newsighand
->action
));
761 write_lock_irq(&tasklist_lock
);
762 spin_lock(&oldsighand
->siglock
);
763 spin_lock(&newsighand
->siglock
);
765 current
->sighand
= newsighand
;
768 spin_unlock(&newsighand
->siglock
);
769 spin_unlock(&oldsighand
->siglock
);
770 write_unlock_irq(&tasklist_lock
);
772 if (atomic_dec_and_test(&oldsighand
->count
))
773 kmem_cache_free(sighand_cachep
, oldsighand
);
776 BUG_ON(!thread_group_empty(current
));
777 BUG_ON(!thread_group_leader(current
));
782 * These functions flushes out all traces of the currently running executable
783 * so that a new one can be started
786 static inline void flush_old_files(struct files_struct
* files
)
790 spin_lock(&files
->file_lock
);
792 unsigned long set
, i
;
796 if (i
>= files
->max_fds
|| i
>= files
->max_fdset
)
798 set
= files
->close_on_exec
->fds_bits
[j
];
801 files
->close_on_exec
->fds_bits
[j
] = 0;
802 spin_unlock(&files
->file_lock
);
803 for ( ; set
; i
++,set
>>= 1) {
808 spin_lock(&files
->file_lock
);
811 spin_unlock(&files
->file_lock
);
814 void get_task_comm(char *buf
, struct task_struct
*tsk
)
816 /* buf must be at least sizeof(tsk->comm) in size */
818 strncpy(buf
, tsk
->comm
, sizeof(tsk
->comm
));
822 void set_task_comm(struct task_struct
*tsk
, char *buf
)
825 strlcpy(tsk
->comm
, buf
, sizeof(tsk
->comm
));
829 int flush_old_exec(struct linux_binprm
* bprm
)
833 struct files_struct
*files
;
834 char tcomm
[sizeof(current
->comm
)];
837 * Make sure we have a private signal table and that
838 * we are unassociated from the previous thread group.
840 retval
= de_thread(current
);
845 * Make sure we have private file handles. Ask the
846 * fork helper to do the work for us and the exit
847 * helper to do the cleanup of the old one.
849 files
= current
->files
; /* refcounted so safe to hold */
850 retval
= unshare_files();
854 * Release all of the old mmap stuff
856 retval
= exec_mmap(bprm
->mm
);
860 bprm
->mm
= NULL
; /* We're using it now */
862 /* This is the point of no return */
864 put_files_struct(files
);
866 current
->sas_ss_sp
= current
->sas_ss_size
= 0;
868 if (current
->euid
== current
->uid
&& current
->egid
== current
->gid
)
869 current
->mm
->dumpable
= 1;
871 current
->mm
->dumpable
= suid_dumpable
;
873 name
= bprm
->filename
;
875 /* Copies the binary name from after last slash */
876 for (i
=0; (ch
= *(name
++)) != '\0';) {
878 i
= 0; /* overwrite what we wrote */
880 if (i
< (sizeof(tcomm
) - 1))
884 set_task_comm(current
, tcomm
);
886 current
->flags
&= ~PF_RANDOMIZE
;
889 if (bprm
->e_uid
!= current
->euid
|| bprm
->e_gid
!= current
->egid
||
890 permission(bprm
->file
->f_dentry
->d_inode
,MAY_READ
, NULL
) ||
891 (bprm
->interp_flags
& BINPRM_FLAGS_ENFORCE_NONDUMP
)) {
893 current
->mm
->dumpable
= suid_dumpable
;
896 /* An exec changes our domain. We are no longer part of the thread
899 current
->self_exec_id
++;
901 flush_signal_handlers(current
, 0);
902 flush_old_files(current
->files
);
907 put_files_struct(current
->files
);
908 current
->files
= files
;
913 EXPORT_SYMBOL(flush_old_exec
);
916 * Fill the binprm structure from the inode.
917 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
919 int prepare_binprm(struct linux_binprm
*bprm
)
922 struct inode
* inode
= bprm
->file
->f_dentry
->d_inode
;
925 mode
= inode
->i_mode
;
927 * Check execute perms again - if the caller has CAP_DAC_OVERRIDE,
928 * generic_permission lets a non-executable through
930 if (!(mode
& 0111)) /* with at least _one_ execute bit set */
932 if (bprm
->file
->f_op
== NULL
)
935 bprm
->e_uid
= current
->euid
;
936 bprm
->e_gid
= current
->egid
;
938 if(!(bprm
->file
->f_vfsmnt
->mnt_flags
& MNT_NOSUID
)) {
940 if (mode
& S_ISUID
) {
941 current
->personality
&= ~PER_CLEAR_ON_SETID
;
942 bprm
->e_uid
= inode
->i_uid
;
947 * If setgid is set but no group execute bit then this
948 * is a candidate for mandatory locking, not a setgid
951 if ((mode
& (S_ISGID
| S_IXGRP
)) == (S_ISGID
| S_IXGRP
)) {
952 current
->personality
&= ~PER_CLEAR_ON_SETID
;
953 bprm
->e_gid
= inode
->i_gid
;
957 /* fill in binprm security blob */
958 retval
= security_bprm_set(bprm
);
962 memset(bprm
->buf
,0,BINPRM_BUF_SIZE
);
963 return kernel_read(bprm
->file
,0,bprm
->buf
,BINPRM_BUF_SIZE
);
966 EXPORT_SYMBOL(prepare_binprm
);
968 static inline int unsafe_exec(struct task_struct
*p
)
971 if (p
->ptrace
& PT_PTRACED
) {
972 if (p
->ptrace
& PT_PTRACE_CAP
)
973 unsafe
|= LSM_UNSAFE_PTRACE_CAP
;
975 unsafe
|= LSM_UNSAFE_PTRACE
;
977 if (atomic_read(&p
->fs
->count
) > 1 ||
978 atomic_read(&p
->files
->count
) > 1 ||
979 atomic_read(&p
->sighand
->count
) > 1)
980 unsafe
|= LSM_UNSAFE_SHARE
;
985 void compute_creds(struct linux_binprm
*bprm
)
989 if (bprm
->e_uid
!= current
->uid
)
994 unsafe
= unsafe_exec(current
);
995 security_bprm_apply_creds(bprm
, unsafe
);
996 task_unlock(current
);
997 security_bprm_post_apply_creds(bprm
);
1000 EXPORT_SYMBOL(compute_creds
);
1002 void remove_arg_zero(struct linux_binprm
*bprm
)
1005 unsigned long offset
;
1009 offset
= bprm
->p
% PAGE_SIZE
;
1012 while (bprm
->p
++, *(kaddr
+offset
++)) {
1013 if (offset
!= PAGE_SIZE
)
1016 kunmap_atomic(kaddr
, KM_USER0
);
1018 page
= bprm
->page
[bprm
->p
/PAGE_SIZE
];
1019 kaddr
= kmap_atomic(page
, KM_USER0
);
1021 kunmap_atomic(kaddr
, KM_USER0
);
1026 EXPORT_SYMBOL(remove_arg_zero
);
1029 * cycle the list of binary formats handler, until one recognizes the image
1031 int search_binary_handler(struct linux_binprm
*bprm
,struct pt_regs
*regs
)
1034 struct linux_binfmt
*fmt
;
1036 /* handle /sbin/loader.. */
1038 struct exec
* eh
= (struct exec
*) bprm
->buf
;
1040 if (!bprm
->loader
&& eh
->fh
.f_magic
== 0x183 &&
1041 (eh
->fh
.f_flags
& 0x3000) == 0x3000)
1044 unsigned long loader
;
1046 allow_write_access(bprm
->file
);
1050 loader
= PAGE_SIZE
*MAX_ARG_PAGES
-sizeof(void *);
1052 file
= open_exec("/sbin/loader");
1053 retval
= PTR_ERR(file
);
1057 /* Remember if the application is TASO. */
1058 bprm
->sh_bang
= eh
->ah
.entry
< 0x100000000UL
;
1061 bprm
->loader
= loader
;
1062 retval
= prepare_binprm(bprm
);
1065 /* should call search_binary_handler recursively here,
1066 but it does not matter */
1070 retval
= security_bprm_check(bprm
);
1074 /* kernel module loader fixup */
1075 /* so we don't try to load run modprobe in kernel space. */
1078 for (try=0; try<2; try++) {
1079 read_lock(&binfmt_lock
);
1080 for (fmt
= formats
; fmt
; fmt
= fmt
->next
) {
1081 int (*fn
)(struct linux_binprm
*, struct pt_regs
*) = fmt
->load_binary
;
1084 if (!try_module_get(fmt
->module
))
1086 read_unlock(&binfmt_lock
);
1087 retval
= fn(bprm
, regs
);
1090 allow_write_access(bprm
->file
);
1094 current
->did_exec
= 1;
1097 read_lock(&binfmt_lock
);
1099 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
)
1102 read_unlock(&binfmt_lock
);
1106 read_unlock(&binfmt_lock
);
1107 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
) {
1111 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1112 if (printable(bprm
->buf
[0]) &&
1113 printable(bprm
->buf
[1]) &&
1114 printable(bprm
->buf
[2]) &&
1115 printable(bprm
->buf
[3]))
1116 break; /* -ENOEXEC */
1117 request_module("binfmt-%04x", *(unsigned short *)(&bprm
->buf
[2]));
1124 EXPORT_SYMBOL(search_binary_handler
);
1127 * sys_execve() executes a new program.
1129 int do_execve(char * filename
,
1130 char __user
*__user
*argv
,
1131 char __user
*__user
*envp
,
1132 struct pt_regs
* regs
)
1134 struct linux_binprm
*bprm
;
1140 bprm
= kmalloc(sizeof(*bprm
), GFP_KERNEL
);
1143 memset(bprm
, 0, sizeof(*bprm
));
1145 file
= open_exec(filename
);
1146 retval
= PTR_ERR(file
);
1152 bprm
->p
= PAGE_SIZE
*MAX_ARG_PAGES
-sizeof(void *);
1155 bprm
->filename
= filename
;
1156 bprm
->interp
= filename
;
1157 bprm
->mm
= mm_alloc();
1162 retval
= init_new_context(current
, bprm
->mm
);
1166 bprm
->argc
= count(argv
, bprm
->p
/ sizeof(void *));
1167 if ((retval
= bprm
->argc
) < 0)
1170 bprm
->envc
= count(envp
, bprm
->p
/ sizeof(void *));
1171 if ((retval
= bprm
->envc
) < 0)
1174 retval
= security_bprm_alloc(bprm
);
1178 retval
= prepare_binprm(bprm
);
1182 retval
= copy_strings_kernel(1, &bprm
->filename
, bprm
);
1186 bprm
->exec
= bprm
->p
;
1187 retval
= copy_strings(bprm
->envc
, envp
, bprm
);
1191 retval
= copy_strings(bprm
->argc
, argv
, bprm
);
1195 retval
= search_binary_handler(bprm
,regs
);
1197 free_arg_pages(bprm
);
1199 /* execve success */
1200 security_bprm_free(bprm
);
1201 acct_update_integrals(current
);
1202 update_mem_hiwater(current
);
1208 /* Something went wrong, return the inode and free the argument pages*/
1209 for (i
= 0 ; i
< MAX_ARG_PAGES
; i
++) {
1210 struct page
* page
= bprm
->page
[i
];
1216 security_bprm_free(bprm
);
1224 allow_write_access(bprm
->file
);
1235 int set_binfmt(struct linux_binfmt
*new)
1237 struct linux_binfmt
*old
= current
->binfmt
;
1240 if (!try_module_get(new->module
))
1243 current
->binfmt
= new;
1245 module_put(old
->module
);
1249 EXPORT_SYMBOL(set_binfmt
);
1251 #define CORENAME_MAX_SIZE 64
1253 /* format_corename will inspect the pattern parameter, and output a
1254 * name into corename, which must have space for at least
1255 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1257 static void format_corename(char *corename
, const char *pattern
, long signr
)
1259 const char *pat_ptr
= pattern
;
1260 char *out_ptr
= corename
;
1261 char *const out_end
= corename
+ CORENAME_MAX_SIZE
;
1263 int pid_in_pattern
= 0;
1265 /* Repeat as long as we have more pattern to process and more output
1268 if (*pat_ptr
!= '%') {
1269 if (out_ptr
== out_end
)
1271 *out_ptr
++ = *pat_ptr
++;
1273 switch (*++pat_ptr
) {
1276 /* Double percent, output one percent */
1278 if (out_ptr
== out_end
)
1285 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1286 "%d", current
->tgid
);
1287 if (rc
> out_end
- out_ptr
)
1293 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1294 "%d", current
->uid
);
1295 if (rc
> out_end
- out_ptr
)
1301 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1302 "%d", current
->gid
);
1303 if (rc
> out_end
- out_ptr
)
1307 /* signal that caused the coredump */
1309 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1311 if (rc
> out_end
- out_ptr
)
1315 /* UNIX time of coredump */
1318 do_gettimeofday(&tv
);
1319 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1321 if (rc
> out_end
- out_ptr
)
1328 down_read(&uts_sem
);
1329 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1330 "%s", system_utsname
.nodename
);
1332 if (rc
> out_end
- out_ptr
)
1338 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1339 "%s", current
->comm
);
1340 if (rc
> out_end
- out_ptr
)
1350 /* Backward compatibility with core_uses_pid:
1352 * If core_pattern does not include a %p (as is the default)
1353 * and core_uses_pid is set, then .%pid will be appended to
1356 && (core_uses_pid
|| atomic_read(¤t
->mm
->mm_users
) != 1)) {
1357 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1358 ".%d", current
->tgid
);
1359 if (rc
> out_end
- out_ptr
)
1367 static void zap_threads (struct mm_struct
*mm
)
1369 struct task_struct
*g
, *p
;
1370 struct task_struct
*tsk
= current
;
1371 struct completion
*vfork_done
= tsk
->vfork_done
;
1375 * Make sure nobody is waiting for us to release the VM,
1376 * otherwise we can deadlock when we wait on each other
1379 tsk
->vfork_done
= NULL
;
1380 complete(vfork_done
);
1383 read_lock(&tasklist_lock
);
1385 if (mm
== p
->mm
&& p
!= tsk
) {
1386 force_sig_specific(SIGKILL
, p
);
1388 if (unlikely(p
->ptrace
) &&
1389 unlikely(p
->parent
->mm
== mm
))
1392 while_each_thread(g
,p
);
1394 read_unlock(&tasklist_lock
);
1396 if (unlikely(traced
)) {
1398 * We are zapping a thread and the thread it ptraces.
1399 * If the tracee went into a ptrace stop for exit tracing,
1400 * we could deadlock since the tracer is waiting for this
1401 * coredump to finish. Detach them so they can both die.
1403 write_lock_irq(&tasklist_lock
);
1404 do_each_thread(g
,p
) {
1405 if (mm
== p
->mm
&& p
!= tsk
&&
1406 p
->ptrace
&& p
->parent
->mm
== mm
) {
1409 } while_each_thread(g
,p
);
1410 write_unlock_irq(&tasklist_lock
);
1414 static void coredump_wait(struct mm_struct
*mm
)
1416 DECLARE_COMPLETION(startup_done
);
1418 mm
->core_waiters
++; /* let other threads block */
1419 mm
->core_startup_done
= &startup_done
;
1421 /* give other threads a chance to run: */
1425 if (--mm
->core_waiters
) {
1426 up_write(&mm
->mmap_sem
);
1427 wait_for_completion(&startup_done
);
1429 up_write(&mm
->mmap_sem
);
1430 BUG_ON(mm
->core_waiters
);
1433 int do_coredump(long signr
, int exit_code
, struct pt_regs
* regs
)
1435 char corename
[CORENAME_MAX_SIZE
+ 1];
1436 struct mm_struct
*mm
= current
->mm
;
1437 struct linux_binfmt
* binfmt
;
1438 struct inode
* inode
;
1441 int fsuid
= current
->fsuid
;
1444 binfmt
= current
->binfmt
;
1445 if (!binfmt
|| !binfmt
->core_dump
)
1447 down_write(&mm
->mmap_sem
);
1448 if (!mm
->dumpable
) {
1449 up_write(&mm
->mmap_sem
);
1454 * We cannot trust fsuid as being the "true" uid of the
1455 * process nor do we know its entire history. We only know it
1456 * was tainted so we dump it as root in mode 2.
1458 if (mm
->dumpable
== 2) { /* Setuid core dump mode */
1459 flag
= O_EXCL
; /* Stop rewrite attacks */
1460 current
->fsuid
= 0; /* Dump root private */
1463 init_completion(&mm
->core_done
);
1464 spin_lock_irq(¤t
->sighand
->siglock
);
1465 current
->signal
->flags
= SIGNAL_GROUP_EXIT
;
1466 current
->signal
->group_exit_code
= exit_code
;
1467 spin_unlock_irq(¤t
->sighand
->siglock
);
1471 * Clear any false indication of pending signals that might
1472 * be seen by the filesystem code called to write the core file.
1474 current
->signal
->group_stop_count
= 0;
1475 clear_thread_flag(TIF_SIGPENDING
);
1477 if (current
->signal
->rlim
[RLIMIT_CORE
].rlim_cur
< binfmt
->min_coredump
)
1481 * lock_kernel() because format_corename() is controlled by sysctl, which
1482 * uses lock_kernel()
1485 format_corename(corename
, core_pattern
, signr
);
1487 file
= filp_open(corename
, O_CREAT
| 2 | O_NOFOLLOW
| O_LARGEFILE
| flag
, 0600);
1490 inode
= file
->f_dentry
->d_inode
;
1491 if (inode
->i_nlink
> 1)
1492 goto close_fail
; /* multiple links - don't dump */
1493 if (d_unhashed(file
->f_dentry
))
1496 if (!S_ISREG(inode
->i_mode
))
1500 if (!file
->f_op
->write
)
1502 if (do_truncate(file
->f_dentry
, 0) != 0)
1505 retval
= binfmt
->core_dump(signr
, regs
, file
);
1508 current
->signal
->group_exit_code
|= 0x80;
1510 filp_close(file
, NULL
);
1512 current
->fsuid
= fsuid
;
1513 complete_all(&mm
->core_done
);