4 * Copyright (C) 1991, 1992 Linus Torvalds
7 #include <linux/export.h>
9 #include <linux/utsname.h>
10 #include <linux/mman.h>
11 #include <linux/reboot.h>
12 #include <linux/prctl.h>
13 #include <linux/highuid.h>
15 #include <linux/kmod.h>
16 #include <linux/perf_event.h>
17 #include <linux/resource.h>
18 #include <linux/kernel.h>
19 #include <linux/workqueue.h>
20 #include <linux/capability.h>
21 #include <linux/device.h>
22 #include <linux/key.h>
23 #include <linux/times.h>
24 #include <linux/posix-timers.h>
25 #include <linux/security.h>
26 #include <linux/dcookies.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>
45 #include <linux/compat.h>
46 #include <linux/syscalls.h>
47 #include <linux/kprobes.h>
48 #include <linux/user_namespace.h>
49 #include <linux/binfmts.h>
51 #include <linux/sched.h>
52 #include <linux/sched/autogroup.h>
53 #include <linux/sched/loadavg.h>
54 #include <linux/sched/stat.h>
55 #include <linux/sched/mm.h>
56 #include <linux/sched/coredump.h>
57 #include <linux/sched/task.h>
58 #include <linux/sched/cputime.h>
59 #include <linux/rcupdate.h>
60 #include <linux/uidgid.h>
61 #include <linux/cred.h>
63 #include <linux/kmsg_dump.h>
64 /* Move somewhere else to avoid recompiling? */
65 #include <generated/utsrelease.h>
67 #include <linux/uaccess.h>
69 #include <asm/unistd.h>
71 #ifndef SET_UNALIGN_CTL
72 # define SET_UNALIGN_CTL(a, b) (-EINVAL)
74 #ifndef GET_UNALIGN_CTL
75 # define GET_UNALIGN_CTL(a, b) (-EINVAL)
78 # define SET_FPEMU_CTL(a, b) (-EINVAL)
81 # define GET_FPEMU_CTL(a, b) (-EINVAL)
84 # define SET_FPEXC_CTL(a, b) (-EINVAL)
87 # define GET_FPEXC_CTL(a, b) (-EINVAL)
90 # define GET_ENDIAN(a, b) (-EINVAL)
93 # define SET_ENDIAN(a, b) (-EINVAL)
96 # define GET_TSC_CTL(a) (-EINVAL)
99 # define SET_TSC_CTL(a) (-EINVAL)
101 #ifndef MPX_ENABLE_MANAGEMENT
102 # define MPX_ENABLE_MANAGEMENT() (-EINVAL)
104 #ifndef MPX_DISABLE_MANAGEMENT
105 # define MPX_DISABLE_MANAGEMENT() (-EINVAL)
108 # define GET_FP_MODE(a) (-EINVAL)
111 # define SET_FP_MODE(a,b) (-EINVAL)
115 * this is where the system-wide overflow UID and GID are defined, for
116 * architectures that now have 32-bit UID/GID but didn't in the past
119 int overflowuid
= DEFAULT_OVERFLOWUID
;
120 int overflowgid
= DEFAULT_OVERFLOWGID
;
122 EXPORT_SYMBOL(overflowuid
);
123 EXPORT_SYMBOL(overflowgid
);
126 * the same as above, but for filesystems which can only store a 16-bit
127 * UID and GID. as such, this is needed on all architectures
130 int fs_overflowuid
= DEFAULT_FS_OVERFLOWUID
;
131 int fs_overflowgid
= DEFAULT_FS_OVERFLOWUID
;
133 EXPORT_SYMBOL(fs_overflowuid
);
134 EXPORT_SYMBOL(fs_overflowgid
);
137 * Returns true if current's euid is same as p's uid or euid,
138 * or has CAP_SYS_NICE to p's user_ns.
140 * Called with rcu_read_lock, creds are safe
142 static bool set_one_prio_perm(struct task_struct
*p
)
144 const struct cred
*cred
= current_cred(), *pcred
= __task_cred(p
);
146 if (uid_eq(pcred
->uid
, cred
->euid
) ||
147 uid_eq(pcred
->euid
, cred
->euid
))
149 if (ns_capable(pcred
->user_ns
, CAP_SYS_NICE
))
155 * set the priority of a task
156 * - the caller must hold the RCU read lock
158 static int set_one_prio(struct task_struct
*p
, int niceval
, int error
)
162 if (!set_one_prio_perm(p
)) {
166 if (niceval
< task_nice(p
) && !can_nice(p
, niceval
)) {
170 no_nice
= security_task_setnice(p
, niceval
);
177 set_user_nice(p
, niceval
);
182 SYSCALL_DEFINE3(setpriority
, int, which
, int, who
, int, niceval
)
184 struct task_struct
*g
, *p
;
185 struct user_struct
*user
;
186 const struct cred
*cred
= current_cred();
191 if (which
> PRIO_USER
|| which
< PRIO_PROCESS
)
194 /* normalize: avoid signed division (rounding problems) */
196 if (niceval
< MIN_NICE
)
198 if (niceval
> MAX_NICE
)
202 read_lock(&tasklist_lock
);
206 p
= find_task_by_vpid(who
);
210 error
= set_one_prio(p
, niceval
, error
);
214 pgrp
= find_vpid(who
);
216 pgrp
= task_pgrp(current
);
217 do_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
) {
218 error
= set_one_prio(p
, niceval
, error
);
219 } while_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
);
222 uid
= make_kuid(cred
->user_ns
, who
);
226 else if (!uid_eq(uid
, cred
->uid
)) {
227 user
= find_user(uid
);
229 goto out_unlock
; /* No processes for this user */
231 do_each_thread(g
, p
) {
232 if (uid_eq(task_uid(p
), uid
) && task_pid_vnr(p
))
233 error
= set_one_prio(p
, niceval
, error
);
234 } while_each_thread(g
, p
);
235 if (!uid_eq(uid
, cred
->uid
))
236 free_uid(user
); /* For find_user() */
240 read_unlock(&tasklist_lock
);
247 * Ugh. To avoid negative return values, "getpriority()" will
248 * not return the normal nice-value, but a negated value that
249 * has been offset by 20 (ie it returns 40..1 instead of -20..19)
250 * to stay compatible.
252 SYSCALL_DEFINE2(getpriority
, int, which
, int, who
)
254 struct task_struct
*g
, *p
;
255 struct user_struct
*user
;
256 const struct cred
*cred
= current_cred();
257 long niceval
, retval
= -ESRCH
;
261 if (which
> PRIO_USER
|| which
< PRIO_PROCESS
)
265 read_lock(&tasklist_lock
);
269 p
= find_task_by_vpid(who
);
273 niceval
= nice_to_rlimit(task_nice(p
));
274 if (niceval
> retval
)
280 pgrp
= find_vpid(who
);
282 pgrp
= task_pgrp(current
);
283 do_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
) {
284 niceval
= nice_to_rlimit(task_nice(p
));
285 if (niceval
> retval
)
287 } while_each_pid_thread(pgrp
, PIDTYPE_PGID
, p
);
290 uid
= make_kuid(cred
->user_ns
, who
);
294 else if (!uid_eq(uid
, cred
->uid
)) {
295 user
= find_user(uid
);
297 goto out_unlock
; /* No processes for this user */
299 do_each_thread(g
, p
) {
300 if (uid_eq(task_uid(p
), uid
) && task_pid_vnr(p
)) {
301 niceval
= nice_to_rlimit(task_nice(p
));
302 if (niceval
> retval
)
305 } while_each_thread(g
, p
);
306 if (!uid_eq(uid
, cred
->uid
))
307 free_uid(user
); /* for find_user() */
311 read_unlock(&tasklist_lock
);
318 * Unprivileged users may change the real gid to the effective gid
319 * or vice versa. (BSD-style)
321 * If you set the real gid at all, or set the effective gid to a value not
322 * equal to the real gid, then the saved gid is set to the new effective gid.
324 * This makes it possible for a setgid program to completely drop its
325 * privileges, which is often a useful assertion to make when you are doing
326 * a security audit over a program.
328 * The general idea is that a program which uses just setregid() will be
329 * 100% compatible with BSD. A program which uses just setgid() will be
330 * 100% compatible with POSIX with saved IDs.
332 * SMP: There are not races, the GIDs are checked only by filesystem
333 * operations (as far as semantic preservation is concerned).
335 #ifdef CONFIG_MULTIUSER
336 SYSCALL_DEFINE2(setregid
, gid_t
, rgid
, gid_t
, egid
)
338 struct user_namespace
*ns
= current_user_ns();
339 const struct cred
*old
;
344 krgid
= make_kgid(ns
, rgid
);
345 kegid
= make_kgid(ns
, egid
);
347 if ((rgid
!= (gid_t
) -1) && !gid_valid(krgid
))
349 if ((egid
!= (gid_t
) -1) && !gid_valid(kegid
))
352 new = prepare_creds();
355 old
= current_cred();
358 if (rgid
!= (gid_t
) -1) {
359 if (gid_eq(old
->gid
, krgid
) ||
360 gid_eq(old
->egid
, krgid
) ||
361 ns_capable(old
->user_ns
, CAP_SETGID
))
366 if (egid
!= (gid_t
) -1) {
367 if (gid_eq(old
->gid
, kegid
) ||
368 gid_eq(old
->egid
, kegid
) ||
369 gid_eq(old
->sgid
, kegid
) ||
370 ns_capable(old
->user_ns
, CAP_SETGID
))
376 if (rgid
!= (gid_t
) -1 ||
377 (egid
!= (gid_t
) -1 && !gid_eq(kegid
, old
->gid
)))
378 new->sgid
= new->egid
;
379 new->fsgid
= new->egid
;
381 return commit_creds(new);
389 * setgid() is implemented like SysV w/ SAVED_IDS
391 * SMP: Same implicit races as above.
393 SYSCALL_DEFINE1(setgid
, gid_t
, gid
)
395 struct user_namespace
*ns
= current_user_ns();
396 const struct cred
*old
;
401 kgid
= make_kgid(ns
, gid
);
402 if (!gid_valid(kgid
))
405 new = prepare_creds();
408 old
= current_cred();
411 if (ns_capable(old
->user_ns
, CAP_SETGID
))
412 new->gid
= new->egid
= new->sgid
= new->fsgid
= kgid
;
413 else if (gid_eq(kgid
, old
->gid
) || gid_eq(kgid
, old
->sgid
))
414 new->egid
= new->fsgid
= kgid
;
418 return commit_creds(new);
426 * change the user struct in a credentials set to match the new UID
428 static int set_user(struct cred
*new)
430 struct user_struct
*new_user
;
432 new_user
= alloc_uid(new->uid
);
437 * We don't fail in case of NPROC limit excess here because too many
438 * poorly written programs don't check set*uid() return code, assuming
439 * it never fails if called by root. We may still enforce NPROC limit
440 * for programs doing set*uid()+execve() by harmlessly deferring the
441 * failure to the execve() stage.
443 if (atomic_read(&new_user
->processes
) >= rlimit(RLIMIT_NPROC
) &&
444 new_user
!= INIT_USER
)
445 current
->flags
|= PF_NPROC_EXCEEDED
;
447 current
->flags
&= ~PF_NPROC_EXCEEDED
;
450 new->user
= new_user
;
455 * Unprivileged users may change the real uid to the effective uid
456 * or vice versa. (BSD-style)
458 * If you set the real uid at all, or set the effective uid to a value not
459 * equal to the real uid, then the saved uid is set to the new effective uid.
461 * This makes it possible for a setuid program to completely drop its
462 * privileges, which is often a useful assertion to make when you are doing
463 * a security audit over a program.
465 * The general idea is that a program which uses just setreuid() will be
466 * 100% compatible with BSD. A program which uses just setuid() will be
467 * 100% compatible with POSIX with saved IDs.
469 SYSCALL_DEFINE2(setreuid
, uid_t
, ruid
, uid_t
, euid
)
471 struct user_namespace
*ns
= current_user_ns();
472 const struct cred
*old
;
477 kruid
= make_kuid(ns
, ruid
);
478 keuid
= make_kuid(ns
, euid
);
480 if ((ruid
!= (uid_t
) -1) && !uid_valid(kruid
))
482 if ((euid
!= (uid_t
) -1) && !uid_valid(keuid
))
485 new = prepare_creds();
488 old
= current_cred();
491 if (ruid
!= (uid_t
) -1) {
493 if (!uid_eq(old
->uid
, kruid
) &&
494 !uid_eq(old
->euid
, kruid
) &&
495 !ns_capable(old
->user_ns
, CAP_SETUID
))
499 if (euid
!= (uid_t
) -1) {
501 if (!uid_eq(old
->uid
, keuid
) &&
502 !uid_eq(old
->euid
, keuid
) &&
503 !uid_eq(old
->suid
, keuid
) &&
504 !ns_capable(old
->user_ns
, CAP_SETUID
))
508 if (!uid_eq(new->uid
, old
->uid
)) {
509 retval
= set_user(new);
513 if (ruid
!= (uid_t
) -1 ||
514 (euid
!= (uid_t
) -1 && !uid_eq(keuid
, old
->uid
)))
515 new->suid
= new->euid
;
516 new->fsuid
= new->euid
;
518 retval
= security_task_fix_setuid(new, old
, LSM_SETID_RE
);
522 return commit_creds(new);
530 * setuid() is implemented like SysV with SAVED_IDS
532 * Note that SAVED_ID's is deficient in that a setuid root program
533 * like sendmail, for example, cannot set its uid to be a normal
534 * user and then switch back, because if you're root, setuid() sets
535 * the saved uid too. If you don't like this, blame the bright people
536 * in the POSIX committee and/or USG. Note that the BSD-style setreuid()
537 * will allow a root program to temporarily drop privileges and be able to
538 * regain them by swapping the real and effective uid.
540 SYSCALL_DEFINE1(setuid
, uid_t
, uid
)
542 struct user_namespace
*ns
= current_user_ns();
543 const struct cred
*old
;
548 kuid
= make_kuid(ns
, uid
);
549 if (!uid_valid(kuid
))
552 new = prepare_creds();
555 old
= current_cred();
558 if (ns_capable(old
->user_ns
, CAP_SETUID
)) {
559 new->suid
= new->uid
= kuid
;
560 if (!uid_eq(kuid
, old
->uid
)) {
561 retval
= set_user(new);
565 } else if (!uid_eq(kuid
, old
->uid
) && !uid_eq(kuid
, new->suid
)) {
569 new->fsuid
= new->euid
= kuid
;
571 retval
= security_task_fix_setuid(new, old
, LSM_SETID_ID
);
575 return commit_creds(new);
584 * This function implements a generic ability to update ruid, euid,
585 * and suid. This allows you to implement the 4.4 compatible seteuid().
587 SYSCALL_DEFINE3(setresuid
, uid_t
, ruid
, uid_t
, euid
, uid_t
, suid
)
589 struct user_namespace
*ns
= current_user_ns();
590 const struct cred
*old
;
593 kuid_t kruid
, keuid
, ksuid
;
595 kruid
= make_kuid(ns
, ruid
);
596 keuid
= make_kuid(ns
, euid
);
597 ksuid
= make_kuid(ns
, suid
);
599 if ((ruid
!= (uid_t
) -1) && !uid_valid(kruid
))
602 if ((euid
!= (uid_t
) -1) && !uid_valid(keuid
))
605 if ((suid
!= (uid_t
) -1) && !uid_valid(ksuid
))
608 new = prepare_creds();
612 old
= current_cred();
615 if (!ns_capable(old
->user_ns
, CAP_SETUID
)) {
616 if (ruid
!= (uid_t
) -1 && !uid_eq(kruid
, old
->uid
) &&
617 !uid_eq(kruid
, old
->euid
) && !uid_eq(kruid
, old
->suid
))
619 if (euid
!= (uid_t
) -1 && !uid_eq(keuid
, old
->uid
) &&
620 !uid_eq(keuid
, old
->euid
) && !uid_eq(keuid
, old
->suid
))
622 if (suid
!= (uid_t
) -1 && !uid_eq(ksuid
, old
->uid
) &&
623 !uid_eq(ksuid
, old
->euid
) && !uid_eq(ksuid
, old
->suid
))
627 if (ruid
!= (uid_t
) -1) {
629 if (!uid_eq(kruid
, old
->uid
)) {
630 retval
= set_user(new);
635 if (euid
!= (uid_t
) -1)
637 if (suid
!= (uid_t
) -1)
639 new->fsuid
= new->euid
;
641 retval
= security_task_fix_setuid(new, old
, LSM_SETID_RES
);
645 return commit_creds(new);
652 SYSCALL_DEFINE3(getresuid
, uid_t __user
*, ruidp
, uid_t __user
*, euidp
, uid_t __user
*, suidp
)
654 const struct cred
*cred
= current_cred();
656 uid_t ruid
, euid
, suid
;
658 ruid
= from_kuid_munged(cred
->user_ns
, cred
->uid
);
659 euid
= from_kuid_munged(cred
->user_ns
, cred
->euid
);
660 suid
= from_kuid_munged(cred
->user_ns
, cred
->suid
);
662 retval
= put_user(ruid
, ruidp
);
664 retval
= put_user(euid
, euidp
);
666 return put_user(suid
, suidp
);
672 * Same as above, but for rgid, egid, sgid.
674 SYSCALL_DEFINE3(setresgid
, gid_t
, rgid
, gid_t
, egid
, gid_t
, sgid
)
676 struct user_namespace
*ns
= current_user_ns();
677 const struct cred
*old
;
680 kgid_t krgid
, kegid
, ksgid
;
682 krgid
= make_kgid(ns
, rgid
);
683 kegid
= make_kgid(ns
, egid
);
684 ksgid
= make_kgid(ns
, sgid
);
686 if ((rgid
!= (gid_t
) -1) && !gid_valid(krgid
))
688 if ((egid
!= (gid_t
) -1) && !gid_valid(kegid
))
690 if ((sgid
!= (gid_t
) -1) && !gid_valid(ksgid
))
693 new = prepare_creds();
696 old
= current_cred();
699 if (!ns_capable(old
->user_ns
, CAP_SETGID
)) {
700 if (rgid
!= (gid_t
) -1 && !gid_eq(krgid
, old
->gid
) &&
701 !gid_eq(krgid
, old
->egid
) && !gid_eq(krgid
, old
->sgid
))
703 if (egid
!= (gid_t
) -1 && !gid_eq(kegid
, old
->gid
) &&
704 !gid_eq(kegid
, old
->egid
) && !gid_eq(kegid
, old
->sgid
))
706 if (sgid
!= (gid_t
) -1 && !gid_eq(ksgid
, old
->gid
) &&
707 !gid_eq(ksgid
, old
->egid
) && !gid_eq(ksgid
, old
->sgid
))
711 if (rgid
!= (gid_t
) -1)
713 if (egid
!= (gid_t
) -1)
715 if (sgid
!= (gid_t
) -1)
717 new->fsgid
= new->egid
;
719 return commit_creds(new);
726 SYSCALL_DEFINE3(getresgid
, gid_t __user
*, rgidp
, gid_t __user
*, egidp
, gid_t __user
*, sgidp
)
728 const struct cred
*cred
= current_cred();
730 gid_t rgid
, egid
, sgid
;
732 rgid
= from_kgid_munged(cred
->user_ns
, cred
->gid
);
733 egid
= from_kgid_munged(cred
->user_ns
, cred
->egid
);
734 sgid
= from_kgid_munged(cred
->user_ns
, cred
->sgid
);
736 retval
= put_user(rgid
, rgidp
);
738 retval
= put_user(egid
, egidp
);
740 retval
= put_user(sgid
, sgidp
);
748 * "setfsuid()" sets the fsuid - the uid used for filesystem checks. This
749 * is used for "access()" and for the NFS daemon (letting nfsd stay at
750 * whatever uid it wants to). It normally shadows "euid", except when
751 * explicitly set by setfsuid() or for access..
753 SYSCALL_DEFINE1(setfsuid
, uid_t
, uid
)
755 const struct cred
*old
;
760 old
= current_cred();
761 old_fsuid
= from_kuid_munged(old
->user_ns
, old
->fsuid
);
763 kuid
= make_kuid(old
->user_ns
, uid
);
764 if (!uid_valid(kuid
))
767 new = prepare_creds();
771 if (uid_eq(kuid
, old
->uid
) || uid_eq(kuid
, old
->euid
) ||
772 uid_eq(kuid
, old
->suid
) || uid_eq(kuid
, old
->fsuid
) ||
773 ns_capable(old
->user_ns
, CAP_SETUID
)) {
774 if (!uid_eq(kuid
, old
->fsuid
)) {
776 if (security_task_fix_setuid(new, old
, LSM_SETID_FS
) == 0)
790 * Samma på svenska..
792 SYSCALL_DEFINE1(setfsgid
, gid_t
, gid
)
794 const struct cred
*old
;
799 old
= current_cred();
800 old_fsgid
= from_kgid_munged(old
->user_ns
, old
->fsgid
);
802 kgid
= make_kgid(old
->user_ns
, gid
);
803 if (!gid_valid(kgid
))
806 new = prepare_creds();
810 if (gid_eq(kgid
, old
->gid
) || gid_eq(kgid
, old
->egid
) ||
811 gid_eq(kgid
, old
->sgid
) || gid_eq(kgid
, old
->fsgid
) ||
812 ns_capable(old
->user_ns
, CAP_SETGID
)) {
813 if (!gid_eq(kgid
, old
->fsgid
)) {
826 #endif /* CONFIG_MULTIUSER */
829 * sys_getpid - return the thread group id of the current process
831 * Note, despite the name, this returns the tgid not the pid. The tgid and
832 * the pid are identical unless CLONE_THREAD was specified on clone() in
833 * which case the tgid is the same in all threads of the same group.
835 * This is SMP safe as current->tgid does not change.
837 SYSCALL_DEFINE0(getpid
)
839 return task_tgid_vnr(current
);
842 /* Thread ID - the internal kernel "pid" */
843 SYSCALL_DEFINE0(gettid
)
845 return task_pid_vnr(current
);
849 * Accessing ->real_parent is not SMP-safe, it could
850 * change from under us. However, we can use a stale
851 * value of ->real_parent under rcu_read_lock(), see
852 * release_task()->call_rcu(delayed_put_task_struct).
854 SYSCALL_DEFINE0(getppid
)
859 pid
= task_tgid_vnr(rcu_dereference(current
->real_parent
));
865 SYSCALL_DEFINE0(getuid
)
867 /* Only we change this so SMP safe */
868 return from_kuid_munged(current_user_ns(), current_uid());
871 SYSCALL_DEFINE0(geteuid
)
873 /* Only we change this so SMP safe */
874 return from_kuid_munged(current_user_ns(), current_euid());
877 SYSCALL_DEFINE0(getgid
)
879 /* Only we change this so SMP safe */
880 return from_kgid_munged(current_user_ns(), current_gid());
883 SYSCALL_DEFINE0(getegid
)
885 /* Only we change this so SMP safe */
886 return from_kgid_munged(current_user_ns(), current_egid());
889 static void do_sys_times(struct tms
*tms
)
891 u64 tgutime
, tgstime
, cutime
, cstime
;
893 thread_group_cputime_adjusted(current
, &tgutime
, &tgstime
);
894 cutime
= current
->signal
->cutime
;
895 cstime
= current
->signal
->cstime
;
896 tms
->tms_utime
= nsec_to_clock_t(tgutime
);
897 tms
->tms_stime
= nsec_to_clock_t(tgstime
);
898 tms
->tms_cutime
= nsec_to_clock_t(cutime
);
899 tms
->tms_cstime
= nsec_to_clock_t(cstime
);
902 SYSCALL_DEFINE1(times
, struct tms __user
*, tbuf
)
908 if (copy_to_user(tbuf
, &tmp
, sizeof(struct tms
)))
911 force_successful_syscall_return();
912 return (long) jiffies_64_to_clock_t(get_jiffies_64());
916 static compat_clock_t
clock_t_to_compat_clock_t(clock_t x
)
918 return compat_jiffies_to_clock_t(clock_t_to_jiffies(x
));
921 COMPAT_SYSCALL_DEFINE1(times
, struct compat_tms __user
*, tbuf
)
925 struct compat_tms tmp
;
928 /* Convert our struct tms to the compat version. */
929 tmp
.tms_utime
= clock_t_to_compat_clock_t(tms
.tms_utime
);
930 tmp
.tms_stime
= clock_t_to_compat_clock_t(tms
.tms_stime
);
931 tmp
.tms_cutime
= clock_t_to_compat_clock_t(tms
.tms_cutime
);
932 tmp
.tms_cstime
= clock_t_to_compat_clock_t(tms
.tms_cstime
);
933 if (copy_to_user(tbuf
, &tmp
, sizeof(tmp
)))
936 force_successful_syscall_return();
937 return compat_jiffies_to_clock_t(jiffies
);
942 * This needs some heavy checking ...
943 * I just haven't the stomach for it. I also don't fully
944 * understand sessions/pgrp etc. Let somebody who does explain it.
946 * OK, I think I have the protection semantics right.... this is really
947 * only important on a multi-user system anyway, to make sure one user
948 * can't send a signal to a process owned by another. -TYT, 12/12/91
950 * !PF_FORKNOEXEC check to conform completely to POSIX.
952 SYSCALL_DEFINE2(setpgid
, pid_t
, pid
, pid_t
, pgid
)
954 struct task_struct
*p
;
955 struct task_struct
*group_leader
= current
->group_leader
;
960 pid
= task_pid_vnr(group_leader
);
967 /* From this point forward we keep holding onto the tasklist lock
968 * so that our parent does not change from under us. -DaveM
970 write_lock_irq(&tasklist_lock
);
973 p
= find_task_by_vpid(pid
);
978 if (!thread_group_leader(p
))
981 if (same_thread_group(p
->real_parent
, group_leader
)) {
983 if (task_session(p
) != task_session(group_leader
))
986 if (!(p
->flags
& PF_FORKNOEXEC
))
990 if (p
!= group_leader
)
995 if (p
->signal
->leader
)
1000 struct task_struct
*g
;
1002 pgrp
= find_vpid(pgid
);
1003 g
= pid_task(pgrp
, PIDTYPE_PGID
);
1004 if (!g
|| task_session(g
) != task_session(group_leader
))
1008 err
= security_task_setpgid(p
, pgid
);
1012 if (task_pgrp(p
) != pgrp
)
1013 change_pid(p
, PIDTYPE_PGID
, pgrp
);
1017 /* All paths lead to here, thus we are safe. -DaveM */
1018 write_unlock_irq(&tasklist_lock
);
1023 SYSCALL_DEFINE1(getpgid
, pid_t
, pid
)
1025 struct task_struct
*p
;
1031 grp
= task_pgrp(current
);
1034 p
= find_task_by_vpid(pid
);
1041 retval
= security_task_getpgid(p
);
1045 retval
= pid_vnr(grp
);
1051 #ifdef __ARCH_WANT_SYS_GETPGRP
1053 SYSCALL_DEFINE0(getpgrp
)
1055 return sys_getpgid(0);
1060 SYSCALL_DEFINE1(getsid
, pid_t
, pid
)
1062 struct task_struct
*p
;
1068 sid
= task_session(current
);
1071 p
= find_task_by_vpid(pid
);
1074 sid
= task_session(p
);
1078 retval
= security_task_getsid(p
);
1082 retval
= pid_vnr(sid
);
1088 static void set_special_pids(struct pid
*pid
)
1090 struct task_struct
*curr
= current
->group_leader
;
1092 if (task_session(curr
) != pid
)
1093 change_pid(curr
, PIDTYPE_SID
, pid
);
1095 if (task_pgrp(curr
) != pid
)
1096 change_pid(curr
, PIDTYPE_PGID
, pid
);
1099 SYSCALL_DEFINE0(setsid
)
1101 struct task_struct
*group_leader
= current
->group_leader
;
1102 struct pid
*sid
= task_pid(group_leader
);
1103 pid_t session
= pid_vnr(sid
);
1106 write_lock_irq(&tasklist_lock
);
1107 /* Fail if I am already a session leader */
1108 if (group_leader
->signal
->leader
)
1111 /* Fail if a process group id already exists that equals the
1112 * proposed session id.
1114 if (pid_task(sid
, PIDTYPE_PGID
))
1117 group_leader
->signal
->leader
= 1;
1118 set_special_pids(sid
);
1120 proc_clear_tty(group_leader
);
1124 write_unlock_irq(&tasklist_lock
);
1126 proc_sid_connector(group_leader
);
1127 sched_autogroup_create_attach(group_leader
);
1132 DECLARE_RWSEM(uts_sem
);
1134 #ifdef COMPAT_UTS_MACHINE
1135 static char compat_uts_machine
[__OLD_UTS_LEN
+1] = COMPAT_UTS_MACHINE
;
1137 static int __init
parse_compat_uts_machine(char *arg
)
1139 strncpy(compat_uts_machine
, arg
, __OLD_UTS_LEN
);
1140 compat_uts_machine
[__OLD_UTS_LEN
] = 0;
1143 early_param("compat_uts_machine", parse_compat_uts_machine
);
1145 #undef COMPAT_UTS_MACHINE
1146 #define COMPAT_UTS_MACHINE compat_uts_machine
1149 #ifdef COMPAT_UTS_MACHINE
1150 #define override_architecture(name) \
1151 (personality(current->personality) == PER_LINUX32 && \
1152 copy_to_user(name->machine, COMPAT_UTS_MACHINE, \
1153 sizeof(COMPAT_UTS_MACHINE)))
1155 #define override_architecture(name) 0
1159 * Work around broken programs that cannot handle "Linux 3.0".
1160 * Instead we map 3.x to 2.6.40+x, so e.g. 3.0 would be 2.6.40
1161 * And we map 4.x to 2.6.60+x, so 4.0 would be 2.6.60.
1163 static int override_release(char __user
*release
, size_t len
)
1167 if (current
->personality
& UNAME26
) {
1168 const char *rest
= UTS_RELEASE
;
1169 char buf
[65] = { 0 };
1175 if (*rest
== '.' && ++ndots
>= 3)
1177 if (!isdigit(*rest
) && *rest
!= '.')
1181 v
= ((LINUX_VERSION_CODE
>> 8) & 0xff) + 60;
1182 copy
= clamp_t(size_t, len
, 1, sizeof(buf
));
1183 copy
= scnprintf(buf
, copy
, "2.6.%u%s", v
, rest
);
1184 ret
= copy_to_user(release
, buf
, copy
+ 1);
1189 SYSCALL_DEFINE1(newuname
, struct new_utsname __user
*, name
)
1193 down_read(&uts_sem
);
1194 if (copy_to_user(name
, utsname(), sizeof *name
))
1198 if (!errno
&& override_release(name
->release
, sizeof(name
->release
)))
1200 if (!errno
&& override_architecture(name
))
1205 #ifdef __ARCH_WANT_SYS_OLD_UNAME
1209 SYSCALL_DEFINE1(uname
, struct old_utsname __user
*, name
)
1216 down_read(&uts_sem
);
1217 if (copy_to_user(name
, utsname(), sizeof(*name
)))
1221 if (!error
&& override_release(name
->release
, sizeof(name
->release
)))
1223 if (!error
&& override_architecture(name
))
1228 SYSCALL_DEFINE1(olduname
, struct oldold_utsname __user
*, name
)
1234 if (!access_ok(VERIFY_WRITE
, name
, sizeof(struct oldold_utsname
)))
1237 down_read(&uts_sem
);
1238 error
= __copy_to_user(&name
->sysname
, &utsname()->sysname
,
1240 error
|= __put_user(0, name
->sysname
+ __OLD_UTS_LEN
);
1241 error
|= __copy_to_user(&name
->nodename
, &utsname()->nodename
,
1243 error
|= __put_user(0, name
->nodename
+ __OLD_UTS_LEN
);
1244 error
|= __copy_to_user(&name
->release
, &utsname()->release
,
1246 error
|= __put_user(0, name
->release
+ __OLD_UTS_LEN
);
1247 error
|= __copy_to_user(&name
->version
, &utsname()->version
,
1249 error
|= __put_user(0, name
->version
+ __OLD_UTS_LEN
);
1250 error
|= __copy_to_user(&name
->machine
, &utsname()->machine
,
1252 error
|= __put_user(0, name
->machine
+ __OLD_UTS_LEN
);
1255 if (!error
&& override_architecture(name
))
1257 if (!error
&& override_release(name
->release
, sizeof(name
->release
)))
1259 return error
? -EFAULT
: 0;
1263 SYSCALL_DEFINE2(sethostname
, char __user
*, name
, int, len
)
1266 char tmp
[__NEW_UTS_LEN
];
1268 if (!ns_capable(current
->nsproxy
->uts_ns
->user_ns
, CAP_SYS_ADMIN
))
1271 if (len
< 0 || len
> __NEW_UTS_LEN
)
1273 down_write(&uts_sem
);
1275 if (!copy_from_user(tmp
, name
, len
)) {
1276 struct new_utsname
*u
= utsname();
1278 memcpy(u
->nodename
, tmp
, len
);
1279 memset(u
->nodename
+ len
, 0, sizeof(u
->nodename
) - len
);
1281 uts_proc_notify(UTS_PROC_HOSTNAME
);
1287 #ifdef __ARCH_WANT_SYS_GETHOSTNAME
1289 SYSCALL_DEFINE2(gethostname
, char __user
*, name
, int, len
)
1292 struct new_utsname
*u
;
1296 down_read(&uts_sem
);
1298 i
= 1 + strlen(u
->nodename
);
1302 if (copy_to_user(name
, u
->nodename
, i
))
1311 * Only setdomainname; getdomainname can be implemented by calling
1314 SYSCALL_DEFINE2(setdomainname
, char __user
*, name
, int, len
)
1317 char tmp
[__NEW_UTS_LEN
];
1319 if (!ns_capable(current
->nsproxy
->uts_ns
->user_ns
, CAP_SYS_ADMIN
))
1321 if (len
< 0 || len
> __NEW_UTS_LEN
)
1324 down_write(&uts_sem
);
1326 if (!copy_from_user(tmp
, name
, len
)) {
1327 struct new_utsname
*u
= utsname();
1329 memcpy(u
->domainname
, tmp
, len
);
1330 memset(u
->domainname
+ len
, 0, sizeof(u
->domainname
) - len
);
1332 uts_proc_notify(UTS_PROC_DOMAINNAME
);
1338 SYSCALL_DEFINE2(getrlimit
, unsigned int, resource
, struct rlimit __user
*, rlim
)
1340 struct rlimit value
;
1343 ret
= do_prlimit(current
, resource
, NULL
, &value
);
1345 ret
= copy_to_user(rlim
, &value
, sizeof(*rlim
)) ? -EFAULT
: 0;
1350 #ifdef CONFIG_COMPAT
1352 COMPAT_SYSCALL_DEFINE2(setrlimit
, unsigned int, resource
,
1353 struct compat_rlimit __user
*, rlim
)
1356 struct compat_rlimit r32
;
1358 if (copy_from_user(&r32
, rlim
, sizeof(struct compat_rlimit
)))
1361 if (r32
.rlim_cur
== COMPAT_RLIM_INFINITY
)
1362 r
.rlim_cur
= RLIM_INFINITY
;
1364 r
.rlim_cur
= r32
.rlim_cur
;
1365 if (r32
.rlim_max
== COMPAT_RLIM_INFINITY
)
1366 r
.rlim_max
= RLIM_INFINITY
;
1368 r
.rlim_max
= r32
.rlim_max
;
1369 return do_prlimit(current
, resource
, &r
, NULL
);
1372 COMPAT_SYSCALL_DEFINE2(getrlimit
, unsigned int, resource
,
1373 struct compat_rlimit __user
*, rlim
)
1378 ret
= do_prlimit(current
, resource
, NULL
, &r
);
1380 struct compat_rlimit r32
;
1381 if (r
.rlim_cur
> COMPAT_RLIM_INFINITY
)
1382 r32
.rlim_cur
= COMPAT_RLIM_INFINITY
;
1384 r32
.rlim_cur
= r
.rlim_cur
;
1385 if (r
.rlim_max
> COMPAT_RLIM_INFINITY
)
1386 r32
.rlim_max
= COMPAT_RLIM_INFINITY
;
1388 r32
.rlim_max
= r
.rlim_max
;
1390 if (copy_to_user(rlim
, &r32
, sizeof(struct compat_rlimit
)))
1398 #ifdef __ARCH_WANT_SYS_OLD_GETRLIMIT
1401 * Back compatibility for getrlimit. Needed for some apps.
1403 SYSCALL_DEFINE2(old_getrlimit
, unsigned int, resource
,
1404 struct rlimit __user
*, rlim
)
1407 if (resource
>= RLIM_NLIMITS
)
1410 task_lock(current
->group_leader
);
1411 x
= current
->signal
->rlim
[resource
];
1412 task_unlock(current
->group_leader
);
1413 if (x
.rlim_cur
> 0x7FFFFFFF)
1414 x
.rlim_cur
= 0x7FFFFFFF;
1415 if (x
.rlim_max
> 0x7FFFFFFF)
1416 x
.rlim_max
= 0x7FFFFFFF;
1417 return copy_to_user(rlim
, &x
, sizeof(x
)) ? -EFAULT
: 0;
1420 #ifdef CONFIG_COMPAT
1421 COMPAT_SYSCALL_DEFINE2(old_getrlimit
, unsigned int, resource
,
1422 struct compat_rlimit __user
*, rlim
)
1426 if (resource
>= RLIM_NLIMITS
)
1429 task_lock(current
->group_leader
);
1430 r
= current
->signal
->rlim
[resource
];
1431 task_unlock(current
->group_leader
);
1432 if (r
.rlim_cur
> 0x7FFFFFFF)
1433 r
.rlim_cur
= 0x7FFFFFFF;
1434 if (r
.rlim_max
> 0x7FFFFFFF)
1435 r
.rlim_max
= 0x7FFFFFFF;
1437 if (put_user(r
.rlim_cur
, &rlim
->rlim_cur
) ||
1438 put_user(r
.rlim_max
, &rlim
->rlim_max
))
1446 static inline bool rlim64_is_infinity(__u64 rlim64
)
1448 #if BITS_PER_LONG < 64
1449 return rlim64
>= ULONG_MAX
;
1451 return rlim64
== RLIM64_INFINITY
;
1455 static void rlim_to_rlim64(const struct rlimit
*rlim
, struct rlimit64
*rlim64
)
1457 if (rlim
->rlim_cur
== RLIM_INFINITY
)
1458 rlim64
->rlim_cur
= RLIM64_INFINITY
;
1460 rlim64
->rlim_cur
= rlim
->rlim_cur
;
1461 if (rlim
->rlim_max
== RLIM_INFINITY
)
1462 rlim64
->rlim_max
= RLIM64_INFINITY
;
1464 rlim64
->rlim_max
= rlim
->rlim_max
;
1467 static void rlim64_to_rlim(const struct rlimit64
*rlim64
, struct rlimit
*rlim
)
1469 if (rlim64_is_infinity(rlim64
->rlim_cur
))
1470 rlim
->rlim_cur
= RLIM_INFINITY
;
1472 rlim
->rlim_cur
= (unsigned long)rlim64
->rlim_cur
;
1473 if (rlim64_is_infinity(rlim64
->rlim_max
))
1474 rlim
->rlim_max
= RLIM_INFINITY
;
1476 rlim
->rlim_max
= (unsigned long)rlim64
->rlim_max
;
1479 /* make sure you are allowed to change @tsk limits before calling this */
1480 int do_prlimit(struct task_struct
*tsk
, unsigned int resource
,
1481 struct rlimit
*new_rlim
, struct rlimit
*old_rlim
)
1483 struct rlimit
*rlim
;
1486 if (resource
>= RLIM_NLIMITS
)
1489 if (new_rlim
->rlim_cur
> new_rlim
->rlim_max
)
1491 if (resource
== RLIMIT_NOFILE
&&
1492 new_rlim
->rlim_max
> sysctl_nr_open
)
1496 /* protect tsk->signal and tsk->sighand from disappearing */
1497 read_lock(&tasklist_lock
);
1498 if (!tsk
->sighand
) {
1503 rlim
= tsk
->signal
->rlim
+ resource
;
1504 task_lock(tsk
->group_leader
);
1506 /* Keep the capable check against init_user_ns until
1507 cgroups can contain all limits */
1508 if (new_rlim
->rlim_max
> rlim
->rlim_max
&&
1509 !capable(CAP_SYS_RESOURCE
))
1512 retval
= security_task_setrlimit(tsk
, resource
, new_rlim
);
1513 if (resource
== RLIMIT_CPU
&& new_rlim
->rlim_cur
== 0) {
1515 * The caller is asking for an immediate RLIMIT_CPU
1516 * expiry. But we use the zero value to mean "it was
1517 * never set". So let's cheat and make it one second
1520 new_rlim
->rlim_cur
= 1;
1529 task_unlock(tsk
->group_leader
);
1532 * RLIMIT_CPU handling. Note that the kernel fails to return an error
1533 * code if it rejected the user's attempt to set RLIMIT_CPU. This is a
1534 * very long-standing error, and fixing it now risks breakage of
1535 * applications, so we live with it
1537 if (!retval
&& new_rlim
&& resource
== RLIMIT_CPU
&&
1538 new_rlim
->rlim_cur
!= RLIM_INFINITY
&&
1539 IS_ENABLED(CONFIG_POSIX_TIMERS
))
1540 update_rlimit_cpu(tsk
, new_rlim
->rlim_cur
);
1542 read_unlock(&tasklist_lock
);
1546 /* rcu lock must be held */
1547 static int check_prlimit_permission(struct task_struct
*task
,
1550 const struct cred
*cred
= current_cred(), *tcred
;
1553 if (current
== task
)
1556 tcred
= __task_cred(task
);
1557 id_match
= (uid_eq(cred
->uid
, tcred
->euid
) &&
1558 uid_eq(cred
->uid
, tcred
->suid
) &&
1559 uid_eq(cred
->uid
, tcred
->uid
) &&
1560 gid_eq(cred
->gid
, tcred
->egid
) &&
1561 gid_eq(cred
->gid
, tcred
->sgid
) &&
1562 gid_eq(cred
->gid
, tcred
->gid
));
1563 if (!id_match
&& !ns_capable(tcred
->user_ns
, CAP_SYS_RESOURCE
))
1566 return security_task_prlimit(cred
, tcred
, flags
);
1569 SYSCALL_DEFINE4(prlimit64
, pid_t
, pid
, unsigned int, resource
,
1570 const struct rlimit64 __user
*, new_rlim
,
1571 struct rlimit64 __user
*, old_rlim
)
1573 struct rlimit64 old64
, new64
;
1574 struct rlimit old
, new;
1575 struct task_struct
*tsk
;
1576 unsigned int checkflags
= 0;
1580 checkflags
|= LSM_PRLIMIT_READ
;
1583 if (copy_from_user(&new64
, new_rlim
, sizeof(new64
)))
1585 rlim64_to_rlim(&new64
, &new);
1586 checkflags
|= LSM_PRLIMIT_WRITE
;
1590 tsk
= pid
? find_task_by_vpid(pid
) : current
;
1595 ret
= check_prlimit_permission(tsk
, checkflags
);
1600 get_task_struct(tsk
);
1603 ret
= do_prlimit(tsk
, resource
, new_rlim
? &new : NULL
,
1604 old_rlim
? &old
: NULL
);
1606 if (!ret
&& old_rlim
) {
1607 rlim_to_rlim64(&old
, &old64
);
1608 if (copy_to_user(old_rlim
, &old64
, sizeof(old64
)))
1612 put_task_struct(tsk
);
1616 SYSCALL_DEFINE2(setrlimit
, unsigned int, resource
, struct rlimit __user
*, rlim
)
1618 struct rlimit new_rlim
;
1620 if (copy_from_user(&new_rlim
, rlim
, sizeof(*rlim
)))
1622 return do_prlimit(current
, resource
, &new_rlim
, NULL
);
1626 * It would make sense to put struct rusage in the task_struct,
1627 * except that would make the task_struct be *really big*. After
1628 * task_struct gets moved into malloc'ed memory, it would
1629 * make sense to do this. It will make moving the rest of the information
1630 * a lot simpler! (Which we're not doing right now because we're not
1631 * measuring them yet).
1633 * When sampling multiple threads for RUSAGE_SELF, under SMP we might have
1634 * races with threads incrementing their own counters. But since word
1635 * reads are atomic, we either get new values or old values and we don't
1636 * care which for the sums. We always take the siglock to protect reading
1637 * the c* fields from p->signal from races with exit.c updating those
1638 * fields when reaping, so a sample either gets all the additions of a
1639 * given child after it's reaped, or none so this sample is before reaping.
1642 * We need to take the siglock for CHILDEREN, SELF and BOTH
1643 * for the cases current multithreaded, non-current single threaded
1644 * non-current multithreaded. Thread traversal is now safe with
1646 * Strictly speaking, we donot need to take the siglock if we are current and
1647 * single threaded, as no one else can take our signal_struct away, no one
1648 * else can reap the children to update signal->c* counters, and no one else
1649 * can race with the signal-> fields. If we do not take any lock, the
1650 * signal-> fields could be read out of order while another thread was just
1651 * exiting. So we should place a read memory barrier when we avoid the lock.
1652 * On the writer side, write memory barrier is implied in __exit_signal
1653 * as __exit_signal releases the siglock spinlock after updating the signal->
1654 * fields. But we don't do this yet to keep things simple.
1658 static void accumulate_thread_rusage(struct task_struct
*t
, struct rusage
*r
)
1660 r
->ru_nvcsw
+= t
->nvcsw
;
1661 r
->ru_nivcsw
+= t
->nivcsw
;
1662 r
->ru_minflt
+= t
->min_flt
;
1663 r
->ru_majflt
+= t
->maj_flt
;
1664 r
->ru_inblock
+= task_io_get_inblock(t
);
1665 r
->ru_oublock
+= task_io_get_oublock(t
);
1668 void getrusage(struct task_struct
*p
, int who
, struct rusage
*r
)
1670 struct task_struct
*t
;
1671 unsigned long flags
;
1672 u64 tgutime
, tgstime
, utime
, stime
;
1673 unsigned long maxrss
= 0;
1675 memset((char *)r
, 0, sizeof (*r
));
1678 if (who
== RUSAGE_THREAD
) {
1679 task_cputime_adjusted(current
, &utime
, &stime
);
1680 accumulate_thread_rusage(p
, r
);
1681 maxrss
= p
->signal
->maxrss
;
1685 if (!lock_task_sighand(p
, &flags
))
1690 case RUSAGE_CHILDREN
:
1691 utime
= p
->signal
->cutime
;
1692 stime
= p
->signal
->cstime
;
1693 r
->ru_nvcsw
= p
->signal
->cnvcsw
;
1694 r
->ru_nivcsw
= p
->signal
->cnivcsw
;
1695 r
->ru_minflt
= p
->signal
->cmin_flt
;
1696 r
->ru_majflt
= p
->signal
->cmaj_flt
;
1697 r
->ru_inblock
= p
->signal
->cinblock
;
1698 r
->ru_oublock
= p
->signal
->coublock
;
1699 maxrss
= p
->signal
->cmaxrss
;
1701 if (who
== RUSAGE_CHILDREN
)
1705 thread_group_cputime_adjusted(p
, &tgutime
, &tgstime
);
1708 r
->ru_nvcsw
+= p
->signal
->nvcsw
;
1709 r
->ru_nivcsw
+= p
->signal
->nivcsw
;
1710 r
->ru_minflt
+= p
->signal
->min_flt
;
1711 r
->ru_majflt
+= p
->signal
->maj_flt
;
1712 r
->ru_inblock
+= p
->signal
->inblock
;
1713 r
->ru_oublock
+= p
->signal
->oublock
;
1714 if (maxrss
< p
->signal
->maxrss
)
1715 maxrss
= p
->signal
->maxrss
;
1718 accumulate_thread_rusage(t
, r
);
1719 } while_each_thread(p
, t
);
1725 unlock_task_sighand(p
, &flags
);
1728 r
->ru_utime
= ns_to_timeval(utime
);
1729 r
->ru_stime
= ns_to_timeval(stime
);
1731 if (who
!= RUSAGE_CHILDREN
) {
1732 struct mm_struct
*mm
= get_task_mm(p
);
1735 setmax_mm_hiwater_rss(&maxrss
, mm
);
1739 r
->ru_maxrss
= maxrss
* (PAGE_SIZE
/ 1024); /* convert pages to KBs */
1742 SYSCALL_DEFINE2(getrusage
, int, who
, struct rusage __user
*, ru
)
1746 if (who
!= RUSAGE_SELF
&& who
!= RUSAGE_CHILDREN
&&
1747 who
!= RUSAGE_THREAD
)
1750 getrusage(current
, who
, &r
);
1751 return copy_to_user(ru
, &r
, sizeof(r
)) ? -EFAULT
: 0;
1754 #ifdef CONFIG_COMPAT
1755 COMPAT_SYSCALL_DEFINE2(getrusage
, int, who
, struct compat_rusage __user
*, ru
)
1759 if (who
!= RUSAGE_SELF
&& who
!= RUSAGE_CHILDREN
&&
1760 who
!= RUSAGE_THREAD
)
1763 getrusage(current
, who
, &r
);
1764 return put_compat_rusage(&r
, ru
);
1768 SYSCALL_DEFINE1(umask
, int, mask
)
1770 mask
= xchg(¤t
->fs
->umask
, mask
& S_IRWXUGO
);
1774 static int prctl_set_mm_exe_file(struct mm_struct
*mm
, unsigned int fd
)
1777 struct file
*old_exe
, *exe_file
;
1778 struct inode
*inode
;
1785 inode
= file_inode(exe
.file
);
1788 * Because the original mm->exe_file points to executable file, make
1789 * sure that this one is executable as well, to avoid breaking an
1793 if (!S_ISREG(inode
->i_mode
) || path_noexec(&exe
.file
->f_path
))
1796 err
= inode_permission(inode
, MAY_EXEC
);
1801 * Forbid mm->exe_file change if old file still mapped.
1803 exe_file
= get_mm_exe_file(mm
);
1806 struct vm_area_struct
*vma
;
1808 down_read(&mm
->mmap_sem
);
1809 for (vma
= mm
->mmap
; vma
; vma
= vma
->vm_next
) {
1812 if (path_equal(&vma
->vm_file
->f_path
,
1817 up_read(&mm
->mmap_sem
);
1822 /* set the new file, lockless */
1824 old_exe
= xchg(&mm
->exe_file
, exe
.file
);
1831 up_read(&mm
->mmap_sem
);
1837 * WARNING: we don't require any capability here so be very careful
1838 * in what is allowed for modification from userspace.
1840 static int validate_prctl_map(struct prctl_mm_map
*prctl_map
)
1842 unsigned long mmap_max_addr
= TASK_SIZE
;
1843 struct mm_struct
*mm
= current
->mm
;
1844 int error
= -EINVAL
, i
;
1846 static const unsigned char offsets
[] = {
1847 offsetof(struct prctl_mm_map
, start_code
),
1848 offsetof(struct prctl_mm_map
, end_code
),
1849 offsetof(struct prctl_mm_map
, start_data
),
1850 offsetof(struct prctl_mm_map
, end_data
),
1851 offsetof(struct prctl_mm_map
, start_brk
),
1852 offsetof(struct prctl_mm_map
, brk
),
1853 offsetof(struct prctl_mm_map
, start_stack
),
1854 offsetof(struct prctl_mm_map
, arg_start
),
1855 offsetof(struct prctl_mm_map
, arg_end
),
1856 offsetof(struct prctl_mm_map
, env_start
),
1857 offsetof(struct prctl_mm_map
, env_end
),
1861 * Make sure the members are not somewhere outside
1862 * of allowed address space.
1864 for (i
= 0; i
< ARRAY_SIZE(offsets
); i
++) {
1865 u64 val
= *(u64
*)((char *)prctl_map
+ offsets
[i
]);
1867 if ((unsigned long)val
>= mmap_max_addr
||
1868 (unsigned long)val
< mmap_min_addr
)
1873 * Make sure the pairs are ordered.
1875 #define __prctl_check_order(__m1, __op, __m2) \
1876 ((unsigned long)prctl_map->__m1 __op \
1877 (unsigned long)prctl_map->__m2) ? 0 : -EINVAL
1878 error
= __prctl_check_order(start_code
, <, end_code
);
1879 error
|= __prctl_check_order(start_data
, <, end_data
);
1880 error
|= __prctl_check_order(start_brk
, <=, brk
);
1881 error
|= __prctl_check_order(arg_start
, <=, arg_end
);
1882 error
|= __prctl_check_order(env_start
, <=, env_end
);
1885 #undef __prctl_check_order
1890 * @brk should be after @end_data in traditional maps.
1892 if (prctl_map
->start_brk
<= prctl_map
->end_data
||
1893 prctl_map
->brk
<= prctl_map
->end_data
)
1897 * Neither we should allow to override limits if they set.
1899 if (check_data_rlimit(rlimit(RLIMIT_DATA
), prctl_map
->brk
,
1900 prctl_map
->start_brk
, prctl_map
->end_data
,
1901 prctl_map
->start_data
))
1905 * Someone is trying to cheat the auxv vector.
1907 if (prctl_map
->auxv_size
) {
1908 if (!prctl_map
->auxv
|| prctl_map
->auxv_size
> sizeof(mm
->saved_auxv
))
1913 * Finally, make sure the caller has the rights to
1914 * change /proc/pid/exe link: only local root should
1917 if (prctl_map
->exe_fd
!= (u32
)-1) {
1918 struct user_namespace
*ns
= current_user_ns();
1919 const struct cred
*cred
= current_cred();
1921 if (!uid_eq(cred
->uid
, make_kuid(ns
, 0)) ||
1922 !gid_eq(cred
->gid
, make_kgid(ns
, 0)))
1931 #ifdef CONFIG_CHECKPOINT_RESTORE
1932 static int prctl_set_mm_map(int opt
, const void __user
*addr
, unsigned long data_size
)
1934 struct prctl_mm_map prctl_map
= { .exe_fd
= (u32
)-1, };
1935 unsigned long user_auxv
[AT_VECTOR_SIZE
];
1936 struct mm_struct
*mm
= current
->mm
;
1939 BUILD_BUG_ON(sizeof(user_auxv
) != sizeof(mm
->saved_auxv
));
1940 BUILD_BUG_ON(sizeof(struct prctl_mm_map
) > 256);
1942 if (opt
== PR_SET_MM_MAP_SIZE
)
1943 return put_user((unsigned int)sizeof(prctl_map
),
1944 (unsigned int __user
*)addr
);
1946 if (data_size
!= sizeof(prctl_map
))
1949 if (copy_from_user(&prctl_map
, addr
, sizeof(prctl_map
)))
1952 error
= validate_prctl_map(&prctl_map
);
1956 if (prctl_map
.auxv_size
) {
1957 memset(user_auxv
, 0, sizeof(user_auxv
));
1958 if (copy_from_user(user_auxv
,
1959 (const void __user
*)prctl_map
.auxv
,
1960 prctl_map
.auxv_size
))
1963 /* Last entry must be AT_NULL as specification requires */
1964 user_auxv
[AT_VECTOR_SIZE
- 2] = AT_NULL
;
1965 user_auxv
[AT_VECTOR_SIZE
- 1] = AT_NULL
;
1968 if (prctl_map
.exe_fd
!= (u32
)-1) {
1969 error
= prctl_set_mm_exe_file(mm
, prctl_map
.exe_fd
);
1974 down_write(&mm
->mmap_sem
);
1977 * We don't validate if these members are pointing to
1978 * real present VMAs because application may have correspond
1979 * VMAs already unmapped and kernel uses these members for statistics
1980 * output in procfs mostly, except
1982 * - @start_brk/@brk which are used in do_brk but kernel lookups
1983 * for VMAs when updating these memvers so anything wrong written
1984 * here cause kernel to swear at userspace program but won't lead
1985 * to any problem in kernel itself
1988 mm
->start_code
= prctl_map
.start_code
;
1989 mm
->end_code
= prctl_map
.end_code
;
1990 mm
->start_data
= prctl_map
.start_data
;
1991 mm
->end_data
= prctl_map
.end_data
;
1992 mm
->start_brk
= prctl_map
.start_brk
;
1993 mm
->brk
= prctl_map
.brk
;
1994 mm
->start_stack
= prctl_map
.start_stack
;
1995 mm
->arg_start
= prctl_map
.arg_start
;
1996 mm
->arg_end
= prctl_map
.arg_end
;
1997 mm
->env_start
= prctl_map
.env_start
;
1998 mm
->env_end
= prctl_map
.env_end
;
2001 * Note this update of @saved_auxv is lockless thus
2002 * if someone reads this member in procfs while we're
2003 * updating -- it may get partly updated results. It's
2004 * known and acceptable trade off: we leave it as is to
2005 * not introduce additional locks here making the kernel
2008 if (prctl_map
.auxv_size
)
2009 memcpy(mm
->saved_auxv
, user_auxv
, sizeof(user_auxv
));
2011 up_write(&mm
->mmap_sem
);
2014 #endif /* CONFIG_CHECKPOINT_RESTORE */
2016 static int prctl_set_auxv(struct mm_struct
*mm
, unsigned long addr
,
2020 * This doesn't move the auxiliary vector itself since it's pinned to
2021 * mm_struct, but it permits filling the vector with new values. It's
2022 * up to the caller to provide sane values here, otherwise userspace
2023 * tools which use this vector might be unhappy.
2025 unsigned long user_auxv
[AT_VECTOR_SIZE
];
2027 if (len
> sizeof(user_auxv
))
2030 if (copy_from_user(user_auxv
, (const void __user
*)addr
, len
))
2033 /* Make sure the last entry is always AT_NULL */
2034 user_auxv
[AT_VECTOR_SIZE
- 2] = 0;
2035 user_auxv
[AT_VECTOR_SIZE
- 1] = 0;
2037 BUILD_BUG_ON(sizeof(user_auxv
) != sizeof(mm
->saved_auxv
));
2040 memcpy(mm
->saved_auxv
, user_auxv
, len
);
2041 task_unlock(current
);
2046 static int prctl_set_mm(int opt
, unsigned long addr
,
2047 unsigned long arg4
, unsigned long arg5
)
2049 struct mm_struct
*mm
= current
->mm
;
2050 struct prctl_mm_map prctl_map
;
2051 struct vm_area_struct
*vma
;
2054 if (arg5
|| (arg4
&& (opt
!= PR_SET_MM_AUXV
&&
2055 opt
!= PR_SET_MM_MAP
&&
2056 opt
!= PR_SET_MM_MAP_SIZE
)))
2059 #ifdef CONFIG_CHECKPOINT_RESTORE
2060 if (opt
== PR_SET_MM_MAP
|| opt
== PR_SET_MM_MAP_SIZE
)
2061 return prctl_set_mm_map(opt
, (const void __user
*)addr
, arg4
);
2064 if (!capable(CAP_SYS_RESOURCE
))
2067 if (opt
== PR_SET_MM_EXE_FILE
)
2068 return prctl_set_mm_exe_file(mm
, (unsigned int)addr
);
2070 if (opt
== PR_SET_MM_AUXV
)
2071 return prctl_set_auxv(mm
, addr
, arg4
);
2073 if (addr
>= TASK_SIZE
|| addr
< mmap_min_addr
)
2078 down_write(&mm
->mmap_sem
);
2079 vma
= find_vma(mm
, addr
);
2081 prctl_map
.start_code
= mm
->start_code
;
2082 prctl_map
.end_code
= mm
->end_code
;
2083 prctl_map
.start_data
= mm
->start_data
;
2084 prctl_map
.end_data
= mm
->end_data
;
2085 prctl_map
.start_brk
= mm
->start_brk
;
2086 prctl_map
.brk
= mm
->brk
;
2087 prctl_map
.start_stack
= mm
->start_stack
;
2088 prctl_map
.arg_start
= mm
->arg_start
;
2089 prctl_map
.arg_end
= mm
->arg_end
;
2090 prctl_map
.env_start
= mm
->env_start
;
2091 prctl_map
.env_end
= mm
->env_end
;
2092 prctl_map
.auxv
= NULL
;
2093 prctl_map
.auxv_size
= 0;
2094 prctl_map
.exe_fd
= -1;
2097 case PR_SET_MM_START_CODE
:
2098 prctl_map
.start_code
= addr
;
2100 case PR_SET_MM_END_CODE
:
2101 prctl_map
.end_code
= addr
;
2103 case PR_SET_MM_START_DATA
:
2104 prctl_map
.start_data
= addr
;
2106 case PR_SET_MM_END_DATA
:
2107 prctl_map
.end_data
= addr
;
2109 case PR_SET_MM_START_STACK
:
2110 prctl_map
.start_stack
= addr
;
2112 case PR_SET_MM_START_BRK
:
2113 prctl_map
.start_brk
= addr
;
2116 prctl_map
.brk
= addr
;
2118 case PR_SET_MM_ARG_START
:
2119 prctl_map
.arg_start
= addr
;
2121 case PR_SET_MM_ARG_END
:
2122 prctl_map
.arg_end
= addr
;
2124 case PR_SET_MM_ENV_START
:
2125 prctl_map
.env_start
= addr
;
2127 case PR_SET_MM_ENV_END
:
2128 prctl_map
.env_end
= addr
;
2134 error
= validate_prctl_map(&prctl_map
);
2140 * If command line arguments and environment
2141 * are placed somewhere else on stack, we can
2142 * set them up here, ARG_START/END to setup
2143 * command line argumets and ENV_START/END
2146 case PR_SET_MM_START_STACK
:
2147 case PR_SET_MM_ARG_START
:
2148 case PR_SET_MM_ARG_END
:
2149 case PR_SET_MM_ENV_START
:
2150 case PR_SET_MM_ENV_END
:
2157 mm
->start_code
= prctl_map
.start_code
;
2158 mm
->end_code
= prctl_map
.end_code
;
2159 mm
->start_data
= prctl_map
.start_data
;
2160 mm
->end_data
= prctl_map
.end_data
;
2161 mm
->start_brk
= prctl_map
.start_brk
;
2162 mm
->brk
= prctl_map
.brk
;
2163 mm
->start_stack
= prctl_map
.start_stack
;
2164 mm
->arg_start
= prctl_map
.arg_start
;
2165 mm
->arg_end
= prctl_map
.arg_end
;
2166 mm
->env_start
= prctl_map
.env_start
;
2167 mm
->env_end
= prctl_map
.env_end
;
2171 up_write(&mm
->mmap_sem
);
2175 #ifdef CONFIG_CHECKPOINT_RESTORE
2176 static int prctl_get_tid_address(struct task_struct
*me
, int __user
**tid_addr
)
2178 return put_user(me
->clear_child_tid
, tid_addr
);
2181 static int prctl_get_tid_address(struct task_struct
*me
, int __user
**tid_addr
)
2187 static int propagate_has_child_subreaper(struct task_struct
*p
, void *data
)
2190 * If task has has_child_subreaper - all its decendants
2191 * already have these flag too and new decendants will
2192 * inherit it on fork, skip them.
2194 * If we've found child_reaper - skip descendants in
2195 * it's subtree as they will never get out pidns.
2197 if (p
->signal
->has_child_subreaper
||
2198 is_child_reaper(task_pid(p
)))
2201 p
->signal
->has_child_subreaper
= 1;
2205 SYSCALL_DEFINE5(prctl
, int, option
, unsigned long, arg2
, unsigned long, arg3
,
2206 unsigned long, arg4
, unsigned long, arg5
)
2208 struct task_struct
*me
= current
;
2209 unsigned char comm
[sizeof(me
->comm
)];
2212 error
= security_task_prctl(option
, arg2
, arg3
, arg4
, arg5
);
2213 if (error
!= -ENOSYS
)
2218 case PR_SET_PDEATHSIG
:
2219 if (!valid_signal(arg2
)) {
2223 me
->pdeath_signal
= arg2
;
2225 case PR_GET_PDEATHSIG
:
2226 error
= put_user(me
->pdeath_signal
, (int __user
*)arg2
);
2228 case PR_GET_DUMPABLE
:
2229 error
= get_dumpable(me
->mm
);
2231 case PR_SET_DUMPABLE
:
2232 if (arg2
!= SUID_DUMP_DISABLE
&& arg2
!= SUID_DUMP_USER
) {
2236 set_dumpable(me
->mm
, arg2
);
2239 case PR_SET_UNALIGN
:
2240 error
= SET_UNALIGN_CTL(me
, arg2
);
2242 case PR_GET_UNALIGN
:
2243 error
= GET_UNALIGN_CTL(me
, arg2
);
2246 error
= SET_FPEMU_CTL(me
, arg2
);
2249 error
= GET_FPEMU_CTL(me
, arg2
);
2252 error
= SET_FPEXC_CTL(me
, arg2
);
2255 error
= GET_FPEXC_CTL(me
, arg2
);
2258 error
= PR_TIMING_STATISTICAL
;
2261 if (arg2
!= PR_TIMING_STATISTICAL
)
2265 comm
[sizeof(me
->comm
) - 1] = 0;
2266 if (strncpy_from_user(comm
, (char __user
*)arg2
,
2267 sizeof(me
->comm
) - 1) < 0)
2269 set_task_comm(me
, comm
);
2270 proc_comm_connector(me
);
2273 get_task_comm(comm
, me
);
2274 if (copy_to_user((char __user
*)arg2
, comm
, sizeof(comm
)))
2278 error
= GET_ENDIAN(me
, arg2
);
2281 error
= SET_ENDIAN(me
, arg2
);
2283 case PR_GET_SECCOMP
:
2284 error
= prctl_get_seccomp();
2286 case PR_SET_SECCOMP
:
2287 error
= prctl_set_seccomp(arg2
, (char __user
*)arg3
);
2290 error
= GET_TSC_CTL(arg2
);
2293 error
= SET_TSC_CTL(arg2
);
2295 case PR_TASK_PERF_EVENTS_DISABLE
:
2296 error
= perf_event_task_disable();
2298 case PR_TASK_PERF_EVENTS_ENABLE
:
2299 error
= perf_event_task_enable();
2301 case PR_GET_TIMERSLACK
:
2302 if (current
->timer_slack_ns
> ULONG_MAX
)
2305 error
= current
->timer_slack_ns
;
2307 case PR_SET_TIMERSLACK
:
2309 current
->timer_slack_ns
=
2310 current
->default_timer_slack_ns
;
2312 current
->timer_slack_ns
= arg2
;
2318 case PR_MCE_KILL_CLEAR
:
2321 current
->flags
&= ~PF_MCE_PROCESS
;
2323 case PR_MCE_KILL_SET
:
2324 current
->flags
|= PF_MCE_PROCESS
;
2325 if (arg3
== PR_MCE_KILL_EARLY
)
2326 current
->flags
|= PF_MCE_EARLY
;
2327 else if (arg3
== PR_MCE_KILL_LATE
)
2328 current
->flags
&= ~PF_MCE_EARLY
;
2329 else if (arg3
== PR_MCE_KILL_DEFAULT
)
2331 ~(PF_MCE_EARLY
|PF_MCE_PROCESS
);
2339 case PR_MCE_KILL_GET
:
2340 if (arg2
| arg3
| arg4
| arg5
)
2342 if (current
->flags
& PF_MCE_PROCESS
)
2343 error
= (current
->flags
& PF_MCE_EARLY
) ?
2344 PR_MCE_KILL_EARLY
: PR_MCE_KILL_LATE
;
2346 error
= PR_MCE_KILL_DEFAULT
;
2349 error
= prctl_set_mm(arg2
, arg3
, arg4
, arg5
);
2351 case PR_GET_TID_ADDRESS
:
2352 error
= prctl_get_tid_address(me
, (int __user
**)arg2
);
2354 case PR_SET_CHILD_SUBREAPER
:
2355 me
->signal
->is_child_subreaper
= !!arg2
;
2359 walk_process_tree(me
, propagate_has_child_subreaper
, NULL
);
2361 case PR_GET_CHILD_SUBREAPER
:
2362 error
= put_user(me
->signal
->is_child_subreaper
,
2363 (int __user
*)arg2
);
2365 case PR_SET_NO_NEW_PRIVS
:
2366 if (arg2
!= 1 || arg3
|| arg4
|| arg5
)
2369 task_set_no_new_privs(current
);
2371 case PR_GET_NO_NEW_PRIVS
:
2372 if (arg2
|| arg3
|| arg4
|| arg5
)
2374 return task_no_new_privs(current
) ? 1 : 0;
2375 case PR_GET_THP_DISABLE
:
2376 if (arg2
|| arg3
|| arg4
|| arg5
)
2378 error
= !!test_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2380 case PR_SET_THP_DISABLE
:
2381 if (arg3
|| arg4
|| arg5
)
2383 if (down_write_killable(&me
->mm
->mmap_sem
))
2386 set_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2388 clear_bit(MMF_DISABLE_THP
, &me
->mm
->flags
);
2389 up_write(&me
->mm
->mmap_sem
);
2391 case PR_MPX_ENABLE_MANAGEMENT
:
2392 if (arg2
|| arg3
|| arg4
|| arg5
)
2394 error
= MPX_ENABLE_MANAGEMENT();
2396 case PR_MPX_DISABLE_MANAGEMENT
:
2397 if (arg2
|| arg3
|| arg4
|| arg5
)
2399 error
= MPX_DISABLE_MANAGEMENT();
2401 case PR_SET_FP_MODE
:
2402 error
= SET_FP_MODE(me
, arg2
);
2404 case PR_GET_FP_MODE
:
2405 error
= GET_FP_MODE(me
);
2414 SYSCALL_DEFINE3(getcpu
, unsigned __user
*, cpup
, unsigned __user
*, nodep
,
2415 struct getcpu_cache __user
*, unused
)
2418 int cpu
= raw_smp_processor_id();
2421 err
|= put_user(cpu
, cpup
);
2423 err
|= put_user(cpu_to_node(cpu
), nodep
);
2424 return err
? -EFAULT
: 0;
2428 * do_sysinfo - fill in sysinfo struct
2429 * @info: pointer to buffer to fill
2431 static int do_sysinfo(struct sysinfo
*info
)
2433 unsigned long mem_total
, sav_total
;
2434 unsigned int mem_unit
, bitcount
;
2437 memset(info
, 0, sizeof(struct sysinfo
));
2439 get_monotonic_boottime(&tp
);
2440 info
->uptime
= tp
.tv_sec
+ (tp
.tv_nsec
? 1 : 0);
2442 get_avenrun(info
->loads
, 0, SI_LOAD_SHIFT
- FSHIFT
);
2444 info
->procs
= nr_threads
;
2450 * If the sum of all the available memory (i.e. ram + swap)
2451 * is less than can be stored in a 32 bit unsigned long then
2452 * we can be binary compatible with 2.2.x kernels. If not,
2453 * well, in that case 2.2.x was broken anyways...
2455 * -Erik Andersen <andersee@debian.org>
2458 mem_total
= info
->totalram
+ info
->totalswap
;
2459 if (mem_total
< info
->totalram
|| mem_total
< info
->totalswap
)
2462 mem_unit
= info
->mem_unit
;
2463 while (mem_unit
> 1) {
2466 sav_total
= mem_total
;
2468 if (mem_total
< sav_total
)
2473 * If mem_total did not overflow, multiply all memory values by
2474 * info->mem_unit and set it to 1. This leaves things compatible
2475 * with 2.2.x, and also retains compatibility with earlier 2.4.x
2480 info
->totalram
<<= bitcount
;
2481 info
->freeram
<<= bitcount
;
2482 info
->sharedram
<<= bitcount
;
2483 info
->bufferram
<<= bitcount
;
2484 info
->totalswap
<<= bitcount
;
2485 info
->freeswap
<<= bitcount
;
2486 info
->totalhigh
<<= bitcount
;
2487 info
->freehigh
<<= bitcount
;
2493 SYSCALL_DEFINE1(sysinfo
, struct sysinfo __user
*, info
)
2499 if (copy_to_user(info
, &val
, sizeof(struct sysinfo
)))
2505 #ifdef CONFIG_COMPAT
2506 struct compat_sysinfo
{
2520 char _f
[20-2*sizeof(u32
)-sizeof(int)];
2523 COMPAT_SYSCALL_DEFINE1(sysinfo
, struct compat_sysinfo __user
*, info
)
2529 /* Check to see if any memory value is too large for 32-bit and scale
2532 if (upper_32_bits(s
.totalram
) || upper_32_bits(s
.totalswap
)) {
2535 while (s
.mem_unit
< PAGE_SIZE
) {
2540 s
.totalram
>>= bitcount
;
2541 s
.freeram
>>= bitcount
;
2542 s
.sharedram
>>= bitcount
;
2543 s
.bufferram
>>= bitcount
;
2544 s
.totalswap
>>= bitcount
;
2545 s
.freeswap
>>= bitcount
;
2546 s
.totalhigh
>>= bitcount
;
2547 s
.freehigh
>>= bitcount
;
2550 if (!access_ok(VERIFY_WRITE
, info
, sizeof(struct compat_sysinfo
)) ||
2551 __put_user(s
.uptime
, &info
->uptime
) ||
2552 __put_user(s
.loads
[0], &info
->loads
[0]) ||
2553 __put_user(s
.loads
[1], &info
->loads
[1]) ||
2554 __put_user(s
.loads
[2], &info
->loads
[2]) ||
2555 __put_user(s
.totalram
, &info
->totalram
) ||
2556 __put_user(s
.freeram
, &info
->freeram
) ||
2557 __put_user(s
.sharedram
, &info
->sharedram
) ||
2558 __put_user(s
.bufferram
, &info
->bufferram
) ||
2559 __put_user(s
.totalswap
, &info
->totalswap
) ||
2560 __put_user(s
.freeswap
, &info
->freeswap
) ||
2561 __put_user(s
.procs
, &info
->procs
) ||
2562 __put_user(s
.totalhigh
, &info
->totalhigh
) ||
2563 __put_user(s
.freehigh
, &info
->freehigh
) ||
2564 __put_user(s
.mem_unit
, &info
->mem_unit
))
2569 #endif /* CONFIG_COMPAT */