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 /* The maximal length of core_pattern is also specified in sysctl.c */
63 static struct linux_binfmt
*formats
;
64 static DEFINE_RWLOCK(binfmt_lock
);
66 int register_binfmt(struct linux_binfmt
* fmt
)
68 struct linux_binfmt
** tmp
= &formats
;
74 write_lock(&binfmt_lock
);
77 write_unlock(&binfmt_lock
);
84 write_unlock(&binfmt_lock
);
88 EXPORT_SYMBOL(register_binfmt
);
90 int unregister_binfmt(struct linux_binfmt
* fmt
)
92 struct linux_binfmt
** tmp
= &formats
;
94 write_lock(&binfmt_lock
);
98 write_unlock(&binfmt_lock
);
103 write_unlock(&binfmt_lock
);
107 EXPORT_SYMBOL(unregister_binfmt
);
109 static inline void put_binfmt(struct linux_binfmt
* fmt
)
111 module_put(fmt
->module
);
115 * Note that a shared library must be both readable and executable due to
118 * Also note that we take the address to load from from the file itself.
120 asmlinkage
long sys_uselib(const char __user
* library
)
126 nd
.intent
.open
.flags
= FMODE_READ
;
127 error
= __user_walk(library
, LOOKUP_FOLLOW
|LOOKUP_OPEN
, &nd
);
132 if (!S_ISREG(nd
.dentry
->d_inode
->i_mode
))
135 error
= permission(nd
.dentry
->d_inode
, MAY_READ
| MAY_EXEC
, &nd
);
139 file
= dentry_open(nd
.dentry
, nd
.mnt
, O_RDONLY
);
140 error
= PTR_ERR(file
);
146 struct linux_binfmt
* fmt
;
148 read_lock(&binfmt_lock
);
149 for (fmt
= formats
; fmt
; fmt
= fmt
->next
) {
150 if (!fmt
->load_shlib
)
152 if (!try_module_get(fmt
->module
))
154 read_unlock(&binfmt_lock
);
155 error
= fmt
->load_shlib(file
);
156 read_lock(&binfmt_lock
);
158 if (error
!= -ENOEXEC
)
161 read_unlock(&binfmt_lock
);
172 * count() counts the number of strings in array ARGV.
174 static int count(char __user
* __user
* argv
, int max
)
182 if (get_user(p
, argv
))
196 * 'copy_strings()' copies argument/environment strings from user
197 * memory to free pages in kernel mem. These are in a format ready
198 * to be put directly into the top of new user memory.
200 int copy_strings(int argc
,char __user
* __user
* argv
, struct linux_binprm
*bprm
)
202 struct page
*kmapped_page
= NULL
;
211 if (get_user(str
, argv
+argc
) ||
212 !(len
= strnlen_user(str
, bprm
->p
))) {
223 /* XXX: add architecture specific overflow check here. */
228 int offset
, bytes_to_copy
;
231 offset
= pos
% PAGE_SIZE
;
233 page
= bprm
->page
[i
];
236 page
= alloc_page(GFP_HIGHUSER
);
237 bprm
->page
[i
] = page
;
245 if (page
!= kmapped_page
) {
247 kunmap(kmapped_page
);
249 kaddr
= kmap(kmapped_page
);
252 memset(kaddr
, 0, offset
);
253 bytes_to_copy
= PAGE_SIZE
- offset
;
254 if (bytes_to_copy
> len
) {
257 memset(kaddr
+offset
+len
, 0,
258 PAGE_SIZE
-offset
-len
);
260 err
= copy_from_user(kaddr
+offset
, str
, bytes_to_copy
);
266 pos
+= bytes_to_copy
;
267 str
+= bytes_to_copy
;
268 len
-= bytes_to_copy
;
274 kunmap(kmapped_page
);
279 * Like copy_strings, but get argv and its values from kernel memory.
281 int copy_strings_kernel(int argc
,char ** argv
, struct linux_binprm
*bprm
)
284 mm_segment_t oldfs
= get_fs();
286 r
= copy_strings(argc
, (char __user
* __user
*)argv
, bprm
);
291 EXPORT_SYMBOL(copy_strings_kernel
);
295 * This routine is used to map in a page into an address space: needed by
296 * execve() for the initial stack and environment pages.
298 * vma->vm_mm->mmap_sem is held for writing.
300 void install_arg_page(struct vm_area_struct
*vma
,
301 struct page
*page
, unsigned long address
)
303 struct mm_struct
*mm
= vma
->vm_mm
;
309 if (unlikely(anon_vma_prepare(vma
)))
312 flush_dcache_page(page
);
313 pgd
= pgd_offset(mm
, address
);
315 spin_lock(&mm
->page_table_lock
);
316 pud
= pud_alloc(mm
, pgd
, address
);
319 pmd
= pmd_alloc(mm
, pud
, address
);
322 pte
= pte_alloc_map(mm
, pmd
, address
);
325 if (!pte_none(*pte
)) {
329 inc_mm_counter(mm
, rss
);
330 lru_cache_add_active(page
);
331 set_pte_at(mm
, address
, pte
, pte_mkdirty(pte_mkwrite(mk_pte(
332 page
, vma
->vm_page_prot
))));
333 page_add_anon_rmap(page
, vma
, address
);
335 spin_unlock(&mm
->page_table_lock
);
337 /* no need for flush_tlb */
340 spin_unlock(&mm
->page_table_lock
);
343 force_sig(SIGKILL
, current
);
346 #define EXTRA_STACK_VM_PAGES 20 /* random */
348 int setup_arg_pages(struct linux_binprm
*bprm
,
349 unsigned long stack_top
,
350 int executable_stack
)
352 unsigned long stack_base
;
353 struct vm_area_struct
*mpnt
;
354 struct mm_struct
*mm
= current
->mm
;
358 #ifdef CONFIG_STACK_GROWSUP
359 /* Move the argument and environment strings to the bottom of the
365 /* Start by shifting all the pages down */
367 for (j
= 0; j
< MAX_ARG_PAGES
; j
++) {
368 struct page
*page
= bprm
->page
[j
];
371 bprm
->page
[i
++] = page
;
374 /* Now move them within their pages */
375 offset
= bprm
->p
% PAGE_SIZE
;
376 to
= kmap(bprm
->page
[0]);
377 for (j
= 1; j
< i
; j
++) {
378 memmove(to
, to
+ offset
, PAGE_SIZE
- offset
);
379 from
= kmap(bprm
->page
[j
]);
380 memcpy(to
+ PAGE_SIZE
- offset
, from
, offset
);
381 kunmap(bprm
->page
[j
- 1]);
384 memmove(to
, to
+ offset
, PAGE_SIZE
- offset
);
385 kunmap(bprm
->page
[j
- 1]);
387 /* Limit stack size to 1GB */
388 stack_base
= current
->signal
->rlim
[RLIMIT_STACK
].rlim_max
;
389 if (stack_base
> (1 << 30))
390 stack_base
= 1 << 30;
391 stack_base
= PAGE_ALIGN(stack_top
- stack_base
);
393 /* Adjust bprm->p to point to the end of the strings. */
394 bprm
->p
= stack_base
+ PAGE_SIZE
* i
- offset
;
396 mm
->arg_start
= stack_base
;
397 arg_size
= i
<< PAGE_SHIFT
;
399 /* zero pages that were copied above */
400 while (i
< MAX_ARG_PAGES
)
401 bprm
->page
[i
++] = NULL
;
403 stack_base
= arch_align_stack(stack_top
- MAX_ARG_PAGES
*PAGE_SIZE
);
404 stack_base
= PAGE_ALIGN(stack_base
);
405 bprm
->p
+= stack_base
;
406 mm
->arg_start
= bprm
->p
;
407 arg_size
= stack_top
- (PAGE_MASK
& (unsigned long) mm
->arg_start
);
410 arg_size
+= EXTRA_STACK_VM_PAGES
* PAGE_SIZE
;
413 bprm
->loader
+= stack_base
;
414 bprm
->exec
+= stack_base
;
416 mpnt
= kmem_cache_alloc(vm_area_cachep
, SLAB_KERNEL
);
420 if (security_vm_enough_memory(arg_size
>> PAGE_SHIFT
)) {
421 kmem_cache_free(vm_area_cachep
, mpnt
);
425 memset(mpnt
, 0, sizeof(*mpnt
));
427 down_write(&mm
->mmap_sem
);
430 #ifdef CONFIG_STACK_GROWSUP
431 mpnt
->vm_start
= stack_base
;
432 mpnt
->vm_end
= stack_base
+ arg_size
;
434 mpnt
->vm_end
= stack_top
;
435 mpnt
->vm_start
= mpnt
->vm_end
- arg_size
;
437 /* Adjust stack execute permissions; explicitly enable
438 * for EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X
439 * and leave alone (arch default) otherwise. */
440 if (unlikely(executable_stack
== EXSTACK_ENABLE_X
))
441 mpnt
->vm_flags
= VM_STACK_FLAGS
| VM_EXEC
;
442 else if (executable_stack
== EXSTACK_DISABLE_X
)
443 mpnt
->vm_flags
= VM_STACK_FLAGS
& ~VM_EXEC
;
445 mpnt
->vm_flags
= VM_STACK_FLAGS
;
446 mpnt
->vm_flags
|= mm
->def_flags
;
447 mpnt
->vm_page_prot
= protection_map
[mpnt
->vm_flags
& 0x7];
448 if ((ret
= insert_vm_struct(mm
, mpnt
))) {
449 up_write(&mm
->mmap_sem
);
450 kmem_cache_free(vm_area_cachep
, mpnt
);
453 mm
->stack_vm
= mm
->total_vm
= vma_pages(mpnt
);
456 for (i
= 0 ; i
< MAX_ARG_PAGES
; i
++) {
457 struct page
*page
= bprm
->page
[i
];
459 bprm
->page
[i
] = NULL
;
460 install_arg_page(mpnt
, page
, stack_base
);
462 stack_base
+= PAGE_SIZE
;
464 up_write(&mm
->mmap_sem
);
469 EXPORT_SYMBOL(setup_arg_pages
);
471 #define free_arg_pages(bprm) do { } while (0)
475 static inline void free_arg_pages(struct linux_binprm
*bprm
)
479 for (i
= 0; i
< MAX_ARG_PAGES
; i
++) {
481 __free_page(bprm
->page
[i
]);
482 bprm
->page
[i
] = NULL
;
486 #endif /* CONFIG_MMU */
488 struct file
*open_exec(const char *name
)
494 nd
.intent
.open
.flags
= FMODE_READ
;
495 err
= path_lookup(name
, LOOKUP_FOLLOW
|LOOKUP_OPEN
, &nd
);
499 struct inode
*inode
= nd
.dentry
->d_inode
;
500 file
= ERR_PTR(-EACCES
);
501 if (!(nd
.mnt
->mnt_flags
& MNT_NOEXEC
) &&
502 S_ISREG(inode
->i_mode
)) {
503 int err
= permission(inode
, MAY_EXEC
, &nd
);
504 if (!err
&& !(inode
->i_mode
& 0111))
508 file
= dentry_open(nd
.dentry
, nd
.mnt
, O_RDONLY
);
510 err
= deny_write_access(file
);
525 EXPORT_SYMBOL(open_exec
);
527 int kernel_read(struct file
*file
, unsigned long offset
,
528 char *addr
, unsigned long count
)
536 /* The cast to a user pointer is valid due to the set_fs() */
537 result
= vfs_read(file
, (void __user
*)addr
, count
, &pos
);
542 EXPORT_SYMBOL(kernel_read
);
544 static int exec_mmap(struct mm_struct
*mm
)
546 struct task_struct
*tsk
;
547 struct mm_struct
* old_mm
, *active_mm
;
549 /* Notify parent that we're no longer interested in the old VM */
551 old_mm
= current
->mm
;
552 mm_release(tsk
, old_mm
);
556 * Make sure that if there is a core dump in progress
557 * for the old mm, we get out and die instead of going
558 * through with the exec. We must hold mmap_sem around
559 * checking core_waiters and changing tsk->mm. The
560 * core-inducing thread will increment core_waiters for
561 * each thread whose ->mm == old_mm.
563 down_read(&old_mm
->mmap_sem
);
564 if (unlikely(old_mm
->core_waiters
)) {
565 up_read(&old_mm
->mmap_sem
);
570 active_mm
= tsk
->active_mm
;
573 activate_mm(active_mm
, mm
);
575 arch_pick_mmap_layout(mm
);
577 up_read(&old_mm
->mmap_sem
);
578 if (active_mm
!= old_mm
) BUG();
587 * This function makes sure the current process has its own signal table,
588 * so that flush_signal_handlers can later reset the handlers without
589 * disturbing other processes. (Other processes might share the signal
590 * table via the CLONE_SIGHAND option to clone().)
592 static inline int de_thread(struct task_struct
*tsk
)
594 struct signal_struct
*sig
= tsk
->signal
;
595 struct sighand_struct
*newsighand
, *oldsighand
= tsk
->sighand
;
596 spinlock_t
*lock
= &oldsighand
->siglock
;
600 * If we don't share sighandlers, then we aren't sharing anything
601 * and we can just re-use it all.
603 if (atomic_read(&oldsighand
->count
) <= 1) {
604 BUG_ON(atomic_read(&sig
->count
) != 1);
609 newsighand
= kmem_cache_alloc(sighand_cachep
, GFP_KERNEL
);
613 if (thread_group_empty(current
))
614 goto no_thread_group
;
617 * Kill all other threads in the thread group.
618 * We must hold tasklist_lock to call zap_other_threads.
620 read_lock(&tasklist_lock
);
622 if (sig
->flags
& SIGNAL_GROUP_EXIT
) {
624 * Another group action in progress, just
625 * return so that the signal is processed.
627 spin_unlock_irq(lock
);
628 read_unlock(&tasklist_lock
);
629 kmem_cache_free(sighand_cachep
, newsighand
);
632 zap_other_threads(current
);
633 read_unlock(&tasklist_lock
);
636 * Account for the thread group leader hanging around:
639 if (thread_group_leader(current
))
641 while (atomic_read(&sig
->count
) > count
) {
642 sig
->group_exit_task
= current
;
643 sig
->notify_count
= count
;
644 __set_current_state(TASK_UNINTERRUPTIBLE
);
645 spin_unlock_irq(lock
);
649 sig
->group_exit_task
= NULL
;
650 sig
->notify_count
= 0;
651 spin_unlock_irq(lock
);
654 * At this point all other threads have exited, all we have to
655 * do is to wait for the thread group leader to become inactive,
656 * and to assume its PID:
658 if (!thread_group_leader(current
)) {
659 struct task_struct
*leader
= current
->group_leader
, *parent
;
660 struct dentry
*proc_dentry1
, *proc_dentry2
;
661 unsigned long exit_state
, ptrace
;
664 * Wait for the thread group leader to be a zombie.
665 * It should already be zombie at this point, most
668 while (leader
->exit_state
!= EXIT_ZOMBIE
)
671 spin_lock(&leader
->proc_lock
);
672 spin_lock(¤t
->proc_lock
);
673 proc_dentry1
= proc_pid_unhash(current
);
674 proc_dentry2
= proc_pid_unhash(leader
);
675 write_lock_irq(&tasklist_lock
);
677 if (leader
->tgid
!= current
->tgid
)
679 if (current
->pid
== current
->tgid
)
682 * An exec() starts a new thread group with the
683 * TGID of the previous thread group. Rehash the
684 * two threads with a switched PID, and release
685 * the former thread group leader:
687 ptrace
= leader
->ptrace
;
688 parent
= leader
->parent
;
689 if (unlikely(ptrace
) && unlikely(parent
== current
)) {
691 * Joker was ptracing his own group leader,
692 * and now he wants to be his own parent!
693 * We can't have that.
698 ptrace_unlink(current
);
699 ptrace_unlink(leader
);
700 remove_parent(current
);
701 remove_parent(leader
);
703 switch_exec_pids(leader
, current
);
705 current
->parent
= current
->real_parent
= leader
->real_parent
;
706 leader
->parent
= leader
->real_parent
= child_reaper
;
707 current
->group_leader
= current
;
708 leader
->group_leader
= leader
;
710 add_parent(current
, current
->parent
);
711 add_parent(leader
, leader
->parent
);
713 current
->ptrace
= ptrace
;
714 __ptrace_link(current
, parent
);
717 list_del(¤t
->tasks
);
718 list_add_tail(¤t
->tasks
, &init_task
.tasks
);
719 current
->exit_signal
= SIGCHLD
;
720 exit_state
= leader
->exit_state
;
722 write_unlock_irq(&tasklist_lock
);
723 spin_unlock(&leader
->proc_lock
);
724 spin_unlock(¤t
->proc_lock
);
725 proc_pid_flush(proc_dentry1
);
726 proc_pid_flush(proc_dentry2
);
728 if (exit_state
!= EXIT_ZOMBIE
)
730 release_task(leader
);
734 * Now there are really no other threads at all,
735 * so it's safe to stop telling them to kill themselves.
740 BUG_ON(atomic_read(&sig
->count
) != 1);
743 if (atomic_read(&oldsighand
->count
) == 1) {
745 * Now that we nuked the rest of the thread group,
746 * it turns out we are not sharing sighand any more either.
747 * So we can just keep it.
749 kmem_cache_free(sighand_cachep
, newsighand
);
752 * Move our state over to newsighand and switch it in.
754 spin_lock_init(&newsighand
->siglock
);
755 atomic_set(&newsighand
->count
, 1);
756 memcpy(newsighand
->action
, oldsighand
->action
,
757 sizeof(newsighand
->action
));
759 write_lock_irq(&tasklist_lock
);
760 spin_lock(&oldsighand
->siglock
);
761 spin_lock(&newsighand
->siglock
);
763 current
->sighand
= newsighand
;
766 spin_unlock(&newsighand
->siglock
);
767 spin_unlock(&oldsighand
->siglock
);
768 write_unlock_irq(&tasklist_lock
);
770 if (atomic_dec_and_test(&oldsighand
->count
))
771 kmem_cache_free(sighand_cachep
, oldsighand
);
774 if (!thread_group_empty(current
))
776 if (!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;
870 name
= bprm
->filename
;
871 for (i
=0; (ch
= *(name
++)) != '\0';) {
875 if (i
< (sizeof(tcomm
) - 1))
879 set_task_comm(current
, tcomm
);
881 current
->flags
&= ~PF_RANDOMIZE
;
884 if (bprm
->e_uid
!= current
->euid
|| bprm
->e_gid
!= current
->egid
||
885 permission(bprm
->file
->f_dentry
->d_inode
,MAY_READ
, NULL
) ||
886 (bprm
->interp_flags
& BINPRM_FLAGS_ENFORCE_NONDUMP
)) {
888 current
->mm
->dumpable
= 0;
891 /* An exec changes our domain. We are no longer part of the thread
894 current
->self_exec_id
++;
896 flush_signal_handlers(current
, 0);
897 flush_old_files(current
->files
);
902 put_files_struct(current
->files
);
903 current
->files
= files
;
908 EXPORT_SYMBOL(flush_old_exec
);
911 * Fill the binprm structure from the inode.
912 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
914 int prepare_binprm(struct linux_binprm
*bprm
)
917 struct inode
* inode
= bprm
->file
->f_dentry
->d_inode
;
920 mode
= inode
->i_mode
;
922 * Check execute perms again - if the caller has CAP_DAC_OVERRIDE,
923 * generic_permission lets a non-executable through
925 if (!(mode
& 0111)) /* with at least _one_ execute bit set */
927 if (bprm
->file
->f_op
== NULL
)
930 bprm
->e_uid
= current
->euid
;
931 bprm
->e_gid
= current
->egid
;
933 if(!(bprm
->file
->f_vfsmnt
->mnt_flags
& MNT_NOSUID
)) {
935 if (mode
& S_ISUID
) {
936 current
->personality
&= ~PER_CLEAR_ON_SETID
;
937 bprm
->e_uid
= inode
->i_uid
;
942 * If setgid is set but no group execute bit then this
943 * is a candidate for mandatory locking, not a setgid
946 if ((mode
& (S_ISGID
| S_IXGRP
)) == (S_ISGID
| S_IXGRP
)) {
947 current
->personality
&= ~PER_CLEAR_ON_SETID
;
948 bprm
->e_gid
= inode
->i_gid
;
952 /* fill in binprm security blob */
953 retval
= security_bprm_set(bprm
);
957 memset(bprm
->buf
,0,BINPRM_BUF_SIZE
);
958 return kernel_read(bprm
->file
,0,bprm
->buf
,BINPRM_BUF_SIZE
);
961 EXPORT_SYMBOL(prepare_binprm
);
963 static inline int unsafe_exec(struct task_struct
*p
)
966 if (p
->ptrace
& PT_PTRACED
) {
967 if (p
->ptrace
& PT_PTRACE_CAP
)
968 unsafe
|= LSM_UNSAFE_PTRACE_CAP
;
970 unsafe
|= LSM_UNSAFE_PTRACE
;
972 if (atomic_read(&p
->fs
->count
) > 1 ||
973 atomic_read(&p
->files
->count
) > 1 ||
974 atomic_read(&p
->sighand
->count
) > 1)
975 unsafe
|= LSM_UNSAFE_SHARE
;
980 void compute_creds(struct linux_binprm
*bprm
)
984 if (bprm
->e_uid
!= current
->uid
)
989 unsafe
= unsafe_exec(current
);
990 security_bprm_apply_creds(bprm
, unsafe
);
991 task_unlock(current
);
992 security_bprm_post_apply_creds(bprm
);
995 EXPORT_SYMBOL(compute_creds
);
997 void remove_arg_zero(struct linux_binprm
*bprm
)
1000 unsigned long offset
;
1004 offset
= bprm
->p
% PAGE_SIZE
;
1007 while (bprm
->p
++, *(kaddr
+offset
++)) {
1008 if (offset
!= PAGE_SIZE
)
1011 kunmap_atomic(kaddr
, KM_USER0
);
1013 page
= bprm
->page
[bprm
->p
/PAGE_SIZE
];
1014 kaddr
= kmap_atomic(page
, KM_USER0
);
1016 kunmap_atomic(kaddr
, KM_USER0
);
1021 EXPORT_SYMBOL(remove_arg_zero
);
1024 * cycle the list of binary formats handler, until one recognizes the image
1026 int search_binary_handler(struct linux_binprm
*bprm
,struct pt_regs
*regs
)
1029 struct linux_binfmt
*fmt
;
1031 /* handle /sbin/loader.. */
1033 struct exec
* eh
= (struct exec
*) bprm
->buf
;
1035 if (!bprm
->loader
&& eh
->fh
.f_magic
== 0x183 &&
1036 (eh
->fh
.f_flags
& 0x3000) == 0x3000)
1039 unsigned long loader
;
1041 allow_write_access(bprm
->file
);
1045 loader
= PAGE_SIZE
*MAX_ARG_PAGES
-sizeof(void *);
1047 file
= open_exec("/sbin/loader");
1048 retval
= PTR_ERR(file
);
1052 /* Remember if the application is TASO. */
1053 bprm
->sh_bang
= eh
->ah
.entry
< 0x100000000UL
;
1056 bprm
->loader
= loader
;
1057 retval
= prepare_binprm(bprm
);
1060 /* should call search_binary_handler recursively here,
1061 but it does not matter */
1065 retval
= security_bprm_check(bprm
);
1069 /* kernel module loader fixup */
1070 /* so we don't try to load run modprobe in kernel space. */
1073 for (try=0; try<2; try++) {
1074 read_lock(&binfmt_lock
);
1075 for (fmt
= formats
; fmt
; fmt
= fmt
->next
) {
1076 int (*fn
)(struct linux_binprm
*, struct pt_regs
*) = fmt
->load_binary
;
1079 if (!try_module_get(fmt
->module
))
1081 read_unlock(&binfmt_lock
);
1082 retval
= fn(bprm
, regs
);
1085 allow_write_access(bprm
->file
);
1089 current
->did_exec
= 1;
1092 read_lock(&binfmt_lock
);
1094 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
)
1097 read_unlock(&binfmt_lock
);
1101 read_unlock(&binfmt_lock
);
1102 if (retval
!= -ENOEXEC
|| bprm
->mm
== NULL
) {
1106 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1107 if (printable(bprm
->buf
[0]) &&
1108 printable(bprm
->buf
[1]) &&
1109 printable(bprm
->buf
[2]) &&
1110 printable(bprm
->buf
[3]))
1111 break; /* -ENOEXEC */
1112 request_module("binfmt-%04x", *(unsigned short *)(&bprm
->buf
[2]));
1119 EXPORT_SYMBOL(search_binary_handler
);
1122 * sys_execve() executes a new program.
1124 int do_execve(char * filename
,
1125 char __user
*__user
*argv
,
1126 char __user
*__user
*envp
,
1127 struct pt_regs
* regs
)
1129 struct linux_binprm
*bprm
;
1135 bprm
= kmalloc(sizeof(*bprm
), GFP_KERNEL
);
1138 memset(bprm
, 0, sizeof(*bprm
));
1140 file
= open_exec(filename
);
1141 retval
= PTR_ERR(file
);
1147 bprm
->p
= PAGE_SIZE
*MAX_ARG_PAGES
-sizeof(void *);
1150 bprm
->filename
= filename
;
1151 bprm
->interp
= filename
;
1152 bprm
->mm
= mm_alloc();
1157 retval
= init_new_context(current
, bprm
->mm
);
1161 bprm
->argc
= count(argv
, bprm
->p
/ sizeof(void *));
1162 if ((retval
= bprm
->argc
) < 0)
1165 bprm
->envc
= count(envp
, bprm
->p
/ sizeof(void *));
1166 if ((retval
= bprm
->envc
) < 0)
1169 retval
= security_bprm_alloc(bprm
);
1173 retval
= prepare_binprm(bprm
);
1177 retval
= copy_strings_kernel(1, &bprm
->filename
, bprm
);
1181 bprm
->exec
= bprm
->p
;
1182 retval
= copy_strings(bprm
->envc
, envp
, bprm
);
1186 retval
= copy_strings(bprm
->argc
, argv
, bprm
);
1190 retval
= search_binary_handler(bprm
,regs
);
1192 free_arg_pages(bprm
);
1194 /* execve success */
1195 security_bprm_free(bprm
);
1196 acct_update_integrals(current
);
1197 update_mem_hiwater(current
);
1203 /* Something went wrong, return the inode and free the argument pages*/
1204 for (i
= 0 ; i
< MAX_ARG_PAGES
; i
++) {
1205 struct page
* page
= bprm
->page
[i
];
1211 security_bprm_free(bprm
);
1219 allow_write_access(bprm
->file
);
1230 int set_binfmt(struct linux_binfmt
*new)
1232 struct linux_binfmt
*old
= current
->binfmt
;
1235 if (!try_module_get(new->module
))
1238 current
->binfmt
= new;
1240 module_put(old
->module
);
1244 EXPORT_SYMBOL(set_binfmt
);
1246 #define CORENAME_MAX_SIZE 64
1248 /* format_corename will inspect the pattern parameter, and output a
1249 * name into corename, which must have space for at least
1250 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1252 static void format_corename(char *corename
, const char *pattern
, long signr
)
1254 const char *pat_ptr
= pattern
;
1255 char *out_ptr
= corename
;
1256 char *const out_end
= corename
+ CORENAME_MAX_SIZE
;
1258 int pid_in_pattern
= 0;
1260 /* Repeat as long as we have more pattern to process and more output
1263 if (*pat_ptr
!= '%') {
1264 if (out_ptr
== out_end
)
1266 *out_ptr
++ = *pat_ptr
++;
1268 switch (*++pat_ptr
) {
1271 /* Double percent, output one percent */
1273 if (out_ptr
== out_end
)
1280 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1281 "%d", current
->tgid
);
1282 if (rc
> out_end
- out_ptr
)
1288 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1289 "%d", current
->uid
);
1290 if (rc
> out_end
- out_ptr
)
1296 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1297 "%d", current
->gid
);
1298 if (rc
> out_end
- out_ptr
)
1302 /* signal that caused the coredump */
1304 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1306 if (rc
> out_end
- out_ptr
)
1310 /* UNIX time of coredump */
1313 do_gettimeofday(&tv
);
1314 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1316 if (rc
> out_end
- out_ptr
)
1323 down_read(&uts_sem
);
1324 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1325 "%s", system_utsname
.nodename
);
1327 if (rc
> out_end
- out_ptr
)
1333 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1334 "%s", current
->comm
);
1335 if (rc
> out_end
- out_ptr
)
1345 /* Backward compatibility with core_uses_pid:
1347 * If core_pattern does not include a %p (as is the default)
1348 * and core_uses_pid is set, then .%pid will be appended to
1351 && (core_uses_pid
|| atomic_read(¤t
->mm
->mm_users
) != 1)) {
1352 rc
= snprintf(out_ptr
, out_end
- out_ptr
,
1353 ".%d", current
->tgid
);
1354 if (rc
> out_end
- out_ptr
)
1362 static void zap_threads (struct mm_struct
*mm
)
1364 struct task_struct
*g
, *p
;
1365 struct task_struct
*tsk
= current
;
1366 struct completion
*vfork_done
= tsk
->vfork_done
;
1370 * Make sure nobody is waiting for us to release the VM,
1371 * otherwise we can deadlock when we wait on each other
1374 tsk
->vfork_done
= NULL
;
1375 complete(vfork_done
);
1378 read_lock(&tasklist_lock
);
1380 if (mm
== p
->mm
&& p
!= tsk
) {
1381 force_sig_specific(SIGKILL
, p
);
1383 if (unlikely(p
->ptrace
) &&
1384 unlikely(p
->parent
->mm
== mm
))
1387 while_each_thread(g
,p
);
1389 read_unlock(&tasklist_lock
);
1391 if (unlikely(traced
)) {
1393 * We are zapping a thread and the thread it ptraces.
1394 * If the tracee went into a ptrace stop for exit tracing,
1395 * we could deadlock since the tracer is waiting for this
1396 * coredump to finish. Detach them so they can both die.
1398 write_lock_irq(&tasklist_lock
);
1399 do_each_thread(g
,p
) {
1400 if (mm
== p
->mm
&& p
!= tsk
&&
1401 p
->ptrace
&& p
->parent
->mm
== mm
) {
1404 } while_each_thread(g
,p
);
1405 write_unlock_irq(&tasklist_lock
);
1409 static void coredump_wait(struct mm_struct
*mm
)
1411 DECLARE_COMPLETION(startup_done
);
1413 mm
->core_waiters
++; /* let other threads block */
1414 mm
->core_startup_done
= &startup_done
;
1416 /* give other threads a chance to run: */
1420 if (--mm
->core_waiters
) {
1421 up_write(&mm
->mmap_sem
);
1422 wait_for_completion(&startup_done
);
1424 up_write(&mm
->mmap_sem
);
1425 BUG_ON(mm
->core_waiters
);
1428 int do_coredump(long signr
, int exit_code
, struct pt_regs
* regs
)
1430 char corename
[CORENAME_MAX_SIZE
+ 1];
1431 struct mm_struct
*mm
= current
->mm
;
1432 struct linux_binfmt
* binfmt
;
1433 struct inode
* inode
;
1437 binfmt
= current
->binfmt
;
1438 if (!binfmt
|| !binfmt
->core_dump
)
1440 down_write(&mm
->mmap_sem
);
1441 if (!mm
->dumpable
) {
1442 up_write(&mm
->mmap_sem
);
1446 init_completion(&mm
->core_done
);
1447 spin_lock_irq(¤t
->sighand
->siglock
);
1448 current
->signal
->flags
= SIGNAL_GROUP_EXIT
;
1449 current
->signal
->group_exit_code
= exit_code
;
1450 spin_unlock_irq(¤t
->sighand
->siglock
);
1454 * Clear any false indication of pending signals that might
1455 * be seen by the filesystem code called to write the core file.
1457 current
->signal
->group_stop_count
= 0;
1458 clear_thread_flag(TIF_SIGPENDING
);
1460 if (current
->signal
->rlim
[RLIMIT_CORE
].rlim_cur
< binfmt
->min_coredump
)
1464 * lock_kernel() because format_corename() is controlled by sysctl, which
1465 * uses lock_kernel()
1468 format_corename(corename
, core_pattern
, signr
);
1470 file
= filp_open(corename
, O_CREAT
| 2 | O_NOFOLLOW
| O_LARGEFILE
, 0600);
1473 inode
= file
->f_dentry
->d_inode
;
1474 if (inode
->i_nlink
> 1)
1475 goto close_fail
; /* multiple links - don't dump */
1476 if (d_unhashed(file
->f_dentry
))
1479 if (!S_ISREG(inode
->i_mode
))
1483 if (!file
->f_op
->write
)
1485 if (do_truncate(file
->f_dentry
, 0) != 0)
1488 retval
= binfmt
->core_dump(signr
, regs
, file
);
1491 current
->signal
->group_exit_code
|= 0x80;
1493 filp_close(file
, NULL
);
1495 complete_all(&mm
->core_done
);