Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/compat/linux/linux_misc.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /*- 2 * Copyright (c) 2002 Doug Rabson 3 * Copyright (c) 1994-1995 Søren Schmidt 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer 11 * in this position and unchanged. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. The name of the author may not be used to endorse or promote products 16 * derived from this software without specific prior written permission 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29 30 #include <sys/cdefs.h> 31 __FBSDID("$FreeBSD: releng/5.3/sys/compat/linux/linux_misc.c 133845 2004-08-16 11:12:57Z obrien $"); 32 33 #include "opt_mac.h" 34 35 #include <sys/param.h> 36 #include <sys/blist.h> 37 #include <sys/fcntl.h> 38 #if defined(__i386__) || defined(__alpha__) 39 #include <sys/imgact_aout.h> 40 #endif 41 #include <sys/jail.h> 42 #include <sys/kernel.h> 43 #include <sys/limits.h> 44 #include <sys/lock.h> 45 #include <sys/mac.h> 46 #include <sys/malloc.h> 47 #include <sys/mman.h> 48 #include <sys/mount.h> 49 #include <sys/mutex.h> 50 #include <sys/namei.h> 51 #include <sys/proc.h> 52 #include <sys/reboot.h> 53 #include <sys/resourcevar.h> 54 #include <sys/signalvar.h> 55 #include <sys/stat.h> 56 #include <sys/syscallsubr.h> 57 #include <sys/sysctl.h> 58 #include <sys/sysproto.h> 59 #include <sys/systm.h> 60 #include <sys/time.h> 61 #include <sys/vmmeter.h> 62 #include <sys/vnode.h> 63 #include <sys/wait.h> 64 65 #include <vm/vm.h> 66 #include <vm/pmap.h> 67 #include <vm/vm_kern.h> 68 #include <vm/vm_map.h> 69 #include <vm/vm_extern.h> 70 #include <vm/vm_object.h> 71 #include <vm/swap_pager.h> 72 73 #include <posix4/sched.h> 74 75 #include "opt_compat.h" 76 77 #if !COMPAT_LINUX32 78 #include <machine/../linux/linux.h> 79 #include <machine/../linux/linux_proto.h> 80 #else 81 #include <machine/../linux32/linux.h> 82 #include <machine/../linux32/linux32_proto.h> 83 #endif 84 85 #include <compat/linux/linux_mib.h> 86 #include <compat/linux/linux_util.h> 87 88 #ifdef __i386__ 89 #include <machine/cputypes.h> 90 #endif 91 92 #ifdef __alpha__ 93 #define BSD_TO_LINUX_SIGNAL(sig) (sig) 94 #else 95 #define BSD_TO_LINUX_SIGNAL(sig) \ 96 (((sig) <= LINUX_SIGTBLSZ) ? bsd_to_linux_signal[_SIG_IDX(sig)] : sig) 97 #endif 98 99 #ifndef __alpha__ 100 static unsigned int linux_to_bsd_resource[LINUX_RLIM_NLIMITS] = { 101 RLIMIT_CPU, RLIMIT_FSIZE, RLIMIT_DATA, RLIMIT_STACK, 102 RLIMIT_CORE, RLIMIT_RSS, RLIMIT_NPROC, RLIMIT_NOFILE, 103 RLIMIT_MEMLOCK, -1 104 }; 105 #endif /*!__alpha__*/ 106 107 struct l_sysinfo { 108 l_long uptime; /* Seconds since boot */ 109 l_ulong loads[3]; /* 1, 5, and 15 minute load averages */ 110 #define LINUX_SYSINFO_LOADS_SCALE 65536 111 l_ulong totalram; /* Total usable main memory size */ 112 l_ulong freeram; /* Available memory size */ 113 l_ulong sharedram; /* Amount of shared memory */ 114 l_ulong bufferram; /* Memory used by buffers */ 115 l_ulong totalswap; /* Total swap space size */ 116 l_ulong freeswap; /* swap space still available */ 117 l_ushort procs; /* Number of current processes */ 118 l_ulong totalbig; 119 l_ulong freebig; 120 l_uint mem_unit; 121 char _f[6]; /* Pads structure to 64 bytes */ 122 }; 123 #ifndef __alpha__ 124 int 125 linux_sysinfo(struct thread *td, struct linux_sysinfo_args *args) 126 { 127 struct l_sysinfo sysinfo; 128 vm_object_t object; 129 int i, j; 130 struct timespec ts; 131 132 /* Uptime is copied out of print_uptime() in kern_shutdown.c */ 133 getnanouptime(&ts); 134 i = 0; 135 if (ts.tv_sec >= 86400) { 136 ts.tv_sec %= 86400; 137 i = 1; 138 } 139 if (i || ts.tv_sec >= 3600) { 140 ts.tv_sec %= 3600; 141 i = 1; 142 } 143 if (i || ts.tv_sec >= 60) { 144 ts.tv_sec %= 60; 145 i = 1; 146 } 147 sysinfo.uptime=ts.tv_sec; 148 149 /* Use the information from the mib to get our load averages */ 150 for (i = 0; i < 3; i++) 151 sysinfo.loads[i] = averunnable.ldavg[i] * 152 LINUX_SYSINFO_LOADS_SCALE / averunnable.fscale; 153 154 sysinfo.totalram = physmem * PAGE_SIZE; 155 sysinfo.freeram = sysinfo.totalram - cnt.v_wire_count * PAGE_SIZE; 156 157 sysinfo.sharedram = 0; 158 mtx_lock(&vm_object_list_mtx); 159 TAILQ_FOREACH(object, &vm_object_list, object_list) 160 if (object->shadow_count > 1) 161 sysinfo.sharedram += object->resident_page_count; 162 mtx_unlock(&vm_object_list_mtx); 163 164 sysinfo.sharedram *= PAGE_SIZE; 165 sysinfo.bufferram = 0; 166 167 swap_pager_status(&i, &j); 168 sysinfo.totalswap= i * PAGE_SIZE; 169 sysinfo.freeswap = (i - j) * PAGE_SIZE; 170 171 sysinfo.procs = nprocs; 172 173 /* The following are only present in newer Linux kernels. */ 174 sysinfo.totalbig = 0; 175 sysinfo.freebig = 0; 176 sysinfo.mem_unit = 1; 177 178 return copyout(&sysinfo, args->info, sizeof(sysinfo)); 179 } 180 #endif /*!__alpha__*/ 181 182 #ifndef __alpha__ 183 int 184 linux_alarm(struct thread *td, struct linux_alarm_args *args) 185 { 186 struct itimerval it, old_it; 187 struct timeval tv; 188 struct proc *p; 189 190 #ifdef DEBUG 191 if (ldebug(alarm)) 192 printf(ARGS(alarm, "%u"), args->secs); 193 #endif 194 195 if (args->secs > 100000000) 196 return EINVAL; 197 198 it.it_value.tv_sec = (long)args->secs; 199 it.it_value.tv_usec = 0; 200 it.it_interval.tv_sec = 0; 201 it.it_interval.tv_usec = 0; 202 p = td->td_proc; 203 PROC_LOCK(p); 204 old_it = p->p_realtimer; 205 getmicrouptime(&tv); 206 if (timevalisset(&old_it.it_value)) 207 callout_stop(&p->p_itcallout); 208 if (it.it_value.tv_sec != 0) { 209 callout_reset(&p->p_itcallout, tvtohz(&it.it_value), 210 realitexpire, p); 211 timevaladd(&it.it_value, &tv); 212 } 213 p->p_realtimer = it; 214 PROC_UNLOCK(p); 215 if (timevalcmp(&old_it.it_value, &tv, >)) { 216 timevalsub(&old_it.it_value, &tv); 217 if (old_it.it_value.tv_usec != 0) 218 old_it.it_value.tv_sec++; 219 td->td_retval[0] = old_it.it_value.tv_sec; 220 } 221 return 0; 222 } 223 #endif /*!__alpha__*/ 224 225 int 226 linux_brk(struct thread *td, struct linux_brk_args *args) 227 { 228 struct vmspace *vm = td->td_proc->p_vmspace; 229 vm_offset_t new, old; 230 struct obreak_args /* { 231 char * nsize; 232 } */ tmp; 233 234 #ifdef DEBUG 235 if (ldebug(brk)) 236 printf(ARGS(brk, "%p"), (void *)(uintptr_t)args->dsend); 237 #endif 238 old = (vm_offset_t)vm->vm_daddr + ctob(vm->vm_dsize); 239 new = (vm_offset_t)args->dsend; 240 tmp.nsize = (char *) new; 241 if (((caddr_t)new > vm->vm_daddr) && !obreak(td, &tmp)) 242 td->td_retval[0] = (long)new; 243 else 244 td->td_retval[0] = (long)old; 245 246 return 0; 247 } 248 249 #if defined(__i386__) || defined(__alpha__) 250 251 int 252 linux_uselib(struct thread *td, struct linux_uselib_args *args) 253 { 254 struct nameidata ni; 255 struct vnode *vp; 256 struct exec *a_out; 257 struct vattr attr; 258 vm_offset_t vmaddr; 259 unsigned long file_offset; 260 vm_offset_t buffer; 261 unsigned long bss_size; 262 char *library; 263 int error; 264 int locked; 265 266 LCONVPATHEXIST(td, args->library, &library); 267 268 #ifdef DEBUG 269 if (ldebug(uselib)) 270 printf(ARGS(uselib, "%s"), library); 271 #endif 272 273 a_out = NULL; 274 locked = 0; 275 vp = NULL; 276 277 /* 278 * XXX: This code should make use of vn_open(), rather than doing 279 * all this stuff itself. 280 */ 281 NDINIT(&ni, LOOKUP, FOLLOW|LOCKLEAF, UIO_SYSSPACE, library, td); 282 error = namei(&ni); 283 LFREEPATH(library); 284 if (error) 285 goto cleanup; 286 287 vp = ni.ni_vp; 288 /* 289 * XXX - This looks like a bogus check. A LOCKLEAF namei should not 290 * succeed without returning a vnode. 291 */ 292 if (vp == NULL) { 293 error = ENOEXEC; /* ?? */ 294 goto cleanup; 295 } 296 NDFREE(&ni, NDF_ONLY_PNBUF); 297 298 /* 299 * From here on down, we have a locked vnode that must be unlocked. 300 */ 301 locked++; 302 303 /* Writable? */ 304 if (vp->v_writecount) { 305 error = ETXTBSY; 306 goto cleanup; 307 } 308 309 /* Executable? */ 310 error = VOP_GETATTR(vp, &attr, td->td_ucred, td); 311 if (error) 312 goto cleanup; 313 314 if ((vp->v_mount->mnt_flag & MNT_NOEXEC) || 315 ((attr.va_mode & 0111) == 0) || (attr.va_type != VREG)) { 316 error = ENOEXEC; 317 goto cleanup; 318 } 319 320 /* Sensible size? */ 321 if (attr.va_size == 0) { 322 error = ENOEXEC; 323 goto cleanup; 324 } 325 326 /* Can we access it? */ 327 error = VOP_ACCESS(vp, VEXEC, td->td_ucred, td); 328 if (error) 329 goto cleanup; 330 331 /* 332 * XXX: This should use vn_open() so that it is properly authorized, 333 * and to reduce code redundancy all over the place here. 334 */ 335 #ifdef MAC 336 error = mac_check_vnode_open(td->td_ucred, vp, FREAD); 337 if (error) 338 goto cleanup; 339 #endif 340 error = VOP_OPEN(vp, FREAD, td->td_ucred, td, -1); 341 if (error) 342 goto cleanup; 343 344 /* Pull in executable header into kernel_map */ 345 error = vm_mmap(kernel_map, (vm_offset_t *)&a_out, PAGE_SIZE, 346 VM_PROT_READ, VM_PROT_READ, 0, (caddr_t)vp, 0); 347 /* 348 * Lock no longer needed 349 */ 350 locked = 0; 351 VOP_UNLOCK(vp, 0, td); 352 353 if (error) 354 goto cleanup; 355 356 /* Is it a Linux binary ? */ 357 if (((a_out->a_magic >> 16) & 0xff) != 0x64) { 358 error = ENOEXEC; 359 goto cleanup; 360 } 361 362 /* 363 * While we are here, we should REALLY do some more checks 364 */ 365 366 /* Set file/virtual offset based on a.out variant. */ 367 switch ((int)(a_out->a_magic & 0xffff)) { 368 case 0413: /* ZMAGIC */ 369 file_offset = 1024; 370 break; 371 case 0314: /* QMAGIC */ 372 file_offset = 0; 373 break; 374 default: 375 error = ENOEXEC; 376 goto cleanup; 377 } 378 379 bss_size = round_page(a_out->a_bss); 380 381 /* Check various fields in header for validity/bounds. */ 382 if (a_out->a_text & PAGE_MASK || a_out->a_data & PAGE_MASK) { 383 error = ENOEXEC; 384 goto cleanup; 385 } 386 387 /* text + data can't exceed file size */ 388 if (a_out->a_data + a_out->a_text > attr.va_size) { 389 error = EFAULT; 390 goto cleanup; 391 } 392 393 /* 394 * text/data/bss must not exceed limits 395 * XXX - this is not complete. it should check current usage PLUS 396 * the resources needed by this library. 397 */ 398 PROC_LOCK(td->td_proc); 399 if (a_out->a_text > maxtsiz || 400 a_out->a_data + bss_size > lim_cur(td->td_proc, RLIMIT_DATA)) { 401 PROC_UNLOCK(td->td_proc); 402 error = ENOMEM; 403 goto cleanup; 404 } 405 PROC_UNLOCK(td->td_proc); 406 407 mp_fixme("Unlocked vflags access."); 408 /* prevent more writers */ 409 vp->v_vflag |= VV_TEXT; 410 411 /* 412 * Check if file_offset page aligned. Currently we cannot handle 413 * misalinged file offsets, and so we read in the entire image 414 * (what a waste). 415 */ 416 if (file_offset & PAGE_MASK) { 417 #ifdef DEBUG 418 printf("uselib: Non page aligned binary %lu\n", file_offset); 419 #endif 420 /* Map text+data read/write/execute */ 421 422 /* a_entry is the load address and is page aligned */ 423 vmaddr = trunc_page(a_out->a_entry); 424 425 /* get anon user mapping, read+write+execute */ 426 error = vm_map_find(&td->td_proc->p_vmspace->vm_map, NULL, 0, 427 &vmaddr, a_out->a_text + a_out->a_data, FALSE, VM_PROT_ALL, 428 VM_PROT_ALL, 0); 429 if (error) 430 goto cleanup; 431 432 /* map file into kernel_map */ 433 error = vm_mmap(kernel_map, &buffer, 434 round_page(a_out->a_text + a_out->a_data + file_offset), 435 VM_PROT_READ, VM_PROT_READ, 0, (caddr_t)vp, 436 trunc_page(file_offset)); 437 if (error) 438 goto cleanup; 439 440 /* copy from kernel VM space to user space */ 441 error = copyout(PTRIN(buffer + file_offset), 442 (void *)vmaddr, a_out->a_text + a_out->a_data); 443 444 /* release temporary kernel space */ 445 vm_map_remove(kernel_map, buffer, buffer + 446 round_page(a_out->a_text + a_out->a_data + file_offset)); 447 448 if (error) 449 goto cleanup; 450 } else { 451 #ifdef DEBUG 452 printf("uselib: Page aligned binary %lu\n", file_offset); 453 #endif 454 /* 455 * for QMAGIC, a_entry is 20 bytes beyond the load address 456 * to skip the executable header 457 */ 458 vmaddr = trunc_page(a_out->a_entry); 459 460 /* 461 * Map it all into the process's space as a single 462 * copy-on-write "data" segment. 463 */ 464 error = vm_mmap(&td->td_proc->p_vmspace->vm_map, &vmaddr, 465 a_out->a_text + a_out->a_data, VM_PROT_ALL, VM_PROT_ALL, 466 MAP_PRIVATE | MAP_FIXED, (caddr_t)vp, file_offset); 467 if (error) 468 goto cleanup; 469 } 470 #ifdef DEBUG 471 printf("mem=%08lx = %08lx %08lx\n", (long)vmaddr, ((long*)vmaddr)[0], 472 ((long*)vmaddr)[1]); 473 #endif 474 if (bss_size != 0) { 475 /* Calculate BSS start address */ 476 vmaddr = trunc_page(a_out->a_entry) + a_out->a_text + 477 a_out->a_data; 478 479 /* allocate some 'anon' space */ 480 error = vm_map_find(&td->td_proc->p_vmspace->vm_map, NULL, 0, 481 &vmaddr, bss_size, FALSE, VM_PROT_ALL, VM_PROT_ALL, 0); 482 if (error) 483 goto cleanup; 484 } 485 486 cleanup: 487 /* Unlock vnode if needed */ 488 if (locked) 489 VOP_UNLOCK(vp, 0, td); 490 491 /* Release the kernel mapping. */ 492 if (a_out) 493 vm_map_remove(kernel_map, (vm_offset_t)a_out, 494 (vm_offset_t)a_out + PAGE_SIZE); 495 496 return error; 497 } 498 499 #endif /* __i386__ || __alpha__ */ 500 501 int 502 linux_select(struct thread *td, struct linux_select_args *args) 503 { 504 l_timeval ltv; 505 struct timeval tv0, tv1, utv, *tvp; 506 int error; 507 508 #ifdef DEBUG 509 if (ldebug(select)) 510 printf(ARGS(select, "%d, %p, %p, %p, %p"), args->nfds, 511 (void *)args->readfds, (void *)args->writefds, 512 (void *)args->exceptfds, (void *)args->timeout); 513 #endif 514 515 /* 516 * Store current time for computation of the amount of 517 * time left. 518 */ 519 if (args->timeout) { 520 if ((error = copyin(args->timeout, <v, sizeof(ltv)))) 521 goto select_out; 522 utv.tv_sec = ltv.tv_sec; 523 utv.tv_usec = ltv.tv_usec; 524 #ifdef DEBUG 525 if (ldebug(select)) 526 printf(LMSG("incoming timeout (%ld/%ld)"), 527 utv.tv_sec, utv.tv_usec); 528 #endif 529 530 if (itimerfix(&utv)) { 531 /* 532 * The timeval was invalid. Convert it to something 533 * valid that will act as it does under Linux. 534 */ 535 utv.tv_sec += utv.tv_usec / 1000000; 536 utv.tv_usec %= 1000000; 537 if (utv.tv_usec < 0) { 538 utv.tv_sec -= 1; 539 utv.tv_usec += 1000000; 540 } 541 if (utv.tv_sec < 0) 542 timevalclear(&utv); 543 } 544 microtime(&tv0); 545 tvp = &utv; 546 } else 547 tvp = NULL; 548 549 error = kern_select(td, args->nfds, args->readfds, args->writefds, 550 args->exceptfds, tvp); 551 552 #ifdef DEBUG 553 if (ldebug(select)) 554 printf(LMSG("real select returns %d"), error); 555 #endif 556 if (error) { 557 /* 558 * See fs/select.c in the Linux kernel. Without this, 559 * Maelstrom doesn't work. 560 */ 561 if (error == ERESTART) 562 error = EINTR; 563 goto select_out; 564 } 565 566 if (args->timeout) { 567 if (td->td_retval[0]) { 568 /* 569 * Compute how much time was left of the timeout, 570 * by subtracting the current time and the time 571 * before we started the call, and subtracting 572 * that result from the user-supplied value. 573 */ 574 microtime(&tv1); 575 timevalsub(&tv1, &tv0); 576 timevalsub(&utv, &tv1); 577 if (utv.tv_sec < 0) 578 timevalclear(&utv); 579 } else 580 timevalclear(&utv); 581 #ifdef DEBUG 582 if (ldebug(select)) 583 printf(LMSG("outgoing timeout (%ld/%ld)"), 584 utv.tv_sec, utv.tv_usec); 585 #endif 586 ltv.tv_sec = utv.tv_sec; 587 ltv.tv_usec = utv.tv_usec; 588 if ((error = copyout(<v, args->timeout, sizeof(ltv)))) 589 goto select_out; 590 } 591 592 select_out: 593 #ifdef DEBUG 594 if (ldebug(select)) 595 printf(LMSG("select_out -> %d"), error); 596 #endif 597 return error; 598 } 599 600 int 601 linux_mremap(struct thread *td, struct linux_mremap_args *args) 602 { 603 struct munmap_args /* { 604 void *addr; 605 size_t len; 606 } */ bsd_args; 607 int error = 0; 608 609 #ifdef DEBUG 610 if (ldebug(mremap)) 611 printf(ARGS(mremap, "%p, %08lx, %08lx, %08lx"), 612 (void *)(uintptr_t)args->addr, 613 (unsigned long)args->old_len, 614 (unsigned long)args->new_len, 615 (unsigned long)args->flags); 616 #endif 617 args->new_len = round_page(args->new_len); 618 args->old_len = round_page(args->old_len); 619 620 if (args->new_len > args->old_len) { 621 td->td_retval[0] = 0; 622 return ENOMEM; 623 } 624 625 if (args->new_len < args->old_len) { 626 bsd_args.addr = 627 (caddr_t)((uintptr_t)args->addr + args->new_len); 628 bsd_args.len = args->old_len - args->new_len; 629 error = munmap(td, &bsd_args); 630 } 631 632 td->td_retval[0] = error ? 0 : (uintptr_t)args->addr; 633 return error; 634 } 635 636 #define LINUX_MS_ASYNC 0x0001 637 #define LINUX_MS_INVALIDATE 0x0002 638 #define LINUX_MS_SYNC 0x0004 639 640 int 641 linux_msync(struct thread *td, struct linux_msync_args *args) 642 { 643 struct msync_args bsd_args; 644 645 bsd_args.addr = (caddr_t)(uintptr_t)args->addr; 646 bsd_args.len = (uintptr_t)args->len; 647 bsd_args.flags = args->fl & ~LINUX_MS_SYNC; 648 649 return msync(td, &bsd_args); 650 } 651 652 #ifndef __alpha__ 653 int 654 linux_time(struct thread *td, struct linux_time_args *args) 655 { 656 struct timeval tv; 657 l_time_t tm; 658 int error; 659 660 #ifdef DEBUG 661 if (ldebug(time)) 662 printf(ARGS(time, "*")); 663 #endif 664 665 microtime(&tv); 666 tm = tv.tv_sec; 667 if (args->tm && (error = copyout(&tm, args->tm, sizeof(tm)))) 668 return error; 669 td->td_retval[0] = tm; 670 return 0; 671 } 672 #endif /*!__alpha__*/ 673 674 struct l_times_argv { 675 l_long tms_utime; 676 l_long tms_stime; 677 l_long tms_cutime; 678 l_long tms_cstime; 679 }; 680 681 #ifdef __alpha__ 682 #define CLK_TCK 1024 /* Linux uses 1024 on alpha */ 683 #else 684 #define CLK_TCK 100 /* Linux uses 100 */ 685 #endif 686 687 #define CONVTCK(r) (r.tv_sec * CLK_TCK + r.tv_usec / (1000000 / CLK_TCK)) 688 689 int 690 linux_times(struct thread *td, struct linux_times_args *args) 691 { 692 struct timeval tv; 693 struct l_times_argv tms; 694 struct rusage ru; 695 int error; 696 697 #ifdef DEBUG 698 if (ldebug(times)) 699 printf(ARGS(times, "*")); 700 #endif 701 702 mtx_lock_spin(&sched_lock); 703 calcru(td->td_proc, &ru.ru_utime, &ru.ru_stime, NULL); 704 mtx_unlock_spin(&sched_lock); 705 706 tms.tms_utime = CONVTCK(ru.ru_utime); 707 tms.tms_stime = CONVTCK(ru.ru_stime); 708 709 tms.tms_cutime = CONVTCK(td->td_proc->p_stats->p_cru.ru_utime); 710 tms.tms_cstime = CONVTCK(td->td_proc->p_stats->p_cru.ru_stime); 711 712 if ((error = copyout(&tms, args->buf, sizeof(tms)))) 713 return error; 714 715 microuptime(&tv); 716 td->td_retval[0] = (int)CONVTCK(tv); 717 return 0; 718 } 719 720 int 721 linux_newuname(struct thread *td, struct linux_newuname_args *args) 722 { 723 struct l_new_utsname utsname; 724 char osname[LINUX_MAX_UTSNAME]; 725 char osrelease[LINUX_MAX_UTSNAME]; 726 char *p; 727 728 #ifdef DEBUG 729 if (ldebug(newuname)) 730 printf(ARGS(newuname, "*")); 731 #endif 732 733 linux_get_osname(td, osname); 734 linux_get_osrelease(td, osrelease); 735 736 bzero(&utsname, sizeof(utsname)); 737 strlcpy(utsname.sysname, osname, LINUX_MAX_UTSNAME); 738 getcredhostname(td->td_ucred, utsname.nodename, LINUX_MAX_UTSNAME); 739 strlcpy(utsname.release, osrelease, LINUX_MAX_UTSNAME); 740 strlcpy(utsname.version, version, LINUX_MAX_UTSNAME); 741 for (p = utsname.version; *p != '\0'; ++p) 742 if (*p == '\n') { 743 *p = '\0'; 744 break; 745 } 746 #ifdef __i386__ 747 { 748 const char *class; 749 switch (cpu_class) { 750 case CPUCLASS_686: 751 class = "i686"; 752 break; 753 case CPUCLASS_586: 754 class = "i586"; 755 break; 756 case CPUCLASS_486: 757 class = "i486"; 758 break; 759 default: 760 class = "i386"; 761 } 762 strlcpy(utsname.machine, class, LINUX_MAX_UTSNAME); 763 } 764 #else 765 strlcpy(utsname.machine, machine, LINUX_MAX_UTSNAME); 766 #endif 767 strlcpy(utsname.domainname, domainname, LINUX_MAX_UTSNAME); 768 769 return (copyout(&utsname, args->buf, sizeof(utsname))); 770 } 771 772 #if defined(__i386__) || (defined(__amd64__) && COMPAT_LINUX32) 773 struct l_utimbuf { 774 l_time_t l_actime; 775 l_time_t l_modtime; 776 }; 777 778 int 779 linux_utime(struct thread *td, struct linux_utime_args *args) 780 { 781 struct timeval tv[2], *tvp; 782 struct l_utimbuf lut; 783 char *fname; 784 int error; 785 786 LCONVPATHEXIST(td, args->fname, &fname); 787 788 #ifdef DEBUG 789 if (ldebug(utime)) 790 printf(ARGS(utime, "%s, *"), fname); 791 #endif 792 793 if (args->times) { 794 if ((error = copyin(args->times, &lut, sizeof lut))) { 795 LFREEPATH(fname); 796 return error; 797 } 798 tv[0].tv_sec = lut.l_actime; 799 tv[0].tv_usec = 0; 800 tv[1].tv_sec = lut.l_modtime; 801 tv[1].tv_usec = 0; 802 tvp = tv; 803 } else 804 tvp = NULL; 805 806 error = kern_utimes(td, fname, UIO_SYSSPACE, tvp, UIO_SYSSPACE); 807 LFREEPATH(fname); 808 return (error); 809 } 810 #endif /* __i386__ || (__amd64__ && COMPAT_LINUX32) */ 811 812 #define __WCLONE 0x80000000 813 814 #ifndef __alpha__ 815 int 816 linux_waitpid(struct thread *td, struct linux_waitpid_args *args) 817 { 818 int error, options, tmpstat; 819 820 #ifdef DEBUG 821 if (ldebug(waitpid)) 822 printf(ARGS(waitpid, "%d, %p, %d"), 823 args->pid, (void *)args->status, args->options); 824 #endif 825 826 options = (args->options & (WNOHANG | WUNTRACED)); 827 /* WLINUXCLONE should be equal to __WCLONE, but we make sure */ 828 if (args->options & __WCLONE) 829 options |= WLINUXCLONE; 830 831 error = kern_wait(td, args->pid, &tmpstat, options, NULL); 832 if (error) 833 return error; 834 835 if (args->status) { 836 tmpstat &= 0xffff; 837 if (WIFSIGNALED(tmpstat)) 838 tmpstat = (tmpstat & 0xffffff80) | 839 BSD_TO_LINUX_SIGNAL(WTERMSIG(tmpstat)); 840 else if (WIFSTOPPED(tmpstat)) 841 tmpstat = (tmpstat & 0xffff00ff) | 842 (BSD_TO_LINUX_SIGNAL(WSTOPSIG(tmpstat)) << 8); 843 return copyout(&tmpstat, args->status, sizeof(int)); 844 } 845 846 return 0; 847 } 848 #endif /*!__alpha__*/ 849 850 int 851 linux_wait4(struct thread *td, struct linux_wait4_args *args) 852 { 853 int error, options, tmpstat; 854 struct rusage ru; 855 struct proc *p; 856 857 #ifdef DEBUG 858 if (ldebug(wait4)) 859 printf(ARGS(wait4, "%d, %p, %d, %p"), 860 args->pid, (void *)args->status, args->options, 861 (void *)args->rusage); 862 #endif 863 864 options = (args->options & (WNOHANG | WUNTRACED)); 865 /* WLINUXCLONE should be equal to __WCLONE, but we make sure */ 866 if (args->options & __WCLONE) 867 options |= WLINUXCLONE; 868 869 error = kern_wait(td, args->pid, &tmpstat, options, &ru); 870 if (error) 871 return error; 872 873 p = td->td_proc; 874 PROC_LOCK(p); 875 SIGDELSET(p->p_siglist, SIGCHLD); 876 PROC_UNLOCK(p); 877 878 if (args->status) { 879 tmpstat &= 0xffff; 880 if (WIFSIGNALED(tmpstat)) 881 tmpstat = (tmpstat & 0xffffff80) | 882 BSD_TO_LINUX_SIGNAL(WTERMSIG(tmpstat)); 883 else if (WIFSTOPPED(tmpstat)) 884 tmpstat = (tmpstat & 0xffff00ff) | 885 (BSD_TO_LINUX_SIGNAL(WSTOPSIG(tmpstat)) << 8); 886 error = copyout(&tmpstat, args->status, sizeof(int)); 887 } 888 if (args->rusage != NULL && error == 0) 889 error = copyout(&ru, args->rusage, sizeof(ru)); 890 891 return (error); 892 } 893 894 int 895 linux_mknod(struct thread *td, struct linux_mknod_args *args) 896 { 897 char *path; 898 int error; 899 900 LCONVPATHCREAT(td, args->path, &path); 901 902 #ifdef DEBUG 903 if (ldebug(mknod)) 904 printf(ARGS(mknod, "%s, %d, %d"), path, args->mode, args->dev); 905 #endif 906 907 if (args->mode & S_IFIFO) 908 error = kern_mkfifo(td, path, UIO_SYSSPACE, args->mode); 909 else 910 error = kern_mknod(td, path, UIO_SYSSPACE, args->mode, 911 args->dev); 912 LFREEPATH(path); 913 return (error); 914 } 915 916 /* 917 * UGH! This is just about the dumbest idea I've ever heard!! 918 */ 919 int 920 linux_personality(struct thread *td, struct linux_personality_args *args) 921 { 922 #ifdef DEBUG 923 if (ldebug(personality)) 924 printf(ARGS(personality, "%lu"), (unsigned long)args->per); 925 #endif 926 #ifndef __alpha__ 927 if (args->per != 0) 928 return EINVAL; 929 #endif 930 931 /* Yes Jim, it's still a Linux... */ 932 td->td_retval[0] = 0; 933 return 0; 934 } 935 936 struct l_itimerval { 937 l_timeval it_interval; 938 l_timeval it_value; 939 }; 940 941 int 942 linux_setitimer(struct thread *td, struct linux_setitimer_args *uap) 943 { 944 int error; 945 caddr_t sg; 946 struct l_itimerval *lp, *lop, ls; 947 struct itimerval *p = NULL, *op = NULL, s; 948 949 #ifdef DEBUG 950 if (ldebug(setitimer)) 951 printf(ARGS(setitimer, "%p, %p"), 952 (void *)uap->itv, (void *)uap->oitv); 953 #endif 954 lp = uap->itv; 955 if (lp != NULL) { 956 sg = stackgap_init(); 957 p = stackgap_alloc(&sg, sizeof(struct itimerval)); 958 uap->itv = (struct l_itimerval *)p; 959 error = copyin(lp, &ls, sizeof(ls)); 960 if (error != 0) 961 return (error); 962 s.it_interval.tv_sec = ls.it_interval.tv_sec; 963 s.it_interval.tv_usec = ls.it_interval.tv_usec; 964 s.it_value.tv_sec = ls.it_value.tv_sec; 965 s.it_value.tv_usec = ls.it_value.tv_usec; 966 error = copyout(&s, p, sizeof(s)); 967 if (error != 0) 968 return (error); 969 #ifdef DEBUG 970 if (ldebug(setitimer)) { 971 printf("setitimer: value: sec: %ld, usec: %ld\n", 972 s.it_value.tv_sec, s.it_value.tv_usec); 973 printf("setitimer: interval: sec: %ld, usec: %ld\n", 974 s.it_interval.tv_sec, s.it_interval.tv_usec); 975 } 976 #endif 977 } 978 lop = uap->oitv; 979 if (lop != NULL) { 980 sg = stackgap_init(); 981 op = stackgap_alloc(&sg, sizeof(struct itimerval)); 982 uap->oitv = (struct l_itimerval *)op; 983 } 984 error = setitimer(td, (struct setitimer_args *) uap); 985 if (error != 0) 986 return (error); 987 if (lop != NULL) { 988 error = copyin(op, &s, sizeof(s)); 989 if (error != 0) 990 return (error); 991 ls.it_interval.tv_sec = s.it_interval.tv_sec; 992 ls.it_interval.tv_usec = s.it_interval.tv_usec; 993 ls.it_value.tv_sec = s.it_value.tv_sec; 994 ls.it_value.tv_usec = s.it_value.tv_usec; 995 error = copyout(&ls, lop, sizeof(ls)); 996 } 997 return (error); 998 } 999 1000 int 1001 linux_getitimer(struct thread *td, struct linux_getitimer_args *uap) 1002 { 1003 int error; 1004 caddr_t sg; 1005 struct l_itimerval *lp, ls; 1006 struct itimerval *p = NULL, s; 1007 1008 #ifdef DEBUG 1009 if (ldebug(getitimer)) 1010 printf(ARGS(getitimer, "%p"), (void *)uap->itv); 1011 #endif 1012 lp = uap->itv; 1013 if (lp != NULL) { 1014 sg = stackgap_init(); 1015 p = stackgap_alloc(&sg, sizeof(struct itimerval)); 1016 uap->itv = (struct l_itimerval *)p; 1017 } 1018 error = getitimer(td, (struct getitimer_args *) uap); 1019 if (error != 0) 1020 return (error); 1021 if (lp != NULL) { 1022 error = copyin(p, &s, sizeof(s)); 1023 if (error != 0) 1024 return (error); 1025 ls.it_interval.tv_sec = s.it_interval.tv_sec; 1026 ls.it_interval.tv_usec = s.it_interval.tv_usec; 1027 ls.it_value.tv_sec = s.it_value.tv_sec; 1028 ls.it_value.tv_usec = s.it_value.tv_usec; 1029 error = copyout(&ls, lp, sizeof(ls)); 1030 } 1031 return (error); 1032 } 1033 1034 #ifndef __alpha__ 1035 int 1036 linux_nice(struct thread *td, struct linux_nice_args *args) 1037 { 1038 struct setpriority_args bsd_args; 1039 1040 bsd_args.which = PRIO_PROCESS; 1041 bsd_args.who = 0; /* current process */ 1042 bsd_args.prio = args->inc; 1043 return setpriority(td, &bsd_args); 1044 } 1045 #endif /*!__alpha__*/ 1046 1047 int 1048 linux_setgroups(struct thread *td, struct linux_setgroups_args *args) 1049 { 1050 struct ucred *newcred, *oldcred; 1051 l_gid_t linux_gidset[NGROUPS]; 1052 gid_t *bsd_gidset; 1053 int ngrp, error; 1054 struct proc *p; 1055 1056 ngrp = args->gidsetsize; 1057 if (ngrp < 0 || ngrp >= NGROUPS) 1058 return (EINVAL); 1059 error = copyin(args->grouplist, linux_gidset, ngrp * sizeof(l_gid_t)); 1060 if (error) 1061 return (error); 1062 newcred = crget(); 1063 p = td->td_proc; 1064 PROC_LOCK(p); 1065 oldcred = p->p_ucred; 1066 1067 /* 1068 * cr_groups[0] holds egid. Setting the whole set from 1069 * the supplied set will cause egid to be changed too. 1070 * Keep cr_groups[0] unchanged to prevent that. 1071 */ 1072 1073 if ((error = suser_cred(oldcred, SUSER_ALLOWJAIL)) != 0) { 1074 PROC_UNLOCK(p); 1075 crfree(newcred); 1076 return (error); 1077 } 1078 1079 crcopy(newcred, oldcred); 1080 if (ngrp > 0) { 1081 newcred->cr_ngroups = ngrp + 1; 1082 1083 bsd_gidset = newcred->cr_groups; 1084 ngrp--; 1085 while (ngrp >= 0) { 1086 bsd_gidset[ngrp + 1] = linux_gidset[ngrp]; 1087 ngrp--; 1088 } 1089 } 1090 else 1091 newcred->cr_ngroups = 1; 1092 1093 setsugid(p); 1094 p->p_ucred = newcred; 1095 PROC_UNLOCK(p); 1096 crfree(oldcred); 1097 return (0); 1098 } 1099 1100 int 1101 linux_getgroups(struct thread *td, struct linux_getgroups_args *args) 1102 { 1103 struct ucred *cred; 1104 l_gid_t linux_gidset[NGROUPS]; 1105 gid_t *bsd_gidset; 1106 int bsd_gidsetsz, ngrp, error; 1107 1108 cred = td->td_ucred; 1109 bsd_gidset = cred->cr_groups; 1110 bsd_gidsetsz = cred->cr_ngroups - 1; 1111 1112 /* 1113 * cr_groups[0] holds egid. Returning the whole set 1114 * here will cause a duplicate. Exclude cr_groups[0] 1115 * to prevent that. 1116 */ 1117 1118 if ((ngrp = args->gidsetsize) == 0) { 1119 td->td_retval[0] = bsd_gidsetsz; 1120 return (0); 1121 } 1122 1123 if (ngrp < bsd_gidsetsz) 1124 return (EINVAL); 1125 1126 ngrp = 0; 1127 while (ngrp < bsd_gidsetsz) { 1128 linux_gidset[ngrp] = bsd_gidset[ngrp + 1]; 1129 ngrp++; 1130 } 1131 1132 if ((error = copyout(linux_gidset, args->grouplist, 1133 ngrp * sizeof(l_gid_t)))) 1134 return (error); 1135 1136 td->td_retval[0] = ngrp; 1137 return (0); 1138 } 1139 1140 #ifndef __alpha__ 1141 int 1142 linux_setrlimit(struct thread *td, struct linux_setrlimit_args *args) 1143 { 1144 struct rlimit bsd_rlim; 1145 struct l_rlimit rlim; 1146 u_int which; 1147 int error; 1148 1149 #ifdef DEBUG 1150 if (ldebug(setrlimit)) 1151 printf(ARGS(setrlimit, "%d, %p"), 1152 args->resource, (void *)args->rlim); 1153 #endif 1154 1155 if (args->resource >= LINUX_RLIM_NLIMITS) 1156 return (EINVAL); 1157 1158 which = linux_to_bsd_resource[args->resource]; 1159 if (which == -1) 1160 return (EINVAL); 1161 1162 error = copyin(args->rlim, &rlim, sizeof(rlim)); 1163 if (error) 1164 return (error); 1165 1166 bsd_rlim.rlim_cur = (rlim_t)rlim.rlim_cur; 1167 bsd_rlim.rlim_max = (rlim_t)rlim.rlim_max; 1168 return (kern_setrlimit(td, which, &bsd_rlim)); 1169 } 1170 1171 int 1172 linux_old_getrlimit(struct thread *td, struct linux_old_getrlimit_args *args) 1173 { 1174 struct l_rlimit rlim; 1175 struct proc *p = td->td_proc; 1176 struct rlimit bsd_rlim; 1177 u_int which; 1178 1179 #ifdef DEBUG 1180 if (ldebug(old_getrlimit)) 1181 printf(ARGS(old_getrlimit, "%d, %p"), 1182 args->resource, (void *)args->rlim); 1183 #endif 1184 1185 if (args->resource >= LINUX_RLIM_NLIMITS) 1186 return (EINVAL); 1187 1188 which = linux_to_bsd_resource[args->resource]; 1189 if (which == -1) 1190 return (EINVAL); 1191 1192 PROC_LOCK(p); 1193 lim_rlimit(p, which, &bsd_rlim); 1194 PROC_UNLOCK(p); 1195 1196 #if !COMPAT_LINUX32 1197 rlim.rlim_cur = (unsigned long)bsd_rlim.rlim_cur; 1198 if (rlim.rlim_cur == ULONG_MAX) 1199 rlim.rlim_cur = LONG_MAX; 1200 rlim.rlim_max = (unsigned long)bsd_rlim.rlim_max; 1201 if (rlim.rlim_max == ULONG_MAX) 1202 rlim.rlim_max = LONG_MAX; 1203 #else 1204 rlim.rlim_cur = (unsigned int)bsd_rlim.rlim_cur; 1205 if (rlim.rlim_cur == UINT_MAX) 1206 rlim.rlim_cur = INT_MAX; 1207 rlim.rlim_max = (unsigned int)bsd_rlim.rlim_max; 1208 if (rlim.rlim_max == UINT_MAX) 1209 rlim.rlim_max = INT_MAX; 1210 #endif 1211 return (copyout(&rlim, args->rlim, sizeof(rlim))); 1212 } 1213 1214 int 1215 linux_getrlimit(struct thread *td, struct linux_getrlimit_args *args) 1216 { 1217 struct l_rlimit rlim; 1218 struct proc *p = td->td_proc; 1219 struct rlimit bsd_rlim; 1220 u_int which; 1221 1222 #ifdef DEBUG 1223 if (ldebug(getrlimit)) 1224 printf(ARGS(getrlimit, "%d, %p"), 1225 args->resource, (void *)args->rlim); 1226 #endif 1227 1228 if (args->resource >= LINUX_RLIM_NLIMITS) 1229 return (EINVAL); 1230 1231 which = linux_to_bsd_resource[args->resource]; 1232 if (which == -1) 1233 return (EINVAL); 1234 1235 PROC_LOCK(p); 1236 lim_rlimit(p, which, &bsd_rlim); 1237 PROC_UNLOCK(p); 1238 1239 rlim.rlim_cur = (l_ulong)bsd_rlim.rlim_cur; 1240 rlim.rlim_max = (l_ulong)bsd_rlim.rlim_max; 1241 return (copyout(&rlim, args->rlim, sizeof(rlim))); 1242 } 1243 #endif /*!__alpha__*/ 1244 1245 int 1246 linux_sched_setscheduler(struct thread *td, 1247 struct linux_sched_setscheduler_args *args) 1248 { 1249 struct sched_setscheduler_args bsd; 1250 1251 #ifdef DEBUG 1252 if (ldebug(sched_setscheduler)) 1253 printf(ARGS(sched_setscheduler, "%d, %d, %p"), 1254 args->pid, args->policy, (const void *)args->param); 1255 #endif 1256 1257 switch (args->policy) { 1258 case LINUX_SCHED_OTHER: 1259 bsd.policy = SCHED_OTHER; 1260 break; 1261 case LINUX_SCHED_FIFO: 1262 bsd.policy = SCHED_FIFO; 1263 break; 1264 case LINUX_SCHED_RR: 1265 bsd.policy = SCHED_RR; 1266 break; 1267 default: 1268 return EINVAL; 1269 } 1270 1271 bsd.pid = args->pid; 1272 bsd.param = (struct sched_param *)args->param; 1273 return sched_setscheduler(td, &bsd); 1274 } 1275 1276 int 1277 linux_sched_getscheduler(struct thread *td, 1278 struct linux_sched_getscheduler_args *args) 1279 { 1280 struct sched_getscheduler_args bsd; 1281 int error; 1282 1283 #ifdef DEBUG 1284 if (ldebug(sched_getscheduler)) 1285 printf(ARGS(sched_getscheduler, "%d"), args->pid); 1286 #endif 1287 1288 bsd.pid = args->pid; 1289 error = sched_getscheduler(td, &bsd); 1290 1291 switch (td->td_retval[0]) { 1292 case SCHED_OTHER: 1293 td->td_retval[0] = LINUX_SCHED_OTHER; 1294 break; 1295 case SCHED_FIFO: 1296 td->td_retval[0] = LINUX_SCHED_FIFO; 1297 break; 1298 case SCHED_RR: 1299 td->td_retval[0] = LINUX_SCHED_RR; 1300 break; 1301 } 1302 1303 return error; 1304 } 1305 1306 int 1307 linux_sched_get_priority_max(struct thread *td, 1308 struct linux_sched_get_priority_max_args *args) 1309 { 1310 struct sched_get_priority_max_args bsd; 1311 1312 #ifdef DEBUG 1313 if (ldebug(sched_get_priority_max)) 1314 printf(ARGS(sched_get_priority_max, "%d"), args->policy); 1315 #endif 1316 1317 switch (args->policy) { 1318 case LINUX_SCHED_OTHER: 1319 bsd.policy = SCHED_OTHER; 1320 break; 1321 case LINUX_SCHED_FIFO: 1322 bsd.policy = SCHED_FIFO; 1323 break; 1324 case LINUX_SCHED_RR: 1325 bsd.policy = SCHED_RR; 1326 break; 1327 default: 1328 return EINVAL; 1329 } 1330 return sched_get_priority_max(td, &bsd); 1331 } 1332 1333 int 1334 linux_sched_get_priority_min(struct thread *td, 1335 struct linux_sched_get_priority_min_args *args) 1336 { 1337 struct sched_get_priority_min_args bsd; 1338 1339 #ifdef DEBUG 1340 if (ldebug(sched_get_priority_min)) 1341 printf(ARGS(sched_get_priority_min, "%d"), args->policy); 1342 #endif 1343 1344 switch (args->policy) { 1345 case LINUX_SCHED_OTHER: 1346 bsd.policy = SCHED_OTHER; 1347 break; 1348 case LINUX_SCHED_FIFO: 1349 bsd.policy = SCHED_FIFO; 1350 break; 1351 case LINUX_SCHED_RR: 1352 bsd.policy = SCHED_RR; 1353 break; 1354 default: 1355 return EINVAL; 1356 } 1357 return sched_get_priority_min(td, &bsd); 1358 } 1359 1360 #define REBOOT_CAD_ON 0x89abcdef 1361 #define REBOOT_CAD_OFF 0 1362 #define REBOOT_HALT 0xcdef0123 1363 1364 int 1365 linux_reboot(struct thread *td, struct linux_reboot_args *args) 1366 { 1367 struct reboot_args bsd_args; 1368 1369 #ifdef DEBUG 1370 if (ldebug(reboot)) 1371 printf(ARGS(reboot, "0x%x"), args->cmd); 1372 #endif 1373 if (args->cmd == REBOOT_CAD_ON || args->cmd == REBOOT_CAD_OFF) 1374 return (0); 1375 bsd_args.opt = (args->cmd == REBOOT_HALT) ? RB_HALT : 0; 1376 return (reboot(td, &bsd_args)); 1377 } 1378 1379 #ifndef __alpha__ 1380 1381 /* 1382 * The FreeBSD native getpid(2), getgid(2) and getuid(2) also modify 1383 * td->td_retval[1] when COMPAT_43 is defined. This 1384 * globbers registers that are assumed to be preserved. The following 1385 * lightweight syscalls fixes this. See also linux_getgid16() and 1386 * linux_getuid16() in linux_uid16.c. 1387 * 1388 * linux_getpid() - MP SAFE 1389 * linux_getgid() - MP SAFE 1390 * linux_getuid() - MP SAFE 1391 */ 1392 1393 int 1394 linux_getpid(struct thread *td, struct linux_getpid_args *args) 1395 { 1396 1397 td->td_retval[0] = td->td_proc->p_pid; 1398 return (0); 1399 } 1400 1401 int 1402 linux_getgid(struct thread *td, struct linux_getgid_args *args) 1403 { 1404 1405 td->td_retval[0] = td->td_ucred->cr_rgid; 1406 return (0); 1407 } 1408 1409 int 1410 linux_getuid(struct thread *td, struct linux_getuid_args *args) 1411 { 1412 1413 td->td_retval[0] = td->td_ucred->cr_ruid; 1414 return (0); 1415 } 1416 1417 #endif /*!__alpha__*/ 1418 1419 int 1420 linux_getsid(struct thread *td, struct linux_getsid_args *args) 1421 { 1422 struct getsid_args bsd; 1423 bsd.pid = args->pid; 1424 return getsid(td, &bsd); 1425 }
Cache object: 28ac88e45d1962cd72df81dba8e139ad
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]