1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 1991, 1992 Linus Torvalds
8 #include <linux/export.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>
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/suspend.h>
28 #include <linux/tty.h>
29 #include <linux/signal.h>
30 #include <linux/cn_proc.h>
31 #include <linux/getcpu.h>
32 #include <linux/task_io_accounting_ops.h>
33 #include <linux/seccomp.h>
34 #include <linux/cpu.h>
35 #include <linux/personality.h>
36 #include <linux/ptrace.h>
37 #include <linux/fs_struct.h>
38 #include <linux/file.h>
39 #include <linux/mount.h>
40 #include <linux/gfp.h>
41 #include <linux/syscore_ops.h>
42 #include <linux/version.h>
43 #include <linux/ctype.h>
44 #include <linux/syscall_user_dispatch.h>
46 #include <linux/compat.h>
47 #include <linux/syscalls.h>
48 #include <linux/kprobes.h>
49 #include <linux/user_namespace.h>
50 #include <linux/time_namespace.h>
51 #include <linux/binfmts.h>
53 #include <linux/sched.h>
54 #include <linux/sched/autogroup.h>
55 #include <linux/sched/loadavg.h>
56 #include <linux/sched/stat.h>
57 #include <linux/sched/mm.h>
58 #include <linux/sched/coredump.h>
59 #include <linux/sched/task.h>
60 #include <linux/sched/cputime.h>
61 #include <linux/rcupdate.h>
62 #include <linux/uidgid.h>
63 #include <linux/cred.h>
65 #include <linux/nospec.h>
67 #include <linux/kmsg_dump.h>
68 /* Move somewhere else to avoid recompiling? */
69 #include <generated/utsrelease.h>
71 #include <linux/uaccess.h>
73 #include <asm/unistd.h>
77 #ifndef SET_UNALIGN_CTL
78 # define SET_UNALIGN_CTL(a, b) (-EINVAL)
80 #ifndef GET_UNALIGN_CTL
81 # define GET_UNALIGN_CTL(a, b) (-EINVAL)
84 # define SET_FPEMU_CTL(a, b) (-EINVAL)
87 # define GET_FPEMU_CTL(a, b) (-EINVAL)
90 # define SET_FPEXC_CTL(a, b) (-EINVAL)
93 # define GET_FPEXC_CTL(a, b) (-EINVAL)
96 # define GET_ENDIAN(a, b) (-EINVAL)
99 # define SET_ENDIAN(a, b) (-EINVAL)
102 # define GET_TSC_CTL(a) (-EINVAL)
105 # define SET_TSC_CTL(a) (-EINVAL)
108 # define GET_FP_MODE(a) (-EINVAL)
111 # define SET_FP_MODE(a,b) (-EINVAL)
114 # define SVE_SET_VL(a) (-EINVAL)
117 # define SVE_GET_VL() (-EINVAL)
119 #ifndef PAC_RESET_KEYS
120 # define PAC_RESET_KEYS(a, b) (-EINVAL)
122 #ifndef PAC_SET_ENABLED_KEYS
123 # define PAC_SET_ENABLED_KEYS(a, b, c) (-EINVAL)
125 #ifndef PAC_GET_ENABLED_KEYS
126 # define PAC_GET_ENABLED_KEYS(a) (-EINVAL)
128 #ifndef SET_TAGGED_ADDR_CTRL
129 # define SET_TAGGED_ADDR_CTRL(a) (-EINVAL)
131 #ifndef GET_TAGGED_ADDR_CTRL
132 # define GET_TAGGED_ADDR_CTRL() (-EINVAL)
136 * this is where the system-wide overflow UID and GID are defined, for
137 * architectures that now have 32-bit UID/GID but didn't in the past
140 int overflowuid
= DEFAULT_OVERFLOWUID
;
141 int overflowgid
= DEFAULT_OVERFLOWGID
;
143 EXPORT_SYMBOL(overflowuid
);
144 EXPORT_SYMBOL(overflowgid
);
147 * the same as above, but for filesystems which can only store a 16-bit
148 * UID and GID. as such, this is needed on all architectures
151 int fs_overflowuid
= DEFAULT_FS_OVERFLOWUID
;
152 int fs_overflowgid
= DEFAULT_FS_OVERFLOWGID
;
154 EXPORT_SYMBOL(fs_overflowuid
);
155 EXPORT_SYMBOL(fs_overflowgid
);
158 * Returns true if current's euid is same as p's uid or euid,
159 * or has CAP_SYS_NICE to p's user_ns.
161 * Called with rcu_read_lock, creds are safe
163 static bool set_one_prio_perm(struct task_struct
*p
)
165 const struct cred
*cred
= current_cred(), *pcred
= __task_cred(p
);
167 if (uid_eq(pcred
->uid
, cred
->euid
) ||
168 uid_eq(pcred
->euid
, cred
->euid
))
170 if (ns_capable(pcred
->user_ns
, CAP_SYS_NICE
))
176 * set the priority of a task
177 * - the caller must hold the RCU read lock
179 static int set_one_prio(struct task_struct
*p
, int niceval
, int error
)
183 if (!set_one_prio_perm(p
)) {
187 if (niceval
< task_nice(p
) && !can_nice(p
, niceval
)) {
191 no_nice
= security_task_setnice(p
, niceval
);
198 set_user_nice(p
, niceval
);
203 SYSCALL_DEFINE3(setpriority
, int, which
, int, who
, int, niceval
)
205 struct task_struct
*g
, *p
;
206 struct user_struct
*user
;
207 const struct cred
*cred
= current_cred();
212 if (which
> PRIO_USER
|| which
< PRIO_PROCESS
)
215 /* normalize: avoid signed division (rounding problems) */
217 if (niceval
< MIN_NICE
)
219 if (niceval
> MAX_NICE
)
223 read_lock(&tasklist_lock
);
227 p
= find_task_by_vpid(who
);
231 error
= set_one_prio(p
, niceval
, error
);
235 pgrp
= find_vpid(who
);
237 pgrp
= task_pgrp(current
);
238 do_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
) {
239 error
= set_one_prio(p
, niceval
, error
);
240 } while_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
);
243 uid
= make_kuid(cred
->user_ns
, who
);
247 else if (!uid_eq(uid
, cred
->uid
)) {
248 user
= find_user(uid
);
250 goto out_unlock
; /* No processes for this user */
252 do_each_thread(g
, p
) {
253 if (uid_eq(task_uid(p
), uid
) && task_pid_vnr(p
))
254 error
= set_one_prio(p
, niceval
, error
);
255 } while_each_thread(g
, p
);
256 if (!uid_eq(uid
, cred
->uid
))
257 free_uid(user
); /* For find_user() */
261 read_unlock(&tasklist_lock
);
268 * Ugh. To avoid negative return values, "getpriority()" will
269 * not return the normal nice-value, but a negated value that
270 * has been offset by 20 (ie it returns 40..1 instead of -20..19)
271 * to stay compatible.
273 SYSCALL_DEFINE2(getpriority
, int, which
, int, who
)
275 struct task_struct
*g
, *p
;
276 struct user_struct
*user
;
277 const struct cred
*cred
= current_cred();
278 long niceval
, retval
= -ESRCH
;
282 if (which
> PRIO_USER
|| which
< PRIO_PROCESS
)
286 read_lock(&tasklist_lock
);
290 p
= find_task_by_vpid(who
);
294 niceval
= nice_to_rlimit(task_nice(p
));
295 if (niceval
> retval
)
301 pgrp
= find_vpid(who
);
303 pgrp
= task_pgrp(current
);
304 do_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
) {
305 niceval
= nice_to_rlimit(task_nice(p
));
306 if (niceval
> retval
)
308 } while_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
);
311 uid
= make_kuid(cred
->user_ns
, who
);
315 else if (!uid_eq(uid
, cred
->uid
)) {
316 user
= find_user(uid
);
318 goto out_unlock
; /* No processes for this user */
320 do_each_thread(g
, p
) {
321 if (uid_eq(task_uid(p
), uid
) && task_pid_vnr(p
)) {
322 niceval
= nice_to_rlimit(task_nice(p
));
323 if (niceval
> retval
)
326 } while_each_thread(g
, p
);
327 if (!uid_eq(uid
, cred
->uid
))
328 free_uid(user
); /* for find_user() */
332 read_unlock(&tasklist_lock
);
339 * Unprivileged users may change the real gid to the effective gid
340 * or vice versa. (BSD-style)
342 * If you set the real gid at all, or set the effective gid to a value not
343 * equal to the real gid, then the saved gid is set to the new effective gid.
345 * This makes it possible for a setgid program to completely drop its
346 * privileges, which is often a useful assertion to make when you are doing
347 * a security audit over a program.
349 * The general idea is that a program which uses just setregid() will be
350 * 100% compatible with BSD. A program which uses just setgid() will be
351 * 100% compatible with POSIX with saved IDs.
353 * SMP: There are not races, the GIDs are checked only by filesystem
354 * operations (as far as semantic preservation is concerned).
356 #ifdef CONFIG_MULTIUSER
357 long __sys_setregid(gid_t rgid
, gid_t egid
)
359 struct user_namespace
*ns
= current_user_ns();
360 const struct cred
*old
;
365 krgid
= make_kgid(ns
, rgid
);
366 kegid
= make_kgid(ns
, egid
);
368 if ((rgid
!= (gid_t
) -1) && !gid_valid(krgid
))
370 if ((egid
!= (gid_t
) -1) && !gid_valid(kegid
))
373 new = prepare_creds();
376 old
= current_cred();
379 if (rgid
!= (gid_t
) -1) {
380 if (gid_eq(old
->gid
, krgid
) ||
381 gid_eq(old
->egid
, krgid
) ||
382 ns_capable_setid(old
->user_ns
, CAP_SETGID
))
387 if (egid
!= (gid_t
) -1) {
388 if (gid_eq(old
->gid
, kegid
) ||
389 gid_eq(old
->egid
, kegid
) ||
390 gid_eq(old
->sgid
, kegid
) ||
391 ns_capable_setid(old
->user_ns
, CAP_SETGID
))
397 if (rgid
!= (gid_t
) -1 ||
398 (egid
!= (gid_t
) -1 && !gid_eq(kegid
, old
->gid
)))
399 new->sgid
= new->egid
;
400 new->fsgid
= new->egid
;
402 retval
= security_task_fix_setgid(new, old
, LSM_SETID_RE
);
406 return commit_creds(new);
413 SYSCALL_DEFINE2(setregid
, gid_t
, rgid
, gid_t
, egid
)
415 return __sys_setregid(rgid
, egid
);
419 * setgid() is implemented like SysV w/ SAVED_IDS
421 * SMP: Same implicit races as above.
423 long __sys_setgid(gid_t gid
)
425 struct user_namespace
*ns
= current_user_ns();
426 const struct cred
*old
;
431 kgid
= make_kgid(ns
, gid
);
432 if (!gid_valid(kgid
))
435 new = prepare_creds();
438 old
= current_cred();
441 if (ns_capable_setid(old
->user_ns
, CAP_SETGID
))
442 new->gid
= new->egid
= new->sgid
= new->fsgid
= kgid
;
443 else if (gid_eq(kgid
, old
->gid
) || gid_eq(kgid
, old
->sgid
))
444 new->egid
= new->fsgid
= kgid
;
448 retval
= security_task_fix_setgid(new, old
, LSM_SETID_ID
);
452 return commit_creds(new);
459 SYSCALL_DEFINE1(setgid
, gid_t
, gid
)
461 return __sys_setgid(gid
);
465 * change the user struct in a credentials set to match the new UID
467 static int set_user(struct cred
*new)
469 struct user_struct
*new_user
;
471 new_user
= alloc_uid(new->uid
);
476 new->user
= new_user
;
480 static void flag_nproc_exceeded(struct cred
*new)
482 if (new->ucounts
== current_ucounts())
486 * We don't fail in case of NPROC limit excess here because too many
487 * poorly written programs don't check set*uid() return code, assuming
488 * it never fails if called by root. We may still enforce NPROC limit
489 * for programs doing set*uid()+execve() by harmlessly deferring the
490 * failure to the execve() stage.
492 if (is_ucounts_overlimit(new->ucounts
, UCOUNT_RLIMIT_NPROC
, rlimit(RLIMIT_NPROC
)) &&
493 new->user
!= INIT_USER
)
494 current
->flags
|= PF_NPROC_EXCEEDED
;
496 current
->flags
&= ~PF_NPROC_EXCEEDED
;
500 * Unprivileged users may change the real uid to the effective uid
501 * or vice versa. (BSD-style)
503 * If you set the real uid at all, or set the effective uid to a value not
504 * equal to the real uid, then the saved uid is set to the new effective uid.
506 * This makes it possible for a setuid program to completely drop its
507 * privileges, which is often a useful assertion to make when you are doing
508 * a security audit over a program.
510 * The general idea is that a program which uses just setreuid() will be
511 * 100% compatible with BSD. A program which uses just setuid() will be
512 * 100% compatible with POSIX with saved IDs.
514 long __sys_setreuid(uid_t ruid
, uid_t euid
)
516 struct user_namespace
*ns
= current_user_ns();
517 const struct cred
*old
;
522 kruid
= make_kuid(ns
, ruid
);
523 keuid
= make_kuid(ns
, euid
);
525 if ((ruid
!= (uid_t
) -1) && !uid_valid(kruid
))
527 if ((euid
!= (uid_t
) -1) && !uid_valid(keuid
))
530 new = prepare_creds();
533 old
= current_cred();
536 if (ruid
!= (uid_t
) -1) {
538 if (!uid_eq(old
->uid
, kruid
) &&
539 !uid_eq(old
->euid
, kruid
) &&
540 !ns_capable_setid(old
->user_ns
, CAP_SETUID
))
544 if (euid
!= (uid_t
) -1) {
546 if (!uid_eq(old
->uid
, keuid
) &&
547 !uid_eq(old
->euid
, keuid
) &&
548 !uid_eq(old
->suid
, keuid
) &&
549 !ns_capable_setid(old
->user_ns
, CAP_SETUID
))
553 if (!uid_eq(new->uid
, old
->uid
)) {
554 retval
= set_user(new);
558 if (ruid
!= (uid_t
) -1 ||
559 (euid
!= (uid_t
) -1 && !uid_eq(keuid
, old
->uid
)))
560 new->suid
= new->euid
;
561 new->fsuid
= new->euid
;
563 retval
= security_task_fix_setuid(new, old
, LSM_SETID_RE
);
567 retval
= set_cred_ucounts(new);
571 flag_nproc_exceeded(new);
572 return commit_creds(new);
579 SYSCALL_DEFINE2(setreuid
, uid_t
, ruid
, uid_t
, euid
)
581 return __sys_setreuid(ruid
, euid
);
585 * setuid() is implemented like SysV with SAVED_IDS
587 * Note that SAVED_ID's is deficient in that a setuid root program
588 * like sendmail, for example, cannot set its uid to be a normal
589 * user and then switch back, because if you're root, setuid() sets
590 * the saved uid too. If you don't like this, blame the bright people
591 * in the POSIX committee and/or USG. Note that the BSD-style setreuid()
592 * will allow a root program to temporarily drop privileges and be able to
593 * regain them by swapping the real and effective uid.
595 long __sys_setuid(uid_t uid
)
597 struct user_namespace
*ns
= current_user_ns();
598 const struct cred
*old
;
603 kuid
= make_kuid(ns
, uid
);
604 if (!uid_valid(kuid
))
607 new = prepare_creds();
610 old
= current_cred();
613 if (ns_capable_setid(old
->user_ns
, CAP_SETUID
)) {
614 new->suid
= new->uid
= kuid
;
615 if (!uid_eq(kuid
, old
->uid
)) {
616 retval
= set_user(new);
620 } else if (!uid_eq(kuid
, old
->uid
) && !uid_eq(kuid
, new->suid
)) {
624 new->fsuid
= new->euid
= kuid
;
626 retval
= security_task_fix_setuid(new, old
, LSM_SETID_ID
);
630 retval
= set_cred_ucounts(new);
634 flag_nproc_exceeded(new);
635 return commit_creds(new);
642 SYSCALL_DEFINE1(setuid
, uid_t
, uid
)
644 return __sys_setuid(uid
);
649 * This function implements a generic ability to update ruid, euid,
650 * and suid. This allows you to implement the 4.4 compatible seteuid().
652 long __sys_setresuid(uid_t ruid
, uid_t euid
, uid_t suid
)
654 struct user_namespace
*ns
= current_user_ns();
655 const struct cred
*old
;
658 kuid_t kruid
, keuid
, ksuid
;
660 kruid
= make_kuid(ns
, ruid
);
661 keuid
= make_kuid(ns
, euid
);
662 ksuid
= make_kuid(ns
, suid
);
664 if ((ruid
!= (uid_t
) -1) && !uid_valid(kruid
))
667 if ((euid
!= (uid_t
) -1) && !uid_valid(keuid
))
670 if ((suid
!= (uid_t
) -1) && !uid_valid(ksuid
))
673 new = prepare_creds();
677 old
= current_cred();
680 if (!ns_capable_setid(old
->user_ns
, CAP_SETUID
)) {
681 if (ruid
!= (uid_t
) -1 && !uid_eq(kruid
, old
->uid
) &&
682 !uid_eq(kruid
, old
->euid
) && !uid_eq(kruid
, old
->suid
))
684 if (euid
!= (uid_t
) -1 && !uid_eq(keuid
, old
->uid
) &&
685 !uid_eq(keuid
, old
->euid
) && !uid_eq(keuid
, old
->suid
))
687 if (suid
!= (uid_t
) -1 && !uid_eq(ksuid
, old
->uid
) &&
688 !uid_eq(ksuid
, old
->euid
) && !uid_eq(ksuid
, old
->suid
))
692 if (ruid
!= (uid_t
) -1) {
694 if (!uid_eq(kruid
, old
->uid
)) {
695 retval
= set_user(new);
700 if (euid
!= (uid_t
) -1)
702 if (suid
!= (uid_t
) -1)
704 new->fsuid
= new->euid
;
706 retval
= security_task_fix_setuid(new, old
, LSM_SETID_RES
);
710 retval
= set_cred_ucounts(new);
714 flag_nproc_exceeded(new);
715 return commit_creds(new);
722 SYSCALL_DEFINE3(setresuid
, uid_t
, ruid
, uid_t
, euid
, uid_t
, suid
)
724 return __sys_setresuid(ruid
, euid
, suid
);
727 SYSCALL_DEFINE3(getresuid
, uid_t __user
*, ruidp
, uid_t __user
*, euidp
, uid_t __user
*, suidp
)
729 const struct cred
*cred
= current_cred();
731 uid_t ruid
, euid
, suid
;
733 ruid
= from_kuid_munged(cred
->user_ns
, cred
->uid
);
734 euid
= from_kuid_munged(cred
->user_ns
, cred
->euid
);
735 suid
= from_kuid_munged(cred
->user_ns
, cred
->suid
);
737 retval
= put_user(ruid
, ruidp
);
739 retval
= put_user(euid
, euidp
);
741 return put_user(suid
, suidp
);
747 * Same as above, but for rgid, egid, sgid.
749 long __sys_setresgid(gid_t rgid
, gid_t egid
, gid_t sgid
)
751 struct user_namespace
*ns
= current_user_ns();
752 const struct cred
*old
;
755 kgid_t krgid
, kegid
, ksgid
;
757 krgid
= make_kgid(ns
, rgid
);
758 kegid
= make_kgid(ns
, egid
);
759 ksgid
= make_kgid(ns
, sgid
);
761 if ((rgid
!= (gid_t
) -1) && !gid_valid(krgid
))
763 if ((egid
!= (gid_t
) -1) && !gid_valid(kegid
))
765 if ((sgid
!= (gid_t
) -1) && !gid_valid(ksgid
))
768 new = prepare_creds();
771 old
= current_cred();
774 if (!ns_capable_setid(old
->user_ns
, CAP_SETGID
)) {
775 if (rgid
!= (gid_t
) -1 && !gid_eq(krgid
, old
->gid
) &&
776 !gid_eq(krgid
, old
->egid
) && !gid_eq(krgid
, old
->sgid
))
778 if (egid
!= (gid_t
) -1 && !gid_eq(kegid
, old
->gid
) &&
779 !gid_eq(kegid
, old
->egid
) && !gid_eq(kegid
, old
->sgid
))
781 if (sgid
!= (gid_t
) -1 && !gid_eq(ksgid
, old
->gid
) &&
782 !gid_eq(ksgid
, old
->egid
) && !gid_eq(ksgid
, old
->sgid
))
786 if (rgid
!= (gid_t
) -1)
788 if (egid
!= (gid_t
) -1)
790 if (sgid
!= (gid_t
) -1)
792 new->fsgid
= new->egid
;
794 retval
= security_task_fix_setgid(new, old
, LSM_SETID_RES
);
798 return commit_creds(new);
805 SYSCALL_DEFINE3(setresgid
, gid_t
, rgid
, gid_t
, egid
, gid_t
, sgid
)
807 return __sys_setresgid(rgid
, egid
, sgid
);
810 SYSCALL_DEFINE3(getresgid
, gid_t __user
*, rgidp
, gid_t __user
*, egidp
, gid_t __user
*, sgidp
)
812 const struct cred
*cred
= current_cred();
814 gid_t rgid
, egid
, sgid
;
816 rgid
= from_kgid_munged(cred
->user_ns
, cred
->gid
);
817 egid
= from_kgid_munged(cred
->user_ns
, cred
->egid
);
818 sgid
= from_kgid_munged(cred
->user_ns
, cred
->sgid
);
820 retval
= put_user(rgid
, rgidp
);
822 retval
= put_user(egid
, egidp
);
824 retval
= put_user(sgid
, sgidp
);
832 * "setfsuid()" sets the fsuid - the uid used for filesystem checks. This
833 * is used for "access()" and for the NFS daemon (letting nfsd stay at
834 * whatever uid it wants to). It normally shadows "euid", except when
835 * explicitly set by setfsuid() or for access..
837 long __sys_setfsuid(uid_t uid
)
839 const struct cred
*old
;
844 old
= current_cred();
845 old_fsuid
= from_kuid_munged(old
->user_ns
, old
->fsuid
);
847 kuid
= make_kuid(old
->user_ns
, uid
);
848 if (!uid_valid(kuid
))
851 new = prepare_creds();
855 if (uid_eq(kuid
, old
->uid
) || uid_eq(kuid
, old
->euid
) ||
856 uid_eq(kuid
, old
->suid
) || uid_eq(kuid
, old
->fsuid
) ||
857 ns_capable_setid(old
->user_ns
, CAP_SETUID
)) {
858 if (!uid_eq(kuid
, old
->fsuid
)) {
860 if (security_task_fix_setuid(new, old
, LSM_SETID_FS
) == 0)
873 SYSCALL_DEFINE1(setfsuid
, uid_t
, uid
)
875 return __sys_setfsuid(uid
);
879 * Samma på svenska..
881 long __sys_setfsgid(gid_t gid
)
883 const struct cred
*old
;
888 old
= current_cred();
889 old_fsgid
= from_kgid_munged(old
->user_ns
, old
->fsgid
);
891 kgid
= make_kgid(old
->user_ns
, gid
);
892 if (!gid_valid(kgid
))
895 new = prepare_creds();
899 if (gid_eq(kgid
, old
->gid
) || gid_eq(kgid
, old
->egid
) ||
900 gid_eq(kgid
, old
->sgid
) || gid_eq(kgid
, old
->fsgid
) ||
901 ns_capable_setid(old
->user_ns
, CAP_SETGID
)) {
902 if (!gid_eq(kgid
, old
->fsgid
)) {
904 if (security_task_fix_setgid(new,old
,LSM_SETID_FS
) == 0)
917 SYSCALL_DEFINE1(setfsgid
, gid_t
, gid
)
919 return __sys_setfsgid(gid
);
921 #endif /* CONFIG_MULTIUSER */
924 * sys_getpid - return the thread group id of the current process
926 * Note, despite the name, this returns the tgid not the pid. The tgid and
927 * the pid are identical unless CLONE_THREAD was specified on clone() in
928 * which case the tgid is the same in all threads of the same group.
930 * This is SMP safe as current->tgid does not change.
932 SYSCALL_DEFINE0(getpid
)
934 return task_tgid_vnr(current
);
937 /* Thread ID - the internal kernel "pid" */
938 SYSCALL_DEFINE0(gettid
)
940 return task_pid_vnr(current
);
944 * Accessing ->real_parent is not SMP-safe, it could
945 * change from under us. However, we can use a stale
946 * value of ->real_parent under rcu_read_lock(), see
947 * release_task()->call_rcu(delayed_put_task_struct).
949 SYSCALL_DEFINE0(getppid
)
954 pid
= task_tgid_vnr(rcu_dereference(current
->real_parent
));
960 SYSCALL_DEFINE0(getuid
)
962 /* Only we change this so SMP safe */
963 return from_kuid_munged(current_user_ns(), current_uid());
966 SYSCALL_DEFINE0(geteuid
)
968 /* Only we change this so SMP safe */
969 return from_kuid_munged(current_user_ns(), current_euid());
972 SYSCALL_DEFINE0(getgid
)
974 /* Only we change this so SMP safe */
975 return from_kgid_munged(current_user_ns(), current_gid());
978 SYSCALL_DEFINE0(getegid
)
980 /* Only we change this so SMP safe */
981 return from_kgid_munged(current_user_ns(), current_egid());
984 static void do_sys_times(struct tms
*tms
)
986 u64 tgutime
, tgstime
, cutime
, cstime
;
988 thread_group_cputime_adjusted(current
, &tgutime
, &tgstime
);
989 cutime
= current
->signal
->cutime
;
990 cstime
= current
->signal
->cstime
;
991 tms
->tms_utime
= nsec_to_clock_t(tgutime
);
992 tms
->tms_stime
= nsec_to_clock_t(tgstime
);
993 tms
->tms_cutime
= nsec_to_clock_t(cutime
);
994 tms
->tms_cstime
= nsec_to_clock_t(cstime
);
997 SYSCALL_DEFINE1(times
, struct tms __user
*, tbuf
)
1003 if (copy_to_user(tbuf
, &tmp
, sizeof(struct tms
)))
1006 force_successful_syscall_return();
1007 return (long) jiffies_64_to_clock_t(get_jiffies_64());
1010 #ifdef CONFIG_COMPAT
1011 static compat_clock_t
clock_t_to_compat_clock_t(clock_t x
)
1013 return compat_jiffies_to_clock_t(clock_t_to_jiffies(x
));
1016 COMPAT_SYSCALL_DEFINE1(times
, struct compat_tms __user
*, tbuf
)
1020 struct compat_tms tmp
;
1023 /* Convert our struct tms to the compat version. */
1024 tmp
.tms_utime
= clock_t_to_compat_clock_t(tms
.tms_utime
);
1025 tmp
.tms_stime
= clock_t_to_compat_clock_t(tms
.tms_stime
);
1026 tmp
.tms_cutime
= clock_t_to_compat_clock_t(tms
.tms_cutime
);
1027 tmp
.tms_cstime
= clock_t_to_compat_clock_t(tms
.tms_cstime
);
1028 if (copy_to_user(tbuf
, &tmp
, sizeof(tmp
)))
1031 force_successful_syscall_return();
1032 return compat_jiffies_to_clock_t(jiffies
);
1037 * This needs some heavy checking ...
1038 * I just haven't the stomach for it. I also don't fully
1039 * understand sessions/pgrp etc. Let somebody who does explain it.
1041 * OK, I think I have the protection semantics right.... this is really
1042 * only important on a multi-user system anyway, to make sure one user
1043 * can't send a signal to a process owned by another. -TYT, 12/12/91
1045 * !PF_FORKNOEXEC check to conform completely to POSIX.
1047 SYSCALL_DEFINE2(setpgid
, pid_t
, pid
, pid_t
, pgid
)
1049 struct task_struct
*p
;
1050 struct task_struct
*group_leader
= current
->group_leader
;
1055 pid
= task_pid_vnr(group_leader
);
1062 /* From this point forward we keep holding onto the tasklist lock
1063 * so that our parent does not change from under us. -DaveM
1065 write_lock_irq(&tasklist_lock
);
1068 p
= find_task_by_vpid(pid
);
1073 if (!thread_group_leader(p
))
1076 if (same_thread_group(p
->real_parent
, group_leader
)) {
1078 if (task_session(p
) != task_session(group_leader
))
1081 if (!(p
->flags
& PF_FORKNOEXEC
))
1085 if (p
!= group_leader
)
1090 if (p
->signal
->leader
)
1095 struct task_struct
*g
;
1097 pgrp
= find_vpid(pgid
);
1098 g
= pid_task(pgrp
, PIDTYPE_PGID
);
1099 if (!g
|| task_session(g
) != task_session(group_leader
))
1103 err
= security_task_setpgid(p
, pgid
);
1107 if (task_pgrp(p
) != pgrp
)
1108 change_pid(p
, PIDTYPE_PGID
, pgrp
);
1112 /* All paths lead to here, thus we are safe. -DaveM */
1113 write_unlock_irq(&tasklist_lock
);
1118 static int do_getpgid(pid_t pid
)
1120 struct task_struct
*p
;
1126 grp
= task_pgrp(current
);
1129 p
= find_task_by_vpid(pid
);
1136 retval
= security_task_getpgid(p
);
1140 retval
= pid_vnr(grp
);
1146 SYSCALL_DEFINE1(getpgid
, pid_t
, pid
)
1148 return do_getpgid(pid
);
1151 #ifdef __ARCH_WANT_SYS_GETPGRP
1153 SYSCALL_DEFINE0(getpgrp
)
1155 return do_getpgid(0);
1160 SYSCALL_DEFINE1(getsid
, pid_t
, pid
)
1162 struct task_struct
*p
;
1168 sid
= task_session(current
);
1171 p
= find_task_by_vpid(pid
);
1174 sid
= task_session(p
);
1178 retval
= security_task_getsid(p
);
1182 retval
= pid_vnr(sid
);
1188 static void set_special_pids(struct pid
*pid
)
1190 struct task_struct
*curr
= current
->group_leader
;
1192 if (task_session(curr
) != pid
)
1193 change_pid(curr
, PIDTYPE_SID
, pid
);
1195 if (task_pgrp(curr
) != pid
)
1196 change_pid(curr
, PIDTYPE_PGID
, pid
);
1199 int ksys_setsid(void)
1201 struct task_struct
*group_leader
= current
->group_leader
;
1202 struct pid
*sid
= task_pid(group_leader
);
1203 pid_t session
= pid_vnr(sid
);
1206 write_lock_irq(&tasklist_lock
);
1207 /* Fail if I am already a session leader */
1208 if (group_leader
->signal
->leader
)
1211 /* Fail if a process group id already exists that equals the
1212 * proposed session id.
1214 if (pid_task(sid
, PIDTYPE_PGID
))
1217 group_leader
->signal
->leader
= 1;
1218 set_special_pids(sid
);
1220 proc_clear_tty(group_leader
);
1224 write_unlock_irq(&tasklist_lock
);
1226 proc_sid_connector(group_leader
);
1227 sched_autogroup_create_attach(group_leader
);
1232 SYSCALL_DEFINE0(setsid
)
1234 return ksys_setsid();
1237 DECLARE_RWSEM(uts_sem
);
1239 #ifdef COMPAT_UTS_MACHINE
1240 static char compat_uts_machine
[__OLD_UTS_LEN
+1] = COMPAT_UTS_MACHINE
;
1242 static int __init
parse_compat_uts_machine(char *arg
)
1244 strncpy(compat_uts_machine
, arg
, __OLD_UTS_LEN
);
1245 compat_uts_machine
[__OLD_UTS_LEN
] = 0;
1248 early_param("compat_uts_machine", parse_compat_uts_machine
);
1250 #undef COMPAT_UTS_MACHINE
1251 #define COMPAT_UTS_MACHINE compat_uts_machine
1254 #ifdef COMPAT_UTS_MACHINE
1255 #define override_architecture(name) \
1256 (personality(current->personality) == PER_LINUX32 && \
1257 copy_to_user(name->machine, COMPAT_UTS_MACHINE, \
1258 sizeof(COMPAT_UTS_MACHINE)))
1260 #define override_architecture(name) 0
1264 * Work around broken programs that cannot handle "Linux 3.0".
1265 * Instead we map 3.x to 2.6.40+x, so e.g. 3.0 would be 2.6.40
1266 * And we map 4.x and later versions to 2.6.60+x, so 4.0/5.0/6.0/... would be
1269 static int override_release(char __user
*release
, size_t len
)
1273 if (current
->personality
& UNAME26
) {
1274 const char *rest
= UTS_RELEASE
;
1275 char buf
[65] = { 0 };
1281 if (*rest
== '.' && ++ndots
>= 3)
1283 if (!isdigit(*rest
) && *rest
!= '.')
1287 v
= LINUX_VERSION_PATCHLEVEL
+ 60;
1288 copy
= clamp_t(size_t, len
, 1, sizeof(buf
));
1289 copy
= scnprintf(buf
, copy
, "2.6.%u%s", v
, rest
);
1290 ret
= copy_to_user(release
, buf
, copy
+ 1);
1295 SYSCALL_DEFINE1(newuname
, struct new_utsname __user
*, name
)
1297 struct new_utsname tmp
;
1299 down_read(&uts_sem
);
1300 memcpy(&tmp
, utsname(), sizeof(tmp
));
1302 if (copy_to_user(name
, &tmp
, sizeof(tmp
)))
1305 if (override_release(name
->release
, sizeof(name
->release
)))
1307 if (override_architecture(name
))
1312 #ifdef __ARCH_WANT_SYS_OLD_UNAME
1316 SYSCALL_DEFINE1(uname
, struct old_utsname __user
*, name
)
1318 struct old_utsname tmp
;
1323 down_read(&uts_sem
);
1324 memcpy(&tmp
, utsname(), sizeof(tmp
));
1326 if (copy_to_user(name
, &tmp
, sizeof(tmp
)))
1329 if (override_release(name
->release
, sizeof(name
->release
)))
1331 if (override_architecture(name
))
1336 SYSCALL_DEFINE1(olduname
, struct oldold_utsname __user
*, name
)
1338 struct oldold_utsname tmp
;
1343 memset(&tmp
, 0, sizeof(tmp
));
1345 down_read(&uts_sem
);
1346 memcpy(&tmp
.sysname
, &utsname()->sysname
, __OLD_UTS_LEN
);
1347 memcpy(&tmp
.nodename
, &utsname()->nodename
, __OLD_UTS_LEN
);
1348 memcpy(&tmp
.release
, &utsname()->release
, __OLD_UTS_LEN
);
1349 memcpy(&tmp
.version
, &utsname()->version
, __OLD_UTS_LEN
);
1350 memcpy(&tmp
.machine
, &utsname()->machine
, __OLD_UTS_LEN
);
1352 if (copy_to_user(name
, &tmp
, sizeof(tmp
)))
1355 if (override_architecture(name
))
1357 if (override_release(name
->release
, sizeof(name
->release
)))
1363 SYSCALL_DEFINE2(sethostname
, char __user
*, name
, int, len
)
1366 char tmp
[__NEW_UTS_LEN
];
1368 if (!ns_capable(current
->nsproxy
->uts_ns
->user_ns
, CAP_SYS_ADMIN
))
1371 if (len
< 0 || len
> __NEW_UTS_LEN
)
1374 if (!copy_from_user(tmp
, name
, len
)) {
1375 struct new_utsname
*u
;
1377 down_write(&uts_sem
);
1379 memcpy(u
->nodename
, tmp
, len
);
1380 memset(u
->nodename
+ len
, 0, sizeof(u
->nodename
) - len
);
1382 uts_proc_notify(UTS_PROC_HOSTNAME
);
1388 #ifdef __ARCH_WANT_SYS_GETHOSTNAME
1390 SYSCALL_DEFINE2(gethostname
, char __user
*, name
, int, len
)
1393 struct new_utsname
*u
;
1394 char tmp
[__NEW_UTS_LEN
+ 1];
1398 down_read(&uts_sem
);
1400 i
= 1 + strlen(u
->nodename
);
1403 memcpy(tmp
, u
->nodename
, i
);
1405 if (copy_to_user(name
, tmp
, i
))
1413 * Only setdomainname; getdomainname can be implemented by calling
1416 SYSCALL_DEFINE2(setdomainname
, char __user
*, name
, int, len
)
1419 char tmp
[__NEW_UTS_LEN
];
1421 if (!ns_capable(current
->nsproxy
->uts_ns
->user_ns
, CAP_SYS_ADMIN
))
1423 if (len
< 0 || len
> __NEW_UTS_LEN
)
1427 if (!copy_from_user(tmp
, name
, len
)) {
1428 struct new_utsname
*u
;
1430 down_write(&uts_sem
);
1432 memcpy(u
->domainname
, tmp
, len
);
1433 memset(u
->domainname
+ len
, 0, sizeof(u
->domainname
) - len
);
1435 uts_proc_notify(UTS_PROC_DOMAINNAME
);
1441 SYSCALL_DEFINE2(getrlimit
, unsigned int, resource
, struct rlimit __user
*, rlim
)
1443 struct rlimit value
;
1446 ret
= do_prlimit(current
, resource
, NULL
, &value
);
1448 ret
= copy_to_user(rlim
, &value
, sizeof(*rlim
)) ? -EFAULT
: 0;
1453 #ifdef CONFIG_COMPAT
1455 COMPAT_SYSCALL_DEFINE2(setrlimit
, unsigned int, resource
,
1456 struct compat_rlimit __user
*, rlim
)
1459 struct compat_rlimit r32
;
1461 if (copy_from_user(&r32
, rlim
, sizeof(struct compat_rlimit
)))
1464 if (r32
.rlim_cur
== COMPAT_RLIM_INFINITY
)
1465 r
.rlim_cur
= RLIM_INFINITY
;
1467 r
.rlim_cur
= r32
.rlim_cur
;
1468 if (r32
.rlim_max
== COMPAT_RLIM_INFINITY
)
1469 r
.rlim_max
= RLIM_INFINITY
;
1471 r
.rlim_max
= r32
.rlim_max
;
1472 return do_prlimit(current
, resource
, &r
, NULL
);
1475 COMPAT_SYSCALL_DEFINE2(getrlimit
, unsigned int, resource
,
1476 struct compat_rlimit __user
*, rlim
)
1481 ret
= do_prlimit(current
, resource
, NULL
, &r
);
1483 struct compat_rlimit r32
;
1484 if (r
.rlim_cur
> COMPAT_RLIM_INFINITY
)
1485 r32
.rlim_cur
= COMPAT_RLIM_INFINITY
;
1487 r32
.rlim_cur
= r
.rlim_cur
;
1488 if (r
.rlim_max
> COMPAT_RLIM_INFINITY
)
1489 r32
.rlim_max
= COMPAT_RLIM_INFINITY
;
1491 r32
.rlim_max
= r
.rlim_max
;
1493 if (copy_to_user(rlim
, &r32
, sizeof(struct compat_rlimit
)))
1501 #ifdef __ARCH_WANT_SYS_OLD_GETRLIMIT
1504 * Back compatibility for getrlimit. Needed for some apps.
1506 SYSCALL_DEFINE2(old_getrlimit
, unsigned int, resource
,
1507 struct rlimit __user
*, rlim
)
1510 if (resource
>= RLIM_NLIMITS
)
1513 resource
= array_index_nospec(resource
, RLIM_NLIMITS
);
1514 task_lock(current
->group_leader
);
1515 x
= current
->signal
->rlim
[resource
];
1516 task_unlock(current
->group_leader
);
1517 if (x
.rlim_cur
> 0x7FFFFFFF)
1518 x
.rlim_cur
= 0x7FFFFFFF;
1519 if (x
.rlim_max
> 0x7FFFFFFF)
1520 x
.rlim_max
= 0x7FFFFFFF;
1521 return copy_to_user(rlim
, &x
, sizeof(x
)) ? -EFAULT
: 0;
1524 #ifdef CONFIG_COMPAT
1525 COMPAT_SYSCALL_DEFINE2(old_getrlimit
, unsigned int, resource
,
1526 struct compat_rlimit __user
*, rlim
)
1530 if (resource
>= RLIM_NLIMITS
)
1533 resource
= array_index_nospec(resource
, RLIM_NLIMITS
);
1534 task_lock(current
->group_leader
);
1535 r
= current
->signal
->rlim
[resource
];
1536 task_unlock(current
->group_leader
);
1537 if (r
.rlim_cur
> 0x7FFFFFFF)
1538 r
.rlim_cur
= 0x7FFFFFFF;
1539 if (r
.rlim_max
> 0x7FFFFFFF)
1540 r
.rlim_max
= 0x7FFFFFFF;
1542 if (put_user(r
.rlim_cur
, &rlim
->rlim_cur
) ||
1543 put_user(r
.rlim_max
, &rlim
->rlim_max
))
1551 static inline bool rlim64_is_infinity(__u64 rlim64
)
1553 #if BITS_PER_LONG < 64
1554 return rlim64
>= ULONG_MAX
;
1556 return rlim64
== RLIM64_INFINITY
;
1560 static void rlim_to_rlim64(const struct rlimit
*rlim
, struct rlimit64
*rlim64
)
1562 if (rlim
->rlim_cur
== RLIM_INFINITY
)
1563 rlim64
->rlim_cur
= RLIM64_INFINITY
;
1565 rlim64
->rlim_cur
= rlim
->rlim_cur
;
1566 if (rlim
->rlim_max
== RLIM_INFINITY
)
1567 rlim64
->rlim_max
= RLIM64_INFINITY
;
1569 rlim64
->rlim_max
= rlim
->rlim_max
;
1572 static void rlim64_to_rlim(const struct rlimit64
*rlim64
, struct rlimit
*rlim
)
1574 if (rlim64_is_infinity(rlim64
->rlim_cur
))
1575 rlim
->rlim_cur
= RLIM_INFINITY
;
1577 rlim
->rlim_cur
= (unsigned long)rlim64
->rlim_cur
;
1578 if (rlim64_is_infinity(rlim64
->rlim_max
))
1579 rlim
->rlim_max
= RLIM_INFINITY
;
1581 rlim
->rlim_max
= (unsigned long)rlim64
->rlim_max
;
1584 /* make sure you are allowed to change @tsk limits before calling this */
1585 int do_prlimit(struct task_struct
*tsk
, unsigned int resource
,
1586 struct rlimit
*new_rlim
, struct rlimit
*old_rlim
)
1588 struct rlimit
*rlim
;
1591 if (resource
>= RLIM_NLIMITS
)
1594 if (new_rlim
->rlim_cur
> new_rlim
->rlim_max
)
1596 if (resource
== RLIMIT_NOFILE
&&
1597 new_rlim
->rlim_max
> sysctl_nr_open
)
1601 /* protect tsk->signal and tsk->sighand from disappearing */
1602 read_lock(&tasklist_lock
);
1603 if (!tsk
->sighand
) {
1608 rlim
= tsk
->signal
->rlim
+ resource
;
1609 task_lock(tsk
->group_leader
);
1611 /* Keep the capable check against init_user_ns until
1612 cgroups can contain all limits */
1613 if (new_rlim
->rlim_max
> rlim
->rlim_max
&&
1614 !capable(CAP_SYS_RESOURCE
))
1617 retval
= security_task_setrlimit(tsk
, resource
, new_rlim
);
1625 task_unlock(tsk
->group_leader
);
1628 * RLIMIT_CPU handling. Arm the posix CPU timer if the limit is not
1629 * infinite. In case of RLIM_INFINITY the posix CPU timer code
1630 * ignores the rlimit.
1632 if (!retval
&& new_rlim
&& resource
== RLIMIT_CPU
&&
1633 new_rlim
->rlim_cur
!= RLIM_INFINITY
&&
1634 IS_ENABLED(CONFIG_POSIX_TIMERS
))
1635 update_rlimit_cpu(tsk
, new_rlim
->rlim_cur
);
1637 read_unlock(&tasklist_lock
);
1641 /* rcu lock must be held */
1642 static int check_prlimit_permission(struct task_struct
*task
,
1645 const struct cred
*cred
= current_cred(), *tcred
;
1648 if (current
== task
)
1651 tcred
= __task_cred(task
);
1652 id_match
= (uid_eq(cred
->uid
, tcred
->euid
) &&
1653 uid_eq(cred
->uid
, tcred
->suid
) &&
1654 uid_eq(cred
->uid
, tcred
->uid
) &&
1655 gid_eq(cred
->gid
, tcred
->egid
) &&
1656 gid_eq(cred
->gid
, tcred
->sgid
) &&
1657 gid_eq(cred
->gid
, tcred
->gid
));
1658 if (!id_match
&& !ns_capable(tcred
->user_ns
, CAP_SYS_RESOURCE
))
1661 return security_task_prlimit(cred
, tcred
, flags
);
1664 SYSCALL_DEFINE4(prlimit64
, pid_t
, pid
, unsigned int, resource
,
1665 const struct rlimit64 __user
*, new_rlim
,
1666 struct rlimit64 __user
*, old_rlim
)
1668 struct rlimit64 old64
, new64
;
1669 struct rlimit old
, new;
1670 struct task_struct
*tsk
;
1671 unsigned int checkflags
= 0;
1675 checkflags
|= LSM_PRLIMIT_READ
;
1678 if (copy_from_user(&new64
, new_rlim
, sizeof(new64
)))
1680 rlim64_to_rlim(&new64
, &new);
1681 checkflags
|= LSM_PRLIMIT_WRITE
;
1685 tsk
= pid
? find_task_by_vpid(pid
) : current
;
1690 ret
= check_prlimit_permission(tsk
, checkflags
);
1695 get_task_struct(tsk
);
1698 ret
= do_prlimit(tsk
, resource
, new_rlim
? &new : NULL
,
1699 old_rlim
? &old
: NULL
);
1701 if (!ret
&& old_rlim
) {
1702 rlim_to_rlim64(&old
, &old64
);
1703 if (copy_to_user(old_rlim
, &old64
, sizeof(old64
)))
1707 put_task_struct(tsk
);
1711 SYSCALL_DEFINE2(setrlimit
, unsigned int, resource
, struct rlimit __user
*, rlim
)
1713 struct rlimit new_rlim
;
1715 if (copy_from_user(&new_rlim
, rlim
, sizeof(*rlim
)))
1717 return do_prlimit(current
, resource
, &new_rlim
, NULL
);
1721 * It would make sense to put struct rusage in the task_struct,
1722 * except that would make the task_struct be *really big*. After
1723 * task_struct gets moved into malloc'ed memory, it would
1724 * make sense to do this. It will make moving the rest of the information
1725 * a lot simpler! (Which we're not doing right now because we're not
1726 * measuring them yet).
1728 * When sampling multiple threads for RUSAGE_SELF, under SMP we might have
1729 * races with threads incrementing their own counters. But since word
1730 * reads are atomic, we either get new values or old values and we don't
1731 * care which for the sums. We always take the siglock to protect reading
1732 * the c* fields from p->signal from races with exit.c updating those
1733 * fields when reaping, so a sample either gets all the additions of a
1734 * given child after it's reaped, or none so this sample is before reaping.
1737 * We need to take the siglock for CHILDEREN, SELF and BOTH
1738 * for the cases current multithreaded, non-current single threaded
1739 * non-current multithreaded. Thread traversal is now safe with
1741 * Strictly speaking, we donot need to take the siglock if we are current and
1742 * single threaded, as no one else can take our signal_struct away, no one
1743 * else can reap the children to update signal->c* counters, and no one else
1744 * can race with the signal-> fields. If we do not take any lock, the
1745 * signal-> fields could be read out of order while another thread was just
1746 * exiting. So we should place a read memory barrier when we avoid the lock.
1747 * On the writer side, write memory barrier is implied in __exit_signal
1748 * as __exit_signal releases the siglock spinlock after updating the signal->
1749 * fields. But we don't do this yet to keep things simple.
1753 static void accumulate_thread_rusage(struct task_struct
*t
, struct rusage
*r
)
1755 r
->ru_nvcsw
+= t
->nvcsw
;
1756 r
->ru_nivcsw
+= t
->nivcsw
;
1757 r
->ru_minflt
+= t
->min_flt
;
1758 r
->ru_majflt
+= t
->maj_flt
;
1759 r
->ru_inblock
+= task_io_get_inblock(t
);
1760 r
->ru_oublock
+= task_io_get_oublock(t
);
1763 void getrusage(struct task_struct
*p
, int who
, struct rusage
*r
)
1765 struct task_struct
*t
;
1766 unsigned long flags
;
1767 u64 tgutime
, tgstime
, utime
, stime
;
1768 unsigned long maxrss
= 0;
1770 memset((char *)r
, 0, sizeof (*r
));
1773 if (who
== RUSAGE_THREAD
) {
1774 task_cputime_adjusted(current
, &utime
, &stime
);
1775 accumulate_thread_rusage(p
, r
);
1776 maxrss
= p
->signal
->maxrss
;
1780 if (!lock_task_sighand(p
, &flags
))
1785 case RUSAGE_CHILDREN
:
1786 utime
= p
->signal
->cutime
;
1787 stime
= p
->signal
->cstime
;
1788 r
->ru_nvcsw
= p
->signal
->cnvcsw
;
1789 r
->ru_nivcsw
= p
->signal
->cnivcsw
;
1790 r
->ru_minflt
= p
->signal
->cmin_flt
;
1791 r
->ru_majflt
= p
->signal
->cmaj_flt
;
1792 r
->ru_inblock
= p
->signal
->cinblock
;
1793 r
->ru_oublock
= p
->signal
->coublock
;
1794 maxrss
= p
->signal
->cmaxrss
;
1796 if (who
== RUSAGE_CHILDREN
)
1801 thread_group_cputime_adjusted(p
, &tgutime
, &tgstime
);
1804 r
->ru_nvcsw
+= p
->signal
->nvcsw
;
1805 r
->ru_nivcsw
+= p
->signal
->nivcsw
;
1806 r
->ru_minflt
+= p
->signal
->min_flt
;
1807 r
->ru_majflt
+= p
->signal
->maj_flt
;
1808 r
->ru_inblock
+= p
->signal
->inblock
;
1809 r
->ru_oublock
+= p
->signal
->oublock
;
1810 if (maxrss
< p
->signal
->maxrss
)
1811 maxrss
= p
->signal
->maxrss
;
1814 accumulate_thread_rusage(t
, r
);
1815 } while_each_thread(p
, t
);
1821 unlock_task_sighand(p
, &flags
);
1824 r
->ru_utime
= ns_to_kernel_old_timeval(utime
);
1825 r
->ru_stime
= ns_to_kernel_old_timeval(stime
);
1827 if (who
!= RUSAGE_CHILDREN
) {
1828 struct mm_struct
*mm
= get_task_mm(p
);
1831 setmax_mm_hiwater_rss(&maxrss
, mm
);
1835 r
->ru_maxrss
= maxrss
* (PAGE_SIZE
/ 1024); /* convert pages to KBs */
1838 SYSCALL_DEFINE2(getrusage
, int, who
, struct rusage __user
*, ru
)
1842 if (who
!= RUSAGE_SELF
&& who
!= RUSAGE_CHILDREN
&&
1843 who
!= RUSAGE_THREAD
)
1846 getrusage(current
, who
, &r
);
1847 return copy_to_user(ru
, &r
, sizeof(r
)) ? -EFAULT
: 0;
1850 #ifdef CONFIG_COMPAT
1851 COMPAT_SYSCALL_DEFINE2(getrusage
, int, who
, struct compat_rusage __user
*, ru
)
1855 if (who
!= RUSAGE_SELF
&& who
!= RUSAGE_CHILDREN
&&
1856 who
!= RUSAGE_THREAD
)
1859 getrusage(current
, who
, &r
);
1860 return put_compat_rusage(&r
, ru
);
1864 SYSCALL_DEFINE1(umask
, int, mask
)
1866 mask
= xchg(¤t
->fs
->umask
, mask
& S_IRWXUGO
);
1870 static int prctl_set_mm_exe_file(struct mm_struct
*mm
, unsigned int fd
)
1873 struct inode
*inode
;
1880 inode
= file_inode(exe
.file
);
1883 * Because the original mm->exe_file points to executable file, make
1884 * sure that this one is executable as well, to avoid breaking an
1888 if (!S_ISREG(inode
->i_mode
) || path_noexec(&exe
.file
->f_path
))
1891 err
= file_permission(exe
.file
, MAY_EXEC
);
1895 err
= replace_mm_exe_file(mm
, exe
.file
);
1902 * Check arithmetic relations of passed addresses.
1904 * WARNING: we don't require any capability here so be very careful
1905 * in what is allowed for modification from userspace.
1907 static int validate_prctl_map_addr(struct prctl_mm_map
*prctl_map
)
1909 unsigned long mmap_max_addr
= TASK_SIZE
;
1910 int error
= -EINVAL
, i
;
1912 static const unsigned char offsets
[] = {
1913 offsetof(struct prctl_mm_map
, start_code
),
1914 offsetof(struct prctl_mm_map
, end_code
),
1915 offsetof(struct prctl_mm_map
, start_data
),
1916 offsetof(struct prctl_mm_map
, end_data
),
1917 offsetof(struct prctl_mm_map
, start_brk
),
1918 offsetof(struct prctl_mm_map
, brk
),
1919 offsetof(struct prctl_mm_map
, start_stack
),
1920 offsetof(struct prctl_mm_map
, arg_start
),
1921 offsetof(struct prctl_mm_map
, arg_end
),
1922 offsetof(struct prctl_mm_map
, env_start
),
1923 offsetof(struct prctl_mm_map
, env_end
),
1927 * Make sure the members are not somewhere outside
1928 * of allowed address space.
1930 for (i
= 0; i
< ARRAY_SIZE(offsets
); i
++) {
1931 u64 val
= *(u64
*)((char *)prctl_map
+ offsets
[i
]);
1933 if ((unsigned long)val
>= mmap_max_addr
||
1934 (unsigned long)val
< mmap_min_addr
)
1939 * Make sure the pairs are ordered.
1941 #define __prctl_check_order(__m1, __op, __m2) \
1942 ((unsigned long)prctl_map->__m1 __op \
1943 (unsigned long)prctl_map->__m2) ? 0 : -EINVAL
1944 error
= __prctl_check_order(start_code
, <, end_code
);
1945 error
|= __prctl_check_order(start_data
,<=, end_data
);
1946 error
|= __prctl_check_order(start_brk
, <=, brk
);
1947 error
|= __prctl_check_order(arg_start
, <=, arg_end
);
1948 error
|= __prctl_check_order(env_start
, <=, env_end
);
1951 #undef __prctl_check_order
1956 * Neither we should allow to override limits if they set.
1958 if (check_data_rlimit(rlimit(RLIMIT_DATA
), prctl_map
->brk
,
1959 prctl_map
->start_brk
, prctl_map
->end_data
,
1960 prctl_map
->start_data
))
1968 #ifdef CONFIG_CHECKPOINT_RESTORE
1969 static int prctl_set_mm_map(int opt
, const void __user
*addr
, unsigned long data_size
)
1971 struct prctl_mm_map prctl_map
= { .exe_fd
= (u32
)-1, };
1972 unsigned long user_auxv
[AT_VECTOR_SIZE
];
1973 struct mm_struct
*mm
= current
->mm
;
1976 BUILD_BUG_ON(sizeof(user_auxv
) != sizeof(mm
->saved_auxv
));
1977 BUILD_BUG_ON(sizeof(struct prctl_mm_map
) > 256);
1979 if (opt
== PR_SET_MM_MAP_SIZE
)
1980 return put_user((unsigned int)sizeof(prctl_map
),
1981 (unsigned int __user
*)addr
);
1983 if (data_size
!= sizeof(prctl_map
))
1986 if (copy_from_user(&prctl_map
, addr
, sizeof(prctl_map
)))
1989 error
= validate_prctl_map_addr(&prctl_map
);
1993 if (prctl_map
.auxv_size
) {
1995 * Someone is trying to cheat the auxv vector.
1997 if (!prctl_map
.auxv
||
1998 prctl_map
.auxv_size
> sizeof(mm
->saved_auxv
))
2001 memset(user_auxv
, 0, sizeof(user_auxv
));
2002 if (copy_from_user(user_auxv
,
2003 (const void __user
*)prctl_map
.auxv
,
2004 prctl_map
.auxv_size
))
2007 /* Last entry must be AT_NULL as specification requires */
2008 user_auxv
[AT_VECTOR_SIZE
- 2] = AT_NULL
;
2009 user_auxv
[AT_VECTOR_SIZE
- 1] = AT_NULL
;
2012 if (prctl_map
.exe_fd
!= (u32
)-1) {
2014 * Check if the current user is checkpoint/restore capable.
2015 * At the time of this writing, it checks for CAP_SYS_ADMIN
2016 * or CAP_CHECKPOINT_RESTORE.
2017 * Note that a user with access to ptrace can masquerade an
2018 * arbitrary program as any executable, even setuid ones.
2019 * This may have implications in the tomoyo subsystem.
2021 if (!checkpoint_restore_ns_capable(current_user_ns()))
2024 error
= prctl_set_mm_exe_file(mm
, prctl_map
.exe_fd
);
2030 * arg_lock protects concurrent updates but we still need mmap_lock for
2031 * read to exclude races with sys_brk.
2036 * We don't validate if these members are pointing to
2037 * real present VMAs because application may have correspond
2038 * VMAs already unmapped and kernel uses these members for statistics
2039 * output in procfs mostly, except
2041 * - @start_brk/@brk which are used in do_brk_flags but kernel lookups
2042 * for VMAs when updating these members so anything wrong written
2043 * here cause kernel to swear at userspace program but won't lead
2044 * to any problem in kernel itself
2047 spin_lock(&mm
->arg_lock
);
2048 mm
->start_code
= prctl_map
.start_code
;
2049 mm
->end_code
= prctl_map
.end_code
;
2050 mm
->start_data
= prctl_map
.start_data
;
2051 mm
->end_data
= prctl_map
.end_data
;
2052 mm
->start_brk
= prctl_map
.start_brk
;
2053 mm
->brk
= prctl_map
.brk
;
2054 mm
->start_stack
= prctl_map
.start_stack
;
2055 mm
->arg_start
= prctl_map
.arg_start
;
2056 mm
->arg_end
= prctl_map
.arg_end
;
2057 mm
->env_start
= prctl_map
.env_start
;
2058 mm
->env_end
= prctl_map
.env_end
;
2059 spin_unlock(&mm
->arg_lock
);
2062 * Note this update of @saved_auxv is lockless thus
2063 * if someone reads this member in procfs while we're
2064 * updating -- it may get partly updated results. It's
2065 * known and acceptable trade off: we leave it as is to
2066 * not introduce additional locks here making the kernel
2069 if (prctl_map
.auxv_size
)
2070 memcpy(mm
->saved_auxv
, user_auxv
, sizeof(user_auxv
));
2072 mmap_read_unlock(mm
);
2075 #endif /* CONFIG_CHECKPOINT_RESTORE */
2077 static int prctl_set_auxv(struct mm_struct
*mm
, unsigned long addr
,
2081 * This doesn't move the auxiliary vector itself since it's pinned to
2082 * mm_struct, but it permits filling the vector with new values. It's
2083 * up to the caller to provide sane values here, otherwise userspace
2084 * tools which use this vector might be unhappy.
2086 unsigned long user_auxv
[AT_VECTOR_SIZE
] = {};
2088 if (len
> sizeof(user_auxv
))
2091 if (copy_from_user(user_auxv
, (const void __user
*)addr
, len
))
2094 /* Make sure the last entry is always AT_NULL */
2095 user_auxv
[AT_VECTOR_SIZE
- 2] = 0;
2096 user_auxv
[AT_VECTOR_SIZE
- 1] = 0;
2098 BUILD_BUG_ON(sizeof(user_auxv
) != sizeof(mm
->saved_auxv
));
2101 memcpy(mm
->saved_auxv
, user_auxv
, len
);
2102 task_unlock(current
);
2107 static int prctl_set_mm(int opt
, unsigned long addr
,
2108 unsigned long arg4
, unsigned long arg5
)
2110 struct mm_struct
*mm
= current
->mm
;
2111 struct prctl_mm_map prctl_map
= {
2116 struct vm_area_struct
*vma
;
2119 if (arg5
|| (arg4
&& (opt
!= PR_SET_MM_AUXV
&&
2120 opt
!= PR_SET_MM_MAP
&&
2121 opt
!= PR_SET_MM_MAP_SIZE
)))
2124 #ifdef CONFIG_CHECKPOINT_RESTORE
2125 if (opt
== PR_SET_MM_MAP
|| opt
== PR_SET_MM_MAP_SIZE
)
2126 return prctl_set_mm_map(opt
, (const void __user
*)addr
, arg4
);
2129 if (!capable(CAP_SYS_RESOURCE
))
2132 if (opt
== PR_SET_MM_EXE_FILE
)
2133 return prctl_set_mm_exe_file(mm
, (unsigned int)addr
);
2135 if (opt
== PR_SET_MM_AUXV
)
2136 return prctl_set_auxv(mm
, addr
, arg4
);
2138 if (addr
>= TASK_SIZE
|| addr
< mmap_min_addr
)
2144 * arg_lock protects concurrent updates of arg boundaries, we need
2145 * mmap_lock for a) concurrent sys_brk, b) finding VMA for addr
2149 vma
= find_vma(mm
, addr
);
2151 spin_lock(&mm
->arg_lock
);
2152 prctl_map
.start_code
= mm
->start_code
;
2153 prctl_map
.end_code
= mm
->end_code
;
2154 prctl_map
.start_data
= mm
->start_data
;
2155 prctl_map
.end_data
= mm
->end_data
;
2156 prctl_map
.start_brk
= mm
->start_brk
;
2157 prctl_map
.brk
= mm
->brk
;
2158 prctl_map
.start_stack
= mm
->start_stack
;
2159 prctl_map
.arg_start
= mm
->arg_start
;
2160 prctl_map
.arg_end
= mm
->arg_end
;
2161 prctl_map
.env_start
= mm
->env_start
;
2162 prctl_map
.env_end
= mm
->env_end
;
2165 case PR_SET_MM_START_CODE
:
2166 prctl_map
.start_code
= addr
;
2168 case PR_SET_MM_END_CODE
:
2169 prctl_map
.end_code
= addr
;
2171 case PR_SET_MM_START_DATA
:
2172 prctl_map
.start_data
= addr
;
2174 case PR_SET_MM_END_DATA
:
2175 prctl_map
.end_data
= addr
;
2177 case PR_SET_MM_START_STACK
:
2178 prctl_map
.start_stack
= addr
;
2180 case PR_SET_MM_START_BRK
:
2181 prctl_map
.start_brk
= addr
;
2184 prctl_map
.brk
= addr
;
2186 case PR_SET_MM_ARG_START
:
2187 prctl_map
.arg_start
= addr
;
2189 case PR_SET_MM_ARG_END
:
2190 prctl_map
.arg_end
= addr
;
2192 case PR_SET_MM_ENV_START
:
2193 prctl_map
.env_start
= addr
;
2195 case PR_SET_MM_ENV_END
:
2196 prctl_map
.env_end
= addr
;
2202 error
= validate_prctl_map_addr(&prctl_map
);
2208 * If command line arguments and environment
2209 * are placed somewhere else on stack, we can
2210 * set them up here, ARG_START/END to setup
2211 * command line arguments and ENV_START/END
2214 case PR_SET_MM_START_STACK
:
2215 case PR_SET_MM_ARG_START
:
2216 case PR_SET_MM_ARG_END
:
2217 case PR_SET_MM_ENV_START
:
2218 case PR_SET_MM_ENV_END
:
2225 mm
->start_code
= prctl_map
.start_code
;
2226 mm
->end_code
= prctl_map
.end_code
;
2227 mm
->start_data
= prctl_map
.start_data
;
2228 mm
->end_data
= prctl_map
.end_data
;
2229 mm
->start_brk
= prctl_map
.start_brk
;
2230 mm
->brk
= prctl_map
.brk
;
2231 mm
->start_stack
= prctl_map
.start_stack
;
2232 mm
->arg_start
= prctl_map
.arg_start
;
2233 mm
->arg_end
= prctl_map
.arg_end
;
2234 mm
->env_start
= prctl_map
.env_start
;
2235 mm
->env_end
= prctl_map
.env_end
;
2239 spin_unlock(&mm
->arg_lock
);
2240 mmap_read_unlock(mm
);
2244 #ifdef CONFIG_CHECKPOINT_RESTORE
2245 static int prctl_get_tid_address(struct task_struct
*me
, int __user
* __user
*tid_addr
)
2247 return put_user(me
->clear_child_tid
, tid_addr
);
2250 static int prctl_get_tid_address(struct task_struct
*me
, int __user
* __user
*tid_addr
)
2256 static int propagate_has_child_subreaper(struct task_struct
*p
, void *data
)
2259 * If task has has_child_subreaper - all its descendants
2260 * already have these flag too and new descendants will
2261 * inherit it on fork, skip them.
2263 * If we've found child_reaper - skip descendants in
2264 * it's subtree as they will never get out pidns.
2266 if (p
->signal
->has_child_subreaper
||
2267 is_child_reaper(task_pid(p
)))
2270 p
->signal
->has_child_subreaper
= 1;
2274 int __weak
arch_prctl_spec_ctrl_get(struct task_struct
*t
, unsigned long which
)
2279 int __weak
arch_prctl_spec_ctrl_set(struct task_struct
*t
, unsigned long which
,
2285 #define PR_IO_FLUSHER (PF_MEMALLOC_NOIO | PF_LOCAL_THROTTLE)
2287 SYSCALL_DEFINE5(prctl
, int, option
, unsigned long, arg2
, unsigned long, arg3
,
2288 unsigned long, arg4
, unsigned long, arg5
)
2290 struct task_struct
*me
= current
;
2291 unsigned char comm
[sizeof(me
->comm
)];
2294 error
= security_task_prctl(option
, arg2
, arg3
, arg4
, arg5
);
2295 if (error
!= -ENOSYS
)
2300 case PR_SET_PDEATHSIG
:
2301 if (!valid_signal(arg2
)) {
2305 me
->pdeath_signal
= arg2
;
2307 case PR_GET_PDEATHSIG
:
2308 error
= put_user(me
->pdeath_signal
, (int __user
*)arg2
);
2310 case PR_GET_DUMPABLE
:
2311 error
= get_dumpable(me
->mm
);
2313 case PR_SET_DUMPABLE
:
2314 if (arg2
!= SUID_DUMP_DISABLE
&& arg2
!= SUID_DUMP_USER
) {
2318 set_dumpable(me
->mm
, arg2
);
2321 case PR_SET_UNALIGN
:
2322 error
= SET_UNALIGN_CTL(me
, arg2
);
2324 case PR_GET_UNALIGN
:
2325 error
= GET_UNALIGN_CTL(me
, arg2
);
2328 error
= SET_FPEMU_CTL(me
, arg2
);
2331 error
= GET_FPEMU_CTL(me
, arg2
);
2334 error
= SET_FPEXC_CTL(me
, arg2
);
2337 error
= GET_FPEXC_CTL(me
, arg2
);
2340 error
= PR_TIMING_STATISTICAL
;
2343 if (arg2
!= PR_TIMING_STATISTICAL
)
2347 comm
[sizeof(me
->comm
) - 1] = 0;
2348 if (strncpy_from_user(comm
, (char __user
*)arg2
,
2349 sizeof(me
->comm
) - 1) < 0)
2351 set_task_comm(me
, comm
);
2352 proc_comm_connector(me
);
2355 get_task_comm(comm
, me
);
2356 if (copy_to_user((char __user
*)arg2
, comm
, sizeof(comm
)))
2360 error
= GET_ENDIAN(me
, arg2
);
2363 error
= SET_ENDIAN(me
, arg2
);
2365 case PR_GET_SECCOMP
:
2366 error
= prctl_get_seccomp();
2368 case PR_SET_SECCOMP
:
2369 error
= prctl_set_seccomp(arg2
, (char __user
*)arg3
);
2372 error
= GET_TSC_CTL(arg2
);
2375 error
= SET_TSC_CTL(arg2
);
2377 case PR_TASK_PERF_EVENTS_DISABLE
:
2378 error
= perf_event_task_disable();
2380 case PR_TASK_PERF_EVENTS_ENABLE
:
2381 error
= perf_event_task_enable();
2383 case PR_GET_TIMERSLACK
:
2384 if (current
->timer_slack_ns
> ULONG_MAX
)
2387 error
= current
->timer_slack_ns
;
2389 case PR_SET_TIMERSLACK
:
2391 current
->timer_slack_ns
=
2392 current
->default_timer_slack_ns
;
2394 current
->timer_slack_ns
= arg2
;
2400 case PR_MCE_KILL_CLEAR
:
2403 current
->flags
&= ~PF_MCE_PROCESS
;
2405 case PR_MCE_KILL_SET
:
2406 current
->flags
|= PF_MCE_PROCESS
;
2407 if (arg3
== PR_MCE_KILL_EARLY
)
2408 current
->flags
|= PF_MCE_EARLY
;
2409 else if (arg3
== PR_MCE_KILL_LATE
)
2410 current
->flags
&= ~PF_MCE_EARLY
;
2411 else if (arg3
== PR_MCE_KILL_DEFAULT
)
2413 ~(PF_MCE_EARLY
|PF_MCE_PROCESS
);
2421 case PR_MCE_KILL_GET
:
2422 if (arg2
| arg3
| arg4
| arg5
)
2424 if (current
->flags
& PF_MCE_PROCESS
)
2425 error
= (current
->flags
& PF_MCE_EARLY
) ?
2426 PR_MCE_KILL_EARLY
: PR_MCE_KILL_LATE
;
2428 error
= PR_MCE_KILL_DEFAULT
;
2431 error
= prctl_set_mm(arg2
, arg3
, arg4
, arg5
);
2433 case PR_GET_TID_ADDRESS
:
2434 error
= prctl_get_tid_address(me
, (int __user
* __user
*)arg2
);
2436 case PR_SET_CHILD_SUBREAPER
:
2437 me
->signal
->is_child_subreaper
= !!arg2
;
2441 walk_process_tree(me
, propagate_has_child_subreaper
, NULL
);
2443 case PR_GET_CHILD_SUBREAPER
:
2444 error
= put_user(me
->signal
->is_child_subreaper
,
2445 (int __user
*)arg2
);
2447 case PR_SET_NO_NEW_PRIVS
:
2448 if (arg2
!= 1 || arg3
|| arg4
|| arg5
)
2451 task_set_no_new_privs(current
);
2453 case PR_GET_NO_NEW_PRIVS
:
2454 if (arg2
|| arg3
|| arg4
|| arg5
)
2456 return task_no_new_privs(current
) ? 1 : 0;
2457 case PR_GET_THP_DISABLE
:
2458 if (arg2
|| arg3
|| arg4
|| arg5
)
2460 error
= !!test_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2462 case PR_SET_THP_DISABLE
:
2463 if (arg3
|| arg4
|| arg5
)
2465 if (mmap_write_lock_killable(me
->mm
))
2468 set_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2470 clear_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2471 mmap_write_unlock(me
->mm
);
2473 case PR_MPX_ENABLE_MANAGEMENT
:
2474 case PR_MPX_DISABLE_MANAGEMENT
:
2475 /* No longer implemented: */
2477 case PR_SET_FP_MODE
:
2478 error
= SET_FP_MODE(me
, arg2
);
2480 case PR_GET_FP_MODE
:
2481 error
= GET_FP_MODE(me
);
2484 error
= SVE_SET_VL(arg2
);
2487 error
= SVE_GET_VL();
2489 case PR_GET_SPECULATION_CTRL
:
2490 if (arg3
|| arg4
|| arg5
)
2492 error
= arch_prctl_spec_ctrl_get(me
, arg2
);
2494 case PR_SET_SPECULATION_CTRL
:
2497 error
= arch_prctl_spec_ctrl_set(me
, arg2
, arg3
);
2499 case PR_PAC_RESET_KEYS
:
2500 if (arg3
|| arg4
|| arg5
)
2502 error
= PAC_RESET_KEYS(me
, arg2
);
2504 case PR_PAC_SET_ENABLED_KEYS
:
2507 error
= PAC_SET_ENABLED_KEYS(me
, arg2
, arg3
);
2509 case PR_PAC_GET_ENABLED_KEYS
:
2510 if (arg2
|| arg3
|| arg4
|| arg5
)
2512 error
= PAC_GET_ENABLED_KEYS(me
);
2514 case PR_SET_TAGGED_ADDR_CTRL
:
2515 if (arg3
|| arg4
|| arg5
)
2517 error
= SET_TAGGED_ADDR_CTRL(arg2
);
2519 case PR_GET_TAGGED_ADDR_CTRL
:
2520 if (arg2
|| arg3
|| arg4
|| arg5
)
2522 error
= GET_TAGGED_ADDR_CTRL();
2524 case PR_SET_IO_FLUSHER
:
2525 if (!capable(CAP_SYS_RESOURCE
))
2528 if (arg3
|| arg4
|| arg5
)
2532 current
->flags
|= PR_IO_FLUSHER
;
2534 current
->flags
&= ~PR_IO_FLUSHER
;
2538 case PR_GET_IO_FLUSHER
:
2539 if (!capable(CAP_SYS_RESOURCE
))
2542 if (arg2
|| arg3
|| arg4
|| arg5
)
2545 error
= (current
->flags
& PR_IO_FLUSHER
) == PR_IO_FLUSHER
;
2547 case PR_SET_SYSCALL_USER_DISPATCH
:
2548 error
= set_syscall_user_dispatch(arg2
, arg3
, arg4
,
2549 (char __user
*) arg5
);
2551 #ifdef CONFIG_SCHED_CORE
2553 error
= sched_core_share_pid(arg2
, arg3
, arg4
, arg5
);
2563 SYSCALL_DEFINE3(getcpu
, unsigned __user
*, cpup
, unsigned __user
*, nodep
,
2564 struct getcpu_cache __user
*, unused
)
2567 int cpu
= raw_smp_processor_id();
2570 err
|= put_user(cpu
, cpup
);
2572 err
|= put_user(cpu_to_node(cpu
), nodep
);
2573 return err
? -EFAULT
: 0;
2577 * do_sysinfo - fill in sysinfo struct
2578 * @info: pointer to buffer to fill
2580 static int do_sysinfo(struct sysinfo
*info
)
2582 unsigned long mem_total
, sav_total
;
2583 unsigned int mem_unit
, bitcount
;
2584 struct timespec64 tp
;
2586 memset(info
, 0, sizeof(struct sysinfo
));
2588 ktime_get_boottime_ts64(&tp
);
2589 timens_add_boottime(&tp
);
2590 info
->uptime
= tp
.tv_sec
+ (tp
.tv_nsec
? 1 : 0);
2592 get_avenrun(info
->loads
, 0, SI_LOAD_SHIFT
- FSHIFT
);
2594 info
->procs
= nr_threads
;
2600 * If the sum of all the available memory (i.e. ram + swap)
2601 * is less than can be stored in a 32 bit unsigned long then
2602 * we can be binary compatible with 2.2.x kernels. If not,
2603 * well, in that case 2.2.x was broken anyways...
2605 * -Erik Andersen <andersee@debian.org>
2608 mem_total
= info
->totalram
+ info
->totalswap
;
2609 if (mem_total
< info
->totalram
|| mem_total
< info
->totalswap
)
2612 mem_unit
= info
->mem_unit
;
2613 while (mem_unit
> 1) {
2616 sav_total
= mem_total
;
2618 if (mem_total
< sav_total
)
2623 * If mem_total did not overflow, multiply all memory values by
2624 * info->mem_unit and set it to 1. This leaves things compatible
2625 * with 2.2.x, and also retains compatibility with earlier 2.4.x
2630 info
->totalram
<<= bitcount
;
2631 info
->freeram
<<= bitcount
;
2632 info
->sharedram
<<= bitcount
;
2633 info
->bufferram
<<= bitcount
;
2634 info
->totalswap
<<= bitcount
;
2635 info
->freeswap
<<= bitcount
;
2636 info
->totalhigh
<<= bitcount
;
2637 info
->freehigh
<<= bitcount
;
2643 SYSCALL_DEFINE1(sysinfo
, struct sysinfo __user
*, info
)
2649 if (copy_to_user(info
, &val
, sizeof(struct sysinfo
)))
2655 #ifdef CONFIG_COMPAT
2656 struct compat_sysinfo
{
2670 char _f
[20-2*sizeof(u32
)-sizeof(int)];
2673 COMPAT_SYSCALL_DEFINE1(sysinfo
, struct compat_sysinfo __user
*, info
)
2676 struct compat_sysinfo s_32
;
2680 /* Check to see if any memory value is too large for 32-bit and scale
2683 if (upper_32_bits(s
.totalram
) || upper_32_bits(s
.totalswap
)) {
2686 while (s
.mem_unit
< PAGE_SIZE
) {
2691 s
.totalram
>>= bitcount
;
2692 s
.freeram
>>= bitcount
;
2693 s
.sharedram
>>= bitcount
;
2694 s
.bufferram
>>= bitcount
;
2695 s
.totalswap
>>= bitcount
;
2696 s
.freeswap
>>= bitcount
;
2697 s
.totalhigh
>>= bitcount
;
2698 s
.freehigh
>>= bitcount
;
2701 memset(&s_32
, 0, sizeof(s_32
));
2702 s_32
.uptime
= s
.uptime
;
2703 s_32
.loads
[0] = s
.loads
[0];
2704 s_32
.loads
[1] = s
.loads
[1];
2705 s_32
.loads
[2] = s
.loads
[2];
2706 s_32
.totalram
= s
.totalram
;
2707 s_32
.freeram
= s
.freeram
;
2708 s_32
.sharedram
= s
.sharedram
;
2709 s_32
.bufferram
= s
.bufferram
;
2710 s_32
.totalswap
= s
.totalswap
;
2711 s_32
.freeswap
= s
.freeswap
;
2712 s_32
.procs
= s
.procs
;
2713 s_32
.totalhigh
= s
.totalhigh
;
2714 s_32
.freehigh
= s
.freehigh
;
2715 s_32
.mem_unit
= s
.mem_unit
;
2716 if (copy_to_user(info
, &s_32
, sizeof(s_32
)))
2720 #endif /* CONFIG_COMPAT */