fs/exec.c

   1 /*
   2  *  linux/fs/exec.c
   3  *
   4  *  Copyright (C) 1991, 1992  Linus Torvalds
   5  */
   6
   7 /*
   8  * #!-checking implemented by tytso.
   9  */
  10 /*
  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.
  14  *
  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.
  17  *
  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.
  23  */
  24
  25 #include <linux/slab.h>
  26 #include <linux/file.h>
  27 #include <linux/fdtable.h>
  28 #include <linux/mm.h>
  29 #include <linux/stat.h>
  30 #include <linux/fcntl.h>
  31 #include <linux/smp_lock.h>
  32 #include <linux/swap.h>
  33 #include <linux/string.h>
  34 #include <linux/init.h>
  35 #include <linux/pagemap.h>
  36 #include <linux/highmem.h>
  37 #include <linux/spinlock.h>
  38 #include <linux/key.h>
  39 #include <linux/personality.h>
  40 #include <linux/binfmts.h>
  41 #include <linux/utsname.h>
  42 #include <linux/pid_namespace.h>
  43 #include <linux/module.h>
  44 #include <linux/namei.h>
  45 #include <linux/proc_fs.h>
  46 #include <linux/mount.h>
  47 #include <linux/security.h>
  48 #include <linux/syscalls.h>
  49 #include <linux/tsacct_kern.h>
  50 #include <linux/cn_proc.h>
  51 #include <linux/audit.h>
  52 #include <linux/tracehook.h>
  53
  54 #include <asm/uaccess.h>
  55 #include <asm/mmu_context.h>
  56 #include <asm/tlb.h>
  57
  58 #ifdef CONFIG_KMOD
  59 #include <linux/kmod.h>
  60 #endif
  61
  62 #ifdef __alpha__
  63 /* for /sbin/loader handling in search_binary_handler() */
  64 #include <linux/a.out.h>
  65 #endif
  66
  67 int core_uses_pid;
  68 char core_pattern[CORENAME_MAX_SIZE] = "core";
  69 int suid_dumpable = 0;
  70
  71 /* The maximal length of core_pattern is also specified in sysctl.c */
  72
  73 static LIST_HEAD(formats);
  74 static DEFINE_RWLOCK(binfmt_lock);
  75
  76 int register_binfmt(struct linux_binfmt * fmt)
  77 {
  78         if (!fmt)
  79                 return -EINVAL;
  80         write_lock(&binfmt_lock);
  81         list_add(&fmt->lh, &formats);
  82         write_unlock(&binfmt_lock);
  83         return 0;
  84 }
  85
  86 EXPORT_SYMBOL(register_binfmt);
  87
  88 void unregister_binfmt(struct linux_binfmt * fmt)
  89 {
  90         write_lock(&binfmt_lock);
  91         list_del(&fmt->lh);
  92         write_unlock(&binfmt_lock);
  93 }
  94
  95 EXPORT_SYMBOL(unregister_binfmt);
  96
  97 static inline void put_binfmt(struct linux_binfmt * fmt)
  98 {
  99         module_put(fmt->module);
 100 }
 101
 102 /*
 103  * Note that a shared library must be both readable and executable due to
 104  * security reasons.
 105  *
 106  * Also note that we take the address to load from from the file itself.
 107  */
 108 asmlinkage long sys_uselib(const char __user * library)
 109 {
 110         struct file *file;
 111         struct nameidata nd;
 112         char *tmp = getname(library);
 113         int error = PTR_ERR(tmp);
 114
 115         if (!IS_ERR(tmp)) {
 116                 error = path_lookup_open(AT_FDCWD, tmp,
 117                                          LOOKUP_FOLLOW, &nd,
 118                                          FMODE_READ|FMODE_EXEC);
 119                 putname(tmp);
 120         }
 121         if (error)
 122                 goto out;
 123
 124         error = -EINVAL;
 125         if (!S_ISREG(nd.path.dentry->d_inode->i_mode))
 126                 goto exit;
 127
 128         error = -EACCES;
 129         if (nd.path.mnt->mnt_flags & MNT_NOEXEC)
 130                 goto exit;
 131
 132         error = vfs_permission(&nd, MAY_READ | MAY_EXEC | MAY_OPEN);
 133         if (error)
 134                 goto exit;
 135
 136         file = nameidata_to_filp(&nd, O_RDONLY|O_LARGEFILE);
 137         error = PTR_ERR(file);
 138         if (IS_ERR(file))
 139                 goto out;
 140
 141         error = -ENOEXEC;
 142         if(file->f_op) {
 143                 struct linux_binfmt * fmt;
 144
 145                 read_lock(&binfmt_lock);
 146                 list_for_each_entry(fmt, &formats, lh) {
 147                         if (!fmt->load_shlib)
 148                                 continue;
 149                         if (!try_module_get(fmt->module))
 150                                 continue;
 151                         read_unlock(&binfmt_lock);
 152                         error = fmt->load_shlib(file);
 153                         read_lock(&binfmt_lock);
 154                         put_binfmt(fmt);
 155                         if (error != -ENOEXEC)
 156                                 break;
 157                 }
 158                 read_unlock(&binfmt_lock);
 159         }
 160         fput(file);
 161 out:
 162         return error;
 163 exit:
 164         release_open_intent(&nd);
 165         path_put(&nd.path);
 166         goto out;
 167 }
 168
 169 #ifdef CONFIG_MMU
 170
 171 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
 172                 int write)
 173 {
 174         struct page *page;
 175         int ret;
 176
 177 #ifdef CONFIG_STACK_GROWSUP
 178         if (write) {
 179                 ret = expand_stack_downwards(bprm->vma, pos);
 180                 if (ret < 0)
 181                         return NULL;
 182         }
 183 #endif
 184         ret = get_user_pages(current, bprm->mm, pos,
 185                         1, write, 1, &page, NULL);
 186         if (ret <= 0)
 187                 return NULL;
 188
 189         if (write) {
 190                 unsigned long size = bprm->vma->vm_end - bprm->vma->vm_start;
 191                 struct rlimit *rlim;
 192
 193                 /*
 194                  * We've historically supported up to 32 pages (ARG_MAX)
 195                  * of argument strings even with small stacks
 196                  */
 197                 if (size <= ARG_MAX)
 198                         return page;
 199
 200                 /*
 201                  * Limit to 1/4-th the stack size for the argv+env strings.
 202                  * This ensures that:
 203                  *  - the remaining binfmt code will not run out of stack space,
 204                  *  - the program will have a reasonable amount of stack left
 205                  *    to work from.
 206                  */
 207                 rlim = current->signal->rlim;
 208                 if (size > rlim[RLIMIT_STACK].rlim_cur / 4) {
 209                         put_page(page);
 210                         return NULL;
 211                 }
 212         }
 213
 214         return page;
 215 }
 216
 217 static void put_arg_page(struct page *page)
 218 {
 219         put_page(page);
 220 }
 221
 222 static void free_arg_page(struct linux_binprm *bprm, int i)
 223 {
 224 }
 225
 226 static void free_arg_pages(struct linux_binprm *bprm)
 227 {
 228 }
 229
 230 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
 231                 struct page *page)
 232 {
 233         flush_cache_page(bprm->vma, pos, page_to_pfn(page));
 234 }
 235
 236 static int __bprm_mm_init(struct linux_binprm *bprm)
 237 {
 238         int err = -ENOMEM;
 239         struct vm_area_struct *vma = NULL;
 240         struct mm_struct *mm = bprm->mm;
 241
 242         bprm->vma = vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
 243         if (!vma)
 244                 goto err;
 245
 246         down_write(&mm->mmap_sem);
 247         vma->vm_mm = mm;
 248
 249         /*
 250          * Place the stack at the largest stack address the architecture
 251          * supports. Later, we'll move this to an appropriate place. We don't
 252          * use STACK_TOP because that can depend on attributes which aren't
 253          * configured yet.
 254          */
 255         vma->vm_end = STACK_TOP_MAX;
 256         vma->vm_start = vma->vm_end - PAGE_SIZE;
 257
 258         vma->vm_flags = VM_STACK_FLAGS;
 259         vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
 260         err = insert_vm_struct(mm, vma);
 261         if (err) {
 262                 up_write(&mm->mmap_sem);
 263                 goto err;
 264         }
 265
 266         mm->stack_vm = mm->total_vm = 1;
 267         up_write(&mm->mmap_sem);
 268
 269         bprm->p = vma->vm_end - sizeof(void *);
 270
 271         return 0;
 272
 273 err:
 274         if (vma) {
 275                 bprm->vma = NULL;
 276                 kmem_cache_free(vm_area_cachep, vma);
 277         }
 278
 279         return err;
 280 }
 281
 282 static bool valid_arg_len(struct linux_binprm *bprm, long len)
 283 {
 284         return len <= MAX_ARG_STRLEN;
 285 }
 286
 287 #else
 288
 289 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
 290                 int write)
 291 {
 292         struct page *page;
 293
 294         page = bprm->page[pos / PAGE_SIZE];
 295         if (!page && write) {
 296                 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
 297                 if (!page)
 298                         return NULL;
 299                 bprm->page[pos / PAGE_SIZE] = page;
 300         }
 301
 302         return page;
 303 }
 304
 305 static void put_arg_page(struct page *page)
 306 {
 307 }
 308
 309 static void free_arg_page(struct linux_binprm *bprm, int i)
 310 {
 311         if (bprm->page[i]) {
 312                 __free_page(bprm->page[i]);
 313                 bprm->page[i] = NULL;
 314         }
 315 }
 316
 317 static void free_arg_pages(struct linux_binprm *bprm)
 318 {
 319         int i;
 320
 321         for (i = 0; i < MAX_ARG_PAGES; i++)
 322                 free_arg_page(bprm, i);
 323 }
 324
 325 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
 326                 struct page *page)
 327 {
 328 }
 329
 330 static int __bprm_mm_init(struct linux_binprm *bprm)
 331 {
 332         bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
 333         return 0;
 334 }
 335
 336 static bool valid_arg_len(struct linux_binprm *bprm, long len)
 337 {
 338         return len <= bprm->p;
 339 }
 340
 341 #endif /* CONFIG_MMU */
 342
 343 /*
 344  * Create a new mm_struct and populate it with a temporary stack
 345  * vm_area_struct.  We don't have enough context at this point to set the stack
 346  * flags, permissions, and offset, so we use temporary values.  We'll update
 347  * them later in setup_arg_pages().
 348  */
 349 int bprm_mm_init(struct linux_binprm *bprm)
 350 {
 351         int err;
 352         struct mm_struct *mm = NULL;
 353
 354         bprm->mm = mm = mm_alloc();
 355         err = -ENOMEM;
 356         if (!mm)
 357                 goto err;
 358
 359         err = init_new_context(current, mm);
 360         if (err)
 361                 goto err;
 362
 363         err = __bprm_mm_init(bprm);
 364         if (err)
 365                 goto err;
 366
 367         return 0;
 368
 369 err:
 370         if (mm) {
 371                 bprm->mm = NULL;
 372                 mmdrop(mm);
 373         }
 374
 375         return err;
 376 }
 377
 378 /*
 379  * count() counts the number of strings in array ARGV.
 380  */
 381 static int count(char __user * __user * argv, int max)
 382 {
 383         int i = 0;
 384
 385         if (argv != NULL) {
 386                 for (;;) {
 387                         char __user * p;
 388
 389                         if (get_user(p, argv))
 390                                 return -EFAULT;
 391                         if (!p)
 392                                 break;
 393                         argv++;
 394                         if(++i > max)
 395                                 return -E2BIG;
 396                         cond_resched();
 397                 }
 398         }
 399         return i;
 400 }
 401
 402 /*
 403  * 'copy_strings()' copies argument/environment strings from the old
 404  * processes's memory to the new process's stack.  The call to get_user_pages()
 405  * ensures the destination page is created and not swapped out.
 406  */
 407 static int copy_strings(int argc, char __user * __user * argv,
 408                         struct linux_binprm *bprm)
 409 {
 410         struct page *kmapped_page = NULL;
 411         char *kaddr = NULL;
 412         unsigned long kpos = 0;
 413         int ret;
 414
 415         while (argc-- > 0) {
 416                 char __user *str;
 417                 int len;
 418                 unsigned long pos;
 419
 420                 if (get_user(str, argv+argc) ||
 421                                 !(len = strnlen_user(str, MAX_ARG_STRLEN))) {
 422                         ret = -EFAULT;
 423                         goto out;
 424                 }
 425
 426                 if (!valid_arg_len(bprm, len)) {
 427                         ret = -E2BIG;
 428                         goto out;
 429                 }
 430
 431                 /* We're going to work our way backwords. */
 432                 pos = bprm->p;
 433                 str += len;
 434                 bprm->p -= len;
 435
 436                 while (len > 0) {
 437                         int offset, bytes_to_copy;
 438
 439                         offset = pos % PAGE_SIZE;
 440                         if (offset == 0)
 441                                 offset = PAGE_SIZE;
 442
 443                         bytes_to_copy = offset;
 444                         if (bytes_to_copy > len)
 445                                 bytes_to_copy = len;
 446
 447                         offset -= bytes_to_copy;
 448                         pos -= bytes_to_copy;
 449                         str -= bytes_to_copy;
 450                         len -= bytes_to_copy;
 451
 452                         if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
 453                                 struct page *page;
 454
 455                                 page = get_arg_page(bprm, pos, 1);
 456                                 if (!page) {
 457                                         ret = -E2BIG;
 458                                         goto out;
 459                                 }
 460
 461                                 if (kmapped_page) {
 462                                         flush_kernel_dcache_page(kmapped_page);
 463                                         kunmap(kmapped_page);
 464                                         put_arg_page(kmapped_page);
 465                                 }
 466                                 kmapped_page = page;
 467                                 kaddr = kmap(kmapped_page);
 468                                 kpos = pos & PAGE_MASK;
 469                                 flush_arg_page(bprm, kpos, kmapped_page);
 470                         }
 471                         if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
 472                                 ret = -EFAULT;
 473                                 goto out;
 474                         }
 475                 }
 476         }
 477         ret = 0;
 478 out:
 479         if (kmapped_page) {
 480                 flush_kernel_dcache_page(kmapped_page);
 481                 kunmap(kmapped_page);
 482                 put_arg_page(kmapped_page);
 483         }
 484         return ret;
 485 }
 486
 487 /*
 488  * Like copy_strings, but get argv and its values from kernel memory.
 489  */
 490 int copy_strings_kernel(int argc,char ** argv, struct linux_binprm *bprm)
 491 {
 492         int r;
 493         mm_segment_t oldfs = get_fs();
 494         set_fs(KERNEL_DS);
 495         r = copy_strings(argc, (char __user * __user *)argv, bprm);
 496         set_fs(oldfs);
 497         return r;
 498 }
 499 EXPORT_SYMBOL(copy_strings_kernel);
 500
 501 #ifdef CONFIG_MMU
 502
 503 /*
 504  * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX.  Once
 505  * the binfmt code determines where the new stack should reside, we shift it to
 506  * its final location.  The process proceeds as follows:
 507  *
 508  * 1) Use shift to calculate the new vma endpoints.
 509  * 2) Extend vma to cover both the old and new ranges.  This ensures the
 510  *    arguments passed to subsequent functions are consistent.
 511  * 3) Move vma's page tables to the new range.
 512  * 4) Free up any cleared pgd range.
 513  * 5) Shrink the vma to cover only the new range.
 514  */
 515 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
 516 {
 517         struct mm_struct *mm = vma->vm_mm;
 518         unsigned long old_start = vma->vm_start;
 519         unsigned long old_end = vma->vm_end;
 520         unsigned long length = old_end - old_start;
 521         unsigned long new_start = old_start - shift;
 522         unsigned long new_end = old_end - shift;
 523         struct mmu_gather *tlb;
 524
 525         BUG_ON(new_start > new_end);
 526
 527         /*
 528          * ensure there are no vmas between where we want to go
 529          * and where we are
 530          */
 531         if (vma != find_vma(mm, new_start))
 532                 return -EFAULT;
 533
 534         /*
 535          * cover the whole range: [new_start, old_end)
 536          */
 537         vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL);
 538
 539         /*
 540          * move the page tables downwards, on failure we rely on
 541          * process cleanup to remove whatever mess we made.
 542          */
 543         if (length != move_page_tables(vma, old_start,
 544                                        vma, new_start, length))
 545                 return -ENOMEM;
 546
 547         lru_add_drain();
 548         tlb = tlb_gather_mmu(mm, 0);
 549         if (new_end > old_start) {
 550                 /*
 551                  * when the old and new regions overlap clear from new_end.
 552                  */
 553                 free_pgd_range(tlb, new_end, old_end, new_end,
 554                         vma->vm_next ? vma->vm_next->vm_start : 0);
 555         } else {
 556                 /*
 557                  * otherwise, clean from old_start; this is done to not touch
 558                  * the address space in [new_end, old_start) some architectures
 559                  * have constraints on va-space that make this illegal (IA64) -
 560                  * for the others its just a little faster.
 561                  */
 562                 free_pgd_range(tlb, old_start, old_end, new_end,
 563                         vma->vm_next ? vma->vm_next->vm_start : 0);
 564         }
 565         tlb_finish_mmu(tlb, new_end, old_end);
 566
 567         /*
 568          * shrink the vma to just the new range.
 569          */
 570         vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL);
 571
 572         return 0;
 573 }
 574
 575 #define EXTRA_STACK_VM_PAGES    20      /* random */
 576
 577 /*
 578  * Finalizes the stack vm_area_struct. The flags and permissions are updated,
 579  * the stack is optionally relocated, and some extra space is added.
 580  */
 581 int setup_arg_pages(struct linux_binprm *bprm,
 582                     unsigned long stack_top,
 583                     int executable_stack)
 584 {
 585         unsigned long ret;
 586         unsigned long stack_shift;
 587         struct mm_struct *mm = current->mm;
 588         struct vm_area_struct *vma = bprm->vma;
 589         struct vm_area_struct *prev = NULL;
 590         unsigned long vm_flags;
 591         unsigned long stack_base;
 592
 593 #ifdef CONFIG_STACK_GROWSUP
 594         /* Limit stack size to 1GB */
 595         stack_base = current->signal->rlim[RLIMIT_STACK].rlim_max;
 596         if (stack_base > (1 << 30))
 597                 stack_base = 1 << 30;
 598
 599         /* Make sure we didn't let the argument array grow too large. */
 600         if (vma->vm_end - vma->vm_start > stack_base)
 601                 return -ENOMEM;
 602
 603         stack_base = PAGE_ALIGN(stack_top - stack_base);
 604
 605         stack_shift = vma->vm_start - stack_base;
 606         mm->arg_start = bprm->p - stack_shift;
 607         bprm->p = vma->vm_end - stack_shift;
 608 #else
 609         stack_top = arch_align_stack(stack_top);
 610         stack_top = PAGE_ALIGN(stack_top);
 611         stack_shift = vma->vm_end - stack_top;
 612
 613         bprm->p -= stack_shift;
 614         mm->arg_start = bprm->p;
 615 #endif
 616
 617         if (bprm->loader)
 618                 bprm->loader -= stack_shift;
 619         bprm->exec -= stack_shift;
 620
 621         down_write(&mm->mmap_sem);
 622         vm_flags = VM_STACK_FLAGS;
 623
 624         /*
 625          * Adjust stack execute permissions; explicitly enable for
 626          * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
 627          * (arch default) otherwise.
 628          */
 629         if (unlikely(executable_stack == EXSTACK_ENABLE_X))
 630                 vm_flags |= VM_EXEC;
 631         else if (executable_stack == EXSTACK_DISABLE_X)
 632                 vm_flags &= ~VM_EXEC;
 633         vm_flags |= mm->def_flags;
 634
 635         ret = mprotect_fixup(vma, &prev, vma->vm_start, vma->vm_end,
 636                         vm_flags);
 637         if (ret)
 638                 goto out_unlock;
 639         BUG_ON(prev != vma);
 640
 641         /* Move stack pages down in memory. */
 642         if (stack_shift) {
 643                 ret = shift_arg_pages(vma, stack_shift);
 644                 if (ret) {
 645                         up_write(&mm->mmap_sem);
 646                         return ret;
 647                 }
 648         }
 649
 650 #ifdef CONFIG_STACK_GROWSUP
 651         stack_base = vma->vm_end + EXTRA_STACK_VM_PAGES * PAGE_SIZE;
 652 #else
 653         stack_base = vma->vm_start - EXTRA_STACK_VM_PAGES * PAGE_SIZE;
 654 #endif
 655         ret = expand_stack(vma, stack_base);
 656         if (ret)
 657                 ret = -EFAULT;
 658
 659 out_unlock:
 660         up_write(&mm->mmap_sem);
 661         return 0;
 662 }
 663 EXPORT_SYMBOL(setup_arg_pages);
 664
 665 #endif /* CONFIG_MMU */
 666
 667 struct file *open_exec(const char *name)
 668 {
 669         struct nameidata nd;
 670         struct file *file;
 671         int err;
 672
 673         err = path_lookup_open(AT_FDCWD, name, LOOKUP_FOLLOW, &nd,
 674                                 FMODE_READ|FMODE_EXEC);
 675         if (err)
 676                 goto out;
 677
 678         err = -EACCES;
 679         if (!S_ISREG(nd.path.dentry->d_inode->i_mode))
 680                 goto out_path_put;
 681
 682         if (nd.path.mnt->mnt_flags & MNT_NOEXEC)
 683                 goto out_path_put;
 684
 685         err = vfs_permission(&nd, MAY_EXEC | MAY_OPEN);
 686         if (err)
 687                 goto out_path_put;
 688
 689         file = nameidata_to_filp(&nd, O_RDONLY|O_LARGEFILE);
 690         if (IS_ERR(file))
 691                 return file;
 692
 693         err = deny_write_access(file);
 694         if (err) {
 695                 fput(file);
 696                 goto out;
 697         }
 698
 699         return file;
 700
 701  out_path_put:
 702         release_open_intent(&nd);
 703         path_put(&nd.path);
 704  out:
 705         return ERR_PTR(err);
 706 }
 707 EXPORT_SYMBOL(open_exec);
 708
 709 int kernel_read(struct file *file, unsigned long offset,
 710         char *addr, unsigned long count)
 711 {
 712         mm_segment_t old_fs;
 713         loff_t pos = offset;
 714         int result;
 715
 716         old_fs = get_fs();
 717         set_fs(get_ds());
 718         /* The cast to a user pointer is valid due to the set_fs() */
 719         result = vfs_read(file, (void __user *)addr, count, &pos);
 720         set_fs(old_fs);
 721         return result;
 722 }
 723
 724 EXPORT_SYMBOL(kernel_read);
 725
 726 static int exec_mmap(struct mm_struct *mm)
 727 {
 728         struct task_struct *tsk;
 729         struct mm_struct * old_mm, *active_mm;
 730
 731         /* Notify parent that we're no longer interested in the old VM */
 732         tsk = current;
 733         old_mm = current->mm;
 734         mm_release(tsk, old_mm);
 735
 736         if (old_mm) {
 737                 /*
 738                  * Make sure that if there is a core dump in progress
 739                  * for the old mm, we get out and die instead of going
 740                  * through with the exec.  We must hold mmap_sem around
 741                  * checking core_state and changing tsk->mm.
 742                  */
 743                 down_read(&old_mm->mmap_sem);
 744                 if (unlikely(old_mm->core_state)) {
 745                         up_read(&old_mm->mmap_sem);
 746                         return -EINTR;
 747                 }
 748         }
 749         task_lock(tsk);
 750         active_mm = tsk->active_mm;
 751         tsk->mm = mm;
 752         tsk->active_mm = mm;
 753         activate_mm(active_mm, mm);
 754         task_unlock(tsk);
 755         arch_pick_mmap_layout(mm);
 756         if (old_mm) {
 757                 up_read(&old_mm->mmap_sem);
 758                 BUG_ON(active_mm != old_mm);
 759                 mm_update_next_owner(old_mm);
 760                 mmput(old_mm);
 761                 return 0;
 762         }
 763         mmdrop(active_mm);
 764         return 0;
 765 }
 766
 767 /*
 768  * This function makes sure the current process has its own signal table,
 769  * so that flush_signal_handlers can later reset the handlers without
 770  * disturbing other processes.  (Other processes might share the signal
 771  * table via the CLONE_SIGHAND option to clone().)
 772  */
 773 static int de_thread(struct task_struct *tsk)
 774 {
 775         struct signal_struct *sig = tsk->signal;
 776         struct sighand_struct *oldsighand = tsk->sighand;
 777         spinlock_t *lock = &oldsighand->siglock;
 778         struct task_struct *leader = NULL;
 779         int count;
 780
 781         if (thread_group_empty(tsk))
 782                 goto no_thread_group;
 783
 784         /*
 785          * Kill all other threads in the thread group.
 786          */
 787         spin_lock_irq(lock);
 788         if (signal_group_exit(sig)) {
 789                 /*
 790                  * Another group action in progress, just
 791                  * return so that the signal is processed.
 792                  */
 793                 spin_unlock_irq(lock);
 794                 return -EAGAIN;
 795         }
 796         sig->group_exit_task = tsk;
 797         zap_other_threads(tsk);
 798
 799         /* Account for the thread group leader hanging around: */
 800         count = thread_group_leader(tsk) ? 1 : 2;
 801         sig->notify_count = count;
 802         while (atomic_read(&sig->count) > count) {
 803                 __set_current_state(TASK_UNINTERRUPTIBLE);
 804                 spin_unlock_irq(lock);
 805                 schedule();
 806                 spin_lock_irq(lock);
 807         }
 808         spin_unlock_irq(lock);
 809
 810         /*
 811          * At this point all other threads have exited, all we have to
 812          * do is to wait for the thread group leader to become inactive,
 813          * and to assume its PID:
 814          */
 815         if (!thread_group_leader(tsk)) {
 816                 leader = tsk->group_leader;
 817
 818                 sig->notify_count = -1; /* for exit_notify() */
 819                 for (;;) {
 820                         write_lock_irq(&tasklist_lock);
 821                         if (likely(leader->exit_state))
 822                                 break;
 823                         __set_current_state(TASK_UNINTERRUPTIBLE);
 824                         write_unlock_irq(&tasklist_lock);
 825                         schedule();
 826                 }
 827
 828                 if (unlikely(task_child_reaper(tsk) == leader))
 829                         task_active_pid_ns(tsk)->child_reaper = tsk;
 830                 /*
 831                  * The only record we have of the real-time age of a
 832                  * process, regardless of execs it's done, is start_time.
 833                  * All the past CPU time is accumulated in signal_struct
 834                  * from sister threads now dead.  But in this non-leader
 835                  * exec, nothing survives from the original leader thread,
 836                  * whose birth marks the true age of this process now.
 837                  * When we take on its identity by switching to its PID, we
 838                  * also take its birthdate (always earlier than our own).
 839                  */
 840                 tsk->start_time = leader->start_time;
 841
 842                 BUG_ON(!same_thread_group(leader, tsk));
 843                 BUG_ON(has_group_leader_pid(tsk));
 844                 /*
 845                  * An exec() starts a new thread group with the
 846                  * TGID of the previous thread group. Rehash the
 847                  * two threads with a switched PID, and release
 848                  * the former thread group leader:
 849                  */
 850
 851                 /* Become a process group leader with the old leader's pid.
 852                  * The old leader becomes a thread of the this thread group.
 853                  * Note: The old leader also uses this pid until release_task
 854                  *       is called.  Odd but simple and correct.
 855                  */
 856                 detach_pid(tsk, PIDTYPE_PID);
 857                 tsk->pid = leader->pid;
 858                 attach_pid(tsk, PIDTYPE_PID,  task_pid(leader));
 859                 transfer_pid(leader, tsk, PIDTYPE_PGID);
 860                 transfer_pid(leader, tsk, PIDTYPE_SID);
 861                 list_replace_rcu(&leader->tasks, &tsk->tasks);
 862
 863                 tsk->group_leader = tsk;
 864                 leader->group_leader = tsk;
 865
 866                 tsk->exit_signal = SIGCHLD;
 867
 868                 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
 869                 leader->exit_state = EXIT_DEAD;
 870
 871                 write_unlock_irq(&tasklist_lock);
 872         }
 873
 874         sig->group_exit_task = NULL;
 875         sig->notify_count = 0;
 876
 877 no_thread_group:
 878         exit_itimers(sig);
 879         flush_itimer_signals();
 880         if (leader)
 881                 release_task(leader);
 882
 883         if (atomic_read(&oldsighand->count) != 1) {
 884                 struct sighand_struct *newsighand;
 885                 /*
 886                  * This ->sighand is shared with the CLONE_SIGHAND
 887                  * but not CLONE_THREAD task, switch to the new one.
 888                  */
 889                 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
 890                 if (!newsighand)
 891                         return -ENOMEM;
 892
 893                 atomic_set(&newsighand->count, 1);
 894                 memcpy(newsighand->action, oldsighand->action,
 895                        sizeof(newsighand->action));
 896
 897                 write_lock_irq(&tasklist_lock);
 898                 spin_lock(&oldsighand->siglock);
 899                 rcu_assign_pointer(tsk->sighand, newsighand);
 900                 spin_unlock(&oldsighand->siglock);
 901                 write_unlock_irq(&tasklist_lock);
 902
 903                 __cleanup_sighand(oldsighand);
 904         }
 905
 906         BUG_ON(!thread_group_leader(tsk));
 907         return 0;
 908 }
 909
 910 /*
 911  * These functions flushes out all traces of the currently running executable
 912  * so that a new one can be started
 913  */
 914 static void flush_old_files(struct files_struct * files)
 915 {
 916         long j = -1;
 917         struct fdtable *fdt;
 918
 919         spin_lock(&files->file_lock);
 920         for (;;) {
 921                 unsigned long set, i;
 922
 923                 j++;
 924                 i = j * __NFDBITS;
 925                 fdt = files_fdtable(files);
 926                 if (i >= fdt->max_fds)
 927                         break;
 928                 set = fdt->close_on_exec->fds_bits[j];
 929                 if (!set)
 930                         continue;
 931                 fdt->close_on_exec->fds_bits[j] = 0;
 932                 spin_unlock(&files->file_lock);
 933                 for ( ; set ; i++,set >>= 1) {
 934                         if (set & 1) {
 935                                 sys_close(i);
 936                         }
 937                 }
 938                 spin_lock(&files->file_lock);
 939
 940         }
 941         spin_unlock(&files->file_lock);
 942 }
 943
 944 char *get_task_comm(char *buf, struct task_struct *tsk)
 945 {
 946         /* buf must be at least sizeof(tsk->comm) in size */
 947         task_lock(tsk);
 948         strncpy(buf, tsk->comm, sizeof(tsk->comm));
 949         task_unlock(tsk);
 950         return buf;
 951 }
 952
 953 void set_task_comm(struct task_struct *tsk, char *buf)
 954 {
 955         task_lock(tsk);
 956         strlcpy(tsk->comm, buf, sizeof(tsk->comm));
 957         task_unlock(tsk);
 958 }
 959
 960 int flush_old_exec(struct linux_binprm * bprm)
 961 {
 962         char * name;
 963         int i, ch, retval;
 964         char tcomm[sizeof(current->comm)];
 965
 966         /*
 967          * Make sure we have a private signal table and that
 968          * we are unassociated from the previous thread group.
 969          */
 970         retval = de_thread(current);
 971         if (retval)
 972                 goto out;
 973
 974         set_mm_exe_file(bprm->mm, bprm->file);
 975
 976         /*
 977          * Release all of the old mmap stuff
 978          */
 979         retval = exec_mmap(bprm->mm);
 980         if (retval)
 981                 goto out;
 982
 983         bprm->mm = NULL;                /* We're using it now */
 984
 985         /* This is the point of no return */
 986         current->sas_ss_sp = current->sas_ss_size = 0;
 987
 988         if (current->euid == current->uid && current->egid == current->gid)
 989                 set_dumpable(current->mm, 1);
 990         else
 991                 set_dumpable(current->mm, suid_dumpable);
 992
 993         name = bprm->filename;
 994
 995         /* Copies the binary name from after last slash */
 996         for (i=0; (ch = *(name++)) != '\0';) {
 997                 if (ch == '/')
 998                         i = 0; /* overwrite what we wrote */
 999                 else
1000                         if (i < (sizeof(tcomm) - 1))
1001                                 tcomm[i++] = ch;
1002         }
1003         tcomm[i] = '\0';
1004         set_task_comm(current, tcomm);
1005
1006         current->flags &= ~PF_RANDOMIZE;
1007         flush_thread();
1008
1009         /* Set the new mm task size. We have to do that late because it may
1010          * depend on TIF_32BIT which is only updated in flush_thread() on
1011          * some architectures like powerpc
1012          */
1013         current->mm->task_size = TASK_SIZE;
1014
1015         if (bprm->e_uid != current->euid || bprm->e_gid != current->egid) {
1016                 suid_keys(current);
1017                 set_dumpable(current->mm, suid_dumpable);
1018                 current->pdeath_signal = 0;
1019         } else if (file_permission(bprm->file, MAY_READ) ||
1020                         (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP)) {
1021                 suid_keys(current);
1022                 set_dumpable(current->mm, suid_dumpable);
1023         }
1024
1025         /* An exec changes our domain. We are no longer part of the thread
1026            group */
1027
1028         current->self_exec_id++;
1029
1030         flush_signal_handlers(current, 0);
1031         flush_old_files(current->files);
1032
1033         return 0;
1034
1035 out:
1036         return retval;
1037 }
1038
1039 EXPORT_SYMBOL(flush_old_exec);
1040
1041 /*
1042  * Fill the binprm structure from the inode.
1043  * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
1044  */
1045 int prepare_binprm(struct linux_binprm *bprm)
1046 {
1047         int mode;
1048         struct inode * inode = bprm->file->f_path.dentry->d_inode;
1049         int retval;
1050
1051         mode = inode->i_mode;
1052         if (bprm->file->f_op == NULL)
1053                 return -EACCES;
1054
1055         bprm->e_uid = current->euid;
1056         bprm->e_gid = current->egid;
1057
1058         if(!(bprm->file->f_path.mnt->mnt_flags & MNT_NOSUID)) {
1059                 /* Set-uid? */
1060                 if (mode & S_ISUID) {
1061                         current->personality &= ~PER_CLEAR_ON_SETID;
1062                         bprm->e_uid = inode->i_uid;
1063                 }
1064
1065                 /* Set-gid? */
1066                 /*
1067                  * If setgid is set but no group execute bit then this
1068                  * is a candidate for mandatory locking, not a setgid
1069                  * executable.
1070                  */
1071                 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1072                         current->personality &= ~PER_CLEAR_ON_SETID;
1073                         bprm->e_gid = inode->i_gid;
1074                 }
1075         }
1076
1077         /* fill in binprm security blob */
1078         retval = security_bprm_set(bprm);
1079         if (retval)
1080                 return retval;
1081
1082         memset(bprm->buf,0,BINPRM_BUF_SIZE);
1083         return kernel_read(bprm->file,0,bprm->buf,BINPRM_BUF_SIZE);
1084 }
1085
1086 EXPORT_SYMBOL(prepare_binprm);
1087
1088 static int unsafe_exec(struct task_struct *p)
1089 {
1090         int unsafe = tracehook_unsafe_exec(p);
1091
1092         if (atomic_read(&p->fs->count) > 1 ||
1093             atomic_read(&p->files->count) > 1 ||
1094             atomic_read(&p->sighand->count) > 1)
1095                 unsafe |= LSM_UNSAFE_SHARE;
1096
1097         return unsafe;
1098 }
1099
1100 void compute_creds(struct linux_binprm *bprm)
1101 {
1102         int unsafe;
1103
1104         if (bprm->e_uid != current->uid) {
1105                 suid_keys(current);
1106                 current->pdeath_signal = 0;
1107         }
1108         exec_keys(current);
1109
1110         task_lock(current);
1111         unsafe = unsafe_exec(current);
1112         security_bprm_apply_creds(bprm, unsafe);
1113         task_unlock(current);
1114         security_bprm_post_apply_creds(bprm);
1115 }
1116 EXPORT_SYMBOL(compute_creds);
1117
1118 /*
1119  * Arguments are '\0' separated strings found at the location bprm->p
1120  * points to; chop off the first by relocating brpm->p to right after
1121  * the first '\0' encountered.
1122  */
1123 int remove_arg_zero(struct linux_binprm *bprm)
1124 {
1125         int ret = 0;
1126         unsigned long offset;
1127         char *kaddr;
1128         struct page *page;
1129
1130         if (!bprm->argc)
1131                 return 0;
1132
1133         do {
1134                 offset = bprm->p & ~PAGE_MASK;
1135                 page = get_arg_page(bprm, bprm->p, 0);
1136                 if (!page) {
1137                         ret = -EFAULT;
1138                         goto out;
1139                 }
1140                 kaddr = kmap_atomic(page, KM_USER0);
1141
1142                 for (; offset < PAGE_SIZE && kaddr[offset];
1143                                 offset++, bprm->p++)
1144                         ;
1145
1146                 kunmap_atomic(kaddr, KM_USER0);
1147                 put_arg_page(page);
1148
1149                 if (offset == PAGE_SIZE)
1150                         free_arg_page(bprm, (bprm->p >> PAGE_SHIFT) - 1);
1151         } while (offset == PAGE_SIZE);
1152
1153         bprm->p++;
1154         bprm->argc--;
1155         ret = 0;
1156
1157 out:
1158         return ret;
1159 }
1160 EXPORT_SYMBOL(remove_arg_zero);
1161
1162 /*
1163  * cycle the list of binary formats handler, until one recognizes the image
1164  */
1165 int search_binary_handler(struct linux_binprm *bprm,struct pt_regs *regs)
1166 {
1167         unsigned int depth = bprm->recursion_depth;
1168         int try,retval;
1169         struct linux_binfmt *fmt;
1170 #ifdef __alpha__
1171         /* handle /sbin/loader.. */
1172         {
1173             struct exec * eh = (struct exec *) bprm->buf;
1174
1175             if (!bprm->loader && eh->fh.f_magic == 0x183 &&
1176                 (eh->fh.f_flags & 0x3000) == 0x3000)
1177             {
1178                 struct file * file;
1179                 unsigned long loader;
1180
1181                 allow_write_access(bprm->file);
1182                 fput(bprm->file);
1183                 bprm->file = NULL;
1184
1185                 loader = bprm->vma->vm_end - sizeof(void *);
1186
1187                 file = open_exec("/sbin/loader");
1188                 retval = PTR_ERR(file);
1189                 if (IS_ERR(file))
1190                         return retval;
1191
1192                 /* Remember if the application is TASO.  */
1193                 bprm->sh_bang = eh->ah.entry < 0x100000000UL;
1194
1195                 bprm->file = file;
1196                 bprm->loader = loader;
1197                 retval = prepare_binprm(bprm);
1198                 if (retval<0)
1199                         return retval;
1200                 /* should call search_binary_handler recursively here,
1201                    but it does not matter */
1202             }
1203         }
1204 #endif
1205         retval = security_bprm_check(bprm);
1206         if (retval)
1207                 return retval;
1208
1209         /* kernel module loader fixup */
1210         /* so we don't try to load run modprobe in kernel space. */
1211         set_fs(USER_DS);
1212
1213         retval = audit_bprm(bprm);
1214         if (retval)
1215                 return retval;
1216
1217         retval = -ENOENT;
1218         for (try=0; try<2; try++) {
1219                 read_lock(&binfmt_lock);
1220                 list_for_each_entry(fmt, &formats, lh) {
1221                         int (*fn)(struct linux_binprm *, struct pt_regs *) = fmt->load_binary;
1222                         if (!fn)
1223                                 continue;
1224                         if (!try_module_get(fmt->module))
1225                                 continue;
1226                         read_unlock(&binfmt_lock);
1227                         retval = fn(bprm, regs);
1228                         /*
1229                          * Restore the depth counter to its starting value
1230                          * in this call, so we don't have to rely on every
1231                          * load_binary function to restore it on return.
1232                          */
1233                         bprm->recursion_depth = depth;
1234                         if (retval >= 0) {
1235                                 if (depth == 0)
1236                                         tracehook_report_exec(fmt, bprm, regs);
1237                                 put_binfmt(fmt);
1238                                 allow_write_access(bprm->file);
1239                                 if (bprm->file)
1240                                         fput(bprm->file);
1241                                 bprm->file = NULL;
1242                                 current->did_exec = 1;
1243                                 proc_exec_connector(current);
1244                                 return retval;
1245                         }
1246                         read_lock(&binfmt_lock);
1247                         put_binfmt(fmt);
1248                         if (retval != -ENOEXEC || bprm->mm == NULL)
1249                                 break;
1250                         if (!bprm->file) {
1251                                 read_unlock(&binfmt_lock);
1252                                 return retval;
1253                         }
1254                 }
1255                 read_unlock(&binfmt_lock);
1256                 if (retval != -ENOEXEC || bprm->mm == NULL) {
1257                         break;
1258 #ifdef CONFIG_KMOD
1259                 }else{
1260 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1261                         if (printable(bprm->buf[0]) &&
1262                             printable(bprm->buf[1]) &&
1263                             printable(bprm->buf[2]) &&
1264                             printable(bprm->buf[3]))
1265                                 break; /* -ENOEXEC */
1266                         request_module("binfmt-%04x", *(unsigned short *)(&bprm->buf[2]));
1267 #endif
1268                 }
1269         }
1270         return retval;
1271 }
1272
1273 EXPORT_SYMBOL(search_binary_handler);
1274
1275 void free_bprm(struct linux_binprm *bprm)
1276 {
1277         free_arg_pages(bprm);
1278         kfree(bprm);
1279 }
1280
1281 /*
1282  * sys_execve() executes a new program.
1283  */
1284 int do_execve(char * filename,
1285         char __user *__user *argv,
1286         char __user *__user *envp,
1287         struct pt_regs * regs)
1288 {
1289         struct linux_binprm *bprm;
1290         struct file *file;
1291         struct files_struct *displaced;
1292         int retval;
1293
1294         retval = unshare_files(&displaced);
1295         if (retval)
1296                 goto out_ret;
1297
1298         retval = -ENOMEM;
1299         bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1300         if (!bprm)
1301                 goto out_files;
1302
1303         file = open_exec(filename);
1304         retval = PTR_ERR(file);
1305         if (IS_ERR(file))
1306                 goto out_kfree;
1307
1308         sched_exec();
1309
1310         bprm->file = file;
1311         bprm->filename = filename;
1312         bprm->interp = filename;
1313
1314         retval = bprm_mm_init(bprm);
1315         if (retval)
1316                 goto out_file;
1317
1318         bprm->argc = count(argv, MAX_ARG_STRINGS);
1319         if ((retval = bprm->argc) < 0)
1320                 goto out_mm;
1321
1322         bprm->envc = count(envp, MAX_ARG_STRINGS);
1323         if ((retval = bprm->envc) < 0)
1324                 goto out_mm;
1325
1326         retval = security_bprm_alloc(bprm);
1327         if (retval)
1328                 goto out;
1329
1330         retval = prepare_binprm(bprm);
1331         if (retval < 0)
1332                 goto out;
1333
1334         retval = copy_strings_kernel(1, &bprm->filename, bprm);
1335         if (retval < 0)
1336                 goto out;
1337
1338         bprm->exec = bprm->p;
1339         retval = copy_strings(bprm->envc, envp, bprm);
1340         if (retval < 0)
1341                 goto out;
1342
1343         retval = copy_strings(bprm->argc, argv, bprm);
1344         if (retval < 0)
1345                 goto out;
1346
1347         current->flags &= ~PF_KTHREAD;
1348         retval = search_binary_handler(bprm,regs);
1349         if (retval >= 0) {
1350                 /* execve success */
1351                 security_bprm_free(bprm);
1352                 acct_update_integrals(current);
1353                 free_bprm(bprm);
1354                 if (displaced)
1355                         put_files_struct(displaced);
1356                 return retval;
1357         }
1358
1359 out:
1360         if (bprm->security)
1361                 security_bprm_free(bprm);
1362
1363 out_mm:
1364         if (bprm->mm)
1365                 mmput (bprm->mm);
1366
1367 out_file:
1368         if (bprm->file) {
1369                 allow_write_access(bprm->file);
1370                 fput(bprm->file);
1371         }
1372 out_kfree:
1373         free_bprm(bprm);
1374
1375 out_files:
1376         if (displaced)
1377                 reset_files_struct(displaced);
1378 out_ret:
1379         return retval;
1380 }
1381
1382 int set_binfmt(struct linux_binfmt *new)
1383 {
1384         struct linux_binfmt *old = current->binfmt;
1385
1386         if (new) {
1387                 if (!try_module_get(new->module))
1388                         return -1;
1389         }
1390         current->binfmt = new;
1391         if (old)
1392                 module_put(old->module);
1393         return 0;
1394 }
1395
1396 EXPORT_SYMBOL(set_binfmt);
1397
1398 /* format_corename will inspect the pattern parameter, and output a
1399  * name into corename, which must have space for at least
1400  * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1401  */
1402 static int format_corename(char *corename, int nr_threads, long signr)
1403 {
1404         const char *pat_ptr = core_pattern;
1405         int ispipe = (*pat_ptr == '|');
1406         char *out_ptr = corename;
1407         char *const out_end = corename + CORENAME_MAX_SIZE;
1408         int rc;
1409         int pid_in_pattern = 0;
1410
1411         /* Repeat as long as we have more pattern to process and more output
1412            space */
1413         while (*pat_ptr) {
1414                 if (*pat_ptr != '%') {
1415                         if (out_ptr == out_end)
1416                                 goto out;
1417                         *out_ptr++ = *pat_ptr++;
1418                 } else {
1419                         switch (*++pat_ptr) {
1420                         case 0:
1421                                 goto out;
1422                         /* Double percent, output one percent */
1423                         case '%':
1424                                 if (out_ptr == out_end)
1425                                         goto out;
1426                                 *out_ptr++ = '%';
1427                                 break;
1428                         /* pid */
1429                         case 'p':
1430                                 pid_in_pattern = 1;
1431                                 rc = snprintf(out_ptr, out_end - out_ptr,
1432                                               "%d", task_tgid_vnr(current));
1433                                 if (rc > out_end - out_ptr)
1434                                         goto out;
1435                                 out_ptr += rc;
1436                                 break;
1437                         /* uid */
1438                         case 'u':
1439                                 rc = snprintf(out_ptr, out_end - out_ptr,
1440                                               "%d", current->uid);
1441                                 if (rc > out_end - out_ptr)
1442                                         goto out;
1443                                 out_ptr += rc;
1444                                 break;
1445                         /* gid */
1446                         case 'g':
1447                                 rc = snprintf(out_ptr, out_end - out_ptr,
1448                                               "%d", current->gid);
1449                                 if (rc > out_end - out_ptr)
1450                                         goto out;
1451                                 out_ptr += rc;
1452                                 break;
1453                         /* signal that caused the coredump */
1454                         case 's':
1455                                 rc = snprintf(out_ptr, out_end - out_ptr,
1456                                               "%ld", signr);
1457                                 if (rc > out_end - out_ptr)
1458                                         goto out;
1459                                 out_ptr += rc;
1460                                 break;
1461                         /* UNIX time of coredump */
1462                         case 't': {
1463                                 struct timeval tv;
1464                                 do_gettimeofday(&tv);
1465                                 rc = snprintf(out_ptr, out_end - out_ptr,
1466                                               "%lu", tv.tv_sec);
1467                                 if (rc > out_end - out_ptr)
1468                                         goto out;
1469                                 out_ptr += rc;
1470                                 break;
1471                         }
1472                         /* hostname */
1473                         case 'h':
1474                                 down_read(&uts_sem);
1475                                 rc = snprintf(out_ptr, out_end - out_ptr,
1476                                               "%s", utsname()->nodename);
1477                                 up_read(&uts_sem);
1478                                 if (rc > out_end - out_ptr)
1479                                         goto out;
1480                                 out_ptr += rc;
1481                                 break;
1482                         /* executable */
1483                         case 'e':
1484                                 rc = snprintf(out_ptr, out_end - out_ptr,
1485                                               "%s", current->comm);
1486                                 if (rc > out_end - out_ptr)
1487                                         goto out;
1488                                 out_ptr += rc;
1489                                 break;
1490                         /* core limit size */
1491                         case 'c':
1492                                 rc = snprintf(out_ptr, out_end - out_ptr,
1493                                               "%lu", current->signal->rlim[RLIMIT_CORE].rlim_cur);
1494                                 if (rc > out_end - out_ptr)
1495                                         goto out;
1496                                 out_ptr += rc;
1497                                 break;
1498                         default:
1499                                 break;
1500                         }
1501                         ++pat_ptr;
1502                 }
1503         }
1504         /* Backward compatibility with core_uses_pid:
1505          *
1506          * If core_pattern does not include a %p (as is the default)
1507          * and core_uses_pid is set, then .%pid will be appended to
1508          * the filename. Do not do this for piped commands. */
1509         if (!ispipe && !pid_in_pattern
1510             && (core_uses_pid || nr_threads)) {
1511                 rc = snprintf(out_ptr, out_end - out_ptr,
1512                               ".%d", task_tgid_vnr(current));
1513                 if (rc > out_end - out_ptr)
1514                         goto out;
1515                 out_ptr += rc;
1516         }
1517 out:
1518         *out_ptr = 0;
1519         return ispipe;
1520 }
1521
1522 static int zap_process(struct task_struct *start)
1523 {
1524         struct task_struct *t;
1525         int nr = 0;
1526
1527         start->signal->flags = SIGNAL_GROUP_EXIT;
1528         start->signal->group_stop_count = 0;
1529
1530         t = start;
1531         do {
1532                 if (t != current && t->mm) {
1533                         sigaddset(&t->pending.signal, SIGKILL);
1534                         signal_wake_up(t, 1);
1535                         nr++;
1536                 }
1537         } while_each_thread(start, t);
1538
1539         return nr;
1540 }
1541
1542 static inline int zap_threads(struct task_struct *tsk, struct mm_struct *mm,
1543                                 struct core_state *core_state, int exit_code)
1544 {
1545         struct task_struct *g, *p;
1546         unsigned long flags;
1547         int nr = -EAGAIN;
1548
1549         spin_lock_irq(&tsk->sighand->siglock);
1550         if (!signal_group_exit(tsk->signal)) {
1551                 mm->core_state = core_state;
1552                 tsk->signal->group_exit_code = exit_code;
1553                 nr = zap_process(tsk);
1554         }
1555         spin_unlock_irq(&tsk->sighand->siglock);
1556         if (unlikely(nr < 0))
1557                 return nr;
1558
1559         if (atomic_read(&mm->mm_users) == nr + 1)
1560                 goto done;
1561         /*
1562          * We should find and kill all tasks which use this mm, and we should
1563          * count them correctly into ->nr_threads. We don't take tasklist
1564          * lock, but this is safe wrt:
1565          *
1566          * fork:
1567          *      None of sub-threads can fork after zap_process(leader). All
1568          *      processes which were created before this point should be
1569          *      visible to zap_threads() because copy_process() adds the new
1570          *      process to the tail of init_task.tasks list, and lock/unlock
1571          *      of ->siglock provides a memory barrier.
1572          *
1573          * do_exit:
1574          *      The caller holds mm->mmap_sem. This means that the task which
1575          *      uses this mm can't pass exit_mm(), so it can't exit or clear
1576          *      its ->mm.
1577          *
1578          * de_thread:
1579          *      It does list_replace_rcu(&leader->tasks, &current->tasks),
1580          *      we must see either old or new leader, this does not matter.
1581          *      However, it can change p->sighand, so lock_task_sighand(p)
1582          *      must be used. Since p->mm != NULL and we hold ->mmap_sem
1583          *      it can't fail.
1584          *
1585          *      Note also that "g" can be the old leader with ->mm == NULL
1586          *      and already unhashed and thus removed from ->thread_group.
1587          *      This is OK, __unhash_process()->list_del_rcu() does not
1588          *      clear the ->next pointer, we will find the new leader via
1589          *      next_thread().
1590          */
1591         rcu_read_lock();
1592         for_each_process(g) {
1593                 if (g == tsk->group_leader)
1594                         continue;
1595                 if (g->flags & PF_KTHREAD)
1596                         continue;
1597                 p = g;
1598                 do {
1599                         if (p->mm) {
1600                                 if (unlikely(p->mm == mm)) {
1601                                         lock_task_sighand(p, &flags);
1602                                         nr += zap_process(p);
1603                                         unlock_task_sighand(p, &flags);
1604                                 }
1605                                 break;
1606                         }
1607                 } while_each_thread(g, p);
1608         }
1609         rcu_read_unlock();
1610 done:
1611         atomic_set(&core_state->nr_threads, nr);
1612         return nr;
1613 }
1614
1615 static int coredump_wait(int exit_code, struct core_state *core_state)
1616 {
1617         struct task_struct *tsk = current;
1618         struct mm_struct *mm = tsk->mm;
1619         struct completion *vfork_done;
1620         int core_waiters;
1621
1622         init_completion(&core_state->startup);
1623         core_state->dumper.task = tsk;
1624         core_state->dumper.next = NULL;
1625         core_waiters = zap_threads(tsk, mm, core_state, exit_code);
1626         up_write(&mm->mmap_sem);
1627
1628         if (unlikely(core_waiters < 0))
1629                 goto fail;
1630
1631         /*
1632          * Make sure nobody is waiting for us to release the VM,
1633          * otherwise we can deadlock when we wait on each other
1634          */
1635         vfork_done = tsk->vfork_done;
1636         if (vfork_done) {
1637                 tsk->vfork_done = NULL;
1638                 complete(vfork_done);
1639         }
1640
1641         if (core_waiters)
1642                 wait_for_completion(&core_state->startup);
1643 fail:
1644         return core_waiters;
1645 }
1646
1647 static void coredump_finish(struct mm_struct *mm)
1648 {
1649         struct core_thread *curr, *next;
1650         struct task_struct *task;
1651
1652         next = mm->core_state->dumper.next;
1653         while ((curr = next) != NULL) {
1654                 next = curr->next;
1655                 task = curr->task;
1656                 /*
1657                  * see exit_mm(), curr->task must not see
1658                  * ->task == NULL before we read ->next.
1659                  */
1660                 smp_mb();
1661                 curr->task = NULL;
1662                 wake_up_process(task);
1663         }
1664
1665         mm->core_state = NULL;
1666 }
1667
1668 /*
1669  * set_dumpable converts traditional three-value dumpable to two flags and
1670  * stores them into mm->flags.  It modifies lower two bits of mm->flags, but
1671  * these bits are not changed atomically.  So get_dumpable can observe the
1672  * intermediate state.  To avoid doing unexpected behavior, get get_dumpable
1673  * return either old dumpable or new one by paying attention to the order of
1674  * modifying the bits.
1675  *
1676  * dumpable |   mm->flags (binary)
1677  * old  new | initial interim  final
1678  * ---------+-----------------------
1679  *  0    1  |   00      01      01
1680  *  0    2  |   00      10(*)   11
1681  *  1    0  |   01      00      00
1682  *  1    2  |   01      11      11
1683  *  2    0  |   11      10(*)   00
1684  *  2    1  |   11      11      01
1685  *
1686  * (*) get_dumpable regards interim value of 10 as 11.
1687  */
1688 void set_dumpable(struct mm_struct *mm, int value)
1689 {
1690         switch (value) {
1691         case 0:
1692                 clear_bit(MMF_DUMPABLE, &mm->flags);
1693                 smp_wmb();
1694                 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1695                 break;
1696         case 1:
1697                 set_bit(MMF_DUMPABLE, &mm->flags);
1698                 smp_wmb();
1699                 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1700                 break;
1701         case 2:
1702                 set_bit(MMF_DUMP_SECURELY, &mm->flags);
1703                 smp_wmb();
1704                 set_bit(MMF_DUMPABLE, &mm->flags);
1705                 break;
1706         }
1707 }
1708
1709 int get_dumpable(struct mm_struct *mm)
1710 {
1711         int ret;
1712
1713         ret = mm->flags & 0x3;
1714         return (ret >= 2) ? 2 : ret;
1715 }
1716
1717 int do_coredump(long signr, int exit_code, struct pt_regs * regs)
1718 {
1719         struct core_state core_state;
1720         char corename[CORENAME_MAX_SIZE + 1];
1721         struct mm_struct *mm = current->mm;
1722         struct linux_binfmt * binfmt;
1723         struct inode * inode;
1724         struct file * file;
1725         int retval = 0;
1726         int fsuid = current->fsuid;
1727         int flag = 0;
1728         int ispipe = 0;
1729         unsigned long core_limit = current->signal->rlim[RLIMIT_CORE].rlim_cur;
1730         char **helper_argv = NULL;
1731         int helper_argc = 0;
1732         char *delimit;
1733
1734         audit_core_dumps(signr);
1735
1736         binfmt = current->binfmt;
1737         if (!binfmt || !binfmt->core_dump)
1738                 goto fail;
1739         down_write(&mm->mmap_sem);
1740         /*
1741          * If another thread got here first, or we are not dumpable, bail out.
1742          */
1743         if (mm->core_state || !get_dumpable(mm)) {
1744                 up_write(&mm->mmap_sem);
1745                 goto fail;
1746         }
1747
1748         /*
1749          *      We cannot trust fsuid as being the "true" uid of the
1750          *      process nor do we know its entire history. We only know it
1751          *      was tainted so we dump it as root in mode 2.
1752          */
1753         if (get_dumpable(mm) == 2) {    /* Setuid core dump mode */
1754                 flag = O_EXCL;          /* Stop rewrite attacks */
1755                 current->fsuid = 0;     /* Dump root private */
1756         }
1757
1758         retval = coredump_wait(exit_code, &core_state);
1759         if (retval < 0)
1760                 goto fail;
1761
1762         /*
1763          * Clear any false indication of pending signals that might
1764          * be seen by the filesystem code called to write the core file.
1765          */
1766         clear_thread_flag(TIF_SIGPENDING);
1767
1768         /*
1769          * lock_kernel() because format_corename() is controlled by sysctl, which
1770          * uses lock_kernel()
1771          */
1772         lock_kernel();
1773         ispipe = format_corename(corename, retval, signr);
1774         unlock_kernel();
1775         /*
1776          * Don't bother to check the RLIMIT_CORE value if core_pattern points
1777          * to a pipe.  Since we're not writing directly to the filesystem
1778          * RLIMIT_CORE doesn't really apply, as no actual core file will be
1779          * created unless the pipe reader choses to write out the core file
1780          * at which point file size limits and permissions will be imposed
1781          * as it does with any other process
1782          */
1783         if ((!ispipe) && (core_limit < binfmt->min_coredump))
1784                 goto fail_unlock;
1785
1786         if (ispipe) {
1787                 helper_argv = argv_split(GFP_KERNEL, corename+1, &helper_argc);
1788                 /* Terminate the string before the first option */
1789                 delimit = strchr(corename, ' ');
1790                 if (delimit)
1791                         *delimit = '\0';
1792                 delimit = strrchr(helper_argv[0], '/');
1793                 if (delimit)
1794                         delimit++;
1795                 else
1796                         delimit = helper_argv[0];
1797                 if (!strcmp(delimit, current->comm)) {
1798                         printk(KERN_NOTICE "Recursive core dump detected, "
1799                                         "aborting\n");
1800                         goto fail_unlock;
1801                 }
1802
1803                 core_limit = RLIM_INFINITY;
1804
1805                 /* SIGPIPE can happen, but it's just never processed */
1806                 if (call_usermodehelper_pipe(corename+1, helper_argv, NULL,
1807                                 &file)) {
1808                         printk(KERN_INFO "Core dump to %s pipe failed\n",
1809                                corename);
1810                         goto fail_unlock;
1811                 }
1812         } else
1813                 file = filp_open(corename,
1814                                  O_CREAT | 2 | O_NOFOLLOW | O_LARGEFILE | flag,
1815                                  0600);
1816         if (IS_ERR(file))
1817                 goto fail_unlock;
1818         inode = file->f_path.dentry->d_inode;
1819         if (inode->i_nlink > 1)
1820                 goto close_fail;        /* multiple links - don't dump */
1821         if (!ispipe && d_unhashed(file->f_path.dentry))
1822                 goto close_fail;
1823
1824         /* AK: actually i see no reason to not allow this for named pipes etc.,
1825            but keep the previous behaviour for now. */
1826         if (!ispipe && !S_ISREG(inode->i_mode))
1827                 goto close_fail;
1828         /*
1829          * Dont allow local users get cute and trick others to coredump
1830          * into their pre-created files:
1831          */
1832         if (inode->i_uid != current->fsuid)
1833                 goto close_fail;
1834         if (!file->f_op)
1835                 goto close_fail;
1836         if (!file->f_op->write)
1837                 goto close_fail;
1838         if (!ispipe && do_truncate(file->f_path.dentry, 0, 0, file) != 0)
1839                 goto close_fail;
1840
1841         retval = binfmt->core_dump(signr, regs, file, core_limit);
1842
1843         if (retval)
1844                 current->signal->group_exit_code |= 0x80;
1845 close_fail:
1846         filp_close(file, NULL);
1847 fail_unlock:
1848         if (helper_argv)
1849                 argv_free(helper_argv);
1850
1851         current->fsuid = fsuid;
1852         coredump_finish(mm);
1853 fail:
1854         return retval;
1855 }