2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 2002 Doug Rabson
5 * Copyright (c) 1994-1995 Søren Schmidt
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer
13 * in this position and unchanged.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. The name of the author may not be used to endorse or promote products
18 * derived from this software without specific prior written permission
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
35 #include "opt_compat.h"
37 #include <sys/param.h>
38 #include <sys/blist.h>
39 #include <sys/fcntl.h>
41 #include <sys/imgact_aout.h>
44 #include <sys/kernel.h>
45 #include <sys/limits.h>
47 #include <sys/malloc.h>
49 #include <sys/mount.h>
50 #include <sys/msgbuf.h>
51 #include <sys/mutex.h>
52 #include <sys/namei.h>
55 #include <sys/procctl.h>
56 #include <sys/reboot.h>
57 #include <sys/racct.h>
58 #include <sys/random.h>
59 #include <sys/resourcevar.h>
60 #include <sys/sched.h>
62 #include <sys/signalvar.h>
64 #include <sys/syscallsubr.h>
65 #include <sys/sysctl.h>
66 #include <sys/sysproto.h>
67 #include <sys/systm.h>
69 #include <sys/vmmeter.h>
70 #include <sys/vnode.h>
72 #include <sys/cpuset.h>
75 #include <security/mac/mac_framework.h>
79 #include <vm/vm_kern.h>
80 #include <vm/vm_map.h>
81 #include <vm/vm_extern.h>
82 #include <vm/swap_pager.h>
85 #include <machine/../linux32/linux.h>
86 #include <machine/../linux32/linux32_proto.h>
88 #include <machine/../linux/linux.h>
89 #include <machine/../linux/linux_proto.h>
92 #include <compat/linux/linux_dtrace.h>
93 #include <compat/linux/linux_file.h>
94 #include <compat/linux/linux_mib.h>
95 #include <compat/linux/linux_signal.h>
96 #include <compat/linux/linux_timer.h>
97 #include <compat/linux/linux_util.h>
98 #include <compat/linux/linux_sysproto.h>
99 #include <compat/linux/linux_emul.h>
100 #include <compat/linux/linux_misc.h>
103 * Special DTrace provider for the linuxulator.
105 * In this file we define the provider for the entire linuxulator. All
106 * modules (= files of the linuxulator) use it.
108 * We define a different name depending on the emulated bitsize, see
109 * ../../<ARCH>/linux{,32}/linux.h, e.g.:
110 * native bitsize = linuxulator
111 * amd64, 32bit emulation = linuxulator32
113 LIN_SDT_PROVIDER_DEFINE(LINUX_DTRACE);
115 int stclohz; /* Statistics clock frequency */
117 static unsigned int linux_to_bsd_resource[LINUX_RLIM_NLIMITS] = {
118 RLIMIT_CPU, RLIMIT_FSIZE, RLIMIT_DATA, RLIMIT_STACK,
119 RLIMIT_CORE, RLIMIT_RSS, RLIMIT_NPROC, RLIMIT_NOFILE,
120 RLIMIT_MEMLOCK, RLIMIT_AS
124 l_long uptime; /* Seconds since boot */
125 l_ulong loads[3]; /* 1, 5, and 15 minute load averages */
126 #define LINUX_SYSINFO_LOADS_SCALE 65536
127 l_ulong totalram; /* Total usable main memory size */
128 l_ulong freeram; /* Available memory size */
129 l_ulong sharedram; /* Amount of shared memory */
130 l_ulong bufferram; /* Memory used by buffers */
131 l_ulong totalswap; /* Total swap space size */
132 l_ulong freeswap; /* swap space still available */
133 l_ushort procs; /* Number of current processes */
138 char _f[20-2*sizeof(l_long)-sizeof(l_int)]; /* padding */
141 struct l_pselect6arg {
146 static int linux_utimensat_nsec_valid(l_long);
149 linux_sysinfo(struct thread *td, struct linux_sysinfo_args *args)
151 struct l_sysinfo sysinfo;
155 bzero(&sysinfo, sizeof(sysinfo));
159 sysinfo.uptime = ts.tv_sec;
161 /* Use the information from the mib to get our load averages */
162 for (i = 0; i < 3; i++)
163 sysinfo.loads[i] = averunnable.ldavg[i] *
164 LINUX_SYSINFO_LOADS_SCALE / averunnable.fscale;
166 sysinfo.totalram = physmem * PAGE_SIZE;
167 sysinfo.freeram = (u_long)vm_free_count() * PAGE_SIZE;
170 * sharedram counts pages allocated to named, swap-backed objects such
171 * as shared memory segments and tmpfs files. There is no cheap way to
172 * compute this, so just leave the field unpopulated. Linux itself only
173 * started setting this field in the 3.x timeframe.
175 sysinfo.sharedram = 0;
176 sysinfo.bufferram = 0;
178 swap_pager_status(&i, &j);
179 sysinfo.totalswap = i * PAGE_SIZE;
180 sysinfo.freeswap = (i - j) * PAGE_SIZE;
182 sysinfo.procs = nprocs;
185 * Platforms supported by the emulation layer do not have a notion of
188 sysinfo.totalhigh = 0;
189 sysinfo.freehigh = 0;
191 sysinfo.mem_unit = 1;
193 return (copyout(&sysinfo, args->info, sizeof(sysinfo)));
196 #ifdef LINUX_LEGACY_SYSCALLS
198 linux_alarm(struct thread *td, struct linux_alarm_args *args)
200 struct itimerval it, old_it;
206 * Linux alarm() is always successful. Limit secs to INT32_MAX / 2
207 * to match kern_setitimer()'s limit to avoid error from it.
209 * XXX. Linux limit secs to INT_MAX on 32 and does not limit on 64-bit
212 if (secs > INT32_MAX / 2)
213 secs = INT32_MAX / 2;
215 it.it_value.tv_sec = secs;
216 it.it_value.tv_usec = 0;
217 timevalclear(&it.it_interval);
218 error = kern_setitimer(td, ITIMER_REAL, &it, &old_it);
219 KASSERT(error == 0, ("kern_setitimer returns %d", error));
221 if ((old_it.it_value.tv_sec == 0 && old_it.it_value.tv_usec > 0) ||
222 old_it.it_value.tv_usec >= 500000)
223 old_it.it_value.tv_sec++;
224 td->td_retval[0] = old_it.it_value.tv_sec;
230 linux_brk(struct thread *td, struct linux_brk_args *args)
232 struct vmspace *vm = td->td_proc->p_vmspace;
235 old = (uintptr_t)vm->vm_daddr + ctob(vm->vm_dsize);
236 new = (uintptr_t)args->dsend;
237 if ((caddr_t)new > vm->vm_daddr && !kern_break(td, &new))
238 td->td_retval[0] = (register_t)new;
240 td->td_retval[0] = (register_t)old;
245 #if defined(__i386__)
246 /* XXX: what about amd64/linux32? */
249 linux_uselib(struct thread *td, struct linux_uselib_args *args)
255 vm_map_entry_t entry;
258 unsigned long file_offset;
259 unsigned long bss_size;
263 bool locked, opened, textset;
271 if (!LUSECONVPATH(td)) {
272 NDINIT(&ni, LOOKUP, ISOPEN | FOLLOW | LOCKLEAF | AUDITVNODE1,
273 UIO_USERSPACE, args->library, td);
276 LCONVPATHEXIST(td, args->library, &library);
277 NDINIT(&ni, LOOKUP, ISOPEN | FOLLOW | LOCKLEAF | AUDITVNODE1,
278 UIO_SYSSPACE, library, td);
286 NDFREE(&ni, NDF_ONLY_PNBUF);
289 * From here on down, we have a locked vnode that must be unlocked.
290 * XXX: The code below largely duplicates exec_check_permissions().
295 error = VOP_GETATTR(vp, &attr, td->td_ucred);
299 if ((vp->v_mount->mnt_flag & MNT_NOEXEC) ||
300 ((attr.va_mode & 0111) == 0) || (attr.va_type != VREG)) {
301 /* EACCESS is what exec(2) returns. */
307 if (attr.va_size == 0) {
312 /* Can we access it? */
313 error = VOP_ACCESS(vp, VEXEC, td->td_ucred, td);
318 * XXX: This should use vn_open() so that it is properly authorized,
319 * and to reduce code redundancy all over the place here.
320 * XXX: Not really, it duplicates far more of exec_check_permissions()
324 error = mac_vnode_check_open(td->td_ucred, vp, VREAD);
328 error = VOP_OPEN(vp, FREAD, td->td_ucred, td, NULL);
333 /* Pull in executable header into exec_map */
334 error = vm_mmap(exec_map, (vm_offset_t *)&a_out, PAGE_SIZE,
335 VM_PROT_READ, VM_PROT_READ, 0, OBJT_VNODE, vp, 0);
339 /* Is it a Linux binary ? */
340 if (((a_out->a_magic >> 16) & 0xff) != 0x64) {
346 * While we are here, we should REALLY do some more checks
349 /* Set file/virtual offset based on a.out variant. */
350 switch ((int)(a_out->a_magic & 0xffff)) {
351 case 0413: /* ZMAGIC */
354 case 0314: /* QMAGIC */
362 bss_size = round_page(a_out->a_bss);
364 /* Check various fields in header for validity/bounds. */
365 if (a_out->a_text & PAGE_MASK || a_out->a_data & PAGE_MASK) {
370 /* text + data can't exceed file size */
371 if (a_out->a_data + a_out->a_text > attr.va_size) {
377 * text/data/bss must not exceed limits
378 * XXX - this is not complete. it should check current usage PLUS
379 * the resources needed by this library.
381 PROC_LOCK(td->td_proc);
382 if (a_out->a_text > maxtsiz ||
383 a_out->a_data + bss_size > lim_cur_proc(td->td_proc, RLIMIT_DATA) ||
384 racct_set(td->td_proc, RACCT_DATA, a_out->a_data +
386 PROC_UNLOCK(td->td_proc);
390 PROC_UNLOCK(td->td_proc);
393 * Prevent more writers.
395 error = VOP_SET_TEXT(vp);
401 * Lock no longer needed
407 * Check if file_offset page aligned. Currently we cannot handle
408 * misalinged file offsets, and so we read in the entire image
411 if (file_offset & PAGE_MASK) {
412 /* Map text+data read/write/execute */
414 /* a_entry is the load address and is page aligned */
415 vmaddr = trunc_page(a_out->a_entry);
417 /* get anon user mapping, read+write+execute */
418 error = vm_map_find(&td->td_proc->p_vmspace->vm_map, NULL, 0,
419 &vmaddr, a_out->a_text + a_out->a_data, 0, VMFS_NO_SPACE,
420 VM_PROT_ALL, VM_PROT_ALL, 0);
424 error = vn_rdwr(UIO_READ, vp, (void *)vmaddr, file_offset,
425 a_out->a_text + a_out->a_data, UIO_USERSPACE, 0,
426 td->td_ucred, NOCRED, &aresid, td);
435 * for QMAGIC, a_entry is 20 bytes beyond the load address
436 * to skip the executable header
438 vmaddr = trunc_page(a_out->a_entry);
441 * Map it all into the process's space as a single
442 * copy-on-write "data" segment.
444 map = &td->td_proc->p_vmspace->vm_map;
445 error = vm_mmap(map, &vmaddr,
446 a_out->a_text + a_out->a_data, VM_PROT_ALL, VM_PROT_ALL,
447 MAP_PRIVATE | MAP_FIXED, OBJT_VNODE, vp, file_offset);
451 if (!vm_map_lookup_entry(map, vmaddr, &entry)) {
456 entry->eflags |= MAP_ENTRY_VN_EXEC;
462 /* Calculate BSS start address */
463 vmaddr = trunc_page(a_out->a_entry) + a_out->a_text +
466 /* allocate some 'anon' space */
467 error = vm_map_find(&td->td_proc->p_vmspace->vm_map, NULL, 0,
468 &vmaddr, bss_size, 0, VMFS_NO_SPACE, VM_PROT_ALL,
479 VOP_CLOSE(vp, FREAD, td->td_ucred, td);
484 VOP_LOCK(vp, LK_SHARED | LK_RETRY);
486 VOP_UNSET_TEXT_CHECKED(vp);
491 /* Release the temporary mapping. */
493 kmap_free_wakeup(exec_map, (vm_offset_t)a_out, PAGE_SIZE);
498 #endif /* __i386__ */
500 #ifdef LINUX_LEGACY_SYSCALLS
502 linux_select(struct thread *td, struct linux_select_args *args)
505 struct timeval tv0, tv1, utv, *tvp;
509 * Store current time for computation of the amount of
513 if ((error = copyin(args->timeout, <v, sizeof(ltv))))
515 utv.tv_sec = ltv.tv_sec;
516 utv.tv_usec = ltv.tv_usec;
518 if (itimerfix(&utv)) {
520 * The timeval was invalid. Convert it to something
521 * valid that will act as it does under Linux.
523 utv.tv_sec += utv.tv_usec / 1000000;
524 utv.tv_usec %= 1000000;
525 if (utv.tv_usec < 0) {
527 utv.tv_usec += 1000000;
537 error = kern_select(td, args->nfds, args->readfds, args->writefds,
538 args->exceptfds, tvp, LINUX_NFDBITS);
543 if (td->td_retval[0]) {
545 * Compute how much time was left of the timeout,
546 * by subtracting the current time and the time
547 * before we started the call, and subtracting
548 * that result from the user-supplied value.
551 timevalsub(&tv1, &tv0);
552 timevalsub(&utv, &tv1);
557 ltv.tv_sec = utv.tv_sec;
558 ltv.tv_usec = utv.tv_usec;
559 if ((error = copyout(<v, args->timeout, sizeof(ltv))))
569 linux_mremap(struct thread *td, struct linux_mremap_args *args)
575 if (args->flags & ~(LINUX_MREMAP_FIXED | LINUX_MREMAP_MAYMOVE)) {
576 td->td_retval[0] = 0;
581 * Check for the page alignment.
582 * Linux defines PAGE_MASK to be FreeBSD ~PAGE_MASK.
584 if (args->addr & PAGE_MASK) {
585 td->td_retval[0] = 0;
589 args->new_len = round_page(args->new_len);
590 args->old_len = round_page(args->old_len);
592 if (args->new_len > args->old_len) {
593 td->td_retval[0] = 0;
597 if (args->new_len < args->old_len) {
598 addr = args->addr + args->new_len;
599 len = args->old_len - args->new_len;
600 error = kern_munmap(td, addr, len);
603 td->td_retval[0] = error ? 0 : (uintptr_t)args->addr;
607 #define LINUX_MS_ASYNC 0x0001
608 #define LINUX_MS_INVALIDATE 0x0002
609 #define LINUX_MS_SYNC 0x0004
612 linux_msync(struct thread *td, struct linux_msync_args *args)
615 return (kern_msync(td, args->addr, args->len,
616 args->fl & ~LINUX_MS_SYNC));
619 #ifdef LINUX_LEGACY_SYSCALLS
621 linux_time(struct thread *td, struct linux_time_args *args)
629 if (args->tm && (error = copyout(&tm, args->tm, sizeof(tm))))
631 td->td_retval[0] = tm;
636 struct l_times_argv {
639 l_clock_t tms_cutime;
640 l_clock_t tms_cstime;
644 * Glibc versions prior to 2.2.1 always use hard-coded CLK_TCK value.
645 * Since 2.2.1 Glibc uses value exported from kernel via AT_CLKTCK
646 * auxiliary vector entry.
650 #define CONVOTCK(r) (r.tv_sec * CLK_TCK + r.tv_usec / (1000000 / CLK_TCK))
651 #define CONVNTCK(r) (r.tv_sec * stclohz + r.tv_usec / (1000000 / stclohz))
653 #define CONVTCK(r) (linux_kernver(td) >= LINUX_KERNVER_2004000 ? \
654 CONVNTCK(r) : CONVOTCK(r))
657 linux_times(struct thread *td, struct linux_times_args *args)
659 struct timeval tv, utime, stime, cutime, cstime;
660 struct l_times_argv tms;
664 if (args->buf != NULL) {
668 calcru(p, &utime, &stime);
670 calccru(p, &cutime, &cstime);
673 tms.tms_utime = CONVTCK(utime);
674 tms.tms_stime = CONVTCK(stime);
676 tms.tms_cutime = CONVTCK(cutime);
677 tms.tms_cstime = CONVTCK(cstime);
679 if ((error = copyout(&tms, args->buf, sizeof(tms))))
684 td->td_retval[0] = (int)CONVTCK(tv);
689 linux_newuname(struct thread *td, struct linux_newuname_args *args)
691 struct l_new_utsname utsname;
692 char osname[LINUX_MAX_UTSNAME];
693 char osrelease[LINUX_MAX_UTSNAME];
696 linux_get_osname(td, osname);
697 linux_get_osrelease(td, osrelease);
699 bzero(&utsname, sizeof(utsname));
700 strlcpy(utsname.sysname, osname, LINUX_MAX_UTSNAME);
701 getcredhostname(td->td_ucred, utsname.nodename, LINUX_MAX_UTSNAME);
702 getcreddomainname(td->td_ucred, utsname.domainname, LINUX_MAX_UTSNAME);
703 strlcpy(utsname.release, osrelease, LINUX_MAX_UTSNAME);
704 strlcpy(utsname.version, version, LINUX_MAX_UTSNAME);
705 for (p = utsname.version; *p != '\0'; ++p)
710 #if defined(__amd64__)
712 * On amd64, Linux uname(2) needs to return "x86_64"
713 * for both 64-bit and 32-bit applications. On 32-bit,
714 * the string returned by getauxval(AT_PLATFORM) needs
715 * to remain "i686", though.
717 strlcpy(utsname.machine, "x86_64", LINUX_MAX_UTSNAME);
719 strlcpy(utsname.machine, linux_kplatform, LINUX_MAX_UTSNAME);
722 return (copyout(&utsname, args->buf, sizeof(utsname)));
730 #ifdef LINUX_LEGACY_SYSCALLS
732 linux_utime(struct thread *td, struct linux_utime_args *args)
734 struct timeval tv[2], *tvp;
735 struct l_utimbuf lut;
740 convpath = LUSECONVPATH(td);
742 LCONVPATHEXIST(td, args->fname, &fname);
745 if ((error = copyin(args->times, &lut, sizeof lut))) {
750 tv[0].tv_sec = lut.l_actime;
752 tv[1].tv_sec = lut.l_modtime;
759 error = kern_utimesat(td, AT_FDCWD, args->fname, UIO_USERSPACE,
762 error = kern_utimesat(td, AT_FDCWD, fname, UIO_SYSSPACE, tvp,
770 #ifdef LINUX_LEGACY_SYSCALLS
772 linux_utimes(struct thread *td, struct linux_utimes_args *args)
775 struct timeval tv[2], *tvp = NULL;
780 convpath = LUSECONVPATH(td);
782 LCONVPATHEXIST(td, args->fname, &fname);
784 if (args->tptr != NULL) {
785 if ((error = copyin(args->tptr, ltv, sizeof ltv))) {
789 tv[0].tv_sec = ltv[0].tv_sec;
790 tv[0].tv_usec = ltv[0].tv_usec;
791 tv[1].tv_sec = ltv[1].tv_sec;
792 tv[1].tv_usec = ltv[1].tv_usec;
797 error = kern_utimesat(td, AT_FDCWD, args->fname, UIO_USERSPACE,
800 error = kern_utimesat(td, AT_FDCWD, fname, UIO_SYSSPACE,
809 linux_utimensat_nsec_valid(l_long nsec)
812 if (nsec == LINUX_UTIME_OMIT || nsec == LINUX_UTIME_NOW)
814 if (nsec >= 0 && nsec <= 999999999)
820 linux_utimensat(struct thread *td, struct linux_utimensat_args *args)
822 struct l_timespec l_times[2];
823 struct timespec times[2], *timesp = NULL;
825 int error, dfd, flags = 0;
827 dfd = (args->dfd == LINUX_AT_FDCWD) ? AT_FDCWD : args->dfd;
829 if (args->flags & ~LINUX_AT_SYMLINK_NOFOLLOW)
832 if (args->times != NULL) {
833 error = copyin(args->times, l_times, sizeof(l_times));
837 if (linux_utimensat_nsec_valid(l_times[0].tv_nsec) != 0 ||
838 linux_utimensat_nsec_valid(l_times[1].tv_nsec) != 0)
841 times[0].tv_sec = l_times[0].tv_sec;
842 switch (l_times[0].tv_nsec)
844 case LINUX_UTIME_OMIT:
845 times[0].tv_nsec = UTIME_OMIT;
847 case LINUX_UTIME_NOW:
848 times[0].tv_nsec = UTIME_NOW;
851 times[0].tv_nsec = l_times[0].tv_nsec;
854 times[1].tv_sec = l_times[1].tv_sec;
855 switch (l_times[1].tv_nsec)
857 case LINUX_UTIME_OMIT:
858 times[1].tv_nsec = UTIME_OMIT;
860 case LINUX_UTIME_NOW:
861 times[1].tv_nsec = UTIME_NOW;
864 times[1].tv_nsec = l_times[1].tv_nsec;
869 /* This breaks POSIX, but is what the Linux kernel does
870 * _on purpose_ (documented in the man page for utimensat(2)),
871 * so we must follow that behaviour. */
872 if (times[0].tv_nsec == UTIME_OMIT &&
873 times[1].tv_nsec == UTIME_OMIT)
877 if (args->pathname != NULL)
878 LCONVPATHEXIST_AT(td, args->pathname, &path, dfd);
879 else if (args->flags != 0)
882 if (args->flags & LINUX_AT_SYMLINK_NOFOLLOW)
883 flags |= AT_SYMLINK_NOFOLLOW;
886 error = kern_futimens(td, dfd, timesp, UIO_SYSSPACE);
888 error = kern_utimensat(td, dfd, path, UIO_SYSSPACE, timesp,
889 UIO_SYSSPACE, flags);
896 #ifdef LINUX_LEGACY_SYSCALLS
898 linux_futimesat(struct thread *td, struct linux_futimesat_args *args)
901 struct timeval tv[2], *tvp = NULL;
906 convpath = LUSECONVPATH(td);
907 dfd = (args->dfd == LINUX_AT_FDCWD) ? AT_FDCWD : args->dfd;
909 LCONVPATHEXIST_AT(td, args->filename, &fname, dfd);
911 if (args->utimes != NULL) {
912 if ((error = copyin(args->utimes, ltv, sizeof ltv))) {
917 tv[0].tv_sec = ltv[0].tv_sec;
918 tv[0].tv_usec = ltv[0].tv_usec;
919 tv[1].tv_sec = ltv[1].tv_sec;
920 tv[1].tv_usec = ltv[1].tv_usec;
925 error = kern_utimesat(td, dfd, args->filename, UIO_USERSPACE,
928 error = kern_utimesat(td, dfd, fname, UIO_SYSSPACE, tvp, UIO_SYSSPACE);
936 linux_common_wait(struct thread *td, int pid, int *statusp,
937 int options, struct __wrusage *wrup)
942 int error, status, tmpstat;
944 if (pid == WAIT_ANY) {
947 } else if (pid < 0) {
956 * For backward compatibility we implicitly add flags WEXITED
959 options |= WEXITED | WTRAPPED;
960 error = kern_wait6(td, idtype, id, &status, options, wrup, &siginfo);
965 tmpstat = status & 0xffff;
966 if (WIFSIGNALED(tmpstat)) {
967 tmpstat = (tmpstat & 0xffffff80) |
968 bsd_to_linux_signal(WTERMSIG(tmpstat));
969 } else if (WIFSTOPPED(tmpstat)) {
970 tmpstat = (tmpstat & 0xffff00ff) |
971 (bsd_to_linux_signal(WSTOPSIG(tmpstat)) << 8);
972 #if defined(__amd64__) && !defined(COMPAT_LINUX32)
973 if (WSTOPSIG(status) == SIGTRAP) {
974 tmpstat = linux_ptrace_status(td,
975 siginfo.si_pid, tmpstat);
978 } else if (WIFCONTINUED(tmpstat)) {
981 error = copyout(&tmpstat, statusp, sizeof(int));
987 #if defined(__i386__) || (defined(__amd64__) && defined(COMPAT_LINUX32))
989 linux_waitpid(struct thread *td, struct linux_waitpid_args *args)
991 struct linux_wait4_args wait4_args;
993 wait4_args.pid = args->pid;
994 wait4_args.status = args->status;
995 wait4_args.options = args->options;
996 wait4_args.rusage = NULL;
998 return (linux_wait4(td, &wait4_args));
1000 #endif /* __i386__ || (__amd64__ && COMPAT_LINUX32) */
1003 linux_wait4(struct thread *td, struct linux_wait4_args *args)
1006 struct __wrusage wru, *wrup;
1008 if (args->options & ~(LINUX_WUNTRACED | LINUX_WNOHANG |
1009 LINUX_WCONTINUED | __WCLONE | __WNOTHREAD | __WALL))
1013 linux_to_bsd_waitopts(args->options, &options);
1015 if (args->rusage != NULL)
1019 error = linux_common_wait(td, args->pid, args->status, options, wrup);
1022 if (args->rusage != NULL)
1023 error = linux_copyout_rusage(&wru.wru_self, args->rusage);
1028 linux_waitid(struct thread *td, struct linux_waitid_args *args)
1030 int status, options, sig;
1031 struct __wrusage wru;
1039 linux_to_bsd_waitopts(args->options, &options);
1041 if (options & ~(WNOHANG | WNOWAIT | WEXITED | WUNTRACED | WCONTINUED))
1043 if (!(options & (WEXITED | WUNTRACED | WCONTINUED)))
1046 switch (args->idtype) {
1064 error = kern_wait6(td, idtype, args->id, &status, options,
1068 if (args->rusage != NULL) {
1069 error = linux_copyout_rusage(&wru.wru_children,
1074 if (args->info != NULL) {
1076 bzero(&lsi, sizeof(lsi));
1077 if (td->td_retval[0] != 0) {
1078 sig = bsd_to_linux_signal(siginfo.si_signo);
1079 siginfo_to_lsiginfo(&siginfo, &lsi, sig);
1081 error = copyout(&lsi, args->info, sizeof(lsi));
1083 td->td_retval[0] = 0;
1088 #ifdef LINUX_LEGACY_SYSCALLS
1090 linux_mknod(struct thread *td, struct linux_mknod_args *args)
1097 convpath = LUSECONVPATH(td);
1100 seg = UIO_USERSPACE;
1102 LCONVPATHCREAT(td, args->path, &path);
1106 switch (args->mode & S_IFMT) {
1109 error = kern_mkfifoat(td, AT_FDCWD, path, seg,
1115 error = kern_mknodat(td, AT_FDCWD, path, seg,
1116 args->mode, args->dev);
1124 args->mode |= S_IFREG;
1127 error = kern_openat(td, AT_FDCWD, path, seg,
1128 O_WRONLY | O_CREAT | O_TRUNC, args->mode);
1130 kern_close(td, td->td_retval[0]);
1144 linux_mknodat(struct thread *td, struct linux_mknodat_args *args)
1151 dfd = (args->dfd == LINUX_AT_FDCWD) ? AT_FDCWD : args->dfd;
1153 convpath = LUSECONVPATH(td);
1155 path = __DECONST(char *, args->filename);
1156 seg = UIO_USERSPACE;
1158 LCONVPATHCREAT_AT(td, args->filename, &path, dfd);
1162 switch (args->mode & S_IFMT) {
1165 error = kern_mkfifoat(td, dfd, path, seg, args->mode);
1170 error = kern_mknodat(td, dfd, path, seg, args->mode,
1179 args->mode |= S_IFREG;
1182 error = kern_openat(td, dfd, path, seg,
1183 O_WRONLY | O_CREAT | O_TRUNC, args->mode);
1185 kern_close(td, td->td_retval[0]);
1198 * UGH! This is just about the dumbest idea I've ever heard!!
1201 linux_personality(struct thread *td, struct linux_personality_args *args)
1203 struct linux_pemuldata *pem;
1204 struct proc *p = td->td_proc;
1210 if (args->per != 0xffffffff)
1211 pem->persona = args->per;
1214 td->td_retval[0] = old;
1218 struct l_itimerval {
1219 l_timeval it_interval;
1223 #define B2L_ITIMERVAL(bip, lip) \
1224 (bip)->it_interval.tv_sec = (lip)->it_interval.tv_sec; \
1225 (bip)->it_interval.tv_usec = (lip)->it_interval.tv_usec; \
1226 (bip)->it_value.tv_sec = (lip)->it_value.tv_sec; \
1227 (bip)->it_value.tv_usec = (lip)->it_value.tv_usec;
1230 linux_setitimer(struct thread *td, struct linux_setitimer_args *uap)
1233 struct l_itimerval ls;
1234 struct itimerval aitv, oitv;
1236 if (uap->itv == NULL) {
1237 uap->itv = uap->oitv;
1238 return (linux_getitimer(td, (struct linux_getitimer_args *)uap));
1241 error = copyin(uap->itv, &ls, sizeof(ls));
1244 B2L_ITIMERVAL(&aitv, &ls);
1245 error = kern_setitimer(td, uap->which, &aitv, &oitv);
1246 if (error != 0 || uap->oitv == NULL)
1248 B2L_ITIMERVAL(&ls, &oitv);
1250 return (copyout(&ls, uap->oitv, sizeof(ls)));
1254 linux_getitimer(struct thread *td, struct linux_getitimer_args *uap)
1257 struct l_itimerval ls;
1258 struct itimerval aitv;
1260 error = kern_getitimer(td, uap->which, &aitv);
1263 B2L_ITIMERVAL(&ls, &aitv);
1264 return (copyout(&ls, uap->itv, sizeof(ls)));
1267 #if defined(__i386__) || (defined(__amd64__) && defined(COMPAT_LINUX32))
1269 linux_nice(struct thread *td, struct linux_nice_args *args)
1272 return (kern_setpriority(td, PRIO_PROCESS, 0, args->inc));
1274 #endif /* __i386__ || (__amd64__ && COMPAT_LINUX32) */
1277 linux_setgroups(struct thread *td, struct linux_setgroups_args *args)
1279 struct ucred *newcred, *oldcred;
1280 l_gid_t *linux_gidset;
1285 ngrp = args->gidsetsize;
1286 if (ngrp < 0 || ngrp >= ngroups_max + 1)
1288 linux_gidset = malloc(ngrp * sizeof(*linux_gidset), M_LINUX, M_WAITOK);
1289 error = copyin(args->grouplist, linux_gidset, ngrp * sizeof(l_gid_t));
1293 crextend(newcred, ngrp + 1);
1296 oldcred = p->p_ucred;
1297 crcopy(newcred, oldcred);
1300 * cr_groups[0] holds egid. Setting the whole set from
1301 * the supplied set will cause egid to be changed too.
1302 * Keep cr_groups[0] unchanged to prevent that.
1305 if ((error = priv_check_cred(oldcred, PRIV_CRED_SETGROUPS)) != 0) {
1312 newcred->cr_ngroups = ngrp + 1;
1314 bsd_gidset = newcred->cr_groups;
1317 bsd_gidset[ngrp + 1] = linux_gidset[ngrp];
1321 newcred->cr_ngroups = 1;
1324 proc_set_cred(p, newcred);
1329 free(linux_gidset, M_LINUX);
1334 linux_getgroups(struct thread *td, struct linux_getgroups_args *args)
1337 l_gid_t *linux_gidset;
1339 int bsd_gidsetsz, ngrp, error;
1341 cred = td->td_ucred;
1342 bsd_gidset = cred->cr_groups;
1343 bsd_gidsetsz = cred->cr_ngroups - 1;
1346 * cr_groups[0] holds egid. Returning the whole set
1347 * here will cause a duplicate. Exclude cr_groups[0]
1351 if ((ngrp = args->gidsetsize) == 0) {
1352 td->td_retval[0] = bsd_gidsetsz;
1356 if (ngrp < bsd_gidsetsz)
1360 linux_gidset = malloc(bsd_gidsetsz * sizeof(*linux_gidset),
1362 while (ngrp < bsd_gidsetsz) {
1363 linux_gidset[ngrp] = bsd_gidset[ngrp + 1];
1367 error = copyout(linux_gidset, args->grouplist, ngrp * sizeof(l_gid_t));
1368 free(linux_gidset, M_LINUX);
1372 td->td_retval[0] = ngrp;
1377 linux_get_dummy_limit(l_uint resource, struct rlimit *rlim)
1381 case LINUX_RLIMIT_LOCKS:
1382 case LINUX_RLIMIT_SIGPENDING:
1383 case LINUX_RLIMIT_MSGQUEUE:
1384 case LINUX_RLIMIT_RTTIME:
1385 rlim->rlim_cur = LINUX_RLIM_INFINITY;
1386 rlim->rlim_max = LINUX_RLIM_INFINITY;
1388 case LINUX_RLIMIT_NICE:
1389 case LINUX_RLIMIT_RTPRIO:
1399 linux_setrlimit(struct thread *td, struct linux_setrlimit_args *args)
1401 struct rlimit bsd_rlim;
1402 struct l_rlimit rlim;
1406 if (args->resource >= LINUX_RLIM_NLIMITS)
1409 which = linux_to_bsd_resource[args->resource];
1413 error = copyin(args->rlim, &rlim, sizeof(rlim));
1417 bsd_rlim.rlim_cur = (rlim_t)rlim.rlim_cur;
1418 bsd_rlim.rlim_max = (rlim_t)rlim.rlim_max;
1419 return (kern_setrlimit(td, which, &bsd_rlim));
1422 #if defined(__i386__) || (defined(__amd64__) && defined(COMPAT_LINUX32))
1424 linux_old_getrlimit(struct thread *td, struct linux_old_getrlimit_args *args)
1426 struct l_rlimit rlim;
1427 struct rlimit bsd_rlim;
1430 if (linux_get_dummy_limit(args->resource, &bsd_rlim)) {
1431 rlim.rlim_cur = bsd_rlim.rlim_cur;
1432 rlim.rlim_max = bsd_rlim.rlim_max;
1433 return (copyout(&rlim, args->rlim, sizeof(rlim)));
1436 if (args->resource >= LINUX_RLIM_NLIMITS)
1439 which = linux_to_bsd_resource[args->resource];
1443 lim_rlimit(td, which, &bsd_rlim);
1445 #ifdef COMPAT_LINUX32
1446 rlim.rlim_cur = (unsigned int)bsd_rlim.rlim_cur;
1447 if (rlim.rlim_cur == UINT_MAX)
1448 rlim.rlim_cur = INT_MAX;
1449 rlim.rlim_max = (unsigned int)bsd_rlim.rlim_max;
1450 if (rlim.rlim_max == UINT_MAX)
1451 rlim.rlim_max = INT_MAX;
1453 rlim.rlim_cur = (unsigned long)bsd_rlim.rlim_cur;
1454 if (rlim.rlim_cur == ULONG_MAX)
1455 rlim.rlim_cur = LONG_MAX;
1456 rlim.rlim_max = (unsigned long)bsd_rlim.rlim_max;
1457 if (rlim.rlim_max == ULONG_MAX)
1458 rlim.rlim_max = LONG_MAX;
1460 return (copyout(&rlim, args->rlim, sizeof(rlim)));
1462 #endif /* __i386__ || (__amd64__ && COMPAT_LINUX32) */
1465 linux_getrlimit(struct thread *td, struct linux_getrlimit_args *args)
1467 struct l_rlimit rlim;
1468 struct rlimit bsd_rlim;
1471 if (linux_get_dummy_limit(args->resource, &bsd_rlim)) {
1472 rlim.rlim_cur = bsd_rlim.rlim_cur;
1473 rlim.rlim_max = bsd_rlim.rlim_max;
1474 return (copyout(&rlim, args->rlim, sizeof(rlim)));
1477 if (args->resource >= LINUX_RLIM_NLIMITS)
1480 which = linux_to_bsd_resource[args->resource];
1484 lim_rlimit(td, which, &bsd_rlim);
1486 rlim.rlim_cur = (l_ulong)bsd_rlim.rlim_cur;
1487 rlim.rlim_max = (l_ulong)bsd_rlim.rlim_max;
1488 return (copyout(&rlim, args->rlim, sizeof(rlim)));
1492 linux_sched_setscheduler(struct thread *td,
1493 struct linux_sched_setscheduler_args *args)
1495 struct sched_param sched_param;
1499 switch (args->policy) {
1500 case LINUX_SCHED_OTHER:
1501 policy = SCHED_OTHER;
1503 case LINUX_SCHED_FIFO:
1504 policy = SCHED_FIFO;
1506 case LINUX_SCHED_RR:
1513 error = copyin(args->param, &sched_param, sizeof(sched_param));
1517 if (linux_map_sched_prio) {
1520 if (sched_param.sched_priority != 0)
1523 sched_param.sched_priority =
1524 PRI_MAX_TIMESHARE - PRI_MIN_TIMESHARE;
1528 if (sched_param.sched_priority < 1 ||
1529 sched_param.sched_priority >= LINUX_MAX_RT_PRIO)
1533 * Map [1, LINUX_MAX_RT_PRIO - 1] to
1534 * [0, RTP_PRIO_MAX - RTP_PRIO_MIN] (rounding down).
1536 sched_param.sched_priority =
1537 (sched_param.sched_priority - 1) *
1538 (RTP_PRIO_MAX - RTP_PRIO_MIN + 1) /
1539 (LINUX_MAX_RT_PRIO - 1);
1544 tdt = linux_tdfind(td, args->pid, -1);
1548 error = kern_sched_setscheduler(td, tdt, policy, &sched_param);
1549 PROC_UNLOCK(tdt->td_proc);
1554 linux_sched_getscheduler(struct thread *td,
1555 struct linux_sched_getscheduler_args *args)
1560 tdt = linux_tdfind(td, args->pid, -1);
1564 error = kern_sched_getscheduler(td, tdt, &policy);
1565 PROC_UNLOCK(tdt->td_proc);
1569 td->td_retval[0] = LINUX_SCHED_OTHER;
1572 td->td_retval[0] = LINUX_SCHED_FIFO;
1575 td->td_retval[0] = LINUX_SCHED_RR;
1582 linux_sched_get_priority_max(struct thread *td,
1583 struct linux_sched_get_priority_max_args *args)
1585 struct sched_get_priority_max_args bsd;
1587 if (linux_map_sched_prio) {
1588 switch (args->policy) {
1589 case LINUX_SCHED_OTHER:
1590 td->td_retval[0] = 0;
1592 case LINUX_SCHED_FIFO:
1593 case LINUX_SCHED_RR:
1594 td->td_retval[0] = LINUX_MAX_RT_PRIO - 1;
1601 switch (args->policy) {
1602 case LINUX_SCHED_OTHER:
1603 bsd.policy = SCHED_OTHER;
1605 case LINUX_SCHED_FIFO:
1606 bsd.policy = SCHED_FIFO;
1608 case LINUX_SCHED_RR:
1609 bsd.policy = SCHED_RR;
1614 return (sys_sched_get_priority_max(td, &bsd));
1618 linux_sched_get_priority_min(struct thread *td,
1619 struct linux_sched_get_priority_min_args *args)
1621 struct sched_get_priority_min_args bsd;
1623 if (linux_map_sched_prio) {
1624 switch (args->policy) {
1625 case LINUX_SCHED_OTHER:
1626 td->td_retval[0] = 0;
1628 case LINUX_SCHED_FIFO:
1629 case LINUX_SCHED_RR:
1630 td->td_retval[0] = 1;
1637 switch (args->policy) {
1638 case LINUX_SCHED_OTHER:
1639 bsd.policy = SCHED_OTHER;
1641 case LINUX_SCHED_FIFO:
1642 bsd.policy = SCHED_FIFO;
1644 case LINUX_SCHED_RR:
1645 bsd.policy = SCHED_RR;
1650 return (sys_sched_get_priority_min(td, &bsd));
1653 #define REBOOT_CAD_ON 0x89abcdef
1654 #define REBOOT_CAD_OFF 0
1655 #define REBOOT_HALT 0xcdef0123
1656 #define REBOOT_RESTART 0x01234567
1657 #define REBOOT_RESTART2 0xA1B2C3D4
1658 #define REBOOT_POWEROFF 0x4321FEDC
1659 #define REBOOT_MAGIC1 0xfee1dead
1660 #define REBOOT_MAGIC2 0x28121969
1661 #define REBOOT_MAGIC2A 0x05121996
1662 #define REBOOT_MAGIC2B 0x16041998
1665 linux_reboot(struct thread *td, struct linux_reboot_args *args)
1667 struct reboot_args bsd_args;
1669 if (args->magic1 != REBOOT_MAGIC1)
1672 switch (args->magic2) {
1674 case REBOOT_MAGIC2A:
1675 case REBOOT_MAGIC2B:
1681 switch (args->cmd) {
1683 case REBOOT_CAD_OFF:
1684 return (priv_check(td, PRIV_REBOOT));
1686 bsd_args.opt = RB_HALT;
1688 case REBOOT_RESTART:
1689 case REBOOT_RESTART2:
1692 case REBOOT_POWEROFF:
1693 bsd_args.opt = RB_POWEROFF;
1698 return (sys_reboot(td, &bsd_args));
1702 linux_getpid(struct thread *td, struct linux_getpid_args *args)
1705 td->td_retval[0] = td->td_proc->p_pid;
1711 linux_gettid(struct thread *td, struct linux_gettid_args *args)
1713 struct linux_emuldata *em;
1716 KASSERT(em != NULL, ("gettid: emuldata not found.\n"));
1718 td->td_retval[0] = em->em_tid;
1724 linux_getppid(struct thread *td, struct linux_getppid_args *args)
1727 td->td_retval[0] = kern_getppid(td);
1732 linux_getgid(struct thread *td, struct linux_getgid_args *args)
1735 td->td_retval[0] = td->td_ucred->cr_rgid;
1740 linux_getuid(struct thread *td, struct linux_getuid_args *args)
1743 td->td_retval[0] = td->td_ucred->cr_ruid;
1748 linux_getsid(struct thread *td, struct linux_getsid_args *args)
1751 return (kern_getsid(td, args->pid));
1755 linux_nosys(struct thread *td, struct nosys_args *ignore)
1762 linux_getpriority(struct thread *td, struct linux_getpriority_args *args)
1766 error = kern_getpriority(td, args->which, args->who);
1767 td->td_retval[0] = 20 - td->td_retval[0];
1772 linux_sethostname(struct thread *td, struct linux_sethostname_args *args)
1777 name[1] = KERN_HOSTNAME;
1778 return (userland_sysctl(td, name, 2, 0, 0, 0, args->hostname,
1783 linux_setdomainname(struct thread *td, struct linux_setdomainname_args *args)
1788 name[1] = KERN_NISDOMAINNAME;
1789 return (userland_sysctl(td, name, 2, 0, 0, 0, args->name,
1794 linux_exit_group(struct thread *td, struct linux_exit_group_args *args)
1797 LINUX_CTR2(exit_group, "thread(%d) (%d)", td->td_tid,
1801 * XXX: we should send a signal to the parent if
1802 * SIGNAL_EXIT_GROUP is set. We ignore that (temporarily?)
1803 * as it doesnt occur often.
1805 exit1(td, args->error_code, 0);
1809 #define _LINUX_CAPABILITY_VERSION_1 0x19980330
1810 #define _LINUX_CAPABILITY_VERSION_2 0x20071026
1811 #define _LINUX_CAPABILITY_VERSION_3 0x20080522
1813 struct l_user_cap_header {
1818 struct l_user_cap_data {
1825 linux_capget(struct thread *td, struct linux_capget_args *uap)
1827 struct l_user_cap_header luch;
1828 struct l_user_cap_data lucd[2];
1831 if (uap->hdrp == NULL)
1834 error = copyin(uap->hdrp, &luch, sizeof(luch));
1838 switch (luch.version) {
1839 case _LINUX_CAPABILITY_VERSION_1:
1842 case _LINUX_CAPABILITY_VERSION_2:
1843 case _LINUX_CAPABILITY_VERSION_3:
1847 luch.version = _LINUX_CAPABILITY_VERSION_1;
1848 error = copyout(&luch, uap->hdrp, sizeof(luch));
1859 * The current implementation doesn't support setting
1860 * a capability (it's essentially a stub) so indicate
1861 * that no capabilities are currently set or available
1864 memset(&lucd, 0, u32s * sizeof(lucd[0]));
1865 error = copyout(&lucd, uap->datap, u32s * sizeof(lucd[0]));
1872 linux_capset(struct thread *td, struct linux_capset_args *uap)
1874 struct l_user_cap_header luch;
1875 struct l_user_cap_data lucd[2];
1878 if (uap->hdrp == NULL || uap->datap == NULL)
1881 error = copyin(uap->hdrp, &luch, sizeof(luch));
1885 switch (luch.version) {
1886 case _LINUX_CAPABILITY_VERSION_1:
1889 case _LINUX_CAPABILITY_VERSION_2:
1890 case _LINUX_CAPABILITY_VERSION_3:
1894 luch.version = _LINUX_CAPABILITY_VERSION_1;
1895 error = copyout(&luch, uap->hdrp, sizeof(luch));
1904 error = copyin(uap->datap, &lucd, u32s * sizeof(lucd[0]));
1908 /* We currently don't support setting any capabilities. */
1909 for (i = 0; i < u32s; i++) {
1910 if (lucd[i].effective || lucd[i].permitted ||
1911 lucd[i].inheritable) {
1913 "capset[%d] effective=0x%x, permitted=0x%x, "
1914 "inheritable=0x%x is not implemented", i,
1915 (int)lucd[i].effective, (int)lucd[i].permitted,
1916 (int)lucd[i].inheritable);
1925 linux_prctl(struct thread *td, struct linux_prctl_args *args)
1927 int error = 0, max_size;
1928 struct proc *p = td->td_proc;
1929 char comm[LINUX_MAX_COMM_LEN];
1932 switch (args->option) {
1933 case LINUX_PR_SET_PDEATHSIG:
1934 if (!LINUX_SIG_VALID(args->arg2))
1936 pdeath_signal = linux_to_bsd_signal(args->arg2);
1937 return (kern_procctl(td, P_PID, 0, PROC_PDEATHSIG_CTL,
1939 case LINUX_PR_GET_PDEATHSIG:
1940 error = kern_procctl(td, P_PID, 0, PROC_PDEATHSIG_STATUS,
1944 pdeath_signal = bsd_to_linux_signal(pdeath_signal);
1945 return (copyout(&pdeath_signal,
1946 (void *)(register_t)args->arg2,
1947 sizeof(pdeath_signal)));
1949 case LINUX_PR_GET_KEEPCAPS:
1951 * Indicate that we always clear the effective and
1952 * permitted capability sets when the user id becomes
1953 * non-zero (actually the capability sets are simply
1954 * always zero in the current implementation).
1956 td->td_retval[0] = 0;
1958 case LINUX_PR_SET_KEEPCAPS:
1960 * Ignore requests to keep the effective and permitted
1961 * capability sets when the user id becomes non-zero.
1964 case LINUX_PR_SET_NAME:
1966 * To be on the safe side we need to make sure to not
1967 * overflow the size a Linux program expects. We already
1968 * do this here in the copyin, so that we don't need to
1971 max_size = MIN(sizeof(comm), sizeof(p->p_comm));
1972 error = copyinstr((void *)(register_t)args->arg2, comm,
1975 /* Linux silently truncates the name if it is too long. */
1976 if (error == ENAMETOOLONG) {
1978 * XXX: copyinstr() isn't documented to populate the
1979 * array completely, so do a copyin() to be on the
1980 * safe side. This should be changed in case
1981 * copyinstr() is changed to guarantee this.
1983 error = copyin((void *)(register_t)args->arg2, comm,
1985 comm[max_size - 1] = '\0';
1991 strlcpy(p->p_comm, comm, sizeof(p->p_comm));
1994 case LINUX_PR_GET_NAME:
1996 strlcpy(comm, p->p_comm, sizeof(comm));
1998 error = copyout(comm, (void *)(register_t)args->arg2,
2010 linux_sched_setparam(struct thread *td,
2011 struct linux_sched_setparam_args *uap)
2013 struct sched_param sched_param;
2017 error = copyin(uap->param, &sched_param, sizeof(sched_param));
2021 tdt = linux_tdfind(td, uap->pid, -1);
2025 if (linux_map_sched_prio) {
2026 error = kern_sched_getscheduler(td, tdt, &policy);
2032 if (sched_param.sched_priority != 0) {
2036 sched_param.sched_priority =
2037 PRI_MAX_TIMESHARE - PRI_MIN_TIMESHARE;
2041 if (sched_param.sched_priority < 1 ||
2042 sched_param.sched_priority >= LINUX_MAX_RT_PRIO) {
2047 * Map [1, LINUX_MAX_RT_PRIO - 1] to
2048 * [0, RTP_PRIO_MAX - RTP_PRIO_MIN] (rounding down).
2050 sched_param.sched_priority =
2051 (sched_param.sched_priority - 1) *
2052 (RTP_PRIO_MAX - RTP_PRIO_MIN + 1) /
2053 (LINUX_MAX_RT_PRIO - 1);
2058 error = kern_sched_setparam(td, tdt, &sched_param);
2059 out: PROC_UNLOCK(tdt->td_proc);
2064 linux_sched_getparam(struct thread *td,
2065 struct linux_sched_getparam_args *uap)
2067 struct sched_param sched_param;
2071 tdt = linux_tdfind(td, uap->pid, -1);
2075 error = kern_sched_getparam(td, tdt, &sched_param);
2077 PROC_UNLOCK(tdt->td_proc);
2081 if (linux_map_sched_prio) {
2082 error = kern_sched_getscheduler(td, tdt, &policy);
2083 PROC_UNLOCK(tdt->td_proc);
2089 sched_param.sched_priority = 0;
2094 * Map [0, RTP_PRIO_MAX - RTP_PRIO_MIN] to
2095 * [1, LINUX_MAX_RT_PRIO - 1] (rounding up).
2097 sched_param.sched_priority =
2098 (sched_param.sched_priority *
2099 (LINUX_MAX_RT_PRIO - 1) +
2100 (RTP_PRIO_MAX - RTP_PRIO_MIN - 1)) /
2101 (RTP_PRIO_MAX - RTP_PRIO_MIN) + 1;
2105 PROC_UNLOCK(tdt->td_proc);
2107 error = copyout(&sched_param, uap->param, sizeof(sched_param));
2112 * Get affinity of a process.
2115 linux_sched_getaffinity(struct thread *td,
2116 struct linux_sched_getaffinity_args *args)
2121 if (args->len < sizeof(cpuset_t))
2124 tdt = linux_tdfind(td, args->pid, -1);
2128 PROC_UNLOCK(tdt->td_proc);
2130 error = kern_cpuset_getaffinity(td, CPU_LEVEL_WHICH, CPU_WHICH_TID,
2131 tdt->td_tid, sizeof(cpuset_t), (cpuset_t *)args->user_mask_ptr);
2133 td->td_retval[0] = sizeof(cpuset_t);
2139 * Set affinity of a process.
2142 linux_sched_setaffinity(struct thread *td,
2143 struct linux_sched_setaffinity_args *args)
2147 if (args->len < sizeof(cpuset_t))
2150 tdt = linux_tdfind(td, args->pid, -1);
2154 PROC_UNLOCK(tdt->td_proc);
2156 return (kern_cpuset_setaffinity(td, CPU_LEVEL_WHICH, CPU_WHICH_TID,
2157 tdt->td_tid, sizeof(cpuset_t), (cpuset_t *) args->user_mask_ptr));
2160 struct linux_rlimit64 {
2166 linux_prlimit64(struct thread *td, struct linux_prlimit64_args *args)
2168 struct rlimit rlim, nrlim;
2169 struct linux_rlimit64 lrlim;
2175 if (args->new == NULL && args->old != NULL) {
2176 if (linux_get_dummy_limit(args->resource, &rlim)) {
2177 lrlim.rlim_cur = rlim.rlim_cur;
2178 lrlim.rlim_max = rlim.rlim_max;
2179 return (copyout(&lrlim, args->old, sizeof(lrlim)));
2183 if (args->resource >= LINUX_RLIM_NLIMITS)
2186 which = linux_to_bsd_resource[args->resource];
2190 if (args->new != NULL) {
2192 * Note. Unlike FreeBSD where rlim is signed 64-bit Linux
2193 * rlim is unsigned 64-bit. FreeBSD treats negative limits
2194 * as INFINITY so we do not need a conversion even.
2196 error = copyin(args->new, &nrlim, sizeof(nrlim));
2201 flags = PGET_HOLD | PGET_NOTWEXIT;
2202 if (args->new != NULL)
2203 flags |= PGET_CANDEBUG;
2205 flags |= PGET_CANSEE;
2206 if (args->pid == 0) {
2210 error = pget(args->pid, flags, &p);
2214 if (args->old != NULL) {
2216 lim_rlimit_proc(p, which, &rlim);
2218 if (rlim.rlim_cur == RLIM_INFINITY)
2219 lrlim.rlim_cur = LINUX_RLIM_INFINITY;
2221 lrlim.rlim_cur = rlim.rlim_cur;
2222 if (rlim.rlim_max == RLIM_INFINITY)
2223 lrlim.rlim_max = LINUX_RLIM_INFINITY;
2225 lrlim.rlim_max = rlim.rlim_max;
2226 error = copyout(&lrlim, args->old, sizeof(lrlim));
2231 if (args->new != NULL)
2232 error = kern_proc_setrlimit(td, p, which, &nrlim);
2240 linux_pselect6(struct thread *td, struct linux_pselect6_args *args)
2242 struct timeval utv, tv0, tv1, *tvp;
2243 struct l_pselect6arg lpse6;
2244 struct l_timespec lts;
2245 struct timespec uts;
2252 if (args->sig != NULL) {
2253 error = copyin(args->sig, &lpse6, sizeof(lpse6));
2256 if (lpse6.ss_len != sizeof(l_ss))
2258 if (lpse6.ss != 0) {
2259 error = copyin(PTRIN(lpse6.ss), &l_ss,
2263 linux_to_bsd_sigset(&l_ss, &ss);
2269 * Currently glibc changes nanosecond number to microsecond.
2270 * This mean losing precision but for now it is hardly seen.
2272 if (args->tsp != NULL) {
2273 error = copyin(args->tsp, <s, sizeof(lts));
2276 error = linux_to_native_timespec(&uts, <s);
2280 TIMESPEC_TO_TIMEVAL(&utv, &uts);
2281 if (itimerfix(&utv))
2289 error = kern_pselect(td, args->nfds, args->readfds, args->writefds,
2290 args->exceptfds, tvp, ssp, LINUX_NFDBITS);
2292 if (error == 0 && args->tsp != NULL) {
2293 if (td->td_retval[0] != 0) {
2295 * Compute how much time was left of the timeout,
2296 * by subtracting the current time and the time
2297 * before we started the call, and subtracting
2298 * that result from the user-supplied value.
2302 timevalsub(&tv1, &tv0);
2303 timevalsub(&utv, &tv1);
2309 TIMEVAL_TO_TIMESPEC(&utv, &uts);
2311 error = native_to_linux_timespec(<s, &uts);
2313 error = copyout(<s, args->tsp, sizeof(lts));
2320 linux_ppoll(struct thread *td, struct linux_ppoll_args *args)
2322 struct timespec ts0, ts1;
2323 struct l_timespec lts;
2324 struct timespec uts, *tsp;
2330 if (args->sset != NULL) {
2331 if (args->ssize != sizeof(l_ss))
2333 error = copyin(args->sset, &l_ss, sizeof(l_ss));
2336 linux_to_bsd_sigset(&l_ss, &ss);
2340 if (args->tsp != NULL) {
2341 error = copyin(args->tsp, <s, sizeof(lts));
2344 error = linux_to_native_timespec(&uts, <s);
2353 error = kern_poll(td, args->fds, args->nfds, tsp, ssp);
2355 if (error == 0 && args->tsp != NULL) {
2356 if (td->td_retval[0]) {
2358 timespecsub(&ts1, &ts0, &ts1);
2359 timespecsub(&uts, &ts1, &uts);
2361 timespecclear(&uts);
2363 timespecclear(&uts);
2365 error = native_to_linux_timespec(<s, &uts);
2367 error = copyout(<s, args->tsp, sizeof(lts));
2374 linux_sched_rr_get_interval(struct thread *td,
2375 struct linux_sched_rr_get_interval_args *uap)
2378 struct l_timespec lts;
2383 * According to man in case the invalid pid specified
2384 * EINVAL should be returned.
2389 tdt = linux_tdfind(td, uap->pid, -1);
2393 error = kern_sched_rr_get_interval_td(td, tdt, &ts);
2394 PROC_UNLOCK(tdt->td_proc);
2397 error = native_to_linux_timespec(<s, &ts);
2400 return (copyout(<s, uap->interval, sizeof(lts)));
2404 * In case when the Linux thread is the initial thread in
2405 * the thread group thread id is equal to the process id.
2406 * Glibc depends on this magic (assert in pthread_getattr_np.c).
2409 linux_tdfind(struct thread *td, lwpid_t tid, pid_t pid)
2411 struct linux_emuldata *em;
2416 if (tid == 0 || tid == td->td_tid) {
2418 PROC_LOCK(tdt->td_proc);
2419 } else if (tid > PID_MAX)
2420 tdt = tdfind(tid, pid);
2423 * Initial thread where the tid equal to the pid.
2427 if (SV_PROC_ABI(p) != SV_ABI_LINUX) {
2429 * p is not a Linuxulator process.
2434 FOREACH_THREAD_IN_PROC(p, tdt) {
2436 if (tid == em->em_tid)
2448 linux_to_bsd_waitopts(int options, int *bsdopts)
2451 if (options & LINUX_WNOHANG)
2452 *bsdopts |= WNOHANG;
2453 if (options & LINUX_WUNTRACED)
2454 *bsdopts |= WUNTRACED;
2455 if (options & LINUX_WEXITED)
2456 *bsdopts |= WEXITED;
2457 if (options & LINUX_WCONTINUED)
2458 *bsdopts |= WCONTINUED;
2459 if (options & LINUX_WNOWAIT)
2460 *bsdopts |= WNOWAIT;
2462 if (options & __WCLONE)
2463 *bsdopts |= WLINUXCLONE;
2467 linux_getrandom(struct thread *td, struct linux_getrandom_args *args)
2473 if (args->flags & ~(LINUX_GRND_NONBLOCK|LINUX_GRND_RANDOM))
2475 if (args->count > INT_MAX)
2476 args->count = INT_MAX;
2478 iov.iov_base = args->buf;
2479 iov.iov_len = args->count;
2483 uio.uio_resid = iov.iov_len;
2484 uio.uio_segflg = UIO_USERSPACE;
2485 uio.uio_rw = UIO_READ;
2488 error = read_random_uio(&uio, args->flags & LINUX_GRND_NONBLOCK);
2490 td->td_retval[0] = args->count - uio.uio_resid;
2495 linux_mincore(struct thread *td, struct linux_mincore_args *args)
2498 /* Needs to be page-aligned */
2499 if (args->start & PAGE_MASK)
2501 return (kern_mincore(td, args->start, args->len, args->vec));
2504 #define SYSLOG_TAG "<6>"
2507 linux_syslog(struct thread *td, struct linux_syslog_args *args)
2509 char buf[128], *src, *dst;
2513 if (args->type != LINUX_SYSLOG_ACTION_READ_ALL) {
2514 linux_msg(td, "syslog unsupported type 0x%x", args->type);
2518 if (args->len < 6) {
2519 td->td_retval[0] = 0;
2523 error = priv_check(td, PRIV_MSGBUF);
2527 mtx_lock(&msgbuf_lock);
2528 msgbuf_peekbytes(msgbufp, NULL, 0, &seq);
2529 mtx_unlock(&msgbuf_lock);
2532 error = copyout(&SYSLOG_TAG, dst, sizeof(SYSLOG_TAG));
2533 /* The -1 is to skip the trailing '\0'. */
2534 dst += sizeof(SYSLOG_TAG) - 1;
2536 while (error == 0) {
2537 mtx_lock(&msgbuf_lock);
2538 buflen = msgbuf_peekbytes(msgbufp, buf, sizeof(buf), &seq);
2539 mtx_unlock(&msgbuf_lock);
2544 for (src = buf; src < buf + buflen && error == 0; src++) {
2548 if (dst >= args->buf + args->len)
2551 error = copyout(src, dst, 1);
2554 if (*src == '\n' && *(src + 1) != '<' &&
2555 dst + sizeof(SYSLOG_TAG) < args->buf + args->len) {
2556 error = copyout(&SYSLOG_TAG,
2557 dst, sizeof(SYSLOG_TAG));
2558 dst += sizeof(SYSLOG_TAG) - 1;
2563 td->td_retval[0] = dst - args->buf;
2568 linux_getcpu(struct thread *td, struct linux_getcpu_args *args)
2570 int cpu, error, node;
2572 cpu = td->td_oncpu; /* Make sure it doesn't change during copyout(9) */
2574 node = cpuid_to_pcpu[cpu]->pc_domain;
2576 if (args->cpu != NULL)
2577 error = copyout(&cpu, args->cpu, sizeof(l_int));
2578 if (args->node != NULL)
2579 error = copyout(&node, args->node, sizeof(l_int));