1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1982, 1986, 1989, 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)kern_descrip.c 8.6 (Berkeley) 4/19/94 37 */ 38 39 #include <sys/cdefs.h> 40 __FBSDID("$FreeBSD$"); 41 42 #include "opt_capsicum.h" 43 #include "opt_ddb.h" 44 #include "opt_ktrace.h" 45 46 #include <sys/param.h> 47 #include <sys/systm.h> 48 49 #include <sys/capsicum.h> 50 #include <sys/conf.h> 51 #include <sys/fcntl.h> 52 #include <sys/file.h> 53 #include <sys/filedesc.h> 54 #include <sys/filio.h> 55 #include <sys/jail.h> 56 #include <sys/kernel.h> 57 #include <sys/limits.h> 58 #include <sys/lock.h> 59 #include <sys/malloc.h> 60 #include <sys/mount.h> 61 #include <sys/mutex.h> 62 #include <sys/namei.h> 63 #include <sys/selinfo.h> 64 #include <sys/priv.h> 65 #include <sys/proc.h> 66 #include <sys/protosw.h> 67 #include <sys/racct.h> 68 #include <sys/resourcevar.h> 69 #include <sys/sbuf.h> 70 #include <sys/signalvar.h> 71 #include <sys/kdb.h> 72 #include <sys/stat.h> 73 #include <sys/sx.h> 74 #include <sys/syscallsubr.h> 75 #include <sys/sysctl.h> 76 #include <sys/sysproto.h> 77 #include <sys/unistd.h> 78 #include <sys/user.h> 79 #include <sys/vnode.h> 80 #ifdef KTRACE 81 #include <sys/ktrace.h> 82 #endif 83 84 #include <net/vnet.h> 85 86 #include <security/audit/audit.h> 87 88 #include <vm/uma.h> 89 #include <vm/vm.h> 90 91 #include <ddb/ddb.h> 92 93 static MALLOC_DEFINE(M_FILEDESC, "filedesc", "Open file descriptor table"); 94 static MALLOC_DEFINE(M_FILEDESC_TO_LEADER, "filedesc_to_leader", 95 "file desc to leader structures"); 96 static MALLOC_DEFINE(M_SIGIO, "sigio", "sigio structures"); 97 MALLOC_DEFINE(M_FILECAPS, "filecaps", "descriptor capabilities"); 98 99 MALLOC_DECLARE(M_FADVISE); 100 101 static __read_mostly uma_zone_t file_zone; 102 static __read_mostly uma_zone_t filedesc0_zone; 103 104 static int closefp(struct filedesc *fdp, int fd, struct file *fp, 105 struct thread *td, int holdleaders); 106 static int fd_first_free(struct filedesc *fdp, int low, int size); 107 static int fd_last_used(struct filedesc *fdp, int size); 108 static void fdgrowtable(struct filedesc *fdp, int nfd); 109 static void fdgrowtable_exp(struct filedesc *fdp, int nfd); 110 static void fdunused(struct filedesc *fdp, int fd); 111 static void fdused(struct filedesc *fdp, int fd); 112 static int getmaxfd(struct thread *td); 113 static u_long *filecaps_copy_prep(const struct filecaps *src); 114 static void filecaps_copy_finish(const struct filecaps *src, 115 struct filecaps *dst, u_long *ioctls); 116 static u_long *filecaps_free_prep(struct filecaps *fcaps); 117 static void filecaps_free_finish(u_long *ioctls); 118 119 /* 120 * Each process has: 121 * 122 * - An array of open file descriptors (fd_ofiles) 123 * - An array of file flags (fd_ofileflags) 124 * - A bitmap recording which descriptors are in use (fd_map) 125 * 126 * A process starts out with NDFILE descriptors. The value of NDFILE has 127 * been selected based the historical limit of 20 open files, and an 128 * assumption that the majority of processes, especially short-lived 129 * processes like shells, will never need more. 130 * 131 * If this initial allocation is exhausted, a larger descriptor table and 132 * map are allocated dynamically, and the pointers in the process's struct 133 * filedesc are updated to point to those. This is repeated every time 134 * the process runs out of file descriptors (provided it hasn't hit its 135 * resource limit). 136 * 137 * Since threads may hold references to individual descriptor table 138 * entries, the tables are never freed. Instead, they are placed on a 139 * linked list and freed only when the struct filedesc is released. 140 */ 141 #define NDFILE 20 142 #define NDSLOTSIZE sizeof(NDSLOTTYPE) 143 #define NDENTRIES (NDSLOTSIZE * __CHAR_BIT) 144 #define NDSLOT(x) ((x) / NDENTRIES) 145 #define NDBIT(x) ((NDSLOTTYPE)1 << ((x) % NDENTRIES)) 146 #define NDSLOTS(x) (((x) + NDENTRIES - 1) / NDENTRIES) 147 148 /* 149 * SLIST entry used to keep track of ofiles which must be reclaimed when 150 * the process exits. 151 */ 152 struct freetable { 153 struct fdescenttbl *ft_table; 154 SLIST_ENTRY(freetable) ft_next; 155 }; 156 157 /* 158 * Initial allocation: a filedesc structure + the head of SLIST used to 159 * keep track of old ofiles + enough space for NDFILE descriptors. 160 */ 161 162 struct fdescenttbl0 { 163 int fdt_nfiles; 164 struct filedescent fdt_ofiles[NDFILE]; 165 }; 166 167 struct filedesc0 { 168 struct filedesc fd_fd; 169 SLIST_HEAD(, freetable) fd_free; 170 struct fdescenttbl0 fd_dfiles; 171 NDSLOTTYPE fd_dmap[NDSLOTS(NDFILE)]; 172 }; 173 174 /* 175 * Descriptor management. 176 */ 177 static int __exclusive_cache_line openfiles; /* actual number of open files */ 178 struct mtx sigio_lock; /* mtx to protect pointers to sigio */ 179 void __read_mostly (*mq_fdclose)(struct thread *td, int fd, struct file *fp); 180 181 /* 182 * If low >= size, just return low. Otherwise find the first zero bit in the 183 * given bitmap, starting at low and not exceeding size - 1. Return size if 184 * not found. 185 */ 186 static int 187 fd_first_free(struct filedesc *fdp, int low, int size) 188 { 189 NDSLOTTYPE *map = fdp->fd_map; 190 NDSLOTTYPE mask; 191 int off, maxoff; 192 193 if (low >= size) 194 return (low); 195 196 off = NDSLOT(low); 197 if (low % NDENTRIES) { 198 mask = ~(~(NDSLOTTYPE)0 >> (NDENTRIES - (low % NDENTRIES))); 199 if ((mask &= ~map[off]) != 0UL) 200 return (off * NDENTRIES + ffsl(mask) - 1); 201 ++off; 202 } 203 for (maxoff = NDSLOTS(size); off < maxoff; ++off) 204 if (map[off] != ~0UL) 205 return (off * NDENTRIES + ffsl(~map[off]) - 1); 206 return (size); 207 } 208 209 /* 210 * Find the highest non-zero bit in the given bitmap, starting at 0 and 211 * not exceeding size - 1. Return -1 if not found. 212 */ 213 static int 214 fd_last_used(struct filedesc *fdp, int size) 215 { 216 NDSLOTTYPE *map = fdp->fd_map; 217 NDSLOTTYPE mask; 218 int off, minoff; 219 220 off = NDSLOT(size); 221 if (size % NDENTRIES) { 222 mask = ~(~(NDSLOTTYPE)0 << (size % NDENTRIES)); 223 if ((mask &= map[off]) != 0) 224 return (off * NDENTRIES + flsl(mask) - 1); 225 --off; 226 } 227 for (minoff = NDSLOT(0); off >= minoff; --off) 228 if (map[off] != 0) 229 return (off * NDENTRIES + flsl(map[off]) - 1); 230 return (-1); 231 } 232 233 static int 234 fdisused(struct filedesc *fdp, int fd) 235 { 236 237 KASSERT(fd >= 0 && fd < fdp->fd_nfiles, 238 ("file descriptor %d out of range (0, %d)", fd, fdp->fd_nfiles)); 239 240 return ((fdp->fd_map[NDSLOT(fd)] & NDBIT(fd)) != 0); 241 } 242 243 /* 244 * Mark a file descriptor as used. 245 */ 246 static void 247 fdused_init(struct filedesc *fdp, int fd) 248 { 249 250 KASSERT(!fdisused(fdp, fd), ("fd=%d is already used", fd)); 251 252 fdp->fd_map[NDSLOT(fd)] |= NDBIT(fd); 253 } 254 255 static void 256 fdused(struct filedesc *fdp, int fd) 257 { 258 259 FILEDESC_XLOCK_ASSERT(fdp); 260 261 fdused_init(fdp, fd); 262 if (fd > fdp->fd_lastfile) 263 fdp->fd_lastfile = fd; 264 if (fd == fdp->fd_freefile) 265 fdp->fd_freefile++; 266 } 267 268 /* 269 * Mark a file descriptor as unused. 270 */ 271 static void 272 fdunused(struct filedesc *fdp, int fd) 273 { 274 275 FILEDESC_XLOCK_ASSERT(fdp); 276 277 KASSERT(fdisused(fdp, fd), ("fd=%d is already unused", fd)); 278 KASSERT(fdp->fd_ofiles[fd].fde_file == NULL, 279 ("fd=%d is still in use", fd)); 280 281 fdp->fd_map[NDSLOT(fd)] &= ~NDBIT(fd); 282 if (fd < fdp->fd_freefile) 283 fdp->fd_freefile = fd; 284 if (fd == fdp->fd_lastfile) 285 fdp->fd_lastfile = fd_last_used(fdp, fd); 286 } 287 288 /* 289 * Free a file descriptor. 290 * 291 * Avoid some work if fdp is about to be destroyed. 292 */ 293 static inline void 294 fdefree_last(struct filedescent *fde) 295 { 296 297 filecaps_free(&fde->fde_caps); 298 } 299 300 static inline void 301 fdfree(struct filedesc *fdp, int fd) 302 { 303 struct filedescent *fde; 304 305 fde = &fdp->fd_ofiles[fd]; 306 #ifdef CAPABILITIES 307 seqc_write_begin(&fde->fde_seqc); 308 #endif 309 fde->fde_file = NULL; 310 #ifdef CAPABILITIES 311 seqc_write_end(&fde->fde_seqc); 312 #endif 313 fdefree_last(fde); 314 fdunused(fdp, fd); 315 } 316 317 void 318 pwd_ensure_dirs(void) 319 { 320 struct filedesc *fdp; 321 322 fdp = curproc->p_fd; 323 FILEDESC_XLOCK(fdp); 324 if (fdp->fd_cdir == NULL) { 325 fdp->fd_cdir = rootvnode; 326 vrefact(rootvnode); 327 } 328 if (fdp->fd_rdir == NULL) { 329 fdp->fd_rdir = rootvnode; 330 vrefact(rootvnode); 331 } 332 FILEDESC_XUNLOCK(fdp); 333 } 334 335 /* 336 * System calls on descriptors. 337 */ 338 #ifndef _SYS_SYSPROTO_H_ 339 struct getdtablesize_args { 340 int dummy; 341 }; 342 #endif 343 /* ARGSUSED */ 344 int 345 sys_getdtablesize(struct thread *td, struct getdtablesize_args *uap) 346 { 347 #ifdef RACCT 348 uint64_t lim; 349 #endif 350 351 td->td_retval[0] = getmaxfd(td); 352 #ifdef RACCT 353 PROC_LOCK(td->td_proc); 354 lim = racct_get_limit(td->td_proc, RACCT_NOFILE); 355 PROC_UNLOCK(td->td_proc); 356 if (lim < td->td_retval[0]) 357 td->td_retval[0] = lim; 358 #endif 359 return (0); 360 } 361 362 /* 363 * Duplicate a file descriptor to a particular value. 364 * 365 * Note: keep in mind that a potential race condition exists when closing 366 * descriptors from a shared descriptor table (via rfork). 367 */ 368 #ifndef _SYS_SYSPROTO_H_ 369 struct dup2_args { 370 u_int from; 371 u_int to; 372 }; 373 #endif 374 /* ARGSUSED */ 375 int 376 sys_dup2(struct thread *td, struct dup2_args *uap) 377 { 378 379 return (kern_dup(td, FDDUP_FIXED, 0, (int)uap->from, (int)uap->to)); 380 } 381 382 /* 383 * Duplicate a file descriptor. 384 */ 385 #ifndef _SYS_SYSPROTO_H_ 386 struct dup_args { 387 u_int fd; 388 }; 389 #endif 390 /* ARGSUSED */ 391 int 392 sys_dup(struct thread *td, struct dup_args *uap) 393 { 394 395 return (kern_dup(td, FDDUP_NORMAL, 0, (int)uap->fd, 0)); 396 } 397 398 /* 399 * The file control system call. 400 */ 401 #ifndef _SYS_SYSPROTO_H_ 402 struct fcntl_args { 403 int fd; 404 int cmd; 405 long arg; 406 }; 407 #endif 408 /* ARGSUSED */ 409 int 410 sys_fcntl(struct thread *td, struct fcntl_args *uap) 411 { 412 413 return (kern_fcntl_freebsd(td, uap->fd, uap->cmd, uap->arg)); 414 } 415 416 int 417 kern_fcntl_freebsd(struct thread *td, int fd, int cmd, long arg) 418 { 419 struct flock fl; 420 struct __oflock ofl; 421 intptr_t arg1; 422 int error, newcmd; 423 424 error = 0; 425 newcmd = cmd; 426 switch (cmd) { 427 case F_OGETLK: 428 case F_OSETLK: 429 case F_OSETLKW: 430 /* 431 * Convert old flock structure to new. 432 */ 433 error = copyin((void *)(intptr_t)arg, &ofl, sizeof(ofl)); 434 fl.l_start = ofl.l_start; 435 fl.l_len = ofl.l_len; 436 fl.l_pid = ofl.l_pid; 437 fl.l_type = ofl.l_type; 438 fl.l_whence = ofl.l_whence; 439 fl.l_sysid = 0; 440 441 switch (cmd) { 442 case F_OGETLK: 443 newcmd = F_GETLK; 444 break; 445 case F_OSETLK: 446 newcmd = F_SETLK; 447 break; 448 case F_OSETLKW: 449 newcmd = F_SETLKW; 450 break; 451 } 452 arg1 = (intptr_t)&fl; 453 break; 454 case F_GETLK: 455 case F_SETLK: 456 case F_SETLKW: 457 case F_SETLK_REMOTE: 458 error = copyin((void *)(intptr_t)arg, &fl, sizeof(fl)); 459 arg1 = (intptr_t)&fl; 460 break; 461 default: 462 arg1 = arg; 463 break; 464 } 465 if (error) 466 return (error); 467 error = kern_fcntl(td, fd, newcmd, arg1); 468 if (error) 469 return (error); 470 if (cmd == F_OGETLK) { 471 ofl.l_start = fl.l_start; 472 ofl.l_len = fl.l_len; 473 ofl.l_pid = fl.l_pid; 474 ofl.l_type = fl.l_type; 475 ofl.l_whence = fl.l_whence; 476 error = copyout(&ofl, (void *)(intptr_t)arg, sizeof(ofl)); 477 } else if (cmd == F_GETLK) { 478 error = copyout(&fl, (void *)(intptr_t)arg, sizeof(fl)); 479 } 480 return (error); 481 } 482 483 int 484 kern_fcntl(struct thread *td, int fd, int cmd, intptr_t arg) 485 { 486 struct filedesc *fdp; 487 struct flock *flp; 488 struct file *fp, *fp2; 489 struct filedescent *fde; 490 struct proc *p; 491 struct vnode *vp; 492 struct mount *mp; 493 int error, flg, seals, tmp; 494 uint64_t bsize; 495 off_t foffset; 496 497 error = 0; 498 flg = F_POSIX; 499 p = td->td_proc; 500 fdp = p->p_fd; 501 502 AUDIT_ARG_FD(cmd); 503 AUDIT_ARG_CMD(cmd); 504 switch (cmd) { 505 case F_DUPFD: 506 tmp = arg; 507 error = kern_dup(td, FDDUP_FCNTL, 0, fd, tmp); 508 break; 509 510 case F_DUPFD_CLOEXEC: 511 tmp = arg; 512 error = kern_dup(td, FDDUP_FCNTL, FDDUP_FLAG_CLOEXEC, fd, tmp); 513 break; 514 515 case F_DUP2FD: 516 tmp = arg; 517 error = kern_dup(td, FDDUP_FIXED, 0, fd, tmp); 518 break; 519 520 case F_DUP2FD_CLOEXEC: 521 tmp = arg; 522 error = kern_dup(td, FDDUP_FIXED, FDDUP_FLAG_CLOEXEC, fd, tmp); 523 break; 524 525 case F_GETFD: 526 error = EBADF; 527 FILEDESC_SLOCK(fdp); 528 fde = fdeget_locked(fdp, fd); 529 if (fde != NULL) { 530 td->td_retval[0] = 531 (fde->fde_flags & UF_EXCLOSE) ? FD_CLOEXEC : 0; 532 error = 0; 533 } 534 FILEDESC_SUNLOCK(fdp); 535 break; 536 537 case F_SETFD: 538 error = EBADF; 539 FILEDESC_XLOCK(fdp); 540 fde = fdeget_locked(fdp, fd); 541 if (fde != NULL) { 542 fde->fde_flags = (fde->fde_flags & ~UF_EXCLOSE) | 543 (arg & FD_CLOEXEC ? UF_EXCLOSE : 0); 544 error = 0; 545 } 546 FILEDESC_XUNLOCK(fdp); 547 break; 548 549 case F_GETFL: 550 error = fget_fcntl(td, fd, &cap_fcntl_rights, F_GETFL, &fp); 551 if (error != 0) 552 break; 553 td->td_retval[0] = OFLAGS(fp->f_flag); 554 fdrop(fp, td); 555 break; 556 557 case F_SETFL: 558 error = fget_fcntl(td, fd, &cap_fcntl_rights, F_SETFL, &fp); 559 if (error != 0) 560 break; 561 do { 562 tmp = flg = fp->f_flag; 563 tmp &= ~FCNTLFLAGS; 564 tmp |= FFLAGS(arg & ~O_ACCMODE) & FCNTLFLAGS; 565 } while(atomic_cmpset_int(&fp->f_flag, flg, tmp) == 0); 566 tmp = fp->f_flag & FNONBLOCK; 567 error = fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td); 568 if (error != 0) { 569 fdrop(fp, td); 570 break; 571 } 572 tmp = fp->f_flag & FASYNC; 573 error = fo_ioctl(fp, FIOASYNC, &tmp, td->td_ucred, td); 574 if (error == 0) { 575 fdrop(fp, td); 576 break; 577 } 578 atomic_clear_int(&fp->f_flag, FNONBLOCK); 579 tmp = 0; 580 (void)fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td); 581 fdrop(fp, td); 582 break; 583 584 case F_GETOWN: 585 error = fget_fcntl(td, fd, &cap_fcntl_rights, F_GETOWN, &fp); 586 if (error != 0) 587 break; 588 error = fo_ioctl(fp, FIOGETOWN, &tmp, td->td_ucred, td); 589 if (error == 0) 590 td->td_retval[0] = tmp; 591 fdrop(fp, td); 592 break; 593 594 case F_SETOWN: 595 error = fget_fcntl(td, fd, &cap_fcntl_rights, F_SETOWN, &fp); 596 if (error != 0) 597 break; 598 tmp = arg; 599 error = fo_ioctl(fp, FIOSETOWN, &tmp, td->td_ucred, td); 600 fdrop(fp, td); 601 break; 602 603 case F_SETLK_REMOTE: 604 error = priv_check(td, PRIV_NFS_LOCKD); 605 if (error != 0) 606 return (error); 607 flg = F_REMOTE; 608 goto do_setlk; 609 610 case F_SETLKW: 611 flg |= F_WAIT; 612 /* FALLTHROUGH F_SETLK */ 613 614 case F_SETLK: 615 do_setlk: 616 flp = (struct flock *)arg; 617 if ((flg & F_REMOTE) != 0 && flp->l_sysid == 0) { 618 error = EINVAL; 619 break; 620 } 621 622 error = fget_unlocked(fdp, fd, &cap_flock_rights, &fp); 623 if (error != 0) 624 break; 625 if (fp->f_type != DTYPE_VNODE) { 626 error = EBADF; 627 fdrop(fp, td); 628 break; 629 } 630 631 if (flp->l_whence == SEEK_CUR) { 632 foffset = foffset_get(fp); 633 if (foffset < 0 || 634 (flp->l_start > 0 && 635 foffset > OFF_MAX - flp->l_start)) { 636 error = EOVERFLOW; 637 fdrop(fp, td); 638 break; 639 } 640 flp->l_start += foffset; 641 } 642 643 vp = fp->f_vnode; 644 switch (flp->l_type) { 645 case F_RDLCK: 646 if ((fp->f_flag & FREAD) == 0) { 647 error = EBADF; 648 break; 649 } 650 if ((p->p_leader->p_flag & P_ADVLOCK) == 0) { 651 PROC_LOCK(p->p_leader); 652 p->p_leader->p_flag |= P_ADVLOCK; 653 PROC_UNLOCK(p->p_leader); 654 } 655 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK, 656 flp, flg); 657 break; 658 case F_WRLCK: 659 if ((fp->f_flag & FWRITE) == 0) { 660 error = EBADF; 661 break; 662 } 663 if ((p->p_leader->p_flag & P_ADVLOCK) == 0) { 664 PROC_LOCK(p->p_leader); 665 p->p_leader->p_flag |= P_ADVLOCK; 666 PROC_UNLOCK(p->p_leader); 667 } 668 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK, 669 flp, flg); 670 break; 671 case F_UNLCK: 672 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_UNLCK, 673 flp, flg); 674 break; 675 case F_UNLCKSYS: 676 if (flg != F_REMOTE) { 677 error = EINVAL; 678 break; 679 } 680 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, 681 F_UNLCKSYS, flp, flg); 682 break; 683 default: 684 error = EINVAL; 685 break; 686 } 687 if (error != 0 || flp->l_type == F_UNLCK || 688 flp->l_type == F_UNLCKSYS) { 689 fdrop(fp, td); 690 break; 691 } 692 693 /* 694 * Check for a race with close. 695 * 696 * The vnode is now advisory locked (or unlocked, but this case 697 * is not really important) as the caller requested. 698 * We had to drop the filedesc lock, so we need to recheck if 699 * the descriptor is still valid, because if it was closed 700 * in the meantime we need to remove advisory lock from the 701 * vnode - close on any descriptor leading to an advisory 702 * locked vnode, removes that lock. 703 * We will return 0 on purpose in that case, as the result of 704 * successful advisory lock might have been externally visible 705 * already. This is fine - effectively we pretend to the caller 706 * that the closing thread was a bit slower and that the 707 * advisory lock succeeded before the close. 708 */ 709 error = fget_unlocked(fdp, fd, &cap_no_rights, &fp2); 710 if (error != 0) { 711 fdrop(fp, td); 712 break; 713 } 714 if (fp != fp2) { 715 flp->l_whence = SEEK_SET; 716 flp->l_start = 0; 717 flp->l_len = 0; 718 flp->l_type = F_UNLCK; 719 (void) VOP_ADVLOCK(vp, (caddr_t)p->p_leader, 720 F_UNLCK, flp, F_POSIX); 721 } 722 fdrop(fp, td); 723 fdrop(fp2, td); 724 break; 725 726 case F_GETLK: 727 error = fget_unlocked(fdp, fd, &cap_flock_rights, &fp); 728 if (error != 0) 729 break; 730 if (fp->f_type != DTYPE_VNODE) { 731 error = EBADF; 732 fdrop(fp, td); 733 break; 734 } 735 flp = (struct flock *)arg; 736 if (flp->l_type != F_RDLCK && flp->l_type != F_WRLCK && 737 flp->l_type != F_UNLCK) { 738 error = EINVAL; 739 fdrop(fp, td); 740 break; 741 } 742 if (flp->l_whence == SEEK_CUR) { 743 foffset = foffset_get(fp); 744 if ((flp->l_start > 0 && 745 foffset > OFF_MAX - flp->l_start) || 746 (flp->l_start < 0 && 747 foffset < OFF_MIN - flp->l_start)) { 748 error = EOVERFLOW; 749 fdrop(fp, td); 750 break; 751 } 752 flp->l_start += foffset; 753 } 754 vp = fp->f_vnode; 755 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_GETLK, flp, 756 F_POSIX); 757 fdrop(fp, td); 758 break; 759 760 case F_ADD_SEALS: 761 error = fget_unlocked(fdp, fd, &cap_no_rights, &fp); 762 if (error != 0) 763 break; 764 error = fo_add_seals(fp, arg); 765 fdrop(fp, td); 766 break; 767 768 case F_GET_SEALS: 769 error = fget_unlocked(fdp, fd, &cap_no_rights, &fp); 770 if (error != 0) 771 break; 772 if (fo_get_seals(fp, &seals) == 0) 773 td->td_retval[0] = seals; 774 else 775 error = EINVAL; 776 fdrop(fp, td); 777 break; 778 779 case F_RDAHEAD: 780 arg = arg ? 128 * 1024: 0; 781 /* FALLTHROUGH */ 782 case F_READAHEAD: 783 error = fget_unlocked(fdp, fd, &cap_no_rights, &fp); 784 if (error != 0) 785 break; 786 if (fp->f_type != DTYPE_VNODE) { 787 fdrop(fp, td); 788 error = EBADF; 789 break; 790 } 791 vp = fp->f_vnode; 792 if (vp->v_type != VREG) { 793 fdrop(fp, td); 794 error = ENOTTY; 795 break; 796 } 797 798 /* 799 * Exclusive lock synchronizes against f_seqcount reads and 800 * writes in sequential_heuristic(). 801 */ 802 error = vn_lock(vp, LK_EXCLUSIVE); 803 if (error != 0) { 804 fdrop(fp, td); 805 break; 806 } 807 if (arg >= 0) { 808 bsize = fp->f_vnode->v_mount->mnt_stat.f_iosize; 809 arg = MIN(arg, INT_MAX - bsize + 1); 810 fp->f_seqcount = MIN(IO_SEQMAX, 811 (arg + bsize - 1) / bsize); 812 atomic_set_int(&fp->f_flag, FRDAHEAD); 813 } else { 814 atomic_clear_int(&fp->f_flag, FRDAHEAD); 815 } 816 VOP_UNLOCK(vp); 817 fdrop(fp, td); 818 break; 819 820 case F_ISUNIONSTACK: 821 /* 822 * Check if the vnode is part of a union stack (either the 823 * "union" flag from mount(2) or unionfs). 824 * 825 * Prior to introduction of this op libc's readdir would call 826 * fstatfs(2), in effect unnecessarily copying kilobytes of 827 * data just to check fs name and a mount flag. 828 * 829 * Fixing the code to handle everything in the kernel instead 830 * is a non-trivial endeavor and has low priority, thus this 831 * horrible kludge facilitates the current behavior in a much 832 * cheaper manner until someone(tm) sorts this out. 833 */ 834 error = fget_unlocked(fdp, fd, &cap_no_rights, &fp); 835 if (error != 0) 836 break; 837 if (fp->f_type != DTYPE_VNODE) { 838 fdrop(fp, td); 839 error = EBADF; 840 break; 841 } 842 vp = fp->f_vnode; 843 /* 844 * Since we don't prevent dooming the vnode even non-null mp 845 * found can become immediately stale. This is tolerable since 846 * mount points are type-stable (providing safe memory access) 847 * and any vfs op on this vnode going forward will return an 848 * error (meaning return value in this case is meaningless). 849 */ 850 mp = (struct mount *)atomic_load_ptr(&vp->v_mount); 851 if (__predict_false(mp == NULL)) { 852 fdrop(fp, td); 853 error = EBADF; 854 break; 855 } 856 td->td_retval[0] = 0; 857 if (mp->mnt_kern_flag & MNTK_UNIONFS || 858 mp->mnt_flag & MNT_UNION) 859 td->td_retval[0] = 1; 860 fdrop(fp, td); 861 break; 862 863 default: 864 error = EINVAL; 865 break; 866 } 867 return (error); 868 } 869 870 static int 871 getmaxfd(struct thread *td) 872 { 873 874 return (min((int)lim_cur(td, RLIMIT_NOFILE), maxfilesperproc)); 875 } 876 877 /* 878 * Common code for dup, dup2, fcntl(F_DUPFD) and fcntl(F_DUP2FD). 879 */ 880 int 881 kern_dup(struct thread *td, u_int mode, int flags, int old, int new) 882 { 883 struct filedesc *fdp; 884 struct filedescent *oldfde, *newfde; 885 struct proc *p; 886 struct file *delfp; 887 u_long *oioctls, *nioctls; 888 int error, maxfd; 889 890 p = td->td_proc; 891 fdp = p->p_fd; 892 oioctls = NULL; 893 894 MPASS((flags & ~(FDDUP_FLAG_CLOEXEC)) == 0); 895 MPASS(mode < FDDUP_LASTMODE); 896 897 AUDIT_ARG_FD(old); 898 /* XXXRW: if (flags & FDDUP_FIXED) AUDIT_ARG_FD2(new); */ 899 900 /* 901 * Verify we have a valid descriptor to dup from and possibly to 902 * dup to. Unlike dup() and dup2(), fcntl()'s F_DUPFD should 903 * return EINVAL when the new descriptor is out of bounds. 904 */ 905 if (old < 0) 906 return (EBADF); 907 if (new < 0) 908 return (mode == FDDUP_FCNTL ? EINVAL : EBADF); 909 maxfd = getmaxfd(td); 910 if (new >= maxfd) 911 return (mode == FDDUP_FCNTL ? EINVAL : EBADF); 912 913 error = EBADF; 914 FILEDESC_XLOCK(fdp); 915 if (fget_locked(fdp, old) == NULL) 916 goto unlock; 917 if ((mode == FDDUP_FIXED || mode == FDDUP_MUSTREPLACE) && old == new) { 918 td->td_retval[0] = new; 919 if (flags & FDDUP_FLAG_CLOEXEC) 920 fdp->fd_ofiles[new].fde_flags |= UF_EXCLOSE; 921 error = 0; 922 goto unlock; 923 } 924 925 oldfde = &fdp->fd_ofiles[old]; 926 if (!fhold(oldfde->fde_file)) 927 goto unlock; 928 929 /* 930 * If the caller specified a file descriptor, make sure the file 931 * table is large enough to hold it, and grab it. Otherwise, just 932 * allocate a new descriptor the usual way. 933 */ 934 switch (mode) { 935 case FDDUP_NORMAL: 936 case FDDUP_FCNTL: 937 if ((error = fdalloc(td, new, &new)) != 0) { 938 fdrop(oldfde->fde_file, td); 939 goto unlock; 940 } 941 break; 942 case FDDUP_MUSTREPLACE: 943 /* Target file descriptor must exist. */ 944 if (fget_locked(fdp, new) == NULL) { 945 fdrop(oldfde->fde_file, td); 946 goto unlock; 947 } 948 break; 949 case FDDUP_FIXED: 950 if (new >= fdp->fd_nfiles) { 951 /* 952 * The resource limits are here instead of e.g. 953 * fdalloc(), because the file descriptor table may be 954 * shared between processes, so we can't really use 955 * racct_add()/racct_sub(). Instead of counting the 956 * number of actually allocated descriptors, just put 957 * the limit on the size of the file descriptor table. 958 */ 959 #ifdef RACCT 960 if (RACCT_ENABLED()) { 961 error = racct_set_unlocked(p, RACCT_NOFILE, new + 1); 962 if (error != 0) { 963 error = EMFILE; 964 fdrop(oldfde->fde_file, td); 965 goto unlock; 966 } 967 } 968 #endif 969 fdgrowtable_exp(fdp, new + 1); 970 } 971 if (!fdisused(fdp, new)) 972 fdused(fdp, new); 973 break; 974 default: 975 KASSERT(0, ("%s unsupported mode %d", __func__, mode)); 976 } 977 978 KASSERT(old != new, ("new fd is same as old")); 979 980 newfde = &fdp->fd_ofiles[new]; 981 delfp = newfde->fde_file; 982 983 oioctls = filecaps_free_prep(&newfde->fde_caps); 984 nioctls = filecaps_copy_prep(&oldfde->fde_caps); 985 986 /* 987 * Duplicate the source descriptor. 988 */ 989 #ifdef CAPABILITIES 990 seqc_write_begin(&newfde->fde_seqc); 991 #endif 992 memcpy(newfde, oldfde, fde_change_size); 993 filecaps_copy_finish(&oldfde->fde_caps, &newfde->fde_caps, 994 nioctls); 995 if ((flags & FDDUP_FLAG_CLOEXEC) != 0) 996 newfde->fde_flags = oldfde->fde_flags | UF_EXCLOSE; 997 else 998 newfde->fde_flags = oldfde->fde_flags & ~UF_EXCLOSE; 999 #ifdef CAPABILITIES 1000 seqc_write_end(&newfde->fde_seqc); 1001 #endif 1002 td->td_retval[0] = new; 1003 1004 error = 0; 1005 1006 if (delfp != NULL) { 1007 (void) closefp(fdp, new, delfp, td, 1); 1008 FILEDESC_UNLOCK_ASSERT(fdp); 1009 } else { 1010 unlock: 1011 FILEDESC_XUNLOCK(fdp); 1012 } 1013 1014 filecaps_free_finish(oioctls); 1015 return (error); 1016 } 1017 1018 /* 1019 * If sigio is on the list associated with a process or process group, 1020 * disable signalling from the device, remove sigio from the list and 1021 * free sigio. 1022 */ 1023 void 1024 funsetown(struct sigio **sigiop) 1025 { 1026 struct sigio *sigio; 1027 1028 if (*sigiop == NULL) 1029 return; 1030 SIGIO_LOCK(); 1031 sigio = *sigiop; 1032 if (sigio == NULL) { 1033 SIGIO_UNLOCK(); 1034 return; 1035 } 1036 *(sigio->sio_myref) = NULL; 1037 if ((sigio)->sio_pgid < 0) { 1038 struct pgrp *pg = (sigio)->sio_pgrp; 1039 PGRP_LOCK(pg); 1040 SLIST_REMOVE(&sigio->sio_pgrp->pg_sigiolst, sigio, 1041 sigio, sio_pgsigio); 1042 PGRP_UNLOCK(pg); 1043 } else { 1044 struct proc *p = (sigio)->sio_proc; 1045 PROC_LOCK(p); 1046 SLIST_REMOVE(&sigio->sio_proc->p_sigiolst, sigio, 1047 sigio, sio_pgsigio); 1048 PROC_UNLOCK(p); 1049 } 1050 SIGIO_UNLOCK(); 1051 crfree(sigio->sio_ucred); 1052 free(sigio, M_SIGIO); 1053 } 1054 1055 /* 1056 * Free a list of sigio structures. 1057 * We only need to lock the SIGIO_LOCK because we have made ourselves 1058 * inaccessible to callers of fsetown and therefore do not need to lock 1059 * the proc or pgrp struct for the list manipulation. 1060 */ 1061 void 1062 funsetownlst(struct sigiolst *sigiolst) 1063 { 1064 struct proc *p; 1065 struct pgrp *pg; 1066 struct sigio *sigio; 1067 1068 sigio = SLIST_FIRST(sigiolst); 1069 if (sigio == NULL) 1070 return; 1071 p = NULL; 1072 pg = NULL; 1073 1074 /* 1075 * Every entry of the list should belong 1076 * to a single proc or pgrp. 1077 */ 1078 if (sigio->sio_pgid < 0) { 1079 pg = sigio->sio_pgrp; 1080 PGRP_LOCK_ASSERT(pg, MA_NOTOWNED); 1081 } else /* if (sigio->sio_pgid > 0) */ { 1082 p = sigio->sio_proc; 1083 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 1084 } 1085 1086 SIGIO_LOCK(); 1087 while ((sigio = SLIST_FIRST(sigiolst)) != NULL) { 1088 *(sigio->sio_myref) = NULL; 1089 if (pg != NULL) { 1090 KASSERT(sigio->sio_pgid < 0, 1091 ("Proc sigio in pgrp sigio list")); 1092 KASSERT(sigio->sio_pgrp == pg, 1093 ("Bogus pgrp in sigio list")); 1094 PGRP_LOCK(pg); 1095 SLIST_REMOVE(&pg->pg_sigiolst, sigio, sigio, 1096 sio_pgsigio); 1097 PGRP_UNLOCK(pg); 1098 } else /* if (p != NULL) */ { 1099 KASSERT(sigio->sio_pgid > 0, 1100 ("Pgrp sigio in proc sigio list")); 1101 KASSERT(sigio->sio_proc == p, 1102 ("Bogus proc in sigio list")); 1103 PROC_LOCK(p); 1104 SLIST_REMOVE(&p->p_sigiolst, sigio, sigio, 1105 sio_pgsigio); 1106 PROC_UNLOCK(p); 1107 } 1108 SIGIO_UNLOCK(); 1109 crfree(sigio->sio_ucred); 1110 free(sigio, M_SIGIO); 1111 SIGIO_LOCK(); 1112 } 1113 SIGIO_UNLOCK(); 1114 } 1115 1116 /* 1117 * This is common code for FIOSETOWN ioctl called by fcntl(fd, F_SETOWN, arg). 1118 * 1119 * After permission checking, add a sigio structure to the sigio list for 1120 * the process or process group. 1121 */ 1122 int 1123 fsetown(pid_t pgid, struct sigio **sigiop) 1124 { 1125 struct proc *proc; 1126 struct pgrp *pgrp; 1127 struct sigio *sigio; 1128 int ret; 1129 1130 if (pgid == 0) { 1131 funsetown(sigiop); 1132 return (0); 1133 } 1134 1135 ret = 0; 1136 1137 /* Allocate and fill in the new sigio out of locks. */ 1138 sigio = malloc(sizeof(struct sigio), M_SIGIO, M_WAITOK); 1139 sigio->sio_pgid = pgid; 1140 sigio->sio_ucred = crhold(curthread->td_ucred); 1141 sigio->sio_myref = sigiop; 1142 1143 sx_slock(&proctree_lock); 1144 if (pgid > 0) { 1145 proc = pfind(pgid); 1146 if (proc == NULL) { 1147 ret = ESRCH; 1148 goto fail; 1149 } 1150 1151 /* 1152 * Policy - Don't allow a process to FSETOWN a process 1153 * in another session. 1154 * 1155 * Remove this test to allow maximum flexibility or 1156 * restrict FSETOWN to the current process or process 1157 * group for maximum safety. 1158 */ 1159 PROC_UNLOCK(proc); 1160 if (proc->p_session != curthread->td_proc->p_session) { 1161 ret = EPERM; 1162 goto fail; 1163 } 1164 1165 pgrp = NULL; 1166 } else /* if (pgid < 0) */ { 1167 pgrp = pgfind(-pgid); 1168 if (pgrp == NULL) { 1169 ret = ESRCH; 1170 goto fail; 1171 } 1172 PGRP_UNLOCK(pgrp); 1173 1174 /* 1175 * Policy - Don't allow a process to FSETOWN a process 1176 * in another session. 1177 * 1178 * Remove this test to allow maximum flexibility or 1179 * restrict FSETOWN to the current process or process 1180 * group for maximum safety. 1181 */ 1182 if (pgrp->pg_session != curthread->td_proc->p_session) { 1183 ret = EPERM; 1184 goto fail; 1185 } 1186 1187 proc = NULL; 1188 } 1189 funsetown(sigiop); 1190 if (pgid > 0) { 1191 PROC_LOCK(proc); 1192 /* 1193 * Since funsetownlst() is called without the proctree 1194 * locked, we need to check for P_WEXIT. 1195 * XXX: is ESRCH correct? 1196 */ 1197 if ((proc->p_flag & P_WEXIT) != 0) { 1198 PROC_UNLOCK(proc); 1199 ret = ESRCH; 1200 goto fail; 1201 } 1202 SLIST_INSERT_HEAD(&proc->p_sigiolst, sigio, sio_pgsigio); 1203 sigio->sio_proc = proc; 1204 PROC_UNLOCK(proc); 1205 } else { 1206 PGRP_LOCK(pgrp); 1207 SLIST_INSERT_HEAD(&pgrp->pg_sigiolst, sigio, sio_pgsigio); 1208 sigio->sio_pgrp = pgrp; 1209 PGRP_UNLOCK(pgrp); 1210 } 1211 sx_sunlock(&proctree_lock); 1212 SIGIO_LOCK(); 1213 *sigiop = sigio; 1214 SIGIO_UNLOCK(); 1215 return (0); 1216 1217 fail: 1218 sx_sunlock(&proctree_lock); 1219 crfree(sigio->sio_ucred); 1220 free(sigio, M_SIGIO); 1221 return (ret); 1222 } 1223 1224 /* 1225 * This is common code for FIOGETOWN ioctl called by fcntl(fd, F_GETOWN, arg). 1226 */ 1227 pid_t 1228 fgetown(struct sigio **sigiop) 1229 { 1230 pid_t pgid; 1231 1232 SIGIO_LOCK(); 1233 pgid = (*sigiop != NULL) ? (*sigiop)->sio_pgid : 0; 1234 SIGIO_UNLOCK(); 1235 return (pgid); 1236 } 1237 1238 /* 1239 * Function drops the filedesc lock on return. 1240 */ 1241 static int 1242 closefp(struct filedesc *fdp, int fd, struct file *fp, struct thread *td, 1243 int holdleaders) 1244 { 1245 int error; 1246 1247 FILEDESC_XLOCK_ASSERT(fdp); 1248 1249 if (holdleaders) { 1250 if (td->td_proc->p_fdtol != NULL) { 1251 /* 1252 * Ask fdfree() to sleep to ensure that all relevant 1253 * process leaders can be traversed in closef(). 1254 */ 1255 fdp->fd_holdleaderscount++; 1256 } else { 1257 holdleaders = 0; 1258 } 1259 } 1260 1261 /* 1262 * We now hold the fp reference that used to be owned by the 1263 * descriptor array. We have to unlock the FILEDESC *AFTER* 1264 * knote_fdclose to prevent a race of the fd getting opened, a knote 1265 * added, and deleteing a knote for the new fd. 1266 */ 1267 if (__predict_false(!TAILQ_EMPTY(&fdp->fd_kqlist))) 1268 knote_fdclose(td, fd); 1269 1270 /* 1271 * We need to notify mqueue if the object is of type mqueue. 1272 */ 1273 if (__predict_false(fp->f_type == DTYPE_MQUEUE)) 1274 mq_fdclose(td, fd, fp); 1275 FILEDESC_XUNLOCK(fdp); 1276 1277 error = closef(fp, td); 1278 if (holdleaders) { 1279 FILEDESC_XLOCK(fdp); 1280 fdp->fd_holdleaderscount--; 1281 if (fdp->fd_holdleaderscount == 0 && 1282 fdp->fd_holdleaderswakeup != 0) { 1283 fdp->fd_holdleaderswakeup = 0; 1284 wakeup(&fdp->fd_holdleaderscount); 1285 } 1286 FILEDESC_XUNLOCK(fdp); 1287 } 1288 return (error); 1289 } 1290 1291 /* 1292 * Close a file descriptor. 1293 */ 1294 #ifndef _SYS_SYSPROTO_H_ 1295 struct close_args { 1296 int fd; 1297 }; 1298 #endif 1299 /* ARGSUSED */ 1300 int 1301 sys_close(struct thread *td, struct close_args *uap) 1302 { 1303 1304 return (kern_close(td, uap->fd)); 1305 } 1306 1307 int 1308 kern_close(struct thread *td, int fd) 1309 { 1310 struct filedesc *fdp; 1311 struct file *fp; 1312 1313 fdp = td->td_proc->p_fd; 1314 1315 AUDIT_SYSCLOSE(td, fd); 1316 1317 FILEDESC_XLOCK(fdp); 1318 if ((fp = fget_locked(fdp, fd)) == NULL) { 1319 FILEDESC_XUNLOCK(fdp); 1320 return (EBADF); 1321 } 1322 fdfree(fdp, fd); 1323 1324 /* closefp() drops the FILEDESC lock for us. */ 1325 return (closefp(fdp, fd, fp, td, 1)); 1326 } 1327 1328 /* 1329 * Close open file descriptors. 1330 */ 1331 #ifndef _SYS_SYSPROTO_H_ 1332 struct closefrom_args { 1333 int lowfd; 1334 }; 1335 #endif 1336 /* ARGSUSED */ 1337 int 1338 sys_closefrom(struct thread *td, struct closefrom_args *uap) 1339 { 1340 struct filedesc *fdp; 1341 int fd; 1342 1343 fdp = td->td_proc->p_fd; 1344 AUDIT_ARG_FD(uap->lowfd); 1345 1346 /* 1347 * Treat negative starting file descriptor values identical to 1348 * closefrom(0) which closes all files. 1349 */ 1350 if (uap->lowfd < 0) 1351 uap->lowfd = 0; 1352 FILEDESC_SLOCK(fdp); 1353 for (fd = uap->lowfd; fd <= fdp->fd_lastfile; fd++) { 1354 if (fdp->fd_ofiles[fd].fde_file != NULL) { 1355 FILEDESC_SUNLOCK(fdp); 1356 (void)kern_close(td, fd); 1357 FILEDESC_SLOCK(fdp); 1358 } 1359 } 1360 FILEDESC_SUNLOCK(fdp); 1361 return (0); 1362 } 1363 1364 #if defined(COMPAT_43) 1365 /* 1366 * Return status information about a file descriptor. 1367 */ 1368 #ifndef _SYS_SYSPROTO_H_ 1369 struct ofstat_args { 1370 int fd; 1371 struct ostat *sb; 1372 }; 1373 #endif 1374 /* ARGSUSED */ 1375 int 1376 ofstat(struct thread *td, struct ofstat_args *uap) 1377 { 1378 struct ostat oub; 1379 struct stat ub; 1380 int error; 1381 1382 error = kern_fstat(td, uap->fd, &ub); 1383 if (error == 0) { 1384 cvtstat(&ub, &oub); 1385 error = copyout(&oub, uap->sb, sizeof(oub)); 1386 } 1387 return (error); 1388 } 1389 #endif /* COMPAT_43 */ 1390 1391 #if defined(COMPAT_FREEBSD11) 1392 int 1393 freebsd11_fstat(struct thread *td, struct freebsd11_fstat_args *uap) 1394 { 1395 struct stat sb; 1396 struct freebsd11_stat osb; 1397 int error; 1398 1399 error = kern_fstat(td, uap->fd, &sb); 1400 if (error != 0) 1401 return (error); 1402 error = freebsd11_cvtstat(&sb, &osb); 1403 if (error == 0) 1404 error = copyout(&osb, uap->sb, sizeof(osb)); 1405 return (error); 1406 } 1407 #endif /* COMPAT_FREEBSD11 */ 1408 1409 /* 1410 * Return status information about a file descriptor. 1411 */ 1412 #ifndef _SYS_SYSPROTO_H_ 1413 struct fstat_args { 1414 int fd; 1415 struct stat *sb; 1416 }; 1417 #endif 1418 /* ARGSUSED */ 1419 int 1420 sys_fstat(struct thread *td, struct fstat_args *uap) 1421 { 1422 struct stat ub; 1423 int error; 1424 1425 error = kern_fstat(td, uap->fd, &ub); 1426 if (error == 0) 1427 error = copyout(&ub, uap->sb, sizeof(ub)); 1428 return (error); 1429 } 1430 1431 int 1432 kern_fstat(struct thread *td, int fd, struct stat *sbp) 1433 { 1434 struct file *fp; 1435 int error; 1436 1437 AUDIT_ARG_FD(fd); 1438 1439 error = fget(td, fd, &cap_fstat_rights, &fp); 1440 if (__predict_false(error != 0)) 1441 return (error); 1442 1443 AUDIT_ARG_FILE(td->td_proc, fp); 1444 1445 error = fo_stat(fp, sbp, td->td_ucred, td); 1446 fdrop(fp, td); 1447 #ifdef __STAT_TIME_T_EXT 1448 sbp->st_atim_ext = 0; 1449 sbp->st_mtim_ext = 0; 1450 sbp->st_ctim_ext = 0; 1451 sbp->st_btim_ext = 0; 1452 #endif 1453 #ifdef KTRACE 1454 if (KTRPOINT(td, KTR_STRUCT)) 1455 ktrstat_error(sbp, error); 1456 #endif 1457 return (error); 1458 } 1459 1460 #if defined(COMPAT_FREEBSD11) 1461 /* 1462 * Return status information about a file descriptor. 1463 */ 1464 #ifndef _SYS_SYSPROTO_H_ 1465 struct freebsd11_nfstat_args { 1466 int fd; 1467 struct nstat *sb; 1468 }; 1469 #endif 1470 /* ARGSUSED */ 1471 int 1472 freebsd11_nfstat(struct thread *td, struct freebsd11_nfstat_args *uap) 1473 { 1474 struct nstat nub; 1475 struct stat ub; 1476 int error; 1477 1478 error = kern_fstat(td, uap->fd, &ub); 1479 if (error == 0) { 1480 freebsd11_cvtnstat(&ub, &nub); 1481 error = copyout(&nub, uap->sb, sizeof(nub)); 1482 } 1483 return (error); 1484 } 1485 #endif /* COMPAT_FREEBSD11 */ 1486 1487 /* 1488 * Return pathconf information about a file descriptor. 1489 */ 1490 #ifndef _SYS_SYSPROTO_H_ 1491 struct fpathconf_args { 1492 int fd; 1493 int name; 1494 }; 1495 #endif 1496 /* ARGSUSED */ 1497 int 1498 sys_fpathconf(struct thread *td, struct fpathconf_args *uap) 1499 { 1500 long value; 1501 int error; 1502 1503 error = kern_fpathconf(td, uap->fd, uap->name, &value); 1504 if (error == 0) 1505 td->td_retval[0] = value; 1506 return (error); 1507 } 1508 1509 int 1510 kern_fpathconf(struct thread *td, int fd, int name, long *valuep) 1511 { 1512 struct file *fp; 1513 struct vnode *vp; 1514 int error; 1515 1516 error = fget(td, fd, &cap_fpathconf_rights, &fp); 1517 if (error != 0) 1518 return (error); 1519 1520 if (name == _PC_ASYNC_IO) { 1521 *valuep = _POSIX_ASYNCHRONOUS_IO; 1522 goto out; 1523 } 1524 vp = fp->f_vnode; 1525 if (vp != NULL) { 1526 vn_lock(vp, LK_SHARED | LK_RETRY); 1527 error = VOP_PATHCONF(vp, name, valuep); 1528 VOP_UNLOCK(vp); 1529 } else if (fp->f_type == DTYPE_PIPE || fp->f_type == DTYPE_SOCKET) { 1530 if (name != _PC_PIPE_BUF) { 1531 error = EINVAL; 1532 } else { 1533 *valuep = PIPE_BUF; 1534 error = 0; 1535 } 1536 } else { 1537 error = EOPNOTSUPP; 1538 } 1539 out: 1540 fdrop(fp, td); 1541 return (error); 1542 } 1543 1544 /* 1545 * Copy filecaps structure allocating memory for ioctls array if needed. 1546 * 1547 * The last parameter indicates whether the fdtable is locked. If it is not and 1548 * ioctls are encountered, copying fails and the caller must lock the table. 1549 * 1550 * Note that if the table was not locked, the caller has to check the relevant 1551 * sequence counter to determine whether the operation was successful. 1552 */ 1553 bool 1554 filecaps_copy(const struct filecaps *src, struct filecaps *dst, bool locked) 1555 { 1556 size_t size; 1557 1558 if (src->fc_ioctls != NULL && !locked) 1559 return (false); 1560 memcpy(dst, src, sizeof(*src)); 1561 if (src->fc_ioctls == NULL) 1562 return (true); 1563 1564 KASSERT(src->fc_nioctls > 0, 1565 ("fc_ioctls != NULL, but fc_nioctls=%hd", src->fc_nioctls)); 1566 1567 size = sizeof(src->fc_ioctls[0]) * src->fc_nioctls; 1568 dst->fc_ioctls = malloc(size, M_FILECAPS, M_WAITOK); 1569 memcpy(dst->fc_ioctls, src->fc_ioctls, size); 1570 return (true); 1571 } 1572 1573 static u_long * 1574 filecaps_copy_prep(const struct filecaps *src) 1575 { 1576 u_long *ioctls; 1577 size_t size; 1578 1579 if (__predict_true(src->fc_ioctls == NULL)) 1580 return (NULL); 1581 1582 KASSERT(src->fc_nioctls > 0, 1583 ("fc_ioctls != NULL, but fc_nioctls=%hd", src->fc_nioctls)); 1584 1585 size = sizeof(src->fc_ioctls[0]) * src->fc_nioctls; 1586 ioctls = malloc(size, M_FILECAPS, M_WAITOK); 1587 return (ioctls); 1588 } 1589 1590 static void 1591 filecaps_copy_finish(const struct filecaps *src, struct filecaps *dst, 1592 u_long *ioctls) 1593 { 1594 size_t size; 1595 1596 *dst = *src; 1597 if (__predict_true(src->fc_ioctls == NULL)) { 1598 MPASS(ioctls == NULL); 1599 return; 1600 } 1601 1602 size = sizeof(src->fc_ioctls[0]) * src->fc_nioctls; 1603 dst->fc_ioctls = ioctls; 1604 bcopy(src->fc_ioctls, dst->fc_ioctls, size); 1605 } 1606 1607 /* 1608 * Move filecaps structure to the new place and clear the old place. 1609 */ 1610 void 1611 filecaps_move(struct filecaps *src, struct filecaps *dst) 1612 { 1613 1614 *dst = *src; 1615 bzero(src, sizeof(*src)); 1616 } 1617 1618 /* 1619 * Fill the given filecaps structure with full rights. 1620 */ 1621 static void 1622 filecaps_fill(struct filecaps *fcaps) 1623 { 1624 1625 CAP_ALL(&fcaps->fc_rights); 1626 fcaps->fc_ioctls = NULL; 1627 fcaps->fc_nioctls = -1; 1628 fcaps->fc_fcntls = CAP_FCNTL_ALL; 1629 } 1630 1631 /* 1632 * Free memory allocated within filecaps structure. 1633 */ 1634 void 1635 filecaps_free(struct filecaps *fcaps) 1636 { 1637 1638 free(fcaps->fc_ioctls, M_FILECAPS); 1639 bzero(fcaps, sizeof(*fcaps)); 1640 } 1641 1642 static u_long * 1643 filecaps_free_prep(struct filecaps *fcaps) 1644 { 1645 u_long *ioctls; 1646 1647 ioctls = fcaps->fc_ioctls; 1648 bzero(fcaps, sizeof(*fcaps)); 1649 return (ioctls); 1650 } 1651 1652 static void 1653 filecaps_free_finish(u_long *ioctls) 1654 { 1655 1656 free(ioctls, M_FILECAPS); 1657 } 1658 1659 /* 1660 * Validate the given filecaps structure. 1661 */ 1662 static void 1663 filecaps_validate(const struct filecaps *fcaps, const char *func) 1664 { 1665 1666 KASSERT(cap_rights_is_valid(&fcaps->fc_rights), 1667 ("%s: invalid rights", func)); 1668 KASSERT((fcaps->fc_fcntls & ~CAP_FCNTL_ALL) == 0, 1669 ("%s: invalid fcntls", func)); 1670 KASSERT(fcaps->fc_fcntls == 0 || 1671 cap_rights_is_set(&fcaps->fc_rights, CAP_FCNTL), 1672 ("%s: fcntls without CAP_FCNTL", func)); 1673 KASSERT(fcaps->fc_ioctls != NULL ? fcaps->fc_nioctls > 0 : 1674 (fcaps->fc_nioctls == -1 || fcaps->fc_nioctls == 0), 1675 ("%s: invalid ioctls", func)); 1676 KASSERT(fcaps->fc_nioctls == 0 || 1677 cap_rights_is_set(&fcaps->fc_rights, CAP_IOCTL), 1678 ("%s: ioctls without CAP_IOCTL", func)); 1679 } 1680 1681 static void 1682 fdgrowtable_exp(struct filedesc *fdp, int nfd) 1683 { 1684 int nfd1; 1685 1686 FILEDESC_XLOCK_ASSERT(fdp); 1687 1688 nfd1 = fdp->fd_nfiles * 2; 1689 if (nfd1 < nfd) 1690 nfd1 = nfd; 1691 fdgrowtable(fdp, nfd1); 1692 } 1693 1694 /* 1695 * Grow the file table to accommodate (at least) nfd descriptors. 1696 */ 1697 static void 1698 fdgrowtable(struct filedesc *fdp, int nfd) 1699 { 1700 struct filedesc0 *fdp0; 1701 struct freetable *ft; 1702 struct fdescenttbl *ntable; 1703 struct fdescenttbl *otable; 1704 int nnfiles, onfiles; 1705 NDSLOTTYPE *nmap, *omap; 1706 1707 /* 1708 * If lastfile is -1 this struct filedesc was just allocated and we are 1709 * growing it to accommodate for the one we are going to copy from. There 1710 * is no need to have a lock on this one as it's not visible to anyone. 1711 */ 1712 if (fdp->fd_lastfile != -1) 1713 FILEDESC_XLOCK_ASSERT(fdp); 1714 1715 KASSERT(fdp->fd_nfiles > 0, ("zero-length file table")); 1716 1717 /* save old values */ 1718 onfiles = fdp->fd_nfiles; 1719 otable = fdp->fd_files; 1720 omap = fdp->fd_map; 1721 1722 /* compute the size of the new table */ 1723 nnfiles = NDSLOTS(nfd) * NDENTRIES; /* round up */ 1724 if (nnfiles <= onfiles) 1725 /* the table is already large enough */ 1726 return; 1727 1728 /* 1729 * Allocate a new table. We need enough space for the number of 1730 * entries, file entries themselves and the struct freetable we will use 1731 * when we decommission the table and place it on the freelist. 1732 * We place the struct freetable in the middle so we don't have 1733 * to worry about padding. 1734 */ 1735 ntable = malloc(offsetof(struct fdescenttbl, fdt_ofiles) + 1736 nnfiles * sizeof(ntable->fdt_ofiles[0]) + 1737 sizeof(struct freetable), 1738 M_FILEDESC, M_ZERO | M_WAITOK); 1739 /* copy the old data */ 1740 ntable->fdt_nfiles = nnfiles; 1741 memcpy(ntable->fdt_ofiles, otable->fdt_ofiles, 1742 onfiles * sizeof(ntable->fdt_ofiles[0])); 1743 1744 /* 1745 * Allocate a new map only if the old is not large enough. It will 1746 * grow at a slower rate than the table as it can map more 1747 * entries than the table can hold. 1748 */ 1749 if (NDSLOTS(nnfiles) > NDSLOTS(onfiles)) { 1750 nmap = malloc(NDSLOTS(nnfiles) * NDSLOTSIZE, M_FILEDESC, 1751 M_ZERO | M_WAITOK); 1752 /* copy over the old data and update the pointer */ 1753 memcpy(nmap, omap, NDSLOTS(onfiles) * sizeof(*omap)); 1754 fdp->fd_map = nmap; 1755 } 1756 1757 /* 1758 * Make sure that ntable is correctly initialized before we replace 1759 * fd_files poiner. Otherwise fget_unlocked() may see inconsistent 1760 * data. 1761 */ 1762 atomic_store_rel_ptr((volatile void *)&fdp->fd_files, (uintptr_t)ntable); 1763 1764 /* 1765 * Do not free the old file table, as some threads may still 1766 * reference entries within it. Instead, place it on a freelist 1767 * which will be processed when the struct filedesc is released. 1768 * 1769 * Note that if onfiles == NDFILE, we're dealing with the original 1770 * static allocation contained within (struct filedesc0 *)fdp, 1771 * which must not be freed. 1772 */ 1773 if (onfiles > NDFILE) { 1774 ft = (struct freetable *)&otable->fdt_ofiles[onfiles]; 1775 fdp0 = (struct filedesc0 *)fdp; 1776 ft->ft_table = otable; 1777 SLIST_INSERT_HEAD(&fdp0->fd_free, ft, ft_next); 1778 } 1779 /* 1780 * The map does not have the same possibility of threads still 1781 * holding references to it. So always free it as long as it 1782 * does not reference the original static allocation. 1783 */ 1784 if (NDSLOTS(onfiles) > NDSLOTS(NDFILE)) 1785 free(omap, M_FILEDESC); 1786 } 1787 1788 /* 1789 * Allocate a file descriptor for the process. 1790 */ 1791 int 1792 fdalloc(struct thread *td, int minfd, int *result) 1793 { 1794 struct proc *p = td->td_proc; 1795 struct filedesc *fdp = p->p_fd; 1796 int fd, maxfd, allocfd; 1797 #ifdef RACCT 1798 int error; 1799 #endif 1800 1801 FILEDESC_XLOCK_ASSERT(fdp); 1802 1803 if (fdp->fd_freefile > minfd) 1804 minfd = fdp->fd_freefile; 1805 1806 maxfd = getmaxfd(td); 1807 1808 /* 1809 * Search the bitmap for a free descriptor starting at minfd. 1810 * If none is found, grow the file table. 1811 */ 1812 fd = fd_first_free(fdp, minfd, fdp->fd_nfiles); 1813 if (fd >= maxfd) 1814 return (EMFILE); 1815 if (fd >= fdp->fd_nfiles) { 1816 allocfd = min(fd * 2, maxfd); 1817 #ifdef RACCT 1818 if (RACCT_ENABLED()) { 1819 error = racct_set_unlocked(p, RACCT_NOFILE, allocfd); 1820 if (error != 0) 1821 return (EMFILE); 1822 } 1823 #endif 1824 /* 1825 * fd is already equal to first free descriptor >= minfd, so 1826 * we only need to grow the table and we are done. 1827 */ 1828 fdgrowtable_exp(fdp, allocfd); 1829 } 1830 1831 /* 1832 * Perform some sanity checks, then mark the file descriptor as 1833 * used and return it to the caller. 1834 */ 1835 KASSERT(fd >= 0 && fd < min(maxfd, fdp->fd_nfiles), 1836 ("invalid descriptor %d", fd)); 1837 KASSERT(!fdisused(fdp, fd), 1838 ("fd_first_free() returned non-free descriptor")); 1839 KASSERT(fdp->fd_ofiles[fd].fde_file == NULL, 1840 ("file descriptor isn't free")); 1841 fdused(fdp, fd); 1842 *result = fd; 1843 return (0); 1844 } 1845 1846 /* 1847 * Allocate n file descriptors for the process. 1848 */ 1849 int 1850 fdallocn(struct thread *td, int minfd, int *fds, int n) 1851 { 1852 struct proc *p = td->td_proc; 1853 struct filedesc *fdp = p->p_fd; 1854 int i; 1855 1856 FILEDESC_XLOCK_ASSERT(fdp); 1857 1858 for (i = 0; i < n; i++) 1859 if (fdalloc(td, 0, &fds[i]) != 0) 1860 break; 1861 1862 if (i < n) { 1863 for (i--; i >= 0; i--) 1864 fdunused(fdp, fds[i]); 1865 return (EMFILE); 1866 } 1867 1868 return (0); 1869 } 1870 1871 /* 1872 * Create a new open file structure and allocate a file descriptor for the 1873 * process that refers to it. We add one reference to the file for the 1874 * descriptor table and one reference for resultfp. This is to prevent us 1875 * being preempted and the entry in the descriptor table closed after we 1876 * release the FILEDESC lock. 1877 */ 1878 int 1879 falloc_caps(struct thread *td, struct file **resultfp, int *resultfd, int flags, 1880 struct filecaps *fcaps) 1881 { 1882 struct file *fp; 1883 int error, fd; 1884 1885 error = falloc_noinstall(td, &fp); 1886 if (error) 1887 return (error); /* no reference held on error */ 1888 1889 error = finstall(td, fp, &fd, flags, fcaps); 1890 if (error) { 1891 fdrop(fp, td); /* one reference (fp only) */ 1892 return (error); 1893 } 1894 1895 if (resultfp != NULL) 1896 *resultfp = fp; /* copy out result */ 1897 else 1898 fdrop(fp, td); /* release local reference */ 1899 1900 if (resultfd != NULL) 1901 *resultfd = fd; 1902 1903 return (0); 1904 } 1905 1906 /* 1907 * Create a new open file structure without allocating a file descriptor. 1908 */ 1909 int 1910 falloc_noinstall(struct thread *td, struct file **resultfp) 1911 { 1912 struct file *fp; 1913 int maxuserfiles = maxfiles - (maxfiles / 20); 1914 int openfiles_new; 1915 static struct timeval lastfail; 1916 static int curfail; 1917 1918 KASSERT(resultfp != NULL, ("%s: resultfp == NULL", __func__)); 1919 1920 openfiles_new = atomic_fetchadd_int(&openfiles, 1) + 1; 1921 if ((openfiles_new >= maxuserfiles && 1922 priv_check(td, PRIV_MAXFILES) != 0) || 1923 openfiles_new >= maxfiles) { 1924 atomic_subtract_int(&openfiles, 1); 1925 if (ppsratecheck(&lastfail, &curfail, 1)) { 1926 printf("kern.maxfiles limit exceeded by uid %i, (%s) " 1927 "please see tuning(7).\n", td->td_ucred->cr_ruid, td->td_proc->p_comm); 1928 } 1929 return (ENFILE); 1930 } 1931 fp = uma_zalloc(file_zone, M_WAITOK); 1932 bzero(fp, sizeof(*fp)); 1933 refcount_init(&fp->f_count, 1); 1934 fp->f_cred = crhold(td->td_ucred); 1935 fp->f_ops = &badfileops; 1936 *resultfp = fp; 1937 return (0); 1938 } 1939 1940 /* 1941 * Install a file in a file descriptor table. 1942 */ 1943 void 1944 _finstall(struct filedesc *fdp, struct file *fp, int fd, int flags, 1945 struct filecaps *fcaps) 1946 { 1947 struct filedescent *fde; 1948 1949 MPASS(fp != NULL); 1950 if (fcaps != NULL) 1951 filecaps_validate(fcaps, __func__); 1952 FILEDESC_XLOCK_ASSERT(fdp); 1953 1954 fde = &fdp->fd_ofiles[fd]; 1955 #ifdef CAPABILITIES 1956 seqc_write_begin(&fde->fde_seqc); 1957 #endif 1958 fde->fde_file = fp; 1959 fde->fde_flags = (flags & O_CLOEXEC) != 0 ? UF_EXCLOSE : 0; 1960 if (fcaps != NULL) 1961 filecaps_move(fcaps, &fde->fde_caps); 1962 else 1963 filecaps_fill(&fde->fde_caps); 1964 #ifdef CAPABILITIES 1965 seqc_write_end(&fde->fde_seqc); 1966 #endif 1967 } 1968 1969 int 1970 finstall(struct thread *td, struct file *fp, int *fd, int flags, 1971 struct filecaps *fcaps) 1972 { 1973 struct filedesc *fdp = td->td_proc->p_fd; 1974 int error; 1975 1976 MPASS(fd != NULL); 1977 1978 if (!fhold(fp)) 1979 return (EBADF); 1980 FILEDESC_XLOCK(fdp); 1981 error = fdalloc(td, 0, fd); 1982 if (__predict_false(error != 0)) { 1983 FILEDESC_XUNLOCK(fdp); 1984 fdrop(fp, td); 1985 return (error); 1986 } 1987 _finstall(fdp, fp, *fd, flags, fcaps); 1988 FILEDESC_XUNLOCK(fdp); 1989 return (0); 1990 } 1991 1992 /* 1993 * Build a new filedesc structure from another. 1994 * Copy the current, root, and jail root vnode references. 1995 * 1996 * If fdp is not NULL, return with it shared locked. 1997 */ 1998 struct filedesc * 1999 fdinit(struct filedesc *fdp, bool prepfiles) 2000 { 2001 struct filedesc0 *newfdp0; 2002 struct filedesc *newfdp; 2003 2004 newfdp0 = uma_zalloc(filedesc0_zone, M_WAITOK | M_ZERO); 2005 newfdp = &newfdp0->fd_fd; 2006 2007 /* Create the file descriptor table. */ 2008 FILEDESC_LOCK_INIT(newfdp); 2009 refcount_init(&newfdp->fd_refcnt, 1); 2010 refcount_init(&newfdp->fd_holdcnt, 1); 2011 newfdp->fd_cmask = CMASK; 2012 newfdp->fd_map = newfdp0->fd_dmap; 2013 newfdp->fd_lastfile = -1; 2014 newfdp->fd_files = (struct fdescenttbl *)&newfdp0->fd_dfiles; 2015 newfdp->fd_files->fdt_nfiles = NDFILE; 2016 2017 if (fdp == NULL) 2018 return (newfdp); 2019 2020 if (prepfiles && fdp->fd_lastfile >= newfdp->fd_nfiles) 2021 fdgrowtable(newfdp, fdp->fd_lastfile + 1); 2022 2023 FILEDESC_SLOCK(fdp); 2024 newfdp->fd_cdir = fdp->fd_cdir; 2025 if (newfdp->fd_cdir) 2026 vrefact(newfdp->fd_cdir); 2027 newfdp->fd_rdir = fdp->fd_rdir; 2028 if (newfdp->fd_rdir) 2029 vrefact(newfdp->fd_rdir); 2030 newfdp->fd_jdir = fdp->fd_jdir; 2031 if (newfdp->fd_jdir) 2032 vrefact(newfdp->fd_jdir); 2033 2034 if (!prepfiles) { 2035 FILEDESC_SUNLOCK(fdp); 2036 } else { 2037 while (fdp->fd_lastfile >= newfdp->fd_nfiles) { 2038 FILEDESC_SUNLOCK(fdp); 2039 fdgrowtable(newfdp, fdp->fd_lastfile + 1); 2040 FILEDESC_SLOCK(fdp); 2041 } 2042 } 2043 2044 return (newfdp); 2045 } 2046 2047 static struct filedesc * 2048 fdhold(struct proc *p) 2049 { 2050 struct filedesc *fdp; 2051 2052 PROC_LOCK_ASSERT(p, MA_OWNED); 2053 fdp = p->p_fd; 2054 if (fdp != NULL) 2055 refcount_acquire(&fdp->fd_holdcnt); 2056 return (fdp); 2057 } 2058 2059 static void 2060 fddrop(struct filedesc *fdp) 2061 { 2062 2063 if (fdp->fd_holdcnt > 1) { 2064 if (refcount_release(&fdp->fd_holdcnt) == 0) 2065 return; 2066 } 2067 2068 FILEDESC_LOCK_DESTROY(fdp); 2069 uma_zfree(filedesc0_zone, fdp); 2070 } 2071 2072 /* 2073 * Share a filedesc structure. 2074 */ 2075 struct filedesc * 2076 fdshare(struct filedesc *fdp) 2077 { 2078 2079 refcount_acquire(&fdp->fd_refcnt); 2080 return (fdp); 2081 } 2082 2083 /* 2084 * Unshare a filedesc structure, if necessary by making a copy 2085 */ 2086 void 2087 fdunshare(struct thread *td) 2088 { 2089 struct filedesc *tmp; 2090 struct proc *p = td->td_proc; 2091 2092 if (p->p_fd->fd_refcnt == 1) 2093 return; 2094 2095 tmp = fdcopy(p->p_fd); 2096 fdescfree(td); 2097 p->p_fd = tmp; 2098 } 2099 2100 void 2101 fdinstall_remapped(struct thread *td, struct filedesc *fdp) 2102 { 2103 2104 fdescfree(td); 2105 td->td_proc->p_fd = fdp; 2106 } 2107 2108 /* 2109 * Copy a filedesc structure. A NULL pointer in returns a NULL reference, 2110 * this is to ease callers, not catch errors. 2111 */ 2112 struct filedesc * 2113 fdcopy(struct filedesc *fdp) 2114 { 2115 struct filedesc *newfdp; 2116 struct filedescent *nfde, *ofde; 2117 int i; 2118 2119 MPASS(fdp != NULL); 2120 2121 newfdp = fdinit(fdp, true); 2122 /* copy all passable descriptors (i.e. not kqueue) */ 2123 newfdp->fd_freefile = -1; 2124 for (i = 0; i <= fdp->fd_lastfile; ++i) { 2125 ofde = &fdp->fd_ofiles[i]; 2126 if (ofde->fde_file == NULL || 2127 (ofde->fde_file->f_ops->fo_flags & DFLAG_PASSABLE) == 0 || 2128 !fhold(ofde->fde_file)) { 2129 if (newfdp->fd_freefile == -1) 2130 newfdp->fd_freefile = i; 2131 continue; 2132 } 2133 nfde = &newfdp->fd_ofiles[i]; 2134 *nfde = *ofde; 2135 filecaps_copy(&ofde->fde_caps, &nfde->fde_caps, true); 2136 fdused_init(newfdp, i); 2137 newfdp->fd_lastfile = i; 2138 } 2139 if (newfdp->fd_freefile == -1) 2140 newfdp->fd_freefile = i; 2141 newfdp->fd_cmask = fdp->fd_cmask; 2142 FILEDESC_SUNLOCK(fdp); 2143 return (newfdp); 2144 } 2145 2146 /* 2147 * Copies a filedesc structure, while remapping all file descriptors 2148 * stored inside using a translation table. 2149 * 2150 * File descriptors are copied over to the new file descriptor table, 2151 * regardless of whether the close-on-exec flag is set. 2152 */ 2153 int 2154 fdcopy_remapped(struct filedesc *fdp, const int *fds, size_t nfds, 2155 struct filedesc **ret) 2156 { 2157 struct filedesc *newfdp; 2158 struct filedescent *nfde, *ofde; 2159 int error, i; 2160 2161 MPASS(fdp != NULL); 2162 2163 newfdp = fdinit(fdp, true); 2164 if (nfds > fdp->fd_lastfile + 1) { 2165 /* New table cannot be larger than the old one. */ 2166 error = E2BIG; 2167 goto bad; 2168 } 2169 /* Copy all passable descriptors (i.e. not kqueue). */ 2170 newfdp->fd_freefile = nfds; 2171 for (i = 0; i < nfds; ++i) { 2172 if (fds[i] < 0 || fds[i] > fdp->fd_lastfile) { 2173 /* File descriptor out of bounds. */ 2174 error = EBADF; 2175 goto bad; 2176 } 2177 ofde = &fdp->fd_ofiles[fds[i]]; 2178 if (ofde->fde_file == NULL) { 2179 /* Unused file descriptor. */ 2180 error = EBADF; 2181 goto bad; 2182 } 2183 if ((ofde->fde_file->f_ops->fo_flags & DFLAG_PASSABLE) == 0) { 2184 /* File descriptor cannot be passed. */ 2185 error = EINVAL; 2186 goto bad; 2187 } 2188 if (!fhold(nfde->fde_file)) { 2189 error = EBADF; 2190 goto bad; 2191 } 2192 nfde = &newfdp->fd_ofiles[i]; 2193 *nfde = *ofde; 2194 filecaps_copy(&ofde->fde_caps, &nfde->fde_caps, true); 2195 fdused_init(newfdp, i); 2196 newfdp->fd_lastfile = i; 2197 } 2198 newfdp->fd_cmask = fdp->fd_cmask; 2199 FILEDESC_SUNLOCK(fdp); 2200 *ret = newfdp; 2201 return (0); 2202 bad: 2203 FILEDESC_SUNLOCK(fdp); 2204 fdescfree_remapped(newfdp); 2205 return (error); 2206 } 2207 2208 /* 2209 * Clear POSIX style locks. This is only used when fdp looses a reference (i.e. 2210 * one of processes using it exits) and the table used to be shared. 2211 */ 2212 static void 2213 fdclearlocks(struct thread *td) 2214 { 2215 struct filedesc *fdp; 2216 struct filedesc_to_leader *fdtol; 2217 struct flock lf; 2218 struct file *fp; 2219 struct proc *p; 2220 struct vnode *vp; 2221 int i; 2222 2223 p = td->td_proc; 2224 fdp = p->p_fd; 2225 fdtol = p->p_fdtol; 2226 MPASS(fdtol != NULL); 2227 2228 FILEDESC_XLOCK(fdp); 2229 KASSERT(fdtol->fdl_refcount > 0, 2230 ("filedesc_to_refcount botch: fdl_refcount=%d", 2231 fdtol->fdl_refcount)); 2232 if (fdtol->fdl_refcount == 1 && 2233 (p->p_leader->p_flag & P_ADVLOCK) != 0) { 2234 for (i = 0; i <= fdp->fd_lastfile; i++) { 2235 fp = fdp->fd_ofiles[i].fde_file; 2236 if (fp == NULL || fp->f_type != DTYPE_VNODE || 2237 !fhold(fp)) 2238 continue; 2239 FILEDESC_XUNLOCK(fdp); 2240 lf.l_whence = SEEK_SET; 2241 lf.l_start = 0; 2242 lf.l_len = 0; 2243 lf.l_type = F_UNLCK; 2244 vp = fp->f_vnode; 2245 (void) VOP_ADVLOCK(vp, 2246 (caddr_t)p->p_leader, F_UNLCK, 2247 &lf, F_POSIX); 2248 FILEDESC_XLOCK(fdp); 2249 fdrop(fp, td); 2250 } 2251 } 2252 retry: 2253 if (fdtol->fdl_refcount == 1) { 2254 if (fdp->fd_holdleaderscount > 0 && 2255 (p->p_leader->p_flag & P_ADVLOCK) != 0) { 2256 /* 2257 * close() or kern_dup() has cleared a reference 2258 * in a shared file descriptor table. 2259 */ 2260 fdp->fd_holdleaderswakeup = 1; 2261 sx_sleep(&fdp->fd_holdleaderscount, 2262 FILEDESC_LOCK(fdp), PLOCK, "fdlhold", 0); 2263 goto retry; 2264 } 2265 if (fdtol->fdl_holdcount > 0) { 2266 /* 2267 * Ensure that fdtol->fdl_leader remains 2268 * valid in closef(). 2269 */ 2270 fdtol->fdl_wakeup = 1; 2271 sx_sleep(fdtol, FILEDESC_LOCK(fdp), PLOCK, 2272 "fdlhold", 0); 2273 goto retry; 2274 } 2275 } 2276 fdtol->fdl_refcount--; 2277 if (fdtol->fdl_refcount == 0 && 2278 fdtol->fdl_holdcount == 0) { 2279 fdtol->fdl_next->fdl_prev = fdtol->fdl_prev; 2280 fdtol->fdl_prev->fdl_next = fdtol->fdl_next; 2281 } else 2282 fdtol = NULL; 2283 p->p_fdtol = NULL; 2284 FILEDESC_XUNLOCK(fdp); 2285 if (fdtol != NULL) 2286 free(fdtol, M_FILEDESC_TO_LEADER); 2287 } 2288 2289 /* 2290 * Release a filedesc structure. 2291 */ 2292 static void 2293 fdescfree_fds(struct thread *td, struct filedesc *fdp, bool needclose) 2294 { 2295 struct filedesc0 *fdp0; 2296 struct freetable *ft, *tft; 2297 struct filedescent *fde; 2298 struct file *fp; 2299 int i; 2300 2301 for (i = 0; i <= fdp->fd_lastfile; i++) { 2302 fde = &fdp->fd_ofiles[i]; 2303 fp = fde->fde_file; 2304 if (fp != NULL) { 2305 fdefree_last(fde); 2306 if (needclose) 2307 (void) closef(fp, td); 2308 else 2309 fdrop(fp, td); 2310 } 2311 } 2312 2313 if (NDSLOTS(fdp->fd_nfiles) > NDSLOTS(NDFILE)) 2314 free(fdp->fd_map, M_FILEDESC); 2315 if (fdp->fd_nfiles > NDFILE) 2316 free(fdp->fd_files, M_FILEDESC); 2317 2318 fdp0 = (struct filedesc0 *)fdp; 2319 SLIST_FOREACH_SAFE(ft, &fdp0->fd_free, ft_next, tft) 2320 free(ft->ft_table, M_FILEDESC); 2321 2322 fddrop(fdp); 2323 } 2324 2325 void 2326 fdescfree(struct thread *td) 2327 { 2328 struct proc *p; 2329 struct filedesc *fdp; 2330 struct vnode *cdir, *jdir, *rdir; 2331 2332 p = td->td_proc; 2333 fdp = p->p_fd; 2334 MPASS(fdp != NULL); 2335 2336 #ifdef RACCT 2337 if (RACCT_ENABLED()) 2338 racct_set_unlocked(p, RACCT_NOFILE, 0); 2339 #endif 2340 2341 if (p->p_fdtol != NULL) 2342 fdclearlocks(td); 2343 2344 PROC_LOCK(p); 2345 p->p_fd = NULL; 2346 PROC_UNLOCK(p); 2347 2348 if (refcount_release(&fdp->fd_refcnt) == 0) 2349 return; 2350 2351 FILEDESC_XLOCK(fdp); 2352 cdir = fdp->fd_cdir; 2353 fdp->fd_cdir = NULL; 2354 rdir = fdp->fd_rdir; 2355 fdp->fd_rdir = NULL; 2356 jdir = fdp->fd_jdir; 2357 fdp->fd_jdir = NULL; 2358 FILEDESC_XUNLOCK(fdp); 2359 2360 if (cdir != NULL) 2361 vrele(cdir); 2362 if (rdir != NULL) 2363 vrele(rdir); 2364 if (jdir != NULL) 2365 vrele(jdir); 2366 2367 fdescfree_fds(td, fdp, 1); 2368 } 2369 2370 void 2371 fdescfree_remapped(struct filedesc *fdp) 2372 { 2373 2374 if (fdp->fd_cdir != NULL) 2375 vrele(fdp->fd_cdir); 2376 if (fdp->fd_rdir != NULL) 2377 vrele(fdp->fd_rdir); 2378 if (fdp->fd_jdir != NULL) 2379 vrele(fdp->fd_jdir); 2380 2381 fdescfree_fds(curthread, fdp, 0); 2382 } 2383 2384 /* 2385 * For setugid programs, we don't want to people to use that setugidness 2386 * to generate error messages which write to a file which otherwise would 2387 * otherwise be off-limits to the process. We check for filesystems where 2388 * the vnode can change out from under us after execve (like [lin]procfs). 2389 * 2390 * Since fdsetugidsafety calls this only for fd 0, 1 and 2, this check is 2391 * sufficient. We also don't check for setugidness since we know we are. 2392 */ 2393 static bool 2394 is_unsafe(struct file *fp) 2395 { 2396 struct vnode *vp; 2397 2398 if (fp->f_type != DTYPE_VNODE) 2399 return (false); 2400 2401 vp = fp->f_vnode; 2402 return ((vp->v_vflag & VV_PROCDEP) != 0); 2403 } 2404 2405 /* 2406 * Make this setguid thing safe, if at all possible. 2407 */ 2408 void 2409 fdsetugidsafety(struct thread *td) 2410 { 2411 struct filedesc *fdp; 2412 struct file *fp; 2413 int i; 2414 2415 fdp = td->td_proc->p_fd; 2416 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared")); 2417 MPASS(fdp->fd_nfiles >= 3); 2418 for (i = 0; i <= 2; i++) { 2419 fp = fdp->fd_ofiles[i].fde_file; 2420 if (fp != NULL && is_unsafe(fp)) { 2421 FILEDESC_XLOCK(fdp); 2422 knote_fdclose(td, i); 2423 /* 2424 * NULL-out descriptor prior to close to avoid 2425 * a race while close blocks. 2426 */ 2427 fdfree(fdp, i); 2428 FILEDESC_XUNLOCK(fdp); 2429 (void) closef(fp, td); 2430 } 2431 } 2432 } 2433 2434 /* 2435 * If a specific file object occupies a specific file descriptor, close the 2436 * file descriptor entry and drop a reference on the file object. This is a 2437 * convenience function to handle a subsequent error in a function that calls 2438 * falloc() that handles the race that another thread might have closed the 2439 * file descriptor out from under the thread creating the file object. 2440 */ 2441 void 2442 fdclose(struct thread *td, struct file *fp, int idx) 2443 { 2444 struct filedesc *fdp = td->td_proc->p_fd; 2445 2446 FILEDESC_XLOCK(fdp); 2447 if (fdp->fd_ofiles[idx].fde_file == fp) { 2448 fdfree(fdp, idx); 2449 FILEDESC_XUNLOCK(fdp); 2450 fdrop(fp, td); 2451 } else 2452 FILEDESC_XUNLOCK(fdp); 2453 } 2454 2455 /* 2456 * Close any files on exec? 2457 */ 2458 void 2459 fdcloseexec(struct thread *td) 2460 { 2461 struct filedesc *fdp; 2462 struct filedescent *fde; 2463 struct file *fp; 2464 int i; 2465 2466 fdp = td->td_proc->p_fd; 2467 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared")); 2468 for (i = 0; i <= fdp->fd_lastfile; i++) { 2469 fde = &fdp->fd_ofiles[i]; 2470 fp = fde->fde_file; 2471 if (fp != NULL && (fp->f_type == DTYPE_MQUEUE || 2472 (fde->fde_flags & UF_EXCLOSE))) { 2473 FILEDESC_XLOCK(fdp); 2474 fdfree(fdp, i); 2475 (void) closefp(fdp, i, fp, td, 0); 2476 FILEDESC_UNLOCK_ASSERT(fdp); 2477 } 2478 } 2479 } 2480 2481 /* 2482 * It is unsafe for set[ug]id processes to be started with file 2483 * descriptors 0..2 closed, as these descriptors are given implicit 2484 * significance in the Standard C library. fdcheckstd() will create a 2485 * descriptor referencing /dev/null for each of stdin, stdout, and 2486 * stderr that is not already open. 2487 */ 2488 int 2489 fdcheckstd(struct thread *td) 2490 { 2491 struct filedesc *fdp; 2492 register_t save; 2493 int i, error, devnull; 2494 2495 fdp = td->td_proc->p_fd; 2496 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared")); 2497 MPASS(fdp->fd_nfiles >= 3); 2498 devnull = -1; 2499 for (i = 0; i <= 2; i++) { 2500 if (fdp->fd_ofiles[i].fde_file != NULL) 2501 continue; 2502 2503 save = td->td_retval[0]; 2504 if (devnull != -1) { 2505 error = kern_dup(td, FDDUP_FIXED, 0, devnull, i); 2506 } else { 2507 error = kern_openat(td, AT_FDCWD, "/dev/null", 2508 UIO_SYSSPACE, O_RDWR, 0); 2509 if (error == 0) { 2510 devnull = td->td_retval[0]; 2511 KASSERT(devnull == i, ("we didn't get our fd")); 2512 } 2513 } 2514 td->td_retval[0] = save; 2515 if (error != 0) 2516 return (error); 2517 } 2518 return (0); 2519 } 2520 2521 /* 2522 * Internal form of close. Decrement reference count on file structure. 2523 * Note: td may be NULL when closing a file that was being passed in a 2524 * message. 2525 */ 2526 int 2527 closef(struct file *fp, struct thread *td) 2528 { 2529 struct vnode *vp; 2530 struct flock lf; 2531 struct filedesc_to_leader *fdtol; 2532 struct filedesc *fdp; 2533 2534 /* 2535 * POSIX record locking dictates that any close releases ALL 2536 * locks owned by this process. This is handled by setting 2537 * a flag in the unlock to free ONLY locks obeying POSIX 2538 * semantics, and not to free BSD-style file locks. 2539 * If the descriptor was in a message, POSIX-style locks 2540 * aren't passed with the descriptor, and the thread pointer 2541 * will be NULL. Callers should be careful only to pass a 2542 * NULL thread pointer when there really is no owning 2543 * context that might have locks, or the locks will be 2544 * leaked. 2545 */ 2546 if (fp->f_type == DTYPE_VNODE && td != NULL) { 2547 vp = fp->f_vnode; 2548 if ((td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) { 2549 lf.l_whence = SEEK_SET; 2550 lf.l_start = 0; 2551 lf.l_len = 0; 2552 lf.l_type = F_UNLCK; 2553 (void) VOP_ADVLOCK(vp, (caddr_t)td->td_proc->p_leader, 2554 F_UNLCK, &lf, F_POSIX); 2555 } 2556 fdtol = td->td_proc->p_fdtol; 2557 if (fdtol != NULL) { 2558 /* 2559 * Handle special case where file descriptor table is 2560 * shared between multiple process leaders. 2561 */ 2562 fdp = td->td_proc->p_fd; 2563 FILEDESC_XLOCK(fdp); 2564 for (fdtol = fdtol->fdl_next; 2565 fdtol != td->td_proc->p_fdtol; 2566 fdtol = fdtol->fdl_next) { 2567 if ((fdtol->fdl_leader->p_flag & 2568 P_ADVLOCK) == 0) 2569 continue; 2570 fdtol->fdl_holdcount++; 2571 FILEDESC_XUNLOCK(fdp); 2572 lf.l_whence = SEEK_SET; 2573 lf.l_start = 0; 2574 lf.l_len = 0; 2575 lf.l_type = F_UNLCK; 2576 vp = fp->f_vnode; 2577 (void) VOP_ADVLOCK(vp, 2578 (caddr_t)fdtol->fdl_leader, F_UNLCK, &lf, 2579 F_POSIX); 2580 FILEDESC_XLOCK(fdp); 2581 fdtol->fdl_holdcount--; 2582 if (fdtol->fdl_holdcount == 0 && 2583 fdtol->fdl_wakeup != 0) { 2584 fdtol->fdl_wakeup = 0; 2585 wakeup(fdtol); 2586 } 2587 } 2588 FILEDESC_XUNLOCK(fdp); 2589 } 2590 } 2591 return (fdrop(fp, td)); 2592 } 2593 2594 /* 2595 * Initialize the file pointer with the specified properties. 2596 * 2597 * The ops are set with release semantics to be certain that the flags, type, 2598 * and data are visible when ops is. This is to prevent ops methods from being 2599 * called with bad data. 2600 */ 2601 void 2602 finit(struct file *fp, u_int flag, short type, void *data, struct fileops *ops) 2603 { 2604 fp->f_data = data; 2605 fp->f_flag = flag; 2606 fp->f_type = type; 2607 atomic_store_rel_ptr((volatile uintptr_t *)&fp->f_ops, (uintptr_t)ops); 2608 } 2609 2610 int 2611 fget_cap_locked(struct filedesc *fdp, int fd, cap_rights_t *needrightsp, 2612 struct file **fpp, struct filecaps *havecapsp) 2613 { 2614 struct filedescent *fde; 2615 int error; 2616 2617 FILEDESC_LOCK_ASSERT(fdp); 2618 2619 fde = fdeget_locked(fdp, fd); 2620 if (fde == NULL) { 2621 error = EBADF; 2622 goto out; 2623 } 2624 2625 #ifdef CAPABILITIES 2626 error = cap_check(cap_rights_fde_inline(fde), needrightsp); 2627 if (error != 0) 2628 goto out; 2629 #endif 2630 2631 if (havecapsp != NULL) 2632 filecaps_copy(&fde->fde_caps, havecapsp, true); 2633 2634 *fpp = fde->fde_file; 2635 2636 error = 0; 2637 out: 2638 return (error); 2639 } 2640 2641 int 2642 fget_cap(struct thread *td, int fd, cap_rights_t *needrightsp, 2643 struct file **fpp, struct filecaps *havecapsp) 2644 { 2645 struct filedesc *fdp = td->td_proc->p_fd; 2646 int error; 2647 #ifndef CAPABILITIES 2648 error = fget_unlocked(fdp, fd, needrightsp, fpp); 2649 if (havecapsp != NULL && error == 0) 2650 filecaps_fill(havecapsp); 2651 #else 2652 struct file *fp; 2653 seqc_t seq; 2654 2655 *fpp = NULL; 2656 for (;;) { 2657 error = fget_unlocked_seq(fdp, fd, needrightsp, &fp, &seq); 2658 if (error != 0) 2659 return (error); 2660 2661 if (havecapsp != NULL) { 2662 if (!filecaps_copy(&fdp->fd_ofiles[fd].fde_caps, 2663 havecapsp, false)) { 2664 fdrop(fp, td); 2665 goto get_locked; 2666 } 2667 } 2668 2669 if (!fd_modified(fdp, fd, seq)) 2670 break; 2671 fdrop(fp, td); 2672 } 2673 2674 *fpp = fp; 2675 return (0); 2676 2677 get_locked: 2678 FILEDESC_SLOCK(fdp); 2679 error = fget_cap_locked(fdp, fd, needrightsp, fpp, havecapsp); 2680 if (error == 0 && !fhold(*fpp)) 2681 error = EBADF; 2682 FILEDESC_SUNLOCK(fdp); 2683 #endif 2684 return (error); 2685 } 2686 2687 int 2688 fget_unlocked_seq(struct filedesc *fdp, int fd, cap_rights_t *needrightsp, 2689 struct file **fpp, seqc_t *seqp) 2690 { 2691 #ifdef CAPABILITIES 2692 const struct filedescent *fde; 2693 #endif 2694 const struct fdescenttbl *fdt; 2695 struct file *fp; 2696 #ifdef CAPABILITIES 2697 seqc_t seq; 2698 cap_rights_t haverights; 2699 int error; 2700 #endif 2701 2702 fdt = fdp->fd_files; 2703 if (__predict_false((u_int)fd >= fdt->fdt_nfiles)) 2704 return (EBADF); 2705 /* 2706 * Fetch the descriptor locklessly. We avoid fdrop() races by 2707 * never raising a refcount above 0. To accomplish this we have 2708 * to use a cmpset loop rather than an atomic_add. The descriptor 2709 * must be re-verified once we acquire a reference to be certain 2710 * that the identity is still correct and we did not lose a race 2711 * due to preemption. 2712 */ 2713 for (;;) { 2714 #ifdef CAPABILITIES 2715 seq = seqc_read(fd_seqc(fdt, fd)); 2716 fde = &fdt->fdt_ofiles[fd]; 2717 haverights = *cap_rights_fde_inline(fde); 2718 fp = fde->fde_file; 2719 if (!seqc_consistent(fd_seqc(fdt, fd), seq)) 2720 continue; 2721 #else 2722 fp = fdt->fdt_ofiles[fd].fde_file; 2723 #endif 2724 if (fp == NULL) 2725 return (EBADF); 2726 #ifdef CAPABILITIES 2727 error = cap_check_inline(&haverights, needrightsp); 2728 if (error != 0) 2729 return (error); 2730 #endif 2731 if (__predict_false(!refcount_acquire_if_not_zero(&fp->f_count))) { 2732 /* 2733 * The count was found either saturated or zero. 2734 * This re-read is not any more racy than using the 2735 * return value from fcmpset. 2736 */ 2737 if (fp->f_count != 0) 2738 return (EBADF); 2739 /* 2740 * Force a reload. Other thread could reallocate the 2741 * table before this fd was closed, so it is possible 2742 * that there is a stale fp pointer in cached version. 2743 */ 2744 fdt = (struct fdescenttbl *)atomic_load_ptr(&fdp->fd_files); 2745 continue; 2746 } 2747 /* 2748 * Use an acquire barrier to force re-reading of fdt so it is 2749 * refreshed for verification. 2750 */ 2751 atomic_thread_fence_acq(); 2752 fdt = fdp->fd_files; 2753 #ifdef CAPABILITIES 2754 if (seqc_consistent_nomb(fd_seqc(fdt, fd), seq)) 2755 #else 2756 if (fp == fdt->fdt_ofiles[fd].fde_file) 2757 #endif 2758 break; 2759 fdrop(fp, curthread); 2760 } 2761 *fpp = fp; 2762 if (seqp != NULL) { 2763 #ifdef CAPABILITIES 2764 *seqp = seq; 2765 #endif 2766 } 2767 return (0); 2768 } 2769 2770 /* 2771 * See the comments in fget_unlocked_seq for an explanation of how this works. 2772 * 2773 * This is a simplified variant which bails out to the aforementioned routine 2774 * if anything goes wrong. In practice this only happens when userspace is 2775 * racing with itself. 2776 */ 2777 int 2778 fget_unlocked(struct filedesc *fdp, int fd, cap_rights_t *needrightsp, 2779 struct file **fpp) 2780 { 2781 #ifdef CAPABILITIES 2782 const struct filedescent *fde; 2783 #endif 2784 const struct fdescenttbl *fdt; 2785 struct file *fp; 2786 #ifdef CAPABILITIES 2787 seqc_t seq; 2788 const cap_rights_t *haverights; 2789 #endif 2790 2791 fdt = fdp->fd_files; 2792 if (__predict_false((u_int)fd >= fdt->fdt_nfiles)) 2793 return (EBADF); 2794 #ifdef CAPABILITIES 2795 seq = seqc_read_any(fd_seqc(fdt, fd)); 2796 if (__predict_false(seqc_in_modify(seq))) 2797 goto out_fallback; 2798 fde = &fdt->fdt_ofiles[fd]; 2799 haverights = cap_rights_fde_inline(fde); 2800 fp = fde->fde_file; 2801 #else 2802 fp = fdt->fdt_ofiles[fd].fde_file; 2803 #endif 2804 if (__predict_false(fp == NULL)) 2805 goto out_fallback; 2806 #ifdef CAPABILITIES 2807 if (__predict_false(cap_check_inline_transient(haverights, needrightsp))) 2808 goto out_fallback; 2809 #endif 2810 if (__predict_false(!refcount_acquire_if_not_zero(&fp->f_count))) 2811 goto out_fallback; 2812 2813 /* 2814 * Use an acquire barrier to force re-reading of fdt so it is 2815 * refreshed for verification. 2816 */ 2817 atomic_thread_fence_acq(); 2818 fdt = fdp->fd_files; 2819 #ifdef CAPABILITIES 2820 if (__predict_false(!seqc_consistent_nomb(fd_seqc(fdt, fd), seq))) 2821 #else 2822 if (__predict_false(fp != fdt->fdt_ofiles[fd].fde_file)) 2823 #endif 2824 goto out_fdrop; 2825 *fpp = fp; 2826 return (0); 2827 out_fdrop: 2828 fdrop(fp, curthread); 2829 out_fallback: 2830 return (fget_unlocked_seq(fdp, fd, needrightsp, fpp, NULL)); 2831 } 2832 2833 /* 2834 * Extract the file pointer associated with the specified descriptor for the 2835 * current user process. 2836 * 2837 * If the descriptor doesn't exist or doesn't match 'flags', EBADF is 2838 * returned. 2839 * 2840 * File's rights will be checked against the capability rights mask. 2841 * 2842 * If an error occurred the non-zero error is returned and *fpp is set to 2843 * NULL. Otherwise *fpp is held and set and zero is returned. Caller is 2844 * responsible for fdrop(). 2845 */ 2846 static __inline int 2847 _fget(struct thread *td, int fd, struct file **fpp, int flags, 2848 cap_rights_t *needrightsp) 2849 { 2850 struct filedesc *fdp; 2851 struct file *fp; 2852 int error; 2853 2854 *fpp = NULL; 2855 fdp = td->td_proc->p_fd; 2856 error = fget_unlocked(fdp, fd, needrightsp, &fp); 2857 if (__predict_false(error != 0)) 2858 return (error); 2859 if (__predict_false(fp->f_ops == &badfileops)) { 2860 fdrop(fp, td); 2861 return (EBADF); 2862 } 2863 2864 /* 2865 * FREAD and FWRITE failure return EBADF as per POSIX. 2866 */ 2867 error = 0; 2868 switch (flags) { 2869 case FREAD: 2870 case FWRITE: 2871 if ((fp->f_flag & flags) == 0) 2872 error = EBADF; 2873 break; 2874 case FEXEC: 2875 if ((fp->f_flag & (FREAD | FEXEC)) == 0 || 2876 ((fp->f_flag & FWRITE) != 0)) 2877 error = EBADF; 2878 break; 2879 case 0: 2880 break; 2881 default: 2882 KASSERT(0, ("wrong flags")); 2883 } 2884 2885 if (error != 0) { 2886 fdrop(fp, td); 2887 return (error); 2888 } 2889 2890 *fpp = fp; 2891 return (0); 2892 } 2893 2894 int 2895 fget(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp) 2896 { 2897 2898 return (_fget(td, fd, fpp, 0, rightsp)); 2899 } 2900 2901 int 2902 fget_mmap(struct thread *td, int fd, cap_rights_t *rightsp, vm_prot_t *maxprotp, 2903 struct file **fpp) 2904 { 2905 int error; 2906 #ifndef CAPABILITIES 2907 error = _fget(td, fd, fpp, 0, rightsp); 2908 if (maxprotp != NULL) 2909 *maxprotp = VM_PROT_ALL; 2910 return (error); 2911 #else 2912 cap_rights_t fdrights; 2913 struct filedesc *fdp; 2914 struct file *fp; 2915 seqc_t seq; 2916 2917 *fpp = NULL; 2918 fdp = td->td_proc->p_fd; 2919 MPASS(cap_rights_is_set(rightsp, CAP_MMAP)); 2920 for (;;) { 2921 error = fget_unlocked_seq(fdp, fd, rightsp, &fp, &seq); 2922 if (__predict_false(error != 0)) 2923 return (error); 2924 if (__predict_false(fp->f_ops == &badfileops)) { 2925 fdrop(fp, td); 2926 return (EBADF); 2927 } 2928 if (maxprotp != NULL) 2929 fdrights = *cap_rights(fdp, fd); 2930 if (!fd_modified(fdp, fd, seq)) 2931 break; 2932 fdrop(fp, td); 2933 } 2934 2935 /* 2936 * If requested, convert capability rights to access flags. 2937 */ 2938 if (maxprotp != NULL) 2939 *maxprotp = cap_rights_to_vmprot(&fdrights); 2940 *fpp = fp; 2941 return (0); 2942 #endif 2943 } 2944 2945 int 2946 fget_read(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp) 2947 { 2948 2949 return (_fget(td, fd, fpp, FREAD, rightsp)); 2950 } 2951 2952 int 2953 fget_write(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp) 2954 { 2955 2956 return (_fget(td, fd, fpp, FWRITE, rightsp)); 2957 } 2958 2959 int 2960 fget_fcntl(struct thread *td, int fd, cap_rights_t *rightsp, int needfcntl, 2961 struct file **fpp) 2962 { 2963 struct filedesc *fdp = td->td_proc->p_fd; 2964 #ifndef CAPABILITIES 2965 return (fget_unlocked(fdp, fd, rightsp, fpp)); 2966 #else 2967 struct file *fp; 2968 int error; 2969 seqc_t seq; 2970 2971 *fpp = NULL; 2972 MPASS(cap_rights_is_set(rightsp, CAP_FCNTL)); 2973 for (;;) { 2974 error = fget_unlocked_seq(fdp, fd, rightsp, &fp, &seq); 2975 if (error != 0) 2976 return (error); 2977 error = cap_fcntl_check(fdp, fd, needfcntl); 2978 if (!fd_modified(fdp, fd, seq)) 2979 break; 2980 fdrop(fp, td); 2981 } 2982 if (error != 0) { 2983 fdrop(fp, td); 2984 return (error); 2985 } 2986 *fpp = fp; 2987 return (0); 2988 #endif 2989 } 2990 2991 /* 2992 * Like fget() but loads the underlying vnode, or returns an error if the 2993 * descriptor does not represent a vnode. Note that pipes use vnodes but 2994 * never have VM objects. The returned vnode will be vref()'d. 2995 * 2996 * XXX: what about the unused flags ? 2997 */ 2998 static __inline int 2999 _fgetvp(struct thread *td, int fd, int flags, cap_rights_t *needrightsp, 3000 struct vnode **vpp) 3001 { 3002 struct file *fp; 3003 int error; 3004 3005 *vpp = NULL; 3006 error = _fget(td, fd, &fp, flags, needrightsp); 3007 if (error != 0) 3008 return (error); 3009 if (fp->f_vnode == NULL) { 3010 error = EINVAL; 3011 } else { 3012 *vpp = fp->f_vnode; 3013 vrefact(*vpp); 3014 } 3015 fdrop(fp, td); 3016 3017 return (error); 3018 } 3019 3020 int 3021 fgetvp(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp) 3022 { 3023 3024 return (_fgetvp(td, fd, 0, rightsp, vpp)); 3025 } 3026 3027 int 3028 fgetvp_rights(struct thread *td, int fd, cap_rights_t *needrightsp, 3029 struct filecaps *havecaps, struct vnode **vpp) 3030 { 3031 struct filedesc *fdp; 3032 struct filecaps caps; 3033 struct file *fp; 3034 int error; 3035 3036 fdp = td->td_proc->p_fd; 3037 error = fget_cap_locked(fdp, fd, needrightsp, &fp, &caps); 3038 if (error != 0) 3039 return (error); 3040 if (fp->f_ops == &badfileops) { 3041 error = EBADF; 3042 goto out; 3043 } 3044 if (fp->f_vnode == NULL) { 3045 error = EINVAL; 3046 goto out; 3047 } 3048 3049 *havecaps = caps; 3050 *vpp = fp->f_vnode; 3051 vrefact(*vpp); 3052 3053 return (0); 3054 out: 3055 filecaps_free(&caps); 3056 return (error); 3057 } 3058 3059 int 3060 fgetvp_read(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp) 3061 { 3062 3063 return (_fgetvp(td, fd, FREAD, rightsp, vpp)); 3064 } 3065 3066 int 3067 fgetvp_exec(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp) 3068 { 3069 3070 return (_fgetvp(td, fd, FEXEC, rightsp, vpp)); 3071 } 3072 3073 #ifdef notyet 3074 int 3075 fgetvp_write(struct thread *td, int fd, cap_rights_t *rightsp, 3076 struct vnode **vpp) 3077 { 3078 3079 return (_fgetvp(td, fd, FWRITE, rightsp, vpp)); 3080 } 3081 #endif 3082 3083 /* 3084 * Handle the last reference to a file being closed. 3085 * 3086 * Without the noinline attribute clang keeps inlining the func thorough this 3087 * file when fdrop is used. 3088 */ 3089 int __noinline 3090 _fdrop(struct file *fp, struct thread *td) 3091 { 3092 int error; 3093 3094 if (fp->f_count != 0) 3095 panic("fdrop: count %d", fp->f_count); 3096 error = fo_close(fp, td); 3097 atomic_subtract_int(&openfiles, 1); 3098 crfree(fp->f_cred); 3099 free(fp->f_advice, M_FADVISE); 3100 uma_zfree(file_zone, fp); 3101 3102 return (error); 3103 } 3104 3105 /* 3106 * Apply an advisory lock on a file descriptor. 3107 * 3108 * Just attempt to get a record lock of the requested type on the entire file 3109 * (l_whence = SEEK_SET, l_start = 0, l_len = 0). 3110 */ 3111 #ifndef _SYS_SYSPROTO_H_ 3112 struct flock_args { 3113 int fd; 3114 int how; 3115 }; 3116 #endif 3117 /* ARGSUSED */ 3118 int 3119 sys_flock(struct thread *td, struct flock_args *uap) 3120 { 3121 struct file *fp; 3122 struct vnode *vp; 3123 struct flock lf; 3124 int error; 3125 3126 error = fget(td, uap->fd, &cap_flock_rights, &fp); 3127 if (error != 0) 3128 return (error); 3129 if (fp->f_type != DTYPE_VNODE) { 3130 fdrop(fp, td); 3131 return (EOPNOTSUPP); 3132 } 3133 3134 vp = fp->f_vnode; 3135 lf.l_whence = SEEK_SET; 3136 lf.l_start = 0; 3137 lf.l_len = 0; 3138 if (uap->how & LOCK_UN) { 3139 lf.l_type = F_UNLCK; 3140 atomic_clear_int(&fp->f_flag, FHASLOCK); 3141 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK); 3142 goto done2; 3143 } 3144 if (uap->how & LOCK_EX) 3145 lf.l_type = F_WRLCK; 3146 else if (uap->how & LOCK_SH) 3147 lf.l_type = F_RDLCK; 3148 else { 3149 error = EBADF; 3150 goto done2; 3151 } 3152 atomic_set_int(&fp->f_flag, FHASLOCK); 3153 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf, 3154 (uap->how & LOCK_NB) ? F_FLOCK : F_FLOCK | F_WAIT); 3155 done2: 3156 fdrop(fp, td); 3157 return (error); 3158 } 3159 /* 3160 * Duplicate the specified descriptor to a free descriptor. 3161 */ 3162 int 3163 dupfdopen(struct thread *td, struct filedesc *fdp, int dfd, int mode, 3164 int openerror, int *indxp) 3165 { 3166 struct filedescent *newfde, *oldfde; 3167 struct file *fp; 3168 u_long *ioctls; 3169 int error, indx; 3170 3171 KASSERT(openerror == ENODEV || openerror == ENXIO, 3172 ("unexpected error %d in %s", openerror, __func__)); 3173 3174 /* 3175 * If the to-be-dup'd fd number is greater than the allowed number 3176 * of file descriptors, or the fd to be dup'd has already been 3177 * closed, then reject. 3178 */ 3179 FILEDESC_XLOCK(fdp); 3180 if ((fp = fget_locked(fdp, dfd)) == NULL) { 3181 FILEDESC_XUNLOCK(fdp); 3182 return (EBADF); 3183 } 3184 3185 error = fdalloc(td, 0, &indx); 3186 if (error != 0) { 3187 FILEDESC_XUNLOCK(fdp); 3188 return (error); 3189 } 3190 3191 /* 3192 * There are two cases of interest here. 3193 * 3194 * For ENODEV simply dup (dfd) to file descriptor (indx) and return. 3195 * 3196 * For ENXIO steal away the file structure from (dfd) and store it in 3197 * (indx). (dfd) is effectively closed by this operation. 3198 */ 3199 switch (openerror) { 3200 case ENODEV: 3201 /* 3202 * Check that the mode the file is being opened for is a 3203 * subset of the mode of the existing descriptor. 3204 */ 3205 if (((mode & (FREAD|FWRITE)) | fp->f_flag) != fp->f_flag) { 3206 fdunused(fdp, indx); 3207 FILEDESC_XUNLOCK(fdp); 3208 return (EACCES); 3209 } 3210 if (!fhold(fp)) { 3211 fdunused(fdp, indx); 3212 FILEDESC_XUNLOCK(fdp); 3213 return (EBADF); 3214 } 3215 newfde = &fdp->fd_ofiles[indx]; 3216 oldfde = &fdp->fd_ofiles[dfd]; 3217 ioctls = filecaps_copy_prep(&oldfde->fde_caps); 3218 #ifdef CAPABILITIES 3219 seqc_write_begin(&newfde->fde_seqc); 3220 #endif 3221 memcpy(newfde, oldfde, fde_change_size); 3222 filecaps_copy_finish(&oldfde->fde_caps, &newfde->fde_caps, 3223 ioctls); 3224 #ifdef CAPABILITIES 3225 seqc_write_end(&newfde->fde_seqc); 3226 #endif 3227 break; 3228 case ENXIO: 3229 /* 3230 * Steal away the file pointer from dfd and stuff it into indx. 3231 */ 3232 newfde = &fdp->fd_ofiles[indx]; 3233 oldfde = &fdp->fd_ofiles[dfd]; 3234 #ifdef CAPABILITIES 3235 seqc_write_begin(&newfde->fde_seqc); 3236 #endif 3237 memcpy(newfde, oldfde, fde_change_size); 3238 oldfde->fde_file = NULL; 3239 fdunused(fdp, dfd); 3240 #ifdef CAPABILITIES 3241 seqc_write_end(&newfde->fde_seqc); 3242 #endif 3243 break; 3244 } 3245 FILEDESC_XUNLOCK(fdp); 3246 *indxp = indx; 3247 return (0); 3248 } 3249 3250 /* 3251 * This sysctl determines if we will allow a process to chroot(2) if it 3252 * has a directory open: 3253 * 0: disallowed for all processes. 3254 * 1: allowed for processes that were not already chroot(2)'ed. 3255 * 2: allowed for all processes. 3256 */ 3257 3258 static int chroot_allow_open_directories = 1; 3259 3260 SYSCTL_INT(_kern, OID_AUTO, chroot_allow_open_directories, CTLFLAG_RW, 3261 &chroot_allow_open_directories, 0, 3262 "Allow a process to chroot(2) if it has a directory open"); 3263 3264 /* 3265 * Helper function for raised chroot(2) security function: Refuse if 3266 * any filedescriptors are open directories. 3267 */ 3268 static int 3269 chroot_refuse_vdir_fds(struct filedesc *fdp) 3270 { 3271 struct vnode *vp; 3272 struct file *fp; 3273 int fd; 3274 3275 FILEDESC_LOCK_ASSERT(fdp); 3276 3277 for (fd = 0; fd <= fdp->fd_lastfile; fd++) { 3278 fp = fget_locked(fdp, fd); 3279 if (fp == NULL) 3280 continue; 3281 if (fp->f_type == DTYPE_VNODE) { 3282 vp = fp->f_vnode; 3283 if (vp->v_type == VDIR) 3284 return (EPERM); 3285 } 3286 } 3287 return (0); 3288 } 3289 3290 /* 3291 * Common routine for kern_chroot() and jail_attach(). The caller is 3292 * responsible for invoking priv_check() and mac_vnode_check_chroot() to 3293 * authorize this operation. 3294 */ 3295 int 3296 pwd_chroot(struct thread *td, struct vnode *vp) 3297 { 3298 struct filedesc *fdp; 3299 struct vnode *oldvp; 3300 int error; 3301 3302 fdp = td->td_proc->p_fd; 3303 FILEDESC_XLOCK(fdp); 3304 if (chroot_allow_open_directories == 0 || 3305 (chroot_allow_open_directories == 1 && fdp->fd_rdir != rootvnode)) { 3306 error = chroot_refuse_vdir_fds(fdp); 3307 if (error != 0) { 3308 FILEDESC_XUNLOCK(fdp); 3309 return (error); 3310 } 3311 } 3312 oldvp = fdp->fd_rdir; 3313 vrefact(vp); 3314 fdp->fd_rdir = vp; 3315 if (fdp->fd_jdir == NULL) { 3316 vrefact(vp); 3317 fdp->fd_jdir = vp; 3318 } 3319 FILEDESC_XUNLOCK(fdp); 3320 vrele(oldvp); 3321 return (0); 3322 } 3323 3324 void 3325 pwd_chdir(struct thread *td, struct vnode *vp) 3326 { 3327 struct filedesc *fdp; 3328 struct vnode *oldvp; 3329 3330 fdp = td->td_proc->p_fd; 3331 FILEDESC_XLOCK(fdp); 3332 VNASSERT(vp->v_usecount > 0, vp, 3333 ("chdir to a vnode with zero usecount")); 3334 oldvp = fdp->fd_cdir; 3335 fdp->fd_cdir = vp; 3336 FILEDESC_XUNLOCK(fdp); 3337 vrele(oldvp); 3338 } 3339 3340 /* 3341 * Scan all active processes and prisons to see if any of them have a current 3342 * or root directory of `olddp'. If so, replace them with the new mount point. 3343 */ 3344 void 3345 mountcheckdirs(struct vnode *olddp, struct vnode *newdp) 3346 { 3347 struct filedesc *fdp; 3348 struct prison *pr; 3349 struct proc *p; 3350 int nrele; 3351 3352 if (vrefcnt(olddp) == 1) 3353 return; 3354 nrele = 0; 3355 sx_slock(&allproc_lock); 3356 FOREACH_PROC_IN_SYSTEM(p) { 3357 PROC_LOCK(p); 3358 fdp = fdhold(p); 3359 PROC_UNLOCK(p); 3360 if (fdp == NULL) 3361 continue; 3362 FILEDESC_XLOCK(fdp); 3363 if (fdp->fd_cdir == olddp) { 3364 vrefact(newdp); 3365 fdp->fd_cdir = newdp; 3366 nrele++; 3367 } 3368 if (fdp->fd_rdir == olddp) { 3369 vrefact(newdp); 3370 fdp->fd_rdir = newdp; 3371 nrele++; 3372 } 3373 if (fdp->fd_jdir == olddp) { 3374 vrefact(newdp); 3375 fdp->fd_jdir = newdp; 3376 nrele++; 3377 } 3378 FILEDESC_XUNLOCK(fdp); 3379 fddrop(fdp); 3380 } 3381 sx_sunlock(&allproc_lock); 3382 if (rootvnode == olddp) { 3383 vrefact(newdp); 3384 rootvnode = newdp; 3385 nrele++; 3386 } 3387 mtx_lock(&prison0.pr_mtx); 3388 if (prison0.pr_root == olddp) { 3389 vrefact(newdp); 3390 prison0.pr_root = newdp; 3391 nrele++; 3392 } 3393 mtx_unlock(&prison0.pr_mtx); 3394 sx_slock(&allprison_lock); 3395 TAILQ_FOREACH(pr, &allprison, pr_list) { 3396 mtx_lock(&pr->pr_mtx); 3397 if (pr->pr_root == olddp) { 3398 vrefact(newdp); 3399 pr->pr_root = newdp; 3400 nrele++; 3401 } 3402 mtx_unlock(&pr->pr_mtx); 3403 } 3404 sx_sunlock(&allprison_lock); 3405 while (nrele--) 3406 vrele(olddp); 3407 } 3408 3409 struct filedesc_to_leader * 3410 filedesc_to_leader_alloc(struct filedesc_to_leader *old, struct filedesc *fdp, struct proc *leader) 3411 { 3412 struct filedesc_to_leader *fdtol; 3413 3414 fdtol = malloc(sizeof(struct filedesc_to_leader), 3415 M_FILEDESC_TO_LEADER, M_WAITOK); 3416 fdtol->fdl_refcount = 1; 3417 fdtol->fdl_holdcount = 0; 3418 fdtol->fdl_wakeup = 0; 3419 fdtol->fdl_leader = leader; 3420 if (old != NULL) { 3421 FILEDESC_XLOCK(fdp); 3422 fdtol->fdl_next = old->fdl_next; 3423 fdtol->fdl_prev = old; 3424 old->fdl_next = fdtol; 3425 fdtol->fdl_next->fdl_prev = fdtol; 3426 FILEDESC_XUNLOCK(fdp); 3427 } else { 3428 fdtol->fdl_next = fdtol; 3429 fdtol->fdl_prev = fdtol; 3430 } 3431 return (fdtol); 3432 } 3433 3434 static int 3435 sysctl_kern_proc_nfds(SYSCTL_HANDLER_ARGS) 3436 { 3437 struct filedesc *fdp; 3438 int i, count, slots; 3439 3440 if (*(int *)arg1 != 0) 3441 return (EINVAL); 3442 3443 fdp = curproc->p_fd; 3444 count = 0; 3445 FILEDESC_SLOCK(fdp); 3446 slots = NDSLOTS(fdp->fd_lastfile + 1); 3447 for (i = 0; i < slots; i++) 3448 count += bitcountl(fdp->fd_map[i]); 3449 FILEDESC_SUNLOCK(fdp); 3450 3451 return (SYSCTL_OUT(req, &count, sizeof(count))); 3452 } 3453 3454 static SYSCTL_NODE(_kern_proc, KERN_PROC_NFDS, nfds, 3455 CTLFLAG_RD|CTLFLAG_CAPRD|CTLFLAG_MPSAFE, sysctl_kern_proc_nfds, 3456 "Number of open file descriptors"); 3457 3458 /* 3459 * Get file structures globally. 3460 */ 3461 static int 3462 sysctl_kern_file(SYSCTL_HANDLER_ARGS) 3463 { 3464 struct xfile xf; 3465 struct filedesc *fdp; 3466 struct file *fp; 3467 struct proc *p; 3468 int error, n; 3469 3470 error = sysctl_wire_old_buffer(req, 0); 3471 if (error != 0) 3472 return (error); 3473 if (req->oldptr == NULL) { 3474 n = 0; 3475 sx_slock(&allproc_lock); 3476 FOREACH_PROC_IN_SYSTEM(p) { 3477 PROC_LOCK(p); 3478 if (p->p_state == PRS_NEW) { 3479 PROC_UNLOCK(p); 3480 continue; 3481 } 3482 fdp = fdhold(p); 3483 PROC_UNLOCK(p); 3484 if (fdp == NULL) 3485 continue; 3486 /* overestimates sparse tables. */ 3487 if (fdp->fd_lastfile > 0) 3488 n += fdp->fd_lastfile; 3489 fddrop(fdp); 3490 } 3491 sx_sunlock(&allproc_lock); 3492 return (SYSCTL_OUT(req, 0, n * sizeof(xf))); 3493 } 3494 error = 0; 3495 bzero(&xf, sizeof(xf)); 3496 xf.xf_size = sizeof(xf); 3497 sx_slock(&allproc_lock); 3498 FOREACH_PROC_IN_SYSTEM(p) { 3499 PROC_LOCK(p); 3500 if (p->p_state == PRS_NEW) { 3501 PROC_UNLOCK(p); 3502 continue; 3503 } 3504 if (p_cansee(req->td, p) != 0) { 3505 PROC_UNLOCK(p); 3506 continue; 3507 } 3508 xf.xf_pid = p->p_pid; 3509 xf.xf_uid = p->p_ucred->cr_uid; 3510 fdp = fdhold(p); 3511 PROC_UNLOCK(p); 3512 if (fdp == NULL) 3513 continue; 3514 FILEDESC_SLOCK(fdp); 3515 for (n = 0; fdp->fd_refcnt > 0 && n <= fdp->fd_lastfile; ++n) { 3516 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL) 3517 continue; 3518 xf.xf_fd = n; 3519 xf.xf_file = (uintptr_t)fp; 3520 xf.xf_data = (uintptr_t)fp->f_data; 3521 xf.xf_vnode = (uintptr_t)fp->f_vnode; 3522 xf.xf_type = (uintptr_t)fp->f_type; 3523 xf.xf_count = fp->f_count; 3524 xf.xf_msgcount = 0; 3525 xf.xf_offset = foffset_get(fp); 3526 xf.xf_flag = fp->f_flag; 3527 error = SYSCTL_OUT(req, &xf, sizeof(xf)); 3528 if (error) 3529 break; 3530 } 3531 FILEDESC_SUNLOCK(fdp); 3532 fddrop(fdp); 3533 if (error) 3534 break; 3535 } 3536 sx_sunlock(&allproc_lock); 3537 return (error); 3538 } 3539 3540 SYSCTL_PROC(_kern, KERN_FILE, file, CTLTYPE_OPAQUE|CTLFLAG_RD|CTLFLAG_MPSAFE, 3541 0, 0, sysctl_kern_file, "S,xfile", "Entire file table"); 3542 3543 #ifdef KINFO_FILE_SIZE 3544 CTASSERT(sizeof(struct kinfo_file) == KINFO_FILE_SIZE); 3545 #endif 3546 3547 static int 3548 xlate_fflags(int fflags) 3549 { 3550 static const struct { 3551 int fflag; 3552 int kf_fflag; 3553 } fflags_table[] = { 3554 { FAPPEND, KF_FLAG_APPEND }, 3555 { FASYNC, KF_FLAG_ASYNC }, 3556 { FFSYNC, KF_FLAG_FSYNC }, 3557 { FHASLOCK, KF_FLAG_HASLOCK }, 3558 { FNONBLOCK, KF_FLAG_NONBLOCK }, 3559 { FREAD, KF_FLAG_READ }, 3560 { FWRITE, KF_FLAG_WRITE }, 3561 { O_CREAT, KF_FLAG_CREAT }, 3562 { O_DIRECT, KF_FLAG_DIRECT }, 3563 { O_EXCL, KF_FLAG_EXCL }, 3564 { O_EXEC, KF_FLAG_EXEC }, 3565 { O_EXLOCK, KF_FLAG_EXLOCK }, 3566 { O_NOFOLLOW, KF_FLAG_NOFOLLOW }, 3567 { O_SHLOCK, KF_FLAG_SHLOCK }, 3568 { O_TRUNC, KF_FLAG_TRUNC } 3569 }; 3570 unsigned int i; 3571 int kflags; 3572 3573 kflags = 0; 3574 for (i = 0; i < nitems(fflags_table); i++) 3575 if (fflags & fflags_table[i].fflag) 3576 kflags |= fflags_table[i].kf_fflag; 3577 return (kflags); 3578 } 3579 3580 /* Trim unused data from kf_path by truncating the structure size. */ 3581 void 3582 pack_kinfo(struct kinfo_file *kif) 3583 { 3584 3585 kif->kf_structsize = offsetof(struct kinfo_file, kf_path) + 3586 strlen(kif->kf_path) + 1; 3587 kif->kf_structsize = roundup(kif->kf_structsize, sizeof(uint64_t)); 3588 } 3589 3590 static void 3591 export_file_to_kinfo(struct file *fp, int fd, cap_rights_t *rightsp, 3592 struct kinfo_file *kif, struct filedesc *fdp, int flags) 3593 { 3594 int error; 3595 3596 bzero(kif, sizeof(*kif)); 3597 3598 /* Set a default type to allow for empty fill_kinfo() methods. */ 3599 kif->kf_type = KF_TYPE_UNKNOWN; 3600 kif->kf_flags = xlate_fflags(fp->f_flag); 3601 if (rightsp != NULL) 3602 kif->kf_cap_rights = *rightsp; 3603 else 3604 cap_rights_init(&kif->kf_cap_rights); 3605 kif->kf_fd = fd; 3606 kif->kf_ref_count = fp->f_count; 3607 kif->kf_offset = foffset_get(fp); 3608 3609 /* 3610 * This may drop the filedesc lock, so the 'fp' cannot be 3611 * accessed after this call. 3612 */ 3613 error = fo_fill_kinfo(fp, kif, fdp); 3614 if (error == 0) 3615 kif->kf_status |= KF_ATTR_VALID; 3616 if ((flags & KERN_FILEDESC_PACK_KINFO) != 0) 3617 pack_kinfo(kif); 3618 else 3619 kif->kf_structsize = roundup2(sizeof(*kif), sizeof(uint64_t)); 3620 } 3621 3622 static void 3623 export_vnode_to_kinfo(struct vnode *vp, int fd, int fflags, 3624 struct kinfo_file *kif, int flags) 3625 { 3626 int error; 3627 3628 bzero(kif, sizeof(*kif)); 3629 3630 kif->kf_type = KF_TYPE_VNODE; 3631 error = vn_fill_kinfo_vnode(vp, kif); 3632 if (error == 0) 3633 kif->kf_status |= KF_ATTR_VALID; 3634 kif->kf_flags = xlate_fflags(fflags); 3635 cap_rights_init(&kif->kf_cap_rights); 3636 kif->kf_fd = fd; 3637 kif->kf_ref_count = -1; 3638 kif->kf_offset = -1; 3639 if ((flags & KERN_FILEDESC_PACK_KINFO) != 0) 3640 pack_kinfo(kif); 3641 else 3642 kif->kf_structsize = roundup2(sizeof(*kif), sizeof(uint64_t)); 3643 vrele(vp); 3644 } 3645 3646 struct export_fd_buf { 3647 struct filedesc *fdp; 3648 struct sbuf *sb; 3649 ssize_t remainder; 3650 struct kinfo_file kif; 3651 int flags; 3652 }; 3653 3654 static int 3655 export_kinfo_to_sb(struct export_fd_buf *efbuf) 3656 { 3657 struct kinfo_file *kif; 3658 3659 kif = &efbuf->kif; 3660 if (efbuf->remainder != -1) { 3661 if (efbuf->remainder < kif->kf_structsize) { 3662 /* Terminate export. */ 3663 efbuf->remainder = 0; 3664 return (0); 3665 } 3666 efbuf->remainder -= kif->kf_structsize; 3667 } 3668 return (sbuf_bcat(efbuf->sb, kif, kif->kf_structsize) == 0 ? 0 : ENOMEM); 3669 } 3670 3671 static int 3672 export_file_to_sb(struct file *fp, int fd, cap_rights_t *rightsp, 3673 struct export_fd_buf *efbuf) 3674 { 3675 int error; 3676 3677 if (efbuf->remainder == 0) 3678 return (0); 3679 export_file_to_kinfo(fp, fd, rightsp, &efbuf->kif, efbuf->fdp, 3680 efbuf->flags); 3681 FILEDESC_SUNLOCK(efbuf->fdp); 3682 error = export_kinfo_to_sb(efbuf); 3683 FILEDESC_SLOCK(efbuf->fdp); 3684 return (error); 3685 } 3686 3687 static int 3688 export_vnode_to_sb(struct vnode *vp, int fd, int fflags, 3689 struct export_fd_buf *efbuf) 3690 { 3691 int error; 3692 3693 if (efbuf->remainder == 0) 3694 return (0); 3695 if (efbuf->fdp != NULL) 3696 FILEDESC_SUNLOCK(efbuf->fdp); 3697 export_vnode_to_kinfo(vp, fd, fflags, &efbuf->kif, efbuf->flags); 3698 error = export_kinfo_to_sb(efbuf); 3699 if (efbuf->fdp != NULL) 3700 FILEDESC_SLOCK(efbuf->fdp); 3701 return (error); 3702 } 3703 3704 /* 3705 * Store a process file descriptor information to sbuf. 3706 * 3707 * Takes a locked proc as argument, and returns with the proc unlocked. 3708 */ 3709 int 3710 kern_proc_filedesc_out(struct proc *p, struct sbuf *sb, ssize_t maxlen, 3711 int flags) 3712 { 3713 struct file *fp; 3714 struct filedesc *fdp; 3715 struct export_fd_buf *efbuf; 3716 struct vnode *cttyvp, *textvp, *tracevp; 3717 int error, i; 3718 cap_rights_t rights; 3719 3720 PROC_LOCK_ASSERT(p, MA_OWNED); 3721 3722 /* ktrace vnode */ 3723 tracevp = p->p_tracevp; 3724 if (tracevp != NULL) 3725 vrefact(tracevp); 3726 /* text vnode */ 3727 textvp = p->p_textvp; 3728 if (textvp != NULL) 3729 vrefact(textvp); 3730 /* Controlling tty. */ 3731 cttyvp = NULL; 3732 if (p->p_pgrp != NULL && p->p_pgrp->pg_session != NULL) { 3733 cttyvp = p->p_pgrp->pg_session->s_ttyvp; 3734 if (cttyvp != NULL) 3735 vrefact(cttyvp); 3736 } 3737 fdp = fdhold(p); 3738 PROC_UNLOCK(p); 3739 efbuf = malloc(sizeof(*efbuf), M_TEMP, M_WAITOK); 3740 efbuf->fdp = NULL; 3741 efbuf->sb = sb; 3742 efbuf->remainder = maxlen; 3743 efbuf->flags = flags; 3744 if (tracevp != NULL) 3745 export_vnode_to_sb(tracevp, KF_FD_TYPE_TRACE, FREAD | FWRITE, 3746 efbuf); 3747 if (textvp != NULL) 3748 export_vnode_to_sb(textvp, KF_FD_TYPE_TEXT, FREAD, efbuf); 3749 if (cttyvp != NULL) 3750 export_vnode_to_sb(cttyvp, KF_FD_TYPE_CTTY, FREAD | FWRITE, 3751 efbuf); 3752 error = 0; 3753 if (fdp == NULL) 3754 goto fail; 3755 efbuf->fdp = fdp; 3756 FILEDESC_SLOCK(fdp); 3757 /* working directory */ 3758 if (fdp->fd_cdir != NULL) { 3759 vrefact(fdp->fd_cdir); 3760 export_vnode_to_sb(fdp->fd_cdir, KF_FD_TYPE_CWD, FREAD, efbuf); 3761 } 3762 /* root directory */ 3763 if (fdp->fd_rdir != NULL) { 3764 vrefact(fdp->fd_rdir); 3765 export_vnode_to_sb(fdp->fd_rdir, KF_FD_TYPE_ROOT, FREAD, efbuf); 3766 } 3767 /* jail directory */ 3768 if (fdp->fd_jdir != NULL) { 3769 vrefact(fdp->fd_jdir); 3770 export_vnode_to_sb(fdp->fd_jdir, KF_FD_TYPE_JAIL, FREAD, efbuf); 3771 } 3772 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) { 3773 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL) 3774 continue; 3775 #ifdef CAPABILITIES 3776 rights = *cap_rights(fdp, i); 3777 #else /* !CAPABILITIES */ 3778 rights = cap_no_rights; 3779 #endif 3780 /* 3781 * Create sysctl entry. It is OK to drop the filedesc 3782 * lock inside of export_file_to_sb() as we will 3783 * re-validate and re-evaluate its properties when the 3784 * loop continues. 3785 */ 3786 error = export_file_to_sb(fp, i, &rights, efbuf); 3787 if (error != 0 || efbuf->remainder == 0) 3788 break; 3789 } 3790 FILEDESC_SUNLOCK(fdp); 3791 fddrop(fdp); 3792 fail: 3793 free(efbuf, M_TEMP); 3794 return (error); 3795 } 3796 3797 #define FILEDESC_SBUF_SIZE (sizeof(struct kinfo_file) * 5) 3798 3799 /* 3800 * Get per-process file descriptors for use by procstat(1), et al. 3801 */ 3802 static int 3803 sysctl_kern_proc_filedesc(SYSCTL_HANDLER_ARGS) 3804 { 3805 struct sbuf sb; 3806 struct proc *p; 3807 ssize_t maxlen; 3808 int error, error2, *name; 3809 3810 name = (int *)arg1; 3811 3812 sbuf_new_for_sysctl(&sb, NULL, FILEDESC_SBUF_SIZE, req); 3813 sbuf_clear_flags(&sb, SBUF_INCLUDENUL); 3814 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p); 3815 if (error != 0) { 3816 sbuf_delete(&sb); 3817 return (error); 3818 } 3819 maxlen = req->oldptr != NULL ? req->oldlen : -1; 3820 error = kern_proc_filedesc_out(p, &sb, maxlen, 3821 KERN_FILEDESC_PACK_KINFO); 3822 error2 = sbuf_finish(&sb); 3823 sbuf_delete(&sb); 3824 return (error != 0 ? error : error2); 3825 } 3826 3827 #ifdef COMPAT_FREEBSD7 3828 #ifdef KINFO_OFILE_SIZE 3829 CTASSERT(sizeof(struct kinfo_ofile) == KINFO_OFILE_SIZE); 3830 #endif 3831 3832 static void 3833 kinfo_to_okinfo(struct kinfo_file *kif, struct kinfo_ofile *okif) 3834 { 3835 3836 okif->kf_structsize = sizeof(*okif); 3837 okif->kf_type = kif->kf_type; 3838 okif->kf_fd = kif->kf_fd; 3839 okif->kf_ref_count = kif->kf_ref_count; 3840 okif->kf_flags = kif->kf_flags & (KF_FLAG_READ | KF_FLAG_WRITE | 3841 KF_FLAG_APPEND | KF_FLAG_ASYNC | KF_FLAG_FSYNC | KF_FLAG_NONBLOCK | 3842 KF_FLAG_DIRECT | KF_FLAG_HASLOCK); 3843 okif->kf_offset = kif->kf_offset; 3844 if (kif->kf_type == KF_TYPE_VNODE) 3845 okif->kf_vnode_type = kif->kf_un.kf_file.kf_file_type; 3846 else 3847 okif->kf_vnode_type = KF_VTYPE_VNON; 3848 strlcpy(okif->kf_path, kif->kf_path, sizeof(okif->kf_path)); 3849 if (kif->kf_type == KF_TYPE_SOCKET) { 3850 okif->kf_sock_domain = kif->kf_un.kf_sock.kf_sock_domain0; 3851 okif->kf_sock_type = kif->kf_un.kf_sock.kf_sock_type0; 3852 okif->kf_sock_protocol = kif->kf_un.kf_sock.kf_sock_protocol0; 3853 okif->kf_sa_local = kif->kf_un.kf_sock.kf_sa_local; 3854 okif->kf_sa_peer = kif->kf_un.kf_sock.kf_sa_peer; 3855 } else { 3856 okif->kf_sa_local.ss_family = AF_UNSPEC; 3857 okif->kf_sa_peer.ss_family = AF_UNSPEC; 3858 } 3859 } 3860 3861 static int 3862 export_vnode_for_osysctl(struct vnode *vp, int type, struct kinfo_file *kif, 3863 struct kinfo_ofile *okif, struct filedesc *fdp, struct sysctl_req *req) 3864 { 3865 int error; 3866 3867 vrefact(vp); 3868 FILEDESC_SUNLOCK(fdp); 3869 export_vnode_to_kinfo(vp, type, 0, kif, KERN_FILEDESC_PACK_KINFO); 3870 kinfo_to_okinfo(kif, okif); 3871 error = SYSCTL_OUT(req, okif, sizeof(*okif)); 3872 FILEDESC_SLOCK(fdp); 3873 return (error); 3874 } 3875 3876 /* 3877 * Get per-process file descriptors for use by procstat(1), et al. 3878 */ 3879 static int 3880 sysctl_kern_proc_ofiledesc(SYSCTL_HANDLER_ARGS) 3881 { 3882 struct kinfo_ofile *okif; 3883 struct kinfo_file *kif; 3884 struct filedesc *fdp; 3885 int error, i, *name; 3886 struct file *fp; 3887 struct proc *p; 3888 3889 name = (int *)arg1; 3890 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p); 3891 if (error != 0) 3892 return (error); 3893 fdp = fdhold(p); 3894 PROC_UNLOCK(p); 3895 if (fdp == NULL) 3896 return (ENOENT); 3897 kif = malloc(sizeof(*kif), M_TEMP, M_WAITOK); 3898 okif = malloc(sizeof(*okif), M_TEMP, M_WAITOK); 3899 FILEDESC_SLOCK(fdp); 3900 if (fdp->fd_cdir != NULL) 3901 export_vnode_for_osysctl(fdp->fd_cdir, KF_FD_TYPE_CWD, kif, 3902 okif, fdp, req); 3903 if (fdp->fd_rdir != NULL) 3904 export_vnode_for_osysctl(fdp->fd_rdir, KF_FD_TYPE_ROOT, kif, 3905 okif, fdp, req); 3906 if (fdp->fd_jdir != NULL) 3907 export_vnode_for_osysctl(fdp->fd_jdir, KF_FD_TYPE_JAIL, kif, 3908 okif, fdp, req); 3909 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) { 3910 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL) 3911 continue; 3912 export_file_to_kinfo(fp, i, NULL, kif, fdp, 3913 KERN_FILEDESC_PACK_KINFO); 3914 FILEDESC_SUNLOCK(fdp); 3915 kinfo_to_okinfo(kif, okif); 3916 error = SYSCTL_OUT(req, okif, sizeof(*okif)); 3917 FILEDESC_SLOCK(fdp); 3918 if (error) 3919 break; 3920 } 3921 FILEDESC_SUNLOCK(fdp); 3922 fddrop(fdp); 3923 free(kif, M_TEMP); 3924 free(okif, M_TEMP); 3925 return (0); 3926 } 3927 3928 static SYSCTL_NODE(_kern_proc, KERN_PROC_OFILEDESC, ofiledesc, 3929 CTLFLAG_RD|CTLFLAG_MPSAFE, sysctl_kern_proc_ofiledesc, 3930 "Process ofiledesc entries"); 3931 #endif /* COMPAT_FREEBSD7 */ 3932 3933 int 3934 vntype_to_kinfo(int vtype) 3935 { 3936 struct { 3937 int vtype; 3938 int kf_vtype; 3939 } vtypes_table[] = { 3940 { VBAD, KF_VTYPE_VBAD }, 3941 { VBLK, KF_VTYPE_VBLK }, 3942 { VCHR, KF_VTYPE_VCHR }, 3943 { VDIR, KF_VTYPE_VDIR }, 3944 { VFIFO, KF_VTYPE_VFIFO }, 3945 { VLNK, KF_VTYPE_VLNK }, 3946 { VNON, KF_VTYPE_VNON }, 3947 { VREG, KF_VTYPE_VREG }, 3948 { VSOCK, KF_VTYPE_VSOCK } 3949 }; 3950 unsigned int i; 3951 3952 /* 3953 * Perform vtype translation. 3954 */ 3955 for (i = 0; i < nitems(vtypes_table); i++) 3956 if (vtypes_table[i].vtype == vtype) 3957 return (vtypes_table[i].kf_vtype); 3958 3959 return (KF_VTYPE_UNKNOWN); 3960 } 3961 3962 static SYSCTL_NODE(_kern_proc, KERN_PROC_FILEDESC, filedesc, 3963 CTLFLAG_RD|CTLFLAG_MPSAFE, sysctl_kern_proc_filedesc, 3964 "Process filedesc entries"); 3965 3966 /* 3967 * Store a process current working directory information to sbuf. 3968 * 3969 * Takes a locked proc as argument, and returns with the proc unlocked. 3970 */ 3971 int 3972 kern_proc_cwd_out(struct proc *p, struct sbuf *sb, ssize_t maxlen) 3973 { 3974 struct filedesc *fdp; 3975 struct export_fd_buf *efbuf; 3976 int error; 3977 3978 PROC_LOCK_ASSERT(p, MA_OWNED); 3979 3980 fdp = fdhold(p); 3981 PROC_UNLOCK(p); 3982 if (fdp == NULL) 3983 return (EINVAL); 3984 3985 efbuf = malloc(sizeof(*efbuf), M_TEMP, M_WAITOK); 3986 efbuf->fdp = fdp; 3987 efbuf->sb = sb; 3988 efbuf->remainder = maxlen; 3989 3990 FILEDESC_SLOCK(fdp); 3991 if (fdp->fd_cdir == NULL) 3992 error = EINVAL; 3993 else { 3994 vrefact(fdp->fd_cdir); 3995 error = export_vnode_to_sb(fdp->fd_cdir, KF_FD_TYPE_CWD, 3996 FREAD, efbuf); 3997 } 3998 FILEDESC_SUNLOCK(fdp); 3999 fddrop(fdp); 4000 free(efbuf, M_TEMP); 4001 return (error); 4002 } 4003 4004 /* 4005 * Get per-process current working directory. 4006 */ 4007 static int 4008 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS) 4009 { 4010 struct sbuf sb; 4011 struct proc *p; 4012 ssize_t maxlen; 4013 int error, error2, *name; 4014 4015 name = (int *)arg1; 4016 4017 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_file), req); 4018 sbuf_clear_flags(&sb, SBUF_INCLUDENUL); 4019 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p); 4020 if (error != 0) { 4021 sbuf_delete(&sb); 4022 return (error); 4023 } 4024 maxlen = req->oldptr != NULL ? req->oldlen : -1; 4025 error = kern_proc_cwd_out(p, &sb, maxlen); 4026 error2 = sbuf_finish(&sb); 4027 sbuf_delete(&sb); 4028 return (error != 0 ? error : error2); 4029 } 4030 4031 static SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd, CTLFLAG_RD|CTLFLAG_MPSAFE, 4032 sysctl_kern_proc_cwd, "Process current working directory"); 4033 4034 #ifdef DDB 4035 /* 4036 * For the purposes of debugging, generate a human-readable string for the 4037 * file type. 4038 */ 4039 static const char * 4040 file_type_to_name(short type) 4041 { 4042 4043 switch (type) { 4044 case 0: 4045 return ("zero"); 4046 case DTYPE_VNODE: 4047 return ("vnode"); 4048 case DTYPE_SOCKET: 4049 return ("socket"); 4050 case DTYPE_PIPE: 4051 return ("pipe"); 4052 case DTYPE_FIFO: 4053 return ("fifo"); 4054 case DTYPE_KQUEUE: 4055 return ("kqueue"); 4056 case DTYPE_CRYPTO: 4057 return ("crypto"); 4058 case DTYPE_MQUEUE: 4059 return ("mqueue"); 4060 case DTYPE_SHM: 4061 return ("shm"); 4062 case DTYPE_SEM: 4063 return ("ksem"); 4064 case DTYPE_PTS: 4065 return ("pts"); 4066 case DTYPE_DEV: 4067 return ("dev"); 4068 case DTYPE_PROCDESC: 4069 return ("proc"); 4070 case DTYPE_LINUXEFD: 4071 return ("levent"); 4072 case DTYPE_LINUXTFD: 4073 return ("ltimer"); 4074 default: 4075 return ("unkn"); 4076 } 4077 } 4078 4079 /* 4080 * For the purposes of debugging, identify a process (if any, perhaps one of 4081 * many) that references the passed file in its file descriptor array. Return 4082 * NULL if none. 4083 */ 4084 static struct proc * 4085 file_to_first_proc(struct file *fp) 4086 { 4087 struct filedesc *fdp; 4088 struct proc *p; 4089 int n; 4090 4091 FOREACH_PROC_IN_SYSTEM(p) { 4092 if (p->p_state == PRS_NEW) 4093 continue; 4094 fdp = p->p_fd; 4095 if (fdp == NULL) 4096 continue; 4097 for (n = 0; n <= fdp->fd_lastfile; n++) { 4098 if (fp == fdp->fd_ofiles[n].fde_file) 4099 return (p); 4100 } 4101 } 4102 return (NULL); 4103 } 4104 4105 static void 4106 db_print_file(struct file *fp, int header) 4107 { 4108 #define XPTRWIDTH ((int)howmany(sizeof(void *) * NBBY, 4)) 4109 struct proc *p; 4110 4111 if (header) 4112 db_printf("%*s %6s %*s %8s %4s %5s %6s %*s %5s %s\n", 4113 XPTRWIDTH, "File", "Type", XPTRWIDTH, "Data", "Flag", 4114 "GCFl", "Count", "MCount", XPTRWIDTH, "Vnode", "FPID", 4115 "FCmd"); 4116 p = file_to_first_proc(fp); 4117 db_printf("%*p %6s %*p %08x %04x %5d %6d %*p %5d %s\n", XPTRWIDTH, 4118 fp, file_type_to_name(fp->f_type), XPTRWIDTH, fp->f_data, 4119 fp->f_flag, 0, fp->f_count, 0, XPTRWIDTH, fp->f_vnode, 4120 p != NULL ? p->p_pid : -1, p != NULL ? p->p_comm : "-"); 4121 4122 #undef XPTRWIDTH 4123 } 4124 4125 DB_SHOW_COMMAND(file, db_show_file) 4126 { 4127 struct file *fp; 4128 4129 if (!have_addr) { 4130 db_printf("usage: show file <addr>\n"); 4131 return; 4132 } 4133 fp = (struct file *)addr; 4134 db_print_file(fp, 1); 4135 } 4136 4137 DB_SHOW_COMMAND(files, db_show_files) 4138 { 4139 struct filedesc *fdp; 4140 struct file *fp; 4141 struct proc *p; 4142 int header; 4143 int n; 4144 4145 header = 1; 4146 FOREACH_PROC_IN_SYSTEM(p) { 4147 if (p->p_state == PRS_NEW) 4148 continue; 4149 if ((fdp = p->p_fd) == NULL) 4150 continue; 4151 for (n = 0; n <= fdp->fd_lastfile; ++n) { 4152 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL) 4153 continue; 4154 db_print_file(fp, header); 4155 header = 0; 4156 } 4157 } 4158 } 4159 #endif 4160 4161 SYSCTL_INT(_kern, KERN_MAXFILESPERPROC, maxfilesperproc, CTLFLAG_RW, 4162 &maxfilesperproc, 0, "Maximum files allowed open per process"); 4163 4164 SYSCTL_INT(_kern, KERN_MAXFILES, maxfiles, CTLFLAG_RW, 4165 &maxfiles, 0, "Maximum number of files"); 4166 4167 SYSCTL_INT(_kern, OID_AUTO, openfiles, CTLFLAG_RD, 4168 &openfiles, 0, "System-wide number of open files"); 4169 4170 /* ARGSUSED*/ 4171 static void 4172 filelistinit(void *dummy) 4173 { 4174 4175 file_zone = uma_zcreate("Files", sizeof(struct file), NULL, NULL, 4176 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE); 4177 filedesc0_zone = uma_zcreate("filedesc0", sizeof(struct filedesc0), 4178 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0); 4179 mtx_init(&sigio_lock, "sigio lock", NULL, MTX_DEF); 4180 } 4181 SYSINIT(select, SI_SUB_LOCK, SI_ORDER_FIRST, filelistinit, NULL); 4182 4183 /*-------------------------------------------------------------------*/ 4184 4185 static int 4186 badfo_readwrite(struct file *fp, struct uio *uio, struct ucred *active_cred, 4187 int flags, struct thread *td) 4188 { 4189 4190 return (EBADF); 4191 } 4192 4193 static int 4194 badfo_truncate(struct file *fp, off_t length, struct ucred *active_cred, 4195 struct thread *td) 4196 { 4197 4198 return (EINVAL); 4199 } 4200 4201 static int 4202 badfo_ioctl(struct file *fp, u_long com, void *data, struct ucred *active_cred, 4203 struct thread *td) 4204 { 4205 4206 return (EBADF); 4207 } 4208 4209 static int 4210 badfo_poll(struct file *fp, int events, struct ucred *active_cred, 4211 struct thread *td) 4212 { 4213 4214 return (0); 4215 } 4216 4217 static int 4218 badfo_kqfilter(struct file *fp, struct knote *kn) 4219 { 4220 4221 return (EBADF); 4222 } 4223 4224 static int 4225 badfo_stat(struct file *fp, struct stat *sb, struct ucred *active_cred, 4226 struct thread *td) 4227 { 4228 4229 return (EBADF); 4230 } 4231 4232 static int 4233 badfo_close(struct file *fp, struct thread *td) 4234 { 4235 4236 return (0); 4237 } 4238 4239 static int 4240 badfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred, 4241 struct thread *td) 4242 { 4243 4244 return (EBADF); 4245 } 4246 4247 static int 4248 badfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred, 4249 struct thread *td) 4250 { 4251 4252 return (EBADF); 4253 } 4254 4255 static int 4256 badfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio, 4257 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags, 4258 struct thread *td) 4259 { 4260 4261 return (EBADF); 4262 } 4263 4264 static int 4265 badfo_fill_kinfo(struct file *fp, struct kinfo_file *kif, struct filedesc *fdp) 4266 { 4267 4268 return (0); 4269 } 4270 4271 struct fileops badfileops = { 4272 .fo_read = badfo_readwrite, 4273 .fo_write = badfo_readwrite, 4274 .fo_truncate = badfo_truncate, 4275 .fo_ioctl = badfo_ioctl, 4276 .fo_poll = badfo_poll, 4277 .fo_kqfilter = badfo_kqfilter, 4278 .fo_stat = badfo_stat, 4279 .fo_close = badfo_close, 4280 .fo_chmod = badfo_chmod, 4281 .fo_chown = badfo_chown, 4282 .fo_sendfile = badfo_sendfile, 4283 .fo_fill_kinfo = badfo_fill_kinfo, 4284 }; 4285 4286 int 4287 invfo_rdwr(struct file *fp, struct uio *uio, struct ucred *active_cred, 4288 int flags, struct thread *td) 4289 { 4290 4291 return (EOPNOTSUPP); 4292 } 4293 4294 int 4295 invfo_truncate(struct file *fp, off_t length, struct ucred *active_cred, 4296 struct thread *td) 4297 { 4298 4299 return (EINVAL); 4300 } 4301 4302 int 4303 invfo_ioctl(struct file *fp, u_long com, void *data, 4304 struct ucred *active_cred, struct thread *td) 4305 { 4306 4307 return (ENOTTY); 4308 } 4309 4310 int 4311 invfo_poll(struct file *fp, int events, struct ucred *active_cred, 4312 struct thread *td) 4313 { 4314 4315 return (poll_no_poll(events)); 4316 } 4317 4318 int 4319 invfo_kqfilter(struct file *fp, struct knote *kn) 4320 { 4321 4322 return (EINVAL); 4323 } 4324 4325 int 4326 invfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred, 4327 struct thread *td) 4328 { 4329 4330 return (EINVAL); 4331 } 4332 4333 int 4334 invfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred, 4335 struct thread *td) 4336 { 4337 4338 return (EINVAL); 4339 } 4340 4341 int 4342 invfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio, 4343 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags, 4344 struct thread *td) 4345 { 4346 4347 return (EINVAL); 4348 } 4349 4350 /*-------------------------------------------------------------------*/ 4351 4352 /* 4353 * File Descriptor pseudo-device driver (/dev/fd/). 4354 * 4355 * Opening minor device N dup()s the file (if any) connected to file 4356 * descriptor N belonging to the calling process. Note that this driver 4357 * consists of only the ``open()'' routine, because all subsequent 4358 * references to this file will be direct to the other driver. 4359 * 4360 * XXX: we could give this one a cloning event handler if necessary. 4361 */ 4362 4363 /* ARGSUSED */ 4364 static int 4365 fdopen(struct cdev *dev, int mode, int type, struct thread *td) 4366 { 4367 4368 /* 4369 * XXX Kludge: set curthread->td_dupfd to contain the value of the 4370 * the file descriptor being sought for duplication. The error 4371 * return ensures that the vnode for this device will be released 4372 * by vn_open. Open will detect this special error and take the 4373 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN 4374 * will simply report the error. 4375 */ 4376 td->td_dupfd = dev2unit(dev); 4377 return (ENODEV); 4378 } 4379 4380 static struct cdevsw fildesc_cdevsw = { 4381 .d_version = D_VERSION, 4382 .d_open = fdopen, 4383 .d_name = "FD", 4384 }; 4385 4386 static void 4387 fildesc_drvinit(void *unused) 4388 { 4389 struct cdev *dev; 4390 4391 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 0, NULL, 4392 UID_ROOT, GID_WHEEL, 0666, "fd/0"); 4393 make_dev_alias(dev, "stdin"); 4394 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 1, NULL, 4395 UID_ROOT, GID_WHEEL, 0666, "fd/1"); 4396 make_dev_alias(dev, "stdout"); 4397 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 2, NULL, 4398 UID_ROOT, GID_WHEEL, 0666, "fd/2"); 4399 make_dev_alias(dev, "stderr"); 4400 } 4401 4402 SYSINIT(fildescdev, SI_SUB_DRIVERS, SI_ORDER_MIDDLE, fildesc_drvinit, NULL); 4403