Blame view
fs/exec.c
39.9 KB
1da177e4c
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
/* * linux/fs/exec.c * * Copyright (C) 1991, 1992 Linus Torvalds */ /* * #!-checking implemented by tytso. */ /* * Demand-loading implemented 01.12.91 - no need to read anything but * the header into memory. The inode of the executable is put into * "current->executable", and page faults do the actual loading. Clean. * * Once more I can proudly say that linux stood up to being changed: it * was less than 2 hours work to get demand-loading completely implemented. * * Demand loading changed July 1993 by Eric Youngdale. Use mmap instead, * current->executable is only used by the procfs. This allows a dispatch * table to check for several different types of binary formats. We keep * trying until we recognize the file or we run out of supported binary * formats. */ |
1da177e4c
|
24 25 |
#include <linux/slab.h> #include <linux/file.h> |
9f3acc314
|
26 |
#include <linux/fdtable.h> |
ba92a43db
|
27 |
#include <linux/mm.h> |
615d6e875
|
28 |
#include <linux/vmacache.h> |
1da177e4c
|
29 30 |
#include <linux/stat.h> #include <linux/fcntl.h> |
ba92a43db
|
31 |
#include <linux/swap.h> |
74aadce98
|
32 |
#include <linux/string.h> |
1da177e4c
|
33 |
#include <linux/init.h> |
ca5b172bd
|
34 |
#include <linux/pagemap.h> |
cdd6c482c
|
35 |
#include <linux/perf_event.h> |
1da177e4c
|
36 37 38 39 40 |
#include <linux/highmem.h> #include <linux/spinlock.h> #include <linux/key.h> #include <linux/personality.h> #include <linux/binfmts.h> |
1da177e4c
|
41 |
#include <linux/utsname.h> |
84d737866
|
42 |
#include <linux/pid_namespace.h> |
1da177e4c
|
43 44 |
#include <linux/module.h> #include <linux/namei.h> |
1da177e4c
|
45 46 47 |
#include <linux/mount.h> #include <linux/security.h> #include <linux/syscalls.h> |
8f0ab5147
|
48 |
#include <linux/tsacct_kern.h> |
9f46080c4
|
49 |
#include <linux/cn_proc.h> |
473ae30bc
|
50 |
#include <linux/audit.h> |
6341c393f
|
51 |
#include <linux/tracehook.h> |
5f4123be3
|
52 |
#include <linux/kmod.h> |
6110e3abb
|
53 |
#include <linux/fsnotify.h> |
5ad4e53bd
|
54 |
#include <linux/fs_struct.h> |
61be228a0
|
55 |
#include <linux/pipe_fs_i.h> |
3d5992d2a
|
56 |
#include <linux/oom.h> |
0e028465d
|
57 |
#include <linux/compat.h> |
1da177e4c
|
58 59 60 |
#include <asm/uaccess.h> #include <asm/mmu_context.h> |
b6a2fea39
|
61 |
#include <asm/tlb.h> |
43d2b1132
|
62 63 |
#include <trace/events/task.h> |
a6f76f23d
|
64 |
#include "internal.h" |
1da177e4c
|
65 |
|
4ff16c25e
|
66 |
#include <trace/events/sched.h> |
d6e711448
|
67 |
int suid_dumpable = 0; |
e4dc1b14d
|
68 |
static LIST_HEAD(formats); |
1da177e4c
|
69 |
static DEFINE_RWLOCK(binfmt_lock); |
8fc3dc5a3
|
70 |
void __register_binfmt(struct linux_binfmt * fmt, int insert) |
1da177e4c
|
71 |
{ |
8fc3dc5a3
|
72 |
BUG_ON(!fmt); |
92eaa565a
|
73 74 |
if (WARN_ON(!fmt->load_binary)) return; |
1da177e4c
|
75 |
write_lock(&binfmt_lock); |
74641f584
|
76 77 |
insert ? list_add(&fmt->lh, &formats) : list_add_tail(&fmt->lh, &formats); |
1da177e4c
|
78 |
write_unlock(&binfmt_lock); |
1da177e4c
|
79 |
} |
74641f584
|
80 |
EXPORT_SYMBOL(__register_binfmt); |
1da177e4c
|
81 |
|
f6b450d48
|
82 |
void unregister_binfmt(struct linux_binfmt * fmt) |
1da177e4c
|
83 |
{ |
1da177e4c
|
84 |
write_lock(&binfmt_lock); |
e4dc1b14d
|
85 |
list_del(&fmt->lh); |
1da177e4c
|
86 |
write_unlock(&binfmt_lock); |
1da177e4c
|
87 88 89 90 91 92 93 94 |
} EXPORT_SYMBOL(unregister_binfmt); static inline void put_binfmt(struct linux_binfmt * fmt) { module_put(fmt->module); } |
69369a700
|
95 |
#ifdef CONFIG_USELIB |
1da177e4c
|
96 97 98 99 100 101 |
/* * Note that a shared library must be both readable and executable due to * security reasons. * * Also note that we take the address to load from from the file itself. */ |
1e7bfb213
|
102 |
SYSCALL_DEFINE1(uselib, const char __user *, library) |
1da177e4c
|
103 |
{ |
72c2d5319
|
104 |
struct linux_binfmt *fmt; |
964bd1836
|
105 |
struct file *file; |
91a27b2a7
|
106 |
struct filename *tmp = getname(library); |
964bd1836
|
107 |
int error = PTR_ERR(tmp); |
47c805dc2
|
108 109 110 |
static const struct open_flags uselib_flags = { .open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC, .acc_mode = MAY_READ | MAY_EXEC | MAY_OPEN, |
f9652e10c
|
111 112 |
.intent = LOOKUP_OPEN, .lookup_flags = LOOKUP_FOLLOW, |
47c805dc2
|
113 |
}; |
964bd1836
|
114 |
|
6e8341a11
|
115 116 |
if (IS_ERR(tmp)) goto out; |
f9652e10c
|
117 |
file = do_filp_open(AT_FDCWD, tmp, &uselib_flags); |
6e8341a11
|
118 119 120 |
putname(tmp); error = PTR_ERR(file); if (IS_ERR(file)) |
1da177e4c
|
121 122 123 |
goto out; error = -EINVAL; |
496ad9aa8
|
124 |
if (!S_ISREG(file_inode(file)->i_mode)) |
1da177e4c
|
125 |
goto exit; |
30524472c
|
126 |
error = -EACCES; |
6e8341a11
|
127 |
if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) |
6146f0d5e
|
128 |
goto exit; |
1da177e4c
|
129 |
|
2a12a9d78
|
130 |
fsnotify_open(file); |
6110e3abb
|
131 |
|
1da177e4c
|
132 |
error = -ENOEXEC; |
1da177e4c
|
133 |
|
72c2d5319
|
134 135 136 137 138 139 |
read_lock(&binfmt_lock); list_for_each_entry(fmt, &formats, lh) { if (!fmt->load_shlib) continue; if (!try_module_get(fmt->module)) continue; |
1da177e4c
|
140 |
read_unlock(&binfmt_lock); |
72c2d5319
|
141 142 143 144 145 |
error = fmt->load_shlib(file); read_lock(&binfmt_lock); put_binfmt(fmt); if (error != -ENOEXEC) break; |
1da177e4c
|
146 |
} |
72c2d5319
|
147 |
read_unlock(&binfmt_lock); |
6e8341a11
|
148 |
exit: |
1da177e4c
|
149 150 151 |
fput(file); out: return error; |
1da177e4c
|
152 |
} |
69369a700
|
153 |
#endif /* #ifdef CONFIG_USELIB */ |
1da177e4c
|
154 |
|
b6a2fea39
|
155 |
#ifdef CONFIG_MMU |
ae6b585ee
|
156 157 158 159 160 161 |
/* * The nascent bprm->mm is not visible until exec_mmap() but it can * use a lot of memory, account these pages in current->mm temporary * for oom_badness()->get_mm_rss(). Once exec succeeds or fails, we * change the counter back via acct_arg_size(0). */ |
0e028465d
|
162 |
static void acct_arg_size(struct linux_binprm *bprm, unsigned long pages) |
3c77f8457
|
163 164 165 166 167 168 169 170 |
{ struct mm_struct *mm = current->mm; long diff = (long)(pages - bprm->vma_pages); if (!mm || !diff) return; bprm->vma_pages = pages; |
3c77f8457
|
171 |
add_mm_counter(mm, MM_ANONPAGES, diff); |
3c77f8457
|
172 |
} |
0e028465d
|
173 |
static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos, |
b6a2fea39
|
174 175 176 177 178 179 180 |
int write) { struct page *page; int ret; #ifdef CONFIG_STACK_GROWSUP if (write) { |
d05f3169c
|
181 |
ret = expand_downwards(bprm->vma, pos); |
b6a2fea39
|
182 183 184 185 186 187 188 189 190 191 |
if (ret < 0) return NULL; } #endif ret = get_user_pages(current, bprm->mm, pos, 1, write, 1, &page, NULL); if (ret <= 0) return NULL; if (write) { |
b6a2fea39
|
192 |
unsigned long size = bprm->vma->vm_end - bprm->vma->vm_start; |
a64e715fc
|
193 |
struct rlimit *rlim; |
3c77f8457
|
194 |
acct_arg_size(bprm, size / PAGE_SIZE); |
a64e715fc
|
195 196 197 198 199 200 |
/* * We've historically supported up to 32 pages (ARG_MAX) * of argument strings even with small stacks */ if (size <= ARG_MAX) return page; |
b6a2fea39
|
201 202 203 204 205 206 207 208 |
/* * Limit to 1/4-th the stack size for the argv+env strings. * This ensures that: * - the remaining binfmt code will not run out of stack space, * - the program will have a reasonable amount of stack left * to work from. */ |
a64e715fc
|
209 |
rlim = current->signal->rlim; |
d554ed895
|
210 |
if (size > ACCESS_ONCE(rlim[RLIMIT_STACK].rlim_cur) / 4) { |
b6a2fea39
|
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 |
put_page(page); return NULL; } } return page; } static void put_arg_page(struct page *page) { put_page(page); } static void free_arg_page(struct linux_binprm *bprm, int i) { } static void free_arg_pages(struct linux_binprm *bprm) { } static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos, struct page *page) { flush_cache_page(bprm->vma, pos, page_to_pfn(page)); } static int __bprm_mm_init(struct linux_binprm *bprm) { |
eaccbfa56
|
240 |
int err; |
b6a2fea39
|
241 242 243 244 245 |
struct vm_area_struct *vma = NULL; struct mm_struct *mm = bprm->mm; bprm->vma = vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL); if (!vma) |
eaccbfa56
|
246 |
return -ENOMEM; |
b6a2fea39
|
247 248 249 250 251 252 253 254 255 256 |
down_write(&mm->mmap_sem); vma->vm_mm = mm; /* * Place the stack at the largest stack address the architecture * supports. Later, we'll move this to an appropriate place. We don't * use STACK_TOP because that can depend on attributes which aren't * configured yet. */ |
aacb3d17a
|
257 |
BUILD_BUG_ON(VM_STACK_FLAGS & VM_STACK_INCOMPLETE_SETUP); |
b6a2fea39
|
258 259 |
vma->vm_end = STACK_TOP_MAX; vma->vm_start = vma->vm_end - PAGE_SIZE; |
d9104d1ca
|
260 |
vma->vm_flags = VM_SOFTDIRTY | VM_STACK_FLAGS | VM_STACK_INCOMPLETE_SETUP; |
3ed75eb8f
|
261 |
vma->vm_page_prot = vm_get_page_prot(vma->vm_flags); |
5beb49305
|
262 |
INIT_LIST_HEAD(&vma->anon_vma_chain); |
462e635e5
|
263 |
|
b6a2fea39
|
264 |
err = insert_vm_struct(mm, vma); |
eaccbfa56
|
265 |
if (err) |
b6a2fea39
|
266 |
goto err; |
b6a2fea39
|
267 268 |
mm->stack_vm = mm->total_vm = 1; |
fe3d197f8
|
269 |
arch_bprm_mm_init(mm, vma); |
b6a2fea39
|
270 |
up_write(&mm->mmap_sem); |
b6a2fea39
|
271 |
bprm->p = vma->vm_end - sizeof(void *); |
b6a2fea39
|
272 |
return 0; |
b6a2fea39
|
273 |
err: |
eaccbfa56
|
274 275 276 |
up_write(&mm->mmap_sem); bprm->vma = NULL; kmem_cache_free(vm_area_cachep, vma); |
b6a2fea39
|
277 278 279 280 281 282 283 284 285 |
return err; } static bool valid_arg_len(struct linux_binprm *bprm, long len) { return len <= MAX_ARG_STRLEN; } #else |
0e028465d
|
286 |
static inline void acct_arg_size(struct linux_binprm *bprm, unsigned long pages) |
3c77f8457
|
287 288 |
{ } |
0e028465d
|
289 |
static struct page *get_arg_page(struct linux_binprm *bprm, unsigned long pos, |
b6a2fea39
|
290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 |
int write) { struct page *page; page = bprm->page[pos / PAGE_SIZE]; if (!page && write) { page = alloc_page(GFP_HIGHUSER|__GFP_ZERO); if (!page) return NULL; bprm->page[pos / PAGE_SIZE] = page; } return page; } static void put_arg_page(struct page *page) { } static void free_arg_page(struct linux_binprm *bprm, int i) { if (bprm->page[i]) { __free_page(bprm->page[i]); bprm->page[i] = NULL; } } static void free_arg_pages(struct linux_binprm *bprm) { int i; for (i = 0; i < MAX_ARG_PAGES; i++) free_arg_page(bprm, i); } static void flush_arg_page(struct linux_binprm *bprm, unsigned long pos, struct page *page) { } static int __bprm_mm_init(struct linux_binprm *bprm) { bprm->p = PAGE_SIZE * MAX_ARG_PAGES - sizeof(void *); return 0; } static bool valid_arg_len(struct linux_binprm *bprm, long len) { return len <= bprm->p; } #endif /* CONFIG_MMU */ /* * Create a new mm_struct and populate it with a temporary stack * vm_area_struct. We don't have enough context at this point to set the stack * flags, permissions, and offset, so we use temporary values. We'll update * them later in setup_arg_pages(). */ |
9cc64ceaa
|
349 |
static int bprm_mm_init(struct linux_binprm *bprm) |
b6a2fea39
|
350 351 352 353 354 355 356 357 |
{ int err; struct mm_struct *mm = NULL; bprm->mm = mm = mm_alloc(); err = -ENOMEM; if (!mm) goto err; |
b6a2fea39
|
358 359 360 361 362 363 364 365 366 367 368 369 370 371 |
err = __bprm_mm_init(bprm); if (err) goto err; return 0; err: if (mm) { bprm->mm = NULL; mmdrop(mm); } return err; } |
ba2d01629
|
372 |
struct user_arg_ptr { |
0e028465d
|
373 374 375 376 377 378 |
#ifdef CONFIG_COMPAT bool is_compat; #endif union { const char __user *const __user *native; #ifdef CONFIG_COMPAT |
38b983b34
|
379 |
const compat_uptr_t __user *compat; |
0e028465d
|
380 381 |
#endif } ptr; |
ba2d01629
|
382 383 384 |
}; static const char __user *get_user_arg_ptr(struct user_arg_ptr argv, int nr) |
1d1dbf813
|
385 |
{ |
0e028465d
|
386 387 388 389 390 391 392 393 |
const char __user *native; #ifdef CONFIG_COMPAT if (unlikely(argv.is_compat)) { compat_uptr_t compat; if (get_user(compat, argv.ptr.compat + nr)) return ERR_PTR(-EFAULT); |
1d1dbf813
|
394 |
|
0e028465d
|
395 396 397 398 399 |
return compat_ptr(compat); } #endif if (get_user(native, argv.ptr.native + nr)) |
1d1dbf813
|
400 |
return ERR_PTR(-EFAULT); |
0e028465d
|
401 |
return native; |
1d1dbf813
|
402 |
} |
1da177e4c
|
403 404 405 |
/* * count() counts the number of strings in array ARGV. */ |
ba2d01629
|
406 |
static int count(struct user_arg_ptr argv, int max) |
1da177e4c
|
407 408 |
{ int i = 0; |
0e028465d
|
409 |
if (argv.ptr.native != NULL) { |
1da177e4c
|
410 |
for (;;) { |
1d1dbf813
|
411 |
const char __user *p = get_user_arg_ptr(argv, i); |
1da177e4c
|
412 |
|
1da177e4c
|
413 414 |
if (!p) break; |
1d1dbf813
|
415 416 417 |
if (IS_ERR(p)) return -EFAULT; |
6d92d4f6a
|
418 |
if (i >= max) |
1da177e4c
|
419 |
return -E2BIG; |
6d92d4f6a
|
420 |
++i; |
9aea5a65a
|
421 422 423 |
if (fatal_signal_pending(current)) return -ERESTARTNOHAND; |
1da177e4c
|
424 425 426 427 428 429 430 |
cond_resched(); } } return i; } /* |
b6a2fea39
|
431 432 433 |
* 'copy_strings()' copies argument/environment strings from the old * processes's memory to the new process's stack. The call to get_user_pages() * ensures the destination page is created and not swapped out. |
1da177e4c
|
434 |
*/ |
ba2d01629
|
435 |
static int copy_strings(int argc, struct user_arg_ptr argv, |
75c96f858
|
436 |
struct linux_binprm *bprm) |
1da177e4c
|
437 438 439 |
{ struct page *kmapped_page = NULL; char *kaddr = NULL; |
b6a2fea39
|
440 |
unsigned long kpos = 0; |
1da177e4c
|
441 442 443 |
int ret; while (argc-- > 0) { |
d7627467b
|
444 |
const char __user *str; |
1da177e4c
|
445 446 |
int len; unsigned long pos; |
1d1dbf813
|
447 448 449 |
ret = -EFAULT; str = get_user_arg_ptr(argv, argc); if (IS_ERR(str)) |
1da177e4c
|
450 |
goto out; |
1da177e4c
|
451 |
|
1d1dbf813
|
452 453 454 455 456 457 |
len = strnlen_user(str, MAX_ARG_STRLEN); if (!len) goto out; ret = -E2BIG; if (!valid_arg_len(bprm, len)) |
1da177e4c
|
458 |
goto out; |
1da177e4c
|
459 |
|
b6a2fea39
|
460 |
/* We're going to work our way backwords. */ |
1da177e4c
|
461 |
pos = bprm->p; |
b6a2fea39
|
462 463 |
str += len; bprm->p -= len; |
1da177e4c
|
464 465 |
while (len > 0) { |
1da177e4c
|
466 |
int offset, bytes_to_copy; |
1da177e4c
|
467 |
|
9aea5a65a
|
468 469 470 471 |
if (fatal_signal_pending(current)) { ret = -ERESTARTNOHAND; goto out; } |
7993bc1f4
|
472 |
cond_resched(); |
1da177e4c
|
473 |
offset = pos % PAGE_SIZE; |
b6a2fea39
|
474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 |
if (offset == 0) offset = PAGE_SIZE; bytes_to_copy = offset; if (bytes_to_copy > len) bytes_to_copy = len; offset -= bytes_to_copy; pos -= bytes_to_copy; str -= bytes_to_copy; len -= bytes_to_copy; if (!kmapped_page || kpos != (pos & PAGE_MASK)) { struct page *page; page = get_arg_page(bprm, pos, 1); |
1da177e4c
|
490 |
if (!page) { |
b6a2fea39
|
491 |
ret = -E2BIG; |
1da177e4c
|
492 493 |
goto out; } |
1da177e4c
|
494 |
|
b6a2fea39
|
495 496 |
if (kmapped_page) { flush_kernel_dcache_page(kmapped_page); |
1da177e4c
|
497 |
kunmap(kmapped_page); |
b6a2fea39
|
498 499 |
put_arg_page(kmapped_page); } |
1da177e4c
|
500 501 |
kmapped_page = page; kaddr = kmap(kmapped_page); |
b6a2fea39
|
502 503 |
kpos = pos & PAGE_MASK; flush_arg_page(bprm, kpos, kmapped_page); |
1da177e4c
|
504 |
} |
b6a2fea39
|
505 |
if (copy_from_user(kaddr+offset, str, bytes_to_copy)) { |
1da177e4c
|
506 507 508 |
ret = -EFAULT; goto out; } |
1da177e4c
|
509 510 511 512 |
} } ret = 0; out: |
b6a2fea39
|
513 514 |
if (kmapped_page) { flush_kernel_dcache_page(kmapped_page); |
1da177e4c
|
515 |
kunmap(kmapped_page); |
b6a2fea39
|
516 517 |
put_arg_page(kmapped_page); } |
1da177e4c
|
518 519 520 521 522 523 |
return ret; } /* * Like copy_strings, but get argv and its values from kernel memory. */ |
ba2d01629
|
524 |
int copy_strings_kernel(int argc, const char *const *__argv, |
d7627467b
|
525 |
struct linux_binprm *bprm) |
1da177e4c
|
526 527 528 |
{ int r; mm_segment_t oldfs = get_fs(); |
ba2d01629
|
529 |
struct user_arg_ptr argv = { |
0e028465d
|
530 |
.ptr.native = (const char __user *const __user *)__argv, |
ba2d01629
|
531 |
}; |
1da177e4c
|
532 |
set_fs(KERNEL_DS); |
ba2d01629
|
533 |
r = copy_strings(argc, argv, bprm); |
1da177e4c
|
534 |
set_fs(oldfs); |
ba2d01629
|
535 |
|
1da177e4c
|
536 537 |
return r; } |
1da177e4c
|
538 539 540 |
EXPORT_SYMBOL(copy_strings_kernel); #ifdef CONFIG_MMU |
b6a2fea39
|
541 |
|
1da177e4c
|
542 |
/* |
b6a2fea39
|
543 544 545 |
* During bprm_mm_init(), we create a temporary stack at STACK_TOP_MAX. Once * the binfmt code determines where the new stack should reside, we shift it to * its final location. The process proceeds as follows: |
1da177e4c
|
546 |
* |
b6a2fea39
|
547 548 549 550 551 552 |
* 1) Use shift to calculate the new vma endpoints. * 2) Extend vma to cover both the old and new ranges. This ensures the * arguments passed to subsequent functions are consistent. * 3) Move vma's page tables to the new range. * 4) Free up any cleared pgd range. * 5) Shrink the vma to cover only the new range. |
1da177e4c
|
553 |
*/ |
b6a2fea39
|
554 |
static int shift_arg_pages(struct vm_area_struct *vma, unsigned long shift) |
1da177e4c
|
555 556 |
{ struct mm_struct *mm = vma->vm_mm; |
b6a2fea39
|
557 558 559 560 561 |
unsigned long old_start = vma->vm_start; unsigned long old_end = vma->vm_end; unsigned long length = old_end - old_start; unsigned long new_start = old_start - shift; unsigned long new_end = old_end - shift; |
d16dfc550
|
562 |
struct mmu_gather tlb; |
1da177e4c
|
563 |
|
b6a2fea39
|
564 |
BUG_ON(new_start > new_end); |
1da177e4c
|
565 |
|
b6a2fea39
|
566 567 568 569 570 571 572 573 574 575 |
/* * ensure there are no vmas between where we want to go * and where we are */ if (vma != find_vma(mm, new_start)) return -EFAULT; /* * cover the whole range: [new_start, old_end) */ |
5beb49305
|
576 577 |
if (vma_adjust(vma, new_start, old_end, vma->vm_pgoff, NULL)) return -ENOMEM; |
b6a2fea39
|
578 579 580 581 582 583 |
/* * move the page tables downwards, on failure we rely on * process cleanup to remove whatever mess we made. */ if (length != move_page_tables(vma, old_start, |
38a76013a
|
584 |
vma, new_start, length, false)) |
b6a2fea39
|
585 586 587 |
return -ENOMEM; lru_add_drain(); |
2b047252d
|
588 |
tlb_gather_mmu(&tlb, mm, old_start, old_end); |
b6a2fea39
|
589 590 591 592 |
if (new_end > old_start) { /* * when the old and new regions overlap clear from new_end. */ |
d16dfc550
|
593 |
free_pgd_range(&tlb, new_end, old_end, new_end, |
6ee8630e0
|
594 |
vma->vm_next ? vma->vm_next->vm_start : USER_PGTABLES_CEILING); |
b6a2fea39
|
595 596 597 598 599 600 601 |
} else { /* * otherwise, clean from old_start; this is done to not touch * the address space in [new_end, old_start) some architectures * have constraints on va-space that make this illegal (IA64) - * for the others its just a little faster. */ |
d16dfc550
|
602 |
free_pgd_range(&tlb, old_start, old_end, new_end, |
6ee8630e0
|
603 |
vma->vm_next ? vma->vm_next->vm_start : USER_PGTABLES_CEILING); |
1da177e4c
|
604 |
} |
2b047252d
|
605 |
tlb_finish_mmu(&tlb, old_start, old_end); |
b6a2fea39
|
606 607 |
/* |
5beb49305
|
608 |
* Shrink the vma to just the new range. Always succeeds. |
b6a2fea39
|
609 610 611 612 |
*/ vma_adjust(vma, new_start, new_end, vma->vm_pgoff, NULL); return 0; |
1da177e4c
|
613 |
} |
b6a2fea39
|
614 615 616 617 |
/* * Finalizes the stack vm_area_struct. The flags and permissions are updated, * the stack is optionally relocated, and some extra space is added. */ |
1da177e4c
|
618 619 620 621 |
int setup_arg_pages(struct linux_binprm *bprm, unsigned long stack_top, int executable_stack) { |
b6a2fea39
|
622 623 |
unsigned long ret; unsigned long stack_shift; |
1da177e4c
|
624 |
struct mm_struct *mm = current->mm; |
b6a2fea39
|
625 626 627 628 |
struct vm_area_struct *vma = bprm->vma; struct vm_area_struct *prev = NULL; unsigned long vm_flags; unsigned long stack_base; |
803bf5ec2
|
629 630 631 |
unsigned long stack_size; unsigned long stack_expand; unsigned long rlim_stack; |
1da177e4c
|
632 633 |
#ifdef CONFIG_STACK_GROWSUP |
d71f290b4
|
634 |
/* Limit stack size */ |
d554ed895
|
635 |
stack_base = rlimit_max(RLIMIT_STACK); |
d71f290b4
|
636 637 |
if (stack_base > STACK_SIZE_MAX) stack_base = STACK_SIZE_MAX; |
1da177e4c
|
638 |
|
b6a2fea39
|
639 640 641 |
/* Make sure we didn't let the argument array grow too large. */ if (vma->vm_end - vma->vm_start > stack_base) return -ENOMEM; |
1da177e4c
|
642 |
|
b6a2fea39
|
643 |
stack_base = PAGE_ALIGN(stack_top - stack_base); |
1da177e4c
|
644 |
|
b6a2fea39
|
645 646 647 |
stack_shift = vma->vm_start - stack_base; mm->arg_start = bprm->p - stack_shift; bprm->p = vma->vm_end - stack_shift; |
1da177e4c
|
648 |
#else |
b6a2fea39
|
649 650 |
stack_top = arch_align_stack(stack_top); stack_top = PAGE_ALIGN(stack_top); |
1b528181b
|
651 652 653 654 |
if (unlikely(stack_top < mmap_min_addr) || unlikely(vma->vm_end - vma->vm_start >= stack_top - mmap_min_addr)) return -ENOMEM; |
b6a2fea39
|
655 656 657 |
stack_shift = vma->vm_end - stack_top; bprm->p -= stack_shift; |
1da177e4c
|
658 |
mm->arg_start = bprm->p; |
1da177e4c
|
659 |
#endif |
1da177e4c
|
660 |
if (bprm->loader) |
b6a2fea39
|
661 662 |
bprm->loader -= stack_shift; bprm->exec -= stack_shift; |
1da177e4c
|
663 |
|
1da177e4c
|
664 |
down_write(&mm->mmap_sem); |
96a8e13ed
|
665 |
vm_flags = VM_STACK_FLAGS; |
b6a2fea39
|
666 667 668 669 670 671 672 673 674 675 676 |
/* * Adjust stack execute permissions; explicitly enable for * EXSTACK_ENABLE_X, disable for EXSTACK_DISABLE_X and leave alone * (arch default) otherwise. */ if (unlikely(executable_stack == EXSTACK_ENABLE_X)) vm_flags |= VM_EXEC; else if (executable_stack == EXSTACK_DISABLE_X) vm_flags &= ~VM_EXEC; vm_flags |= mm->def_flags; |
a8bef8ff6
|
677 |
vm_flags |= VM_STACK_INCOMPLETE_SETUP; |
b6a2fea39
|
678 679 680 681 682 683 684 685 686 687 |
ret = mprotect_fixup(vma, &prev, vma->vm_start, vma->vm_end, vm_flags); if (ret) goto out_unlock; BUG_ON(prev != vma); /* Move stack pages down in memory. */ if (stack_shift) { ret = shift_arg_pages(vma, stack_shift); |
fc63cf237
|
688 689 |
if (ret) goto out_unlock; |
1da177e4c
|
690 |
} |
a8bef8ff6
|
691 692 |
/* mprotect_fixup is overkill to remove the temporary stack flags */ vma->vm_flags &= ~VM_STACK_INCOMPLETE_SETUP; |
5ef097dd7
|
693 |
stack_expand = 131072UL; /* randomly 32*4k (or 2*64k) pages */ |
803bf5ec2
|
694 695 696 697 698 699 |
stack_size = vma->vm_end - vma->vm_start; /* * Align this down to a page boundary as expand_stack * will align it up. */ rlim_stack = rlimit(RLIMIT_STACK) & PAGE_MASK; |
b6a2fea39
|
700 |
#ifdef CONFIG_STACK_GROWSUP |
803bf5ec2
|
701 702 703 704 |
if (stack_size + stack_expand > rlim_stack) stack_base = vma->vm_start + rlim_stack; else stack_base = vma->vm_end + stack_expand; |
b6a2fea39
|
705 |
#else |
803bf5ec2
|
706 707 708 709 |
if (stack_size + stack_expand > rlim_stack) stack_base = vma->vm_end - rlim_stack; else stack_base = vma->vm_start - stack_expand; |
b6a2fea39
|
710 |
#endif |
3af9e8592
|
711 |
current->mm->start_stack = bprm->p; |
b6a2fea39
|
712 713 714 715 716 |
ret = expand_stack(vma, stack_base); if (ret) ret = -EFAULT; out_unlock: |
1da177e4c
|
717 |
up_write(&mm->mmap_sem); |
fc63cf237
|
718 |
return ret; |
1da177e4c
|
719 |
} |
1da177e4c
|
720 |
EXPORT_SYMBOL(setup_arg_pages); |
1da177e4c
|
721 |
#endif /* CONFIG_MMU */ |
51f39a1f0
|
722 |
static struct file *do_open_execat(int fd, struct filename *name, int flags) |
1da177e4c
|
723 |
{ |
1da177e4c
|
724 |
struct file *file; |
e56b6a5dd
|
725 |
int err; |
51f39a1f0
|
726 |
struct open_flags open_exec_flags = { |
47c805dc2
|
727 728 |
.open_flag = O_LARGEFILE | O_RDONLY | __FMODE_EXEC, .acc_mode = MAY_EXEC | MAY_OPEN, |
f9652e10c
|
729 730 |
.intent = LOOKUP_OPEN, .lookup_flags = LOOKUP_FOLLOW, |
47c805dc2
|
731 |
}; |
1da177e4c
|
732 |
|
51f39a1f0
|
733 734 735 736 737 738 739 740 |
if ((flags & ~(AT_SYMLINK_NOFOLLOW | AT_EMPTY_PATH)) != 0) return ERR_PTR(-EINVAL); if (flags & AT_SYMLINK_NOFOLLOW) open_exec_flags.lookup_flags &= ~LOOKUP_FOLLOW; if (flags & AT_EMPTY_PATH) open_exec_flags.lookup_flags |= LOOKUP_EMPTY; file = do_filp_open(fd, name, &open_exec_flags); |
6e8341a11
|
741 |
if (IS_ERR(file)) |
e56b6a5dd
|
742 743 744 |
goto out; err = -EACCES; |
496ad9aa8
|
745 |
if (!S_ISREG(file_inode(file)->i_mode)) |
6e8341a11
|
746 |
goto exit; |
e56b6a5dd
|
747 |
|
6e8341a11
|
748 749 |
if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) goto exit; |
e56b6a5dd
|
750 751 |
err = deny_write_access(file); |
6e8341a11
|
752 753 |
if (err) goto exit; |
1da177e4c
|
754 |
|
51f39a1f0
|
755 756 |
if (name->name[0] != '\0') fsnotify_open(file); |
6e8341a11
|
757 |
out: |
e56b6a5dd
|
758 |
return file; |
6e8341a11
|
759 760 |
exit: fput(file); |
e56b6a5dd
|
761 762 |
return ERR_PTR(err); } |
c4ad8f98b
|
763 764 765 766 |
struct file *open_exec(const char *name) { struct filename tmp = { .name = name }; |
51f39a1f0
|
767 |
return do_open_execat(AT_FDCWD, &tmp, 0); |
c4ad8f98b
|
768 |
} |
1da177e4c
|
769 |
EXPORT_SYMBOL(open_exec); |
6777d773a
|
770 771 |
int kernel_read(struct file *file, loff_t offset, char *addr, unsigned long count) |
1da177e4c
|
772 773 774 775 776 777 778 779 780 781 782 783 784 785 |
{ mm_segment_t old_fs; loff_t pos = offset; int result; old_fs = get_fs(); set_fs(get_ds()); /* The cast to a user pointer is valid due to the set_fs() */ result = vfs_read(file, (void __user *)addr, count, &pos); set_fs(old_fs); return result; } EXPORT_SYMBOL(kernel_read); |
3dc20cb28
|
786 787 |
ssize_t read_code(struct file *file, unsigned long addr, loff_t pos, size_t len) { |
ec6955798
|
788 |
ssize_t res = vfs_read(file, (void __user *)addr, len, &pos); |
3dc20cb28
|
789 790 791 792 793 |
if (res > 0) flush_icache_range(addr, addr + len); return res; } EXPORT_SYMBOL(read_code); |
1da177e4c
|
794 795 796 |
static int exec_mmap(struct mm_struct *mm) { struct task_struct *tsk; |
615d6e875
|
797 |
struct mm_struct *old_mm, *active_mm; |
1da177e4c
|
798 799 800 801 802 803 804 |
/* Notify parent that we're no longer interested in the old VM */ tsk = current; old_mm = current->mm; mm_release(tsk, old_mm); if (old_mm) { |
4fe7efdbd
|
805 |
sync_mm_rss(old_mm); |
1da177e4c
|
806 807 808 809 |
/* * Make sure that if there is a core dump in progress * for the old mm, we get out and die instead of going * through with the exec. We must hold mmap_sem around |
999d9fc16
|
810 |
* checking core_state and changing tsk->mm. |
1da177e4c
|
811 812 |
*/ down_read(&old_mm->mmap_sem); |
999d9fc16
|
813 |
if (unlikely(old_mm->core_state)) { |
1da177e4c
|
814 815 816 817 818 819 820 821 822 |
up_read(&old_mm->mmap_sem); return -EINTR; } } task_lock(tsk); active_mm = tsk->active_mm; tsk->mm = mm; tsk->active_mm = mm; activate_mm(active_mm, mm); |
615d6e875
|
823 824 |
tsk->mm->vmacache_seqnum = 0; vmacache_flush(tsk); |
1da177e4c
|
825 |
task_unlock(tsk); |
1da177e4c
|
826 827 |
if (old_mm) { up_read(&old_mm->mmap_sem); |
7dddb12c6
|
828 |
BUG_ON(active_mm != old_mm); |
701085b21
|
829 |
setmax_mm_hiwater_rss(&tsk->signal->maxrss, old_mm); |
31a78f23b
|
830 |
mm_update_next_owner(old_mm); |
1da177e4c
|
831 832 833 834 835 836 837 838 839 840 841 842 843 |
mmput(old_mm); return 0; } mmdrop(active_mm); return 0; } /* * This function makes sure the current process has its own signal table, * so that flush_signal_handlers can later reset the handlers without * disturbing other processes. (Other processes might share the signal * table via the CLONE_SIGHAND option to clone().) */ |
858119e15
|
844 |
static int de_thread(struct task_struct *tsk) |
1da177e4c
|
845 846 |
{ struct signal_struct *sig = tsk->signal; |
b2c903b87
|
847 |
struct sighand_struct *oldsighand = tsk->sighand; |
1da177e4c
|
848 |
spinlock_t *lock = &oldsighand->siglock; |
1da177e4c
|
849 |
|
aafe6c2a2
|
850 |
if (thread_group_empty(tsk)) |
1da177e4c
|
851 852 853 854 |
goto no_thread_group; /* * Kill all other threads in the thread group. |
1da177e4c
|
855 |
*/ |
1da177e4c
|
856 |
spin_lock_irq(lock); |
ed5d2cac1
|
857 |
if (signal_group_exit(sig)) { |
1da177e4c
|
858 859 860 861 862 |
/* * Another group action in progress, just * return so that the signal is processed. */ spin_unlock_irq(lock); |
1da177e4c
|
863 864 |
return -EAGAIN; } |
d344193a0
|
865 |
|
ed5d2cac1
|
866 |
sig->group_exit_task = tsk; |
d344193a0
|
867 868 869 |
sig->notify_count = zap_other_threads(tsk); if (!thread_group_leader(tsk)) sig->notify_count--; |
1da177e4c
|
870 |
|
d344193a0
|
871 |
while (sig->notify_count) { |
d5bbd43d5
|
872 |
__set_current_state(TASK_KILLABLE); |
1da177e4c
|
873 874 |
spin_unlock_irq(lock); schedule(); |
d5bbd43d5
|
875 876 |
if (unlikely(__fatal_signal_pending(tsk))) goto killed; |
1da177e4c
|
877 878 |
spin_lock_irq(lock); } |
1da177e4c
|
879 880 881 882 883 884 885 |
spin_unlock_irq(lock); /* * At this point all other threads have exited, all we have to * do is to wait for the thread group leader to become inactive, * and to assume its PID: */ |
aafe6c2a2
|
886 |
if (!thread_group_leader(tsk)) { |
8187926bd
|
887 |
struct task_struct *leader = tsk->group_leader; |
6db840fa7
|
888 |
|
2800d8d19
|
889 |
sig->notify_count = -1; /* for exit_notify() */ |
6db840fa7
|
890 |
for (;;) { |
e56fb2874
|
891 |
threadgroup_change_begin(tsk); |
6db840fa7
|
892 893 894 |
write_lock_irq(&tasklist_lock); if (likely(leader->exit_state)) break; |
d5bbd43d5
|
895 |
__set_current_state(TASK_KILLABLE); |
6db840fa7
|
896 |
write_unlock_irq(&tasklist_lock); |
e56fb2874
|
897 |
threadgroup_change_end(tsk); |
6db840fa7
|
898 |
schedule(); |
d5bbd43d5
|
899 900 |
if (unlikely(__fatal_signal_pending(tsk))) goto killed; |
6db840fa7
|
901 |
} |
1da177e4c
|
902 |
|
f5e902817
|
903 904 905 906 907 908 909 910 911 912 |
/* * The only record we have of the real-time age of a * process, regardless of execs it's done, is start_time. * All the past CPU time is accumulated in signal_struct * from sister threads now dead. But in this non-leader * exec, nothing survives from the original leader thread, * whose birth marks the true age of this process now. * When we take on its identity by switching to its PID, we * also take its birthdate (always earlier than our own). */ |
aafe6c2a2
|
913 |
tsk->start_time = leader->start_time; |
266b7a021
|
914 |
tsk->real_start_time = leader->real_start_time; |
f5e902817
|
915 |
|
bac0abd61
|
916 917 |
BUG_ON(!same_thread_group(leader, tsk)); BUG_ON(has_group_leader_pid(tsk)); |
1da177e4c
|
918 919 920 921 922 923 |
/* * An exec() starts a new thread group with the * TGID of the previous thread group. Rehash the * two threads with a switched PID, and release * the former thread group leader: */ |
d73d65293
|
924 925 |
/* Become a process group leader with the old leader's pid. |
c18258c6f
|
926 927 |
* The old leader becomes a thread of the this thread group. * Note: The old leader also uses this pid until release_task |
d73d65293
|
928 929 |
* is called. Odd but simple and correct. */ |
aafe6c2a2
|
930 |
tsk->pid = leader->pid; |
3f4185483
|
931 |
change_pid(tsk, PIDTYPE_PID, task_pid(leader)); |
aafe6c2a2
|
932 933 |
transfer_pid(leader, tsk, PIDTYPE_PGID); transfer_pid(leader, tsk, PIDTYPE_SID); |
9cd80bbb0
|
934 |
|
aafe6c2a2
|
935 |
list_replace_rcu(&leader->tasks, &tsk->tasks); |
9cd80bbb0
|
936 |
list_replace_init(&leader->sibling, &tsk->sibling); |
1da177e4c
|
937 |
|
aafe6c2a2
|
938 939 |
tsk->group_leader = tsk; leader->group_leader = tsk; |
de12a7878
|
940 |
|
aafe6c2a2
|
941 |
tsk->exit_signal = SIGCHLD; |
087806b12
|
942 |
leader->exit_signal = -1; |
962b564cf
|
943 944 945 |
BUG_ON(leader->exit_state != EXIT_ZOMBIE); leader->exit_state = EXIT_DEAD; |
eac1b5e57
|
946 947 948 949 950 951 952 953 |
/* * We are going to release_task()->ptrace_unlink() silently, * the tracer can sleep in do_wait(). EXIT_DEAD guarantees * the tracer wont't block again waiting for this thread. */ if (unlikely(leader->ptrace)) __wake_up_parent(leader, leader->parent); |
1da177e4c
|
954 |
write_unlock_irq(&tasklist_lock); |
e56fb2874
|
955 |
threadgroup_change_end(tsk); |
8187926bd
|
956 957 |
release_task(leader); |
ed5d2cac1
|
958 |
} |
1da177e4c
|
959 |
|
6db840fa7
|
960 961 |
sig->group_exit_task = NULL; sig->notify_count = 0; |
1da177e4c
|
962 963 |
no_thread_group: |
e63682534
|
964 965 |
/* we have changed execution domain */ tsk->exit_signal = SIGCHLD; |
1da177e4c
|
966 |
exit_itimers(sig); |
cbaffba12
|
967 |
flush_itimer_signals(); |
329f7dba5
|
968 |
|
b2c903b87
|
969 970 |
if (atomic_read(&oldsighand->count) != 1) { struct sighand_struct *newsighand; |
1da177e4c
|
971 |
/* |
b2c903b87
|
972 973 |
* This ->sighand is shared with the CLONE_SIGHAND * but not CLONE_THREAD task, switch to the new one. |
1da177e4c
|
974 |
*/ |
b2c903b87
|
975 976 977 |
newsighand = kmem_cache_alloc(sighand_cachep, GFP_KERNEL); if (!newsighand) return -ENOMEM; |
1da177e4c
|
978 979 980 981 982 983 |
atomic_set(&newsighand->count, 1); memcpy(newsighand->action, oldsighand->action, sizeof(newsighand->action)); write_lock_irq(&tasklist_lock); spin_lock(&oldsighand->siglock); |
aafe6c2a2
|
984 |
rcu_assign_pointer(tsk->sighand, newsighand); |
1da177e4c
|
985 986 |
spin_unlock(&oldsighand->siglock); write_unlock_irq(&tasklist_lock); |
fba2afaae
|
987 |
__cleanup_sighand(oldsighand); |
1da177e4c
|
988 |
} |
aafe6c2a2
|
989 |
BUG_ON(!thread_group_leader(tsk)); |
1da177e4c
|
990 |
return 0; |
d5bbd43d5
|
991 992 993 994 995 996 997 998 |
killed: /* protects against exit_notify() and __exit_signal() */ read_lock(&tasklist_lock); sig->group_exit_task = NULL; sig->notify_count = 0; read_unlock(&tasklist_lock); return -EAGAIN; |
1da177e4c
|
999 |
} |
0840a90d9
|
1000 |
|
59714d65d
|
1001 |
char *get_task_comm(char *buf, struct task_struct *tsk) |
1da177e4c
|
1002 1003 1004 1005 1006 |
{ /* buf must be at least sizeof(tsk->comm) in size */ task_lock(tsk); strncpy(buf, tsk->comm, sizeof(tsk->comm)); task_unlock(tsk); |
59714d65d
|
1007 |
return buf; |
1da177e4c
|
1008 |
} |
7d74f492e
|
1009 |
EXPORT_SYMBOL_GPL(get_task_comm); |
1da177e4c
|
1010 |
|
6a6d27de3
|
1011 1012 1013 1014 |
/* * These functions flushes out all traces of the currently running executable * so that a new one can be started */ |
82b897782
|
1015 |
void __set_task_comm(struct task_struct *tsk, const char *buf, bool exec) |
1da177e4c
|
1016 1017 |
{ task_lock(tsk); |
43d2b1132
|
1018 |
trace_task_rename(tsk, buf); |
1da177e4c
|
1019 1020 |
strlcpy(tsk->comm, buf, sizeof(tsk->comm)); task_unlock(tsk); |
82b897782
|
1021 |
perf_event_comm(tsk, exec); |
1da177e4c
|
1022 1023 1024 1025 |
} int flush_old_exec(struct linux_binprm * bprm) { |
221af7f87
|
1026 |
int retval; |
1da177e4c
|
1027 1028 1029 1030 1031 1032 1033 1034 |
/* * Make sure we have a private signal table and that * we are unassociated from the previous thread group. */ retval = de_thread(current); if (retval) goto out; |
925d1c401
|
1035 |
set_mm_exe_file(bprm->mm, bprm->file); |
1da177e4c
|
1036 |
/* |
1da177e4c
|
1037 1038 |
* Release all of the old mmap stuff */ |
3c77f8457
|
1039 |
acct_arg_size(bprm, 0); |
1da177e4c
|
1040 1041 |
retval = exec_mmap(bprm->mm); if (retval) |
fd8328be8
|
1042 |
goto out; |
1da177e4c
|
1043 1044 |
bprm->mm = NULL; /* We're using it now */ |
7ab02af42
|
1045 |
|
dac853ae8
|
1046 |
set_fs(USER_DS); |
b88fae644
|
1047 1048 |
current->flags &= ~(PF_RANDOMIZE | PF_FORKNOEXEC | PF_KTHREAD | PF_NOFREEZE | PF_NO_SETAFFINITY); |
7ab02af42
|
1049 1050 |
flush_thread(); current->personality &= ~bprm->per_clear; |
221af7f87
|
1051 1052 1053 1054 1055 1056 |
return 0; out: return retval; } EXPORT_SYMBOL(flush_old_exec); |
1b5d783c9
|
1057 1058 |
void would_dump(struct linux_binprm *bprm, struct file *file) { |
496ad9aa8
|
1059 |
if (inode_permission(file_inode(file), MAY_READ) < 0) |
1b5d783c9
|
1060 1061 1062 |
bprm->interp_flags |= BINPRM_FLAGS_ENFORCE_NONDUMP; } EXPORT_SYMBOL(would_dump); |
221af7f87
|
1063 1064 |
void setup_new_exec(struct linux_binprm * bprm) { |
221af7f87
|
1065 |
arch_pick_mmap_layout(current->mm); |
1da177e4c
|
1066 1067 |
/* This is the point of no return */ |
1da177e4c
|
1068 |
current->sas_ss_sp = current->sas_ss_size = 0; |
8e96e3b7b
|
1069 |
if (uid_eq(current_euid(), current_uid()) && gid_eq(current_egid(), current_gid())) |
e579d2c25
|
1070 |
set_dumpable(current->mm, SUID_DUMP_USER); |
d6e711448
|
1071 |
else |
6c5d52382
|
1072 |
set_dumpable(current->mm, suid_dumpable); |
d6e711448
|
1073 |
|
e041e328c
|
1074 |
perf_event_exec(); |
82b897782
|
1075 |
__set_task_comm(current, kbasename(bprm->filename), true); |
1da177e4c
|
1076 |
|
0551fbd29
|
1077 1078 1079 1080 1081 |
/* Set the new mm task size. We have to do that late because it may * depend on TIF_32BIT which is only updated in flush_thread() on * some architectures like powerpc */ current->mm->task_size = TASK_SIZE; |
a6f76f23d
|
1082 |
/* install the new credentials */ |
8e96e3b7b
|
1083 1084 |
if (!uid_eq(bprm->cred->uid, current_euid()) || !gid_eq(bprm->cred->gid, current_egid())) { |
d2d56c5f5
|
1085 |
current->pdeath_signal = 0; |
1b5d783c9
|
1086 1087 1088 1089 |
} else { would_dump(bprm, bprm->file); if (bprm->interp_flags & BINPRM_FLAGS_ENFORCE_NONDUMP) set_dumpable(current->mm, suid_dumpable); |
1da177e4c
|
1090 1091 1092 1093 |
} /* An exec changes our domain. We are no longer part of the thread group */ |
1da177e4c
|
1094 |
current->self_exec_id++; |
1da177e4c
|
1095 |
flush_signal_handlers(current, 0); |
6a6d27de3
|
1096 |
do_close_on_exec(current->files); |
1da177e4c
|
1097 |
} |
221af7f87
|
1098 |
EXPORT_SYMBOL(setup_new_exec); |
1da177e4c
|
1099 |
|
a6f76f23d
|
1100 |
/* |
a2a8474c3
|
1101 1102 1103 1104 1105 1106 1107 |
* Prepare credentials and lock ->cred_guard_mutex. * install_exec_creds() commits the new creds and drops the lock. * Or, if exec fails before, free_bprm() should release ->cred and * and unlock. */ int prepare_bprm_creds(struct linux_binprm *bprm) { |
9b1bf12d5
|
1108 |
if (mutex_lock_interruptible(¤t->signal->cred_guard_mutex)) |
a2a8474c3
|
1109 1110 1111 1112 1113 |
return -ERESTARTNOINTR; bprm->cred = prepare_exec_creds(); if (likely(bprm->cred)) return 0; |
9b1bf12d5
|
1114 |
mutex_unlock(¤t->signal->cred_guard_mutex); |
a2a8474c3
|
1115 1116 |
return -ENOMEM; } |
c4ad8f98b
|
1117 |
static void free_bprm(struct linux_binprm *bprm) |
a2a8474c3
|
1118 1119 1120 |
{ free_arg_pages(bprm); if (bprm->cred) { |
9b1bf12d5
|
1121 |
mutex_unlock(¤t->signal->cred_guard_mutex); |
a2a8474c3
|
1122 1123 |
abort_creds(bprm->cred); } |
63e46b95e
|
1124 1125 1126 1127 |
if (bprm->file) { allow_write_access(bprm->file); fput(bprm->file); } |
b66c59840
|
1128 1129 1130 |
/* If a binfmt changed the interp, free it. */ if (bprm->interp != bprm->filename) kfree(bprm->interp); |
a2a8474c3
|
1131 1132 |
kfree(bprm); } |
b66c59840
|
1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 |
int bprm_change_interp(char *interp, struct linux_binprm *bprm) { /* If a binfmt changed the interp, free it first. */ if (bprm->interp != bprm->filename) kfree(bprm->interp); bprm->interp = kstrdup(interp, GFP_KERNEL); if (!bprm->interp) return -ENOMEM; return 0; } EXPORT_SYMBOL(bprm_change_interp); |
a2a8474c3
|
1144 |
/* |
a6f76f23d
|
1145 1146 1147 1148 1149 1150 1151 1152 |
* install the new credentials for this executable */ void install_exec_creds(struct linux_binprm *bprm) { security_bprm_committing_creds(bprm); commit_creds(bprm->cred); bprm->cred = NULL; |
2976b10f0
|
1153 1154 1155 1156 1157 1158 1159 1160 1161 |
/* * Disable monitoring for regular users * when executing setuid binaries. Must * wait until new credentials are committed * by commit_creds() above */ if (get_dumpable(current->mm) != SUID_DUMP_USER) perf_event_exit_task(current); |
a2a8474c3
|
1162 1163 |
/* * cred_guard_mutex must be held at least to this point to prevent |
a6f76f23d
|
1164 |
* ptrace_attach() from altering our determination of the task's |
a2a8474c3
|
1165 1166 |
* credentials; any time after this it may be unlocked. */ |
a6f76f23d
|
1167 |
security_bprm_committed_creds(bprm); |
9b1bf12d5
|
1168 |
mutex_unlock(¤t->signal->cred_guard_mutex); |
a6f76f23d
|
1169 1170 1171 1172 1173 |
} EXPORT_SYMBOL(install_exec_creds); /* * determine how safe it is to execute the proposed program |
9b1bf12d5
|
1174 |
* - the caller must hold ->cred_guard_mutex to protect against |
c2e1f2e30
|
1175 |
* PTRACE_ATTACH or seccomp thread-sync |
a6f76f23d
|
1176 |
*/ |
9e00cdb09
|
1177 |
static void check_unsafe_exec(struct linux_binprm *bprm) |
a6f76f23d
|
1178 |
{ |
0bf2f3aec
|
1179 |
struct task_struct *p = current, *t; |
f1191b50e
|
1180 |
unsigned n_fs; |
a6f76f23d
|
1181 |
|
4b9d33e6d
|
1182 1183 1184 1185 1186 1187 |
if (p->ptrace) { if (p->ptrace & PT_PTRACE_CAP) bprm->unsafe |= LSM_UNSAFE_PTRACE_CAP; else bprm->unsafe |= LSM_UNSAFE_PTRACE; } |
a6f76f23d
|
1188 |
|
259e5e6c7
|
1189 1190 1191 1192 |
/* * This isn't strictly necessary, but it makes it harder for LSMs to * mess up. */ |
1d4457f99
|
1193 |
if (task_no_new_privs(current)) |
259e5e6c7
|
1194 |
bprm->unsafe |= LSM_UNSAFE_NO_NEW_PRIVS; |
83f62a2ea
|
1195 |
t = p; |
0bf2f3aec
|
1196 |
n_fs = 1; |
2a4419b5b
|
1197 |
spin_lock(&p->fs->lock); |
437f7fdb6
|
1198 |
rcu_read_lock(); |
83f62a2ea
|
1199 |
while_each_thread(p, t) { |
0bf2f3aec
|
1200 1201 |
if (t->fs == p->fs) n_fs++; |
0bf2f3aec
|
1202 |
} |
437f7fdb6
|
1203 |
rcu_read_unlock(); |
0bf2f3aec
|
1204 |
|
9e00cdb09
|
1205 |
if (p->fs->users > n_fs) |
a6f76f23d
|
1206 |
bprm->unsafe |= LSM_UNSAFE_SHARE; |
9e00cdb09
|
1207 1208 |
else p->fs->in_exec = 1; |
2a4419b5b
|
1209 |
spin_unlock(&p->fs->lock); |
a6f76f23d
|
1210 |
} |
9e00cdb09
|
1211 1212 |
/* * Fill the binprm structure from the inode. |
1da177e4c
|
1213 |
* Check permissions, then read the first 128 (BINPRM_BUF_SIZE) bytes |
a6f76f23d
|
1214 1215 |
* * This may be called multiple times for binary chains (scripts for example). |
1da177e4c
|
1216 1217 1218 |
*/ int prepare_binprm(struct linux_binprm *bprm) { |
72c2d5319
|
1219 1220 |
struct inode *inode = file_inode(bprm->file); umode_t mode = inode->i_mode; |
1da177e4c
|
1221 |
int retval; |
1da177e4c
|
1222 |
|
a6f76f23d
|
1223 1224 1225 |
/* clear any previous set[ug]id data from a previous binary */ bprm->cred->euid = current_euid(); bprm->cred->egid = current_egid(); |
1da177e4c
|
1226 |
|
259e5e6c7
|
1227 |
if (!(bprm->file->f_path.mnt->mnt_flags & MNT_NOSUID) && |
1d4457f99
|
1228 |
!task_no_new_privs(current) && |
3cdf5b45f
|
1229 1230 |
kuid_has_mapping(bprm->cred->user_ns, inode->i_uid) && kgid_has_mapping(bprm->cred->user_ns, inode->i_gid)) { |
1da177e4c
|
1231 1232 |
/* Set-uid? */ if (mode & S_ISUID) { |
a6f76f23d
|
1233 1234 |
bprm->per_clear |= PER_CLEAR_ON_SETID; bprm->cred->euid = inode->i_uid; |
1da177e4c
|
1235 1236 1237 1238 1239 1240 1241 1242 1243 |
} /* Set-gid? */ /* * If setgid is set but no group execute bit then this * is a candidate for mandatory locking, not a setgid * executable. */ if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) { |
a6f76f23d
|
1244 1245 |
bprm->per_clear |= PER_CLEAR_ON_SETID; bprm->cred->egid = inode->i_gid; |
1da177e4c
|
1246 1247 1248 1249 |
} } /* fill in binprm security blob */ |
a6f76f23d
|
1250 |
retval = security_bprm_set_creds(bprm); |
1da177e4c
|
1251 1252 |
if (retval) return retval; |
a6f76f23d
|
1253 |
bprm->cred_prepared = 1; |
1da177e4c
|
1254 |
|
a6f76f23d
|
1255 1256 |
memset(bprm->buf, 0, BINPRM_BUF_SIZE); return kernel_read(bprm->file, 0, bprm->buf, BINPRM_BUF_SIZE); |
1da177e4c
|
1257 1258 1259 |
} EXPORT_SYMBOL(prepare_binprm); |
4fc75ff48
|
1260 1261 1262 1263 1264 |
/* * Arguments are '\0' separated strings found at the location bprm->p * points to; chop off the first by relocating brpm->p to right after * the first '\0' encountered. */ |
b6a2fea39
|
1265 |
int remove_arg_zero(struct linux_binprm *bprm) |
1da177e4c
|
1266 |
{ |
b6a2fea39
|
1267 1268 1269 1270 |
int ret = 0; unsigned long offset; char *kaddr; struct page *page; |
4fc75ff48
|
1271 |
|
b6a2fea39
|
1272 1273 |
if (!bprm->argc) return 0; |
1da177e4c
|
1274 |
|
b6a2fea39
|
1275 1276 1277 1278 1279 1280 1281 |
do { offset = bprm->p & ~PAGE_MASK; page = get_arg_page(bprm, bprm->p, 0); if (!page) { ret = -EFAULT; goto out; } |
e8e3c3d66
|
1282 |
kaddr = kmap_atomic(page); |
4fc75ff48
|
1283 |
|
b6a2fea39
|
1284 1285 1286 |
for (; offset < PAGE_SIZE && kaddr[offset]; offset++, bprm->p++) ; |
4fc75ff48
|
1287 |
|
e8e3c3d66
|
1288 |
kunmap_atomic(kaddr); |
b6a2fea39
|
1289 |
put_arg_page(page); |
4fc75ff48
|
1290 |
|
b6a2fea39
|
1291 1292 1293 |
if (offset == PAGE_SIZE) free_arg_page(bprm, (bprm->p >> PAGE_SHIFT) - 1); } while (offset == PAGE_SIZE); |
4fc75ff48
|
1294 |
|
b6a2fea39
|
1295 1296 1297 |
bprm->p++; bprm->argc--; ret = 0; |
4fc75ff48
|
1298 |
|
b6a2fea39
|
1299 1300 |
out: return ret; |
1da177e4c
|
1301 |
} |
1da177e4c
|
1302 |
EXPORT_SYMBOL(remove_arg_zero); |
cb7b6b1cb
|
1303 1304 |
#define printable(c) (((c)=='\t') || ((c)==' ') || (0x20<=(c) && (c)<=0x7e)) |
1da177e4c
|
1305 1306 1307 |
/* * cycle the list of binary formats handler, until one recognizes the image */ |
3c456bfc4
|
1308 |
int search_binary_handler(struct linux_binprm *bprm) |
1da177e4c
|
1309 |
{ |
cb7b6b1cb
|
1310 |
bool need_retry = IS_ENABLED(CONFIG_MODULES); |
1da177e4c
|
1311 |
struct linux_binfmt *fmt; |
cb7b6b1cb
|
1312 |
int retval; |
1da177e4c
|
1313 |
|
d74026986
|
1314 |
/* This allows 4 levels of binfmt rewrites before failing hard. */ |
131b2f9f1
|
1315 |
if (bprm->recursion_depth > 5) |
d74026986
|
1316 |
return -ELOOP; |
1da177e4c
|
1317 1318 1319 |
retval = security_bprm_check(bprm); if (retval) return retval; |
1da177e4c
|
1320 |
retval = -ENOENT; |
cb7b6b1cb
|
1321 1322 1323 1324 1325 1326 1327 1328 |
retry: read_lock(&binfmt_lock); list_for_each_entry(fmt, &formats, lh) { if (!try_module_get(fmt->module)) continue; read_unlock(&binfmt_lock); bprm->recursion_depth++; retval = fmt->load_binary(bprm); |
19d860a14
|
1329 1330 |
read_lock(&binfmt_lock); put_binfmt(fmt); |
cb7b6b1cb
|
1331 |
bprm->recursion_depth--; |
19d860a14
|
1332 1333 1334 1335 1336 1337 1338 1339 |
if (retval < 0 && !bprm->mm) { /* we got to flush_old_exec() and failed after it */ read_unlock(&binfmt_lock); force_sigsegv(SIGSEGV, current); return retval; } if (retval != -ENOEXEC || !bprm->file) { read_unlock(&binfmt_lock); |
cb7b6b1cb
|
1340 |
return retval; |
1da177e4c
|
1341 |
} |
1da177e4c
|
1342 |
} |
cb7b6b1cb
|
1343 |
read_unlock(&binfmt_lock); |
19d860a14
|
1344 |
if (need_retry) { |
cb7b6b1cb
|
1345 1346 1347 |
if (printable(bprm->buf[0]) && printable(bprm->buf[1]) && printable(bprm->buf[2]) && printable(bprm->buf[3])) return retval; |
4e0621a07
|
1348 1349 |
if (request_module("binfmt-%04x", *(ushort *)(bprm->buf + 2)) < 0) return retval; |
cb7b6b1cb
|
1350 1351 1352 |
need_retry = false; goto retry; } |
1da177e4c
|
1353 1354 |
return retval; } |
1da177e4c
|
1355 |
EXPORT_SYMBOL(search_binary_handler); |
5d1baf3b6
|
1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 |
static int exec_binprm(struct linux_binprm *bprm) { pid_t old_pid, old_vpid; int ret; /* Need to fetch pid before load_binary changes it */ old_pid = current->pid; rcu_read_lock(); old_vpid = task_pid_nr_ns(current, task_active_pid_ns(current->parent)); rcu_read_unlock(); ret = search_binary_handler(bprm); if (ret >= 0) { |
3eaded86a
|
1369 |
audit_bprm(bprm); |
5d1baf3b6
|
1370 1371 |
trace_sched_process_exec(current, old_pid, bprm); ptrace_event(PTRACE_EVENT_EXEC, old_vpid); |
9beb266f2
|
1372 |
proc_exec_connector(current); |
5d1baf3b6
|
1373 1374 1375 1376 |
} return ret; } |
1da177e4c
|
1377 1378 1379 |
/* * sys_execve() executes a new program. */ |
51f39a1f0
|
1380 1381 1382 1383 |
static int do_execveat_common(int fd, struct filename *filename, struct user_arg_ptr argv, struct user_arg_ptr envp, int flags) |
1da177e4c
|
1384 |
{ |
51f39a1f0
|
1385 |
char *pathbuf = NULL; |
1da177e4c
|
1386 1387 |
struct linux_binprm *bprm; struct file *file; |
3b1253880
|
1388 |
struct files_struct *displaced; |
1da177e4c
|
1389 |
int retval; |
72fa59970
|
1390 |
|
c4ad8f98b
|
1391 1392 |
if (IS_ERR(filename)) return PTR_ERR(filename); |
72fa59970
|
1393 1394 1395 1396 1397 1398 1399 |
/* * We move the actual failure in case of RLIMIT_NPROC excess from * set*uid() to execve() because too many poorly written programs * don't check setuid() return code. Here we additionally recheck * whether NPROC limit is still exceeded. */ if ((current->flags & PF_NPROC_EXCEEDED) && |
bd9d43f47
|
1400 |
atomic_read(¤t_user()->processes) > rlimit(RLIMIT_NPROC)) { |
72fa59970
|
1401 1402 1403 1404 1405 1406 1407 |
retval = -EAGAIN; goto out_ret; } /* We're below the limit (still or again), so we don't want to make * further execve() calls fail. */ current->flags &= ~PF_NPROC_EXCEEDED; |
1da177e4c
|
1408 |
|
3b1253880
|
1409 |
retval = unshare_files(&displaced); |
fd8328be8
|
1410 1411 |
if (retval) goto out_ret; |
1da177e4c
|
1412 |
retval = -ENOMEM; |
11b0b5abb
|
1413 |
bprm = kzalloc(sizeof(*bprm), GFP_KERNEL); |
1da177e4c
|
1414 |
if (!bprm) |
fd8328be8
|
1415 |
goto out_files; |
1da177e4c
|
1416 |
|
a2a8474c3
|
1417 1418 |
retval = prepare_bprm_creds(bprm); if (retval) |
a6f76f23d
|
1419 |
goto out_free; |
498052bba
|
1420 |
|
9e00cdb09
|
1421 |
check_unsafe_exec(bprm); |
a2a8474c3
|
1422 |
current->in_execve = 1; |
a6f76f23d
|
1423 |
|
51f39a1f0
|
1424 |
file = do_open_execat(fd, filename, flags); |
1da177e4c
|
1425 1426 |
retval = PTR_ERR(file); if (IS_ERR(file)) |
498052bba
|
1427 |
goto out_unmark; |
1da177e4c
|
1428 1429 |
sched_exec(); |
1da177e4c
|
1430 |
bprm->file = file; |
51f39a1f0
|
1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 |
if (fd == AT_FDCWD || filename->name[0] == '/') { bprm->filename = filename->name; } else { if (filename->name[0] == '\0') pathbuf = kasprintf(GFP_TEMPORARY, "/dev/fd/%d", fd); else pathbuf = kasprintf(GFP_TEMPORARY, "/dev/fd/%d/%s", fd, filename->name); if (!pathbuf) { retval = -ENOMEM; goto out_unmark; } /* * Record that a name derived from an O_CLOEXEC fd will be * inaccessible after exec. Relies on having exclusive access to * current->files (due to unshare_files above). */ if (close_on_exec(fd, rcu_dereference_raw(current->files->fdt))) bprm->interp_flags |= BINPRM_FLAGS_PATH_INACCESSIBLE; bprm->filename = pathbuf; } bprm->interp = bprm->filename; |
1da177e4c
|
1453 |
|
b6a2fea39
|
1454 1455 |
retval = bprm_mm_init(bprm); if (retval) |
63e46b95e
|
1456 |
goto out_unmark; |
1da177e4c
|
1457 |
|
b6a2fea39
|
1458 |
bprm->argc = count(argv, MAX_ARG_STRINGS); |
1da177e4c
|
1459 |
if ((retval = bprm->argc) < 0) |
a6f76f23d
|
1460 |
goto out; |
1da177e4c
|
1461 |
|
b6a2fea39
|
1462 |
bprm->envc = count(envp, MAX_ARG_STRINGS); |
1da177e4c
|
1463 |
if ((retval = bprm->envc) < 0) |
1da177e4c
|
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 |
goto out; retval = prepare_binprm(bprm); if (retval < 0) goto out; retval = copy_strings_kernel(1, &bprm->filename, bprm); if (retval < 0) goto out; bprm->exec = bprm->p; retval = copy_strings(bprm->envc, envp, bprm); if (retval < 0) goto out; retval = copy_strings(bprm->argc, argv, bprm); if (retval < 0) goto out; |
5d1baf3b6
|
1482 |
retval = exec_binprm(bprm); |
a6f76f23d
|
1483 1484 |
if (retval < 0) goto out; |
1da177e4c
|
1485 |
|
a6f76f23d
|
1486 |
/* execve succeeded */ |
498052bba
|
1487 |
current->fs->in_exec = 0; |
f9ce1f1cd
|
1488 |
current->in_execve = 0; |
a6f76f23d
|
1489 |
acct_update_integrals(current); |
82727018b
|
1490 |
task_numa_free(current); |
a6f76f23d
|
1491 |
free_bprm(bprm); |
51f39a1f0
|
1492 |
kfree(pathbuf); |
c4ad8f98b
|
1493 |
putname(filename); |
a6f76f23d
|
1494 1495 1496 |
if (displaced) put_files_struct(displaced); return retval; |
1da177e4c
|
1497 |
|
a6f76f23d
|
1498 |
out: |
3c77f8457
|
1499 1500 1501 1502 |
if (bprm->mm) { acct_arg_size(bprm, 0); mmput(bprm->mm); } |
1da177e4c
|
1503 |
|
498052bba
|
1504 |
out_unmark: |
9e00cdb09
|
1505 |
current->fs->in_exec = 0; |
f9ce1f1cd
|
1506 |
current->in_execve = 0; |
a6f76f23d
|
1507 1508 |
out_free: |
08a6fac1c
|
1509 |
free_bprm(bprm); |
51f39a1f0
|
1510 |
kfree(pathbuf); |
1da177e4c
|
1511 |
|
fd8328be8
|
1512 |
out_files: |
3b1253880
|
1513 1514 |
if (displaced) reset_files_struct(displaced); |
1da177e4c
|
1515 |
out_ret: |
c4ad8f98b
|
1516 |
putname(filename); |
1da177e4c
|
1517 1518 |
return retval; } |
c4ad8f98b
|
1519 |
int do_execve(struct filename *filename, |
ba2d01629
|
1520 |
const char __user *const __user *__argv, |
da3d4c5fa
|
1521 |
const char __user *const __user *__envp) |
ba2d01629
|
1522 |
{ |
0e028465d
|
1523 1524 |
struct user_arg_ptr argv = { .ptr.native = __argv }; struct user_arg_ptr envp = { .ptr.native = __envp }; |
51f39a1f0
|
1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 |
return do_execveat_common(AT_FDCWD, filename, argv, envp, 0); } int do_execveat(int fd, struct filename *filename, const char __user *const __user *__argv, const char __user *const __user *__envp, int flags) { struct user_arg_ptr argv = { .ptr.native = __argv }; struct user_arg_ptr envp = { .ptr.native = __envp }; return do_execveat_common(fd, filename, argv, envp, flags); |
0e028465d
|
1537 1538 1539 |
} #ifdef CONFIG_COMPAT |
c4ad8f98b
|
1540 |
static int compat_do_execve(struct filename *filename, |
38b983b34
|
1541 |
const compat_uptr_t __user *__argv, |
d03d26e58
|
1542 |
const compat_uptr_t __user *__envp) |
0e028465d
|
1543 1544 1545 1546 1547 1548 1549 1550 1551 |
{ struct user_arg_ptr argv = { .is_compat = true, .ptr.compat = __argv, }; struct user_arg_ptr envp = { .is_compat = true, .ptr.compat = __envp, }; |
51f39a1f0
|
1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 |
return do_execveat_common(AT_FDCWD, filename, argv, envp, 0); } static int compat_do_execveat(int fd, struct filename *filename, const compat_uptr_t __user *__argv, const compat_uptr_t __user *__envp, int flags) { struct user_arg_ptr argv = { .is_compat = true, .ptr.compat = __argv, }; struct user_arg_ptr envp = { .is_compat = true, .ptr.compat = __envp, }; return do_execveat_common(fd, filename, argv, envp, flags); |
ba2d01629
|
1569 |
} |
0e028465d
|
1570 |
#endif |
ba2d01629
|
1571 |
|
964ee7df9
|
1572 |
void set_binfmt(struct linux_binfmt *new) |
1da177e4c
|
1573 |
{ |
801460d0c
|
1574 1575 1576 1577 |
struct mm_struct *mm = current->mm; if (mm->binfmt) module_put(mm->binfmt->module); |
1da177e4c
|
1578 |
|
801460d0c
|
1579 |
mm->binfmt = new; |
964ee7df9
|
1580 1581 |
if (new) __module_get(new->module); |
1da177e4c
|
1582 |
} |
1da177e4c
|
1583 |
EXPORT_SYMBOL(set_binfmt); |
6c5d52382
|
1584 |
/* |
7288e1187
|
1585 |
* set_dumpable stores three-value SUID_DUMP_* into mm->flags. |
6c5d52382
|
1586 1587 1588 |
*/ void set_dumpable(struct mm_struct *mm, int value) { |
abacd2fe3
|
1589 |
unsigned long old, new; |
7288e1187
|
1590 1591 |
if (WARN_ON((unsigned)value > SUID_DUMP_ROOT)) return; |
abacd2fe3
|
1592 1593 |
do { old = ACCESS_ONCE(mm->flags); |
7288e1187
|
1594 |
new = (old & ~MMF_DUMPABLE_MASK) | value; |
abacd2fe3
|
1595 |
} while (cmpxchg(&mm->flags, old, new) != old); |
6c5d52382
|
1596 |
} |
6c5d52382
|
1597 |
|
38b983b34
|
1598 1599 1600 1601 1602 |
SYSCALL_DEFINE3(execve, const char __user *, filename, const char __user *const __user *, argv, const char __user *const __user *, envp) { |
c4ad8f98b
|
1603 |
return do_execve(getname(filename), argv, envp); |
38b983b34
|
1604 |
} |
51f39a1f0
|
1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 |
SYSCALL_DEFINE5(execveat, int, fd, const char __user *, filename, const char __user *const __user *, argv, const char __user *const __user *, envp, int, flags) { int lookup_flags = (flags & AT_EMPTY_PATH) ? LOOKUP_EMPTY : 0; return do_execveat(fd, getname_flags(filename, lookup_flags, NULL), argv, envp, flags); } |
38b983b34
|
1618 |
#ifdef CONFIG_COMPAT |
625b1d7e8
|
1619 1620 1621 |
COMPAT_SYSCALL_DEFINE3(execve, const char __user *, filename, const compat_uptr_t __user *, argv, const compat_uptr_t __user *, envp) |
38b983b34
|
1622 |
{ |
c4ad8f98b
|
1623 |
return compat_do_execve(getname(filename), argv, envp); |
38b983b34
|
1624 |
} |
51f39a1f0
|
1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 |
COMPAT_SYSCALL_DEFINE5(execveat, int, fd, const char __user *, filename, const compat_uptr_t __user *, argv, const compat_uptr_t __user *, envp, int, flags) { int lookup_flags = (flags & AT_EMPTY_PATH) ? LOOKUP_EMPTY : 0; return compat_do_execveat(fd, getname_flags(filename, lookup_flags, NULL), argv, envp, flags); } |
38b983b34
|
1638 |
#endif |