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