[PATCH] USB: new devices for the Option driver
[usb.git] / fs / exec.c
blobd07858c0b7c4e3885c2d6b31521f3e5668b94007
1 /*
2 * linux/fs/exec.c
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 */
7 /*
8 * #!-checking implemented by tytso.
9 */
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
22 * formats.
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>
51 #include <linux/cn_proc.h>
52 #include <linux/audit.h>
54 #include <asm/uaccess.h>
55 #include <asm/mmu_context.h>
57 #ifdef CONFIG_KMOD
58 #include <linux/kmod.h>
59 #endif
61 int core_uses_pid;
62 char core_pattern[65] = "core";
63 int suid_dumpable = 0;
65 EXPORT_SYMBOL(suid_dumpable);
66 /* The maximal length of core_pattern is also specified in sysctl.c */
68 static struct linux_binfmt *formats;
69 static DEFINE_RWLOCK(binfmt_lock);
71 int register_binfmt(struct linux_binfmt * fmt)
73 struct linux_binfmt ** tmp = &formats;
75 if (!fmt)
76 return -EINVAL;
77 if (fmt->next)
78 return -EBUSY;
79 write_lock(&binfmt_lock);
80 while (*tmp) {
81 if (fmt == *tmp) {
82 write_unlock(&binfmt_lock);
83 return -EBUSY;
85 tmp = &(*tmp)->next;
87 fmt->next = formats;
88 formats = fmt;
89 write_unlock(&binfmt_lock);
90 return 0;
93 EXPORT_SYMBOL(register_binfmt);
95 int unregister_binfmt(struct linux_binfmt * fmt)
97 struct linux_binfmt ** tmp = &formats;
99 write_lock(&binfmt_lock);
100 while (*tmp) {
101 if (fmt == *tmp) {
102 *tmp = fmt->next;
103 write_unlock(&binfmt_lock);
104 return 0;
106 tmp = &(*tmp)->next;
108 write_unlock(&binfmt_lock);
109 return -EINVAL;
112 EXPORT_SYMBOL(unregister_binfmt);
114 static inline void put_binfmt(struct linux_binfmt * fmt)
116 module_put(fmt->module);
120 * Note that a shared library must be both readable and executable due to
121 * security reasons.
123 * Also note that we take the address to load from from the file itself.
125 asmlinkage long sys_uselib(const char __user * library)
127 struct file * file;
128 struct nameidata nd;
129 int error;
131 error = __user_path_lookup_open(library, LOOKUP_FOLLOW, &nd, FMODE_READ|FMODE_EXEC);
132 if (error)
133 goto out;
135 error = -EINVAL;
136 if (!S_ISREG(nd.dentry->d_inode->i_mode))
137 goto exit;
139 error = vfs_permission(&nd, MAY_READ | MAY_EXEC);
140 if (error)
141 goto exit;
143 file = nameidata_to_filp(&nd, O_RDONLY);
144 error = PTR_ERR(file);
145 if (IS_ERR(file))
146 goto out;
148 error = -ENOEXEC;
149 if(file->f_op) {
150 struct linux_binfmt * fmt;
152 read_lock(&binfmt_lock);
153 for (fmt = formats ; fmt ; fmt = fmt->next) {
154 if (!fmt->load_shlib)
155 continue;
156 if (!try_module_get(fmt->module))
157 continue;
158 read_unlock(&binfmt_lock);
159 error = fmt->load_shlib(file);
160 read_lock(&binfmt_lock);
161 put_binfmt(fmt);
162 if (error != -ENOEXEC)
163 break;
165 read_unlock(&binfmt_lock);
167 fput(file);
168 out:
169 return error;
170 exit:
171 release_open_intent(&nd);
172 path_release(&nd);
173 goto out;
177 * count() counts the number of strings in array ARGV.
179 static int count(char __user * __user * argv, int max)
181 int i = 0;
183 if (argv != NULL) {
184 for (;;) {
185 char __user * p;
187 if (get_user(p, argv))
188 return -EFAULT;
189 if (!p)
190 break;
191 argv++;
192 if(++i > max)
193 return -E2BIG;
194 cond_resched();
197 return i;
201 * 'copy_strings()' copies argument/environment strings from user
202 * memory to free pages in kernel mem. These are in a format ready
203 * to be put directly into the top of new user memory.
205 static int copy_strings(int argc, char __user * __user * argv,
206 struct linux_binprm *bprm)
208 struct page *kmapped_page = NULL;
209 char *kaddr = NULL;
210 int ret;
212 while (argc-- > 0) {
213 char __user *str;
214 int len;
215 unsigned long pos;
217 if (get_user(str, argv+argc) ||
218 !(len = strnlen_user(str, bprm->p))) {
219 ret = -EFAULT;
220 goto out;
223 if (bprm->p < len) {
224 ret = -E2BIG;
225 goto out;
228 bprm->p -= len;
229 /* XXX: add architecture specific overflow check here. */
230 pos = bprm->p;
232 while (len > 0) {
233 int i, new, err;
234 int offset, bytes_to_copy;
235 struct page *page;
237 offset = pos % PAGE_SIZE;
238 i = pos/PAGE_SIZE;
239 page = bprm->page[i];
240 new = 0;
241 if (!page) {
242 page = alloc_page(GFP_HIGHUSER);
243 bprm->page[i] = page;
244 if (!page) {
245 ret = -ENOMEM;
246 goto out;
248 new = 1;
251 if (page != kmapped_page) {
252 if (kmapped_page)
253 kunmap(kmapped_page);
254 kmapped_page = page;
255 kaddr = kmap(kmapped_page);
257 if (new && offset)
258 memset(kaddr, 0, offset);
259 bytes_to_copy = PAGE_SIZE - offset;
260 if (bytes_to_copy > len) {
261 bytes_to_copy = len;
262 if (new)
263 memset(kaddr+offset+len, 0,
264 PAGE_SIZE-offset-len);
266 err = copy_from_user(kaddr+offset, str, bytes_to_copy);
267 if (err) {
268 ret = -EFAULT;
269 goto out;
272 pos += bytes_to_copy;
273 str += bytes_to_copy;
274 len -= bytes_to_copy;
277 ret = 0;
278 out:
279 if (kmapped_page)
280 kunmap(kmapped_page);
281 return ret;
285 * Like copy_strings, but get argv and its values from kernel memory.
287 int copy_strings_kernel(int argc,char ** argv, struct linux_binprm *bprm)
289 int r;
290 mm_segment_t oldfs = get_fs();
291 set_fs(KERNEL_DS);
292 r = copy_strings(argc, (char __user * __user *)argv, bprm);
293 set_fs(oldfs);
294 return r;
297 EXPORT_SYMBOL(copy_strings_kernel);
299 #ifdef CONFIG_MMU
301 * This routine is used to map in a page into an address space: needed by
302 * execve() for the initial stack and environment pages.
304 * vma->vm_mm->mmap_sem is held for writing.
306 void install_arg_page(struct vm_area_struct *vma,
307 struct page *page, unsigned long address)
309 struct mm_struct *mm = vma->vm_mm;
310 pte_t * pte;
311 spinlock_t *ptl;
313 if (unlikely(anon_vma_prepare(vma)))
314 goto out;
316 flush_dcache_page(page);
317 pte = get_locked_pte(mm, address, &ptl);
318 if (!pte)
319 goto out;
320 if (!pte_none(*pte)) {
321 pte_unmap_unlock(pte, ptl);
322 goto out;
324 inc_mm_counter(mm, anon_rss);
325 lru_cache_add_active(page);
326 set_pte_at(mm, address, pte, pte_mkdirty(pte_mkwrite(mk_pte(
327 page, vma->vm_page_prot))));
328 page_add_new_anon_rmap(page, vma, address);
329 pte_unmap_unlock(pte, ptl);
331 /* no need for flush_tlb */
332 return;
333 out:
334 __free_page(page);
335 force_sig(SIGKILL, current);
338 #define EXTRA_STACK_VM_PAGES 20 /* random */
340 int setup_arg_pages(struct linux_binprm *bprm,
341 unsigned long stack_top,
342 int executable_stack)
344 unsigned long stack_base;
345 struct vm_area_struct *mpnt;
346 struct mm_struct *mm = current->mm;
347 int i, ret;
348 long arg_size;
350 #ifdef CONFIG_STACK_GROWSUP
351 /* Move the argument and environment strings to the bottom of the
352 * stack space.
354 int offset, j;
355 char *to, *from;
357 /* Start by shifting all the pages down */
358 i = 0;
359 for (j = 0; j < MAX_ARG_PAGES; j++) {
360 struct page *page = bprm->page[j];
361 if (!page)
362 continue;
363 bprm->page[i++] = page;
366 /* Now move them within their pages */
367 offset = bprm->p % PAGE_SIZE;
368 to = kmap(bprm->page[0]);
369 for (j = 1; j < i; j++) {
370 memmove(to, to + offset, PAGE_SIZE - offset);
371 from = kmap(bprm->page[j]);
372 memcpy(to + PAGE_SIZE - offset, from, offset);
373 kunmap(bprm->page[j - 1]);
374 to = from;
376 memmove(to, to + offset, PAGE_SIZE - offset);
377 kunmap(bprm->page[j - 1]);
379 /* Limit stack size to 1GB */
380 stack_base = current->signal->rlim[RLIMIT_STACK].rlim_max;
381 if (stack_base > (1 << 30))
382 stack_base = 1 << 30;
383 stack_base = PAGE_ALIGN(stack_top - stack_base);
385 /* Adjust bprm->p to point to the end of the strings. */
386 bprm->p = stack_base + PAGE_SIZE * i - offset;
388 mm->arg_start = stack_base;
389 arg_size = i << PAGE_SHIFT;
391 /* zero pages that were copied above */
392 while (i < MAX_ARG_PAGES)
393 bprm->page[i++] = NULL;
394 #else
395 stack_base = arch_align_stack(stack_top - MAX_ARG_PAGES*PAGE_SIZE);
396 stack_base = PAGE_ALIGN(stack_base);
397 bprm->p += stack_base;
398 mm->arg_start = bprm->p;
399 arg_size = stack_top - (PAGE_MASK & (unsigned long) mm->arg_start);
400 #endif
402 arg_size += EXTRA_STACK_VM_PAGES * PAGE_SIZE;
404 if (bprm->loader)
405 bprm->loader += stack_base;
406 bprm->exec += stack_base;
408 mpnt = kmem_cache_alloc(vm_area_cachep, SLAB_KERNEL);
409 if (!mpnt)
410 return -ENOMEM;
412 memset(mpnt, 0, sizeof(*mpnt));
414 down_write(&mm->mmap_sem);
416 mpnt->vm_mm = mm;
417 #ifdef CONFIG_STACK_GROWSUP
418 mpnt->vm_start = stack_base;
419 mpnt->vm_end = stack_base + arg_size;
420 #else
421 mpnt->vm_end = stack_top;
422 mpnt->vm_start = mpnt->vm_end - arg_size;
423 #endif
424 /* Adjust stack execute permissions; explicitly enable
425 * for EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X
426 * and leave alone (arch default) otherwise. */
427 if (unlikely(executable_stack == EXSTACK_ENABLE_X))
428 mpnt->vm_flags = VM_STACK_FLAGS | VM_EXEC;
429 else if (executable_stack == EXSTACK_DISABLE_X)
430 mpnt->vm_flags = VM_STACK_FLAGS & ~VM_EXEC;
431 else
432 mpnt->vm_flags = VM_STACK_FLAGS;
433 mpnt->vm_flags |= mm->def_flags;
434 mpnt->vm_page_prot = protection_map[mpnt->vm_flags & 0x7];
435 if ((ret = insert_vm_struct(mm, mpnt))) {
436 up_write(&mm->mmap_sem);
437 kmem_cache_free(vm_area_cachep, mpnt);
438 return ret;
440 mm->stack_vm = mm->total_vm = vma_pages(mpnt);
443 for (i = 0 ; i < MAX_ARG_PAGES ; i++) {
444 struct page *page = bprm->page[i];
445 if (page) {
446 bprm->page[i] = NULL;
447 install_arg_page(mpnt, page, stack_base);
449 stack_base += PAGE_SIZE;
451 up_write(&mm->mmap_sem);
453 return 0;
456 EXPORT_SYMBOL(setup_arg_pages);
458 #define free_arg_pages(bprm) do { } while (0)
460 #else
462 static inline void free_arg_pages(struct linux_binprm *bprm)
464 int i;
466 for (i = 0; i < MAX_ARG_PAGES; i++) {
467 if (bprm->page[i])
468 __free_page(bprm->page[i]);
469 bprm->page[i] = NULL;
473 #endif /* CONFIG_MMU */
475 struct file *open_exec(const char *name)
477 struct nameidata nd;
478 int err;
479 struct file *file;
481 err = path_lookup_open(AT_FDCWD, name, LOOKUP_FOLLOW, &nd, FMODE_READ|FMODE_EXEC);
482 file = ERR_PTR(err);
484 if (!err) {
485 struct inode *inode = nd.dentry->d_inode;
486 file = ERR_PTR(-EACCES);
487 if (!(nd.mnt->mnt_flags & MNT_NOEXEC) &&
488 S_ISREG(inode->i_mode)) {
489 int err = vfs_permission(&nd, MAY_EXEC);
490 if (!err && !(inode->i_mode & 0111))
491 err = -EACCES;
492 file = ERR_PTR(err);
493 if (!err) {
494 file = nameidata_to_filp(&nd, O_RDONLY);
495 if (!IS_ERR(file)) {
496 err = deny_write_access(file);
497 if (err) {
498 fput(file);
499 file = ERR_PTR(err);
502 out:
503 return file;
506 release_open_intent(&nd);
507 path_release(&nd);
509 goto out;
512 EXPORT_SYMBOL(open_exec);
514 int kernel_read(struct file *file, unsigned long offset,
515 char *addr, unsigned long count)
517 mm_segment_t old_fs;
518 loff_t pos = offset;
519 int result;
521 old_fs = get_fs();
522 set_fs(get_ds());
523 /* The cast to a user pointer is valid due to the set_fs() */
524 result = vfs_read(file, (void __user *)addr, count, &pos);
525 set_fs(old_fs);
526 return result;
529 EXPORT_SYMBOL(kernel_read);
531 static int exec_mmap(struct mm_struct *mm)
533 struct task_struct *tsk;
534 struct mm_struct * old_mm, *active_mm;
536 /* Notify parent that we're no longer interested in the old VM */
537 tsk = current;
538 old_mm = current->mm;
539 mm_release(tsk, old_mm);
541 if (old_mm) {
543 * Make sure that if there is a core dump in progress
544 * for the old mm, we get out and die instead of going
545 * through with the exec. We must hold mmap_sem around
546 * checking core_waiters and changing tsk->mm. The
547 * core-inducing thread will increment core_waiters for
548 * each thread whose ->mm == old_mm.
550 down_read(&old_mm->mmap_sem);
551 if (unlikely(old_mm->core_waiters)) {
552 up_read(&old_mm->mmap_sem);
553 return -EINTR;
556 task_lock(tsk);
557 active_mm = tsk->active_mm;
558 tsk->mm = mm;
559 tsk->active_mm = mm;
560 activate_mm(active_mm, mm);
561 task_unlock(tsk);
562 arch_pick_mmap_layout(mm);
563 if (old_mm) {
564 up_read(&old_mm->mmap_sem);
565 BUG_ON(active_mm != old_mm);
566 mmput(old_mm);
567 return 0;
569 mmdrop(active_mm);
570 return 0;
574 * This function makes sure the current process has its own signal table,
575 * so that flush_signal_handlers can later reset the handlers without
576 * disturbing other processes. (Other processes might share the signal
577 * table via the CLONE_SIGHAND option to clone().)
579 static int de_thread(struct task_struct *tsk)
581 struct signal_struct *sig = tsk->signal;
582 struct sighand_struct *newsighand, *oldsighand = tsk->sighand;
583 spinlock_t *lock = &oldsighand->siglock;
584 struct task_struct *leader = NULL;
585 int count;
588 * If we don't share sighandlers, then we aren't sharing anything
589 * and we can just re-use it all.
591 if (atomic_read(&oldsighand->count) <= 1) {
592 BUG_ON(atomic_read(&sig->count) != 1);
593 exit_itimers(sig);
594 return 0;
597 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
598 if (!newsighand)
599 return -ENOMEM;
601 if (thread_group_empty(current))
602 goto no_thread_group;
605 * Kill all other threads in the thread group.
606 * We must hold tasklist_lock to call zap_other_threads.
608 read_lock(&tasklist_lock);
609 spin_lock_irq(lock);
610 if (sig->flags & SIGNAL_GROUP_EXIT) {
612 * Another group action in progress, just
613 * return so that the signal is processed.
615 spin_unlock_irq(lock);
616 read_unlock(&tasklist_lock);
617 kmem_cache_free(sighand_cachep, newsighand);
618 return -EAGAIN;
622 * child_reaper ignores SIGKILL, change it now.
623 * Reparenting needs write_lock on tasklist_lock,
624 * so it is safe to do it under read_lock.
626 if (unlikely(current->group_leader == child_reaper))
627 child_reaper = current;
629 zap_other_threads(current);
630 read_unlock(&tasklist_lock);
633 * Account for the thread group leader hanging around:
635 count = 1;
636 if (!thread_group_leader(current)) {
637 count = 2;
639 * The SIGALRM timer survives the exec, but needs to point
640 * at us as the new group leader now. We have a race with
641 * a timer firing now getting the old leader, so we need to
642 * synchronize with any firing (by calling del_timer_sync)
643 * before we can safely let the old group leader die.
645 sig->tsk = current;
646 spin_unlock_irq(lock);
647 if (hrtimer_cancel(&sig->real_timer))
648 hrtimer_restart(&sig->real_timer);
649 spin_lock_irq(lock);
651 while (atomic_read(&sig->count) > count) {
652 sig->group_exit_task = current;
653 sig->notify_count = count;
654 __set_current_state(TASK_UNINTERRUPTIBLE);
655 spin_unlock_irq(lock);
656 schedule();
657 spin_lock_irq(lock);
659 sig->group_exit_task = NULL;
660 sig->notify_count = 0;
661 spin_unlock_irq(lock);
664 * At this point all other threads have exited, all we have to
665 * do is to wait for the thread group leader to become inactive,
666 * and to assume its PID:
668 if (!thread_group_leader(current)) {
669 struct dentry *proc_dentry1, *proc_dentry2;
672 * Wait for the thread group leader to be a zombie.
673 * It should already be zombie at this point, most
674 * of the time.
676 leader = current->group_leader;
677 while (leader->exit_state != EXIT_ZOMBIE)
678 yield();
681 * The only record we have of the real-time age of a
682 * process, regardless of execs it's done, is start_time.
683 * All the past CPU time is accumulated in signal_struct
684 * from sister threads now dead. But in this non-leader
685 * exec, nothing survives from the original leader thread,
686 * whose birth marks the true age of this process now.
687 * When we take on its identity by switching to its PID, we
688 * also take its birthdate (always earlier than our own).
690 current->start_time = leader->start_time;
692 spin_lock(&leader->proc_lock);
693 spin_lock(&current->proc_lock);
694 proc_dentry1 = proc_pid_unhash(current);
695 proc_dentry2 = proc_pid_unhash(leader);
696 write_lock_irq(&tasklist_lock);
698 BUG_ON(leader->tgid != current->tgid);
699 BUG_ON(current->pid == current->tgid);
701 * An exec() starts a new thread group with the
702 * TGID of the previous thread group. Rehash the
703 * two threads with a switched PID, and release
704 * the former thread group leader:
707 /* Become a process group leader with the old leader's pid.
708 * Note: The old leader also uses thispid until release_task
709 * is called. Odd but simple and correct.
711 detach_pid(current, PIDTYPE_PID);
712 current->pid = leader->pid;
713 attach_pid(current, PIDTYPE_PID, current->pid);
714 attach_pid(current, PIDTYPE_PGID, current->signal->pgrp);
715 attach_pid(current, PIDTYPE_SID, current->signal->session);
716 list_add_tail_rcu(&current->tasks, &init_task.tasks);
718 current->group_leader = current;
719 leader->group_leader = current;
721 /* Reduce leader to a thread */
722 detach_pid(leader, PIDTYPE_PGID);
723 detach_pid(leader, PIDTYPE_SID);
724 list_del_init(&leader->tasks);
726 current->exit_signal = SIGCHLD;
728 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
729 leader->exit_state = EXIT_DEAD;
731 write_unlock_irq(&tasklist_lock);
732 spin_unlock(&leader->proc_lock);
733 spin_unlock(&current->proc_lock);
734 proc_pid_flush(proc_dentry1);
735 proc_pid_flush(proc_dentry2);
739 * There may be one thread left which is just exiting,
740 * but it's safe to stop telling the group to kill themselves.
742 sig->flags = 0;
744 no_thread_group:
745 exit_itimers(sig);
746 if (leader)
747 release_task(leader);
749 BUG_ON(atomic_read(&sig->count) != 1);
751 if (atomic_read(&oldsighand->count) == 1) {
753 * Now that we nuked the rest of the thread group,
754 * it turns out we are not sharing sighand any more either.
755 * So we can just keep it.
757 kmem_cache_free(sighand_cachep, newsighand);
758 } else {
760 * Move our state over to newsighand and switch it in.
762 atomic_set(&newsighand->count, 1);
763 memcpy(newsighand->action, oldsighand->action,
764 sizeof(newsighand->action));
766 write_lock_irq(&tasklist_lock);
767 spin_lock(&oldsighand->siglock);
768 spin_lock(&newsighand->siglock);
770 rcu_assign_pointer(current->sighand, newsighand);
771 recalc_sigpending();
773 spin_unlock(&newsighand->siglock);
774 spin_unlock(&oldsighand->siglock);
775 write_unlock_irq(&tasklist_lock);
777 if (atomic_dec_and_test(&oldsighand->count))
778 kmem_cache_free(sighand_cachep, oldsighand);
781 BUG_ON(!thread_group_leader(current));
782 return 0;
786 * These functions flushes out all traces of the currently running executable
787 * so that a new one can be started
790 static void flush_old_files(struct files_struct * files)
792 long j = -1;
793 struct fdtable *fdt;
795 spin_lock(&files->file_lock);
796 for (;;) {
797 unsigned long set, i;
799 j++;
800 i = j * __NFDBITS;
801 fdt = files_fdtable(files);
802 if (i >= fdt->max_fds || i >= fdt->max_fdset)
803 break;
804 set = fdt->close_on_exec->fds_bits[j];
805 if (!set)
806 continue;
807 fdt->close_on_exec->fds_bits[j] = 0;
808 spin_unlock(&files->file_lock);
809 for ( ; set ; i++,set >>= 1) {
810 if (set & 1) {
811 sys_close(i);
814 spin_lock(&files->file_lock);
817 spin_unlock(&files->file_lock);
820 void get_task_comm(char *buf, struct task_struct *tsk)
822 /* buf must be at least sizeof(tsk->comm) in size */
823 task_lock(tsk);
824 strncpy(buf, tsk->comm, sizeof(tsk->comm));
825 task_unlock(tsk);
828 void set_task_comm(struct task_struct *tsk, char *buf)
830 task_lock(tsk);
831 strlcpy(tsk->comm, buf, sizeof(tsk->comm));
832 task_unlock(tsk);
835 int flush_old_exec(struct linux_binprm * bprm)
837 char * name;
838 int i, ch, retval;
839 struct files_struct *files;
840 char tcomm[sizeof(current->comm)];
843 * Make sure we have a private signal table and that
844 * we are unassociated from the previous thread group.
846 retval = de_thread(current);
847 if (retval)
848 goto out;
851 * Make sure we have private file handles. Ask the
852 * fork helper to do the work for us and the exit
853 * helper to do the cleanup of the old one.
855 files = current->files; /* refcounted so safe to hold */
856 retval = unshare_files();
857 if (retval)
858 goto out;
860 * Release all of the old mmap stuff
862 retval = exec_mmap(bprm->mm);
863 if (retval)
864 goto mmap_failed;
866 bprm->mm = NULL; /* We're using it now */
868 /* This is the point of no return */
869 steal_locks(files);
870 put_files_struct(files);
872 current->sas_ss_sp = current->sas_ss_size = 0;
874 if (current->euid == current->uid && current->egid == current->gid)
875 current->mm->dumpable = 1;
876 else
877 current->mm->dumpable = suid_dumpable;
879 name = bprm->filename;
881 /* Copies the binary name from after last slash */
882 for (i=0; (ch = *(name++)) != '\0';) {
883 if (ch == '/')
884 i = 0; /* overwrite what we wrote */
885 else
886 if (i < (sizeof(tcomm) - 1))
887 tcomm[i++] = ch;
889 tcomm[i] = '\0';
890 set_task_comm(current, tcomm);
892 current->flags &= ~PF_RANDOMIZE;
893 flush_thread();
895 /* Set the new mm task size. We have to do that late because it may
896 * depend on TIF_32BIT which is only updated in flush_thread() on
897 * some architectures like powerpc
899 current->mm->task_size = TASK_SIZE;
901 if (bprm->e_uid != current->euid || bprm->e_gid != current->egid ||
902 file_permission(bprm->file, MAY_READ) ||
903 (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP)) {
904 suid_keys(current);
905 current->mm->dumpable = suid_dumpable;
908 /* An exec changes our domain. We are no longer part of the thread
909 group */
911 current->self_exec_id++;
913 flush_signal_handlers(current, 0);
914 flush_old_files(current->files);
916 return 0;
918 mmap_failed:
919 put_files_struct(current->files);
920 current->files = files;
921 out:
922 return retval;
925 EXPORT_SYMBOL(flush_old_exec);
928 * Fill the binprm structure from the inode.
929 * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
931 int prepare_binprm(struct linux_binprm *bprm)
933 int mode;
934 struct inode * inode = bprm->file->f_dentry->d_inode;
935 int retval;
937 mode = inode->i_mode;
939 * Check execute perms again - if the caller has CAP_DAC_OVERRIDE,
940 * generic_permission lets a non-executable through
942 if (!(mode & 0111)) /* with at least _one_ execute bit set */
943 return -EACCES;
944 if (bprm->file->f_op == NULL)
945 return -EACCES;
947 bprm->e_uid = current->euid;
948 bprm->e_gid = current->egid;
950 if(!(bprm->file->f_vfsmnt->mnt_flags & MNT_NOSUID)) {
951 /* Set-uid? */
952 if (mode & S_ISUID) {
953 current->personality &= ~PER_CLEAR_ON_SETID;
954 bprm->e_uid = inode->i_uid;
957 /* Set-gid? */
959 * If setgid is set but no group execute bit then this
960 * is a candidate for mandatory locking, not a setgid
961 * executable.
963 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
964 current->personality &= ~PER_CLEAR_ON_SETID;
965 bprm->e_gid = inode->i_gid;
969 /* fill in binprm security blob */
970 retval = security_bprm_set(bprm);
971 if (retval)
972 return retval;
974 memset(bprm->buf,0,BINPRM_BUF_SIZE);
975 return kernel_read(bprm->file,0,bprm->buf,BINPRM_BUF_SIZE);
978 EXPORT_SYMBOL(prepare_binprm);
980 static int unsafe_exec(struct task_struct *p)
982 int unsafe = 0;
983 if (p->ptrace & PT_PTRACED) {
984 if (p->ptrace & PT_PTRACE_CAP)
985 unsafe |= LSM_UNSAFE_PTRACE_CAP;
986 else
987 unsafe |= LSM_UNSAFE_PTRACE;
989 if (atomic_read(&p->fs->count) > 1 ||
990 atomic_read(&p->files->count) > 1 ||
991 atomic_read(&p->sighand->count) > 1)
992 unsafe |= LSM_UNSAFE_SHARE;
994 return unsafe;
997 void compute_creds(struct linux_binprm *bprm)
999 int unsafe;
1001 if (bprm->e_uid != current->uid)
1002 suid_keys(current);
1003 exec_keys(current);
1005 task_lock(current);
1006 unsafe = unsafe_exec(current);
1007 security_bprm_apply_creds(bprm, unsafe);
1008 task_unlock(current);
1009 security_bprm_post_apply_creds(bprm);
1012 EXPORT_SYMBOL(compute_creds);
1014 void remove_arg_zero(struct linux_binprm *bprm)
1016 if (bprm->argc) {
1017 unsigned long offset;
1018 char * kaddr;
1019 struct page *page;
1021 offset = bprm->p % PAGE_SIZE;
1022 goto inside;
1024 while (bprm->p++, *(kaddr+offset++)) {
1025 if (offset != PAGE_SIZE)
1026 continue;
1027 offset = 0;
1028 kunmap_atomic(kaddr, KM_USER0);
1029 inside:
1030 page = bprm->page[bprm->p/PAGE_SIZE];
1031 kaddr = kmap_atomic(page, KM_USER0);
1033 kunmap_atomic(kaddr, KM_USER0);
1034 bprm->argc--;
1038 EXPORT_SYMBOL(remove_arg_zero);
1041 * cycle the list of binary formats handler, until one recognizes the image
1043 int search_binary_handler(struct linux_binprm *bprm,struct pt_regs *regs)
1045 int try,retval;
1046 struct linux_binfmt *fmt;
1047 #ifdef __alpha__
1048 /* handle /sbin/loader.. */
1050 struct exec * eh = (struct exec *) bprm->buf;
1052 if (!bprm->loader && eh->fh.f_magic == 0x183 &&
1053 (eh->fh.f_flags & 0x3000) == 0x3000)
1055 struct file * file;
1056 unsigned long loader;
1058 allow_write_access(bprm->file);
1059 fput(bprm->file);
1060 bprm->file = NULL;
1062 loader = PAGE_SIZE*MAX_ARG_PAGES-sizeof(void *);
1064 file = open_exec("/sbin/loader");
1065 retval = PTR_ERR(file);
1066 if (IS_ERR(file))
1067 return retval;
1069 /* Remember if the application is TASO. */
1070 bprm->sh_bang = eh->ah.entry < 0x100000000UL;
1072 bprm->file = file;
1073 bprm->loader = loader;
1074 retval = prepare_binprm(bprm);
1075 if (retval<0)
1076 return retval;
1077 /* should call search_binary_handler recursively here,
1078 but it does not matter */
1081 #endif
1082 retval = security_bprm_check(bprm);
1083 if (retval)
1084 return retval;
1086 /* kernel module loader fixup */
1087 /* so we don't try to load run modprobe in kernel space. */
1088 set_fs(USER_DS);
1090 retval = audit_bprm(bprm);
1091 if (retval)
1092 return retval;
1094 retval = -ENOENT;
1095 for (try=0; try<2; try++) {
1096 read_lock(&binfmt_lock);
1097 for (fmt = formats ; fmt ; fmt = fmt->next) {
1098 int (*fn)(struct linux_binprm *, struct pt_regs *) = fmt->load_binary;
1099 if (!fn)
1100 continue;
1101 if (!try_module_get(fmt->module))
1102 continue;
1103 read_unlock(&binfmt_lock);
1104 retval = fn(bprm, regs);
1105 if (retval >= 0) {
1106 put_binfmt(fmt);
1107 allow_write_access(bprm->file);
1108 if (bprm->file)
1109 fput(bprm->file);
1110 bprm->file = NULL;
1111 current->did_exec = 1;
1112 proc_exec_connector(current);
1113 return retval;
1115 read_lock(&binfmt_lock);
1116 put_binfmt(fmt);
1117 if (retval != -ENOEXEC || bprm->mm == NULL)
1118 break;
1119 if (!bprm->file) {
1120 read_unlock(&binfmt_lock);
1121 return retval;
1124 read_unlock(&binfmt_lock);
1125 if (retval != -ENOEXEC || bprm->mm == NULL) {
1126 break;
1127 #ifdef CONFIG_KMOD
1128 }else{
1129 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1130 if (printable(bprm->buf[0]) &&
1131 printable(bprm->buf[1]) &&
1132 printable(bprm->buf[2]) &&
1133 printable(bprm->buf[3]))
1134 break; /* -ENOEXEC */
1135 request_module("binfmt-%04x", *(unsigned short *)(&bprm->buf[2]));
1136 #endif
1139 return retval;
1142 EXPORT_SYMBOL(search_binary_handler);
1145 * sys_execve() executes a new program.
1147 int do_execve(char * filename,
1148 char __user *__user *argv,
1149 char __user *__user *envp,
1150 struct pt_regs * regs)
1152 struct linux_binprm *bprm;
1153 struct file *file;
1154 int retval;
1155 int i;
1157 retval = -ENOMEM;
1158 bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1159 if (!bprm)
1160 goto out_ret;
1162 file = open_exec(filename);
1163 retval = PTR_ERR(file);
1164 if (IS_ERR(file))
1165 goto out_kfree;
1167 sched_exec();
1169 bprm->p = PAGE_SIZE*MAX_ARG_PAGES-sizeof(void *);
1171 bprm->file = file;
1172 bprm->filename = filename;
1173 bprm->interp = filename;
1174 bprm->mm = mm_alloc();
1175 retval = -ENOMEM;
1176 if (!bprm->mm)
1177 goto out_file;
1179 retval = init_new_context(current, bprm->mm);
1180 if (retval < 0)
1181 goto out_mm;
1183 bprm->argc = count(argv, bprm->p / sizeof(void *));
1184 if ((retval = bprm->argc) < 0)
1185 goto out_mm;
1187 bprm->envc = count(envp, bprm->p / sizeof(void *));
1188 if ((retval = bprm->envc) < 0)
1189 goto out_mm;
1191 retval = security_bprm_alloc(bprm);
1192 if (retval)
1193 goto out;
1195 retval = prepare_binprm(bprm);
1196 if (retval < 0)
1197 goto out;
1199 retval = copy_strings_kernel(1, &bprm->filename, bprm);
1200 if (retval < 0)
1201 goto out;
1203 bprm->exec = bprm->p;
1204 retval = copy_strings(bprm->envc, envp, bprm);
1205 if (retval < 0)
1206 goto out;
1208 retval = copy_strings(bprm->argc, argv, bprm);
1209 if (retval < 0)
1210 goto out;
1212 retval = search_binary_handler(bprm,regs);
1213 if (retval >= 0) {
1214 free_arg_pages(bprm);
1216 /* execve success */
1217 security_bprm_free(bprm);
1218 acct_update_integrals(current);
1219 kfree(bprm);
1220 return retval;
1223 out:
1224 /* Something went wrong, return the inode and free the argument pages*/
1225 for (i = 0 ; i < MAX_ARG_PAGES ; i++) {
1226 struct page * page = bprm->page[i];
1227 if (page)
1228 __free_page(page);
1231 if (bprm->security)
1232 security_bprm_free(bprm);
1234 out_mm:
1235 if (bprm->mm)
1236 mmdrop(bprm->mm);
1238 out_file:
1239 if (bprm->file) {
1240 allow_write_access(bprm->file);
1241 fput(bprm->file);
1244 out_kfree:
1245 kfree(bprm);
1247 out_ret:
1248 return retval;
1251 int set_binfmt(struct linux_binfmt *new)
1253 struct linux_binfmt *old = current->binfmt;
1255 if (new) {
1256 if (!try_module_get(new->module))
1257 return -1;
1259 current->binfmt = new;
1260 if (old)
1261 module_put(old->module);
1262 return 0;
1265 EXPORT_SYMBOL(set_binfmt);
1267 #define CORENAME_MAX_SIZE 64
1269 /* format_corename will inspect the pattern parameter, and output a
1270 * name into corename, which must have space for at least
1271 * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1273 static void format_corename(char *corename, const char *pattern, long signr)
1275 const char *pat_ptr = pattern;
1276 char *out_ptr = corename;
1277 char *const out_end = corename + CORENAME_MAX_SIZE;
1278 int rc;
1279 int pid_in_pattern = 0;
1281 /* Repeat as long as we have more pattern to process and more output
1282 space */
1283 while (*pat_ptr) {
1284 if (*pat_ptr != '%') {
1285 if (out_ptr == out_end)
1286 goto out;
1287 *out_ptr++ = *pat_ptr++;
1288 } else {
1289 switch (*++pat_ptr) {
1290 case 0:
1291 goto out;
1292 /* Double percent, output one percent */
1293 case '%':
1294 if (out_ptr == out_end)
1295 goto out;
1296 *out_ptr++ = '%';
1297 break;
1298 /* pid */
1299 case 'p':
1300 pid_in_pattern = 1;
1301 rc = snprintf(out_ptr, out_end - out_ptr,
1302 "%d", current->tgid);
1303 if (rc > out_end - out_ptr)
1304 goto out;
1305 out_ptr += rc;
1306 break;
1307 /* uid */
1308 case 'u':
1309 rc = snprintf(out_ptr, out_end - out_ptr,
1310 "%d", current->uid);
1311 if (rc > out_end - out_ptr)
1312 goto out;
1313 out_ptr += rc;
1314 break;
1315 /* gid */
1316 case 'g':
1317 rc = snprintf(out_ptr, out_end - out_ptr,
1318 "%d", current->gid);
1319 if (rc > out_end - out_ptr)
1320 goto out;
1321 out_ptr += rc;
1322 break;
1323 /* signal that caused the coredump */
1324 case 's':
1325 rc = snprintf(out_ptr, out_end - out_ptr,
1326 "%ld", signr);
1327 if (rc > out_end - out_ptr)
1328 goto out;
1329 out_ptr += rc;
1330 break;
1331 /* UNIX time of coredump */
1332 case 't': {
1333 struct timeval tv;
1334 do_gettimeofday(&tv);
1335 rc = snprintf(out_ptr, out_end - out_ptr,
1336 "%lu", tv.tv_sec);
1337 if (rc > out_end - out_ptr)
1338 goto out;
1339 out_ptr += rc;
1340 break;
1342 /* hostname */
1343 case 'h':
1344 down_read(&uts_sem);
1345 rc = snprintf(out_ptr, out_end - out_ptr,
1346 "%s", system_utsname.nodename);
1347 up_read(&uts_sem);
1348 if (rc > out_end - out_ptr)
1349 goto out;
1350 out_ptr += rc;
1351 break;
1352 /* executable */
1353 case 'e':
1354 rc = snprintf(out_ptr, out_end - out_ptr,
1355 "%s", current->comm);
1356 if (rc > out_end - out_ptr)
1357 goto out;
1358 out_ptr += rc;
1359 break;
1360 default:
1361 break;
1363 ++pat_ptr;
1366 /* Backward compatibility with core_uses_pid:
1368 * If core_pattern does not include a %p (as is the default)
1369 * and core_uses_pid is set, then .%pid will be appended to
1370 * the filename */
1371 if (!pid_in_pattern
1372 && (core_uses_pid || atomic_read(&current->mm->mm_users) != 1)) {
1373 rc = snprintf(out_ptr, out_end - out_ptr,
1374 ".%d", current->tgid);
1375 if (rc > out_end - out_ptr)
1376 goto out;
1377 out_ptr += rc;
1379 out:
1380 *out_ptr = 0;
1383 static void zap_threads (struct mm_struct *mm)
1385 struct task_struct *g, *p;
1386 struct task_struct *tsk = current;
1387 struct completion *vfork_done = tsk->vfork_done;
1388 int traced = 0;
1391 * Make sure nobody is waiting for us to release the VM,
1392 * otherwise we can deadlock when we wait on each other
1394 if (vfork_done) {
1395 tsk->vfork_done = NULL;
1396 complete(vfork_done);
1399 read_lock(&tasklist_lock);
1400 do_each_thread(g,p)
1401 if (mm == p->mm && p != tsk) {
1402 force_sig_specific(SIGKILL, p);
1403 mm->core_waiters++;
1404 if (unlikely(p->ptrace) &&
1405 unlikely(p->parent->mm == mm))
1406 traced = 1;
1408 while_each_thread(g,p);
1410 read_unlock(&tasklist_lock);
1412 if (unlikely(traced)) {
1414 * We are zapping a thread and the thread it ptraces.
1415 * If the tracee went into a ptrace stop for exit tracing,
1416 * we could deadlock since the tracer is waiting for this
1417 * coredump to finish. Detach them so they can both die.
1419 write_lock_irq(&tasklist_lock);
1420 do_each_thread(g,p) {
1421 if (mm == p->mm && p != tsk &&
1422 p->ptrace && p->parent->mm == mm) {
1423 __ptrace_detach(p, 0);
1425 } while_each_thread(g,p);
1426 write_unlock_irq(&tasklist_lock);
1430 static void coredump_wait(struct mm_struct *mm)
1432 DECLARE_COMPLETION(startup_done);
1433 int core_waiters;
1435 mm->core_startup_done = &startup_done;
1437 zap_threads(mm);
1438 core_waiters = mm->core_waiters;
1439 up_write(&mm->mmap_sem);
1441 if (core_waiters)
1442 wait_for_completion(&startup_done);
1443 BUG_ON(mm->core_waiters);
1446 int do_coredump(long signr, int exit_code, struct pt_regs * regs)
1448 char corename[CORENAME_MAX_SIZE + 1];
1449 struct mm_struct *mm = current->mm;
1450 struct linux_binfmt * binfmt;
1451 struct inode * inode;
1452 struct file * file;
1453 int retval = 0;
1454 int fsuid = current->fsuid;
1455 int flag = 0;
1457 binfmt = current->binfmt;
1458 if (!binfmt || !binfmt->core_dump)
1459 goto fail;
1460 down_write(&mm->mmap_sem);
1461 if (!mm->dumpable) {
1462 up_write(&mm->mmap_sem);
1463 goto fail;
1467 * We cannot trust fsuid as being the "true" uid of the
1468 * process nor do we know its entire history. We only know it
1469 * was tainted so we dump it as root in mode 2.
1471 if (mm->dumpable == 2) { /* Setuid core dump mode */
1472 flag = O_EXCL; /* Stop rewrite attacks */
1473 current->fsuid = 0; /* Dump root private */
1475 mm->dumpable = 0;
1477 retval = -EAGAIN;
1478 spin_lock_irq(&current->sighand->siglock);
1479 if (!(current->signal->flags & SIGNAL_GROUP_EXIT)) {
1480 current->signal->flags = SIGNAL_GROUP_EXIT;
1481 current->signal->group_exit_code = exit_code;
1482 current->signal->group_stop_count = 0;
1483 retval = 0;
1485 spin_unlock_irq(&current->sighand->siglock);
1486 if (retval) {
1487 up_write(&mm->mmap_sem);
1488 goto fail;
1491 init_completion(&mm->core_done);
1492 coredump_wait(mm);
1495 * Clear any false indication of pending signals that might
1496 * be seen by the filesystem code called to write the core file.
1498 clear_thread_flag(TIF_SIGPENDING);
1500 if (current->signal->rlim[RLIMIT_CORE].rlim_cur < binfmt->min_coredump)
1501 goto fail_unlock;
1504 * lock_kernel() because format_corename() is controlled by sysctl, which
1505 * uses lock_kernel()
1507 lock_kernel();
1508 format_corename(corename, core_pattern, signr);
1509 unlock_kernel();
1510 file = filp_open(corename, O_CREAT | 2 | O_NOFOLLOW | O_LARGEFILE | flag, 0600);
1511 if (IS_ERR(file))
1512 goto fail_unlock;
1513 inode = file->f_dentry->d_inode;
1514 if (inode->i_nlink > 1)
1515 goto close_fail; /* multiple links - don't dump */
1516 if (d_unhashed(file->f_dentry))
1517 goto close_fail;
1519 if (!S_ISREG(inode->i_mode))
1520 goto close_fail;
1521 if (!file->f_op)
1522 goto close_fail;
1523 if (!file->f_op->write)
1524 goto close_fail;
1525 if (do_truncate(file->f_dentry, 0, 0, file) != 0)
1526 goto close_fail;
1528 retval = binfmt->core_dump(signr, regs, file);
1530 if (retval)
1531 current->signal->group_exit_code |= 0x80;
1532 close_fail:
1533 filp_close(file, NULL);
1534 fail_unlock:
1535 current->fsuid = fsuid;
1536 complete_all(&mm->core_done);
1537 fail:
1538 return retval;