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/swap.h>
  32 #include <linux/string.h>
  33 #include <linux/init.h>
  34 #include <linux/pagemap.h>
  35 #include <linux/perf_event.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/mount.h>
  46 #include <linux/security.h>
  47 #include <linux/syscalls.h>
  48 #include <linux/tsacct_kern.h>
  49 #include <linux/cn_proc.h>
  50 #include <linux/audit.h>
  51 #include <linux/tracehook.h>
  52 #include <linux/kmod.h>
  53 #include <linux/fsnotify.h>
  54 #include <linux/fs_struct.h>
  55 #include <linux/pipe_fs_i.h>
  56 #include <linux/oom.h>
  57 #include <linux/compat.h>
  58
  59 #include <asm/uaccess.h>
  60 #include <asm/mmu_context.h>
  61 #include <asm/tlb.h>
  62
  63 #include <trace/events/task.h>
  64 #include "internal.h"
  65
  66 int core_uses_pid;
  67 char core_pattern[CORENAME_MAX_SIZE] = "core";
  68 unsigned int core_pipe_limit;
  69 int suid_dumpable = 0;
  70
  71 struct core_name {
  72         char *corename;
  73         int used, size;
  74 };
  75 static atomic_t call_count = ATOMIC_INIT(1);
  76
  77 /* The maximal length of core_pattern is also specified in sysctl.c */
  78
  79 static LIST_HEAD(formats);
  80 static DEFINE_RWLOCK(binfmt_lock);
  81
  82 void __register_binfmt(struct linux_binfmt * fmt, int insert)
  83 {
  84         BUG_ON(!fmt);
  85         write_lock(&binfmt_lock);
  86         insert ? list_add(&fmt->lh, &formats) :
  87                  list_add_tail(&fmt->lh, &formats);
  88         write_unlock(&binfmt_lock);
  89 }
  90
  91 EXPORT_SYMBOL(__register_binfmt);
  92
  93 void unregister_binfmt(struct linux_binfmt * fmt)
  94 {
  95         write_lock(&binfmt_lock);
  96         list_del(&fmt->lh);
  97         write_unlock(&binfmt_lock);
  98 }
  99
 100 EXPORT_SYMBOL(unregister_binfmt);
 101
 102 static inline void put_binfmt(struct linux_binfmt * fmt)
 103 {
 104         module_put(fmt->module);
 105 }
 106
 107 /*
 108  * Note that a shared library must be both readable and executable due to
 109  * security reasons.
 110  *
 111  * Also note that we take the address to load from from the file itself.
 112  */
 113 SYSCALL_DEFINE1(uselib, const char __user *, library)
 114 {
 115         struct file *file;
 116         char *tmp = getname(library);
 117         int error = PTR_ERR(tmp);
 118         static const struct open_flags uselib_flags = {
 119                 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
 120                 .acc_mode = MAY_READ | MAY_EXEC | MAY_OPEN,
 121                 .intent = LOOKUP_OPEN
 122         };
 123
 124         if (IS_ERR(tmp))
 125                 goto out;
 126
 127         file = do_filp_open(AT_FDCWD, tmp, &uselib_flags, LOOKUP_FOLLOW);
 128         putname(tmp);
 129         error = PTR_ERR(file);
 130         if (IS_ERR(file))
 131                 goto out;
 132
 133         error = -EINVAL;
 134         if (!S_ISREG(file->f_path.dentry->d_inode->i_mode))
 135                 goto exit;
 136
 137         error = -EACCES;
 138         if (file->f_path.mnt->mnt_flags & MNT_NOEXEC)
 139                 goto exit;
 140
 141         fsnotify_open(file);
 142
 143         error = -ENOEXEC;
 144         if(file->f_op) {
 145                 struct linux_binfmt * fmt;
 146
 147                 read_lock(&binfmt_lock);
 148                 list_for_each_entry(fmt, &formats, lh) {
 149                         if (!fmt->load_shlib)
 150                                 continue;
 151                         if (!try_module_get(fmt->module))
 152                                 continue;
 153                         read_unlock(&binfmt_lock);
 154                         error = fmt->load_shlib(file);
 155                         read_lock(&binfmt_lock);
 156                         put_binfmt(fmt);
 157                         if (error != -ENOEXEC)
 158                                 break;
 159                 }
 160                 read_unlock(&binfmt_lock);
 161         }
 162 exit:
 163         fput(file);
 164 out:
 165         return error;
 166 }
 167
 168 #ifdef CONFIG_MMU
 169 /*
 170  * The nascent bprm->mm is not visible until exec_mmap() but it can
 171  * use a lot of memory, account these pages in current->mm temporary
 172  * for oom_badness()->get_mm_rss(). Once exec succeeds or fails, we
 173  * change the counter back via acct_arg_size(0).
 174  */
 175 static void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
 176 {
 177         struct mm_struct *mm = current->mm;
 178         long diff = (long)(pages - bprm->vma_pages);
 179
 180         if (!mm || !diff)
 181                 return;
 182
 183         bprm->vma_pages = pages;
 184         add_mm_counter(mm, MM_ANONPAGES, diff);
 185 }
 186
 187 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
 188                 int write)
 189 {
 190         struct page *page;
 191         int ret;
 192
 193 #ifdef CONFIG_STACK_GROWSUP
 194         if (write) {
 195                 ret = expand_downwards(bprm->vma, pos);
 196                 if (ret < 0)
 197                         return NULL;
 198         }
 199 #endif
 200         ret = get_user_pages(current, bprm->mm, pos,
 201                         1, write, 1, &page, NULL);
 202         if (ret <= 0)
 203                 return NULL;
 204
 205         if (write) {
 206                 unsigned long size = bprm->vma->vm_end - bprm->vma->vm_start;
 207                 struct rlimit *rlim;
 208
 209                 acct_arg_size(bprm, size / PAGE_SIZE);
 210
 211                 /*
 212                  * We've historically supported up to 32 pages (ARG_MAX)
 213                  * of argument strings even with small stacks
 214                  */
 215                 if (size <= ARG_MAX)
 216                         return page;
 217
 218                 /*
 219                  * Limit to 1/4-th the stack size for the argv+env strings.
 220                  * This ensures that:
 221                  *  - the remaining binfmt code will not run out of stack space,
 222                  *  - the program will have a reasonable amount of stack left
 223                  *    to work from.
 224                  */
 225                 rlim = current->signal->rlim;
 226                 if (size > ACCESS_ONCE(rlim[RLIMIT_STACK].rlim_cur) / 4) {
 227                         put_page(page);
 228                         return NULL;
 229                 }
 230         }
 231
 232         return page;
 233 }
 234
 235 static void put_arg_page(struct page *page)
 236 {
 237         put_page(page);
 238 }
 239
 240 static void free_arg_page(struct linux_binprm *bprm, int i)
 241 {
 242 }
 243
 244 static void free_arg_pages(struct linux_binprm *bprm)
 245 {
 246 }
 247
 248 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
 249                 struct page *page)
 250 {
 251         flush_cache_page(bprm->vma, pos, page_to_pfn(page));
 252 }
 253
 254 static int __bprm_mm_init(struct linux_binprm *bprm)
 255 {
 256         int err;
 257         struct vm_area_struct *vma = NULL;
 258         struct mm_struct *mm = bprm->mm;
 259
 260         bprm->vma = vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
 261         if (!vma)
 262                 return -ENOMEM;
 263
 264         down_write(&mm->mmap_sem);
 265         vma->vm_mm = mm;
 266
 267         /*
 268          * Place the stack at the largest stack address the architecture
 269          * supports. Later, we'll move this to an appropriate place. We don't
 270          * use STACK_TOP because that can depend on attributes which aren't
 271          * configured yet.
 272          */
 273         BUILD_BUG_ON(VM_STACK_FLAGS & VM_STACK_INCOMPLETE_SETUP);
 274         vma->vm_end = STACK_TOP_MAX;
 275         vma->vm_start = vma->vm_end - PAGE_SIZE;
 276         vma->vm_flags = VM_STACK_FLAGS | VM_STACK_INCOMPLETE_SETUP;
 277         vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
 278         INIT_LIST_HEAD(&vma->anon_vma_chain);
 279
 280         err = security_file_mmap(NULL, 0, 0, 0, vma->vm_start, 1);
 281         if (err)
 282                 goto err;
 283
 284         err = insert_vm_struct(mm, vma);
 285         if (err)
 286                 goto err;
 287
 288         mm->stack_vm = mm->total_vm = 1;
 289         up_write(&mm->mmap_sem);
 290         bprm->p = vma->vm_end - sizeof(void *);
 291         return 0;
 292 err:
 293         up_write(&mm->mmap_sem);
 294         bprm->vma = NULL;
 295         kmem_cache_free(vm_area_cachep, vma);
 296         return err;
 297 }
 298
 299 static bool valid_arg_len(struct linux_binprm *bprm, long len)
 300 {
 301         return len <= MAX_ARG_STRLEN;
 302 }
 303
 304 #else
 305
 306 static inline void acct_arg_size(struct linux_binprm *bprm, unsigned long pages)
 307 {
 308 }
 309
 310 static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos,
 311                 int write)
 312 {
 313         struct page *page;
 314
 315         page = bprm->page[pos / PAGE_SIZE];
 316         if (!page && write) {
 317                 page = alloc_page(GFP_HIGHUSER|__GFP_ZERO);
 318                 if (!page)
 319                         return NULL;
 320                 bprm->page[pos / PAGE_SIZE] = page;
 321         }
 322
 323         return page;
 324 }
 325
 326 static void put_arg_page(struct page *page)
 327 {
 328 }
 329
 330 static void free_arg_page(struct linux_binprm *bprm, int i)
 331 {
 332         if (bprm->page[i]) {
 333                 __free_page(bprm->page[i]);
 334                 bprm->page[i] = NULL;
 335         }
 336 }
 337
 338 static void free_arg_pages(struct linux_binprm *bprm)
 339 {
 340         int i;
 341
 342         for (i = 0; i < MAX_ARG_PAGES; i++)
 343                 free_arg_page(bprm, i);
 344 }
 345
 346 static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos,
 347                 struct page *page)
 348 {
 349 }
 350
 351 static int __bprm_mm_init(struct linux_binprm *bprm)
 352 {
 353         bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *);
 354         return 0;
 355 }
 356
 357 static bool valid_arg_len(struct linux_binprm *bprm, long len)
 358 {
 359         return len <= bprm->p;
 360 }
 361
 362 #endif /* CONFIG_MMU */
 363
 364 /*
 365  * Create a new mm_struct and populate it with a temporary stack
 366  * vm_area_struct.  We don't have enough context at this point to set the stack
 367  * flags, permissions, and offset, so we use temporary values.  We'll update
 368  * them later in setup_arg_pages().
 369  */
 370 int bprm_mm_init(struct linux_binprm *bprm)
 371 {
 372         int err;
 373         struct mm_struct *mm = NULL;
 374
 375         bprm->mm = mm = mm_alloc();
 376         err = -ENOMEM;
 377         if (!mm)
 378                 goto err;
 379
 380         err = init_new_context(current, mm);
 381         if (err)
 382                 goto err;
 383
 384         err = __bprm_mm_init(bprm);
 385         if (err)
 386                 goto err;
 387
 388         return 0;
 389
 390 err:
 391         if (mm) {
 392                 bprm->mm = NULL;
 393                 mmdrop(mm);
 394         }
 395
 396         return err;
 397 }
 398
 399 struct user_arg_ptr {
 400 #ifdef CONFIG_COMPAT
 401         bool is_compat;
 402 #endif
 403         union {
 404                 const char __user *const __user *native;
 405 #ifdef CONFIG_COMPAT
 406                 compat_uptr_t __user *compat;
 407 #endif
 408         } ptr;
 409 };
 410
 411 static const char __user *get_user_arg_ptr(struct user_arg_ptr argv, int nr)
 412 {
 413         const char __user *native;
 414
 415 #ifdef CONFIG_COMPAT
 416         if (unlikely(argv.is_compat)) {
 417                 compat_uptr_t compat;
 418
 419                 if (get_user(compat, argv.ptr.compat + nr))
 420                         return ERR_PTR(-EFAULT);
 421
 422                 return compat_ptr(compat);
 423         }
 424 #endif
 425
 426         if (get_user(native, argv.ptr.native + nr))
 427                 return ERR_PTR(-EFAULT);
 428
 429         return native;
 430 }
 431
 432 /*
 433  * count() counts the number of strings in array ARGV.
 434  */
 435 static int count(struct user_arg_ptr argv, int max)
 436 {
 437         int i = 0;
 438
 439         if (argv.ptr.native != NULL) {
 440                 for (;;) {
 441                         const char __user *p = get_user_arg_ptr(argv, i);
 442
 443                         if (!p)
 444                                 break;
 445
 446                         if (IS_ERR(p))
 447                                 return -EFAULT;
 448
 449                         if (i++ >= max)
 450                                 return -E2BIG;
 451
 452                         if (fatal_signal_pending(current))
 453                                 return -ERESTARTNOHAND;
 454                         cond_resched();
 455                 }
 456         }
 457         return i;
 458 }
 459
 460 /*
 461  * 'copy_strings()' copies argument/environment strings from the old
 462  * processes's memory to the new process's stack.  The call to get_user_pages()
 463  * ensures the destination page is created and not swapped out.
 464  */
 465 static int copy_strings(int argc, struct user_arg_ptr argv,
 466                         struct linux_binprm *bprm)
 467 {
 468         struct page *kmapped_page = NULL;
 469         char *kaddr = NULL;
 470         unsigned long kpos = 0;
 471         int ret;
 472
 473         while (argc-- > 0) {
 474                 const char __user *str;
 475                 int len;
 476                 unsigned long pos;
 477
 478                 ret = -EFAULT;
 479                 str = get_user_arg_ptr(argv, argc);
 480                 if (IS_ERR(str))
 481                         goto out;
 482
 483                 len = strnlen_user(str, MAX_ARG_STRLEN);
 484                 if (!len)
 485                         goto out;
 486
 487                 ret = -E2BIG;
 488                 if (!valid_arg_len(bprm, len))
 489                         goto out;
 490
 491                 /* We're going to work our way backwords. */
 492                 pos = bprm->p;
 493                 str += len;
 494                 bprm->p -= len;
 495
 496                 while (len > 0) {
 497                         int offset, bytes_to_copy;
 498
 499                         if (fatal_signal_pending(current)) {
 500                                 ret = -ERESTARTNOHAND;
 501                                 goto out;
 502                         }
 503                         cond_resched();
 504
 505                         offset = pos % PAGE_SIZE;
 506                         if (offset == 0)
 507                                 offset = PAGE_SIZE;
 508
 509                         bytes_to_copy = offset;
 510                         if (bytes_to_copy > len)
 511                                 bytes_to_copy = len;
 512
 513                         offset -= bytes_to_copy;
 514                         pos -= bytes_to_copy;
 515                         str -= bytes_to_copy;
 516                         len -= bytes_to_copy;
 517
 518                         if (!kmapped_page || kpos != (pos & PAGE_MASK)) {
 519                                 struct page *page;
 520
 521                                 page = get_arg_page(bprm, pos, 1);
 522                                 if (!page) {
 523                                         ret = -E2BIG;
 524                                         goto out;
 525                                 }
 526
 527                                 if (kmapped_page) {
 528                                         flush_kernel_dcache_page(kmapped_page);
 529                                         kunmap(kmapped_page);
 530                                         put_arg_page(kmapped_page);
 531                                 }
 532                                 kmapped_page = page;
 533                                 kaddr = kmap(kmapped_page);
 534                                 kpos = pos & PAGE_MASK;
 535                                 flush_arg_page(bprm, kpos, kmapped_page);
 536                         }
 537                         if (copy_from_user(kaddr+offset, str, bytes_to_copy)) {
 538                                 ret = -EFAULT;
 539                                 goto out;
 540                         }
 541                 }
 542         }
 543         ret = 0;
 544 out:
 545         if (kmapped_page) {
 546                 flush_kernel_dcache_page(kmapped_page);
 547                 kunmap(kmapped_page);
 548                 put_arg_page(kmapped_page);
 549         }
 550         return ret;
 551 }
 552
 553 /*
 554  * Like copy_strings, but get argv and its values from kernel memory.
 555  */
 556 int copy_strings_kernel(int argc, const char *const *__argv,
 557                         struct linux_binprm *bprm)
 558 {
 559         int r;
 560         mm_segment_t oldfs = get_fs();
 561         struct user_arg_ptr argv = {
 562                 .ptr.native = (const char __user *const  __user *)__argv,
 563         };
 564
 565         set_fs(KERNEL_DS);
 566         r = copy_strings(argc, argv, bprm);
 567         set_fs(oldfs);
 568
 569         return r;
 570 }
 571 EXPORT_SYMBOL(copy_strings_kernel);
 572
 573 #ifdef CONFIG_MMU
 574
 575 /*
 576  * During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX.  Once
 577  * the binfmt code determines where the new stack should reside, we shift it to
 578  * its final location.  The process proceeds as follows:
 579  *
 580  * 1) Use shift to calculate the new vma endpoints.
 581  * 2) Extend vma to cover both the old and new ranges.  This ensures the
 582  *    arguments passed to subsequent functions are consistent.
 583  * 3) Move vma's page tables to the new range.
 584  * 4) Free up any cleared pgd range.
 585  * 5) Shrink the vma to cover only the new range.
 586  */
 587 static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift)
 588 {
 589         struct mm_struct *mm = vma->vm_mm;
 590         unsigned long old_start = vma->vm_start;
 591         unsigned long old_end = vma->vm_end;
 592         unsigned long length = old_end - old_start;
 593         unsigned long new_start = old_start - shift;
 594         unsigned long new_end = old_end - shift;
 595         struct mmu_gather tlb;
 596
 597         BUG_ON(new_start > new_end);
 598
 599         /*
 600          * ensure there are no vmas between where we want to go
 601          * and where we are
 602          */
 603         if (vma != find_vma(mm, new_start))
 604                 return -EFAULT;
 605
 606         /*
 607          * cover the whole range: [new_start, old_end)
 608          */
 609         if (vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL))
 610                 return -ENOMEM;
 611
 612         /*
 613          * move the page tables downwards, on failure we rely on
 614          * process cleanup to remove whatever mess we made.
 615          */
 616         if (length != move_page_tables(vma, old_start,
 617                                        vma, new_start, length))
 618                 return -ENOMEM;
 619
 620         lru_add_drain();
 621         tlb_gather_mmu(&tlb, mm, 0);
 622         if (new_end > old_start) {
 623                 /*
 624                  * when the old and new regions overlap clear from new_end.
 625                  */
 626                 free_pgd_range(&tlb, new_end, old_end, new_end,
 627                         vma->vm_next ? vma->vm_next->vm_start : 0);
 628         } else {
 629                 /*
 630                  * otherwise, clean from old_start; this is done to not touch
 631                  * the address space in [new_end, old_start) some architectures
 632                  * have constraints on va-space that make this illegal (IA64) -
 633                  * for the others its just a little faster.
 634                  */
 635                 free_pgd_range(&tlb, old_start, old_end, new_end,
 636                         vma->vm_next ? vma->vm_next->vm_start : 0);
 637         }
 638         tlb_finish_mmu(&tlb, new_end, old_end);
 639
 640         /*
 641          * Shrink the vma to just the new range.  Always succeeds.
 642          */
 643         vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL);
 644
 645         return 0;
 646 }
 647
 648 /*
 649  * Finalizes the stack vm_area_struct. The flags and permissions are updated,
 650  * the stack is optionally relocated, and some extra space is added.
 651  */
 652 int setup_arg_pages(struct linux_binprm *bprm,
 653                     unsigned long stack_top,
 654                     int executable_stack)
 655 {
 656         unsigned long ret;
 657         unsigned long stack_shift;
 658         struct mm_struct *mm = current->mm;
 659         struct vm_area_struct *vma = bprm->vma;
 660         struct vm_area_struct *prev = NULL;
 661         unsigned long vm_flags;
 662         unsigned long stack_base;
 663         unsigned long stack_size;
 664         unsigned long stack_expand;
 665         unsigned long rlim_stack;
 666
 667 #ifdef CONFIG_STACK_GROWSUP
 668         /* Limit stack size to 1GB */
 669         stack_base = rlimit_max(RLIMIT_STACK);
 670         if (stack_base > (1 << 30))
 671                 stack_base = 1 << 30;
 672
 673         /* Make sure we didn't let the argument array grow too large. */
 674         if (vma->vm_end - vma->vm_start > stack_base)
 675                 return -ENOMEM;
 676
 677         stack_base = PAGE_ALIGN(stack_top - stack_base);
 678
 679         stack_shift = vma->vm_start - stack_base;
 680         mm->arg_start = bprm->p - stack_shift;
 681         bprm->p = vma->vm_end - stack_shift;
 682 #else
 683         stack_top = arch_align_stack(stack_top);
 684         stack_top = PAGE_ALIGN(stack_top);
 685
 686         if (unlikely(stack_top < mmap_min_addr) ||
 687             unlikely(vma->vm_end - vma->vm_start >= stack_top - mmap_min_addr))
 688                 return -ENOMEM;
 689
 690         stack_shift = vma->vm_end - stack_top;
 691
 692         bprm->p -= stack_shift;
 693         mm->arg_start = bprm->p;
 694 #endif
 695
 696         if (bprm->loader)
 697                 bprm->loader -= stack_shift;
 698         bprm->exec -= stack_shift;
 699
 700         down_write(&mm->mmap_sem);
 701         vm_flags = VM_STACK_FLAGS;
 702
 703         /*
 704          * Adjust stack execute permissions; explicitly enable for
 705          * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone
 706          * (arch default) otherwise.
 707          */
 708         if (unlikely(executable_stack == EXSTACK_ENABLE_X))
 709                 vm_flags |= VM_EXEC;
 710         else if (executable_stack == EXSTACK_DISABLE_X)
 711                 vm_flags &= ~VM_EXEC;
 712         vm_flags |= mm->def_flags;
 713         vm_flags |= VM_STACK_INCOMPLETE_SETUP;
 714
 715         ret = mprotect_fixup(vma, &prev, vma->vm_start, vma->vm_end,
 716                         vm_flags);
 717         if (ret)
 718                 goto out_unlock;
 719         BUG_ON(prev != vma);
 720
 721         /* Move stack pages down in memory. */
 722         if (stack_shift) {
 723                 ret = shift_arg_pages(vma, stack_shift);
 724                 if (ret)
 725                         goto out_unlock;
 726         }
 727
 728         /* mprotect_fixup is overkill to remove the temporary stack flags */
 729         vma->vm_flags &= ~VM_STACK_INCOMPLETE_SETUP;
 730
 731         stack_expand = 131072UL; /* randomly 32*4k (or 2*64k) pages */
 732         stack_size = vma->vm_end - vma->vm_start;
 733         /*
 734          * Align this down to a page boundary as expand_stack
 735          * will align it up.
 736          */
 737         rlim_stack = rlimit(RLIMIT_STACK) & PAGE_MASK;
 738 #ifdef CONFIG_STACK_GROWSUP
 739         if (stack_size + stack_expand > rlim_stack)
 740                 stack_base = vma->vm_start + rlim_stack;
 741         else
 742                 stack_base = vma->vm_end + stack_expand;
 743 #else
 744         if (stack_size + stack_expand > rlim_stack)
 745                 stack_base = vma->vm_end - rlim_stack;
 746         else
 747                 stack_base = vma->vm_start - stack_expand;
 748 #endif
 749         current->mm->start_stack = bprm->p;
 750         ret = expand_stack(vma, stack_base);
 751         if (ret)
 752                 ret = -EFAULT;
 753
 754 out_unlock:
 755         up_write(&mm->mmap_sem);
 756         return ret;
 757 }
 758 EXPORT_SYMBOL(setup_arg_pages);
 759
 760 #endif /* CONFIG_MMU */
 761
 762 struct file *open_exec(const char *name)
 763 {
 764         struct file *file;
 765         int err;
 766         static const struct open_flags open_exec_flags = {
 767                 .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC,
 768                 .acc_mode = MAY_EXEC | MAY_OPEN,
 769                 .intent = LOOKUP_OPEN
 770         };
 771
 772         file = do_filp_open(AT_FDCWD, name, &open_exec_flags, LOOKUP_FOLLOW);
 773         if (IS_ERR(file))
 774                 goto out;
 775
 776         err = -EACCES;
 777         if (!S_ISREG(file->f_path.dentry->d_inode->i_mode))
 778                 goto exit;
 779
 780         if (file->f_path.mnt->mnt_flags & MNT_NOEXEC)
 781                 goto exit;
 782
 783         fsnotify_open(file);
 784
 785         err = deny_write_access(file);
 786         if (err)
 787                 goto exit;
 788
 789 out:
 790         return file;
 791
 792 exit:
 793         fput(file);
 794         return ERR_PTR(err);
 795 }
 796 EXPORT_SYMBOL(open_exec);
 797
 798 int kernel_read(struct file *file, loff_t offset,
 799                 char *addr, unsigned long count)
 800 {
 801         mm_segment_t old_fs;
 802         loff_t pos = offset;
 803         int result;
 804
 805         old_fs = get_fs();
 806         set_fs(get_ds());
 807         /* The cast to a user pointer is valid due to the set_fs() */
 808         result = vfs_read(file, (void __user *)addr, count, &pos);
 809         set_fs(old_fs);
 810         return result;
 811 }
 812
 813 EXPORT_SYMBOL(kernel_read);
 814
 815 static int exec_mmap(struct mm_struct *mm)
 816 {
 817         struct task_struct *tsk;
 818         struct mm_struct * old_mm, *active_mm;
 819
 820         /* Notify parent that we're no longer interested in the old VM */
 821         tsk = current;
 822         old_mm = current->mm;
 823         sync_mm_rss(tsk, old_mm);
 824         mm_release(tsk, old_mm);
 825
 826         if (old_mm) {
 827                 /*
 828                  * Make sure that if there is a core dump in progress
 829                  * for the old mm, we get out and die instead of going
 830                  * through with the exec.  We must hold mmap_sem around
 831                  * checking core_state and changing tsk->mm.
 832                  */
 833                 down_read(&old_mm->mmap_sem);
 834                 if (unlikely(old_mm->core_state)) {
 835                         up_read(&old_mm->mmap_sem);
 836                         return -EINTR;
 837                 }
 838         }
 839         task_lock(tsk);
 840         active_mm = tsk->active_mm;
 841         tsk->mm = mm;
 842         tsk->active_mm = mm;
 843         activate_mm(active_mm, mm);
 844         task_unlock(tsk);
 845         arch_pick_mmap_layout(mm);
 846         if (old_mm) {
 847                 up_read(&old_mm->mmap_sem);
 848                 BUG_ON(active_mm != old_mm);
 849                 mm_update_next_owner(old_mm);
 850                 mmput(old_mm);
 851                 return 0;
 852         }
 853         mmdrop(active_mm);
 854         return 0;
 855 }
 856
 857 /*
 858  * This function makes sure the current process has its own signal table,
 859  * so that flush_signal_handlers can later reset the handlers without
 860  * disturbing other processes.  (Other processes might share the signal
 861  * table via the CLONE_SIGHAND option to clone().)
 862  */
 863 static int de_thread(struct task_struct *tsk)
 864 {
 865         struct signal_struct *sig = tsk->signal;
 866         struct sighand_struct *oldsighand = tsk->sighand;
 867         spinlock_t *lock = &oldsighand->siglock;
 868
 869         if (thread_group_empty(tsk))
 870                 goto no_thread_group;
 871
 872         /*
 873          * Kill all other threads in the thread group.
 874          */
 875         spin_lock_irq(lock);
 876         if (signal_group_exit(sig)) {
 877                 /*
 878                  * Another group action in progress, just
 879                  * return so that the signal is processed.
 880                  */
 881                 spin_unlock_irq(lock);
 882                 return -EAGAIN;
 883         }
 884
 885         sig->group_exit_task = tsk;
 886         sig->notify_count = zap_other_threads(tsk);
 887         if (!thread_group_leader(tsk))
 888                 sig->notify_count--;
 889
 890         while (sig->notify_count) {
 891                 __set_current_state(TASK_UNINTERRUPTIBLE);
 892                 spin_unlock_irq(lock);
 893                 schedule();
 894                 spin_lock_irq(lock);
 895         }
 896         spin_unlock_irq(lock);
 897
 898         /*
 899          * At this point all other threads have exited, all we have to
 900          * do is to wait for the thread group leader to become inactive,
 901          * and to assume its PID:
 902          */
 903         if (!thread_group_leader(tsk)) {
 904                 struct task_struct *leader = tsk->group_leader;
 905
 906                 sig->notify_count = -1; /* for exit_notify() */
 907                 for (;;) {
 908                         write_lock_irq(&tasklist_lock);
 909                         if (likely(leader->exit_state))
 910                                 break;
 911                         __set_current_state(TASK_UNINTERRUPTIBLE);
 912                         write_unlock_irq(&tasklist_lock);
 913                         schedule();
 914                 }
 915
 916                 /*
 917                  * The only record we have of the real-time age of a
 918                  * process, regardless of execs it's done, is start_time.
 919                  * All the past CPU time is accumulated in signal_struct
 920                  * from sister threads now dead.  But in this non-leader
 921                  * exec, nothing survives from the original leader thread,
 922                  * whose birth marks the true age of this process now.
 923                  * When we take on its identity by switching to its PID, we
 924                  * also take its birthdate (always earlier than our own).
 925                  */
 926                 tsk->start_time = leader->start_time;
 927
 928                 BUG_ON(!same_thread_group(leader, tsk));
 929                 BUG_ON(has_group_leader_pid(tsk));
 930                 /*
 931                  * An exec() starts a new thread group with the
 932                  * TGID of the previous thread group. Rehash the
 933                  * two threads with a switched PID, and release
 934                  * the former thread group leader:
 935                  */
 936
 937                 /* Become a process group leader with the old leader's pid.
 938                  * The old leader becomes a thread of the this thread group.
 939                  * Note: The old leader also uses this pid until release_task
 940                  *       is called.  Odd but simple and correct.
 941                  */
 942                 detach_pid(tsk, PIDTYPE_PID);
 943                 tsk->pid = leader->pid;
 944                 attach_pid(tsk, PIDTYPE_PID,  task_pid(leader));
 945                 transfer_pid(leader, tsk, PIDTYPE_PGID);
 946                 transfer_pid(leader, tsk, PIDTYPE_SID);
 947
 948                 list_replace_rcu(&leader->tasks, &tsk->tasks);
 949                 list_replace_init(&leader->sibling, &tsk->sibling);
 950
 951                 tsk->group_leader = tsk;
 952                 leader->group_leader = tsk;
 953
 954                 tsk->exit_signal = SIGCHLD;
 955                 leader->exit_signal = -1;
 956
 957                 BUG_ON(leader->exit_state != EXIT_ZOMBIE);
 958                 leader->exit_state = EXIT_DEAD;
 959
 960                 /*
 961                  * We are going to release_task()->ptrace_unlink() silently,
 962                  * the tracer can sleep in do_wait(). EXIT_DEAD guarantees
 963                  * the tracer wont't block again waiting for this thread.
 964                  */
 965                 if (unlikely(leader->ptrace))
 966                         __wake_up_parent(leader, leader->parent);
 967                 write_unlock_irq(&tasklist_lock);
 968
 969                 release_task(leader);
 970         }
 971
 972         sig->group_exit_task = NULL;
 973         sig->notify_count = 0;
 974
 975 no_thread_group:
 976         if (current->mm)
 977                 setmax_mm_hiwater_rss(&sig->maxrss, current->mm);
 978
 979         exit_itimers(sig);
 980         flush_itimer_signals();
 981
 982         if (atomic_read(&oldsighand->count) != 1) {
 983                 struct sighand_struct *newsighand;
 984                 /*
 985                  * This ->sighand is shared with the CLONE_SIGHAND
 986                  * but not CLONE_THREAD task, switch to the new one.
 987                  */
 988                 newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL);
 989                 if (!newsighand)
 990                         return -ENOMEM;
 991
 992                 atomic_set(&newsighand->count, 1);
 993                 memcpy(newsighand->action, oldsighand->action,
 994                        sizeof(newsighand->action));
 995
 996                 write_lock_irq(&tasklist_lock);
 997                 spin_lock(&oldsighand->siglock);
 998                 rcu_assign_pointer(tsk->sighand, newsighand);
 999                 spin_unlock(&oldsighand->siglock);
1000                 write_unlock_irq(&tasklist_lock);
1001
1002                 __cleanup_sighand(oldsighand);
1003         }
1004
1005         BUG_ON(!thread_group_leader(tsk));
1006         return 0;
1007 }
1008
1009 /*
1010  * These functions flushes out all traces of the currently running executable
1011  * so that a new one can be started
1012  */
1013 static void flush_old_files(struct files_struct * files)
1014 {
1015         long j = -1;
1016         struct fdtable *fdt;
1017
1018         spin_lock(&files->file_lock);
1019         for (;;) {
1020                 unsigned long set, i;
1021
1022                 j++;
1023                 i = j * __NFDBITS;
1024                 fdt = files_fdtable(files);
1025                 if (i >= fdt->max_fds)
1026                         break;
1027                 set = fdt->close_on_exec->fds_bits[j];
1028                 if (!set)
1029                         continue;
1030                 fdt->close_on_exec->fds_bits[j] = 0;
1031                 spin_unlock(&files->file_lock);
1032                 for ( ; set ; i++,set >>= 1) {
1033                         if (set & 1) {
1034                                 sys_close(i);
1035                         }
1036                 }
1037                 spin_lock(&files->file_lock);
1038
1039         }
1040         spin_unlock(&files->file_lock);
1041 }
1042
1043 char *get_task_comm(char *buf, struct task_struct *tsk)
1044 {
1045         /* buf must be at least sizeof(tsk->comm) in size */
1046         task_lock(tsk);
1047         strncpy(buf, tsk->comm, sizeof(tsk->comm));
1048         task_unlock(tsk);
1049         return buf;
1050 }
1051 EXPORT_SYMBOL_GPL(get_task_comm);
1052
1053 void set_task_comm(struct task_struct *tsk, char *buf)
1054 {
1055         task_lock(tsk);
1056
1057         trace_task_rename(tsk, buf);
1058
1059         /*
1060          * Threads may access current->comm without holding
1061          * the task lock, so write the string carefully.
1062          * Readers without a lock may see incomplete new
1063          * names but are safe from non-terminating string reads.
1064          */
1065         memset(tsk->comm, 0, TASK_COMM_LEN);
1066         wmb();
1067         strlcpy(tsk->comm, buf, sizeof(tsk->comm));
1068         task_unlock(tsk);
1069         perf_event_comm(tsk);
1070 }
1071
1072 static void filename_to_taskname(char *tcomm, const char *fn, unsigned int len)
1073 {
1074         int i, ch;
1075
1076         /* Copies the binary name from after last slash */
1077         for (i = 0; (ch = *(fn++)) != '\0';) {
1078                 if (ch == '/')
1079                         i = 0; /* overwrite what we wrote */
1080                 else
1081                         if (i < len - 1)
1082                                 tcomm[i++] = ch;
1083         }
1084         tcomm[i] = '\0';
1085 }
1086
1087 int flush_old_exec(struct linux_binprm * bprm)
1088 {
1089         int retval;
1090
1091         /*
1092          * Make sure we have a private signal table and that
1093          * we are unassociated from the previous thread group.
1094          */
1095         retval = de_thread(current);
1096         if (retval)
1097                 goto out;
1098
1099         set_mm_exe_file(bprm->mm, bprm->file);
1100
1101         filename_to_taskname(bprm->tcomm, bprm->filename, sizeof(bprm->tcomm));
1102         /*
1103          * Release all of the old mmap stuff
1104          */
1105         acct_arg_size(bprm, 0);
1106         retval = exec_mmap(bprm->mm);
1107         if (retval)
1108                 goto out;
1109
1110         bprm->mm = NULL;                /* We're using it now */
1111
1112         set_fs(USER_DS);
1113         current->flags &= ~(PF_RANDOMIZE | PF_KTHREAD);
1114         flush_thread();
1115         current->personality &= ~bprm->per_clear;
1116
1117         return 0;
1118
1119 out:
1120         return retval;
1121 }
1122 EXPORT_SYMBOL(flush_old_exec);
1123
1124 void would_dump(struct linux_binprm *bprm, struct file *file)
1125 {
1126         if (inode_permission(file->f_path.dentry->d_inode, MAY_READ) < 0)
1127                 bprm->interp_flags |= BINPRM_FLAGS_ENFORCE_NONDUMP;
1128 }
1129 EXPORT_SYMBOL(would_dump);
1130
1131 void setup_new_exec(struct linux_binprm * bprm)
1132 {
1133         arch_pick_mmap_layout(current->mm);
1134
1135         /* This is the point of no return */
1136         current->sas_ss_sp = current->sas_ss_size = 0;
1137
1138         if (current_euid() == current_uid() && current_egid() == current_gid())
1139                 set_dumpable(current->mm, 1);
1140         else
1141                 set_dumpable(current->mm, suid_dumpable);
1142
1143         set_task_comm(current, bprm->tcomm);
1144
1145         /* Set the new mm task size. We have to do that late because it may
1146          * depend on TIF_32BIT which is only updated in flush_thread() on
1147          * some architectures like powerpc
1148          */
1149         current->mm->task_size = TASK_SIZE;
1150
1151         /* install the new credentials */
1152         if (bprm->cred->uid != current_euid() ||
1153             bprm->cred->gid != current_egid()) {
1154                 current->pdeath_signal = 0;
1155         } else {
1156                 would_dump(bprm, bprm->file);
1157                 if (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP)
1158                         set_dumpable(current->mm, suid_dumpable);
1159         }
1160
1161         /*
1162          * Flush performance counters when crossing a
1163          * security domain:
1164          */
1165         if (!get_dumpable(current->mm))
1166                 perf_event_exit_task(current);
1167
1168         /* An exec changes our domain. We are no longer part of the thread
1169            group */
1170
1171         current->self_exec_id++;
1172
1173         flush_signal_handlers(current, 0);
1174         flush_old_files(current->files);
1175 }
1176 EXPORT_SYMBOL(setup_new_exec);
1177
1178 /*
1179  * Prepare credentials and lock ->cred_guard_mutex.
1180  * install_exec_creds() commits the new creds and drops the lock.
1181  * Or, if exec fails before, free_bprm() should release ->cred and
1182  * and unlock.
1183  */
1184 int prepare_bprm_creds(struct linux_binprm *bprm)
1185 {
1186         if (mutex_lock_interruptible(&current->signal->cred_guard_mutex))
1187                 return -ERESTARTNOINTR;
1188
1189         bprm->cred = prepare_exec_creds();
1190         if (likely(bprm->cred))
1191                 return 0;
1192
1193         mutex_unlock(&current->signal->cred_guard_mutex);
1194         return -ENOMEM;
1195 }
1196
1197 void free_bprm(struct linux_binprm *bprm)
1198 {
1199         free_arg_pages(bprm);
1200         if (bprm->cred) {
1201                 mutex_unlock(&current->signal->cred_guard_mutex);
1202                 abort_creds(bprm->cred);
1203         }
1204         kfree(bprm);
1205 }
1206
1207 /*
1208  * install the new credentials for this executable
1209  */
1210 void install_exec_creds(struct linux_binprm *bprm)
1211 {
1212         security_bprm_committing_creds(bprm);
1213
1214         commit_creds(bprm->cred);
1215         bprm->cred = NULL;
1216         /*
1217          * cred_guard_mutex must be held at least to this point to prevent
1218          * ptrace_attach() from altering our determination of the task's
1219          * credentials; any time after this it may be unlocked.
1220          */
1221         security_bprm_committed_creds(bprm);
1222         mutex_unlock(&current->signal->cred_guard_mutex);
1223 }
1224 EXPORT_SYMBOL(install_exec_creds);
1225
1226 /*
1227  * determine how safe it is to execute the proposed program
1228  * - the caller must hold ->cred_guard_mutex to protect against
1229  *   PTRACE_ATTACH
1230  */
1231 static int check_unsafe_exec(struct linux_binprm *bprm)
1232 {
1233         struct task_struct *p = current, *t;
1234         unsigned n_fs;
1235         int res = 0;
1236
1237         if (p->ptrace) {
1238                 if (p->ptrace & PT_PTRACE_CAP)
1239                         bprm->unsafe |= LSM_UNSAFE_PTRACE_CAP;
1240                 else
1241                         bprm->unsafe |= LSM_UNSAFE_PTRACE;
1242         }
1243
1244         n_fs = 1;
1245         spin_lock(&p->fs->lock);
1246         rcu_read_lock();
1247         for (t = next_thread(p); t != p; t = next_thread(t)) {
1248                 if (t->fs == p->fs)
1249                         n_fs++;
1250         }
1251         rcu_read_unlock();
1252
1253         if (p->fs->users > n_fs) {
1254                 bprm->unsafe |= LSM_UNSAFE_SHARE;
1255         } else {
1256                 res = -EAGAIN;
1257                 if (!p->fs->in_exec) {
1258                         p->fs->in_exec = 1;
1259                         res = 1;
1260                 }
1261         }
1262         spin_unlock(&p->fs->lock);
1263
1264         return res;
1265 }
1266
1267 /*
1268  * Fill the binprm structure from the inode.
1269  * Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes
1270  *
1271  * This may be called multiple times for binary chains (scripts for example).
1272  */
1273 int prepare_binprm(struct linux_binprm *bprm)
1274 {
1275         umode_t mode;
1276         struct inode * inode = bprm->file->f_path.dentry->d_inode;
1277         int retval;
1278
1279         mode = inode->i_mode;
1280         if (bprm->file->f_op == NULL)
1281                 return -EACCES;
1282
1283         /* clear any previous set[ug]id data from a previous binary */
1284         bprm->cred->euid = current_euid();
1285         bprm->cred->egid = current_egid();
1286
1287         if (!(bprm->file->f_path.mnt->mnt_flags & MNT_NOSUID)) {
1288                 /* Set-uid? */
1289                 if (mode & S_ISUID) {
1290                         bprm->per_clear |= PER_CLEAR_ON_SETID;
1291                         bprm->cred->euid = inode->i_uid;
1292                 }
1293
1294                 /* Set-gid? */
1295                 /*
1296                  * If setgid is set but no group execute bit then this
1297                  * is a candidate for mandatory locking, not a setgid
1298                  * executable.
1299                  */
1300                 if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {
1301                         bprm->per_clear |= PER_CLEAR_ON_SETID;
1302                         bprm->cred->egid = inode->i_gid;
1303                 }
1304         }
1305
1306         /* fill in binprm security blob */
1307         retval = security_bprm_set_creds(bprm);
1308         if (retval)
1309                 return retval;
1310         bprm->cred_prepared = 1;
1311
1312         memset(bprm->buf, 0, BINPRM_BUF_SIZE);
1313         return kernel_read(bprm->file, 0, bprm->buf, BINPRM_BUF_SIZE);
1314 }
1315
1316 EXPORT_SYMBOL(prepare_binprm);
1317
1318 /*
1319  * Arguments are '\0' separated strings found at the location bprm->p
1320  * points to; chop off the first by relocating brpm->p to right after
1321  * the first '\0' encountered.
1322  */
1323 int remove_arg_zero(struct linux_binprm *bprm)
1324 {
1325         int ret = 0;
1326         unsigned long offset;
1327         char *kaddr;
1328         struct page *page;
1329
1330         if (!bprm->argc)
1331                 return 0;
1332
1333         do {
1334                 offset = bprm->p & ~PAGE_MASK;
1335                 page = get_arg_page(bprm, bprm->p, 0);
1336                 if (!page) {
1337                         ret = -EFAULT;
1338                         goto out;
1339                 }
1340                 kaddr = kmap_atomic(page, KM_USER0);
1341
1342                 for (; offset < PAGE_SIZE && kaddr[offset];
1343                                 offset++, bprm->p++)
1344                         ;
1345
1346                 kunmap_atomic(kaddr, KM_USER0);
1347                 put_arg_page(page);
1348
1349                 if (offset == PAGE_SIZE)
1350                         free_arg_page(bprm, (bprm->p >> PAGE_SHIFT) - 1);
1351         } while (offset == PAGE_SIZE);
1352
1353         bprm->p++;
1354         bprm->argc--;
1355         ret = 0;
1356
1357 out:
1358         return ret;
1359 }
1360 EXPORT_SYMBOL(remove_arg_zero);
1361
1362 /*
1363  * cycle the list of binary formats handler, until one recognizes the image
1364  */
1365 int search_binary_handler(struct linux_binprm *bprm,struct pt_regs *regs)
1366 {
1367         unsigned int depth = bprm->recursion_depth;
1368         int try,retval;
1369         struct linux_binfmt *fmt;
1370         pid_t old_pid;
1371
1372         retval = security_bprm_check(bprm);
1373         if (retval)
1374                 return retval;
1375
1376         retval = audit_bprm(bprm);
1377         if (retval)
1378                 return retval;
1379
1380         /* Need to fetch pid before load_binary changes it */
1381         rcu_read_lock();
1382         old_pid = task_pid_nr_ns(current, task_active_pid_ns(current->parent));
1383         rcu_read_unlock();
1384
1385         retval = -ENOENT;
1386         for (try=0; try<2; try++) {
1387                 read_lock(&binfmt_lock);
1388                 list_for_each_entry(fmt, &formats, lh) {
1389                         int (*fn)(struct linux_binprm *, struct pt_regs *) = fmt->load_binary;
1390                         if (!fn)
1391                                 continue;
1392                         if (!try_module_get(fmt->module))
1393                                 continue;
1394                         read_unlock(&binfmt_lock);
1395                         retval = fn(bprm, regs);
1396                         /*
1397                          * Restore the depth counter to its starting value
1398                          * in this call, so we don't have to rely on every
1399                          * load_binary function to restore it on return.
1400                          */
1401                         bprm->recursion_depth = depth;
1402                         if (retval >= 0) {
1403                                 if (depth == 0)
1404                                         ptrace_event(PTRACE_EVENT_EXEC,
1405                                                         old_pid);
1406                                 put_binfmt(fmt);
1407                                 allow_write_access(bprm->file);
1408                                 if (bprm->file)
1409                                         fput(bprm->file);
1410                                 bprm->file = NULL;
1411                                 current->did_exec = 1;
1412                                 proc_exec_connector(current);
1413                                 return retval;
1414                         }
1415                         read_lock(&binfmt_lock);
1416                         put_binfmt(fmt);
1417                         if (retval != -ENOEXEC || bprm->mm == NULL)
1418                                 break;
1419                         if (!bprm->file) {
1420                                 read_unlock(&binfmt_lock);
1421                                 return retval;
1422                         }
1423                 }
1424                 read_unlock(&binfmt_lock);
1425 #ifdef CONFIG_MODULES
1426                 if (retval != -ENOEXEC || bprm->mm == NULL) {
1427                         break;
1428                 } else {
1429 #define printable(c) (((c)=='\t') || ((c)=='\n') || (0x20<=(c) && (c)<=0x7e))
1430                         if (printable(bprm->buf[0]) &&
1431                             printable(bprm->buf[1]) &&
1432                             printable(bprm->buf[2]) &&
1433                             printable(bprm->buf[3]))
1434                                 break; /* -ENOEXEC */
1435                         if (try)
1436                                 break; /* -ENOEXEC */
1437                         request_module("binfmt-%04x", *(unsigned short *)(&bprm->buf[2]));
1438                 }
1439 #else
1440                 break;
1441 #endif
1442         }
1443         return retval;
1444 }
1445
1446 EXPORT_SYMBOL(search_binary_handler);
1447
1448 /*
1449  * sys_execve() executes a new program.
1450  */
1451 static int do_execve_common(const char *filename,
1452                                 struct user_arg_ptr argv,
1453                                 struct user_arg_ptr envp,
1454                                 struct pt_regs *regs)
1455 {
1456         struct linux_binprm *bprm;
1457         struct file *file;
1458         struct files_struct *displaced;
1459         bool clear_in_exec;
1460         int retval;
1461         const struct cred *cred = current_cred();
1462
1463         /*
1464          * We move the actual failure in case of RLIMIT_NPROC excess from
1465          * set*uid() to execve() because too many poorly written programs
1466          * don't check setuid() return code.  Here we additionally recheck
1467          * whether NPROC limit is still exceeded.
1468          */
1469         if ((current->flags & PF_NPROC_EXCEEDED) &&
1470             atomic_read(&cred->user->processes) > rlimit(RLIMIT_NPROC)) {
1471                 retval = -EAGAIN;
1472                 goto out_ret;
1473         }
1474
1475         /* We're below the limit (still or again), so we don't want to make
1476          * further execve() calls fail. */
1477         current->flags &= ~PF_NPROC_EXCEEDED;
1478
1479         retval = unshare_files(&displaced);
1480         if (retval)
1481                 goto out_ret;
1482
1483         retval = -ENOMEM;
1484         bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
1485         if (!bprm)
1486                 goto out_files;
1487
1488         retval = prepare_bprm_creds(bprm);
1489         if (retval)
1490                 goto out_free;
1491
1492         retval = check_unsafe_exec(bprm);
1493         if (retval < 0)
1494                 goto out_free;
1495         clear_in_exec = retval;
1496         current->in_execve = 1;
1497
1498         file = open_exec(filename);
1499         retval = PTR_ERR(file);
1500         if (IS_ERR(file))
1501                 goto out_unmark;
1502
1503         sched_exec();
1504
1505         bprm->file = file;
1506         bprm->filename = filename;
1507         bprm->interp = filename;
1508
1509         retval = bprm_mm_init(bprm);
1510         if (retval)
1511                 goto out_file;
1512
1513         bprm->argc = count(argv, MAX_ARG_STRINGS);
1514         if ((retval = bprm->argc) < 0)
1515                 goto out;
1516
1517         bprm->envc = count(envp, MAX_ARG_STRINGS);
1518         if ((retval = bprm->envc) < 0)
1519                 goto out;
1520
1521         retval = prepare_binprm(bprm);
1522         if (retval < 0)
1523                 goto out;
1524
1525         retval = copy_strings_kernel(1, &bprm->filename, bprm);
1526         if (retval < 0)
1527                 goto out;
1528
1529         bprm->exec = bprm->p;
1530         retval = copy_strings(bprm->envc, envp, bprm);
1531         if (retval < 0)
1532                 goto out;
1533
1534         retval = copy_strings(bprm->argc, argv, bprm);
1535         if (retval < 0)
1536                 goto out;
1537
1538         retval = search_binary_handler(bprm,regs);
1539         if (retval < 0)
1540                 goto out;
1541
1542         /* execve succeeded */
1543         current->fs->in_exec = 0;
1544         current->in_execve = 0;
1545         acct_update_integrals(current);
1546         free_bprm(bprm);
1547         if (displaced)
1548                 put_files_struct(displaced);
1549         return retval;
1550
1551 out:
1552         if (bprm->mm) {
1553                 acct_arg_size(bprm, 0);
1554                 mmput(bprm->mm);
1555         }
1556
1557 out_file:
1558         if (bprm->file) {
1559                 allow_write_access(bprm->file);
1560                 fput(bprm->file);
1561         }
1562
1563 out_unmark:
1564         if (clear_in_exec)
1565                 current->fs->in_exec = 0;
1566         current->in_execve = 0;
1567
1568 out_free:
1569         free_bprm(bprm);
1570
1571 out_files:
1572         if (displaced)
1573                 reset_files_struct(displaced);
1574 out_ret:
1575         return retval;
1576 }
1577
1578 int do_execve(const char *filename,
1579         const char __user *const __user *__argv,
1580         const char __user *const __user *__envp,
1581         struct pt_regs *regs)
1582 {
1583         struct user_arg_ptr argv = { .ptr.native = __argv };
1584         struct user_arg_ptr envp = { .ptr.native = __envp };
1585         return do_execve_common(filename, argv, envp, regs);
1586 }
1587
1588 #ifdef CONFIG_COMPAT
1589 int compat_do_execve(char *filename,
1590         compat_uptr_t __user *__argv,
1591         compat_uptr_t __user *__envp,
1592         struct pt_regs *regs)
1593 {
1594         struct user_arg_ptr argv = {
1595                 .is_compat = true,
1596                 .ptr.compat = __argv,
1597         };
1598         struct user_arg_ptr envp = {
1599                 .is_compat = true,
1600                 .ptr.compat = __envp,
1601         };
1602         return do_execve_common(filename, argv, envp, regs);
1603 }
1604 #endif
1605
1606 void set_binfmt(struct linux_binfmt *new)
1607 {
1608         struct mm_struct *mm = current->mm;
1609
1610         if (mm->binfmt)
1611                 module_put(mm->binfmt->module);
1612
1613         mm->binfmt = new;
1614         if (new)
1615                 __module_get(new->module);
1616 }
1617
1618 EXPORT_SYMBOL(set_binfmt);
1619
1620 static int expand_corename(struct core_name *cn)
1621 {
1622         char *old_corename = cn->corename;
1623
1624         cn->size = CORENAME_MAX_SIZE * atomic_inc_return(&call_count);
1625         cn->corename = krealloc(old_corename, cn->size, GFP_KERNEL);
1626
1627         if (!cn->corename) {
1628                 kfree(old_corename);
1629                 return -ENOMEM;
1630         }
1631
1632         return 0;
1633 }
1634
1635 static int cn_printf(struct core_name *cn, const char *fmt, ...)
1636 {
1637         char *cur;
1638         int need;
1639         int ret;
1640         va_list arg;
1641
1642         va_start(arg, fmt);
1643         need = vsnprintf(NULL, 0, fmt, arg);
1644         va_end(arg);
1645
1646         if (likely(need < cn->size - cn->used - 1))
1647                 goto out_printf;
1648
1649         ret = expand_corename(cn);
1650         if (ret)
1651                 goto expand_fail;
1652
1653 out_printf:
1654         cur = cn->corename + cn->used;
1655         va_start(arg, fmt);
1656         vsnprintf(cur, need + 1, fmt, arg);
1657         va_end(arg);
1658         cn->used += need;
1659         return 0;
1660
1661 expand_fail:
1662         return ret;
1663 }
1664
1665 static void cn_escape(char *str)
1666 {
1667         for (; *str; str++)
1668                 if (*str == '/')
1669                         *str = '!';
1670 }
1671
1672 static int cn_print_exe_file(struct core_name *cn)
1673 {
1674         struct file *exe_file;
1675         char *pathbuf, *path;
1676         int ret;
1677
1678         exe_file = get_mm_exe_file(current->mm);
1679         if (!exe_file) {
1680                 char *commstart = cn->corename + cn->used;
1681                 ret = cn_printf(cn, "%s (path unknown)", current->comm);
1682                 cn_escape(commstart);
1683                 return ret;
1684         }
1685
1686         pathbuf = kmalloc(PATH_MAX, GFP_TEMPORARY);
1687         if (!pathbuf) {
1688                 ret = -ENOMEM;
1689                 goto put_exe_file;
1690         }
1691
1692         path = d_path(&exe_file->f_path, pathbuf, PATH_MAX);
1693         if (IS_ERR(path)) {
1694                 ret = PTR_ERR(path);
1695                 goto free_buf;
1696         }
1697
1698         cn_escape(path);
1699
1700         ret = cn_printf(cn, "%s", path);
1701
1702 free_buf:
1703         kfree(pathbuf);
1704 put_exe_file:
1705         fput(exe_file);
1706         return ret;
1707 }
1708
1709 /* format_corename will inspect the pattern parameter, and output a
1710  * name into corename, which must have space for at least
1711  * CORENAME_MAX_SIZE bytes plus one byte for the zero terminator.
1712  */
1713 static int format_corename(struct core_name *cn, long signr)
1714 {
1715         const struct cred *cred = current_cred();
1716         const char *pat_ptr = core_pattern;
1717         int ispipe = (*pat_ptr == '|');
1718         int pid_in_pattern = 0;
1719         int err = 0;
1720
1721         cn->size = CORENAME_MAX_SIZE * atomic_read(&call_count);
1722         cn->corename = kmalloc(cn->size, GFP_KERNEL);
1723         cn->used = 0;
1724
1725         if (!cn->corename)
1726                 return -ENOMEM;
1727
1728         /* Repeat as long as we have more pattern to process and more output
1729            space */
1730         while (*pat_ptr) {
1731                 if (*pat_ptr != '%') {
1732                         if (*pat_ptr == 0)
1733                                 goto out;
1734                         err = cn_printf(cn, "%c", *pat_ptr++);
1735                 } else {
1736                         switch (*++pat_ptr) {
1737                         /* single % at the end, drop that */
1738                         case 0:
1739                                 goto out;
1740                         /* Double percent, output one percent */
1741                         case '%':
1742                                 err = cn_printf(cn, "%c", '%');
1743                                 break;
1744                         /* pid */
1745                         case 'p':
1746                                 pid_in_pattern = 1;
1747                                 err = cn_printf(cn, "%d",
1748                                               task_tgid_vnr(current));
1749                                 break;
1750                         /* uid */
1751                         case 'u':
1752                                 err = cn_printf(cn, "%d", cred->uid);
1753                                 break;
1754                         /* gid */
1755                         case 'g':
1756                                 err = cn_printf(cn, "%d", cred->gid);
1757                                 break;
1758                         /* signal that caused the coredump */
1759                         case 's':
1760                                 err = cn_printf(cn, "%ld", signr);
1761                                 break;
1762                         /* UNIX time of coredump */
1763                         case 't': {
1764                                 struct timeval tv;
1765                                 do_gettimeofday(&tv);
1766                                 err = cn_printf(cn, "%lu", tv.tv_sec);
1767                                 break;
1768                         }
1769                         /* hostname */
1770                         case 'h': {
1771                                 char *namestart = cn->corename + cn->used;
1772                                 down_read(&uts_sem);
1773                                 err = cn_printf(cn, "%s",
1774                                               utsname()->nodename);
1775                                 up_read(&uts_sem);
1776                                 cn_escape(namestart);
1777                                 break;
1778                         }
1779                         /* executable */
1780                         case 'e': {
1781                                 char *commstart = cn->corename + cn->used;
1782                                 err = cn_printf(cn, "%s", current->comm);
1783                                 cn_escape(commstart);
1784                                 break;
1785                         }
1786                         case 'E':
1787                                 err = cn_print_exe_file(cn);
1788                                 break;
1789                         /* core limit size */
1790                         case 'c':
1791                                 err = cn_printf(cn, "%lu",
1792                                               rlimit(RLIMIT_CORE));
1793                                 break;
1794                         default:
1795                                 break;
1796                         }
1797                         ++pat_ptr;
1798                 }
1799
1800                 if (err)
1801                         return err;
1802         }
1803
1804         /* Backward compatibility with core_uses_pid:
1805          *
1806          * If core_pattern does not include a %p (as is the default)
1807          * and core_uses_pid is set, then .%pid will be appended to
1808          * the filename. Do not do this for piped commands. */
1809         if (!ispipe && !pid_in_pattern && core_uses_pid) {
1810                 err = cn_printf(cn, ".%d", task_tgid_vnr(current));
1811                 if (err)
1812                         return err;
1813         }
1814 out:
1815         return ispipe;
1816 }
1817
1818 static int zap_process(struct task_struct *start, int exit_code)
1819 {
1820         struct task_struct *t;
1821         int nr = 0;
1822
1823         start->signal->flags = SIGNAL_GROUP_EXIT;
1824         start->signal->group_exit_code = exit_code;
1825         start->signal->group_stop_count = 0;
1826
1827         t = start;
1828         do {
1829                 task_clear_jobctl_pending(t, JOBCTL_PENDING_MASK);
1830                 if (t != current && t->mm) {
1831                         sigaddset(&t->pending.signal, SIGKILL);
1832                         signal_wake_up(t, 1);
1833                         nr++;
1834                 }
1835         } while_each_thread(start, t);
1836
1837         return nr;
1838 }
1839
1840 static inline int zap_threads(struct task_struct *tsk, struct mm_struct *mm,
1841                                 struct core_state *core_state, int exit_code)
1842 {
1843         struct task_struct *g, *p;
1844         unsigned long flags;
1845         int nr = -EAGAIN;
1846
1847         spin_lock_irq(&tsk->sighand->siglock);
1848         if (!signal_group_exit(tsk->signal)) {
1849                 mm->core_state = core_state;
1850                 nr = zap_process(tsk, exit_code);
1851         }
1852         spin_unlock_irq(&tsk->sighand->siglock);
1853         if (unlikely(nr < 0))
1854                 return nr;
1855
1856         if (atomic_read(&mm->mm_users) == nr + 1)
1857                 goto done;
1858         /*
1859          * We should find and kill all tasks which use this mm, and we should
1860          * count them correctly into ->nr_threads. We don't take tasklist
1861          * lock, but this is safe wrt:
1862          *
1863          * fork:
1864          *      None of sub-threads can fork after zap_process(leader). All
1865          *      processes which were created before this point should be
1866          *      visible to zap_threads() because copy_process() adds the new
1867          *      process to the tail of init_task.tasks list, and lock/unlock
1868          *      of ->siglock provides a memory barrier.
1869          *
1870          * do_exit:
1871          *      The caller holds mm->mmap_sem. This means that the task which
1872          *      uses this mm can't pass exit_mm(), so it can't exit or clear
1873          *      its ->mm.
1874          *
1875          * de_thread:
1876          *      It does list_replace_rcu(&leader->tasks, &current->tasks),
1877          *      we must see either old or new leader, this does not matter.
1878          *      However, it can change p->sighand, so lock_task_sighand(p)
1879          *      must be used. Since p->mm != NULL and we hold ->mmap_sem
1880          *      it can't fail.
1881          *
1882          *      Note also that "g" can be the old leader with ->mm == NULL
1883          *      and already unhashed and thus removed from ->thread_group.
1884          *      This is OK, __unhash_process()->list_del_rcu() does not
1885          *      clear the ->next pointer, we will find the new leader via
1886          *      next_thread().
1887          */
1888         rcu_read_lock();
1889         for_each_process(g) {
1890                 if (g == tsk->group_leader)
1891                         continue;
1892                 if (g->flags & PF_KTHREAD)
1893                         continue;
1894                 p = g;
1895                 do {
1896                         if (p->mm) {
1897                                 if (unlikely(p->mm == mm)) {
1898                                         lock_task_sighand(p, &flags);
1899                                         nr += zap_process(p, exit_code);
1900                                         unlock_task_sighand(p, &flags);
1901                                 }
1902                                 break;
1903                         }
1904                 } while_each_thread(g, p);
1905         }
1906         rcu_read_unlock();
1907 done:
1908         atomic_set(&core_state->nr_threads, nr);
1909         return nr;
1910 }
1911
1912 static int coredump_wait(int exit_code, struct core_state *core_state)
1913 {
1914         struct task_struct *tsk = current;
1915         struct mm_struct *mm = tsk->mm;
1916         int core_waiters = -EBUSY;
1917
1918         init_completion(&core_state->startup);
1919         core_state->dumper.task = tsk;
1920         core_state->dumper.next = NULL;
1921
1922         down_write(&mm->mmap_sem);
1923         if (!mm->core_state)
1924                 core_waiters = zap_threads(tsk, mm, core_state, exit_code);
1925         up_write(&mm->mmap_sem);
1926
1927         if (core_waiters > 0)
1928                 wait_for_completion(&core_state->startup);
1929
1930         return core_waiters;
1931 }
1932
1933 static void coredump_finish(struct mm_struct *mm)
1934 {
1935         struct core_thread *curr, *next;
1936         struct task_struct *task;
1937
1938         next = mm->core_state->dumper.next;
1939         while ((curr = next) != NULL) {
1940                 next = curr->next;
1941                 task = curr->task;
1942                 /*
1943                  * see exit_mm(), curr->task must not see
1944                  * ->task == NULL before we read ->next.
1945                  */
1946                 smp_mb();
1947                 curr->task = NULL;
1948                 wake_up_process(task);
1949         }
1950
1951         mm->core_state = NULL;
1952 }
1953
1954 /*
1955  * set_dumpable converts traditional three-value dumpable to two flags and
1956  * stores them into mm->flags.  It modifies lower two bits of mm->flags, but
1957  * these bits are not changed atomically.  So get_dumpable can observe the
1958  * intermediate state.  To avoid doing unexpected behavior, get get_dumpable
1959  * return either old dumpable or new one by paying attention to the order of
1960  * modifying the bits.
1961  *
1962  * dumpable |   mm->flags (binary)
1963  * old  new | initial interim  final
1964  * ---------+-----------------------
1965  *  0    1  |   00      01      01
1966  *  0    2  |   00      10(*)   11
1967  *  1    0  |   01      00      00
1968  *  1    2  |   01      11      11
1969  *  2    0  |   11      10(*)   00
1970  *  2    1  |   11      11      01
1971  *
1972  * (*) get_dumpable regards interim value of 10 as 11.
1973  */
1974 void set_dumpable(struct mm_struct *mm, int value)
1975 {
1976         switch (value) {
1977         case 0:
1978                 clear_bit(MMF_DUMPABLE, &mm->flags);
1979                 smp_wmb();
1980                 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1981                 break;
1982         case 1:
1983                 set_bit(MMF_DUMPABLE, &mm->flags);
1984                 smp_wmb();
1985                 clear_bit(MMF_DUMP_SECURELY, &mm->flags);
1986                 break;
1987         case 2:
1988                 set_bit(MMF_DUMP_SECURELY, &mm->flags);
1989                 smp_wmb();
1990                 set_bit(MMF_DUMPABLE, &mm->flags);
1991                 break;
1992         }
1993 }
1994
1995 static int __get_dumpable(unsigned long mm_flags)
1996 {
1997         int ret;
1998
1999         ret = mm_flags & MMF_DUMPABLE_MASK;
2000         return (ret >= 2) ? 2 : ret;
2001 }
2002
2003 int get_dumpable(struct mm_struct *mm)
2004 {
2005         return __get_dumpable(mm->flags);
2006 }
2007
2008 static void wait_for_dump_helpers(struct file *file)
2009 {
2010         struct pipe_inode_info *pipe;
2011
2012         pipe = file->f_path.dentry->d_inode->i_pipe;
2013
2014         pipe_lock(pipe);
2015         pipe->readers++;
2016         pipe->writers--;
2017
2018         while ((pipe->readers > 1) && (!signal_pending(current))) {
2019                 wake_up_interruptible_sync(&pipe->wait);
2020                 kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
2021                 pipe_wait(pipe);
2022         }
2023
2024         pipe->readers--;
2025         pipe->writers++;
2026         pipe_unlock(pipe);
2027
2028 }
2029
2030
2031 /*
2032  * umh_pipe_setup
2033  * helper function to customize the process used
2034  * to collect the core in userspace.  Specifically
2035  * it sets up a pipe and installs it as fd 0 (stdin)
2036  * for the process.  Returns 0 on success, or
2037  * PTR_ERR on failure.
2038  * Note that it also sets the core limit to 1.  This
2039  * is a special value that we use to trap recursive
2040  * core dumps
2041  */
2042 static int umh_pipe_setup(struct subprocess_info *info, struct cred *new)
2043 {
2044         struct file *rp, *wp;
2045         struct fdtable *fdt;
2046         struct coredump_params *cp = (struct coredump_params *)info->data;
2047         struct files_struct *cf = current->files;
2048
2049         wp = create_write_pipe(0);
2050         if (IS_ERR(wp))
2051                 return PTR_ERR(wp);
2052
2053         rp = create_read_pipe(wp, 0);
2054         if (IS_ERR(rp)) {
2055                 free_write_pipe(wp);
2056                 return PTR_ERR(rp);
2057         }
2058
2059         cp->file = wp;
2060
2061         sys_close(0);
2062         fd_install(0, rp);
2063         spin_lock(&cf->file_lock);
2064         fdt = files_fdtable(cf);
2065         FD_SET(0, fdt->open_fds);
2066         FD_CLR(0, fdt->close_on_exec);
2067         spin_unlock(&cf->file_lock);
2068
2069         /* and disallow core files too */
2070         current->signal->rlim[RLIMIT_CORE] = (struct rlimit){1, 1};
2071
2072         return 0;
2073 }
2074
2075 void do_coredump(long signr, int exit_code, struct pt_regs *regs)
2076 {
2077         struct core_state core_state;
2078         struct core_name cn;
2079         struct mm_struct *mm = current->mm;
2080         struct linux_binfmt * binfmt;
2081         const struct cred *old_cred;
2082         struct cred *cred;
2083         int retval = 0;
2084         int flag = 0;
2085         int ispipe;
2086         static atomic_t core_dump_count = ATOMIC_INIT(0);
2087         struct coredump_params cprm = {
2088                 .signr = signr,
2089                 .regs = regs,
2090                 .limit = rlimit(RLIMIT_CORE),
2091                 /*
2092                  * We must use the same mm->flags while dumping core to avoid
2093                  * inconsistency of bit flags, since this flag is not protected
2094                  * by any locks.
2095                  */
2096                 .mm_flags = mm->flags,
2097         };
2098
2099         audit_core_dumps(signr);
2100
2101         binfmt = mm->binfmt;
2102         if (!binfmt || !binfmt->core_dump)
2103                 goto fail;
2104         if (!__get_dumpable(cprm.mm_flags))
2105                 goto fail;
2106
2107         cred = prepare_creds();
2108         if (!cred)
2109                 goto fail;
2110         /*
2111          *      We cannot trust fsuid as being the "true" uid of the
2112          *      process nor do we know its entire history. We only know it
2113          *      was tainted so we dump it as root in mode 2.
2114          */
2115         if (__get_dumpable(cprm.mm_flags) == 2) {
2116                 /* Setuid core dump mode */
2117                 flag = O_EXCL;          /* Stop rewrite attacks */
2118                 cred->fsuid = 0;        /* Dump root private */
2119         }
2120
2121         retval = coredump_wait(exit_code, &core_state);
2122         if (retval < 0)
2123                 goto fail_creds;
2124
2125         old_cred = override_creds(cred);
2126
2127         /*
2128          * Clear any false indication of pending signals that might
2129          * be seen by the filesystem code called to write the core file.
2130          */
2131         clear_thread_flag(TIF_SIGPENDING);
2132
2133         ispipe = format_corename(&cn, signr);
2134
2135         if (ispipe) {
2136                 int dump_count;
2137                 char **helper_argv;
2138
2139                 if (ispipe < 0) {
2140                         printk(KERN_WARNING "format_corename failed\n");
2141                         printk(KERN_WARNING "Aborting core\n");
2142                         goto fail_corename;
2143                 }
2144
2145                 if (cprm.limit == 1) {
2146                         /*
2147                          * Normally core limits are irrelevant to pipes, since
2148                          * we're not writing to the file system, but we use
2149                          * cprm.limit of 1 here as a speacial value. Any
2150                          * non-1 limit gets set to RLIM_INFINITY below, but
2151                          * a limit of 0 skips the dump.  This is a consistent
2152                          * way to catch recursive crashes.  We can still crash
2153                          * if the core_pattern binary sets RLIM_CORE =  !1
2154                          * but it runs as root, and can do lots of stupid things
2155                          * Note that we use task_tgid_vnr here to grab the pid
2156                          * of the process group leader.  That way we get the
2157                          * right pid if a thread in a multi-threaded
2158                          * core_pattern process dies.
2159                          */
2160                         printk(KERN_WARNING
2161                                 "Process %d(%s) has RLIMIT_CORE set to 1\n",
2162                                 task_tgid_vnr(current), current->comm);
2163                         printk(KERN_WARNING "Aborting core\n");
2164                         goto fail_unlock;
2165                 }
2166                 cprm.limit = RLIM_INFINITY;
2167
2168                 dump_count = atomic_inc_return(&core_dump_count);
2169                 if (core_pipe_limit && (core_pipe_limit < dump_count)) {
2170                         printk(KERN_WARNING "Pid %d(%s) over core_pipe_limit\n",
2171                                task_tgid_vnr(current), current->comm);
2172                         printk(KERN_WARNING "Skipping core dump\n");
2173                         goto fail_dropcount;
2174                 }
2175
2176                 helper_argv = argv_split(GFP_KERNEL, cn.corename+1, NULL);
2177                 if (!helper_argv) {
2178                         printk(KERN_WARNING "%s failed to allocate memory\n",
2179                                __func__);
2180                         goto fail_dropcount;
2181                 }
2182
2183                 retval = call_usermodehelper_fns(helper_argv[0], helper_argv,
2184                                         NULL, UMH_WAIT_EXEC, umh_pipe_setup,
2185                                         NULL, &cprm);
2186                 argv_free(helper_argv);
2187                 if (retval) {
2188                         printk(KERN_INFO "Core dump to %s pipe failed\n",
2189                                cn.corename);
2190                         goto close_fail;
2191                 }
2192         } else {
2193                 struct inode *inode;
2194
2195                 if (cprm.limit < binfmt->min_coredump)
2196                         goto fail_unlock;
2197
2198                 cprm.file = filp_open(cn.corename,
2199                                  O_CREAT | 2 | O_NOFOLLOW | O_LARGEFILE | flag,
2200                                  0600);
2201                 if (IS_ERR(cprm.file))
2202                         goto fail_unlock;
2203
2204                 inode = cprm.file->f_path.dentry->d_inode;
2205                 if (inode->i_nlink > 1)
2206                         goto close_fail;
2207                 if (d_unhashed(cprm.file->f_path.dentry))
2208                         goto close_fail;
2209                 /*
2210                  * AK: actually i see no reason to not allow this for named
2211                  * pipes etc, but keep the previous behaviour for now.
2212                  */
2213                 if (!S_ISREG(inode->i_mode))
2214                         goto close_fail;
2215                 /*
2216                  * Dont allow local users get cute and trick others to coredump
2217                  * into their pre-created files.
2218                  */
2219                 if (inode->i_uid != current_fsuid())
2220                         goto close_fail;
2221                 if (!cprm.file->f_op || !cprm.file->f_op->write)
2222                         goto close_fail;
2223                 if (do_truncate(cprm.file->f_path.dentry, 0, 0, cprm.file))
2224                         goto close_fail;
2225         }
2226
2227         retval = binfmt->core_dump(&cprm);
2228         if (retval)
2229                 current->signal->group_exit_code |= 0x80;
2230
2231         if (ispipe && core_pipe_limit)
2232                 wait_for_dump_helpers(cprm.file);
2233 close_fail:
2234         if (cprm.file)
2235                 filp_close(cprm.file, NULL);
2236 fail_dropcount:
2237         if (ispipe)
2238                 atomic_dec(&core_dump_count);
2239 fail_unlock:
2240         kfree(cn.corename);
2241 fail_corename:
2242         coredump_finish(mm);
2243         revert_creds(old_cred);
2244 fail_creds:
2245         put_cred(cred);
2246 fail:
2247         return;
2248 }
2249
2250 /*
2251  * Core dumping helper functions.  These are the only things you should
2252  * do on a core-file: use only these functions to write out all the
2253  * necessary info.
2254  */
2255 int dump_write(struct file *file, const void *addr, int nr)
2256 {
2257         return access_ok(VERIFY_READ, addr, nr) && file->f_op->write(file, addr, nr, &file->f_pos) == nr;
2258 }
2259 EXPORT_SYMBOL(dump_write);
2260
2261 int dump_seek(struct file *file, loff_t off)
2262 {
2263         int ret = 1;
2264
2265         if (file->f_op->llseek && file->f_op->llseek != no_llseek) {
2266                 if (file->f_op->llseek(file, off, SEEK_CUR) < 0)
2267                         return 0;
2268         } else {
2269                 char *buf = (char *)get_zeroed_page(GFP_KERNEL);
2270
2271                 if (!buf)
2272                         return 0;
2273                 while (off > 0) {
2274                         unsigned long n = off;
2275
2276                         if (n > PAGE_SIZE)
2277                                 n = PAGE_SIZE;
2278                         if (!dump_write(file, buf, n)) {
2279                                 ret = 0;
2280                                 break;
2281                         }
2282                         off -= n;
2283                 }
2284                 free_page((unsigned long)buf);
2285         }
2286         return ret;
2287 }
2288 EXPORT_SYMBOL(dump_seek);