projects / GitHub / MotorolaMobilityLLC / kernel-slsi.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge 4.14.10 into android-4.14
[GitHub/MotorolaMobilityLLC/kernel-slsi.git] / kernel / sys.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * linux/kernel/sys.c
4 *
5 * Copyright (C) 1991, 1992 Linus Torvalds
6 */
7
8 #include <linux/export.h>
9 #include <linux/mm.h>
10 #include <linux/utsname.h>
11 #include <linux/mman.h>
12 #include <linux/reboot.h>
13 #include <linux/prctl.h>
14 #include <linux/highuid.h>
15 #include <linux/fs.h>
16 #include <linux/kmod.h>
17 #include <linux/perf_event.h>
18 #include <linux/resource.h>
19 #include <linux/kernel.h>
20 #include <linux/workqueue.h>
21 #include <linux/capability.h>
22 #include <linux/device.h>
23 #include <linux/key.h>
24 #include <linux/times.h>
25 #include <linux/posix-timers.h>
26 #include <linux/security.h>
27 #include <linux/dcookies.h>
28 #include <linux/suspend.h>
29 #include <linux/tty.h>
30 #include <linux/signal.h>
31 #include <linux/cn_proc.h>
32 #include <linux/getcpu.h>
33 #include <linux/task_io_accounting_ops.h>
34 #include <linux/seccomp.h>
35 #include <linux/cpu.h>
36 #include <linux/personality.h>
37 #include <linux/ptrace.h>
38 #include <linux/fs_struct.h>
39 #include <linux/file.h>
40 #include <linux/mount.h>
41 #include <linux/gfp.h>
42 #include <linux/syscore_ops.h>
43 #include <linux/version.h>
44 #include <linux/ctype.h>
45 #include <linux/mm.h>
46 #include <linux/mempolicy.h>
47
48 #include <linux/compat.h>
49 #include <linux/syscalls.h>
50 #include <linux/kprobes.h>
51 #include <linux/user_namespace.h>
52 #include <linux/binfmts.h>
53
54 #include <linux/sched.h>
55 #include <linux/sched/autogroup.h>
56 #include <linux/sched/loadavg.h>
57 #include <linux/sched/stat.h>
58 #include <linux/sched/mm.h>
59 #include <linux/sched/coredump.h>
60 #include <linux/sched/task.h>
61 #include <linux/sched/cputime.h>
62 #include <linux/rcupdate.h>
63 #include <linux/uidgid.h>
64 #include <linux/cred.h>
65
66 #include <linux/kmsg_dump.h>
67 /* Move somewhere else to avoid recompiling? */
68 #include <generated/utsrelease.h>
69
70 #include <linux/uaccess.h>
71 #include <asm/io.h>
72 #include <asm/unistd.h>
73
74 #ifndef SET_UNALIGN_CTL
75 # define SET_UNALIGN_CTL(a, b) (-EINVAL)
76 #endif
77 #ifndef GET_UNALIGN_CTL
78 # define GET_UNALIGN_CTL(a, b) (-EINVAL)
79 #endif
80 #ifndef SET_FPEMU_CTL
81 # define SET_FPEMU_CTL(a, b) (-EINVAL)
82 #endif
83 #ifndef GET_FPEMU_CTL
84 # define GET_FPEMU_CTL(a, b) (-EINVAL)
85 #endif
86 #ifndef SET_FPEXC_CTL
87 # define SET_FPEXC_CTL(a, b) (-EINVAL)
88 #endif
89 #ifndef GET_FPEXC_CTL
90 # define GET_FPEXC_CTL(a, b) (-EINVAL)
91 #endif
92 #ifndef GET_ENDIAN
93 # define GET_ENDIAN(a, b) (-EINVAL)
94 #endif
95 #ifndef SET_ENDIAN
96 # define SET_ENDIAN(a, b) (-EINVAL)
97 #endif
98 #ifndef GET_TSC_CTL
99 # define GET_TSC_CTL(a) (-EINVAL)
100 #endif
101 #ifndef SET_TSC_CTL
102 # define SET_TSC_CTL(a) (-EINVAL)
103 #endif
104 #ifndef MPX_ENABLE_MANAGEMENT
105 # define MPX_ENABLE_MANAGEMENT() (-EINVAL)
106 #endif
107 #ifndef MPX_DISABLE_MANAGEMENT
108 # define MPX_DISABLE_MANAGEMENT() (-EINVAL)
109 #endif
110 #ifndef GET_FP_MODE
111 # define GET_FP_MODE(a) (-EINVAL)
112 #endif
113 #ifndef SET_FP_MODE
114 # define SET_FP_MODE(a,b) (-EINVAL)
115 #endif
116
117 /*
118 * this is where the system-wide overflow UID and GID are defined, for
119 * architectures that now have 32-bit UID/GID but didn't in the past
120 */
121
122 int overflowuid = DEFAULT_OVERFLOWUID;
123 int overflowgid = DEFAULT_OVERFLOWGID;
124
125 EXPORT_SYMBOL(overflowuid);
126 EXPORT_SYMBOL(overflowgid);
127
128 /*
129 * the same as above, but for filesystems which can only store a 16-bit
130 * UID and GID. as such, this is needed on all architectures
131 */
132
133 int fs_overflowuid = DEFAULT_FS_OVERFLOWUID;
134 int fs_overflowgid = DEFAULT_FS_OVERFLOWUID;
135
136 EXPORT_SYMBOL(fs_overflowuid);
137 EXPORT_SYMBOL(fs_overflowgid);
138
139 /*
140 * Returns true if current's euid is same as p's uid or euid,
141 * or has CAP_SYS_NICE to p's user_ns.
142 *
143 * Called with rcu_read_lock, creds are safe
144 */
145 static bool set_one_prio_perm(struct task_struct *p)
146 {
147 const struct cred *cred = current_cred(), *pcred = __task_cred(p);
148
149 if (uid_eq(pcred->uid, cred->euid) ||
150 uid_eq(pcred->euid, cred->euid))
151 return true;
152 if (ns_capable(pcred->user_ns, CAP_SYS_NICE))
153 return true;
154 return false;
155 }
156
157 /*
158 * set the priority of a task
159 * - the caller must hold the RCU read lock
160 */
161 static int set_one_prio(struct task_struct *p, int niceval, int error)
162 {
163 int no_nice;
164
165 if (!set_one_prio_perm(p)) {
166 error = -EPERM;
167 goto out;
168 }
169 if (niceval < task_nice(p) && !can_nice(p, niceval)) {
170 error = -EACCES;
171 goto out;
172 }
173 no_nice = security_task_setnice(p, niceval);
174 if (no_nice) {
175 error = no_nice;
176 goto out;
177 }
178 if (error == -ESRCH)
179 error = 0;
180 set_user_nice(p, niceval);
181 out:
182 return error;
183 }
184
185 SYSCALL_DEFINE3(setpriority, int, which, int, who, int, niceval)
186 {
187 struct task_struct *g, *p;
188 struct user_struct *user;
189 const struct cred *cred = current_cred();
190 int error = -EINVAL;
191 struct pid *pgrp;
192 kuid_t uid;
193
194 if (which > PRIO_USER || which < PRIO_PROCESS)
195 goto out;
196
197 /* normalize: avoid signed division (rounding problems) */
198 error = -ESRCH;
199 if (niceval < MIN_NICE)
200 niceval = MIN_NICE;
201 if (niceval > MAX_NICE)
202 niceval = MAX_NICE;
203
204 rcu_read_lock();
205 read_lock(&tasklist_lock);
206 switch (which) {
207 case PRIO_PROCESS:
208 if (who)
209 p = find_task_by_vpid(who);
210 else
211 p = current;
212 if (p)
213 error = set_one_prio(p, niceval, error);
214 break;
215 case PRIO_PGRP:
216 if (who)
217 pgrp = find_vpid(who);
218 else
219 pgrp = task_pgrp(current);
220 do_each_pid_thread(pgrp, PIDTYPE_PGID, p) {
221 error = set_one_prio(p, niceval, error);
222 } while_each_pid_thread(pgrp, PIDTYPE_PGID, p);
223 break;
224 case PRIO_USER:
225 uid = make_kuid(cred->user_ns, who);
226 user = cred->user;
227 if (!who)
228 uid = cred->uid;
229 else if (!uid_eq(uid, cred->uid)) {
230 user = find_user(uid);
231 if (!user)
232 goto out_unlock; /* No processes for this user */
233 }
234 do_each_thread(g, p) {
235 if (uid_eq(task_uid(p), uid) && task_pid_vnr(p))
236 error = set_one_prio(p, niceval, error);
237 } while_each_thread(g, p);
238 if (!uid_eq(uid, cred->uid))
239 free_uid(user); /* For find_user() */
240 break;
241 }
242 out_unlock:
243 read_unlock(&tasklist_lock);
244 rcu_read_unlock();
245 out:
246 return error;
247 }
248
249 /*
250 * Ugh. To avoid negative return values, "getpriority()" will
251 * not return the normal nice-value, but a negated value that
252 * has been offset by 20 (ie it returns 40..1 instead of -20..19)
253 * to stay compatible.
254 */
255 SYSCALL_DEFINE2(getpriority, int, which, int, who)
256 {
257 struct task_struct *g, *p;
258 struct user_struct *user;
259 const struct cred *cred = current_cred();
260 long niceval, retval = -ESRCH;
261 struct pid *pgrp;
262 kuid_t uid;
263
264 if (which > PRIO_USER || which < PRIO_PROCESS)
265 return -EINVAL;
266
267 rcu_read_lock();
268 read_lock(&tasklist_lock);
269 switch (which) {
270 case PRIO_PROCESS:
271 if (who)
272 p = find_task_by_vpid(who);
273 else
274 p = current;
275 if (p) {
276 niceval = nice_to_rlimit(task_nice(p));
277 if (niceval > retval)
278 retval = niceval;
279 }
280 break;
281 case PRIO_PGRP:
282 if (who)
283 pgrp = find_vpid(who);
284 else
285 pgrp = task_pgrp(current);
286 do_each_pid_thread(pgrp, PIDTYPE_PGID, p) {
287 niceval = nice_to_rlimit(task_nice(p));
288 if (niceval > retval)
289 retval = niceval;
290 } while_each_pid_thread(pgrp, PIDTYPE_PGID, p);
291 break;
292 case PRIO_USER:
293 uid = make_kuid(cred->user_ns, who);
294 user = cred->user;
295 if (!who)
296 uid = cred->uid;
297 else if (!uid_eq(uid, cred->uid)) {
298 user = find_user(uid);
299 if (!user)
300 goto out_unlock; /* No processes for this user */
301 }
302 do_each_thread(g, p) {
303 if (uid_eq(task_uid(p), uid) && task_pid_vnr(p)) {
304 niceval = nice_to_rlimit(task_nice(p));
305 if (niceval > retval)
306 retval = niceval;
307 }
308 } while_each_thread(g, p);
309 if (!uid_eq(uid, cred->uid))
310 free_uid(user); /* for find_user() */
311 break;
312 }
313 out_unlock:
314 read_unlock(&tasklist_lock);
315 rcu_read_unlock();
316
317 return retval;
318 }
319
320 /*
321 * Unprivileged users may change the real gid to the effective gid
322 * or vice versa. (BSD-style)
323 *
324 * If you set the real gid at all, or set the effective gid to a value not
325 * equal to the real gid, then the saved gid is set to the new effective gid.
326 *
327 * This makes it possible for a setgid program to completely drop its
328 * privileges, which is often a useful assertion to make when you are doing
329 * a security audit over a program.
330 *
331 * The general idea is that a program which uses just setregid() will be
332 * 100% compatible with BSD. A program which uses just setgid() will be
333 * 100% compatible with POSIX with saved IDs.
334 *
335 * SMP: There are not races, the GIDs are checked only by filesystem
336 * operations (as far as semantic preservation is concerned).
337 */
338 #ifdef CONFIG_MULTIUSER
339 SYSCALL_DEFINE2(setregid, gid_t, rgid, gid_t, egid)
340 {
341 struct user_namespace *ns = current_user_ns();
342 const struct cred *old;
343 struct cred *new;
344 int retval;
345 kgid_t krgid, kegid;
346
347 krgid = make_kgid(ns, rgid);
348 kegid = make_kgid(ns, egid);
349
350 if ((rgid != (gid_t) -1) && !gid_valid(krgid))
351 return -EINVAL;
352 if ((egid != (gid_t) -1) && !gid_valid(kegid))
353 return -EINVAL;
354
355 new = prepare_creds();
356 if (!new)
357 return -ENOMEM;
358 old = current_cred();
359
360 retval = -EPERM;
361 if (rgid != (gid_t) -1) {
362 if (gid_eq(old->gid, krgid) ||
363 gid_eq(old->egid, krgid) ||
364 ns_capable(old->user_ns, CAP_SETGID))
365 new->gid = krgid;
366 else
367 goto error;
368 }
369 if (egid != (gid_t) -1) {
370 if (gid_eq(old->gid, kegid) ||
371 gid_eq(old->egid, kegid) ||
372 gid_eq(old->sgid, kegid) ||
373 ns_capable(old->user_ns, CAP_SETGID))
374 new->egid = kegid;
375 else
376 goto error;
377 }
378
379 if (rgid != (gid_t) -1 ||
380 (egid != (gid_t) -1 && !gid_eq(kegid, old->gid)))
381 new->sgid = new->egid;
382 new->fsgid = new->egid;
383
384 return commit_creds(new);
385
386 error:
387 abort_creds(new);
388 return retval;
389 }
390
391 /*
392 * setgid() is implemented like SysV w/ SAVED_IDS
393 *
394 * SMP: Same implicit races as above.
395 */
396 SYSCALL_DEFINE1(setgid, gid_t, gid)
397 {
398 struct user_namespace *ns = current_user_ns();
399 const struct cred *old;
400 struct cred *new;
401 int retval;
402 kgid_t kgid;
403
404 kgid = make_kgid(ns, gid);
405 if (!gid_valid(kgid))
406 return -EINVAL;
407
408 new = prepare_creds();
409 if (!new)
410 return -ENOMEM;
411 old = current_cred();
412
413 retval = -EPERM;
414 if (ns_capable(old->user_ns, CAP_SETGID))
415 new->gid = new->egid = new->sgid = new->fsgid = kgid;
416 else if (gid_eq(kgid, old->gid) || gid_eq(kgid, old->sgid))
417 new->egid = new->fsgid = kgid;
418 else
419 goto error;
420
421 return commit_creds(new);
422
423 error:
424 abort_creds(new);
425 return retval;
426 }
427
428 /*
429 * change the user struct in a credentials set to match the new UID
430 */
431 static int set_user(struct cred *new)
432 {
433 struct user_struct *new_user;
434
435 new_user = alloc_uid(new->uid);
436 if (!new_user)
437 return -EAGAIN;
438
439 /*
440 * We don't fail in case of NPROC limit excess here because too many
441 * poorly written programs don't check set*uid() return code, assuming
442 * it never fails if called by root. We may still enforce NPROC limit
443 * for programs doing set*uid()+execve() by harmlessly deferring the
444 * failure to the execve() stage.
445 */
446 if (atomic_read(&new_user->processes) >= rlimit(RLIMIT_NPROC) &&
447 new_user != INIT_USER)
448 current->flags |= PF_NPROC_EXCEEDED;
449 else
450 current->flags &= ~PF_NPROC_EXCEEDED;
451
452 free_uid(new->user);
453 new->user = new_user;
454 return 0;
455 }
456
457 /*
458 * Unprivileged users may change the real uid to the effective uid
459 * or vice versa. (BSD-style)
460 *
461 * If you set the real uid at all, or set the effective uid to a value not
462 * equal to the real uid, then the saved uid is set to the new effective uid.
463 *
464 * This makes it possible for a setuid program to completely drop its
465 * privileges, which is often a useful assertion to make when you are doing
466 * a security audit over a program.
467 *
468 * The general idea is that a program which uses just setreuid() will be
469 * 100% compatible with BSD. A program which uses just setuid() will be
470 * 100% compatible with POSIX with saved IDs.
471 */
472 SYSCALL_DEFINE2(setreuid, uid_t, ruid, uid_t, euid)
473 {
474 struct user_namespace *ns = current_user_ns();
475 const struct cred *old;
476 struct cred *new;
477 int retval;
478 kuid_t kruid, keuid;
479
480 kruid = make_kuid(ns, ruid);
481 keuid = make_kuid(ns, euid);
482
483 if ((ruid != (uid_t) -1) && !uid_valid(kruid))
484 return -EINVAL;
485 if ((euid != (uid_t) -1) && !uid_valid(keuid))
486 return -EINVAL;
487
488 new = prepare_creds();
489 if (!new)
490 return -ENOMEM;
491 old = current_cred();
492
493 retval = -EPERM;
494 if (ruid != (uid_t) -1) {
495 new->uid = kruid;
496 if (!uid_eq(old->uid, kruid) &&
497 !uid_eq(old->euid, kruid) &&
498 !ns_capable(old->user_ns, CAP_SETUID))
499 goto error;
500 }
501
502 if (euid != (uid_t) -1) {
503 new->euid = keuid;
504 if (!uid_eq(old->uid, keuid) &&
505 !uid_eq(old->euid, keuid) &&
506 !uid_eq(old->suid, keuid) &&
507 !ns_capable(old->user_ns, CAP_SETUID))
508 goto error;
509 }
510
511 if (!uid_eq(new->uid, old->uid)) {
512 retval = set_user(new);
513 if (retval < 0)
514 goto error;
515 }
516 if (ruid != (uid_t) -1 ||
517 (euid != (uid_t) -1 && !uid_eq(keuid, old->uid)))
518 new->suid = new->euid;
519 new->fsuid = new->euid;
520
521 retval = security_task_fix_setuid(new, old, LSM_SETID_RE);
522 if (retval < 0)
523 goto error;
524
525 return commit_creds(new);
526
527 error:
528 abort_creds(new);
529 return retval;
530 }
531
532 /*
533 * setuid() is implemented like SysV with SAVED_IDS
534 *
535 * Note that SAVED_ID's is deficient in that a setuid root program
536 * like sendmail, for example, cannot set its uid to be a normal
537 * user and then switch back, because if you're root, setuid() sets
538 * the saved uid too. If you don't like this, blame the bright people
539 * in the POSIX committee and/or USG. Note that the BSD-style setreuid()
540 * will allow a root program to temporarily drop privileges and be able to
541 * regain them by swapping the real and effective uid.
542 */
543 SYSCALL_DEFINE1(setuid, uid_t, uid)
544 {
545 struct user_namespace *ns = current_user_ns();
546 const struct cred *old;
547 struct cred *new;
548 int retval;
549 kuid_t kuid;
550
551 kuid = make_kuid(ns, uid);
552 if (!uid_valid(kuid))
553 return -EINVAL;
554
555 new = prepare_creds();
556 if (!new)
557 return -ENOMEM;
558 old = current_cred();
559
560 retval = -EPERM;
561 if (ns_capable(old->user_ns, CAP_SETUID)) {
562 new->suid = new->uid = kuid;
563 if (!uid_eq(kuid, old->uid)) {
564 retval = set_user(new);
565 if (retval < 0)
566 goto error;
567 }
568 } else if (!uid_eq(kuid, old->uid) && !uid_eq(kuid, new->suid)) {
569 goto error;
570 }
571
572 new->fsuid = new->euid = kuid;
573
574 retval = security_task_fix_setuid(new, old, LSM_SETID_ID);
575 if (retval < 0)
576 goto error;
577
578 return commit_creds(new);
579
580 error:
581 abort_creds(new);
582 return retval;
583 }
584
585
586 /*
587 * This function implements a generic ability to update ruid, euid,
588 * and suid. This allows you to implement the 4.4 compatible seteuid().
589 */
590 SYSCALL_DEFINE3(setresuid, uid_t, ruid, uid_t, euid, uid_t, suid)
591 {
592 struct user_namespace *ns = current_user_ns();
593 const struct cred *old;
594 struct cred *new;
595 int retval;
596 kuid_t kruid, keuid, ksuid;
597
598 kruid = make_kuid(ns, ruid);
599 keuid = make_kuid(ns, euid);
600 ksuid = make_kuid(ns, suid);
601
602 if ((ruid != (uid_t) -1) && !uid_valid(kruid))
603 return -EINVAL;
604
605 if ((euid != (uid_t) -1) && !uid_valid(keuid))
606 return -EINVAL;
607
608 if ((suid != (uid_t) -1) && !uid_valid(ksuid))
609 return -EINVAL;
610
611 new = prepare_creds();
612 if (!new)
613 return -ENOMEM;
614
615 old = current_cred();
616
617 retval = -EPERM;
618 if (!ns_capable(old->user_ns, CAP_SETUID)) {
619 if (ruid != (uid_t) -1 && !uid_eq(kruid, old->uid) &&
620 !uid_eq(kruid, old->euid) && !uid_eq(kruid, old->suid))
621 goto error;
622 if (euid != (uid_t) -1 && !uid_eq(keuid, old->uid) &&
623 !uid_eq(keuid, old->euid) && !uid_eq(keuid, old->suid))
624 goto error;
625 if (suid != (uid_t) -1 && !uid_eq(ksuid, old->uid) &&
626 !uid_eq(ksuid, old->euid) && !uid_eq(ksuid, old->suid))
627 goto error;
628 }
629
630 if (ruid != (uid_t) -1) {
631 new->uid = kruid;
632 if (!uid_eq(kruid, old->uid)) {
633 retval = set_user(new);
634 if (retval < 0)
635 goto error;
636 }
637 }
638 if (euid != (uid_t) -1)
639 new->euid = keuid;
640 if (suid != (uid_t) -1)
641 new->suid = ksuid;
642 new->fsuid = new->euid;
643
644 retval = security_task_fix_setuid(new, old, LSM_SETID_RES);
645 if (retval < 0)
646 goto error;
647
648 return commit_creds(new);
649
650 error:
651 abort_creds(new);
652 return retval;
653 }
654
655 SYSCALL_DEFINE3(getresuid, uid_t __user *, ruidp, uid_t __user *, euidp, uid_t __user *, suidp)
656 {
657 const struct cred *cred = current_cred();
658 int retval;
659 uid_t ruid, euid, suid;
660
661 ruid = from_kuid_munged(cred->user_ns, cred->uid);
662 euid = from_kuid_munged(cred->user_ns, cred->euid);
663 suid = from_kuid_munged(cred->user_ns, cred->suid);
664
665 retval = put_user(ruid, ruidp);
666 if (!retval) {
667 retval = put_user(euid, euidp);
668 if (!retval)
669 return put_user(suid, suidp);
670 }
671 return retval;
672 }
673
674 /*
675 * Same as above, but for rgid, egid, sgid.
676 */
677 SYSCALL_DEFINE3(setresgid, gid_t, rgid, gid_t, egid, gid_t, sgid)
678 {
679 struct user_namespace *ns = current_user_ns();
680 const struct cred *old;
681 struct cred *new;
682 int retval;
683 kgid_t krgid, kegid, ksgid;
684
685 krgid = make_kgid(ns, rgid);
686 kegid = make_kgid(ns, egid);
687 ksgid = make_kgid(ns, sgid);
688
689 if ((rgid != (gid_t) -1) && !gid_valid(krgid))
690 return -EINVAL;
691 if ((egid != (gid_t) -1) && !gid_valid(kegid))
692 return -EINVAL;
693 if ((sgid != (gid_t) -1) && !gid_valid(ksgid))
694 return -EINVAL;
695
696 new = prepare_creds();
697 if (!new)
698 return -ENOMEM;
699 old = current_cred();
700
701 retval = -EPERM;
702 if (!ns_capable(old->user_ns, CAP_SETGID)) {
703 if (rgid != (gid_t) -1 && !gid_eq(krgid, old->gid) &&
704 !gid_eq(krgid, old->egid) && !gid_eq(krgid, old->sgid))
705 goto error;
706 if (egid != (gid_t) -1 && !gid_eq(kegid, old->gid) &&
707 !gid_eq(kegid, old->egid) && !gid_eq(kegid, old->sgid))
708 goto error;
709 if (sgid != (gid_t) -1 && !gid_eq(ksgid, old->gid) &&
710 !gid_eq(ksgid, old->egid) && !gid_eq(ksgid, old->sgid))
711 goto error;
712 }
713
714 if (rgid != (gid_t) -1)
715 new->gid = krgid;
716 if (egid != (gid_t) -1)
717 new->egid = kegid;
718 if (sgid != (gid_t) -1)
719 new->sgid = ksgid;
720 new->fsgid = new->egid;
721
722 return commit_creds(new);
723
724 error:
725 abort_creds(new);
726 return retval;
727 }
728
729 SYSCALL_DEFINE3(getresgid, gid_t __user *, rgidp, gid_t __user *, egidp, gid_t __user *, sgidp)
730 {
731 const struct cred *cred = current_cred();
732 int retval;
733 gid_t rgid, egid, sgid;
734
735 rgid = from_kgid_munged(cred->user_ns, cred->gid);
736 egid = from_kgid_munged(cred->user_ns, cred->egid);
737 sgid = from_kgid_munged(cred->user_ns, cred->sgid);
738
739 retval = put_user(rgid, rgidp);
740 if (!retval) {
741 retval = put_user(egid, egidp);
742 if (!retval)
743 retval = put_user(sgid, sgidp);
744 }
745
746 return retval;
747 }
748
749
750 /*
751 * "setfsuid()" sets the fsuid - the uid used for filesystem checks. This
752 * is used for "access()" and for the NFS daemon (letting nfsd stay at
753 * whatever uid it wants to). It normally shadows "euid", except when
754 * explicitly set by setfsuid() or for access..
755 */
756 SYSCALL_DEFINE1(setfsuid, uid_t, uid)
757 {
758 const struct cred *old;
759 struct cred *new;
760 uid_t old_fsuid;
761 kuid_t kuid;
762
763 old = current_cred();
764 old_fsuid = from_kuid_munged(old->user_ns, old->fsuid);
765
766 kuid = make_kuid(old->user_ns, uid);
767 if (!uid_valid(kuid))
768 return old_fsuid;
769
770 new = prepare_creds();
771 if (!new)
772 return old_fsuid;
773
774 if (uid_eq(kuid, old->uid) || uid_eq(kuid, old->euid) ||
775 uid_eq(kuid, old->suid) || uid_eq(kuid, old->fsuid) ||
776 ns_capable(old->user_ns, CAP_SETUID)) {
777 if (!uid_eq(kuid, old->fsuid)) {
778 new->fsuid = kuid;
779 if (security_task_fix_setuid(new, old, LSM_SETID_FS) == 0)
780 goto change_okay;
781 }
782 }
783
784 abort_creds(new);
785 return old_fsuid;
786
787 change_okay:
788 commit_creds(new);
789 return old_fsuid;
790 }
791
792 /*
793 * Samma på svenska..
794 */
795 SYSCALL_DEFINE1(setfsgid, gid_t, gid)
796 {
797 const struct cred *old;
798 struct cred *new;
799 gid_t old_fsgid;
800 kgid_t kgid;
801
802 old = current_cred();
803 old_fsgid = from_kgid_munged(old->user_ns, old->fsgid);
804
805 kgid = make_kgid(old->user_ns, gid);
806 if (!gid_valid(kgid))
807 return old_fsgid;
808
809 new = prepare_creds();
810 if (!new)
811 return old_fsgid;
812
813 if (gid_eq(kgid, old->gid) || gid_eq(kgid, old->egid) ||
814 gid_eq(kgid, old->sgid) || gid_eq(kgid, old->fsgid) ||
815 ns_capable(old->user_ns, CAP_SETGID)) {
816 if (!gid_eq(kgid, old->fsgid)) {
817 new->fsgid = kgid;
818 goto change_okay;
819 }
820 }
821
822 abort_creds(new);
823 return old_fsgid;
824
825 change_okay:
826 commit_creds(new);
827 return old_fsgid;
828 }
829 #endif /* CONFIG_MULTIUSER */
830
831 /**
832 * sys_getpid - return the thread group id of the current process
833 *
834 * Note, despite the name, this returns the tgid not the pid. The tgid and
835 * the pid are identical unless CLONE_THREAD was specified on clone() in
836 * which case the tgid is the same in all threads of the same group.
837 *
838 * This is SMP safe as current->tgid does not change.
839 */
840 SYSCALL_DEFINE0(getpid)
841 {
842 return task_tgid_vnr(current);
843 }
844
845 /* Thread ID - the internal kernel "pid" */
846 SYSCALL_DEFINE0(gettid)
847 {
848 return task_pid_vnr(current);
849 }
850
851 /*
852 * Accessing ->real_parent is not SMP-safe, it could
853 * change from under us. However, we can use a stale
854 * value of ->real_parent under rcu_read_lock(), see
855 * release_task()->call_rcu(delayed_put_task_struct).
856 */
857 SYSCALL_DEFINE0(getppid)
858 {
859 int pid;
860
861 rcu_read_lock();
862 pid = task_tgid_vnr(rcu_dereference(current->real_parent));
863 rcu_read_unlock();
864
865 return pid;
866 }
867
868 SYSCALL_DEFINE0(getuid)
869 {
870 /* Only we change this so SMP safe */
871 return from_kuid_munged(current_user_ns(), current_uid());
872 }
873
874 SYSCALL_DEFINE0(geteuid)
875 {
876 /* Only we change this so SMP safe */
877 return from_kuid_munged(current_user_ns(), current_euid());
878 }
879
880 SYSCALL_DEFINE0(getgid)
881 {
882 /* Only we change this so SMP safe */
883 return from_kgid_munged(current_user_ns(), current_gid());
884 }
885
886 SYSCALL_DEFINE0(getegid)
887 {
888 /* Only we change this so SMP safe */
889 return from_kgid_munged(current_user_ns(), current_egid());
890 }
891
892 static void do_sys_times(struct tms *tms)
893 {
894 u64 tgutime, tgstime, cutime, cstime;
895
896 thread_group_cputime_adjusted(current, &tgutime, &tgstime);
897 cutime = current->signal->cutime;
898 cstime = current->signal->cstime;
899 tms->tms_utime = nsec_to_clock_t(tgutime);
900 tms->tms_stime = nsec_to_clock_t(tgstime);
901 tms->tms_cutime = nsec_to_clock_t(cutime);
902 tms->tms_cstime = nsec_to_clock_t(cstime);
903 }
904
905 SYSCALL_DEFINE1(times, struct tms __user *, tbuf)
906 {
907 if (tbuf) {
908 struct tms tmp;
909
910 do_sys_times(&tmp);
911 if (copy_to_user(tbuf, &tmp, sizeof(struct tms)))
912 return -EFAULT;
913 }
914 force_successful_syscall_return();
915 return (long) jiffies_64_to_clock_t(get_jiffies_64());
916 }
917
918 #ifdef CONFIG_COMPAT
919 static compat_clock_t clock_t_to_compat_clock_t(clock_t x)
920 {
921 return compat_jiffies_to_clock_t(clock_t_to_jiffies(x));
922 }
923
924 COMPAT_SYSCALL_DEFINE1(times, struct compat_tms __user *, tbuf)
925 {
926 if (tbuf) {
927 struct tms tms;
928 struct compat_tms tmp;
929
930 do_sys_times(&tms);
931 /* Convert our struct tms to the compat version. */
932 tmp.tms_utime = clock_t_to_compat_clock_t(tms.tms_utime);
933 tmp.tms_stime = clock_t_to_compat_clock_t(tms.tms_stime);
934 tmp.tms_cutime = clock_t_to_compat_clock_t(tms.tms_cutime);
935 tmp.tms_cstime = clock_t_to_compat_clock_t(tms.tms_cstime);
936 if (copy_to_user(tbuf, &tmp, sizeof(tmp)))
937 return -EFAULT;
938 }
939 force_successful_syscall_return();
940 return compat_jiffies_to_clock_t(jiffies);
941 }
942 #endif
943
944 /*
945 * This needs some heavy checking ...
946 * I just haven't the stomach for it. I also don't fully
947 * understand sessions/pgrp etc. Let somebody who does explain it.
948 *
949 * OK, I think I have the protection semantics right.... this is really
950 * only important on a multi-user system anyway, to make sure one user
951 * can't send a signal to a process owned by another. -TYT, 12/12/91
952 *
953 * !PF_FORKNOEXEC check to conform completely to POSIX.
954 */
955 SYSCALL_DEFINE2(setpgid, pid_t, pid, pid_t, pgid)
956 {
957 struct task_struct *p;
958 struct task_struct *group_leader = current->group_leader;
959 struct pid *pgrp;
960 int err;
961
962 if (!pid)
963 pid = task_pid_vnr(group_leader);
964 if (!pgid)
965 pgid = pid;
966 if (pgid < 0)
967 return -EINVAL;
968 rcu_read_lock();
969
970 /* From this point forward we keep holding onto the tasklist lock
971 * so that our parent does not change from under us. -DaveM
972 */
973 write_lock_irq(&tasklist_lock);
974
975 err = -ESRCH;
976 p = find_task_by_vpid(pid);
977 if (!p)
978 goto out;
979
980 err = -EINVAL;
981 if (!thread_group_leader(p))
982 goto out;
983
984 if (same_thread_group(p->real_parent, group_leader)) {
985 err = -EPERM;
986 if (task_session(p) != task_session(group_leader))
987 goto out;
988 err = -EACCES;
989 if (!(p->flags & PF_FORKNOEXEC))
990 goto out;
991 } else {
992 err = -ESRCH;
993 if (p != group_leader)
994 goto out;
995 }
996
997 err = -EPERM;
998 if (p->signal->leader)
999 goto out;
1000
1001 pgrp = task_pid(p);
1002 if (pgid != pid) {
1003 struct task_struct *g;
1004
1005 pgrp = find_vpid(pgid);
1006 g = pid_task(pgrp, PIDTYPE_PGID);
1007 if (!g || task_session(g) != task_session(group_leader))
1008 goto out;
1009 }
1010
1011 err = security_task_setpgid(p, pgid);
1012 if (err)
1013 goto out;
1014
1015 if (task_pgrp(p) != pgrp)
1016 change_pid(p, PIDTYPE_PGID, pgrp);
1017
1018 err = 0;
1019 out:
1020 /* All paths lead to here, thus we are safe. -DaveM */
1021 write_unlock_irq(&tasklist_lock);
1022 rcu_read_unlock();
1023 return err;
1024 }
1025
1026 SYSCALL_DEFINE1(getpgid, pid_t, pid)
1027 {
1028 struct task_struct *p;
1029 struct pid *grp;
1030 int retval;
1031
1032 rcu_read_lock();
1033 if (!pid)
1034 grp = task_pgrp(current);
1035 else {
1036 retval = -ESRCH;
1037 p = find_task_by_vpid(pid);
1038 if (!p)
1039 goto out;
1040 grp = task_pgrp(p);
1041 if (!grp)
1042 goto out;
1043
1044 retval = security_task_getpgid(p);
1045 if (retval)
1046 goto out;
1047 }
1048 retval = pid_vnr(grp);
1049 out:
1050 rcu_read_unlock();
1051 return retval;
1052 }
1053
1054 #ifdef __ARCH_WANT_SYS_GETPGRP
1055
1056 SYSCALL_DEFINE0(getpgrp)
1057 {
1058 return sys_getpgid(0);
1059 }
1060
1061 #endif
1062
1063 SYSCALL_DEFINE1(getsid, pid_t, pid)
1064 {
1065 struct task_struct *p;
1066 struct pid *sid;
1067 int retval;
1068
1069 rcu_read_lock();
1070 if (!pid)
1071 sid = task_session(current);
1072 else {
1073 retval = -ESRCH;
1074 p = find_task_by_vpid(pid);
1075 if (!p)
1076 goto out;
1077 sid = task_session(p);
1078 if (!sid)
1079 goto out;
1080
1081 retval = security_task_getsid(p);
1082 if (retval)
1083 goto out;
1084 }
1085 retval = pid_vnr(sid);
1086 out:
1087 rcu_read_unlock();
1088 return retval;
1089 }
1090
1091 static void set_special_pids(struct pid *pid)
1092 {
1093 struct task_struct *curr = current->group_leader;
1094
1095 if (task_session(curr) != pid)
1096 change_pid(curr, PIDTYPE_SID, pid);
1097
1098 if (task_pgrp(curr) != pid)
1099 change_pid(curr, PIDTYPE_PGID, pid);
1100 }
1101
1102 SYSCALL_DEFINE0(setsid)
1103 {
1104 struct task_struct *group_leader = current->group_leader;
1105 struct pid *sid = task_pid(group_leader);
1106 pid_t session = pid_vnr(sid);
1107 int err = -EPERM;
1108
1109 write_lock_irq(&tasklist_lock);
1110 /* Fail if I am already a session leader */
1111 if (group_leader->signal->leader)
1112 goto out;
1113
1114 /* Fail if a process group id already exists that equals the
1115 * proposed session id.
1116 */
1117 if (pid_task(sid, PIDTYPE_PGID))
1118 goto out;
1119
1120 group_leader->signal->leader = 1;
1121 set_special_pids(sid);
1122
1123 proc_clear_tty(group_leader);
1124
1125 err = session;
1126 out:
1127 write_unlock_irq(&tasklist_lock);
1128 if (err > 0) {
1129 proc_sid_connector(group_leader);
1130 sched_autogroup_create_attach(group_leader);
1131 }
1132 return err;
1133 }
1134
1135 DECLARE_RWSEM(uts_sem);
1136
1137 #ifdef COMPAT_UTS_MACHINE
1138 #define override_architecture(name) \
1139 (personality(current->personality) == PER_LINUX32 && \
1140 copy_to_user(name->machine, COMPAT_UTS_MACHINE, \
1141 sizeof(COMPAT_UTS_MACHINE)))
1142 #else
1143 #define override_architecture(name) 0
1144 #endif
1145
1146 /*
1147 * Work around broken programs that cannot handle "Linux 3.0".
1148 * Instead we map 3.x to 2.6.40+x, so e.g. 3.0 would be 2.6.40
1149 * And we map 4.x to 2.6.60+x, so 4.0 would be 2.6.60.
1150 */
1151 static int override_release(char __user *release, size_t len)
1152 {
1153 int ret = 0;
1154
1155 if (current->personality & UNAME26) {
1156 const char *rest = UTS_RELEASE;
1157 char buf[65] = { 0 };
1158 int ndots = 0;
1159 unsigned v;
1160 size_t copy;
1161
1162 while (*rest) {
1163 if (*rest == '.' && ++ndots >= 3)
1164 break;
1165 if (!isdigit(*rest) && *rest != '.')
1166 break;
1167 rest++;
1168 }
1169 v = ((LINUX_VERSION_CODE >> 8) & 0xff) + 60;
1170 copy = clamp_t(size_t, len, 1, sizeof(buf));
1171 copy = scnprintf(buf, copy, "2.6.%u%s", v, rest);
1172 ret = copy_to_user(release, buf, copy + 1);
1173 }
1174 return ret;
1175 }
1176
1177 SYSCALL_DEFINE1(newuname, struct new_utsname __user *, name)
1178 {
1179 int errno = 0;
1180
1181 down_read(&uts_sem);
1182 if (copy_to_user(name, utsname(), sizeof *name))
1183 errno = -EFAULT;
1184 up_read(&uts_sem);
1185
1186 if (!errno && override_release(name->release, sizeof(name->release)))
1187 errno = -EFAULT;
1188 if (!errno && override_architecture(name))
1189 errno = -EFAULT;
1190 return errno;
1191 }
1192
1193 #ifdef __ARCH_WANT_SYS_OLD_UNAME
1194 /*
1195 * Old cruft
1196 */
1197 SYSCALL_DEFINE1(uname, struct old_utsname __user *, name)
1198 {
1199 int error = 0;
1200
1201 if (!name)
1202 return -EFAULT;
1203
1204 down_read(&uts_sem);
1205 if (copy_to_user(name, utsname(), sizeof(*name)))
1206 error = -EFAULT;
1207 up_read(&uts_sem);
1208
1209 if (!error && override_release(name->release, sizeof(name->release)))
1210 error = -EFAULT;
1211 if (!error && override_architecture(name))
1212 error = -EFAULT;
1213 return error;
1214 }
1215
1216 SYSCALL_DEFINE1(olduname, struct oldold_utsname __user *, name)
1217 {
1218 int error;
1219
1220 if (!name)
1221 return -EFAULT;
1222 if (!access_ok(VERIFY_WRITE, name, sizeof(struct oldold_utsname)))
1223 return -EFAULT;
1224
1225 down_read(&uts_sem);
1226 error = __copy_to_user(&name->sysname, &utsname()->sysname,
1227 __OLD_UTS_LEN);
1228 error |= __put_user(0, name->sysname + __OLD_UTS_LEN);
1229 error |= __copy_to_user(&name->nodename, &utsname()->nodename,
1230 __OLD_UTS_LEN);
1231 error |= __put_user(0, name->nodename + __OLD_UTS_LEN);
1232 error |= __copy_to_user(&name->release, &utsname()->release,
1233 __OLD_UTS_LEN);
1234 error |= __put_user(0, name->release + __OLD_UTS_LEN);
1235 error |= __copy_to_user(&name->version, &utsname()->version,
1236 __OLD_UTS_LEN);
1237 error |= __put_user(0, name->version + __OLD_UTS_LEN);
1238 error |= __copy_to_user(&name->machine, &utsname()->machine,
1239 __OLD_UTS_LEN);
1240 error |= __put_user(0, name->machine + __OLD_UTS_LEN);
1241 up_read(&uts_sem);
1242
1243 if (!error && override_architecture(name))
1244 error = -EFAULT;
1245 if (!error && override_release(name->release, sizeof(name->release)))
1246 error = -EFAULT;
1247 return error ? -EFAULT : 0;
1248 }
1249 #endif
1250
1251 SYSCALL_DEFINE2(sethostname, char __user *, name, int, len)
1252 {
1253 int errno;
1254 char tmp[__NEW_UTS_LEN];
1255
1256 if (!ns_capable(current->nsproxy->uts_ns->user_ns, CAP_SYS_ADMIN))
1257 return -EPERM;
1258
1259 if (len < 0 || len > __NEW_UTS_LEN)
1260 return -EINVAL;
1261 down_write(&uts_sem);
1262 errno = -EFAULT;
1263 if (!copy_from_user(tmp, name, len)) {
1264 struct new_utsname *u = utsname();
1265
1266 memcpy(u->nodename, tmp, len);
1267 memset(u->nodename + len, 0, sizeof(u->nodename) - len);
1268 errno = 0;
1269 uts_proc_notify(UTS_PROC_HOSTNAME);
1270 }
1271 up_write(&uts_sem);
1272 return errno;
1273 }
1274
1275 #ifdef __ARCH_WANT_SYS_GETHOSTNAME
1276
1277 SYSCALL_DEFINE2(gethostname, char __user *, name, int, len)
1278 {
1279 int i, errno;
1280 struct new_utsname *u;
1281
1282 if (len < 0)
1283 return -EINVAL;
1284 down_read(&uts_sem);
1285 u = utsname();
1286 i = 1 + strlen(u->nodename);
1287 if (i > len)
1288 i = len;
1289 errno = 0;
1290 if (copy_to_user(name, u->nodename, i))
1291 errno = -EFAULT;
1292 up_read(&uts_sem);
1293 return errno;
1294 }
1295
1296 #endif
1297
1298 /*
1299 * Only setdomainname; getdomainname can be implemented by calling
1300 * uname()
1301 */
1302 SYSCALL_DEFINE2(setdomainname, char __user *, name, int, len)
1303 {
1304 int errno;
1305 char tmp[__NEW_UTS_LEN];
1306
1307 if (!ns_capable(current->nsproxy->uts_ns->user_ns, CAP_SYS_ADMIN))
1308 return -EPERM;
1309 if (len < 0 || len > __NEW_UTS_LEN)
1310 return -EINVAL;
1311
1312 down_write(&uts_sem);
1313 errno = -EFAULT;
1314 if (!copy_from_user(tmp, name, len)) {
1315 struct new_utsname *u = utsname();
1316
1317 memcpy(u->domainname, tmp, len);
1318 memset(u->domainname + len, 0, sizeof(u->domainname) - len);
1319 errno = 0;
1320 uts_proc_notify(UTS_PROC_DOMAINNAME);
1321 }
1322 up_write(&uts_sem);
1323 return errno;
1324 }
1325
1326 SYSCALL_DEFINE2(getrlimit, unsigned int, resource, struct rlimit __user *, rlim)
1327 {
1328 struct rlimit value;
1329 int ret;
1330
1331 ret = do_prlimit(current, resource, NULL, &value);
1332 if (!ret)
1333 ret = copy_to_user(rlim, &value, sizeof(*rlim)) ? -EFAULT : 0;
1334
1335 return ret;
1336 }
1337
1338 #ifdef CONFIG_COMPAT
1339
1340 COMPAT_SYSCALL_DEFINE2(setrlimit, unsigned int, resource,
1341 struct compat_rlimit __user *, rlim)
1342 {
1343 struct rlimit r;
1344 struct compat_rlimit r32;
1345
1346 if (copy_from_user(&r32, rlim, sizeof(struct compat_rlimit)))
1347 return -EFAULT;
1348
1349 if (r32.rlim_cur == COMPAT_RLIM_INFINITY)
1350 r.rlim_cur = RLIM_INFINITY;
1351 else
1352 r.rlim_cur = r32.rlim_cur;
1353 if (r32.rlim_max == COMPAT_RLIM_INFINITY)
1354 r.rlim_max = RLIM_INFINITY;
1355 else
1356 r.rlim_max = r32.rlim_max;
1357 return do_prlimit(current, resource, &r, NULL);
1358 }
1359
1360 COMPAT_SYSCALL_DEFINE2(getrlimit, unsigned int, resource,
1361 struct compat_rlimit __user *, rlim)
1362 {
1363 struct rlimit r;
1364 int ret;
1365
1366 ret = do_prlimit(current, resource, NULL, &r);
1367 if (!ret) {
1368 struct compat_rlimit r32;
1369 if (r.rlim_cur > COMPAT_RLIM_INFINITY)
1370 r32.rlim_cur = COMPAT_RLIM_INFINITY;
1371 else
1372 r32.rlim_cur = r.rlim_cur;
1373 if (r.rlim_max > COMPAT_RLIM_INFINITY)
1374 r32.rlim_max = COMPAT_RLIM_INFINITY;
1375 else
1376 r32.rlim_max = r.rlim_max;
1377
1378 if (copy_to_user(rlim, &r32, sizeof(struct compat_rlimit)))
1379 return -EFAULT;
1380 }
1381 return ret;
1382 }
1383
1384 #endif
1385
1386 #ifdef __ARCH_WANT_SYS_OLD_GETRLIMIT
1387
1388 /*
1389 * Back compatibility for getrlimit. Needed for some apps.
1390 */
1391 SYSCALL_DEFINE2(old_getrlimit, unsigned int, resource,
1392 struct rlimit __user *, rlim)
1393 {
1394 struct rlimit x;
1395 if (resource >= RLIM_NLIMITS)
1396 return -EINVAL;
1397
1398 task_lock(current->group_leader);
1399 x = current->signal->rlim[resource];
1400 task_unlock(current->group_leader);
1401 if (x.rlim_cur > 0x7FFFFFFF)
1402 x.rlim_cur = 0x7FFFFFFF;
1403 if (x.rlim_max > 0x7FFFFFFF)
1404 x.rlim_max = 0x7FFFFFFF;
1405 return copy_to_user(rlim, &x, sizeof(x)) ? -EFAULT : 0;
1406 }
1407
1408 #ifdef CONFIG_COMPAT
1409 COMPAT_SYSCALL_DEFINE2(old_getrlimit, unsigned int, resource,
1410 struct compat_rlimit __user *, rlim)
1411 {
1412 struct rlimit r;
1413
1414 if (resource >= RLIM_NLIMITS)
1415 return -EINVAL;
1416
1417 task_lock(current->group_leader);
1418 r = current->signal->rlim[resource];
1419 task_unlock(current->group_leader);
1420 if (r.rlim_cur > 0x7FFFFFFF)
1421 r.rlim_cur = 0x7FFFFFFF;
1422 if (r.rlim_max > 0x7FFFFFFF)
1423 r.rlim_max = 0x7FFFFFFF;
1424
1425 if (put_user(r.rlim_cur, &rlim->rlim_cur) ||
1426 put_user(r.rlim_max, &rlim->rlim_max))
1427 return -EFAULT;
1428 return 0;
1429 }
1430 #endif
1431
1432 #endif
1433
1434 static inline bool rlim64_is_infinity(__u64 rlim64)
1435 {
1436 #if BITS_PER_LONG < 64
1437 return rlim64 >= ULONG_MAX;
1438 #else
1439 return rlim64 == RLIM64_INFINITY;
1440 #endif
1441 }
1442
1443 static void rlim_to_rlim64(const struct rlimit *rlim, struct rlimit64 *rlim64)
1444 {
1445 if (rlim->rlim_cur == RLIM_INFINITY)
1446 rlim64->rlim_cur = RLIM64_INFINITY;
1447 else
1448 rlim64->rlim_cur = rlim->rlim_cur;
1449 if (rlim->rlim_max == RLIM_INFINITY)
1450 rlim64->rlim_max = RLIM64_INFINITY;
1451 else
1452 rlim64->rlim_max = rlim->rlim_max;
1453 }
1454
1455 static void rlim64_to_rlim(const struct rlimit64 *rlim64, struct rlimit *rlim)
1456 {
1457 if (rlim64_is_infinity(rlim64->rlim_cur))
1458 rlim->rlim_cur = RLIM_INFINITY;
1459 else
1460 rlim->rlim_cur = (unsigned long)rlim64->rlim_cur;
1461 if (rlim64_is_infinity(rlim64->rlim_max))
1462 rlim->rlim_max = RLIM_INFINITY;
1463 else
1464 rlim->rlim_max = (unsigned long)rlim64->rlim_max;
1465 }
1466
1467 /* make sure you are allowed to change @tsk limits before calling this */
1468 int do_prlimit(struct task_struct *tsk, unsigned int resource,
1469 struct rlimit *new_rlim, struct rlimit *old_rlim)
1470 {
1471 struct rlimit *rlim;
1472 int retval = 0;
1473
1474 if (resource >= RLIM_NLIMITS)
1475 return -EINVAL;
1476 if (new_rlim) {
1477 if (new_rlim->rlim_cur > new_rlim->rlim_max)
1478 return -EINVAL;
1479 if (resource == RLIMIT_NOFILE &&
1480 new_rlim->rlim_max > sysctl_nr_open)
1481 return -EPERM;
1482 }
1483
1484 /* protect tsk->signal and tsk->sighand from disappearing */
1485 read_lock(&tasklist_lock);
1486 if (!tsk->sighand) {
1487 retval = -ESRCH;
1488 goto out;
1489 }
1490
1491 rlim = tsk->signal->rlim + resource;
1492 task_lock(tsk->group_leader);
1493 if (new_rlim) {
1494 /* Keep the capable check against init_user_ns until
1495 cgroups can contain all limits */
1496 if (new_rlim->rlim_max > rlim->rlim_max &&
1497 !capable(CAP_SYS_RESOURCE))
1498 retval = -EPERM;
1499 if (!retval)
1500 retval = security_task_setrlimit(tsk, resource, new_rlim);
1501 if (resource == RLIMIT_CPU && new_rlim->rlim_cur == 0) {
1502 /*
1503 * The caller is asking for an immediate RLIMIT_CPU
1504 * expiry. But we use the zero value to mean "it was
1505 * never set". So let's cheat and make it one second
1506 * instead
1507 */
1508 new_rlim->rlim_cur = 1;
1509 }
1510 }
1511 if (!retval) {
1512 if (old_rlim)
1513 *old_rlim = *rlim;
1514 if (new_rlim)
1515 *rlim = *new_rlim;
1516 }
1517 task_unlock(tsk->group_leader);
1518
1519 /*
1520 * RLIMIT_CPU handling. Note that the kernel fails to return an error
1521 * code if it rejected the user's attempt to set RLIMIT_CPU. This is a
1522 * very long-standing error, and fixing it now risks breakage of
1523 * applications, so we live with it
1524 */
1525 if (!retval && new_rlim && resource == RLIMIT_CPU &&
1526 new_rlim->rlim_cur != RLIM_INFINITY &&
1527 IS_ENABLED(CONFIG_POSIX_TIMERS))
1528 update_rlimit_cpu(tsk, new_rlim->rlim_cur);
1529 out:
1530 read_unlock(&tasklist_lock);
1531 return retval;
1532 }
1533
1534 /* rcu lock must be held */
1535 static int check_prlimit_permission(struct task_struct *task,
1536 unsigned int flags)
1537 {
1538 const struct cred *cred = current_cred(), *tcred;
1539 bool id_match;
1540
1541 if (current == task)
1542 return 0;
1543
1544 tcred = __task_cred(task);
1545 id_match = (uid_eq(cred->uid, tcred->euid) &&
1546 uid_eq(cred->uid, tcred->suid) &&
1547 uid_eq(cred->uid, tcred->uid) &&
1548 gid_eq(cred->gid, tcred->egid) &&
1549 gid_eq(cred->gid, tcred->sgid) &&
1550 gid_eq(cred->gid, tcred->gid));
1551 if (!id_match && !ns_capable(tcred->user_ns, CAP_SYS_RESOURCE))
1552 return -EPERM;
1553
1554 return security_task_prlimit(cred, tcred, flags);
1555 }
1556
1557 SYSCALL_DEFINE4(prlimit64, pid_t, pid, unsigned int, resource,
1558 const struct rlimit64 __user *, new_rlim,
1559 struct rlimit64 __user *, old_rlim)
1560 {
1561 struct rlimit64 old64, new64;
1562 struct rlimit old, new;
1563 struct task_struct *tsk;
1564 unsigned int checkflags = 0;
1565 int ret;
1566
1567 if (old_rlim)
1568 checkflags |= LSM_PRLIMIT_READ;
1569
1570 if (new_rlim) {
1571 if (copy_from_user(&new64, new_rlim, sizeof(new64)))
1572 return -EFAULT;
1573 rlim64_to_rlim(&new64, &new);
1574 checkflags |= LSM_PRLIMIT_WRITE;
1575 }
1576
1577 rcu_read_lock();
1578 tsk = pid ? find_task_by_vpid(pid) : current;
1579 if (!tsk) {
1580 rcu_read_unlock();
1581 return -ESRCH;
1582 }
1583 ret = check_prlimit_permission(tsk, checkflags);
1584 if (ret) {
1585 rcu_read_unlock();
1586 return ret;
1587 }
1588 get_task_struct(tsk);
1589 rcu_read_unlock();
1590
1591 ret = do_prlimit(tsk, resource, new_rlim ? &new : NULL,
1592 old_rlim ? &old : NULL);
1593
1594 if (!ret && old_rlim) {
1595 rlim_to_rlim64(&old, &old64);
1596 if (copy_to_user(old_rlim, &old64, sizeof(old64)))
1597 ret = -EFAULT;
1598 }
1599
1600 put_task_struct(tsk);
1601 return ret;
1602 }
1603
1604 SYSCALL_DEFINE2(setrlimit, unsigned int, resource, struct rlimit __user *, rlim)
1605 {
1606 struct rlimit new_rlim;
1607
1608 if (copy_from_user(&new_rlim, rlim, sizeof(*rlim)))
1609 return -EFAULT;
1610 return do_prlimit(current, resource, &new_rlim, NULL);
1611 }
1612
1613 /*
1614 * It would make sense to put struct rusage in the task_struct,
1615 * except that would make the task_struct be *really big*. After
1616 * task_struct gets moved into malloc'ed memory, it would
1617 * make sense to do this. It will make moving the rest of the information
1618 * a lot simpler! (Which we're not doing right now because we're not
1619 * measuring them yet).
1620 *
1621 * When sampling multiple threads for RUSAGE_SELF, under SMP we might have
1622 * races with threads incrementing their own counters. But since word
1623 * reads are atomic, we either get new values or old values and we don't
1624 * care which for the sums. We always take the siglock to protect reading
1625 * the c* fields from p->signal from races with exit.c updating those
1626 * fields when reaping, so a sample either gets all the additions of a
1627 * given child after it's reaped, or none so this sample is before reaping.
1628 *
1629 * Locking:
1630 * We need to take the siglock for CHILDEREN, SELF and BOTH
1631 * for the cases current multithreaded, non-current single threaded
1632 * non-current multithreaded. Thread traversal is now safe with
1633 * the siglock held.
1634 * Strictly speaking, we donot need to take the siglock if we are current and
1635 * single threaded, as no one else can take our signal_struct away, no one
1636 * else can reap the children to update signal->c* counters, and no one else
1637 * can race with the signal-> fields. If we do not take any lock, the
1638 * signal-> fields could be read out of order while another thread was just
1639 * exiting. So we should place a read memory barrier when we avoid the lock.
1640 * On the writer side, write memory barrier is implied in __exit_signal
1641 * as __exit_signal releases the siglock spinlock after updating the signal->
1642 * fields. But we don't do this yet to keep things simple.
1643 *
1644 */
1645
1646 static void accumulate_thread_rusage(struct task_struct *t, struct rusage *r)
1647 {
1648 r->ru_nvcsw += t->nvcsw;
1649 r->ru_nivcsw += t->nivcsw;
1650 r->ru_minflt += t->min_flt;
1651 r->ru_majflt += t->maj_flt;
1652 r->ru_inblock += task_io_get_inblock(t);
1653 r->ru_oublock += task_io_get_oublock(t);
1654 }
1655
1656 void getrusage(struct task_struct *p, int who, struct rusage *r)
1657 {
1658 struct task_struct *t;
1659 unsigned long flags;
1660 u64 tgutime, tgstime, utime, stime;
1661 unsigned long maxrss = 0;
1662
1663 memset((char *)r, 0, sizeof (*r));
1664 utime = stime = 0;
1665
1666 if (who == RUSAGE_THREAD) {
1667 task_cputime_adjusted(current, &utime, &stime);
1668 accumulate_thread_rusage(p, r);
1669 maxrss = p->signal->maxrss;
1670 goto out;
1671 }
1672
1673 if (!lock_task_sighand(p, &flags))
1674 return;
1675
1676 switch (who) {
1677 case RUSAGE_BOTH:
1678 case RUSAGE_CHILDREN:
1679 utime = p->signal->cutime;
1680 stime = p->signal->cstime;
1681 r->ru_nvcsw = p->signal->cnvcsw;
1682 r->ru_nivcsw = p->signal->cnivcsw;
1683 r->ru_minflt = p->signal->cmin_flt;
1684 r->ru_majflt = p->signal->cmaj_flt;
1685 r->ru_inblock = p->signal->cinblock;
1686 r->ru_oublock = p->signal->coublock;
1687 maxrss = p->signal->cmaxrss;
1688
1689 if (who == RUSAGE_CHILDREN)
1690 break;
1691
1692 case RUSAGE_SELF:
1693 thread_group_cputime_adjusted(p, &tgutime, &tgstime);
1694 utime += tgutime;
1695 stime += tgstime;
1696 r->ru_nvcsw += p->signal->nvcsw;
1697 r->ru_nivcsw += p->signal->nivcsw;
1698 r->ru_minflt += p->signal->min_flt;
1699 r->ru_majflt += p->signal->maj_flt;
1700 r->ru_inblock += p->signal->inblock;
1701 r->ru_oublock += p->signal->oublock;
1702 if (maxrss < p->signal->maxrss)
1703 maxrss = p->signal->maxrss;
1704 t = p;
1705 do {
1706 accumulate_thread_rusage(t, r);
1707 } while_each_thread(p, t);
1708 break;
1709
1710 default:
1711 BUG();
1712 }
1713 unlock_task_sighand(p, &flags);
1714
1715 out:
1716 r->ru_utime = ns_to_timeval(utime);
1717 r->ru_stime = ns_to_timeval(stime);
1718
1719 if (who != RUSAGE_CHILDREN) {
1720 struct mm_struct *mm = get_task_mm(p);
1721
1722 if (mm) {
1723 setmax_mm_hiwater_rss(&maxrss, mm);
1724 mmput(mm);
1725 }
1726 }
1727 r->ru_maxrss = maxrss * (PAGE_SIZE / 1024); /* convert pages to KBs */
1728 }
1729
1730 SYSCALL_DEFINE2(getrusage, int, who, struct rusage __user *, ru)
1731 {
1732 struct rusage r;
1733
1734 if (who != RUSAGE_SELF && who != RUSAGE_CHILDREN &&
1735 who != RUSAGE_THREAD)
1736 return -EINVAL;
1737
1738 getrusage(current, who, &r);
1739 return copy_to_user(ru, &r, sizeof(r)) ? -EFAULT : 0;
1740 }
1741
1742 #ifdef CONFIG_COMPAT
1743 COMPAT_SYSCALL_DEFINE2(getrusage, int, who, struct compat_rusage __user *, ru)
1744 {
1745 struct rusage r;
1746
1747 if (who != RUSAGE_SELF && who != RUSAGE_CHILDREN &&
1748 who != RUSAGE_THREAD)
1749 return -EINVAL;
1750
1751 getrusage(current, who, &r);
1752 return put_compat_rusage(&r, ru);
1753 }
1754 #endif
1755
1756 SYSCALL_DEFINE1(umask, int, mask)
1757 {
1758 mask = xchg(&current->fs->umask, mask & S_IRWXUGO);
1759 return mask;
1760 }
1761
1762 static int prctl_set_mm_exe_file(struct mm_struct *mm, unsigned int fd)
1763 {
1764 struct fd exe;
1765 struct file *old_exe, *exe_file;
1766 struct inode *inode;
1767 int err;
1768
1769 exe = fdget(fd);
1770 if (!exe.file)
1771 return -EBADF;
1772
1773 inode = file_inode(exe.file);
1774
1775 /*
1776 * Because the original mm->exe_file points to executable file, make
1777 * sure that this one is executable as well, to avoid breaking an
1778 * overall picture.
1779 */
1780 err = -EACCES;
1781 if (!S_ISREG(inode->i_mode) || path_noexec(&exe.file->f_path))
1782 goto exit;
1783
1784 err = inode_permission(inode, MAY_EXEC);
1785 if (err)
1786 goto exit;
1787
1788 /*
1789 * Forbid mm->exe_file change if old file still mapped.
1790 */
1791 exe_file = get_mm_exe_file(mm);
1792 err = -EBUSY;
1793 if (exe_file) {
1794 struct vm_area_struct *vma;
1795
1796 down_read(&mm->mmap_sem);
1797 for (vma = mm->mmap; vma; vma = vma->vm_next) {
1798 if (!vma->vm_file)
1799 continue;
1800 if (path_equal(&vma->vm_file->f_path,
1801 &exe_file->f_path))
1802 goto exit_err;
1803 }
1804
1805 up_read(&mm->mmap_sem);
1806 fput(exe_file);
1807 }
1808
1809 err = 0;
1810 /* set the new file, lockless */
1811 get_file(exe.file);
1812 old_exe = xchg(&mm->exe_file, exe.file);
1813 if (old_exe)
1814 fput(old_exe);
1815 exit:
1816 fdput(exe);
1817 return err;
1818 exit_err:
1819 up_read(&mm->mmap_sem);
1820 fput(exe_file);
1821 goto exit;
1822 }
1823
1824 /*
1825 * WARNING: we don't require any capability here so be very careful
1826 * in what is allowed for modification from userspace.
1827 */
1828 static int validate_prctl_map(struct prctl_mm_map *prctl_map)
1829 {
1830 unsigned long mmap_max_addr = TASK_SIZE;
1831 struct mm_struct *mm = current->mm;
1832 int error = -EINVAL, i;
1833
1834 static const unsigned char offsets[] = {
1835 offsetof(struct prctl_mm_map, start_code),
1836 offsetof(struct prctl_mm_map, end_code),
1837 offsetof(struct prctl_mm_map, start_data),
1838 offsetof(struct prctl_mm_map, end_data),
1839 offsetof(struct prctl_mm_map, start_brk),
1840 offsetof(struct prctl_mm_map, brk),
1841 offsetof(struct prctl_mm_map, start_stack),
1842 offsetof(struct prctl_mm_map, arg_start),
1843 offsetof(struct prctl_mm_map, arg_end),
1844 offsetof(struct prctl_mm_map, env_start),
1845 offsetof(struct prctl_mm_map, env_end),
1846 };
1847
1848 /*
1849 * Make sure the members are not somewhere outside
1850 * of allowed address space.
1851 */
1852 for (i = 0; i < ARRAY_SIZE(offsets); i++) {
1853 u64 val = *(u64 *)((char *)prctl_map + offsets[i]);
1854
1855 if ((unsigned long)val >= mmap_max_addr ||
1856 (unsigned long)val < mmap_min_addr)
1857 goto out;
1858 }
1859
1860 /*
1861 * Make sure the pairs are ordered.
1862 */
1863 #define __prctl_check_order(__m1, __op, __m2) \
1864 ((unsigned long)prctl_map->__m1 __op \
1865 (unsigned long)prctl_map->__m2) ? 0 : -EINVAL
1866 error = __prctl_check_order(start_code, <, end_code);
1867 error |= __prctl_check_order(start_data, <, end_data);
1868 error |= __prctl_check_order(start_brk, <=, brk);
1869 error |= __prctl_check_order(arg_start, <=, arg_end);
1870 error |= __prctl_check_order(env_start, <=, env_end);
1871 if (error)
1872 goto out;
1873 #undef __prctl_check_order
1874
1875 error = -EINVAL;
1876
1877 /*
1878 * @brk should be after @end_data in traditional maps.
1879 */
1880 if (prctl_map->start_brk <= prctl_map->end_data ||
1881 prctl_map->brk <= prctl_map->end_data)
1882 goto out;
1883
1884 /*
1885 * Neither we should allow to override limits if they set.
1886 */
1887 if (check_data_rlimit(rlimit(RLIMIT_DATA), prctl_map->brk,
1888 prctl_map->start_brk, prctl_map->end_data,
1889 prctl_map->start_data))
1890 goto out;
1891
1892 /*
1893 * Someone is trying to cheat the auxv vector.
1894 */
1895 if (prctl_map->auxv_size) {
1896 if (!prctl_map->auxv || prctl_map->auxv_size > sizeof(mm->saved_auxv))
1897 goto out;
1898 }
1899
1900 /*
1901 * Finally, make sure the caller has the rights to
1902 * change /proc/pid/exe link: only local sys admin should
1903 * be allowed to.
1904 */
1905 if (prctl_map->exe_fd != (u32)-1) {
1906 if (!ns_capable(current_user_ns(), CAP_SYS_ADMIN))
1907 goto out;
1908 }
1909
1910 error = 0;
1911 out:
1912 return error;
1913 }
1914
1915 #ifdef CONFIG_CHECKPOINT_RESTORE
1916 static int prctl_set_mm_map(int opt, const void __user *addr, unsigned long data_size)
1917 {
1918 struct prctl_mm_map prctl_map = { .exe_fd = (u32)-1, };
1919 unsigned long user_auxv[AT_VECTOR_SIZE];
1920 struct mm_struct *mm = current->mm;
1921 int error;
1922
1923 BUILD_BUG_ON(sizeof(user_auxv) != sizeof(mm->saved_auxv));
1924 BUILD_BUG_ON(sizeof(struct prctl_mm_map) > 256);
1925
1926 if (opt == PR_SET_MM_MAP_SIZE)
1927 return put_user((unsigned int)sizeof(prctl_map),
1928 (unsigned int __user *)addr);
1929
1930 if (data_size != sizeof(prctl_map))
1931 return -EINVAL;
1932
1933 if (copy_from_user(&prctl_map, addr, sizeof(prctl_map)))
1934 return -EFAULT;
1935
1936 error = validate_prctl_map(&prctl_map);
1937 if (error)
1938 return error;
1939
1940 if (prctl_map.auxv_size) {
1941 memset(user_auxv, 0, sizeof(user_auxv));
1942 if (copy_from_user(user_auxv,
1943 (const void __user *)prctl_map.auxv,
1944 prctl_map.auxv_size))
1945 return -EFAULT;
1946
1947 /* Last entry must be AT_NULL as specification requires */
1948 user_auxv[AT_VECTOR_SIZE - 2] = AT_NULL;
1949 user_auxv[AT_VECTOR_SIZE - 1] = AT_NULL;
1950 }
1951
1952 if (prctl_map.exe_fd != (u32)-1) {
1953 error = prctl_set_mm_exe_file(mm, prctl_map.exe_fd);
1954 if (error)
1955 return error;
1956 }
1957
1958 down_write(&mm->mmap_sem);
1959
1960 /*
1961 * We don't validate if these members are pointing to
1962 * real present VMAs because application may have correspond
1963 * VMAs already unmapped and kernel uses these members for statistics
1964 * output in procfs mostly, except
1965 *
1966 * - @start_brk/@brk which are used in do_brk but kernel lookups
1967 * for VMAs when updating these memvers so anything wrong written
1968 * here cause kernel to swear at userspace program but won't lead
1969 * to any problem in kernel itself
1970 */
1971
1972 mm->start_code = prctl_map.start_code;
1973 mm->end_code = prctl_map.end_code;
1974 mm->start_data = prctl_map.start_data;
1975 mm->end_data = prctl_map.end_data;
1976 mm->start_brk = prctl_map.start_brk;
1977 mm->brk = prctl_map.brk;
1978 mm->start_stack = prctl_map.start_stack;
1979 mm->arg_start = prctl_map.arg_start;
1980 mm->arg_end = prctl_map.arg_end;
1981 mm->env_start = prctl_map.env_start;
1982 mm->env_end = prctl_map.env_end;
1983
1984 /*
1985 * Note this update of @saved_auxv is lockless thus
1986 * if someone reads this member in procfs while we're
1987 * updating -- it may get partly updated results. It's
1988 * known and acceptable trade off: we leave it as is to
1989 * not introduce additional locks here making the kernel
1990 * more complex.
1991 */
1992 if (prctl_map.auxv_size)
1993 memcpy(mm->saved_auxv, user_auxv, sizeof(user_auxv));
1994
1995 up_write(&mm->mmap_sem);
1996 return 0;
1997 }
1998 #endif /* CONFIG_CHECKPOINT_RESTORE */
1999
2000 static int prctl_set_auxv(struct mm_struct *mm, unsigned long addr,
2001 unsigned long len)
2002 {
2003 /*
2004 * This doesn't move the auxiliary vector itself since it's pinned to
2005 * mm_struct, but it permits filling the vector with new values. It's
2006 * up to the caller to provide sane values here, otherwise userspace
2007 * tools which use this vector might be unhappy.
2008 */
2009 unsigned long user_auxv[AT_VECTOR_SIZE];
2010
2011 if (len > sizeof(user_auxv))
2012 return -EINVAL;
2013
2014 if (copy_from_user(user_auxv, (const void __user *)addr, len))
2015 return -EFAULT;
2016
2017 /* Make sure the last entry is always AT_NULL */
2018 user_auxv[AT_VECTOR_SIZE - 2] = 0;
2019 user_auxv[AT_VECTOR_SIZE - 1] = 0;
2020
2021 BUILD_BUG_ON(sizeof(user_auxv) != sizeof(mm->saved_auxv));
2022
2023 task_lock(current);
2024 memcpy(mm->saved_auxv, user_auxv, len);
2025 task_unlock(current);
2026
2027 return 0;
2028 }
2029
2030 static int prctl_set_mm(int opt, unsigned long addr,
2031 unsigned long arg4, unsigned long arg5)
2032 {
2033 struct mm_struct *mm = current->mm;
2034 struct prctl_mm_map prctl_map;
2035 struct vm_area_struct *vma;
2036 int error;
2037
2038 if (arg5 || (arg4 && (opt != PR_SET_MM_AUXV &&
2039 opt != PR_SET_MM_MAP &&
2040 opt != PR_SET_MM_MAP_SIZE)))
2041 return -EINVAL;
2042
2043 #ifdef CONFIG_CHECKPOINT_RESTORE
2044 if (opt == PR_SET_MM_MAP || opt == PR_SET_MM_MAP_SIZE)
2045 return prctl_set_mm_map(opt, (const void __user *)addr, arg4);
2046 #endif
2047
2048 if (!capable(CAP_SYS_RESOURCE))
2049 return -EPERM;
2050
2051 if (opt == PR_SET_MM_EXE_FILE)
2052 return prctl_set_mm_exe_file(mm, (unsigned int)addr);
2053
2054 if (opt == PR_SET_MM_AUXV)
2055 return prctl_set_auxv(mm, addr, arg4);
2056
2057 if (addr >= TASK_SIZE || addr < mmap_min_addr)
2058 return -EINVAL;
2059
2060 error = -EINVAL;
2061
2062 down_write(&mm->mmap_sem);
2063 vma = find_vma(mm, addr);
2064
2065 prctl_map.start_code = mm->start_code;
2066 prctl_map.end_code = mm->end_code;
2067 prctl_map.start_data = mm->start_data;
2068 prctl_map.end_data = mm->end_data;
2069 prctl_map.start_brk = mm->start_brk;
2070 prctl_map.brk = mm->brk;
2071 prctl_map.start_stack = mm->start_stack;
2072 prctl_map.arg_start = mm->arg_start;
2073 prctl_map.arg_end = mm->arg_end;
2074 prctl_map.env_start = mm->env_start;
2075 prctl_map.env_end = mm->env_end;
2076 prctl_map.auxv = NULL;
2077 prctl_map.auxv_size = 0;
2078 prctl_map.exe_fd = -1;
2079
2080 switch (opt) {
2081 case PR_SET_MM_START_CODE:
2082 prctl_map.start_code = addr;
2083 break;
2084 case PR_SET_MM_END_CODE:
2085 prctl_map.end_code = addr;
2086 break;
2087 case PR_SET_MM_START_DATA:
2088 prctl_map.start_data = addr;
2089 break;
2090 case PR_SET_MM_END_DATA:
2091 prctl_map.end_data = addr;
2092 break;
2093 case PR_SET_MM_START_STACK:
2094 prctl_map.start_stack = addr;
2095 break;
2096 case PR_SET_MM_START_BRK:
2097 prctl_map.start_brk = addr;
2098 break;
2099 case PR_SET_MM_BRK:
2100 prctl_map.brk = addr;
2101 break;
2102 case PR_SET_MM_ARG_START:
2103 prctl_map.arg_start = addr;
2104 break;
2105 case PR_SET_MM_ARG_END:
2106 prctl_map.arg_end = addr;
2107 break;
2108 case PR_SET_MM_ENV_START:
2109 prctl_map.env_start = addr;
2110 break;
2111 case PR_SET_MM_ENV_END:
2112 prctl_map.env_end = addr;
2113 break;
2114 default:
2115 goto out;
2116 }
2117
2118 error = validate_prctl_map(&prctl_map);
2119 if (error)
2120 goto out;
2121
2122 switch (opt) {
2123 /*
2124 * If command line arguments and environment
2125 * are placed somewhere else on stack, we can
2126 * set them up here, ARG_START/END to setup
2127 * command line argumets and ENV_START/END
2128 * for environment.
2129 */
2130 case PR_SET_MM_START_STACK:
2131 case PR_SET_MM_ARG_START:
2132 case PR_SET_MM_ARG_END:
2133 case PR_SET_MM_ENV_START:
2134 case PR_SET_MM_ENV_END:
2135 if (!vma) {
2136 error = -EFAULT;
2137 goto out;
2138 }
2139 }
2140
2141 mm->start_code = prctl_map.start_code;
2142 mm->end_code = prctl_map.end_code;
2143 mm->start_data = prctl_map.start_data;
2144 mm->end_data = prctl_map.end_data;
2145 mm->start_brk = prctl_map.start_brk;
2146 mm->brk = prctl_map.brk;
2147 mm->start_stack = prctl_map.start_stack;
2148 mm->arg_start = prctl_map.arg_start;
2149 mm->arg_end = prctl_map.arg_end;
2150 mm->env_start = prctl_map.env_start;
2151 mm->env_end = prctl_map.env_end;
2152
2153 error = 0;
2154 out:
2155 up_write(&mm->mmap_sem);
2156 return error;
2157 }
2158
2159 #ifdef CONFIG_CHECKPOINT_RESTORE
2160 static int prctl_get_tid_address(struct task_struct *me, int __user **tid_addr)
2161 {
2162 return put_user(me->clear_child_tid, tid_addr);
2163 }
2164 #else
2165 static int prctl_get_tid_address(struct task_struct *me, int __user **tid_addr)
2166 {
2167 return -EINVAL;
2168 }
2169 #endif
2170
2171 static int propagate_has_child_subreaper(struct task_struct *p, void *data)
2172 {
2173 /*
2174 * If task has has_child_subreaper - all its decendants
2175 * already have these flag too and new decendants will
2176 * inherit it on fork, skip them.
2177 *
2178 * If we've found child_reaper - skip descendants in
2179 * it's subtree as they will never get out pidns.
2180 */
2181 if (p->signal->has_child_subreaper ||
2182 is_child_reaper(task_pid(p)))
2183 return 0;
2184
2185 p->signal->has_child_subreaper = 1;
2186 return 1;
2187 }
2188
2189 #ifdef CONFIG_MMU
2190 static int prctl_update_vma_anon_name(struct vm_area_struct *vma,
2191 struct vm_area_struct **prev,
2192 unsigned long start, unsigned long end,
2193 const char __user *name_addr)
2194 {
2195 struct mm_struct *mm = vma->vm_mm;
2196 int error = 0;
2197 pgoff_t pgoff;
2198
2199 if (name_addr == vma_get_anon_name(vma)) {
2200 *prev = vma;
2201 goto out;
2202 }
2203
2204 pgoff = vma->vm_pgoff + ((start - vma->vm_start) >> PAGE_SHIFT);
2205 *prev = vma_merge(mm, *prev, start, end, vma->vm_flags, vma->anon_vma,
2206 vma->vm_file, pgoff, vma_policy(vma),
2207 vma->vm_userfaultfd_ctx, name_addr);
2208 if (*prev) {
2209 vma = *prev;
2210 goto success;
2211 }
2212
2213 *prev = vma;
2214
2215 if (start != vma->vm_start) {
2216 error = split_vma(mm, vma, start, 1);
2217 if (error)
2218 goto out;
2219 }
2220
2221 if (end != vma->vm_end) {
2222 error = split_vma(mm, vma, end, 0);
2223 if (error)
2224 goto out;
2225 }
2226
2227 success:
2228 if (!vma->vm_file)
2229 vma->anon_name = name_addr;
2230
2231 out:
2232 if (error == -ENOMEM)
2233 error = -EAGAIN;
2234 return error;
2235 }
2236
2237 static int prctl_set_vma_anon_name(unsigned long start, unsigned long end,
2238 unsigned long arg)
2239 {
2240 unsigned long tmp;
2241 struct vm_area_struct *vma, *prev;
2242 int unmapped_error = 0;
2243 int error = -EINVAL;
2244
2245 /*
2246 * If the interval [start,end) covers some unmapped address
2247 * ranges, just ignore them, but return -ENOMEM at the end.
2248 * - this matches the handling in madvise.
2249 */
2250 vma = find_vma_prev(current->mm, start, &prev);
2251 if (vma && start > vma->vm_start)
2252 prev = vma;
2253
2254 for (;;) {
2255 /* Still start < end. */
2256 error = -ENOMEM;
2257 if (!vma)
2258 return error;
2259
2260 /* Here start < (end|vma->vm_end). */
2261 if (start < vma->vm_start) {
2262 unmapped_error = -ENOMEM;
2263 start = vma->vm_start;
2264 if (start >= end)
2265 return error;
2266 }
2267
2268 /* Here vma->vm_start <= start < (end|vma->vm_end) */
2269 tmp = vma->vm_end;
2270 if (end < tmp)
2271 tmp = end;
2272
2273 /* Here vma->vm_start <= start < tmp <= (end|vma->vm_end). */
2274 error = prctl_update_vma_anon_name(vma, &prev, start, tmp,
2275 (const char __user *)arg);
2276 if (error)
2277 return error;
2278 start = tmp;
2279 if (prev && start < prev->vm_end)
2280 start = prev->vm_end;
2281 error = unmapped_error;
2282 if (start >= end)
2283 return error;
2284 if (prev)
2285 vma = prev->vm_next;
2286 else /* madvise_remove dropped mmap_sem */
2287 vma = find_vma(current->mm, start);
2288 }
2289 }
2290
2291 static int prctl_set_vma(unsigned long opt, unsigned long start,
2292 unsigned long len_in, unsigned long arg)
2293 {
2294 struct mm_struct *mm = current->mm;
2295 int error;
2296 unsigned long len;
2297 unsigned long end;
2298
2299 if (start & ~PAGE_MASK)
2300 return -EINVAL;
2301 len = (len_in + ~PAGE_MASK) & PAGE_MASK;
2302
2303 /* Check to see whether len was rounded up from small -ve to zero */
2304 if (len_in && !len)
2305 return -EINVAL;
2306
2307 end = start + len;
2308 if (end < start)
2309 return -EINVAL;
2310
2311 if (end == start)
2312 return 0;
2313
2314 down_write(&mm->mmap_sem);
2315
2316 switch (opt) {
2317 case PR_SET_VMA_ANON_NAME:
2318 error = prctl_set_vma_anon_name(start, end, arg);
2319 break;
2320 default:
2321 error = -EINVAL;
2322 }
2323
2324 up_write(&mm->mmap_sem);
2325
2326 return error;
2327 }
2328 #else /* CONFIG_MMU */
2329 static int prctl_set_vma(unsigned long opt, unsigned long start,
2330 unsigned long len_in, unsigned long arg)
2331 {
2332 return -EINVAL;
2333 }
2334 #endif
2335
2336 SYSCALL_DEFINE5(prctl, int, option, unsigned long, arg2, unsigned long, arg3,
2337 unsigned long, arg4, unsigned long, arg5)
2338 {
2339 struct task_struct *me = current;
2340 unsigned char comm[sizeof(me->comm)];
2341 long error;
2342
2343 error = security_task_prctl(option, arg2, arg3, arg4, arg5);
2344 if (error != -ENOSYS)
2345 return error;
2346
2347 error = 0;
2348 switch (option) {
2349 case PR_SET_PDEATHSIG:
2350 if (!valid_signal(arg2)) {
2351 error = -EINVAL;
2352 break;
2353 }
2354 me->pdeath_signal = arg2;
2355 break;
2356 case PR_GET_PDEATHSIG:
2357 error = put_user(me->pdeath_signal, (int __user *)arg2);
2358 break;
2359 case PR_GET_DUMPABLE:
2360 error = get_dumpable(me->mm);
2361 break;
2362 case PR_SET_DUMPABLE:
2363 if (arg2 != SUID_DUMP_DISABLE && arg2 != SUID_DUMP_USER) {
2364 error = -EINVAL;
2365 break;
2366 }
2367 set_dumpable(me->mm, arg2);
2368 break;
2369
2370 case PR_SET_UNALIGN:
2371 error = SET_UNALIGN_CTL(me, arg2);
2372 break;
2373 case PR_GET_UNALIGN:
2374 error = GET_UNALIGN_CTL(me, arg2);
2375 break;
2376 case PR_SET_FPEMU:
2377 error = SET_FPEMU_CTL(me, arg2);
2378 break;
2379 case PR_GET_FPEMU:
2380 error = GET_FPEMU_CTL(me, arg2);
2381 break;
2382 case PR_SET_FPEXC:
2383 error = SET_FPEXC_CTL(me, arg2);
2384 break;
2385 case PR_GET_FPEXC:
2386 error = GET_FPEXC_CTL(me, arg2);
2387 break;
2388 case PR_GET_TIMING:
2389 error = PR_TIMING_STATISTICAL;
2390 break;
2391 case PR_SET_TIMING:
2392 if (arg2 != PR_TIMING_STATISTICAL)
2393 error = -EINVAL;
2394 break;
2395 case PR_SET_NAME:
2396 comm[sizeof(me->comm) - 1] = 0;
2397 if (strncpy_from_user(comm, (char __user *)arg2,
2398 sizeof(me->comm) - 1) < 0)
2399 return -EFAULT;
2400 set_task_comm(me, comm);
2401 proc_comm_connector(me);
2402 break;
2403 case PR_GET_NAME:
2404 get_task_comm(comm, me);
2405 if (copy_to_user((char __user *)arg2, comm, sizeof(comm)))
2406 return -EFAULT;
2407 break;
2408 case PR_GET_ENDIAN:
2409 error = GET_ENDIAN(me, arg2);
2410 break;
2411 case PR_SET_ENDIAN:
2412 error = SET_ENDIAN(me, arg2);
2413 break;
2414 case PR_GET_SECCOMP:
2415 error = prctl_get_seccomp();
2416 break;
2417 case PR_SET_SECCOMP:
2418 error = prctl_set_seccomp(arg2, (char __user *)arg3);
2419 break;
2420 case PR_GET_TSC:
2421 error = GET_TSC_CTL(arg2);
2422 break;
2423 case PR_SET_TSC:
2424 error = SET_TSC_CTL(arg2);
2425 break;
2426 case PR_TASK_PERF_EVENTS_DISABLE:
2427 error = perf_event_task_disable();
2428 break;
2429 case PR_TASK_PERF_EVENTS_ENABLE:
2430 error = perf_event_task_enable();
2431 break;
2432 case PR_GET_TIMERSLACK:
2433 if (current->timer_slack_ns > ULONG_MAX)
2434 error = ULONG_MAX;
2435 else
2436 error = current->timer_slack_ns;
2437 break;
2438 case PR_SET_TIMERSLACK:
2439 if (arg2 <= 0)
2440 current->timer_slack_ns =
2441 current->default_timer_slack_ns;
2442 else
2443 current->timer_slack_ns = arg2;
2444 break;
2445 case PR_MCE_KILL:
2446 if (arg4 | arg5)
2447 return -EINVAL;
2448 switch (arg2) {
2449 case PR_MCE_KILL_CLEAR:
2450 if (arg3 != 0)
2451 return -EINVAL;
2452 current->flags &= ~PF_MCE_PROCESS;
2453 break;
2454 case PR_MCE_KILL_SET:
2455 current->flags |= PF_MCE_PROCESS;
2456 if (arg3 == PR_MCE_KILL_EARLY)
2457 current->flags |= PF_MCE_EARLY;
2458 else if (arg3 == PR_MCE_KILL_LATE)
2459 current->flags &= ~PF_MCE_EARLY;
2460 else if (arg3 == PR_MCE_KILL_DEFAULT)
2461 current->flags &=
2462 ~(PF_MCE_EARLY|PF_MCE_PROCESS);
2463 else
2464 return -EINVAL;
2465 break;
2466 default:
2467 return -EINVAL;
2468 }
2469 break;
2470 case PR_MCE_KILL_GET:
2471 if (arg2 | arg3 | arg4 | arg5)
2472 return -EINVAL;
2473 if (current->flags & PF_MCE_PROCESS)
2474 error = (current->flags & PF_MCE_EARLY) ?
2475 PR_MCE_KILL_EARLY : PR_MCE_KILL_LATE;
2476 else
2477 error = PR_MCE_KILL_DEFAULT;
2478 break;
2479 case PR_SET_MM:
2480 error = prctl_set_mm(arg2, arg3, arg4, arg5);
2481 break;
2482 case PR_GET_TID_ADDRESS:
2483 error = prctl_get_tid_address(me, (int __user **)arg2);
2484 break;
2485 case PR_SET_CHILD_SUBREAPER:
2486 me->signal->is_child_subreaper = !!arg2;
2487 if (!arg2)
2488 break;
2489
2490 walk_process_tree(me, propagate_has_child_subreaper, NULL);
2491 break;
2492 case PR_GET_CHILD_SUBREAPER:
2493 error = put_user(me->signal->is_child_subreaper,
2494 (int __user *)arg2);
2495 break;
2496 case PR_SET_NO_NEW_PRIVS:
2497 if (arg2 != 1 || arg3 || arg4 || arg5)
2498 return -EINVAL;
2499
2500 task_set_no_new_privs(current);
2501 break;
2502 case PR_GET_NO_NEW_PRIVS:
2503 if (arg2 || arg3 || arg4 || arg5)
2504 return -EINVAL;
2505 return task_no_new_privs(current) ? 1 : 0;
2506 case PR_GET_THP_DISABLE:
2507 if (arg2 || arg3 || arg4 || arg5)
2508 return -EINVAL;
2509 error = !!test_bit(MMF_DISABLE_THP, &me->mm->flags);
2510 break;
2511 case PR_SET_THP_DISABLE:
2512 if (arg3 || arg4 || arg5)
2513 return -EINVAL;
2514 if (down_write_killable(&me->mm->mmap_sem))
2515 return -EINTR;
2516 if (arg2)
2517 set_bit(MMF_DISABLE_THP, &me->mm->flags);
2518 else
2519 clear_bit(MMF_DISABLE_THP, &me->mm->flags);
2520 up_write(&me->mm->mmap_sem);
2521 break;
2522 case PR_MPX_ENABLE_MANAGEMENT:
2523 if (arg2 || arg3 || arg4 || arg5)
2524 return -EINVAL;
2525 error = MPX_ENABLE_MANAGEMENT();
2526 break;
2527 case PR_MPX_DISABLE_MANAGEMENT:
2528 if (arg2 || arg3 || arg4 || arg5)
2529 return -EINVAL;
2530 error = MPX_DISABLE_MANAGEMENT();
2531 break;
2532 case PR_SET_FP_MODE:
2533 error = SET_FP_MODE(me, arg2);
2534 break;
2535 case PR_GET_FP_MODE:
2536 error = GET_FP_MODE(me);
2537 break;
2538 case PR_SET_VMA:
2539 error = prctl_set_vma(arg2, arg3, arg4, arg5);
2540 break;
2541 default:
2542 error = -EINVAL;
2543 break;
2544 }
2545 return error;
2546 }
2547
2548 SYSCALL_DEFINE3(getcpu, unsigned __user *, cpup, unsigned __user *, nodep,
2549 struct getcpu_cache __user *, unused)
2550 {
2551 int err = 0;
2552 int cpu = raw_smp_processor_id();
2553
2554 if (cpup)
2555 err |= put_user(cpu, cpup);
2556 if (nodep)
2557 err |= put_user(cpu_to_node(cpu), nodep);
2558 return err ? -EFAULT : 0;
2559 }
2560
2561 /**
2562 * do_sysinfo - fill in sysinfo struct
2563 * @info: pointer to buffer to fill
2564 */
2565 static int do_sysinfo(struct sysinfo *info)
2566 {
2567 unsigned long mem_total, sav_total;
2568 unsigned int mem_unit, bitcount;
2569 struct timespec tp;
2570
2571 memset(info, 0, sizeof(struct sysinfo));
2572
2573 get_monotonic_boottime(&tp);
2574 info->uptime = tp.tv_sec + (tp.tv_nsec ? 1 : 0);
2575
2576 get_avenrun(info->loads, 0, SI_LOAD_SHIFT - FSHIFT);
2577
2578 info->procs = nr_threads;
2579
2580 si_meminfo(info);
2581 si_swapinfo(info);
2582
2583 /*
2584 * If the sum of all the available memory (i.e. ram + swap)
2585 * is less than can be stored in a 32 bit unsigned long then
2586 * we can be binary compatible with 2.2.x kernels. If not,
2587 * well, in that case 2.2.x was broken anyways...
2588 *
2589 * -Erik Andersen <andersee@debian.org>
2590 */
2591
2592 mem_total = info->totalram + info->totalswap;
2593 if (mem_total < info->totalram || mem_total < info->totalswap)
2594 goto out;
2595 bitcount = 0;
2596 mem_unit = info->mem_unit;
2597 while (mem_unit > 1) {
2598 bitcount++;
2599 mem_unit >>= 1;
2600 sav_total = mem_total;
2601 mem_total <<= 1;
2602 if (mem_total < sav_total)
2603 goto out;
2604 }
2605
2606 /*
2607 * If mem_total did not overflow, multiply all memory values by
2608 * info->mem_unit and set it to 1. This leaves things compatible
2609 * with 2.2.x, and also retains compatibility with earlier 2.4.x
2610 * kernels...
2611 */
2612
2613 info->mem_unit = 1;
2614 info->totalram <<= bitcount;
2615 info->freeram <<= bitcount;
2616 info->sharedram <<= bitcount;
2617 info->bufferram <<= bitcount;
2618 info->totalswap <<= bitcount;
2619 info->freeswap <<= bitcount;
2620 info->totalhigh <<= bitcount;
2621 info->freehigh <<= bitcount;
2622
2623 out:
2624 return 0;
2625 }
2626
2627 SYSCALL_DEFINE1(sysinfo, struct sysinfo __user *, info)
2628 {
2629 struct sysinfo val;
2630
2631 do_sysinfo(&val);
2632
2633 if (copy_to_user(info, &val, sizeof(struct sysinfo)))
2634 return -EFAULT;
2635
2636 return 0;
2637 }
2638
2639 #ifdef CONFIG_COMPAT
2640 struct compat_sysinfo {
2641 s32 uptime;
2642 u32 loads[3];
2643 u32 totalram;
2644 u32 freeram;
2645 u32 sharedram;
2646 u32 bufferram;
2647 u32 totalswap;
2648 u32 freeswap;
2649 u16 procs;
2650 u16 pad;
2651 u32 totalhigh;
2652 u32 freehigh;
2653 u32 mem_unit;
2654 char _f[20-2*sizeof(u32)-sizeof(int)];
2655 };
2656
2657 COMPAT_SYSCALL_DEFINE1(sysinfo, struct compat_sysinfo __user *, info)
2658 {
2659 struct sysinfo s;
2660
2661 do_sysinfo(&s);
2662
2663 /* Check to see if any memory value is too large for 32-bit and scale
2664 * down if needed
2665 */
2666 if (upper_32_bits(s.totalram) || upper_32_bits(s.totalswap)) {
2667 int bitcount = 0;
2668
2669 while (s.mem_unit < PAGE_SIZE) {
2670 s.mem_unit <<= 1;
2671 bitcount++;
2672 }
2673
2674 s.totalram >>= bitcount;
2675 s.freeram >>= bitcount;
2676 s.sharedram >>= bitcount;
2677 s.bufferram >>= bitcount;
2678 s.totalswap >>= bitcount;
2679 s.freeswap >>= bitcount;
2680 s.totalhigh >>= bitcount;
2681 s.freehigh >>= bitcount;
2682 }
2683
2684 if (!access_ok(VERIFY_WRITE, info, sizeof(struct compat_sysinfo)) ||
2685 __put_user(s.uptime, &info->uptime) ||
2686 __put_user(s.loads[0], &info->loads[0]) ||
2687 __put_user(s.loads[1], &info->loads[1]) ||
2688 __put_user(s.loads[2], &info->loads[2]) ||
2689 __put_user(s.totalram, &info->totalram) ||
2690 __put_user(s.freeram, &info->freeram) ||
2691 __put_user(s.sharedram, &info->sharedram) ||
2692 __put_user(s.bufferram, &info->bufferram) ||
2693 __put_user(s.totalswap, &info->totalswap) ||
2694 __put_user(s.freeswap, &info->freeswap) ||
2695 __put_user(s.procs, &info->procs) ||
2696 __put_user(s.totalhigh, &info->totalhigh) ||
2697 __put_user(s.freehigh, &info->freehigh) ||
2698 __put_user(s.mem_unit, &info->mem_unit))
2699 return -EFAULT;
2700
2701 return 0;
2702 }
2703 #endif /* CONFIG_COMPAT */
Motorola kernel-slsi