2 * Copyright (c) 1982, 1986, 1989, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)kern_descrip.c 8.6 (Berkeley) 4/19/94
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
40 #include "opt_capsicum.h"
41 #include "opt_compat.h"
43 #include "opt_ktrace.h"
44 #include "opt_procdesc.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
49 #include <sys/capability.h>
51 #include <sys/domain.h>
52 #include <sys/fcntl.h>
54 #include <sys/filedesc.h>
55 #include <sys/filio.h>
57 #include <sys/kernel.h>
59 #include <sys/limits.h>
61 #include <sys/malloc.h>
63 #include <sys/mount.h>
64 #include <sys/mqueue.h>
65 #include <sys/mutex.h>
66 #include <sys/namei.h>
67 #include <sys/selinfo.h>
71 #include <sys/procdesc.h>
72 #include <sys/protosw.h>
73 #include <sys/racct.h>
74 #include <sys/resourcevar.h>
76 #include <sys/signalvar.h>
77 #include <sys/socketvar.h>
80 #include <sys/syscallsubr.h>
81 #include <sys/sysctl.h>
82 #include <sys/sysproto.h>
84 #include <sys/unistd.h>
86 #include <sys/unpcb.h>
88 #include <sys/vnode.h>
90 #include <sys/ktrace.h>
95 #include <netinet/in.h>
96 #include <netinet/in_pcb.h>
98 #include <security/audit/audit.h>
105 static MALLOC_DEFINE(M_FILEDESC, "filedesc", "Open file descriptor table");
106 static MALLOC_DEFINE(M_FILEDESC_TO_LEADER, "filedesc_to_leader",
107 "file desc to leader structures");
108 static MALLOC_DEFINE(M_SIGIO, "sigio", "sigio structures");
109 MALLOC_DEFINE(M_FILECAPS, "filecaps", "descriptor capabilities");
111 MALLOC_DECLARE(M_FADVISE);
113 static uma_zone_t file_zone;
115 void (*ksem_info)(struct ksem *ks, char *path, size_t size, uint32_t *value);
117 static int closefp(struct filedesc *fdp, int fd, struct file *fp,
118 struct thread *td, int holdleaders);
119 static int fd_first_free(struct filedesc *fdp, int low, int size);
120 static int fd_last_used(struct filedesc *fdp, int size);
121 static void fdgrowtable(struct filedesc *fdp, int nfd);
122 static void fdgrowtable_exp(struct filedesc *fdp, int nfd);
123 static void fdunused(struct filedesc *fdp, int fd);
124 static void fdused(struct filedesc *fdp, int fd);
125 static int fill_pipe_info(struct pipe *pi, struct kinfo_file *kif);
126 static int fill_procdesc_info(struct procdesc *pdp,
127 struct kinfo_file *kif);
128 static int fill_pts_info(struct tty *tp, struct kinfo_file *kif);
129 static int fill_sem_info(struct file *fp, struct kinfo_file *kif);
130 static int fill_shm_info(struct file *fp, struct kinfo_file *kif);
131 static int fill_socket_info(struct socket *so, struct kinfo_file *kif);
132 static int fill_vnode_info(struct vnode *vp, struct kinfo_file *kif);
133 static int getmaxfd(struct proc *p);
138 * - An array of open file descriptors (fd_ofiles)
139 * - An array of file flags (fd_ofileflags)
140 * - A bitmap recording which descriptors are in use (fd_map)
142 * A process starts out with NDFILE descriptors. The value of NDFILE has
143 * been selected based the historical limit of 20 open files, and an
144 * assumption that the majority of processes, especially short-lived
145 * processes like shells, will never need more.
147 * If this initial allocation is exhausted, a larger descriptor table and
148 * map are allocated dynamically, and the pointers in the process's struct
149 * filedesc are updated to point to those. This is repeated every time
150 * the process runs out of file descriptors (provided it hasn't hit its
153 * Since threads may hold references to individual descriptor table
154 * entries, the tables are never freed. Instead, they are placed on a
155 * linked list and freed only when the struct filedesc is released.
158 #define NDSLOTSIZE sizeof(NDSLOTTYPE)
159 #define NDENTRIES (NDSLOTSIZE * __CHAR_BIT)
160 #define NDSLOT(x) ((x) / NDENTRIES)
161 #define NDBIT(x) ((NDSLOTTYPE)1 << ((x) % NDENTRIES))
162 #define NDSLOTS(x) (((x) + NDENTRIES - 1) / NDENTRIES)
165 * SLIST entry used to keep track of ofiles which must be reclaimed when
169 struct filedescent *ft_table;
170 SLIST_ENTRY(freetable) ft_next;
174 * Initial allocation: a filedesc structure + the head of SLIST used to
175 * keep track of old ofiles + enough space for NDFILE descriptors.
178 struct filedesc fd_fd;
179 SLIST_HEAD(, freetable) fd_free;
180 struct filedescent fd_dfiles[NDFILE];
181 NDSLOTTYPE fd_dmap[NDSLOTS(NDFILE)];
185 * Descriptor management.
187 volatile int openfiles; /* actual number of open files */
188 struct mtx sigio_lock; /* mtx to protect pointers to sigio */
189 void (*mq_fdclose)(struct thread *td, int fd, struct file *fp);
191 /* A mutex to protect the association between a proc and filedesc. */
192 static struct mtx fdesc_mtx;
195 * If low >= size, just return low. Otherwise find the first zero bit in the
196 * given bitmap, starting at low and not exceeding size - 1. Return size if
200 fd_first_free(struct filedesc *fdp, int low, int size)
202 NDSLOTTYPE *map = fdp->fd_map;
210 if (low % NDENTRIES) {
211 mask = ~(~(NDSLOTTYPE)0 >> (NDENTRIES - (low % NDENTRIES)));
212 if ((mask &= ~map[off]) != 0UL)
213 return (off * NDENTRIES + ffsl(mask) - 1);
216 for (maxoff = NDSLOTS(size); off < maxoff; ++off)
217 if (map[off] != ~0UL)
218 return (off * NDENTRIES + ffsl(~map[off]) - 1);
223 * Find the highest non-zero bit in the given bitmap, starting at 0 and
224 * not exceeding size - 1. Return -1 if not found.
227 fd_last_used(struct filedesc *fdp, int size)
229 NDSLOTTYPE *map = fdp->fd_map;
234 if (size % NDENTRIES) {
235 mask = ~(~(NDSLOTTYPE)0 << (size % NDENTRIES));
236 if ((mask &= map[off]) != 0)
237 return (off * NDENTRIES + flsl(mask) - 1);
240 for (minoff = NDSLOT(0); off >= minoff; --off)
242 return (off * NDENTRIES + flsl(map[off]) - 1);
247 fdisused(struct filedesc *fdp, int fd)
250 FILEDESC_LOCK_ASSERT(fdp);
252 KASSERT(fd >= 0 && fd < fdp->fd_nfiles,
253 ("file descriptor %d out of range (0, %d)", fd, fdp->fd_nfiles));
255 return ((fdp->fd_map[NDSLOT(fd)] & NDBIT(fd)) != 0);
259 * Mark a file descriptor as used.
262 fdused(struct filedesc *fdp, int fd)
265 FILEDESC_XLOCK_ASSERT(fdp);
267 KASSERT(!fdisused(fdp, fd), ("fd=%d is already used", fd));
269 fdp->fd_map[NDSLOT(fd)] |= NDBIT(fd);
270 if (fd > fdp->fd_lastfile)
271 fdp->fd_lastfile = fd;
272 if (fd == fdp->fd_freefile)
273 fdp->fd_freefile = fd_first_free(fdp, fd, fdp->fd_nfiles);
277 * Mark a file descriptor as unused.
280 fdunused(struct filedesc *fdp, int fd)
283 FILEDESC_XLOCK_ASSERT(fdp);
285 KASSERT(fdisused(fdp, fd), ("fd=%d is already unused", fd));
286 KASSERT(fdp->fd_ofiles[fd].fde_file == NULL,
287 ("fd=%d is still in use", fd));
289 fdp->fd_map[NDSLOT(fd)] &= ~NDBIT(fd);
290 if (fd < fdp->fd_freefile)
291 fdp->fd_freefile = fd;
292 if (fd == fdp->fd_lastfile)
293 fdp->fd_lastfile = fd_last_used(fdp, fd);
297 * Free a file descriptor.
299 * Avoid some work if fdp is about to be destroyed.
302 _fdfree(struct filedesc *fdp, int fd, int last)
304 struct filedescent *fde;
306 fde = &fdp->fd_ofiles[fd];
307 filecaps_free(&fde->fde_caps);
310 bzero(fde, sizeof(*fde));
315 fdfree(struct filedesc *fdp, int fd)
322 fdfree_last(struct filedesc *fdp, int fd)
329 * System calls on descriptors.
331 #ifndef _SYS_SYSPROTO_H_
332 struct getdtablesize_args {
338 sys_getdtablesize(struct thread *td, struct getdtablesize_args *uap)
340 struct proc *p = td->td_proc;
345 min((int)lim_cur(p, RLIMIT_NOFILE), maxfilesperproc);
346 lim = racct_get_limit(td->td_proc, RACCT_NOFILE);
348 if (lim < td->td_retval[0])
349 td->td_retval[0] = lim;
354 * Duplicate a file descriptor to a particular value.
356 * Note: keep in mind that a potential race condition exists when closing
357 * descriptors from a shared descriptor table (via rfork).
359 #ifndef _SYS_SYSPROTO_H_
367 sys_dup2(struct thread *td, struct dup2_args *uap)
370 return (do_dup(td, DUP_FIXED, (int)uap->from, (int)uap->to,
375 * Duplicate a file descriptor.
377 #ifndef _SYS_SYSPROTO_H_
384 sys_dup(struct thread *td, struct dup_args *uap)
387 return (do_dup(td, 0, (int)uap->fd, 0, td->td_retval));
391 * The file control system call.
393 #ifndef _SYS_SYSPROTO_H_
402 sys_fcntl(struct thread *td, struct fcntl_args *uap)
417 * Convert old flock structure to new.
419 error = copyin((void *)(intptr_t)uap->arg, &ofl, sizeof(ofl));
420 fl.l_start = ofl.l_start;
421 fl.l_len = ofl.l_len;
422 fl.l_pid = ofl.l_pid;
423 fl.l_type = ofl.l_type;
424 fl.l_whence = ofl.l_whence;
444 error = copyin((void *)(intptr_t)uap->arg, &fl, sizeof(fl));
453 error = kern_fcntl(td, uap->fd, cmd, arg);
456 if (uap->cmd == F_OGETLK) {
457 ofl.l_start = fl.l_start;
458 ofl.l_len = fl.l_len;
459 ofl.l_pid = fl.l_pid;
460 ofl.l_type = fl.l_type;
461 ofl.l_whence = fl.l_whence;
462 error = copyout(&ofl, (void *)(intptr_t)uap->arg, sizeof(ofl));
463 } else if (uap->cmd == F_GETLK) {
464 error = copyout(&fl, (void *)(intptr_t)uap->arg, sizeof(fl));
470 kern_fcntl(struct thread *td, int fd, int cmd, intptr_t arg)
472 struct filedesc *fdp;
474 struct file *fp, *fp2;
475 struct filedescent *fde;
492 error = do_dup(td, DUP_FCNTL, fd, tmp, td->td_retval);
495 case F_DUPFD_CLOEXEC:
497 error = do_dup(td, DUP_FCNTL | DUP_CLOEXEC, fd, tmp,
503 error = do_dup(td, DUP_FIXED, fd, tmp, td->td_retval);
506 case F_DUP2FD_CLOEXEC:
508 error = do_dup(td, DUP_FIXED | DUP_CLOEXEC, fd, tmp,
514 if ((fp = fget_locked(fdp, fd)) == NULL) {
515 FILEDESC_SUNLOCK(fdp);
519 fde = &fdp->fd_ofiles[fd];
521 (fde->fde_flags & UF_EXCLOSE) ? FD_CLOEXEC : 0;
522 FILEDESC_SUNLOCK(fdp);
527 if ((fp = fget_locked(fdp, fd)) == NULL) {
528 FILEDESC_XUNLOCK(fdp);
532 fde = &fdp->fd_ofiles[fd];
533 fde->fde_flags = (fde->fde_flags & ~UF_EXCLOSE) |
534 (arg & FD_CLOEXEC ? UF_EXCLOSE : 0);
535 FILEDESC_XUNLOCK(fdp);
539 error = fget_unlocked(fdp, fd,
540 cap_rights_init(&rights, CAP_FCNTL), F_GETFL, &fp, NULL);
543 td->td_retval[0] = OFLAGS(fp->f_flag);
548 error = fget_unlocked(fdp, fd,
549 cap_rights_init(&rights, CAP_FCNTL), F_SETFL, &fp, NULL);
553 tmp = flg = fp->f_flag;
555 tmp |= FFLAGS(arg & ~O_ACCMODE) & FCNTLFLAGS;
556 } while(atomic_cmpset_int(&fp->f_flag, flg, tmp) == 0);
557 tmp = fp->f_flag & FNONBLOCK;
558 error = fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td);
563 tmp = fp->f_flag & FASYNC;
564 error = fo_ioctl(fp, FIOASYNC, &tmp, td->td_ucred, td);
569 atomic_clear_int(&fp->f_flag, FNONBLOCK);
571 (void)fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td);
576 error = fget_unlocked(fdp, fd,
577 cap_rights_init(&rights, CAP_FCNTL), F_GETOWN, &fp, NULL);
580 error = fo_ioctl(fp, FIOGETOWN, &tmp, td->td_ucred, td);
582 td->td_retval[0] = tmp;
587 error = fget_unlocked(fdp, fd,
588 cap_rights_init(&rights, CAP_FCNTL), F_SETOWN, &fp, NULL);
592 error = fo_ioctl(fp, FIOSETOWN, &tmp, td->td_ucred, td);
597 error = priv_check(td, PRIV_NFS_LOCKD);
605 /* FALLTHROUGH F_SETLK */
609 cap_rights_init(&rights, CAP_FLOCK);
610 error = fget_unlocked(fdp, fd, &rights, 0, &fp, NULL);
613 if (fp->f_type != DTYPE_VNODE) {
619 flp = (struct flock *)arg;
620 if (flp->l_whence == SEEK_CUR) {
621 foffset = foffset_get(fp);
624 foffset > OFF_MAX - flp->l_start)) {
625 FILEDESC_SUNLOCK(fdp);
630 flp->l_start += foffset;
634 switch (flp->l_type) {
636 if ((fp->f_flag & FREAD) == 0) {
640 PROC_LOCK(p->p_leader);
641 p->p_leader->p_flag |= P_ADVLOCK;
642 PROC_UNLOCK(p->p_leader);
643 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK,
647 if ((fp->f_flag & FWRITE) == 0) {
651 PROC_LOCK(p->p_leader);
652 p->p_leader->p_flag |= P_ADVLOCK;
653 PROC_UNLOCK(p->p_leader);
654 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK,
658 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_UNLCK,
663 * Temporary api for testing remote lock
666 if (flg != F_REMOTE) {
670 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader,
671 F_UNLCKSYS, flp, flg);
677 if (error != 0 || flp->l_type == F_UNLCK ||
678 flp->l_type == F_UNLCKSYS) {
684 * Check for a race with close.
686 * The vnode is now advisory locked (or unlocked, but this case
687 * is not really important) as the caller requested.
688 * We had to drop the filedesc lock, so we need to recheck if
689 * the descriptor is still valid, because if it was closed
690 * in the meantime we need to remove advisory lock from the
691 * vnode - close on any descriptor leading to an advisory
692 * locked vnode, removes that lock.
693 * We will return 0 on purpose in that case, as the result of
694 * successful advisory lock might have been externally visible
695 * already. This is fine - effectively we pretend to the caller
696 * that the closing thread was a bit slower and that the
697 * advisory lock succeeded before the close.
699 error = fget_unlocked(fdp, fd, &rights, 0, &fp2, NULL);
705 flp->l_whence = SEEK_SET;
708 flp->l_type = F_UNLCK;
709 (void) VOP_ADVLOCK(vp, (caddr_t)p->p_leader,
710 F_UNLCK, flp, F_POSIX);
717 error = fget_unlocked(fdp, fd,
718 cap_rights_init(&rights, CAP_FLOCK), 0, &fp, NULL);
721 if (fp->f_type != DTYPE_VNODE) {
726 flp = (struct flock *)arg;
727 if (flp->l_type != F_RDLCK && flp->l_type != F_WRLCK &&
728 flp->l_type != F_UNLCK) {
733 if (flp->l_whence == SEEK_CUR) {
734 foffset = foffset_get(fp);
735 if ((flp->l_start > 0 &&
736 foffset > OFF_MAX - flp->l_start) ||
738 foffset < OFF_MIN - flp->l_start)) {
739 FILEDESC_SUNLOCK(fdp);
744 flp->l_start += foffset;
747 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_GETLK, flp,
753 arg = arg ? 128 * 1024: 0;
756 error = fget_unlocked(fdp, fd, NULL, 0, &fp, NULL);
759 if (fp->f_type != DTYPE_VNODE) {
766 error = vn_lock(vp, LK_SHARED);
771 bsize = fp->f_vnode->v_mount->mnt_stat.f_iosize;
773 fp->f_seqcount = (arg + bsize - 1) / bsize;
775 new = old = fp->f_flag;
777 } while (!atomic_cmpset_rel_int(&fp->f_flag, old, new));
780 new = old = fp->f_flag;
782 } while (!atomic_cmpset_rel_int(&fp->f_flag, old, new));
795 getmaxfd(struct proc *p)
800 maxfd = min((int)lim_cur(p, RLIMIT_NOFILE), maxfilesperproc);
807 * Common code for dup, dup2, fcntl(F_DUPFD) and fcntl(F_DUP2FD).
810 do_dup(struct thread *td, int flags, int old, int new,
813 struct filedesc *fdp;
814 struct filedescent *oldfde, *newfde;
824 * Verify we have a valid descriptor to dup from and possibly to
825 * dup to. Unlike dup() and dup2(), fcntl()'s F_DUPFD should
826 * return EINVAL when the new descriptor is out of bounds.
831 return (flags & DUP_FCNTL ? EINVAL : EBADF);
834 return (flags & DUP_FCNTL ? EINVAL : EBADF);
837 if (fget_locked(fdp, old) == NULL) {
838 FILEDESC_XUNLOCK(fdp);
841 oldfde = &fdp->fd_ofiles[old];
842 if (flags & DUP_FIXED && old == new) {
844 if (flags & DUP_CLOEXEC)
845 fdp->fd_ofiles[new].fde_flags |= UF_EXCLOSE;
846 FILEDESC_XUNLOCK(fdp);
849 fp = oldfde->fde_file;
853 * If the caller specified a file descriptor, make sure the file
854 * table is large enough to hold it, and grab it. Otherwise, just
855 * allocate a new descriptor the usual way.
857 if (flags & DUP_FIXED) {
858 if (new >= fdp->fd_nfiles) {
860 * The resource limits are here instead of e.g.
861 * fdalloc(), because the file descriptor table may be
862 * shared between processes, so we can't really use
863 * racct_add()/racct_sub(). Instead of counting the
864 * number of actually allocated descriptors, just put
865 * the limit on the size of the file descriptor table.
869 error = racct_set(p, RACCT_NOFILE, new + 1);
872 FILEDESC_XUNLOCK(fdp);
877 fdgrowtable_exp(fdp, new + 1);
878 oldfde = &fdp->fd_ofiles[old];
880 newfde = &fdp->fd_ofiles[new];
881 if (newfde->fde_file == NULL)
884 if ((error = fdalloc(td, new, &new)) != 0) {
885 FILEDESC_XUNLOCK(fdp);
889 newfde = &fdp->fd_ofiles[new];
892 KASSERT(fp == oldfde->fde_file, ("old fd has been modified"));
893 KASSERT(old != new, ("new fd is same as old"));
895 delfp = newfde->fde_file;
898 * Duplicate the source descriptor.
900 filecaps_free(&newfde->fde_caps);
902 filecaps_copy(&oldfde->fde_caps, &newfde->fde_caps);
903 if ((flags & DUP_CLOEXEC) != 0)
904 newfde->fde_flags = oldfde->fde_flags | UF_EXCLOSE;
906 newfde->fde_flags = oldfde->fde_flags & ~UF_EXCLOSE;
910 (void) closefp(fdp, new, delfp, td, 1);
911 /* closefp() drops the FILEDESC lock for us. */
913 FILEDESC_XUNLOCK(fdp);
920 * If sigio is on the list associated with a process or process group,
921 * disable signalling from the device, remove sigio from the list and
925 funsetown(struct sigio **sigiop)
935 *(sigio->sio_myref) = NULL;
936 if ((sigio)->sio_pgid < 0) {
937 struct pgrp *pg = (sigio)->sio_pgrp;
939 SLIST_REMOVE(&sigio->sio_pgrp->pg_sigiolst, sigio,
943 struct proc *p = (sigio)->sio_proc;
945 SLIST_REMOVE(&sigio->sio_proc->p_sigiolst, sigio,
950 crfree(sigio->sio_ucred);
951 free(sigio, M_SIGIO);
955 * Free a list of sigio structures.
956 * We only need to lock the SIGIO_LOCK because we have made ourselves
957 * inaccessible to callers of fsetown and therefore do not need to lock
958 * the proc or pgrp struct for the list manipulation.
961 funsetownlst(struct sigiolst *sigiolst)
967 sigio = SLIST_FIRST(sigiolst);
974 * Every entry of the list should belong
975 * to a single proc or pgrp.
977 if (sigio->sio_pgid < 0) {
978 pg = sigio->sio_pgrp;
979 PGRP_LOCK_ASSERT(pg, MA_NOTOWNED);
980 } else /* if (sigio->sio_pgid > 0) */ {
982 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
986 while ((sigio = SLIST_FIRST(sigiolst)) != NULL) {
987 *(sigio->sio_myref) = NULL;
989 KASSERT(sigio->sio_pgid < 0,
990 ("Proc sigio in pgrp sigio list"));
991 KASSERT(sigio->sio_pgrp == pg,
992 ("Bogus pgrp in sigio list"));
994 SLIST_REMOVE(&pg->pg_sigiolst, sigio, sigio,
997 } else /* if (p != NULL) */ {
998 KASSERT(sigio->sio_pgid > 0,
999 ("Pgrp sigio in proc sigio list"));
1000 KASSERT(sigio->sio_proc == p,
1001 ("Bogus proc in sigio list"));
1003 SLIST_REMOVE(&p->p_sigiolst, sigio, sigio,
1008 crfree(sigio->sio_ucred);
1009 free(sigio, M_SIGIO);
1016 * This is common code for FIOSETOWN ioctl called by fcntl(fd, F_SETOWN, arg).
1018 * After permission checking, add a sigio structure to the sigio list for
1019 * the process or process group.
1022 fsetown(pid_t pgid, struct sigio **sigiop)
1026 struct sigio *sigio;
1036 /* Allocate and fill in the new sigio out of locks. */
1037 sigio = malloc(sizeof(struct sigio), M_SIGIO, M_WAITOK);
1038 sigio->sio_pgid = pgid;
1039 sigio->sio_ucred = crhold(curthread->td_ucred);
1040 sigio->sio_myref = sigiop;
1042 sx_slock(&proctree_lock);
1051 * Policy - Don't allow a process to FSETOWN a process
1052 * in another session.
1054 * Remove this test to allow maximum flexibility or
1055 * restrict FSETOWN to the current process or process
1056 * group for maximum safety.
1059 if (proc->p_session != curthread->td_proc->p_session) {
1065 } else /* if (pgid < 0) */ {
1066 pgrp = pgfind(-pgid);
1074 * Policy - Don't allow a process to FSETOWN a process
1075 * in another session.
1077 * Remove this test to allow maximum flexibility or
1078 * restrict FSETOWN to the current process or process
1079 * group for maximum safety.
1081 if (pgrp->pg_session != curthread->td_proc->p_session) {
1092 * Since funsetownlst() is called without the proctree
1093 * locked, we need to check for P_WEXIT.
1094 * XXX: is ESRCH correct?
1096 if ((proc->p_flag & P_WEXIT) != 0) {
1101 SLIST_INSERT_HEAD(&proc->p_sigiolst, sigio, sio_pgsigio);
1102 sigio->sio_proc = proc;
1106 SLIST_INSERT_HEAD(&pgrp->pg_sigiolst, sigio, sio_pgsigio);
1107 sigio->sio_pgrp = pgrp;
1110 sx_sunlock(&proctree_lock);
1117 sx_sunlock(&proctree_lock);
1118 crfree(sigio->sio_ucred);
1119 free(sigio, M_SIGIO);
1124 * This is common code for FIOGETOWN ioctl called by fcntl(fd, F_GETOWN, arg).
1128 struct sigio **sigiop;
1133 pgid = (*sigiop != NULL) ? (*sigiop)->sio_pgid : 0;
1139 * Function drops the filedesc lock on return.
1142 closefp(struct filedesc *fdp, int fd, struct file *fp, struct thread *td,
1147 FILEDESC_XLOCK_ASSERT(fdp);
1150 if (td->td_proc->p_fdtol != NULL) {
1152 * Ask fdfree() to sleep to ensure that all relevant
1153 * process leaders can be traversed in closef().
1155 fdp->fd_holdleaderscount++;
1162 * We now hold the fp reference that used to be owned by the
1163 * descriptor array. We have to unlock the FILEDESC *AFTER*
1164 * knote_fdclose to prevent a race of the fd getting opened, a knote
1165 * added, and deleteing a knote for the new fd.
1167 knote_fdclose(td, fd);
1170 * We need to notify mqueue if the object is of type mqueue.
1172 if (fp->f_type == DTYPE_MQUEUE)
1173 mq_fdclose(td, fd, fp);
1174 FILEDESC_XUNLOCK(fdp);
1176 error = closef(fp, td);
1178 FILEDESC_XLOCK(fdp);
1179 fdp->fd_holdleaderscount--;
1180 if (fdp->fd_holdleaderscount == 0 &&
1181 fdp->fd_holdleaderswakeup != 0) {
1182 fdp->fd_holdleaderswakeup = 0;
1183 wakeup(&fdp->fd_holdleaderscount);
1185 FILEDESC_XUNLOCK(fdp);
1191 * Close a file descriptor.
1193 #ifndef _SYS_SYSPROTO_H_
1202 struct close_args *uap;
1205 return (kern_close(td, uap->fd));
1213 struct filedesc *fdp;
1216 fdp = td->td_proc->p_fd;
1218 AUDIT_SYSCLOSE(td, fd);
1220 FILEDESC_XLOCK(fdp);
1221 if ((fp = fget_locked(fdp, fd)) == NULL) {
1222 FILEDESC_XUNLOCK(fdp);
1227 /* closefp() drops the FILEDESC lock for us. */
1228 return (closefp(fdp, fd, fp, td, 1));
1232 * Close open file descriptors.
1234 #ifndef _SYS_SYSPROTO_H_
1235 struct closefrom_args {
1241 sys_closefrom(struct thread *td, struct closefrom_args *uap)
1243 struct filedesc *fdp;
1246 fdp = td->td_proc->p_fd;
1247 AUDIT_ARG_FD(uap->lowfd);
1250 * Treat negative starting file descriptor values identical to
1251 * closefrom(0) which closes all files.
1255 FILEDESC_SLOCK(fdp);
1256 for (fd = uap->lowfd; fd <= fdp->fd_lastfile; fd++) {
1257 if (fdp->fd_ofiles[fd].fde_file != NULL) {
1258 FILEDESC_SUNLOCK(fdp);
1259 (void)kern_close(td, fd);
1260 FILEDESC_SLOCK(fdp);
1263 FILEDESC_SUNLOCK(fdp);
1267 #if defined(COMPAT_43)
1269 * Return status information about a file descriptor.
1271 #ifndef _SYS_SYSPROTO_H_
1272 struct ofstat_args {
1279 ofstat(struct thread *td, struct ofstat_args *uap)
1285 error = kern_fstat(td, uap->fd, &ub);
1288 error = copyout(&oub, uap->sb, sizeof(oub));
1292 #endif /* COMPAT_43 */
1295 * Return status information about a file descriptor.
1297 #ifndef _SYS_SYSPROTO_H_
1305 sys_fstat(struct thread *td, struct fstat_args *uap)
1310 error = kern_fstat(td, uap->fd, &ub);
1312 error = copyout(&ub, uap->sb, sizeof(ub));
1317 kern_fstat(struct thread *td, int fd, struct stat *sbp)
1320 cap_rights_t rights;
1325 error = fget(td, fd, cap_rights_init(&rights, CAP_FSTAT), &fp);
1329 AUDIT_ARG_FILE(td->td_proc, fp);
1331 error = fo_stat(fp, sbp, td->td_ucred, td);
1334 if (error == 0 && KTRPOINT(td, KTR_STRUCT))
1341 * Return status information about a file descriptor.
1343 #ifndef _SYS_SYSPROTO_H_
1344 struct nfstat_args {
1351 sys_nfstat(struct thread *td, struct nfstat_args *uap)
1357 error = kern_fstat(td, uap->fd, &ub);
1359 cvtnstat(&ub, &nub);
1360 error = copyout(&nub, uap->sb, sizeof(nub));
1366 * Return pathconf information about a file descriptor.
1368 #ifndef _SYS_SYSPROTO_H_
1369 struct fpathconf_args {
1376 sys_fpathconf(struct thread *td, struct fpathconf_args *uap)
1380 cap_rights_t rights;
1383 error = fget(td, uap->fd, cap_rights_init(&rights, CAP_FPATHCONF), &fp);
1387 /* If asynchronous I/O is available, it works for all descriptors. */
1388 if (uap->name == _PC_ASYNC_IO) {
1389 td->td_retval[0] = async_io_version;
1394 vn_lock(vp, LK_SHARED | LK_RETRY);
1395 error = VOP_PATHCONF(vp, uap->name, td->td_retval);
1397 } else if (fp->f_type == DTYPE_PIPE || fp->f_type == DTYPE_SOCKET) {
1398 if (uap->name != _PC_PIPE_BUF) {
1401 td->td_retval[0] = PIPE_BUF;
1413 * Initialize filecaps structure.
1416 filecaps_init(struct filecaps *fcaps)
1419 bzero(fcaps, sizeof(*fcaps));
1420 fcaps->fc_nioctls = -1;
1424 * Copy filecaps structure allocating memory for ioctls array if needed.
1427 filecaps_copy(const struct filecaps *src, struct filecaps *dst)
1432 if (src->fc_ioctls != NULL) {
1433 KASSERT(src->fc_nioctls > 0,
1434 ("fc_ioctls != NULL, but fc_nioctls=%hd", src->fc_nioctls));
1436 size = sizeof(src->fc_ioctls[0]) * src->fc_nioctls;
1437 dst->fc_ioctls = malloc(size, M_FILECAPS, M_WAITOK);
1438 bcopy(src->fc_ioctls, dst->fc_ioctls, size);
1443 * Move filecaps structure to the new place and clear the old place.
1446 filecaps_move(struct filecaps *src, struct filecaps *dst)
1450 bzero(src, sizeof(*src));
1454 * Fill the given filecaps structure with full rights.
1457 filecaps_fill(struct filecaps *fcaps)
1460 CAP_ALL(&fcaps->fc_rights);
1461 fcaps->fc_ioctls = NULL;
1462 fcaps->fc_nioctls = -1;
1463 fcaps->fc_fcntls = CAP_FCNTL_ALL;
1467 * Free memory allocated within filecaps structure.
1470 filecaps_free(struct filecaps *fcaps)
1473 free(fcaps->fc_ioctls, M_FILECAPS);
1474 bzero(fcaps, sizeof(*fcaps));
1478 * Validate the given filecaps structure.
1481 filecaps_validate(const struct filecaps *fcaps, const char *func)
1484 KASSERT(cap_rights_is_valid(&fcaps->fc_rights),
1485 ("%s: invalid rights", func));
1486 KASSERT((fcaps->fc_fcntls & ~CAP_FCNTL_ALL) == 0,
1487 ("%s: invalid fcntls", func));
1488 KASSERT(fcaps->fc_fcntls == 0 ||
1489 cap_rights_is_set(&fcaps->fc_rights, CAP_FCNTL),
1490 ("%s: fcntls without CAP_FCNTL", func));
1491 KASSERT(fcaps->fc_ioctls != NULL ? fcaps->fc_nioctls > 0 :
1492 (fcaps->fc_nioctls == -1 || fcaps->fc_nioctls == 0),
1493 ("%s: invalid ioctls", func));
1494 KASSERT(fcaps->fc_nioctls == 0 ||
1495 cap_rights_is_set(&fcaps->fc_rights, CAP_IOCTL),
1496 ("%s: ioctls without CAP_IOCTL", func));
1500 fdgrowtable_exp(struct filedesc *fdp, int nfd)
1504 FILEDESC_XLOCK_ASSERT(fdp);
1506 nfd1 = fdp->fd_nfiles * 2;
1509 fdgrowtable(fdp, nfd1);
1513 * Grow the file table to accomodate (at least) nfd descriptors.
1516 fdgrowtable(struct filedesc *fdp, int nfd)
1518 struct filedesc0 *fdp0;
1519 struct freetable *ft;
1520 struct filedescent *ntable;
1521 struct filedescent *otable;
1522 int nnfiles, onfiles;
1523 NDSLOTTYPE *nmap, *omap;
1525 FILEDESC_XLOCK_ASSERT(fdp);
1527 KASSERT(fdp->fd_nfiles > 0, ("zero-length file table"));
1529 /* save old values */
1530 onfiles = fdp->fd_nfiles;
1531 otable = fdp->fd_ofiles;
1534 /* compute the size of the new table */
1535 nnfiles = NDSLOTS(nfd) * NDENTRIES; /* round up */
1536 if (nnfiles <= onfiles)
1537 /* the table is already large enough */
1541 * Allocate a new table. We need enough space for the
1542 * file entries themselves and the struct freetable we will use
1543 * when we decommission the table and place it on the freelist.
1544 * We place the struct freetable in the middle so we don't have
1545 * to worry about padding.
1547 ntable = malloc(nnfiles * sizeof(ntable[0]) + sizeof(struct freetable),
1548 M_FILEDESC, M_ZERO | M_WAITOK);
1549 /* copy the old data over and point at the new tables */
1550 memcpy(ntable, otable, onfiles * sizeof(*otable));
1551 fdp->fd_ofiles = ntable;
1554 * Allocate a new map only if the old is not large enough. It will
1555 * grow at a slower rate than the table as it can map more
1556 * entries than the table can hold.
1558 if (NDSLOTS(nnfiles) > NDSLOTS(onfiles)) {
1559 nmap = malloc(NDSLOTS(nnfiles) * NDSLOTSIZE, M_FILEDESC,
1561 /* copy over the old data and update the pointer */
1562 memcpy(nmap, omap, NDSLOTS(onfiles) * sizeof(*omap));
1567 * In order to have a valid pattern for fget_unlocked()
1568 * fdp->fd_nfiles must be the last member to be updated, otherwise
1569 * fget_unlocked() consumers may reference a new, higher value for
1570 * fdp->fd_nfiles before to access the fdp->fd_ofiles array,
1571 * resulting in OOB accesses.
1573 atomic_store_rel_int(&fdp->fd_nfiles, nnfiles);
1576 * Do not free the old file table, as some threads may still
1577 * reference entries within it. Instead, place it on a freelist
1578 * which will be processed when the struct filedesc is released.
1580 * Note that if onfiles == NDFILE, we're dealing with the original
1581 * static allocation contained within (struct filedesc0 *)fdp,
1582 * which must not be freed.
1584 if (onfiles > NDFILE) {
1585 ft = (struct freetable *)&otable[onfiles];
1586 fdp0 = (struct filedesc0 *)fdp;
1587 ft->ft_table = otable;
1588 SLIST_INSERT_HEAD(&fdp0->fd_free, ft, ft_next);
1591 * The map does not have the same possibility of threads still
1592 * holding references to it. So always free it as long as it
1593 * does not reference the original static allocation.
1595 if (NDSLOTS(onfiles) > NDSLOTS(NDFILE))
1596 free(omap, M_FILEDESC);
1600 * Allocate a file descriptor for the process.
1603 fdalloc(struct thread *td, int minfd, int *result)
1605 struct proc *p = td->td_proc;
1606 struct filedesc *fdp = p->p_fd;
1607 int fd = -1, maxfd, allocfd;
1612 FILEDESC_XLOCK_ASSERT(fdp);
1614 if (fdp->fd_freefile > minfd)
1615 minfd = fdp->fd_freefile;
1617 maxfd = getmaxfd(p);
1620 * Search the bitmap for a free descriptor starting at minfd.
1621 * If none is found, grow the file table.
1623 fd = fd_first_free(fdp, minfd, fdp->fd_nfiles);
1626 if (fd >= fdp->fd_nfiles) {
1627 allocfd = min(fd * 2, maxfd);
1630 error = racct_set(p, RACCT_NOFILE, allocfd);
1636 * fd is already equal to first free descriptor >= minfd, so
1637 * we only need to grow the table and we are done.
1639 fdgrowtable_exp(fdp, allocfd);
1643 * Perform some sanity checks, then mark the file descriptor as
1644 * used and return it to the caller.
1646 KASSERT(fd >= 0 && fd < min(maxfd, fdp->fd_nfiles),
1647 ("invalid descriptor %d", fd));
1648 KASSERT(!fdisused(fdp, fd),
1649 ("fd_first_free() returned non-free descriptor"));
1650 KASSERT(fdp->fd_ofiles[fd].fde_file == NULL,
1651 ("file descriptor isn't free"));
1652 KASSERT(fdp->fd_ofiles[fd].fde_flags == 0, ("file flags are set"));
1659 * Allocate n file descriptors for the process.
1662 fdallocn(struct thread *td, int minfd, int *fds, int n)
1664 struct proc *p = td->td_proc;
1665 struct filedesc *fdp = p->p_fd;
1668 FILEDESC_XLOCK_ASSERT(fdp);
1670 if (!fdavail(td, n))
1673 for (i = 0; i < n; i++)
1674 if (fdalloc(td, 0, &fds[i]) != 0)
1678 for (i--; i >= 0; i--)
1679 fdunused(fdp, fds[i]);
1687 * Check to see whether n user file descriptors are available to the process
1691 fdavail(struct thread *td, int n)
1693 struct proc *p = td->td_proc;
1694 struct filedesc *fdp = td->td_proc->p_fd;
1697 FILEDESC_LOCK_ASSERT(fdp);
1700 * XXX: This is only called from uipc_usrreq.c:unp_externalize();
1701 * call racct_add() from there instead of dealing with containers
1705 if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0)
1707 last = min(fdp->fd_nfiles, lim);
1708 for (i = fdp->fd_freefile; i < last; i++) {
1709 if (fdp->fd_ofiles[i].fde_file == NULL && --n <= 0)
1716 * Create a new open file structure and allocate a file decriptor for the
1717 * process that refers to it. We add one reference to the file for the
1718 * descriptor table and one reference for resultfp. This is to prevent us
1719 * being preempted and the entry in the descriptor table closed after we
1720 * release the FILEDESC lock.
1723 falloc(struct thread *td, struct file **resultfp, int *resultfd, int flags)
1728 error = falloc_noinstall(td, &fp);
1730 return (error); /* no reference held on error */
1732 error = finstall(td, fp, &fd, flags, NULL);
1734 fdrop(fp, td); /* one reference (fp only) */
1738 if (resultfp != NULL)
1739 *resultfp = fp; /* copy out result */
1741 fdrop(fp, td); /* release local reference */
1743 if (resultfd != NULL)
1750 * Create a new open file structure without allocating a file descriptor.
1753 falloc_noinstall(struct thread *td, struct file **resultfp)
1756 int maxuserfiles = maxfiles - (maxfiles / 20);
1757 static struct timeval lastfail;
1760 KASSERT(resultfp != NULL, ("%s: resultfp == NULL", __func__));
1762 if ((openfiles >= maxuserfiles &&
1763 priv_check(td, PRIV_MAXFILES) != 0) ||
1764 openfiles >= maxfiles) {
1765 if (ppsratecheck(&lastfail, &curfail, 1)) {
1766 printf("kern.maxfiles limit exceeded by uid %i, "
1767 "please see tuning(7).\n", td->td_ucred->cr_ruid);
1771 atomic_add_int(&openfiles, 1);
1772 fp = uma_zalloc(file_zone, M_WAITOK | M_ZERO);
1773 refcount_init(&fp->f_count, 1);
1774 fp->f_cred = crhold(td->td_ucred);
1775 fp->f_ops = &badfileops;
1783 * Install a file in a file descriptor table.
1786 finstall(struct thread *td, struct file *fp, int *fd, int flags,
1787 struct filecaps *fcaps)
1789 struct filedesc *fdp = td->td_proc->p_fd;
1790 struct filedescent *fde;
1793 KASSERT(fd != NULL, ("%s: fd == NULL", __func__));
1794 KASSERT(fp != NULL, ("%s: fp == NULL", __func__));
1796 filecaps_validate(fcaps, __func__);
1798 FILEDESC_XLOCK(fdp);
1799 if ((error = fdalloc(td, 0, fd))) {
1800 FILEDESC_XUNLOCK(fdp);
1804 fde = &fdp->fd_ofiles[*fd];
1806 if ((flags & O_CLOEXEC) != 0)
1807 fde->fde_flags |= UF_EXCLOSE;
1809 filecaps_move(fcaps, &fde->fde_caps);
1811 filecaps_fill(&fde->fde_caps);
1812 FILEDESC_XUNLOCK(fdp);
1817 * Build a new filedesc structure from another.
1818 * Copy the current, root, and jail root vnode references.
1821 fdinit(struct filedesc *fdp)
1823 struct filedesc0 *newfdp;
1825 newfdp = malloc(sizeof *newfdp, M_FILEDESC, M_WAITOK | M_ZERO);
1826 FILEDESC_LOCK_INIT(&newfdp->fd_fd);
1828 FILEDESC_SLOCK(fdp);
1829 newfdp->fd_fd.fd_cdir = fdp->fd_cdir;
1830 if (newfdp->fd_fd.fd_cdir)
1831 VREF(newfdp->fd_fd.fd_cdir);
1832 newfdp->fd_fd.fd_rdir = fdp->fd_rdir;
1833 if (newfdp->fd_fd.fd_rdir)
1834 VREF(newfdp->fd_fd.fd_rdir);
1835 newfdp->fd_fd.fd_jdir = fdp->fd_jdir;
1836 if (newfdp->fd_fd.fd_jdir)
1837 VREF(newfdp->fd_fd.fd_jdir);
1838 FILEDESC_SUNLOCK(fdp);
1841 /* Create the file descriptor table. */
1842 newfdp->fd_fd.fd_refcnt = 1;
1843 newfdp->fd_fd.fd_holdcnt = 1;
1844 newfdp->fd_fd.fd_cmask = CMASK;
1845 newfdp->fd_fd.fd_ofiles = newfdp->fd_dfiles;
1846 newfdp->fd_fd.fd_nfiles = NDFILE;
1847 newfdp->fd_fd.fd_map = newfdp->fd_dmap;
1848 newfdp->fd_fd.fd_lastfile = -1;
1849 return (&newfdp->fd_fd);
1852 static struct filedesc *
1853 fdhold(struct proc *p)
1855 struct filedesc *fdp;
1857 mtx_lock(&fdesc_mtx);
1861 mtx_unlock(&fdesc_mtx);
1866 fddrop(struct filedesc *fdp)
1868 struct filedesc0 *fdp0;
1869 struct freetable *ft;
1872 mtx_lock(&fdesc_mtx);
1873 i = --fdp->fd_holdcnt;
1874 mtx_unlock(&fdesc_mtx);
1878 FILEDESC_LOCK_DESTROY(fdp);
1879 fdp0 = (struct filedesc0 *)fdp;
1880 while ((ft = SLIST_FIRST(&fdp0->fd_free)) != NULL) {
1881 SLIST_REMOVE_HEAD(&fdp0->fd_free, ft_next);
1882 free(ft->ft_table, M_FILEDESC);
1884 free(fdp, M_FILEDESC);
1888 * Share a filedesc structure.
1891 fdshare(struct filedesc *fdp)
1894 FILEDESC_XLOCK(fdp);
1896 FILEDESC_XUNLOCK(fdp);
1901 * Unshare a filedesc structure, if necessary by making a copy
1904 fdunshare(struct thread *td)
1906 struct filedesc *tmp;
1907 struct proc *p = td->td_proc;
1909 if (p->p_fd->fd_refcnt == 1)
1912 tmp = fdcopy(p->p_fd);
1918 * Copy a filedesc structure. A NULL pointer in returns a NULL reference,
1919 * this is to ease callers, not catch errors.
1922 fdcopy(struct filedesc *fdp)
1924 struct filedesc *newfdp;
1925 struct filedescent *nfde, *ofde;
1928 /* Certain daemons might not have file descriptors. */
1932 newfdp = fdinit(fdp);
1933 FILEDESC_SLOCK(fdp);
1934 while (fdp->fd_lastfile >= newfdp->fd_nfiles) {
1935 FILEDESC_SUNLOCK(fdp);
1936 FILEDESC_XLOCK(newfdp);
1937 fdgrowtable(newfdp, fdp->fd_lastfile + 1);
1938 FILEDESC_XUNLOCK(newfdp);
1939 FILEDESC_SLOCK(fdp);
1941 /* copy all passable descriptors (i.e. not kqueue) */
1942 newfdp->fd_freefile = -1;
1943 for (i = 0; i <= fdp->fd_lastfile; ++i) {
1944 ofde = &fdp->fd_ofiles[i];
1945 if (fdisused(fdp, i) &&
1946 (ofde->fde_file->f_ops->fo_flags & DFLAG_PASSABLE) &&
1947 ofde->fde_file->f_ops != &badfileops) {
1948 nfde = &newfdp->fd_ofiles[i];
1950 filecaps_copy(&ofde->fde_caps, &nfde->fde_caps);
1951 fhold(nfde->fde_file);
1952 newfdp->fd_lastfile = i;
1954 if (newfdp->fd_freefile == -1)
1955 newfdp->fd_freefile = i;
1958 newfdp->fd_cmask = fdp->fd_cmask;
1959 FILEDESC_SUNLOCK(fdp);
1960 FILEDESC_XLOCK(newfdp);
1961 for (i = 0; i <= newfdp->fd_lastfile; ++i) {
1962 if (newfdp->fd_ofiles[i].fde_file != NULL)
1965 if (newfdp->fd_freefile == -1)
1966 newfdp->fd_freefile = i;
1967 FILEDESC_XUNLOCK(newfdp);
1972 * Release a filedesc structure.
1975 fdescfree(struct thread *td)
1977 struct filedesc *fdp;
1979 struct filedesc_to_leader *fdtol;
1981 struct vnode *cdir, *jdir, *rdir, *vp;
1984 /* Certain daemons might not have file descriptors. */
1985 fdp = td->td_proc->p_fd;
1990 PROC_LOCK(td->td_proc);
1991 racct_set(td->td_proc, RACCT_NOFILE, 0);
1992 PROC_UNLOCK(td->td_proc);
1995 /* Check for special need to clear POSIX style locks */
1996 fdtol = td->td_proc->p_fdtol;
1997 if (fdtol != NULL) {
1998 FILEDESC_XLOCK(fdp);
1999 KASSERT(fdtol->fdl_refcount > 0,
2000 ("filedesc_to_refcount botch: fdl_refcount=%d",
2001 fdtol->fdl_refcount));
2002 if (fdtol->fdl_refcount == 1 &&
2003 (td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
2004 for (i = 0; i <= fdp->fd_lastfile; i++) {
2005 fp = fdp->fd_ofiles[i].fde_file;
2006 if (fp == NULL || fp->f_type != DTYPE_VNODE)
2009 FILEDESC_XUNLOCK(fdp);
2010 lf.l_whence = SEEK_SET;
2013 lf.l_type = F_UNLCK;
2015 (void) VOP_ADVLOCK(vp,
2016 (caddr_t)td->td_proc->p_leader, F_UNLCK,
2018 FILEDESC_XLOCK(fdp);
2023 if (fdtol->fdl_refcount == 1) {
2024 if (fdp->fd_holdleaderscount > 0 &&
2025 (td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
2027 * close() or do_dup() has cleared a reference
2028 * in a shared file descriptor table.
2030 fdp->fd_holdleaderswakeup = 1;
2031 sx_sleep(&fdp->fd_holdleaderscount,
2032 FILEDESC_LOCK(fdp), PLOCK, "fdlhold", 0);
2035 if (fdtol->fdl_holdcount > 0) {
2037 * Ensure that fdtol->fdl_leader remains
2038 * valid in closef().
2040 fdtol->fdl_wakeup = 1;
2041 sx_sleep(fdtol, FILEDESC_LOCK(fdp), PLOCK,
2046 fdtol->fdl_refcount--;
2047 if (fdtol->fdl_refcount == 0 &&
2048 fdtol->fdl_holdcount == 0) {
2049 fdtol->fdl_next->fdl_prev = fdtol->fdl_prev;
2050 fdtol->fdl_prev->fdl_next = fdtol->fdl_next;
2053 td->td_proc->p_fdtol = NULL;
2054 FILEDESC_XUNLOCK(fdp);
2056 free(fdtol, M_FILEDESC_TO_LEADER);
2059 mtx_lock(&fdesc_mtx);
2060 td->td_proc->p_fd = NULL;
2061 mtx_unlock(&fdesc_mtx);
2063 FILEDESC_XLOCK(fdp);
2064 i = --fdp->fd_refcnt;
2066 FILEDESC_XUNLOCK(fdp);
2070 cdir = fdp->fd_cdir;
2071 fdp->fd_cdir = NULL;
2072 rdir = fdp->fd_rdir;
2073 fdp->fd_rdir = NULL;
2074 jdir = fdp->fd_jdir;
2075 fdp->fd_jdir = NULL;
2076 FILEDESC_XUNLOCK(fdp);
2078 for (i = 0; i <= fdp->fd_lastfile; i++) {
2079 fp = fdp->fd_ofiles[i].fde_file;
2081 fdfree_last(fdp, i);
2082 (void) closef(fp, td);
2086 if (fdp->fd_nfiles > NDFILE)
2087 free(fdp->fd_ofiles, M_FILEDESC);
2088 if (NDSLOTS(fdp->fd_nfiles) > NDSLOTS(NDFILE))
2089 free(fdp->fd_map, M_FILEDESC);
2102 * For setugid programs, we don't want to people to use that setugidness
2103 * to generate error messages which write to a file which otherwise would
2104 * otherwise be off-limits to the process. We check for filesystems where
2105 * the vnode can change out from under us after execve (like [lin]procfs).
2107 * Since setugidsafety calls this only for fd 0, 1 and 2, this check is
2108 * sufficient. We also don't check for setugidness since we know we are.
2111 is_unsafe(struct file *fp)
2113 if (fp->f_type == DTYPE_VNODE) {
2114 struct vnode *vp = fp->f_vnode;
2116 if ((vp->v_vflag & VV_PROCDEP) != 0)
2123 * Make this setguid thing safe, if at all possible.
2126 setugidsafety(struct thread *td)
2128 struct filedesc *fdp;
2132 fdp = td->td_proc->p_fd;
2133 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared"));
2134 FILEDESC_XLOCK(fdp);
2135 for (i = 0; i <= fdp->fd_lastfile; i++) {
2138 fp = fdp->fd_ofiles[i].fde_file;
2139 if (fp != NULL && is_unsafe(fp)) {
2140 knote_fdclose(td, i);
2142 * NULL-out descriptor prior to close to avoid
2143 * a race while close blocks.
2146 FILEDESC_XUNLOCK(fdp);
2147 (void) closef(fp, td);
2148 FILEDESC_XLOCK(fdp);
2151 FILEDESC_XUNLOCK(fdp);
2155 * If a specific file object occupies a specific file descriptor, close the
2156 * file descriptor entry and drop a reference on the file object. This is a
2157 * convenience function to handle a subsequent error in a function that calls
2158 * falloc() that handles the race that another thread might have closed the
2159 * file descriptor out from under the thread creating the file object.
2162 fdclose(struct filedesc *fdp, struct file *fp, int idx, struct thread *td)
2165 FILEDESC_XLOCK(fdp);
2166 if (fdp->fd_ofiles[idx].fde_file == fp) {
2168 FILEDESC_XUNLOCK(fdp);
2171 FILEDESC_XUNLOCK(fdp);
2175 * Close any files on exec?
2178 fdcloseexec(struct thread *td)
2180 struct filedesc *fdp;
2181 struct filedescent *fde;
2185 fdp = td->td_proc->p_fd;
2186 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared"));
2187 FILEDESC_XLOCK(fdp);
2188 for (i = 0; i <= fdp->fd_lastfile; i++) {
2189 fde = &fdp->fd_ofiles[i];
2191 if (fp != NULL && (fp->f_type == DTYPE_MQUEUE ||
2192 (fde->fde_flags & UF_EXCLOSE))) {
2194 (void) closefp(fdp, i, fp, td, 0);
2195 /* closefp() drops the FILEDESC lock. */
2196 FILEDESC_XLOCK(fdp);
2199 FILEDESC_XUNLOCK(fdp);
2203 * It is unsafe for set[ug]id processes to be started with file
2204 * descriptors 0..2 closed, as these descriptors are given implicit
2205 * significance in the Standard C library. fdcheckstd() will create a
2206 * descriptor referencing /dev/null for each of stdin, stdout, and
2207 * stderr that is not already open.
2210 fdcheckstd(struct thread *td)
2212 struct filedesc *fdp;
2213 register_t retval, save;
2214 int i, error, devnull;
2216 fdp = td->td_proc->p_fd;
2217 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared"));
2220 for (i = 0; i < 3; i++) {
2221 if (fdp->fd_ofiles[i].fde_file != NULL)
2224 save = td->td_retval[0];
2225 error = kern_open(td, "/dev/null", UIO_SYSSPACE,
2227 devnull = td->td_retval[0];
2228 td->td_retval[0] = save;
2231 KASSERT(devnull == i, ("oof, we didn't get our fd"));
2233 error = do_dup(td, DUP_FIXED, devnull, i, &retval);
2242 * Internal form of close. Decrement reference count on file structure.
2243 * Note: td may be NULL when closing a file that was being passed in a
2246 * XXXRW: Giant is not required for the caller, but often will be held; this
2247 * makes it moderately likely the Giant will be recursed in the VFS case.
2250 closef(struct file *fp, struct thread *td)
2254 struct filedesc_to_leader *fdtol;
2255 struct filedesc *fdp;
2258 * POSIX record locking dictates that any close releases ALL
2259 * locks owned by this process. This is handled by setting
2260 * a flag in the unlock to free ONLY locks obeying POSIX
2261 * semantics, and not to free BSD-style file locks.
2262 * If the descriptor was in a message, POSIX-style locks
2263 * aren't passed with the descriptor, and the thread pointer
2264 * will be NULL. Callers should be careful only to pass a
2265 * NULL thread pointer when there really is no owning
2266 * context that might have locks, or the locks will be
2269 if (fp->f_type == DTYPE_VNODE && td != NULL) {
2271 if ((td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
2272 lf.l_whence = SEEK_SET;
2275 lf.l_type = F_UNLCK;
2276 (void) VOP_ADVLOCK(vp, (caddr_t)td->td_proc->p_leader,
2277 F_UNLCK, &lf, F_POSIX);
2279 fdtol = td->td_proc->p_fdtol;
2280 if (fdtol != NULL) {
2282 * Handle special case where file descriptor table is
2283 * shared between multiple process leaders.
2285 fdp = td->td_proc->p_fd;
2286 FILEDESC_XLOCK(fdp);
2287 for (fdtol = fdtol->fdl_next;
2288 fdtol != td->td_proc->p_fdtol;
2289 fdtol = fdtol->fdl_next) {
2290 if ((fdtol->fdl_leader->p_flag &
2293 fdtol->fdl_holdcount++;
2294 FILEDESC_XUNLOCK(fdp);
2295 lf.l_whence = SEEK_SET;
2298 lf.l_type = F_UNLCK;
2300 (void) VOP_ADVLOCK(vp,
2301 (caddr_t)fdtol->fdl_leader, F_UNLCK, &lf,
2303 FILEDESC_XLOCK(fdp);
2304 fdtol->fdl_holdcount--;
2305 if (fdtol->fdl_holdcount == 0 &&
2306 fdtol->fdl_wakeup != 0) {
2307 fdtol->fdl_wakeup = 0;
2311 FILEDESC_XUNLOCK(fdp);
2314 return (fdrop(fp, td));
2318 * Initialize the file pointer with the specified properties.
2320 * The ops are set with release semantics to be certain that the flags, type,
2321 * and data are visible when ops is. This is to prevent ops methods from being
2322 * called with bad data.
2325 finit(struct file *fp, u_int flag, short type, void *data, struct fileops *ops)
2330 atomic_store_rel_ptr((volatile uintptr_t *)&fp->f_ops, (uintptr_t)ops);
2334 fget_unlocked(struct filedesc *fdp, int fd, cap_rights_t *needrightsp,
2335 int needfcntl, struct file **fpp, cap_rights_t *haverightsp)
2340 cap_rights_t haverights;
2345 * Avoid reads reordering and then a first access to the
2346 * fdp->fd_ofiles table which could result in OOB operation.
2348 if (fd < 0 || fd >= atomic_load_acq_int(&fdp->fd_nfiles))
2351 * Fetch the descriptor locklessly. We avoid fdrop() races by
2352 * never raising a refcount above 0. To accomplish this we have
2353 * to use a cmpset loop rather than an atomic_add. The descriptor
2354 * must be re-verified once we acquire a reference to be certain
2355 * that the identity is still correct and we did not lose a race
2356 * due to preemption.
2359 fp = fdp->fd_ofiles[fd].fde_file;
2363 haverights = *cap_rights(fdp, fd);
2364 if (needrightsp != NULL) {
2365 error = cap_check(&haverights, needrightsp);
2368 if (cap_rights_is_set(needrightsp, CAP_FCNTL)) {
2369 error = cap_fcntl_check(fdp, fd, needfcntl);
2375 count = fp->f_count;
2379 * Use an acquire barrier to prevent caching of fd_ofiles
2380 * so it is refreshed for verification.
2382 if (atomic_cmpset_acq_int(&fp->f_count, count, count + 1) != 1)
2384 if (fp == fdp->fd_ofiles[fd].fde_file)
2386 fdrop(fp, curthread);
2389 if (haverightsp != NULL) {
2391 *haverightsp = haverights;
2393 CAP_ALL(haverightsp);
2400 * Extract the file pointer associated with the specified descriptor for the
2401 * current user process.
2403 * If the descriptor doesn't exist or doesn't match 'flags', EBADF is
2406 * File's rights will be checked against the capability rights mask.
2408 * If an error occured the non-zero error is returned and *fpp is set to
2409 * NULL. Otherwise *fpp is held and set and zero is returned. Caller is
2410 * responsible for fdrop().
2413 _fget(struct thread *td, int fd, struct file **fpp, int flags,
2414 cap_rights_t *needrightsp, u_char *maxprotp)
2416 struct filedesc *fdp;
2418 cap_rights_t haverights, needrights;
2422 if (td == NULL || (fdp = td->td_proc->p_fd) == NULL)
2424 if (needrightsp != NULL)
2425 needrights = *needrightsp;
2427 cap_rights_init(&needrights);
2428 if (maxprotp != NULL)
2429 cap_rights_set(&needrights, CAP_MMAP);
2430 error = fget_unlocked(fdp, fd, &needrights, 0, &fp, &haverights);
2433 if (fp->f_ops == &badfileops) {
2440 * If requested, convert capability rights to access flags.
2442 if (maxprotp != NULL)
2443 *maxprotp = cap_rights_to_vmprot(&haverights);
2444 #else /* !CAPABILITIES */
2445 if (maxprotp != NULL)
2446 *maxprotp = VM_PROT_ALL;
2447 #endif /* CAPABILITIES */
2450 * FREAD and FWRITE failure return EBADF as per POSIX.
2456 if ((fp->f_flag & flags) == 0)
2460 if ((fp->f_flag & (FREAD | FEXEC)) == 0 ||
2461 ((fp->f_flag & FWRITE) != 0))
2467 KASSERT(0, ("wrong flags"));
2480 fget(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2483 return(_fget(td, fd, fpp, 0, rightsp, NULL));
2487 fget_mmap(struct thread *td, int fd, cap_rights_t *rightsp, u_char *maxprotp,
2491 return (_fget(td, fd, fpp, 0, rightsp, maxprotp));
2495 fget_read(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2498 return(_fget(td, fd, fpp, FREAD, rightsp, NULL));
2502 fget_write(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2505 return (_fget(td, fd, fpp, FWRITE, rightsp, NULL));
2509 * Like fget() but loads the underlying vnode, or returns an error if the
2510 * descriptor does not represent a vnode. Note that pipes use vnodes but
2511 * never have VM objects. The returned vnode will be vref()'d.
2513 * XXX: what about the unused flags ?
2516 _fgetvp(struct thread *td, int fd, int flags, cap_rights_t *needrightsp,
2523 error = _fget(td, fd, &fp, flags, needrightsp, NULL);
2526 if (fp->f_vnode == NULL) {
2538 fgetvp(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2541 return (_fgetvp(td, fd, 0, rightsp, vpp));
2545 fgetvp_rights(struct thread *td, int fd, cap_rights_t *needrightsp,
2546 struct filecaps *havecaps, struct vnode **vpp)
2548 struct filedesc *fdp;
2554 if (td == NULL || (fdp = td->td_proc->p_fd) == NULL)
2557 fp = fget_locked(fdp, fd);
2558 if (fp == NULL || fp->f_ops == &badfileops)
2562 if (needrightsp != NULL) {
2563 error = cap_check(cap_rights(fdp, fd), needrightsp);
2569 if (fp->f_vnode == NULL)
2574 filecaps_copy(&fdp->fd_ofiles[fd].fde_caps, havecaps);
2580 fgetvp_read(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2583 return (_fgetvp(td, fd, FREAD, rightsp, vpp));
2587 fgetvp_exec(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2590 return (_fgetvp(td, fd, FEXEC, rightsp, vpp));
2595 fgetvp_write(struct thread *td, int fd, cap_rights_t *rightsp,
2599 return (_fgetvp(td, fd, FWRITE, rightsp, vpp));
2604 * Like fget() but loads the underlying socket, or returns an error if the
2605 * descriptor does not represent a socket.
2607 * We bump the ref count on the returned socket. XXX Also obtain the SX lock
2610 * Note: fgetsock() and fputsock() are deprecated, as consumers should rely
2611 * on their file descriptor reference to prevent the socket from being free'd
2615 fgetsock(struct thread *td, int fd, cap_rights_t *rightsp, struct socket **spp,
2624 if ((error = _fget(td, fd, &fp, 0, rightsp, NULL)) != 0)
2626 if (fp->f_type != DTYPE_SOCKET) {
2631 *fflagp = fp->f_flag;
2642 * Drop the reference count on the socket and XXX release the SX lock in the
2643 * future. The last reference closes the socket.
2645 * Note: fputsock() is deprecated, see comment for fgetsock().
2648 fputsock(struct socket *so)
2653 CURVNET_SET(so->so_vnet);
2659 * Handle the last reference to a file being closed.
2662 _fdrop(struct file *fp, struct thread *td)
2667 if (fp->f_count != 0)
2668 panic("fdrop: count %d", fp->f_count);
2669 if (fp->f_ops != &badfileops)
2670 error = fo_close(fp, td);
2671 atomic_subtract_int(&openfiles, 1);
2673 free(fp->f_advice, M_FADVISE);
2674 uma_zfree(file_zone, fp);
2680 * Apply an advisory lock on a file descriptor.
2682 * Just attempt to get a record lock of the requested type on the entire file
2683 * (l_whence = SEEK_SET, l_start = 0, l_len = 0).
2685 #ifndef _SYS_SYSPROTO_H_
2693 sys_flock(struct thread *td, struct flock_args *uap)
2698 cap_rights_t rights;
2701 error = fget(td, uap->fd, cap_rights_init(&rights, CAP_FLOCK), &fp);
2704 if (fp->f_type != DTYPE_VNODE) {
2706 return (EOPNOTSUPP);
2710 lf.l_whence = SEEK_SET;
2713 if (uap->how & LOCK_UN) {
2714 lf.l_type = F_UNLCK;
2715 atomic_clear_int(&fp->f_flag, FHASLOCK);
2716 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
2719 if (uap->how & LOCK_EX)
2720 lf.l_type = F_WRLCK;
2721 else if (uap->how & LOCK_SH)
2722 lf.l_type = F_RDLCK;
2727 atomic_set_int(&fp->f_flag, FHASLOCK);
2728 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf,
2729 (uap->how & LOCK_NB) ? F_FLOCK : F_FLOCK | F_WAIT);
2735 * Duplicate the specified descriptor to a free descriptor.
2738 dupfdopen(struct thread *td, struct filedesc *fdp, int dfd, int mode,
2739 int openerror, int *indxp)
2744 KASSERT(openerror == ENODEV || openerror == ENXIO,
2745 ("unexpected error %d in %s", openerror, __func__));
2748 * If the to-be-dup'd fd number is greater than the allowed number
2749 * of file descriptors, or the fd to be dup'd has already been
2750 * closed, then reject.
2752 FILEDESC_XLOCK(fdp);
2753 if ((fp = fget_locked(fdp, dfd)) == NULL) {
2754 FILEDESC_XUNLOCK(fdp);
2758 error = fdalloc(td, 0, &indx);
2760 FILEDESC_XUNLOCK(fdp);
2765 * There are two cases of interest here.
2767 * For ENODEV simply dup (dfd) to file descriptor (indx) and return.
2769 * For ENXIO steal away the file structure from (dfd) and store it in
2770 * (indx). (dfd) is effectively closed by this operation.
2772 switch (openerror) {
2775 * Check that the mode the file is being opened for is a
2776 * subset of the mode of the existing descriptor.
2778 if (((mode & (FREAD|FWRITE)) | fp->f_flag) != fp->f_flag) {
2779 fdunused(fdp, indx);
2780 FILEDESC_XUNLOCK(fdp);
2784 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
2785 filecaps_copy(&fdp->fd_ofiles[dfd].fde_caps,
2786 &fdp->fd_ofiles[indx].fde_caps);
2790 * Steal away the file pointer from dfd and stuff it into indx.
2792 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
2793 bzero(&fdp->fd_ofiles[dfd], sizeof(fdp->fd_ofiles[dfd]));
2797 FILEDESC_XUNLOCK(fdp);
2803 * Scan all active processes and prisons to see if any of them have a current
2804 * or root directory of `olddp'. If so, replace them with the new mount point.
2807 mountcheckdirs(struct vnode *olddp, struct vnode *newdp)
2809 struct filedesc *fdp;
2814 if (vrefcnt(olddp) == 1)
2817 sx_slock(&allproc_lock);
2818 FOREACH_PROC_IN_SYSTEM(p) {
2822 FILEDESC_XLOCK(fdp);
2823 if (fdp->fd_cdir == olddp) {
2825 fdp->fd_cdir = newdp;
2828 if (fdp->fd_rdir == olddp) {
2830 fdp->fd_rdir = newdp;
2833 if (fdp->fd_jdir == olddp) {
2835 fdp->fd_jdir = newdp;
2838 FILEDESC_XUNLOCK(fdp);
2841 sx_sunlock(&allproc_lock);
2842 if (rootvnode == olddp) {
2847 mtx_lock(&prison0.pr_mtx);
2848 if (prison0.pr_root == olddp) {
2850 prison0.pr_root = newdp;
2853 mtx_unlock(&prison0.pr_mtx);
2854 sx_slock(&allprison_lock);
2855 TAILQ_FOREACH(pr, &allprison, pr_list) {
2856 mtx_lock(&pr->pr_mtx);
2857 if (pr->pr_root == olddp) {
2859 pr->pr_root = newdp;
2862 mtx_unlock(&pr->pr_mtx);
2864 sx_sunlock(&allprison_lock);
2869 struct filedesc_to_leader *
2870 filedesc_to_leader_alloc(struct filedesc_to_leader *old, struct filedesc *fdp, struct proc *leader)
2872 struct filedesc_to_leader *fdtol;
2874 fdtol = malloc(sizeof(struct filedesc_to_leader),
2875 M_FILEDESC_TO_LEADER,
2877 fdtol->fdl_refcount = 1;
2878 fdtol->fdl_holdcount = 0;
2879 fdtol->fdl_wakeup = 0;
2880 fdtol->fdl_leader = leader;
2882 FILEDESC_XLOCK(fdp);
2883 fdtol->fdl_next = old->fdl_next;
2884 fdtol->fdl_prev = old;
2885 old->fdl_next = fdtol;
2886 fdtol->fdl_next->fdl_prev = fdtol;
2887 FILEDESC_XUNLOCK(fdp);
2889 fdtol->fdl_next = fdtol;
2890 fdtol->fdl_prev = fdtol;
2896 * Get file structures globally.
2899 sysctl_kern_file(SYSCTL_HANDLER_ARGS)
2902 struct filedesc *fdp;
2907 error = sysctl_wire_old_buffer(req, 0);
2910 if (req->oldptr == NULL) {
2912 sx_slock(&allproc_lock);
2913 FOREACH_PROC_IN_SYSTEM(p) {
2914 if (p->p_state == PRS_NEW)
2919 /* overestimates sparse tables. */
2920 if (fdp->fd_lastfile > 0)
2921 n += fdp->fd_lastfile;
2924 sx_sunlock(&allproc_lock);
2925 return (SYSCTL_OUT(req, 0, n * sizeof(xf)));
2928 bzero(&xf, sizeof(xf));
2929 xf.xf_size = sizeof(xf);
2930 sx_slock(&allproc_lock);
2931 FOREACH_PROC_IN_SYSTEM(p) {
2933 if (p->p_state == PRS_NEW) {
2937 if (p_cansee(req->td, p) != 0) {
2941 xf.xf_pid = p->p_pid;
2942 xf.xf_uid = p->p_ucred->cr_uid;
2947 FILEDESC_SLOCK(fdp);
2948 for (n = 0; fdp->fd_refcnt > 0 && n <= fdp->fd_lastfile; ++n) {
2949 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL)
2953 xf.xf_data = fp->f_data;
2954 xf.xf_vnode = fp->f_vnode;
2955 xf.xf_type = fp->f_type;
2956 xf.xf_count = fp->f_count;
2958 xf.xf_offset = foffset_get(fp);
2959 xf.xf_flag = fp->f_flag;
2960 error = SYSCTL_OUT(req, &xf, sizeof(xf));
2964 FILEDESC_SUNLOCK(fdp);
2969 sx_sunlock(&allproc_lock);
2973 SYSCTL_PROC(_kern, KERN_FILE, file, CTLTYPE_OPAQUE|CTLFLAG_RD|CTLFLAG_MPSAFE,
2974 0, 0, sysctl_kern_file, "S,xfile", "Entire file table");
2976 #ifdef KINFO_OFILE_SIZE
2977 CTASSERT(sizeof(struct kinfo_ofile) == KINFO_OFILE_SIZE);
2980 #ifdef COMPAT_FREEBSD7
2982 export_vnode_for_osysctl(struct vnode *vp, int type,
2983 struct kinfo_ofile *kif, struct filedesc *fdp, struct sysctl_req *req)
2986 char *fullpath, *freepath;
2988 bzero(kif, sizeof(*kif));
2989 kif->kf_structsize = sizeof(*kif);
2993 kif->kf_type = KF_TYPE_VNODE;
2994 /* This function only handles directories. */
2995 if (vp->v_type != VDIR) {
2999 kif->kf_vnode_type = KF_VTYPE_VDIR;
3002 * This is not a true file descriptor, so we set a bogus refcount
3003 * and offset to indicate these fields should be ignored.
3005 kif->kf_ref_count = -1;
3006 kif->kf_offset = -1;
3010 FILEDESC_SUNLOCK(fdp);
3011 vn_fullpath(curthread, vp, &fullpath, &freepath);
3013 strlcpy(kif->kf_path, fullpath, sizeof(kif->kf_path));
3014 if (freepath != NULL)
3015 free(freepath, M_TEMP);
3016 error = SYSCTL_OUT(req, kif, sizeof(*kif));
3017 FILEDESC_SLOCK(fdp);
3022 * Get per-process file descriptors for use by procstat(1), et al.
3025 sysctl_kern_proc_ofiledesc(SYSCTL_HANDLER_ARGS)
3027 char *fullpath, *freepath;
3028 struct kinfo_ofile *kif;
3029 struct filedesc *fdp;
3030 int error, i, *name;
3031 struct shmfd *shmfd;
3040 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
3047 kif = malloc(sizeof(*kif), M_TEMP, M_WAITOK);
3048 FILEDESC_SLOCK(fdp);
3049 if (fdp->fd_cdir != NULL)
3050 export_vnode_for_osysctl(fdp->fd_cdir, KF_FD_TYPE_CWD, kif,
3052 if (fdp->fd_rdir != NULL)
3053 export_vnode_for_osysctl(fdp->fd_rdir, KF_FD_TYPE_ROOT, kif,
3055 if (fdp->fd_jdir != NULL)
3056 export_vnode_for_osysctl(fdp->fd_jdir, KF_FD_TYPE_JAIL, kif,
3058 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) {
3059 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL)
3061 bzero(kif, sizeof(*kif));
3062 kif->kf_structsize = sizeof(*kif);
3070 switch (fp->f_type) {
3072 kif->kf_type = KF_TYPE_VNODE;
3077 kif->kf_type = KF_TYPE_SOCKET;
3082 kif->kf_type = KF_TYPE_PIPE;
3086 kif->kf_type = KF_TYPE_FIFO;
3091 kif->kf_type = KF_TYPE_KQUEUE;
3095 kif->kf_type = KF_TYPE_CRYPTO;
3099 kif->kf_type = KF_TYPE_MQUEUE;
3103 kif->kf_type = KF_TYPE_SHM;
3108 kif->kf_type = KF_TYPE_SEM;
3113 kif->kf_type = KF_TYPE_PTS;
3118 case DTYPE_PROCDESC:
3119 kif->kf_type = KF_TYPE_PROCDESC;
3124 kif->kf_type = KF_TYPE_UNKNOWN;
3127 kif->kf_ref_count = fp->f_count;
3128 if (fp->f_flag & FREAD)
3129 kif->kf_flags |= KF_FLAG_READ;
3130 if (fp->f_flag & FWRITE)
3131 kif->kf_flags |= KF_FLAG_WRITE;
3132 if (fp->f_flag & FAPPEND)
3133 kif->kf_flags |= KF_FLAG_APPEND;
3134 if (fp->f_flag & FASYNC)
3135 kif->kf_flags |= KF_FLAG_ASYNC;
3136 if (fp->f_flag & FFSYNC)
3137 kif->kf_flags |= KF_FLAG_FSYNC;
3138 if (fp->f_flag & FNONBLOCK)
3139 kif->kf_flags |= KF_FLAG_NONBLOCK;
3140 if (fp->f_flag & O_DIRECT)
3141 kif->kf_flags |= KF_FLAG_DIRECT;
3142 if (fp->f_flag & FHASLOCK)
3143 kif->kf_flags |= KF_FLAG_HASLOCK;
3144 kif->kf_offset = foffset_get(fp);
3147 switch (vp->v_type) {
3149 kif->kf_vnode_type = KF_VTYPE_VNON;
3152 kif->kf_vnode_type = KF_VTYPE_VREG;
3155 kif->kf_vnode_type = KF_VTYPE_VDIR;
3158 kif->kf_vnode_type = KF_VTYPE_VBLK;
3161 kif->kf_vnode_type = KF_VTYPE_VCHR;
3164 kif->kf_vnode_type = KF_VTYPE_VLNK;
3167 kif->kf_vnode_type = KF_VTYPE_VSOCK;
3170 kif->kf_vnode_type = KF_VTYPE_VFIFO;
3173 kif->kf_vnode_type = KF_VTYPE_VBAD;
3176 kif->kf_vnode_type = KF_VTYPE_UNKNOWN;
3180 * It is OK to drop the filedesc lock here as we will
3181 * re-validate and re-evaluate its properties when
3182 * the loop continues.
3186 FILEDESC_SUNLOCK(fdp);
3187 vn_fullpath(curthread, vp, &fullpath, &freepath);
3189 strlcpy(kif->kf_path, fullpath,
3190 sizeof(kif->kf_path));
3191 if (freepath != NULL)
3192 free(freepath, M_TEMP);
3193 FILEDESC_SLOCK(fdp);
3196 struct sockaddr *sa;
3198 if (so->so_proto->pr_usrreqs->pru_sockaddr(so, &sa)
3199 == 0 && sa->sa_len <= sizeof(kif->kf_sa_local)) {
3200 bcopy(sa, &kif->kf_sa_local, sa->sa_len);
3203 if (so->so_proto->pr_usrreqs->pru_peeraddr(so, &sa)
3204 == 0 && sa->sa_len <= sizeof(kif->kf_sa_peer)) {
3205 bcopy(sa, &kif->kf_sa_peer, sa->sa_len);
3208 kif->kf_sock_domain =
3209 so->so_proto->pr_domain->dom_family;
3210 kif->kf_sock_type = so->so_type;
3211 kif->kf_sock_protocol = so->so_proto->pr_protocol;
3214 strlcpy(kif->kf_path, tty_devname(tp),
3215 sizeof(kif->kf_path));
3218 shm_path(shmfd, kif->kf_path, sizeof(kif->kf_path));
3219 if (ks != NULL && ksem_info != NULL)
3220 ksem_info(ks, kif->kf_path, sizeof(kif->kf_path), NULL);
3221 error = SYSCTL_OUT(req, kif, sizeof(*kif));
3225 FILEDESC_SUNLOCK(fdp);
3231 static SYSCTL_NODE(_kern_proc, KERN_PROC_OFILEDESC, ofiledesc,
3232 CTLFLAG_RD||CTLFLAG_MPSAFE, sysctl_kern_proc_ofiledesc,
3233 "Process ofiledesc entries");
3234 #endif /* COMPAT_FREEBSD7 */
3236 #ifdef KINFO_FILE_SIZE
3237 CTASSERT(sizeof(struct kinfo_file) == KINFO_FILE_SIZE);
3240 struct export_fd_buf {
3241 struct filedesc *fdp;
3244 struct kinfo_file kif;
3248 export_fd_to_sb(void *data, int type, int fd, int fflags, int refcnt,
3249 int64_t offset, cap_rights_t *rightsp, struct export_fd_buf *efbuf)
3254 } fflags_table[] = {
3255 { FAPPEND, KF_FLAG_APPEND },
3256 { FASYNC, KF_FLAG_ASYNC },
3257 { FFSYNC, KF_FLAG_FSYNC },
3258 { FHASLOCK, KF_FLAG_HASLOCK },
3259 { FNONBLOCK, KF_FLAG_NONBLOCK },
3260 { FREAD, KF_FLAG_READ },
3261 { FWRITE, KF_FLAG_WRITE },
3262 { O_CREAT, KF_FLAG_CREAT },
3263 { O_DIRECT, KF_FLAG_DIRECT },
3264 { O_EXCL, KF_FLAG_EXCL },
3265 { O_EXEC, KF_FLAG_EXEC },
3266 { O_EXLOCK, KF_FLAG_EXLOCK },
3267 { O_NOFOLLOW, KF_FLAG_NOFOLLOW },
3268 { O_SHLOCK, KF_FLAG_SHLOCK },
3269 { O_TRUNC, KF_FLAG_TRUNC }
3271 #define NFFLAGS (sizeof(fflags_table) / sizeof(*fflags_table))
3272 struct kinfo_file *kif;
3277 if (efbuf->remainder == 0)
3280 bzero(kif, sizeof(*kif));
3281 locked = efbuf->fdp != NULL;
3286 FILEDESC_SUNLOCK(efbuf->fdp);
3289 vp = (struct vnode *)data;
3290 error = fill_vnode_info(vp, kif);
3293 case KF_TYPE_SOCKET:
3294 error = fill_socket_info((struct socket *)data, kif);
3297 error = fill_pipe_info((struct pipe *)data, kif);
3300 error = fill_pts_info((struct tty *)data, kif);
3302 case KF_TYPE_PROCDESC:
3303 error = fill_procdesc_info((struct procdesc *)data, kif);
3306 error = fill_sem_info((struct file *)data, kif);
3309 error = fill_shm_info((struct file *)data, kif);
3315 kif->kf_status |= KF_ATTR_VALID;
3318 * Translate file access flags.
3320 for (i = 0; i < NFFLAGS; i++)
3321 if (fflags & fflags_table[i].fflag)
3322 kif->kf_flags |= fflags_table[i].kf_fflag;
3323 if (rightsp != NULL)
3324 kif->kf_cap_rights = *rightsp;
3326 cap_rights_init(&kif->kf_cap_rights);
3328 kif->kf_type = type;
3329 kif->kf_ref_count = refcnt;
3330 kif->kf_offset = offset;
3331 /* Pack record size down */
3332 kif->kf_structsize = offsetof(struct kinfo_file, kf_path) +
3333 strlen(kif->kf_path) + 1;
3334 kif->kf_structsize = roundup(kif->kf_structsize, sizeof(uint64_t));
3335 if (efbuf->remainder != -1) {
3336 if (efbuf->remainder < kif->kf_structsize) {
3337 /* Terminate export. */
3338 efbuf->remainder = 0;
3339 if (efbuf->fdp != NULL && !locked)
3340 FILEDESC_SLOCK(efbuf->fdp);
3343 efbuf->remainder -= kif->kf_structsize;
3346 FILEDESC_SUNLOCK(efbuf->fdp);
3347 error = sbuf_bcat(efbuf->sb, kif, kif->kf_structsize);
3348 if (efbuf->fdp != NULL)
3349 FILEDESC_SLOCK(efbuf->fdp);
3354 * Store a process file descriptor information to sbuf.
3356 * Takes a locked proc as argument, and returns with the proc unlocked.
3359 kern_proc_filedesc_out(struct proc *p, struct sbuf *sb, ssize_t maxlen)
3362 struct filedesc *fdp;
3363 struct export_fd_buf *efbuf;
3364 struct vnode *cttyvp, *textvp, *tracevp;
3368 int type, refcnt, fflags;
3369 cap_rights_t rights;
3371 PROC_LOCK_ASSERT(p, MA_OWNED);
3374 tracevp = p->p_tracevp;
3375 if (tracevp != NULL)
3378 textvp = p->p_textvp;
3381 /* Controlling tty. */
3383 if (p->p_pgrp != NULL && p->p_pgrp->pg_session != NULL) {
3384 cttyvp = p->p_pgrp->pg_session->s_ttyvp;
3390 efbuf = malloc(sizeof(*efbuf), M_TEMP, M_WAITOK);
3393 efbuf->remainder = maxlen;
3394 if (tracevp != NULL)
3395 export_fd_to_sb(tracevp, KF_TYPE_VNODE, KF_FD_TYPE_TRACE,
3396 FREAD | FWRITE, -1, -1, NULL, efbuf);
3398 export_fd_to_sb(textvp, KF_TYPE_VNODE, KF_FD_TYPE_TEXT,
3399 FREAD, -1, -1, NULL, efbuf);
3401 export_fd_to_sb(cttyvp, KF_TYPE_VNODE, KF_FD_TYPE_CTTY,
3402 FREAD | FWRITE, -1, -1, NULL, efbuf);
3407 FILEDESC_SLOCK(fdp);
3408 /* working directory */
3409 if (fdp->fd_cdir != NULL) {
3411 data = fdp->fd_cdir;
3412 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_CWD,
3413 FREAD, -1, -1, NULL, efbuf);
3415 /* root directory */
3416 if (fdp->fd_rdir != NULL) {
3418 data = fdp->fd_rdir;
3419 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_ROOT,
3420 FREAD, -1, -1, NULL, efbuf);
3422 /* jail directory */
3423 if (fdp->fd_jdir != NULL) {
3425 data = fdp->fd_jdir;
3426 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_JAIL,
3427 FREAD, -1, -1, NULL, efbuf);
3429 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) {
3430 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL)
3434 rights = *cap_rights(fdp, i);
3435 #else /* !CAPABILITIES */
3436 cap_rights_init(&rights);
3438 switch (fp->f_type) {
3440 type = KF_TYPE_VNODE;
3446 type = KF_TYPE_SOCKET;
3451 type = KF_TYPE_PIPE;
3456 type = KF_TYPE_FIFO;
3462 type = KF_TYPE_KQUEUE;
3466 type = KF_TYPE_CRYPTO;
3470 type = KF_TYPE_MQUEUE;
3489 case DTYPE_PROCDESC:
3490 type = KF_TYPE_PROCDESC;
3496 type = KF_TYPE_UNKNOWN;
3499 refcnt = fp->f_count;
3500 fflags = fp->f_flag;
3501 offset = foffset_get(fp);
3504 * Create sysctl entry.
3505 * It is OK to drop the filedesc lock here as we will
3506 * re-validate and re-evaluate its properties when
3507 * the loop continues.
3509 error = export_fd_to_sb(data, type, i, fflags, refcnt,
3510 offset, &rights, efbuf);
3514 FILEDESC_SUNLOCK(fdp);
3517 free(efbuf, M_TEMP);
3521 #define FILEDESC_SBUF_SIZE (sizeof(struct kinfo_file) * 5)
3524 * Get per-process file descriptors for use by procstat(1), et al.
3527 sysctl_kern_proc_filedesc(SYSCTL_HANDLER_ARGS)
3532 int error, error2, *name;
3536 sbuf_new_for_sysctl(&sb, NULL, FILEDESC_SBUF_SIZE, req);
3537 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
3542 maxlen = req->oldptr != NULL ? req->oldlen : -1;
3543 error = kern_proc_filedesc_out(p, &sb, maxlen);
3544 error2 = sbuf_finish(&sb);
3546 return (error != 0 ? error : error2);
3550 vntype_to_kinfo(int vtype)
3555 } vtypes_table[] = {
3556 { VBAD, KF_VTYPE_VBAD },
3557 { VBLK, KF_VTYPE_VBLK },
3558 { VCHR, KF_VTYPE_VCHR },
3559 { VDIR, KF_VTYPE_VDIR },
3560 { VFIFO, KF_VTYPE_VFIFO },
3561 { VLNK, KF_VTYPE_VLNK },
3562 { VNON, KF_VTYPE_VNON },
3563 { VREG, KF_VTYPE_VREG },
3564 { VSOCK, KF_VTYPE_VSOCK }
3566 #define NVTYPES (sizeof(vtypes_table) / sizeof(*vtypes_table))
3570 * Perform vtype translation.
3572 for (i = 0; i < NVTYPES; i++)
3573 if (vtypes_table[i].vtype == vtype)
3576 return (vtypes_table[i].kf_vtype);
3578 return (KF_VTYPE_UNKNOWN);
3582 fill_vnode_info(struct vnode *vp, struct kinfo_file *kif)
3585 char *fullpath, *freepath;
3590 kif->kf_vnode_type = vntype_to_kinfo(vp->v_type);
3593 error = vn_fullpath(curthread, vp, &fullpath, &freepath);
3595 strlcpy(kif->kf_path, fullpath, sizeof(kif->kf_path));
3597 if (freepath != NULL)
3598 free(freepath, M_TEMP);
3601 * Retrieve vnode attributes.
3603 va.va_fsid = VNOVAL;
3605 vn_lock(vp, LK_SHARED | LK_RETRY);
3606 error = VOP_GETATTR(vp, &va, curthread->td_ucred);
3610 if (va.va_fsid != VNOVAL)
3611 kif->kf_un.kf_file.kf_file_fsid = va.va_fsid;
3613 kif->kf_un.kf_file.kf_file_fsid =
3614 vp->v_mount->mnt_stat.f_fsid.val[0];
3615 kif->kf_un.kf_file.kf_file_fileid = va.va_fileid;
3616 kif->kf_un.kf_file.kf_file_mode = MAKEIMODE(va.va_type, va.va_mode);
3617 kif->kf_un.kf_file.kf_file_size = va.va_size;
3618 kif->kf_un.kf_file.kf_file_rdev = va.va_rdev;
3623 fill_socket_info(struct socket *so, struct kinfo_file *kif)
3625 struct sockaddr *sa;
3626 struct inpcb *inpcb;
3627 struct unpcb *unpcb;
3632 kif->kf_sock_domain = so->so_proto->pr_domain->dom_family;
3633 kif->kf_sock_type = so->so_type;
3634 kif->kf_sock_protocol = so->so_proto->pr_protocol;
3635 kif->kf_un.kf_sock.kf_sock_pcb = (uintptr_t)so->so_pcb;
3636 switch(kif->kf_sock_domain) {
3639 if (kif->kf_sock_protocol == IPPROTO_TCP) {
3640 if (so->so_pcb != NULL) {
3641 inpcb = (struct inpcb *)(so->so_pcb);
3642 kif->kf_un.kf_sock.kf_sock_inpcb =
3643 (uintptr_t)inpcb->inp_ppcb;
3648 if (so->so_pcb != NULL) {
3649 unpcb = (struct unpcb *)(so->so_pcb);
3650 if (unpcb->unp_conn) {
3651 kif->kf_un.kf_sock.kf_sock_unpconn =
3652 (uintptr_t)unpcb->unp_conn;
3653 kif->kf_un.kf_sock.kf_sock_rcv_sb_state =
3654 so->so_rcv.sb_state;
3655 kif->kf_un.kf_sock.kf_sock_snd_sb_state =
3656 so->so_snd.sb_state;
3661 error = so->so_proto->pr_usrreqs->pru_sockaddr(so, &sa);
3662 if (error == 0 && sa->sa_len <= sizeof(kif->kf_sa_local)) {
3663 bcopy(sa, &kif->kf_sa_local, sa->sa_len);
3666 error = so->so_proto->pr_usrreqs->pru_peeraddr(so, &sa);
3667 if (error == 0 && sa->sa_len <= sizeof(kif->kf_sa_peer)) {
3668 bcopy(sa, &kif->kf_sa_peer, sa->sa_len);
3671 strncpy(kif->kf_path, so->so_proto->pr_domain->dom_name,
3672 sizeof(kif->kf_path));
3677 fill_pts_info(struct tty *tp, struct kinfo_file *kif)
3682 kif->kf_un.kf_pts.kf_pts_dev = tty_udev(tp);
3683 strlcpy(kif->kf_path, tty_devname(tp), sizeof(kif->kf_path));
3688 fill_pipe_info(struct pipe *pi, struct kinfo_file *kif)
3693 kif->kf_un.kf_pipe.kf_pipe_addr = (uintptr_t)pi;
3694 kif->kf_un.kf_pipe.kf_pipe_peer = (uintptr_t)pi->pipe_peer;
3695 kif->kf_un.kf_pipe.kf_pipe_buffer_cnt = pi->pipe_buffer.cnt;
3700 fill_procdesc_info(struct procdesc *pdp, struct kinfo_file *kif)
3705 kif->kf_un.kf_proc.kf_pid = pdp->pd_pid;
3710 fill_sem_info(struct file *fp, struct kinfo_file *kif)
3716 if (fp->f_data == NULL)
3718 if (fo_stat(fp, &sb, td->td_ucred, td) != 0)
3720 if (ksem_info == NULL)
3722 ksem_info(fp->f_data, kif->kf_path, sizeof(kif->kf_path),
3723 &kif->kf_un.kf_sem.kf_sem_value);
3724 kif->kf_un.kf_sem.kf_sem_mode = sb.st_mode;
3729 fill_shm_info(struct file *fp, struct kinfo_file *kif)
3735 if (fp->f_data == NULL)
3737 if (fo_stat(fp, &sb, td->td_ucred, td) != 0)
3739 shm_path(fp->f_data, kif->kf_path, sizeof(kif->kf_path));
3740 kif->kf_un.kf_file.kf_file_mode = sb.st_mode;
3741 kif->kf_un.kf_file.kf_file_size = sb.st_size;
3745 static SYSCTL_NODE(_kern_proc, KERN_PROC_FILEDESC, filedesc,
3746 CTLFLAG_RD|CTLFLAG_MPSAFE, sysctl_kern_proc_filedesc,
3747 "Process filedesc entries");
3751 * For the purposes of debugging, generate a human-readable string for the
3755 file_type_to_name(short type)
3785 * For the purposes of debugging, identify a process (if any, perhaps one of
3786 * many) that references the passed file in its file descriptor array. Return
3789 static struct proc *
3790 file_to_first_proc(struct file *fp)
3792 struct filedesc *fdp;
3796 FOREACH_PROC_IN_SYSTEM(p) {
3797 if (p->p_state == PRS_NEW)
3802 for (n = 0; n <= fdp->fd_lastfile; n++) {
3803 if (fp == fdp->fd_ofiles[n].fde_file)
3811 db_print_file(struct file *fp, int header)
3816 db_printf("%8s %4s %8s %8s %4s %5s %6s %8s %5s %12s\n",
3817 "File", "Type", "Data", "Flag", "GCFl", "Count",
3818 "MCount", "Vnode", "FPID", "FCmd");
3819 p = file_to_first_proc(fp);
3820 db_printf("%8p %4s %8p %08x %04x %5d %6d %8p %5d %12s\n", fp,
3821 file_type_to_name(fp->f_type), fp->f_data, fp->f_flag,
3822 0, fp->f_count, 0, fp->f_vnode,
3823 p != NULL ? p->p_pid : -1, p != NULL ? p->p_comm : "-");
3826 DB_SHOW_COMMAND(file, db_show_file)
3831 db_printf("usage: show file <addr>\n");
3834 fp = (struct file *)addr;
3835 db_print_file(fp, 1);
3838 DB_SHOW_COMMAND(files, db_show_files)
3840 struct filedesc *fdp;
3847 FOREACH_PROC_IN_SYSTEM(p) {
3848 if (p->p_state == PRS_NEW)
3850 if ((fdp = p->p_fd) == NULL)
3852 for (n = 0; n <= fdp->fd_lastfile; ++n) {
3853 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL)
3855 db_print_file(fp, header);
3862 SYSCTL_INT(_kern, KERN_MAXFILESPERPROC, maxfilesperproc, CTLFLAG_RW,
3863 &maxfilesperproc, 0, "Maximum files allowed open per process");
3865 SYSCTL_INT(_kern, KERN_MAXFILES, maxfiles, CTLFLAG_RW,
3866 &maxfiles, 0, "Maximum number of files");
3868 SYSCTL_INT(_kern, OID_AUTO, openfiles, CTLFLAG_RD,
3869 __DEVOLATILE(int *, &openfiles), 0, "System-wide number of open files");
3873 filelistinit(void *dummy)
3876 file_zone = uma_zcreate("Files", sizeof(struct file), NULL, NULL,
3877 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
3878 mtx_init(&sigio_lock, "sigio lock", NULL, MTX_DEF);
3879 mtx_init(&fdesc_mtx, "fdesc", NULL, MTX_DEF);
3881 SYSINIT(select, SI_SUB_LOCK, SI_ORDER_FIRST, filelistinit, NULL);
3883 /*-------------------------------------------------------------------*/
3886 badfo_readwrite(struct file *fp, struct uio *uio, struct ucred *active_cred,
3887 int flags, struct thread *td)
3894 badfo_truncate(struct file *fp, off_t length, struct ucred *active_cred,
3902 badfo_ioctl(struct file *fp, u_long com, void *data, struct ucred *active_cred,
3910 badfo_poll(struct file *fp, int events, struct ucred *active_cred,
3918 badfo_kqfilter(struct file *fp, struct knote *kn)
3925 badfo_stat(struct file *fp, struct stat *sb, struct ucred *active_cred,
3933 badfo_close(struct file *fp, struct thread *td)
3940 badfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred,
3948 badfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
3956 badfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio,
3957 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags,
3958 int kflags, struct thread *td)
3964 struct fileops badfileops = {
3965 .fo_read = badfo_readwrite,
3966 .fo_write = badfo_readwrite,
3967 .fo_truncate = badfo_truncate,
3968 .fo_ioctl = badfo_ioctl,
3969 .fo_poll = badfo_poll,
3970 .fo_kqfilter = badfo_kqfilter,
3971 .fo_stat = badfo_stat,
3972 .fo_close = badfo_close,
3973 .fo_chmod = badfo_chmod,
3974 .fo_chown = badfo_chown,
3975 .fo_sendfile = badfo_sendfile,
3979 invfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred,
3987 invfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
3995 invfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio,
3996 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags,
3997 int kflags, struct thread *td)
4003 /*-------------------------------------------------------------------*/
4006 * File Descriptor pseudo-device driver (/dev/fd/).
4008 * Opening minor device N dup()s the file (if any) connected to file
4009 * descriptor N belonging to the calling process. Note that this driver
4010 * consists of only the ``open()'' routine, because all subsequent
4011 * references to this file will be direct to the other driver.
4013 * XXX: we could give this one a cloning event handler if necessary.
4018 fdopen(struct cdev *dev, int mode, int type, struct thread *td)
4022 * XXX Kludge: set curthread->td_dupfd to contain the value of the
4023 * the file descriptor being sought for duplication. The error
4024 * return ensures that the vnode for this device will be released
4025 * by vn_open. Open will detect this special error and take the
4026 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
4027 * will simply report the error.
4029 td->td_dupfd = dev2unit(dev);
4033 static struct cdevsw fildesc_cdevsw = {
4034 .d_version = D_VERSION,
4040 fildesc_drvinit(void *unused)
4044 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 0, NULL,
4045 UID_ROOT, GID_WHEEL, 0666, "fd/0");
4046 make_dev_alias(dev, "stdin");
4047 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 1, NULL,
4048 UID_ROOT, GID_WHEEL, 0666, "fd/1");
4049 make_dev_alias(dev, "stdout");
4050 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 2, NULL,
4051 UID_ROOT, GID_WHEEL, 0666, "fd/2");
4052 make_dev_alias(dev, "stderr");
4055 SYSINIT(fildescdev, SI_SUB_DRIVERS, SI_ORDER_MIDDLE, fildesc_drvinit, NULL);