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.
300 fdfree(struct filedesc *fdp, int fd)
302 struct filedescent *fde;
304 fde = &fdp->fd_ofiles[fd];
305 filecaps_free(&fde->fde_caps);
306 bzero(fde, sizeof(*fde));
311 * System calls on descriptors.
313 #ifndef _SYS_SYSPROTO_H_
314 struct getdtablesize_args {
320 sys_getdtablesize(struct thread *td, struct getdtablesize_args *uap)
322 struct proc *p = td->td_proc;
327 min((int)lim_cur(p, RLIMIT_NOFILE), maxfilesperproc);
328 lim = racct_get_limit(td->td_proc, RACCT_NOFILE);
330 if (lim < td->td_retval[0])
331 td->td_retval[0] = lim;
336 * Duplicate a file descriptor to a particular value.
338 * Note: keep in mind that a potential race condition exists when closing
339 * descriptors from a shared descriptor table (via rfork).
341 #ifndef _SYS_SYSPROTO_H_
349 sys_dup2(struct thread *td, struct dup2_args *uap)
352 return (do_dup(td, DUP_FIXED, (int)uap->from, (int)uap->to,
357 * Duplicate a file descriptor.
359 #ifndef _SYS_SYSPROTO_H_
366 sys_dup(struct thread *td, struct dup_args *uap)
369 return (do_dup(td, 0, (int)uap->fd, 0, td->td_retval));
373 * The file control system call.
375 #ifndef _SYS_SYSPROTO_H_
384 sys_fcntl(struct thread *td, struct fcntl_args *uap)
399 * Convert old flock structure to new.
401 error = copyin((void *)(intptr_t)uap->arg, &ofl, sizeof(ofl));
402 fl.l_start = ofl.l_start;
403 fl.l_len = ofl.l_len;
404 fl.l_pid = ofl.l_pid;
405 fl.l_type = ofl.l_type;
406 fl.l_whence = ofl.l_whence;
426 error = copyin((void *)(intptr_t)uap->arg, &fl, sizeof(fl));
435 error = kern_fcntl(td, uap->fd, cmd, arg);
438 if (uap->cmd == F_OGETLK) {
439 ofl.l_start = fl.l_start;
440 ofl.l_len = fl.l_len;
441 ofl.l_pid = fl.l_pid;
442 ofl.l_type = fl.l_type;
443 ofl.l_whence = fl.l_whence;
444 error = copyout(&ofl, (void *)(intptr_t)uap->arg, sizeof(ofl));
445 } else if (uap->cmd == F_GETLK) {
446 error = copyout(&fl, (void *)(intptr_t)uap->arg, sizeof(fl));
452 kern_fcntl(struct thread *td, int fd, int cmd, intptr_t arg)
454 struct filedesc *fdp;
456 struct file *fp, *fp2;
457 struct filedescent *fde;
474 error = do_dup(td, DUP_FCNTL, fd, tmp, td->td_retval);
477 case F_DUPFD_CLOEXEC:
479 error = do_dup(td, DUP_FCNTL | DUP_CLOEXEC, fd, tmp,
485 error = do_dup(td, DUP_FIXED, fd, tmp, td->td_retval);
488 case F_DUP2FD_CLOEXEC:
490 error = do_dup(td, DUP_FIXED | DUP_CLOEXEC, fd, tmp,
496 if ((fp = fget_locked(fdp, fd)) == NULL) {
497 FILEDESC_SUNLOCK(fdp);
501 fde = &fdp->fd_ofiles[fd];
503 (fde->fde_flags & UF_EXCLOSE) ? FD_CLOEXEC : 0;
504 FILEDESC_SUNLOCK(fdp);
509 if ((fp = fget_locked(fdp, fd)) == NULL) {
510 FILEDESC_XUNLOCK(fdp);
514 fde = &fdp->fd_ofiles[fd];
515 fde->fde_flags = (fde->fde_flags & ~UF_EXCLOSE) |
516 (arg & FD_CLOEXEC ? UF_EXCLOSE : 0);
517 FILEDESC_XUNLOCK(fdp);
521 error = fget_unlocked(fdp, fd,
522 cap_rights_init(&rights, CAP_FCNTL), F_GETFL, &fp, NULL);
525 td->td_retval[0] = OFLAGS(fp->f_flag);
530 error = fget_unlocked(fdp, fd,
531 cap_rights_init(&rights, CAP_FCNTL), F_SETFL, &fp, NULL);
535 tmp = flg = fp->f_flag;
537 tmp |= FFLAGS(arg & ~O_ACCMODE) & FCNTLFLAGS;
538 } while(atomic_cmpset_int(&fp->f_flag, flg, tmp) == 0);
539 tmp = fp->f_flag & FNONBLOCK;
540 error = fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td);
545 tmp = fp->f_flag & FASYNC;
546 error = fo_ioctl(fp, FIOASYNC, &tmp, td->td_ucred, td);
551 atomic_clear_int(&fp->f_flag, FNONBLOCK);
553 (void)fo_ioctl(fp, FIONBIO, &tmp, td->td_ucred, td);
558 error = fget_unlocked(fdp, fd,
559 cap_rights_init(&rights, CAP_FCNTL), F_GETOWN, &fp, NULL);
562 error = fo_ioctl(fp, FIOGETOWN, &tmp, td->td_ucred, td);
564 td->td_retval[0] = tmp;
569 error = fget_unlocked(fdp, fd,
570 cap_rights_init(&rights, CAP_FCNTL), F_SETOWN, &fp, NULL);
574 error = fo_ioctl(fp, FIOSETOWN, &tmp, td->td_ucred, td);
579 error = priv_check(td, PRIV_NFS_LOCKD);
587 /* FALLTHROUGH F_SETLK */
591 cap_rights_init(&rights, CAP_FLOCK);
592 error = fget_unlocked(fdp, fd, &rights, 0, &fp, NULL);
595 if (fp->f_type != DTYPE_VNODE) {
601 flp = (struct flock *)arg;
602 if (flp->l_whence == SEEK_CUR) {
603 foffset = foffset_get(fp);
606 foffset > OFF_MAX - flp->l_start)) {
607 FILEDESC_SUNLOCK(fdp);
612 flp->l_start += foffset;
616 switch (flp->l_type) {
618 if ((fp->f_flag & FREAD) == 0) {
622 PROC_LOCK(p->p_leader);
623 p->p_leader->p_flag |= P_ADVLOCK;
624 PROC_UNLOCK(p->p_leader);
625 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK,
629 if ((fp->f_flag & FWRITE) == 0) {
633 PROC_LOCK(p->p_leader);
634 p->p_leader->p_flag |= P_ADVLOCK;
635 PROC_UNLOCK(p->p_leader);
636 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_SETLK,
640 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_UNLCK,
645 * Temporary api for testing remote lock
648 if (flg != F_REMOTE) {
652 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader,
653 F_UNLCKSYS, flp, flg);
659 if (error != 0 || flp->l_type == F_UNLCK ||
660 flp->l_type == F_UNLCKSYS) {
666 * Check for a race with close.
668 * The vnode is now advisory locked (or unlocked, but this case
669 * is not really important) as the caller requested.
670 * We had to drop the filedesc lock, so we need to recheck if
671 * the descriptor is still valid, because if it was closed
672 * in the meantime we need to remove advisory lock from the
673 * vnode - close on any descriptor leading to an advisory
674 * locked vnode, removes that lock.
675 * We will return 0 on purpose in that case, as the result of
676 * successful advisory lock might have been externally visible
677 * already. This is fine - effectively we pretend to the caller
678 * that the closing thread was a bit slower and that the
679 * advisory lock succeeded before the close.
681 error = fget_unlocked(fdp, fd, &rights, 0, &fp2, NULL);
687 flp->l_whence = SEEK_SET;
690 flp->l_type = F_UNLCK;
691 (void) VOP_ADVLOCK(vp, (caddr_t)p->p_leader,
692 F_UNLCK, flp, F_POSIX);
699 error = fget_unlocked(fdp, fd,
700 cap_rights_init(&rights, CAP_FLOCK), 0, &fp, NULL);
703 if (fp->f_type != DTYPE_VNODE) {
708 flp = (struct flock *)arg;
709 if (flp->l_type != F_RDLCK && flp->l_type != F_WRLCK &&
710 flp->l_type != F_UNLCK) {
715 if (flp->l_whence == SEEK_CUR) {
716 foffset = foffset_get(fp);
717 if ((flp->l_start > 0 &&
718 foffset > OFF_MAX - flp->l_start) ||
720 foffset < OFF_MIN - flp->l_start)) {
721 FILEDESC_SUNLOCK(fdp);
726 flp->l_start += foffset;
729 error = VOP_ADVLOCK(vp, (caddr_t)p->p_leader, F_GETLK, flp,
735 arg = arg ? 128 * 1024: 0;
738 error = fget_unlocked(fdp, fd, NULL, 0, &fp, NULL);
741 if (fp->f_type != DTYPE_VNODE) {
748 error = vn_lock(vp, LK_SHARED);
753 bsize = fp->f_vnode->v_mount->mnt_stat.f_iosize;
755 fp->f_seqcount = (arg + bsize - 1) / bsize;
757 new = old = fp->f_flag;
759 } while (!atomic_cmpset_rel_int(&fp->f_flag, old, new));
762 new = old = fp->f_flag;
764 } while (!atomic_cmpset_rel_int(&fp->f_flag, old, new));
777 getmaxfd(struct proc *p)
782 maxfd = min((int)lim_cur(p, RLIMIT_NOFILE), maxfilesperproc);
789 * Common code for dup, dup2, fcntl(F_DUPFD) and fcntl(F_DUP2FD).
792 do_dup(struct thread *td, int flags, int old, int new,
795 struct filedesc *fdp;
796 struct filedescent *oldfde, *newfde;
806 * Verify we have a valid descriptor to dup from and possibly to
807 * dup to. Unlike dup() and dup2(), fcntl()'s F_DUPFD should
808 * return EINVAL when the new descriptor is out of bounds.
813 return (flags & DUP_FCNTL ? EINVAL : EBADF);
816 return (flags & DUP_FCNTL ? EINVAL : EBADF);
819 if (fget_locked(fdp, old) == NULL) {
820 FILEDESC_XUNLOCK(fdp);
823 oldfde = &fdp->fd_ofiles[old];
824 if (flags & DUP_FIXED && old == new) {
826 if (flags & DUP_CLOEXEC)
827 fdp->fd_ofiles[new].fde_flags |= UF_EXCLOSE;
828 FILEDESC_XUNLOCK(fdp);
831 fp = oldfde->fde_file;
835 * If the caller specified a file descriptor, make sure the file
836 * table is large enough to hold it, and grab it. Otherwise, just
837 * allocate a new descriptor the usual way.
839 if (flags & DUP_FIXED) {
840 if (new >= fdp->fd_nfiles) {
842 * The resource limits are here instead of e.g.
843 * fdalloc(), because the file descriptor table may be
844 * shared between processes, so we can't really use
845 * racct_add()/racct_sub(). Instead of counting the
846 * number of actually allocated descriptors, just put
847 * the limit on the size of the file descriptor table.
851 error = racct_set(p, RACCT_NOFILE, new + 1);
854 FILEDESC_XUNLOCK(fdp);
859 fdgrowtable_exp(fdp, new + 1);
860 oldfde = &fdp->fd_ofiles[old];
862 newfde = &fdp->fd_ofiles[new];
863 if (newfde->fde_file == NULL)
866 if ((error = fdalloc(td, new, &new)) != 0) {
867 FILEDESC_XUNLOCK(fdp);
871 newfde = &fdp->fd_ofiles[new];
874 KASSERT(fp == oldfde->fde_file, ("old fd has been modified"));
875 KASSERT(old != new, ("new fd is same as old"));
877 delfp = newfde->fde_file;
880 * Duplicate the source descriptor.
882 filecaps_free(&newfde->fde_caps);
884 filecaps_copy(&oldfde->fde_caps, &newfde->fde_caps);
885 if ((flags & DUP_CLOEXEC) != 0)
886 newfde->fde_flags = oldfde->fde_flags | UF_EXCLOSE;
888 newfde->fde_flags = oldfde->fde_flags & ~UF_EXCLOSE;
892 (void) closefp(fdp, new, delfp, td, 1);
893 /* closefp() drops the FILEDESC lock for us. */
895 FILEDESC_XUNLOCK(fdp);
902 * If sigio is on the list associated with a process or process group,
903 * disable signalling from the device, remove sigio from the list and
907 funsetown(struct sigio **sigiop)
917 *(sigio->sio_myref) = NULL;
918 if ((sigio)->sio_pgid < 0) {
919 struct pgrp *pg = (sigio)->sio_pgrp;
921 SLIST_REMOVE(&sigio->sio_pgrp->pg_sigiolst, sigio,
925 struct proc *p = (sigio)->sio_proc;
927 SLIST_REMOVE(&sigio->sio_proc->p_sigiolst, sigio,
932 crfree(sigio->sio_ucred);
933 free(sigio, M_SIGIO);
937 * Free a list of sigio structures.
938 * We only need to lock the SIGIO_LOCK because we have made ourselves
939 * inaccessible to callers of fsetown and therefore do not need to lock
940 * the proc or pgrp struct for the list manipulation.
943 funsetownlst(struct sigiolst *sigiolst)
949 sigio = SLIST_FIRST(sigiolst);
956 * Every entry of the list should belong
957 * to a single proc or pgrp.
959 if (sigio->sio_pgid < 0) {
960 pg = sigio->sio_pgrp;
961 PGRP_LOCK_ASSERT(pg, MA_NOTOWNED);
962 } else /* if (sigio->sio_pgid > 0) */ {
964 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
968 while ((sigio = SLIST_FIRST(sigiolst)) != NULL) {
969 *(sigio->sio_myref) = NULL;
971 KASSERT(sigio->sio_pgid < 0,
972 ("Proc sigio in pgrp sigio list"));
973 KASSERT(sigio->sio_pgrp == pg,
974 ("Bogus pgrp in sigio list"));
976 SLIST_REMOVE(&pg->pg_sigiolst, sigio, sigio,
979 } else /* if (p != NULL) */ {
980 KASSERT(sigio->sio_pgid > 0,
981 ("Pgrp sigio in proc sigio list"));
982 KASSERT(sigio->sio_proc == p,
983 ("Bogus proc in sigio list"));
985 SLIST_REMOVE(&p->p_sigiolst, sigio, sigio,
990 crfree(sigio->sio_ucred);
991 free(sigio, M_SIGIO);
998 * This is common code for FIOSETOWN ioctl called by fcntl(fd, F_SETOWN, arg).
1000 * After permission checking, add a sigio structure to the sigio list for
1001 * the process or process group.
1004 fsetown(pid_t pgid, struct sigio **sigiop)
1008 struct sigio *sigio;
1018 /* Allocate and fill in the new sigio out of locks. */
1019 sigio = malloc(sizeof(struct sigio), M_SIGIO, M_WAITOK);
1020 sigio->sio_pgid = pgid;
1021 sigio->sio_ucred = crhold(curthread->td_ucred);
1022 sigio->sio_myref = sigiop;
1024 sx_slock(&proctree_lock);
1033 * Policy - Don't allow a process to FSETOWN a process
1034 * in another session.
1036 * Remove this test to allow maximum flexibility or
1037 * restrict FSETOWN to the current process or process
1038 * group for maximum safety.
1041 if (proc->p_session != curthread->td_proc->p_session) {
1047 } else /* if (pgid < 0) */ {
1048 pgrp = pgfind(-pgid);
1056 * Policy - Don't allow a process to FSETOWN a process
1057 * in another session.
1059 * Remove this test to allow maximum flexibility or
1060 * restrict FSETOWN to the current process or process
1061 * group for maximum safety.
1063 if (pgrp->pg_session != curthread->td_proc->p_session) {
1074 * Since funsetownlst() is called without the proctree
1075 * locked, we need to check for P_WEXIT.
1076 * XXX: is ESRCH correct?
1078 if ((proc->p_flag & P_WEXIT) != 0) {
1083 SLIST_INSERT_HEAD(&proc->p_sigiolst, sigio, sio_pgsigio);
1084 sigio->sio_proc = proc;
1088 SLIST_INSERT_HEAD(&pgrp->pg_sigiolst, sigio, sio_pgsigio);
1089 sigio->sio_pgrp = pgrp;
1092 sx_sunlock(&proctree_lock);
1099 sx_sunlock(&proctree_lock);
1100 crfree(sigio->sio_ucred);
1101 free(sigio, M_SIGIO);
1106 * This is common code for FIOGETOWN ioctl called by fcntl(fd, F_GETOWN, arg).
1110 struct sigio **sigiop;
1115 pgid = (*sigiop != NULL) ? (*sigiop)->sio_pgid : 0;
1121 * Function drops the filedesc lock on return.
1124 closefp(struct filedesc *fdp, int fd, struct file *fp, struct thread *td,
1129 FILEDESC_XLOCK_ASSERT(fdp);
1132 if (td->td_proc->p_fdtol != NULL) {
1134 * Ask fdfree() to sleep to ensure that all relevant
1135 * process leaders can be traversed in closef().
1137 fdp->fd_holdleaderscount++;
1144 * We now hold the fp reference that used to be owned by the
1145 * descriptor array. We have to unlock the FILEDESC *AFTER*
1146 * knote_fdclose to prevent a race of the fd getting opened, a knote
1147 * added, and deleteing a knote for the new fd.
1149 knote_fdclose(td, fd);
1152 * We need to notify mqueue if the object is of type mqueue.
1154 if (fp->f_type == DTYPE_MQUEUE)
1155 mq_fdclose(td, fd, fp);
1156 FILEDESC_XUNLOCK(fdp);
1158 error = closef(fp, td);
1160 FILEDESC_XLOCK(fdp);
1161 fdp->fd_holdleaderscount--;
1162 if (fdp->fd_holdleaderscount == 0 &&
1163 fdp->fd_holdleaderswakeup != 0) {
1164 fdp->fd_holdleaderswakeup = 0;
1165 wakeup(&fdp->fd_holdleaderscount);
1167 FILEDESC_XUNLOCK(fdp);
1173 * Close a file descriptor.
1175 #ifndef _SYS_SYSPROTO_H_
1184 struct close_args *uap;
1187 return (kern_close(td, uap->fd));
1195 struct filedesc *fdp;
1198 fdp = td->td_proc->p_fd;
1200 AUDIT_SYSCLOSE(td, fd);
1202 FILEDESC_XLOCK(fdp);
1203 if ((fp = fget_locked(fdp, fd)) == NULL) {
1204 FILEDESC_XUNLOCK(fdp);
1209 /* closefp() drops the FILEDESC lock for us. */
1210 return (closefp(fdp, fd, fp, td, 1));
1214 * Close open file descriptors.
1216 #ifndef _SYS_SYSPROTO_H_
1217 struct closefrom_args {
1223 sys_closefrom(struct thread *td, struct closefrom_args *uap)
1225 struct filedesc *fdp;
1228 fdp = td->td_proc->p_fd;
1229 AUDIT_ARG_FD(uap->lowfd);
1232 * Treat negative starting file descriptor values identical to
1233 * closefrom(0) which closes all files.
1237 FILEDESC_SLOCK(fdp);
1238 for (fd = uap->lowfd; fd <= fdp->fd_lastfile; fd++) {
1239 if (fdp->fd_ofiles[fd].fde_file != NULL) {
1240 FILEDESC_SUNLOCK(fdp);
1241 (void)kern_close(td, fd);
1242 FILEDESC_SLOCK(fdp);
1245 FILEDESC_SUNLOCK(fdp);
1249 #if defined(COMPAT_43)
1251 * Return status information about a file descriptor.
1253 #ifndef _SYS_SYSPROTO_H_
1254 struct ofstat_args {
1261 ofstat(struct thread *td, struct ofstat_args *uap)
1267 error = kern_fstat(td, uap->fd, &ub);
1270 error = copyout(&oub, uap->sb, sizeof(oub));
1274 #endif /* COMPAT_43 */
1277 * Return status information about a file descriptor.
1279 #ifndef _SYS_SYSPROTO_H_
1287 sys_fstat(struct thread *td, struct fstat_args *uap)
1292 error = kern_fstat(td, uap->fd, &ub);
1294 error = copyout(&ub, uap->sb, sizeof(ub));
1299 kern_fstat(struct thread *td, int fd, struct stat *sbp)
1302 cap_rights_t rights;
1307 error = fget(td, fd, cap_rights_init(&rights, CAP_FSTAT), &fp);
1311 AUDIT_ARG_FILE(td->td_proc, fp);
1313 error = fo_stat(fp, sbp, td->td_ucred, td);
1316 if (error == 0 && KTRPOINT(td, KTR_STRUCT))
1323 * Return status information about a file descriptor.
1325 #ifndef _SYS_SYSPROTO_H_
1326 struct nfstat_args {
1333 sys_nfstat(struct thread *td, struct nfstat_args *uap)
1339 error = kern_fstat(td, uap->fd, &ub);
1341 cvtnstat(&ub, &nub);
1342 error = copyout(&nub, uap->sb, sizeof(nub));
1348 * Return pathconf information about a file descriptor.
1350 #ifndef _SYS_SYSPROTO_H_
1351 struct fpathconf_args {
1358 sys_fpathconf(struct thread *td, struct fpathconf_args *uap)
1362 cap_rights_t rights;
1365 error = fget(td, uap->fd, cap_rights_init(&rights, CAP_FPATHCONF), &fp);
1369 /* If asynchronous I/O is available, it works for all descriptors. */
1370 if (uap->name == _PC_ASYNC_IO) {
1371 td->td_retval[0] = async_io_version;
1376 vn_lock(vp, LK_SHARED | LK_RETRY);
1377 error = VOP_PATHCONF(vp, uap->name, td->td_retval);
1379 } else if (fp->f_type == DTYPE_PIPE || fp->f_type == DTYPE_SOCKET) {
1380 if (uap->name != _PC_PIPE_BUF) {
1383 td->td_retval[0] = PIPE_BUF;
1395 * Initialize filecaps structure.
1398 filecaps_init(struct filecaps *fcaps)
1401 bzero(fcaps, sizeof(*fcaps));
1402 fcaps->fc_nioctls = -1;
1406 * Copy filecaps structure allocating memory for ioctls array if needed.
1409 filecaps_copy(const struct filecaps *src, struct filecaps *dst)
1414 if (src->fc_ioctls != NULL) {
1415 KASSERT(src->fc_nioctls > 0,
1416 ("fc_ioctls != NULL, but fc_nioctls=%hd", src->fc_nioctls));
1418 size = sizeof(src->fc_ioctls[0]) * src->fc_nioctls;
1419 dst->fc_ioctls = malloc(size, M_FILECAPS, M_WAITOK);
1420 bcopy(src->fc_ioctls, dst->fc_ioctls, size);
1425 * Move filecaps structure to the new place and clear the old place.
1428 filecaps_move(struct filecaps *src, struct filecaps *dst)
1432 bzero(src, sizeof(*src));
1436 * Fill the given filecaps structure with full rights.
1439 filecaps_fill(struct filecaps *fcaps)
1442 CAP_ALL(&fcaps->fc_rights);
1443 fcaps->fc_ioctls = NULL;
1444 fcaps->fc_nioctls = -1;
1445 fcaps->fc_fcntls = CAP_FCNTL_ALL;
1449 * Free memory allocated within filecaps structure.
1452 filecaps_free(struct filecaps *fcaps)
1455 free(fcaps->fc_ioctls, M_FILECAPS);
1456 bzero(fcaps, sizeof(*fcaps));
1460 * Validate the given filecaps structure.
1463 filecaps_validate(const struct filecaps *fcaps, const char *func)
1466 KASSERT(cap_rights_is_valid(&fcaps->fc_rights),
1467 ("%s: invalid rights", func));
1468 KASSERT((fcaps->fc_fcntls & ~CAP_FCNTL_ALL) == 0,
1469 ("%s: invalid fcntls", func));
1470 KASSERT(fcaps->fc_fcntls == 0 ||
1471 cap_rights_is_set(&fcaps->fc_rights, CAP_FCNTL),
1472 ("%s: fcntls without CAP_FCNTL", func));
1473 KASSERT(fcaps->fc_ioctls != NULL ? fcaps->fc_nioctls > 0 :
1474 (fcaps->fc_nioctls == -1 || fcaps->fc_nioctls == 0),
1475 ("%s: invalid ioctls", func));
1476 KASSERT(fcaps->fc_nioctls == 0 ||
1477 cap_rights_is_set(&fcaps->fc_rights, CAP_IOCTL),
1478 ("%s: ioctls without CAP_IOCTL", func));
1482 fdgrowtable_exp(struct filedesc *fdp, int nfd)
1486 FILEDESC_XLOCK_ASSERT(fdp);
1488 nfd1 = fdp->fd_nfiles * 2;
1491 fdgrowtable(fdp, nfd1);
1495 * Grow the file table to accomodate (at least) nfd descriptors.
1498 fdgrowtable(struct filedesc *fdp, int nfd)
1500 struct filedesc0 *fdp0;
1501 struct freetable *ft;
1502 struct filedescent *ntable;
1503 struct filedescent *otable;
1504 int nnfiles, onfiles;
1505 NDSLOTTYPE *nmap, *omap;
1507 FILEDESC_XLOCK_ASSERT(fdp);
1509 KASSERT(fdp->fd_nfiles > 0, ("zero-length file table"));
1511 /* save old values */
1512 onfiles = fdp->fd_nfiles;
1513 otable = fdp->fd_ofiles;
1516 /* compute the size of the new table */
1517 nnfiles = NDSLOTS(nfd) * NDENTRIES; /* round up */
1518 if (nnfiles <= onfiles)
1519 /* the table is already large enough */
1523 * Allocate a new table. We need enough space for the
1524 * file entries themselves and the struct freetable we will use
1525 * when we decommission the table and place it on the freelist.
1526 * We place the struct freetable in the middle so we don't have
1527 * to worry about padding.
1529 ntable = malloc(nnfiles * sizeof(ntable[0]) + sizeof(struct freetable),
1530 M_FILEDESC, M_ZERO | M_WAITOK);
1531 /* copy the old data over and point at the new tables */
1532 memcpy(ntable, otable, onfiles * sizeof(*otable));
1533 fdp->fd_ofiles = ntable;
1536 * Allocate a new map only if the old is not large enough. It will
1537 * grow at a slower rate than the table as it can map more
1538 * entries than the table can hold.
1540 if (NDSLOTS(nnfiles) > NDSLOTS(onfiles)) {
1541 nmap = malloc(NDSLOTS(nnfiles) * NDSLOTSIZE, M_FILEDESC,
1543 /* copy over the old data and update the pointer */
1544 memcpy(nmap, omap, NDSLOTS(onfiles) * sizeof(*omap));
1549 * In order to have a valid pattern for fget_unlocked()
1550 * fdp->fd_nfiles must be the last member to be updated, otherwise
1551 * fget_unlocked() consumers may reference a new, higher value for
1552 * fdp->fd_nfiles before to access the fdp->fd_ofiles array,
1553 * resulting in OOB accesses.
1555 atomic_store_rel_int(&fdp->fd_nfiles, nnfiles);
1558 * Do not free the old file table, as some threads may still
1559 * reference entries within it. Instead, place it on a freelist
1560 * which will be processed when the struct filedesc is released.
1562 * Note that if onfiles == NDFILE, we're dealing with the original
1563 * static allocation contained within (struct filedesc0 *)fdp,
1564 * which must not be freed.
1566 if (onfiles > NDFILE) {
1567 ft = (struct freetable *)&otable[onfiles];
1568 fdp0 = (struct filedesc0 *)fdp;
1569 ft->ft_table = otable;
1570 SLIST_INSERT_HEAD(&fdp0->fd_free, ft, ft_next);
1573 * The map does not have the same possibility of threads still
1574 * holding references to it. So always free it as long as it
1575 * does not reference the original static allocation.
1577 if (NDSLOTS(onfiles) > NDSLOTS(NDFILE))
1578 free(omap, M_FILEDESC);
1582 * Allocate a file descriptor for the process.
1585 fdalloc(struct thread *td, int minfd, int *result)
1587 struct proc *p = td->td_proc;
1588 struct filedesc *fdp = p->p_fd;
1589 int fd = -1, maxfd, allocfd;
1594 FILEDESC_XLOCK_ASSERT(fdp);
1596 if (fdp->fd_freefile > minfd)
1597 minfd = fdp->fd_freefile;
1599 maxfd = getmaxfd(p);
1602 * Search the bitmap for a free descriptor starting at minfd.
1603 * If none is found, grow the file table.
1605 fd = fd_first_free(fdp, minfd, fdp->fd_nfiles);
1608 if (fd >= fdp->fd_nfiles) {
1609 allocfd = min(fd * 2, maxfd);
1612 error = racct_set(p, RACCT_NOFILE, allocfd);
1618 * fd is already equal to first free descriptor >= minfd, so
1619 * we only need to grow the table and we are done.
1621 fdgrowtable_exp(fdp, allocfd);
1625 * Perform some sanity checks, then mark the file descriptor as
1626 * used and return it to the caller.
1628 KASSERT(fd >= 0 && fd < min(maxfd, fdp->fd_nfiles),
1629 ("invalid descriptor %d", fd));
1630 KASSERT(!fdisused(fdp, fd),
1631 ("fd_first_free() returned non-free descriptor"));
1632 KASSERT(fdp->fd_ofiles[fd].fde_file == NULL,
1633 ("file descriptor isn't free"));
1634 KASSERT(fdp->fd_ofiles[fd].fde_flags == 0, ("file flags are set"));
1641 * Allocate n file descriptors for the process.
1644 fdallocn(struct thread *td, int minfd, int *fds, int n)
1646 struct proc *p = td->td_proc;
1647 struct filedesc *fdp = p->p_fd;
1650 FILEDESC_XLOCK_ASSERT(fdp);
1652 if (!fdavail(td, n))
1655 for (i = 0; i < n; i++)
1656 if (fdalloc(td, 0, &fds[i]) != 0)
1660 for (i--; i >= 0; i--)
1661 fdunused(fdp, fds[i]);
1669 * Check to see whether n user file descriptors are available to the process
1673 fdavail(struct thread *td, int n)
1675 struct proc *p = td->td_proc;
1676 struct filedesc *fdp = td->td_proc->p_fd;
1679 FILEDESC_LOCK_ASSERT(fdp);
1682 * XXX: This is only called from uipc_usrreq.c:unp_externalize();
1683 * call racct_add() from there instead of dealing with containers
1687 if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0)
1689 last = min(fdp->fd_nfiles, lim);
1690 for (i = fdp->fd_freefile; i < last; i++) {
1691 if (fdp->fd_ofiles[i].fde_file == NULL && --n <= 0)
1698 * Create a new open file structure and allocate a file decriptor for the
1699 * process that refers to it. We add one reference to the file for the
1700 * descriptor table and one reference for resultfp. This is to prevent us
1701 * being preempted and the entry in the descriptor table closed after we
1702 * release the FILEDESC lock.
1705 falloc(struct thread *td, struct file **resultfp, int *resultfd, int flags)
1710 error = falloc_noinstall(td, &fp);
1712 return (error); /* no reference held on error */
1714 error = finstall(td, fp, &fd, flags, NULL);
1716 fdrop(fp, td); /* one reference (fp only) */
1720 if (resultfp != NULL)
1721 *resultfp = fp; /* copy out result */
1723 fdrop(fp, td); /* release local reference */
1725 if (resultfd != NULL)
1732 * Create a new open file structure without allocating a file descriptor.
1735 falloc_noinstall(struct thread *td, struct file **resultfp)
1738 int maxuserfiles = maxfiles - (maxfiles / 20);
1739 static struct timeval lastfail;
1742 KASSERT(resultfp != NULL, ("%s: resultfp == NULL", __func__));
1744 if ((openfiles >= maxuserfiles &&
1745 priv_check(td, PRIV_MAXFILES) != 0) ||
1746 openfiles >= maxfiles) {
1747 if (ppsratecheck(&lastfail, &curfail, 1)) {
1748 printf("kern.maxfiles limit exceeded by uid %i, "
1749 "please see tuning(7).\n", td->td_ucred->cr_ruid);
1753 atomic_add_int(&openfiles, 1);
1754 fp = uma_zalloc(file_zone, M_WAITOK | M_ZERO);
1755 refcount_init(&fp->f_count, 1);
1756 fp->f_cred = crhold(td->td_ucred);
1757 fp->f_ops = &badfileops;
1765 * Install a file in a file descriptor table.
1768 finstall(struct thread *td, struct file *fp, int *fd, int flags,
1769 struct filecaps *fcaps)
1771 struct filedesc *fdp = td->td_proc->p_fd;
1772 struct filedescent *fde;
1775 KASSERT(fd != NULL, ("%s: fd == NULL", __func__));
1776 KASSERT(fp != NULL, ("%s: fp == NULL", __func__));
1778 filecaps_validate(fcaps, __func__);
1780 FILEDESC_XLOCK(fdp);
1781 if ((error = fdalloc(td, 0, fd))) {
1782 FILEDESC_XUNLOCK(fdp);
1786 fde = &fdp->fd_ofiles[*fd];
1788 if ((flags & O_CLOEXEC) != 0)
1789 fde->fde_flags |= UF_EXCLOSE;
1791 filecaps_move(fcaps, &fde->fde_caps);
1793 filecaps_fill(&fde->fde_caps);
1794 FILEDESC_XUNLOCK(fdp);
1799 * Build a new filedesc structure from another.
1800 * Copy the current, root, and jail root vnode references.
1803 fdinit(struct filedesc *fdp)
1805 struct filedesc0 *newfdp;
1807 newfdp = malloc(sizeof *newfdp, M_FILEDESC, M_WAITOK | M_ZERO);
1808 FILEDESC_LOCK_INIT(&newfdp->fd_fd);
1810 FILEDESC_SLOCK(fdp);
1811 newfdp->fd_fd.fd_cdir = fdp->fd_cdir;
1812 if (newfdp->fd_fd.fd_cdir)
1813 VREF(newfdp->fd_fd.fd_cdir);
1814 newfdp->fd_fd.fd_rdir = fdp->fd_rdir;
1815 if (newfdp->fd_fd.fd_rdir)
1816 VREF(newfdp->fd_fd.fd_rdir);
1817 newfdp->fd_fd.fd_jdir = fdp->fd_jdir;
1818 if (newfdp->fd_fd.fd_jdir)
1819 VREF(newfdp->fd_fd.fd_jdir);
1820 FILEDESC_SUNLOCK(fdp);
1823 /* Create the file descriptor table. */
1824 newfdp->fd_fd.fd_refcnt = 1;
1825 newfdp->fd_fd.fd_holdcnt = 1;
1826 newfdp->fd_fd.fd_cmask = CMASK;
1827 newfdp->fd_fd.fd_ofiles = newfdp->fd_dfiles;
1828 newfdp->fd_fd.fd_nfiles = NDFILE;
1829 newfdp->fd_fd.fd_map = newfdp->fd_dmap;
1830 newfdp->fd_fd.fd_lastfile = -1;
1831 return (&newfdp->fd_fd);
1834 static struct filedesc *
1835 fdhold(struct proc *p)
1837 struct filedesc *fdp;
1839 mtx_lock(&fdesc_mtx);
1843 mtx_unlock(&fdesc_mtx);
1848 fddrop(struct filedesc *fdp)
1850 struct filedesc0 *fdp0;
1851 struct freetable *ft;
1854 mtx_lock(&fdesc_mtx);
1855 i = --fdp->fd_holdcnt;
1856 mtx_unlock(&fdesc_mtx);
1860 FILEDESC_LOCK_DESTROY(fdp);
1861 fdp0 = (struct filedesc0 *)fdp;
1862 while ((ft = SLIST_FIRST(&fdp0->fd_free)) != NULL) {
1863 SLIST_REMOVE_HEAD(&fdp0->fd_free, ft_next);
1864 free(ft->ft_table, M_FILEDESC);
1866 free(fdp, M_FILEDESC);
1870 * Share a filedesc structure.
1873 fdshare(struct filedesc *fdp)
1876 FILEDESC_XLOCK(fdp);
1878 FILEDESC_XUNLOCK(fdp);
1883 * Unshare a filedesc structure, if necessary by making a copy
1886 fdunshare(struct proc *p, struct thread *td)
1888 struct filedesc *tmp;
1890 if (p->p_fd->fd_refcnt == 1)
1893 tmp = fdcopy(p->p_fd);
1899 * Copy a filedesc structure. A NULL pointer in returns a NULL reference,
1900 * this is to ease callers, not catch errors.
1903 fdcopy(struct filedesc *fdp)
1905 struct filedesc *newfdp;
1906 struct filedescent *nfde, *ofde;
1909 /* Certain daemons might not have file descriptors. */
1913 newfdp = fdinit(fdp);
1914 FILEDESC_SLOCK(fdp);
1915 while (fdp->fd_lastfile >= newfdp->fd_nfiles) {
1916 FILEDESC_SUNLOCK(fdp);
1917 FILEDESC_XLOCK(newfdp);
1918 fdgrowtable(newfdp, fdp->fd_lastfile + 1);
1919 FILEDESC_XUNLOCK(newfdp);
1920 FILEDESC_SLOCK(fdp);
1922 /* copy all passable descriptors (i.e. not kqueue) */
1923 newfdp->fd_freefile = -1;
1924 for (i = 0; i <= fdp->fd_lastfile; ++i) {
1925 ofde = &fdp->fd_ofiles[i];
1926 if (fdisused(fdp, i) &&
1927 (ofde->fde_file->f_ops->fo_flags & DFLAG_PASSABLE) &&
1928 ofde->fde_file->f_ops != &badfileops) {
1929 nfde = &newfdp->fd_ofiles[i];
1931 filecaps_copy(&ofde->fde_caps, &nfde->fde_caps);
1932 fhold(nfde->fde_file);
1933 newfdp->fd_lastfile = i;
1935 if (newfdp->fd_freefile == -1)
1936 newfdp->fd_freefile = i;
1939 newfdp->fd_cmask = fdp->fd_cmask;
1940 FILEDESC_SUNLOCK(fdp);
1941 FILEDESC_XLOCK(newfdp);
1942 for (i = 0; i <= newfdp->fd_lastfile; ++i) {
1943 if (newfdp->fd_ofiles[i].fde_file != NULL)
1946 if (newfdp->fd_freefile == -1)
1947 newfdp->fd_freefile = i;
1948 FILEDESC_XUNLOCK(newfdp);
1953 * Release a filedesc structure.
1956 fdescfree(struct thread *td)
1958 struct filedesc *fdp;
1960 struct filedesc_to_leader *fdtol;
1962 struct vnode *cdir, *jdir, *rdir, *vp;
1965 /* Certain daemons might not have file descriptors. */
1966 fdp = td->td_proc->p_fd;
1971 PROC_LOCK(td->td_proc);
1972 racct_set(td->td_proc, RACCT_NOFILE, 0);
1973 PROC_UNLOCK(td->td_proc);
1976 /* Check for special need to clear POSIX style locks */
1977 fdtol = td->td_proc->p_fdtol;
1978 if (fdtol != NULL) {
1979 FILEDESC_XLOCK(fdp);
1980 KASSERT(fdtol->fdl_refcount > 0,
1981 ("filedesc_to_refcount botch: fdl_refcount=%d",
1982 fdtol->fdl_refcount));
1983 if (fdtol->fdl_refcount == 1 &&
1984 (td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
1985 for (i = 0; i <= fdp->fd_lastfile; i++) {
1986 fp = fdp->fd_ofiles[i].fde_file;
1987 if (fp == NULL || fp->f_type != DTYPE_VNODE)
1990 FILEDESC_XUNLOCK(fdp);
1991 lf.l_whence = SEEK_SET;
1994 lf.l_type = F_UNLCK;
1996 (void) VOP_ADVLOCK(vp,
1997 (caddr_t)td->td_proc->p_leader, F_UNLCK,
1999 FILEDESC_XLOCK(fdp);
2004 if (fdtol->fdl_refcount == 1) {
2005 if (fdp->fd_holdleaderscount > 0 &&
2006 (td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
2008 * close() or do_dup() has cleared a reference
2009 * in a shared file descriptor table.
2011 fdp->fd_holdleaderswakeup = 1;
2012 sx_sleep(&fdp->fd_holdleaderscount,
2013 FILEDESC_LOCK(fdp), PLOCK, "fdlhold", 0);
2016 if (fdtol->fdl_holdcount > 0) {
2018 * Ensure that fdtol->fdl_leader remains
2019 * valid in closef().
2021 fdtol->fdl_wakeup = 1;
2022 sx_sleep(fdtol, FILEDESC_LOCK(fdp), PLOCK,
2027 fdtol->fdl_refcount--;
2028 if (fdtol->fdl_refcount == 0 &&
2029 fdtol->fdl_holdcount == 0) {
2030 fdtol->fdl_next->fdl_prev = fdtol->fdl_prev;
2031 fdtol->fdl_prev->fdl_next = fdtol->fdl_next;
2034 td->td_proc->p_fdtol = NULL;
2035 FILEDESC_XUNLOCK(fdp);
2037 free(fdtol, M_FILEDESC_TO_LEADER);
2039 FILEDESC_XLOCK(fdp);
2040 i = --fdp->fd_refcnt;
2041 FILEDESC_XUNLOCK(fdp);
2045 for (i = 0; i <= fdp->fd_lastfile; i++) {
2046 fp = fdp->fd_ofiles[i].fde_file;
2048 FILEDESC_XLOCK(fdp);
2050 FILEDESC_XUNLOCK(fdp);
2051 (void) closef(fp, td);
2054 FILEDESC_XLOCK(fdp);
2056 /* XXX This should happen earlier. */
2057 mtx_lock(&fdesc_mtx);
2058 td->td_proc->p_fd = NULL;
2059 mtx_unlock(&fdesc_mtx);
2061 if (fdp->fd_nfiles > NDFILE)
2062 free(fdp->fd_ofiles, M_FILEDESC);
2063 if (NDSLOTS(fdp->fd_nfiles) > NDSLOTS(NDFILE))
2064 free(fdp->fd_map, M_FILEDESC);
2068 cdir = fdp->fd_cdir;
2069 fdp->fd_cdir = NULL;
2070 rdir = fdp->fd_rdir;
2071 fdp->fd_rdir = NULL;
2072 jdir = fdp->fd_jdir;
2073 fdp->fd_jdir = NULL;
2074 FILEDESC_XUNLOCK(fdp);
2087 * For setugid programs, we don't want to people to use that setugidness
2088 * to generate error messages which write to a file which otherwise would
2089 * otherwise be off-limits to the process. We check for filesystems where
2090 * the vnode can change out from under us after execve (like [lin]procfs).
2092 * Since setugidsafety calls this only for fd 0, 1 and 2, this check is
2093 * sufficient. We also don't check for setugidness since we know we are.
2096 is_unsafe(struct file *fp)
2098 if (fp->f_type == DTYPE_VNODE) {
2099 struct vnode *vp = fp->f_vnode;
2101 if ((vp->v_vflag & VV_PROCDEP) != 0)
2108 * Make this setguid thing safe, if at all possible.
2111 setugidsafety(struct thread *td)
2113 struct filedesc *fdp;
2117 /* Certain daemons might not have file descriptors. */
2118 fdp = td->td_proc->p_fd;
2123 * Note: fdp->fd_ofiles may be reallocated out from under us while
2124 * we are blocked in a close. Be careful!
2126 FILEDESC_XLOCK(fdp);
2127 for (i = 0; i <= fdp->fd_lastfile; i++) {
2130 fp = fdp->fd_ofiles[i].fde_file;
2131 if (fp != NULL && is_unsafe(fp)) {
2132 knote_fdclose(td, i);
2134 * NULL-out descriptor prior to close to avoid
2135 * a race while close blocks.
2138 FILEDESC_XUNLOCK(fdp);
2139 (void) closef(fp, td);
2140 FILEDESC_XLOCK(fdp);
2143 FILEDESC_XUNLOCK(fdp);
2147 * If a specific file object occupies a specific file descriptor, close the
2148 * file descriptor entry and drop a reference on the file object. This is a
2149 * convenience function to handle a subsequent error in a function that calls
2150 * falloc() that handles the race that another thread might have closed the
2151 * file descriptor out from under the thread creating the file object.
2154 fdclose(struct filedesc *fdp, struct file *fp, int idx, struct thread *td)
2157 FILEDESC_XLOCK(fdp);
2158 if (fdp->fd_ofiles[idx].fde_file == fp) {
2160 FILEDESC_XUNLOCK(fdp);
2163 FILEDESC_XUNLOCK(fdp);
2167 * Close any files on exec?
2170 fdcloseexec(struct thread *td)
2172 struct filedesc *fdp;
2173 struct filedescent *fde;
2177 /* Certain daemons might not have file descriptors. */
2178 fdp = td->td_proc->p_fd;
2183 * We cannot cache fd_ofiles since operations
2184 * may block and rip them out from under us.
2186 FILEDESC_XLOCK(fdp);
2187 for (i = 0; i <= fdp->fd_lastfile; i++) {
2188 fde = &fdp->fd_ofiles[i];
2190 if (fp != NULL && (fp->f_type == DTYPE_MQUEUE ||
2191 (fde->fde_flags & UF_EXCLOSE))) {
2193 (void) closefp(fdp, i, fp, td, 0);
2194 /* closefp() drops the FILEDESC lock. */
2195 FILEDESC_XLOCK(fdp);
2198 FILEDESC_XUNLOCK(fdp);
2202 * It is unsafe for set[ug]id processes to be started with file
2203 * descriptors 0..2 closed, as these descriptors are given implicit
2204 * significance in the Standard C library. fdcheckstd() will create a
2205 * descriptor referencing /dev/null for each of stdin, stdout, and
2206 * stderr that is not already open.
2209 fdcheckstd(struct thread *td)
2211 struct filedesc *fdp;
2212 register_t retval, save;
2213 int i, error, devnull;
2215 fdp = td->td_proc->p_fd;
2218 KASSERT(fdp->fd_refcnt == 1, ("the fdtable should not be shared"));
2221 for (i = 0; i < 3; i++) {
2222 if (fdp->fd_ofiles[i].fde_file != NULL)
2225 save = td->td_retval[0];
2226 error = kern_open(td, "/dev/null", UIO_SYSSPACE,
2228 devnull = td->td_retval[0];
2229 td->td_retval[0] = save;
2232 KASSERT(devnull == i, ("oof, we didn't get our fd"));
2234 error = do_dup(td, DUP_FIXED, devnull, i, &retval);
2243 * Internal form of close. Decrement reference count on file structure.
2244 * Note: td may be NULL when closing a file that was being passed in a
2247 * XXXRW: Giant is not required for the caller, but often will be held; this
2248 * makes it moderately likely the Giant will be recursed in the VFS case.
2251 closef(struct file *fp, struct thread *td)
2255 struct filedesc_to_leader *fdtol;
2256 struct filedesc *fdp;
2259 * POSIX record locking dictates that any close releases ALL
2260 * locks owned by this process. This is handled by setting
2261 * a flag in the unlock to free ONLY locks obeying POSIX
2262 * semantics, and not to free BSD-style file locks.
2263 * If the descriptor was in a message, POSIX-style locks
2264 * aren't passed with the descriptor, and the thread pointer
2265 * will be NULL. Callers should be careful only to pass a
2266 * NULL thread pointer when there really is no owning
2267 * context that might have locks, or the locks will be
2270 if (fp->f_type == DTYPE_VNODE && td != NULL) {
2272 if ((td->td_proc->p_leader->p_flag & P_ADVLOCK) != 0) {
2273 lf.l_whence = SEEK_SET;
2276 lf.l_type = F_UNLCK;
2277 (void) VOP_ADVLOCK(vp, (caddr_t)td->td_proc->p_leader,
2278 F_UNLCK, &lf, F_POSIX);
2280 fdtol = td->td_proc->p_fdtol;
2281 if (fdtol != NULL) {
2283 * Handle special case where file descriptor table is
2284 * shared between multiple process leaders.
2286 fdp = td->td_proc->p_fd;
2287 FILEDESC_XLOCK(fdp);
2288 for (fdtol = fdtol->fdl_next;
2289 fdtol != td->td_proc->p_fdtol;
2290 fdtol = fdtol->fdl_next) {
2291 if ((fdtol->fdl_leader->p_flag &
2294 fdtol->fdl_holdcount++;
2295 FILEDESC_XUNLOCK(fdp);
2296 lf.l_whence = SEEK_SET;
2299 lf.l_type = F_UNLCK;
2301 (void) VOP_ADVLOCK(vp,
2302 (caddr_t)fdtol->fdl_leader, F_UNLCK, &lf,
2304 FILEDESC_XLOCK(fdp);
2305 fdtol->fdl_holdcount--;
2306 if (fdtol->fdl_holdcount == 0 &&
2307 fdtol->fdl_wakeup != 0) {
2308 fdtol->fdl_wakeup = 0;
2312 FILEDESC_XUNLOCK(fdp);
2315 return (fdrop(fp, td));
2319 * Initialize the file pointer with the specified properties.
2321 * The ops are set with release semantics to be certain that the flags, type,
2322 * and data are visible when ops is. This is to prevent ops methods from being
2323 * called with bad data.
2326 finit(struct file *fp, u_int flag, short type, void *data, struct fileops *ops)
2331 atomic_store_rel_ptr((volatile uintptr_t *)&fp->f_ops, (uintptr_t)ops);
2335 fget_unlocked(struct filedesc *fdp, int fd, cap_rights_t *needrightsp,
2336 int needfcntl, struct file **fpp, cap_rights_t *haverightsp)
2341 cap_rights_t haverights;
2346 * Avoid reads reordering and then a first access to the
2347 * fdp->fd_ofiles table which could result in OOB operation.
2349 if (fd < 0 || fd >= atomic_load_acq_int(&fdp->fd_nfiles))
2352 * Fetch the descriptor locklessly. We avoid fdrop() races by
2353 * never raising a refcount above 0. To accomplish this we have
2354 * to use a cmpset loop rather than an atomic_add. The descriptor
2355 * must be re-verified once we acquire a reference to be certain
2356 * that the identity is still correct and we did not lose a race
2357 * due to preemption.
2360 fp = fdp->fd_ofiles[fd].fde_file;
2364 haverights = *cap_rights(fdp, fd);
2365 if (needrightsp != NULL) {
2366 error = cap_check(&haverights, needrightsp);
2369 if (cap_rights_is_set(needrightsp, CAP_FCNTL)) {
2370 error = cap_fcntl_check(fdp, fd, needfcntl);
2376 count = fp->f_count;
2380 * Use an acquire barrier to prevent caching of fd_ofiles
2381 * so it is refreshed for verification.
2383 if (atomic_cmpset_acq_int(&fp->f_count, count, count + 1) != 1)
2385 if (fp == fdp->fd_ofiles[fd].fde_file)
2387 fdrop(fp, curthread);
2390 if (haverightsp != NULL) {
2392 *haverightsp = haverights;
2394 CAP_ALL(haverightsp);
2401 * Extract the file pointer associated with the specified descriptor for the
2402 * current user process.
2404 * If the descriptor doesn't exist or doesn't match 'flags', EBADF is
2407 * File's rights will be checked against the capability rights mask.
2409 * If an error occured the non-zero error is returned and *fpp is set to
2410 * NULL. Otherwise *fpp is held and set and zero is returned. Caller is
2411 * responsible for fdrop().
2414 _fget(struct thread *td, int fd, struct file **fpp, int flags,
2415 cap_rights_t *needrightsp, u_char *maxprotp)
2417 struct filedesc *fdp;
2419 cap_rights_t haverights, needrights;
2423 if (td == NULL || (fdp = td->td_proc->p_fd) == NULL)
2425 if (needrightsp != NULL)
2426 needrights = *needrightsp;
2428 cap_rights_init(&needrights);
2429 if (maxprotp != NULL)
2430 cap_rights_set(&needrights, CAP_MMAP);
2431 error = fget_unlocked(fdp, fd, &needrights, 0, &fp, &haverights);
2434 if (fp->f_ops == &badfileops) {
2441 * If requested, convert capability rights to access flags.
2443 if (maxprotp != NULL)
2444 *maxprotp = cap_rights_to_vmprot(&haverights);
2445 #else /* !CAPABILITIES */
2446 if (maxprotp != NULL)
2447 *maxprotp = VM_PROT_ALL;
2448 #endif /* CAPABILITIES */
2451 * FREAD and FWRITE failure return EBADF as per POSIX.
2457 if ((fp->f_flag & flags) == 0)
2461 if ((fp->f_flag & (FREAD | FEXEC)) == 0 ||
2462 ((fp->f_flag & FWRITE) != 0))
2468 KASSERT(0, ("wrong flags"));
2481 fget(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2484 return(_fget(td, fd, fpp, 0, rightsp, NULL));
2488 fget_mmap(struct thread *td, int fd, cap_rights_t *rightsp, u_char *maxprotp,
2492 return (_fget(td, fd, fpp, 0, rightsp, maxprotp));
2496 fget_read(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2499 return(_fget(td, fd, fpp, FREAD, rightsp, NULL));
2503 fget_write(struct thread *td, int fd, cap_rights_t *rightsp, struct file **fpp)
2506 return (_fget(td, fd, fpp, FWRITE, rightsp, NULL));
2510 * Like fget() but loads the underlying vnode, or returns an error if the
2511 * descriptor does not represent a vnode. Note that pipes use vnodes but
2512 * never have VM objects. The returned vnode will be vref()'d.
2514 * XXX: what about the unused flags ?
2517 _fgetvp(struct thread *td, int fd, int flags, cap_rights_t *needrightsp,
2524 error = _fget(td, fd, &fp, flags, needrightsp, NULL);
2527 if (fp->f_vnode == NULL) {
2539 fgetvp(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2542 return (_fgetvp(td, fd, 0, rightsp, vpp));
2546 fgetvp_rights(struct thread *td, int fd, cap_rights_t *needrightsp,
2547 struct filecaps *havecaps, struct vnode **vpp)
2549 struct filedesc *fdp;
2555 if (td == NULL || (fdp = td->td_proc->p_fd) == NULL)
2558 fp = fget_locked(fdp, fd);
2559 if (fp == NULL || fp->f_ops == &badfileops)
2563 if (needrightsp != NULL) {
2564 error = cap_check(cap_rights(fdp, fd), needrightsp);
2570 if (fp->f_vnode == NULL)
2575 filecaps_copy(&fdp->fd_ofiles[fd].fde_caps, havecaps);
2581 fgetvp_read(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2584 return (_fgetvp(td, fd, FREAD, rightsp, vpp));
2588 fgetvp_exec(struct thread *td, int fd, cap_rights_t *rightsp, struct vnode **vpp)
2591 return (_fgetvp(td, fd, FEXEC, rightsp, vpp));
2596 fgetvp_write(struct thread *td, int fd, cap_rights_t *rightsp,
2600 return (_fgetvp(td, fd, FWRITE, rightsp, vpp));
2605 * Like fget() but loads the underlying socket, or returns an error if the
2606 * descriptor does not represent a socket.
2608 * We bump the ref count on the returned socket. XXX Also obtain the SX lock
2611 * Note: fgetsock() and fputsock() are deprecated, as consumers should rely
2612 * on their file descriptor reference to prevent the socket from being free'd
2616 fgetsock(struct thread *td, int fd, cap_rights_t *rightsp, struct socket **spp,
2625 if ((error = _fget(td, fd, &fp, 0, rightsp, NULL)) != 0)
2627 if (fp->f_type != DTYPE_SOCKET) {
2632 *fflagp = fp->f_flag;
2643 * Drop the reference count on the socket and XXX release the SX lock in the
2644 * future. The last reference closes the socket.
2646 * Note: fputsock() is deprecated, see comment for fgetsock().
2649 fputsock(struct socket *so)
2654 CURVNET_SET(so->so_vnet);
2660 * Handle the last reference to a file being closed.
2663 _fdrop(struct file *fp, struct thread *td)
2668 if (fp->f_count != 0)
2669 panic("fdrop: count %d", fp->f_count);
2670 if (fp->f_ops != &badfileops)
2671 error = fo_close(fp, td);
2672 atomic_subtract_int(&openfiles, 1);
2674 free(fp->f_advice, M_FADVISE);
2675 uma_zfree(file_zone, fp);
2681 * Apply an advisory lock on a file descriptor.
2683 * Just attempt to get a record lock of the requested type on the entire file
2684 * (l_whence = SEEK_SET, l_start = 0, l_len = 0).
2686 #ifndef _SYS_SYSPROTO_H_
2694 sys_flock(struct thread *td, struct flock_args *uap)
2699 cap_rights_t rights;
2702 error = fget(td, uap->fd, cap_rights_init(&rights, CAP_FLOCK), &fp);
2705 if (fp->f_type != DTYPE_VNODE) {
2707 return (EOPNOTSUPP);
2711 lf.l_whence = SEEK_SET;
2714 if (uap->how & LOCK_UN) {
2715 lf.l_type = F_UNLCK;
2716 atomic_clear_int(&fp->f_flag, FHASLOCK);
2717 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
2720 if (uap->how & LOCK_EX)
2721 lf.l_type = F_WRLCK;
2722 else if (uap->how & LOCK_SH)
2723 lf.l_type = F_RDLCK;
2728 atomic_set_int(&fp->f_flag, FHASLOCK);
2729 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf,
2730 (uap->how & LOCK_NB) ? F_FLOCK : F_FLOCK | F_WAIT);
2736 * Duplicate the specified descriptor to a free descriptor.
2739 dupfdopen(struct thread *td, struct filedesc *fdp, int dfd, int mode,
2740 int openerror, int *indxp)
2745 KASSERT(openerror == ENODEV || openerror == ENXIO,
2746 ("unexpected error %d in %s", openerror, __func__));
2749 * If the to-be-dup'd fd number is greater than the allowed number
2750 * of file descriptors, or the fd to be dup'd has already been
2751 * closed, then reject.
2753 FILEDESC_XLOCK(fdp);
2754 if ((fp = fget_locked(fdp, dfd)) == NULL) {
2755 FILEDESC_XUNLOCK(fdp);
2759 error = fdalloc(td, 0, &indx);
2761 FILEDESC_XUNLOCK(fdp);
2766 * There are two cases of interest here.
2768 * For ENODEV simply dup (dfd) to file descriptor (indx) and return.
2770 * For ENXIO steal away the file structure from (dfd) and store it in
2771 * (indx). (dfd) is effectively closed by this operation.
2773 switch (openerror) {
2776 * Check that the mode the file is being opened for is a
2777 * subset of the mode of the existing descriptor.
2779 if (((mode & (FREAD|FWRITE)) | fp->f_flag) != fp->f_flag) {
2780 fdunused(fdp, indx);
2781 FILEDESC_XUNLOCK(fdp);
2785 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
2786 filecaps_copy(&fdp->fd_ofiles[dfd].fde_caps,
2787 &fdp->fd_ofiles[indx].fde_caps);
2791 * Steal away the file pointer from dfd and stuff it into indx.
2793 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
2794 bzero(&fdp->fd_ofiles[dfd], sizeof(fdp->fd_ofiles[dfd]));
2798 FILEDESC_XUNLOCK(fdp);
2804 * Scan all active processes and prisons to see if any of them have a current
2805 * or root directory of `olddp'. If so, replace them with the new mount point.
2808 mountcheckdirs(struct vnode *olddp, struct vnode *newdp)
2810 struct filedesc *fdp;
2815 if (vrefcnt(olddp) == 1)
2818 sx_slock(&allproc_lock);
2819 FOREACH_PROC_IN_SYSTEM(p) {
2823 FILEDESC_XLOCK(fdp);
2824 if (fdp->fd_cdir == olddp) {
2826 fdp->fd_cdir = newdp;
2829 if (fdp->fd_rdir == olddp) {
2831 fdp->fd_rdir = newdp;
2834 if (fdp->fd_jdir == olddp) {
2836 fdp->fd_jdir = newdp;
2839 FILEDESC_XUNLOCK(fdp);
2842 sx_sunlock(&allproc_lock);
2843 if (rootvnode == olddp) {
2848 mtx_lock(&prison0.pr_mtx);
2849 if (prison0.pr_root == olddp) {
2851 prison0.pr_root = newdp;
2854 mtx_unlock(&prison0.pr_mtx);
2855 sx_slock(&allprison_lock);
2856 TAILQ_FOREACH(pr, &allprison, pr_list) {
2857 mtx_lock(&pr->pr_mtx);
2858 if (pr->pr_root == olddp) {
2860 pr->pr_root = newdp;
2863 mtx_unlock(&pr->pr_mtx);
2865 sx_sunlock(&allprison_lock);
2870 struct filedesc_to_leader *
2871 filedesc_to_leader_alloc(struct filedesc_to_leader *old, struct filedesc *fdp, struct proc *leader)
2873 struct filedesc_to_leader *fdtol;
2875 fdtol = malloc(sizeof(struct filedesc_to_leader),
2876 M_FILEDESC_TO_LEADER,
2878 fdtol->fdl_refcount = 1;
2879 fdtol->fdl_holdcount = 0;
2880 fdtol->fdl_wakeup = 0;
2881 fdtol->fdl_leader = leader;
2883 FILEDESC_XLOCK(fdp);
2884 fdtol->fdl_next = old->fdl_next;
2885 fdtol->fdl_prev = old;
2886 old->fdl_next = fdtol;
2887 fdtol->fdl_next->fdl_prev = fdtol;
2888 FILEDESC_XUNLOCK(fdp);
2890 fdtol->fdl_next = fdtol;
2891 fdtol->fdl_prev = fdtol;
2897 * Get file structures globally.
2900 sysctl_kern_file(SYSCTL_HANDLER_ARGS)
2903 struct filedesc *fdp;
2908 error = sysctl_wire_old_buffer(req, 0);
2911 if (req->oldptr == NULL) {
2913 sx_slock(&allproc_lock);
2914 FOREACH_PROC_IN_SYSTEM(p) {
2915 if (p->p_state == PRS_NEW)
2920 /* overestimates sparse tables. */
2921 if (fdp->fd_lastfile > 0)
2922 n += fdp->fd_lastfile;
2925 sx_sunlock(&allproc_lock);
2926 return (SYSCTL_OUT(req, 0, n * sizeof(xf)));
2929 bzero(&xf, sizeof(xf));
2930 xf.xf_size = sizeof(xf);
2931 sx_slock(&allproc_lock);
2932 FOREACH_PROC_IN_SYSTEM(p) {
2934 if (p->p_state == PRS_NEW) {
2938 if (p_cansee(req->td, p) != 0) {
2942 xf.xf_pid = p->p_pid;
2943 xf.xf_uid = p->p_ucred->cr_uid;
2948 FILEDESC_SLOCK(fdp);
2949 for (n = 0; fdp->fd_refcnt > 0 && n <= fdp->fd_lastfile; ++n) {
2950 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL)
2954 xf.xf_data = fp->f_data;
2955 xf.xf_vnode = fp->f_vnode;
2956 xf.xf_type = fp->f_type;
2957 xf.xf_count = fp->f_count;
2959 xf.xf_offset = foffset_get(fp);
2960 xf.xf_flag = fp->f_flag;
2961 error = SYSCTL_OUT(req, &xf, sizeof(xf));
2965 FILEDESC_SUNLOCK(fdp);
2970 sx_sunlock(&allproc_lock);
2974 SYSCTL_PROC(_kern, KERN_FILE, file, CTLTYPE_OPAQUE|CTLFLAG_RD|CTLFLAG_MPSAFE,
2975 0, 0, sysctl_kern_file, "S,xfile", "Entire file table");
2977 #ifdef KINFO_OFILE_SIZE
2978 CTASSERT(sizeof(struct kinfo_ofile) == KINFO_OFILE_SIZE);
2981 #ifdef COMPAT_FREEBSD7
2983 export_vnode_for_osysctl(struct vnode *vp, int type,
2984 struct kinfo_ofile *kif, struct filedesc *fdp, struct sysctl_req *req)
2987 char *fullpath, *freepath;
2989 bzero(kif, sizeof(*kif));
2990 kif->kf_structsize = sizeof(*kif);
2994 kif->kf_type = KF_TYPE_VNODE;
2995 /* This function only handles directories. */
2996 if (vp->v_type != VDIR) {
3000 kif->kf_vnode_type = KF_VTYPE_VDIR;
3003 * This is not a true file descriptor, so we set a bogus refcount
3004 * and offset to indicate these fields should be ignored.
3006 kif->kf_ref_count = -1;
3007 kif->kf_offset = -1;
3011 FILEDESC_SUNLOCK(fdp);
3012 vn_fullpath(curthread, vp, &fullpath, &freepath);
3014 strlcpy(kif->kf_path, fullpath, sizeof(kif->kf_path));
3015 if (freepath != NULL)
3016 free(freepath, M_TEMP);
3017 error = SYSCTL_OUT(req, kif, sizeof(*kif));
3018 FILEDESC_SLOCK(fdp);
3023 * Get per-process file descriptors for use by procstat(1), et al.
3026 sysctl_kern_proc_ofiledesc(SYSCTL_HANDLER_ARGS)
3028 char *fullpath, *freepath;
3029 struct kinfo_ofile *kif;
3030 struct filedesc *fdp;
3031 int error, i, *name;
3032 struct shmfd *shmfd;
3041 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
3048 kif = malloc(sizeof(*kif), M_TEMP, M_WAITOK);
3049 FILEDESC_SLOCK(fdp);
3050 if (fdp->fd_cdir != NULL)
3051 export_vnode_for_osysctl(fdp->fd_cdir, KF_FD_TYPE_CWD, kif,
3053 if (fdp->fd_rdir != NULL)
3054 export_vnode_for_osysctl(fdp->fd_rdir, KF_FD_TYPE_ROOT, kif,
3056 if (fdp->fd_jdir != NULL)
3057 export_vnode_for_osysctl(fdp->fd_jdir, KF_FD_TYPE_JAIL, kif,
3059 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) {
3060 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL)
3062 bzero(kif, sizeof(*kif));
3063 kif->kf_structsize = sizeof(*kif);
3071 switch (fp->f_type) {
3073 kif->kf_type = KF_TYPE_VNODE;
3078 kif->kf_type = KF_TYPE_SOCKET;
3083 kif->kf_type = KF_TYPE_PIPE;
3087 kif->kf_type = KF_TYPE_FIFO;
3092 kif->kf_type = KF_TYPE_KQUEUE;
3096 kif->kf_type = KF_TYPE_CRYPTO;
3100 kif->kf_type = KF_TYPE_MQUEUE;
3104 kif->kf_type = KF_TYPE_SHM;
3109 kif->kf_type = KF_TYPE_SEM;
3114 kif->kf_type = KF_TYPE_PTS;
3119 case DTYPE_PROCDESC:
3120 kif->kf_type = KF_TYPE_PROCDESC;
3125 kif->kf_type = KF_TYPE_UNKNOWN;
3128 kif->kf_ref_count = fp->f_count;
3129 if (fp->f_flag & FREAD)
3130 kif->kf_flags |= KF_FLAG_READ;
3131 if (fp->f_flag & FWRITE)
3132 kif->kf_flags |= KF_FLAG_WRITE;
3133 if (fp->f_flag & FAPPEND)
3134 kif->kf_flags |= KF_FLAG_APPEND;
3135 if (fp->f_flag & FASYNC)
3136 kif->kf_flags |= KF_FLAG_ASYNC;
3137 if (fp->f_flag & FFSYNC)
3138 kif->kf_flags |= KF_FLAG_FSYNC;
3139 if (fp->f_flag & FNONBLOCK)
3140 kif->kf_flags |= KF_FLAG_NONBLOCK;
3141 if (fp->f_flag & O_DIRECT)
3142 kif->kf_flags |= KF_FLAG_DIRECT;
3143 if (fp->f_flag & FHASLOCK)
3144 kif->kf_flags |= KF_FLAG_HASLOCK;
3145 kif->kf_offset = foffset_get(fp);
3148 switch (vp->v_type) {
3150 kif->kf_vnode_type = KF_VTYPE_VNON;
3153 kif->kf_vnode_type = KF_VTYPE_VREG;
3156 kif->kf_vnode_type = KF_VTYPE_VDIR;
3159 kif->kf_vnode_type = KF_VTYPE_VBLK;
3162 kif->kf_vnode_type = KF_VTYPE_VCHR;
3165 kif->kf_vnode_type = KF_VTYPE_VLNK;
3168 kif->kf_vnode_type = KF_VTYPE_VSOCK;
3171 kif->kf_vnode_type = KF_VTYPE_VFIFO;
3174 kif->kf_vnode_type = KF_VTYPE_VBAD;
3177 kif->kf_vnode_type = KF_VTYPE_UNKNOWN;
3181 * It is OK to drop the filedesc lock here as we will
3182 * re-validate and re-evaluate its properties when
3183 * the loop continues.
3187 FILEDESC_SUNLOCK(fdp);
3188 vn_fullpath(curthread, vp, &fullpath, &freepath);
3190 strlcpy(kif->kf_path, fullpath,
3191 sizeof(kif->kf_path));
3192 if (freepath != NULL)
3193 free(freepath, M_TEMP);
3194 FILEDESC_SLOCK(fdp);
3197 struct sockaddr *sa;
3199 if (so->so_proto->pr_usrreqs->pru_sockaddr(so, &sa)
3200 == 0 && sa->sa_len <= sizeof(kif->kf_sa_local)) {
3201 bcopy(sa, &kif->kf_sa_local, sa->sa_len);
3204 if (so->so_proto->pr_usrreqs->pru_peeraddr(so, &sa)
3205 == 0 && sa->sa_len <= sizeof(kif->kf_sa_peer)) {
3206 bcopy(sa, &kif->kf_sa_peer, sa->sa_len);
3209 kif->kf_sock_domain =
3210 so->so_proto->pr_domain->dom_family;
3211 kif->kf_sock_type = so->so_type;
3212 kif->kf_sock_protocol = so->so_proto->pr_protocol;
3215 strlcpy(kif->kf_path, tty_devname(tp),
3216 sizeof(kif->kf_path));
3219 shm_path(shmfd, kif->kf_path, sizeof(kif->kf_path));
3220 if (ks != NULL && ksem_info != NULL)
3221 ksem_info(ks, kif->kf_path, sizeof(kif->kf_path), NULL);
3222 error = SYSCTL_OUT(req, kif, sizeof(*kif));
3226 FILEDESC_SUNLOCK(fdp);
3232 static SYSCTL_NODE(_kern_proc, KERN_PROC_OFILEDESC, ofiledesc,
3233 CTLFLAG_RD||CTLFLAG_MPSAFE, sysctl_kern_proc_ofiledesc,
3234 "Process ofiledesc entries");
3235 #endif /* COMPAT_FREEBSD7 */
3237 #ifdef KINFO_FILE_SIZE
3238 CTASSERT(sizeof(struct kinfo_file) == KINFO_FILE_SIZE);
3241 struct export_fd_buf {
3242 struct filedesc *fdp;
3245 struct kinfo_file kif;
3249 export_fd_to_sb(void *data, int type, int fd, int fflags, int refcnt,
3250 int64_t offset, cap_rights_t *rightsp, struct export_fd_buf *efbuf)
3255 } fflags_table[] = {
3256 { FAPPEND, KF_FLAG_APPEND },
3257 { FASYNC, KF_FLAG_ASYNC },
3258 { FFSYNC, KF_FLAG_FSYNC },
3259 { FHASLOCK, KF_FLAG_HASLOCK },
3260 { FNONBLOCK, KF_FLAG_NONBLOCK },
3261 { FREAD, KF_FLAG_READ },
3262 { FWRITE, KF_FLAG_WRITE },
3263 { O_CREAT, KF_FLAG_CREAT },
3264 { O_DIRECT, KF_FLAG_DIRECT },
3265 { O_EXCL, KF_FLAG_EXCL },
3266 { O_EXEC, KF_FLAG_EXEC },
3267 { O_EXLOCK, KF_FLAG_EXLOCK },
3268 { O_NOFOLLOW, KF_FLAG_NOFOLLOW },
3269 { O_SHLOCK, KF_FLAG_SHLOCK },
3270 { O_TRUNC, KF_FLAG_TRUNC }
3272 #define NFFLAGS (sizeof(fflags_table) / sizeof(*fflags_table))
3273 struct kinfo_file *kif;
3278 if (efbuf->remainder == 0)
3281 bzero(kif, sizeof(*kif));
3282 locked = efbuf->fdp != NULL;
3287 FILEDESC_SUNLOCK(efbuf->fdp);
3290 vp = (struct vnode *)data;
3291 error = fill_vnode_info(vp, kif);
3294 case KF_TYPE_SOCKET:
3295 error = fill_socket_info((struct socket *)data, kif);
3298 error = fill_pipe_info((struct pipe *)data, kif);
3301 error = fill_pts_info((struct tty *)data, kif);
3303 case KF_TYPE_PROCDESC:
3304 error = fill_procdesc_info((struct procdesc *)data, kif);
3307 error = fill_sem_info((struct file *)data, kif);
3310 error = fill_shm_info((struct file *)data, kif);
3316 kif->kf_status |= KF_ATTR_VALID;
3319 * Translate file access flags.
3321 for (i = 0; i < NFFLAGS; i++)
3322 if (fflags & fflags_table[i].fflag)
3323 kif->kf_flags |= fflags_table[i].kf_fflag;
3324 if (rightsp != NULL)
3325 kif->kf_cap_rights = *rightsp;
3327 cap_rights_init(&kif->kf_cap_rights);
3329 kif->kf_type = type;
3330 kif->kf_ref_count = refcnt;
3331 kif->kf_offset = offset;
3332 /* Pack record size down */
3333 kif->kf_structsize = offsetof(struct kinfo_file, kf_path) +
3334 strlen(kif->kf_path) + 1;
3335 kif->kf_structsize = roundup(kif->kf_structsize, sizeof(uint64_t));
3336 if (efbuf->remainder != -1) {
3337 if (efbuf->remainder < kif->kf_structsize) {
3338 /* Terminate export. */
3339 efbuf->remainder = 0;
3340 if (efbuf->fdp != NULL && !locked)
3341 FILEDESC_SLOCK(efbuf->fdp);
3344 efbuf->remainder -= kif->kf_structsize;
3347 FILEDESC_SUNLOCK(efbuf->fdp);
3348 error = sbuf_bcat(efbuf->sb, kif, kif->kf_structsize);
3349 if (efbuf->fdp != NULL)
3350 FILEDESC_SLOCK(efbuf->fdp);
3355 * Store a process file descriptor information to sbuf.
3357 * Takes a locked proc as argument, and returns with the proc unlocked.
3360 kern_proc_filedesc_out(struct proc *p, struct sbuf *sb, ssize_t maxlen)
3363 struct filedesc *fdp;
3364 struct export_fd_buf *efbuf;
3365 struct vnode *cttyvp, *textvp, *tracevp;
3369 int type, refcnt, fflags;
3370 cap_rights_t rights;
3372 PROC_LOCK_ASSERT(p, MA_OWNED);
3375 tracevp = p->p_tracevp;
3376 if (tracevp != NULL)
3379 textvp = p->p_textvp;
3382 /* Controlling tty. */
3384 if (p->p_pgrp != NULL && p->p_pgrp->pg_session != NULL) {
3385 cttyvp = p->p_pgrp->pg_session->s_ttyvp;
3391 efbuf = malloc(sizeof(*efbuf), M_TEMP, M_WAITOK);
3394 efbuf->remainder = maxlen;
3395 if (tracevp != NULL)
3396 export_fd_to_sb(tracevp, KF_TYPE_VNODE, KF_FD_TYPE_TRACE,
3397 FREAD | FWRITE, -1, -1, NULL, efbuf);
3399 export_fd_to_sb(textvp, KF_TYPE_VNODE, KF_FD_TYPE_TEXT,
3400 FREAD, -1, -1, NULL, efbuf);
3402 export_fd_to_sb(cttyvp, KF_TYPE_VNODE, KF_FD_TYPE_CTTY,
3403 FREAD | FWRITE, -1, -1, NULL, efbuf);
3408 FILEDESC_SLOCK(fdp);
3409 /* working directory */
3410 if (fdp->fd_cdir != NULL) {
3412 data = fdp->fd_cdir;
3413 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_CWD,
3414 FREAD, -1, -1, NULL, efbuf);
3416 /* root directory */
3417 if (fdp->fd_rdir != NULL) {
3419 data = fdp->fd_rdir;
3420 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_ROOT,
3421 FREAD, -1, -1, NULL, efbuf);
3423 /* jail directory */
3424 if (fdp->fd_jdir != NULL) {
3426 data = fdp->fd_jdir;
3427 export_fd_to_sb(data, KF_TYPE_VNODE, KF_FD_TYPE_JAIL,
3428 FREAD, -1, -1, NULL, efbuf);
3430 for (i = 0; fdp->fd_refcnt > 0 && i <= fdp->fd_lastfile; i++) {
3431 if ((fp = fdp->fd_ofiles[i].fde_file) == NULL)
3435 rights = *cap_rights(fdp, i);
3436 #else /* !CAPABILITIES */
3437 cap_rights_init(&rights);
3439 switch (fp->f_type) {
3441 type = KF_TYPE_VNODE;
3447 type = KF_TYPE_SOCKET;
3452 type = KF_TYPE_PIPE;
3457 type = KF_TYPE_FIFO;
3463 type = KF_TYPE_KQUEUE;
3467 type = KF_TYPE_CRYPTO;
3471 type = KF_TYPE_MQUEUE;
3490 case DTYPE_PROCDESC:
3491 type = KF_TYPE_PROCDESC;
3497 type = KF_TYPE_UNKNOWN;
3500 refcnt = fp->f_count;
3501 fflags = fp->f_flag;
3502 offset = foffset_get(fp);
3505 * Create sysctl entry.
3506 * It is OK to drop the filedesc lock here as we will
3507 * re-validate and re-evaluate its properties when
3508 * the loop continues.
3510 error = export_fd_to_sb(data, type, i, fflags, refcnt,
3511 offset, &rights, efbuf);
3515 FILEDESC_SUNLOCK(fdp);
3518 free(efbuf, M_TEMP);
3522 #define FILEDESC_SBUF_SIZE (sizeof(struct kinfo_file) * 5)
3525 * Get per-process file descriptors for use by procstat(1), et al.
3528 sysctl_kern_proc_filedesc(SYSCTL_HANDLER_ARGS)
3533 int error, error2, *name;
3537 sbuf_new_for_sysctl(&sb, NULL, FILEDESC_SBUF_SIZE, req);
3538 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
3543 maxlen = req->oldptr != NULL ? req->oldlen : -1;
3544 error = kern_proc_filedesc_out(p, &sb, maxlen);
3545 error2 = sbuf_finish(&sb);
3547 return (error != 0 ? error : error2);
3551 vntype_to_kinfo(int vtype)
3556 } vtypes_table[] = {
3557 { VBAD, KF_VTYPE_VBAD },
3558 { VBLK, KF_VTYPE_VBLK },
3559 { VCHR, KF_VTYPE_VCHR },
3560 { VDIR, KF_VTYPE_VDIR },
3561 { VFIFO, KF_VTYPE_VFIFO },
3562 { VLNK, KF_VTYPE_VLNK },
3563 { VNON, KF_VTYPE_VNON },
3564 { VREG, KF_VTYPE_VREG },
3565 { VSOCK, KF_VTYPE_VSOCK }
3567 #define NVTYPES (sizeof(vtypes_table) / sizeof(*vtypes_table))
3571 * Perform vtype translation.
3573 for (i = 0; i < NVTYPES; i++)
3574 if (vtypes_table[i].vtype == vtype)
3577 return (vtypes_table[i].kf_vtype);
3579 return (KF_VTYPE_UNKNOWN);
3583 fill_vnode_info(struct vnode *vp, struct kinfo_file *kif)
3586 char *fullpath, *freepath;
3591 kif->kf_vnode_type = vntype_to_kinfo(vp->v_type);
3594 error = vn_fullpath(curthread, vp, &fullpath, &freepath);
3596 strlcpy(kif->kf_path, fullpath, sizeof(kif->kf_path));
3598 if (freepath != NULL)
3599 free(freepath, M_TEMP);
3602 * Retrieve vnode attributes.
3604 va.va_fsid = VNOVAL;
3606 vn_lock(vp, LK_SHARED | LK_RETRY);
3607 error = VOP_GETATTR(vp, &va, curthread->td_ucred);
3611 if (va.va_fsid != VNOVAL)
3612 kif->kf_un.kf_file.kf_file_fsid = va.va_fsid;
3614 kif->kf_un.kf_file.kf_file_fsid =
3615 vp->v_mount->mnt_stat.f_fsid.val[0];
3616 kif->kf_un.kf_file.kf_file_fileid = va.va_fileid;
3617 kif->kf_un.kf_file.kf_file_mode = MAKEIMODE(va.va_type, va.va_mode);
3618 kif->kf_un.kf_file.kf_file_size = va.va_size;
3619 kif->kf_un.kf_file.kf_file_rdev = va.va_rdev;
3624 fill_socket_info(struct socket *so, struct kinfo_file *kif)
3626 struct sockaddr *sa;
3627 struct inpcb *inpcb;
3628 struct unpcb *unpcb;
3633 kif->kf_sock_domain = so->so_proto->pr_domain->dom_family;
3634 kif->kf_sock_type = so->so_type;
3635 kif->kf_sock_protocol = so->so_proto->pr_protocol;
3636 kif->kf_un.kf_sock.kf_sock_pcb = (uintptr_t)so->so_pcb;
3637 switch(kif->kf_sock_domain) {
3640 if (kif->kf_sock_protocol == IPPROTO_TCP) {
3641 if (so->so_pcb != NULL) {
3642 inpcb = (struct inpcb *)(so->so_pcb);
3643 kif->kf_un.kf_sock.kf_sock_inpcb =
3644 (uintptr_t)inpcb->inp_ppcb;
3649 if (so->so_pcb != NULL) {
3650 unpcb = (struct unpcb *)(so->so_pcb);
3651 if (unpcb->unp_conn) {
3652 kif->kf_un.kf_sock.kf_sock_unpconn =
3653 (uintptr_t)unpcb->unp_conn;
3654 kif->kf_un.kf_sock.kf_sock_rcv_sb_state =
3655 so->so_rcv.sb_state;
3656 kif->kf_un.kf_sock.kf_sock_snd_sb_state =
3657 so->so_snd.sb_state;
3662 error = so->so_proto->pr_usrreqs->pru_sockaddr(so, &sa);
3663 if (error == 0 && sa->sa_len <= sizeof(kif->kf_sa_local)) {
3664 bcopy(sa, &kif->kf_sa_local, sa->sa_len);
3667 error = so->so_proto->pr_usrreqs->pru_peeraddr(so, &sa);
3668 if (error == 0 && sa->sa_len <= sizeof(kif->kf_sa_peer)) {
3669 bcopy(sa, &kif->kf_sa_peer, sa->sa_len);
3672 strncpy(kif->kf_path, so->so_proto->pr_domain->dom_name,
3673 sizeof(kif->kf_path));
3678 fill_pts_info(struct tty *tp, struct kinfo_file *kif)
3683 kif->kf_un.kf_pts.kf_pts_dev = tty_udev(tp);
3684 strlcpy(kif->kf_path, tty_devname(tp), sizeof(kif->kf_path));
3689 fill_pipe_info(struct pipe *pi, struct kinfo_file *kif)
3694 kif->kf_un.kf_pipe.kf_pipe_addr = (uintptr_t)pi;
3695 kif->kf_un.kf_pipe.kf_pipe_peer = (uintptr_t)pi->pipe_peer;
3696 kif->kf_un.kf_pipe.kf_pipe_buffer_cnt = pi->pipe_buffer.cnt;
3701 fill_procdesc_info(struct procdesc *pdp, struct kinfo_file *kif)
3706 kif->kf_un.kf_proc.kf_pid = pdp->pd_pid;
3711 fill_sem_info(struct file *fp, struct kinfo_file *kif)
3717 if (fp->f_data == NULL)
3719 if (fo_stat(fp, &sb, td->td_ucred, td) != 0)
3721 if (ksem_info == NULL)
3723 ksem_info(fp->f_data, kif->kf_path, sizeof(kif->kf_path),
3724 &kif->kf_un.kf_sem.kf_sem_value);
3725 kif->kf_un.kf_sem.kf_sem_mode = sb.st_mode;
3730 fill_shm_info(struct file *fp, struct kinfo_file *kif)
3736 if (fp->f_data == NULL)
3738 if (fo_stat(fp, &sb, td->td_ucred, td) != 0)
3740 shm_path(fp->f_data, kif->kf_path, sizeof(kif->kf_path));
3741 kif->kf_un.kf_file.kf_file_mode = sb.st_mode;
3742 kif->kf_un.kf_file.kf_file_size = sb.st_size;
3746 static SYSCTL_NODE(_kern_proc, KERN_PROC_FILEDESC, filedesc,
3747 CTLFLAG_RD|CTLFLAG_MPSAFE, sysctl_kern_proc_filedesc,
3748 "Process filedesc entries");
3752 * For the purposes of debugging, generate a human-readable string for the
3756 file_type_to_name(short type)
3786 * For the purposes of debugging, identify a process (if any, perhaps one of
3787 * many) that references the passed file in its file descriptor array. Return
3790 static struct proc *
3791 file_to_first_proc(struct file *fp)
3793 struct filedesc *fdp;
3797 FOREACH_PROC_IN_SYSTEM(p) {
3798 if (p->p_state == PRS_NEW)
3803 for (n = 0; n <= fdp->fd_lastfile; n++) {
3804 if (fp == fdp->fd_ofiles[n].fde_file)
3812 db_print_file(struct file *fp, int header)
3817 db_printf("%8s %4s %8s %8s %4s %5s %6s %8s %5s %12s\n",
3818 "File", "Type", "Data", "Flag", "GCFl", "Count",
3819 "MCount", "Vnode", "FPID", "FCmd");
3820 p = file_to_first_proc(fp);
3821 db_printf("%8p %4s %8p %08x %04x %5d %6d %8p %5d %12s\n", fp,
3822 file_type_to_name(fp->f_type), fp->f_data, fp->f_flag,
3823 0, fp->f_count, 0, fp->f_vnode,
3824 p != NULL ? p->p_pid : -1, p != NULL ? p->p_comm : "-");
3827 DB_SHOW_COMMAND(file, db_show_file)
3832 db_printf("usage: show file <addr>\n");
3835 fp = (struct file *)addr;
3836 db_print_file(fp, 1);
3839 DB_SHOW_COMMAND(files, db_show_files)
3841 struct filedesc *fdp;
3848 FOREACH_PROC_IN_SYSTEM(p) {
3849 if (p->p_state == PRS_NEW)
3851 if ((fdp = p->p_fd) == NULL)
3853 for (n = 0; n <= fdp->fd_lastfile; ++n) {
3854 if ((fp = fdp->fd_ofiles[n].fde_file) == NULL)
3856 db_print_file(fp, header);
3863 SYSCTL_INT(_kern, KERN_MAXFILESPERPROC, maxfilesperproc, CTLFLAG_RW,
3864 &maxfilesperproc, 0, "Maximum files allowed open per process");
3866 SYSCTL_INT(_kern, KERN_MAXFILES, maxfiles, CTLFLAG_RW,
3867 &maxfiles, 0, "Maximum number of files");
3869 SYSCTL_INT(_kern, OID_AUTO, openfiles, CTLFLAG_RD,
3870 __DEVOLATILE(int *, &openfiles), 0, "System-wide number of open files");
3874 filelistinit(void *dummy)
3877 file_zone = uma_zcreate("Files", sizeof(struct file), NULL, NULL,
3878 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
3879 mtx_init(&sigio_lock, "sigio lock", NULL, MTX_DEF);
3880 mtx_init(&fdesc_mtx, "fdesc", NULL, MTX_DEF);
3882 SYSINIT(select, SI_SUB_LOCK, SI_ORDER_FIRST, filelistinit, NULL);
3884 /*-------------------------------------------------------------------*/
3887 badfo_readwrite(struct file *fp, struct uio *uio, struct ucred *active_cred,
3888 int flags, struct thread *td)
3895 badfo_truncate(struct file *fp, off_t length, struct ucred *active_cred,
3903 badfo_ioctl(struct file *fp, u_long com, void *data, struct ucred *active_cred,
3911 badfo_poll(struct file *fp, int events, struct ucred *active_cred,
3919 badfo_kqfilter(struct file *fp, struct knote *kn)
3926 badfo_stat(struct file *fp, struct stat *sb, struct ucred *active_cred,
3934 badfo_close(struct file *fp, struct thread *td)
3941 badfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred,
3949 badfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
3957 badfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio,
3958 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags,
3959 int kflags, struct thread *td)
3965 struct fileops badfileops = {
3966 .fo_read = badfo_readwrite,
3967 .fo_write = badfo_readwrite,
3968 .fo_truncate = badfo_truncate,
3969 .fo_ioctl = badfo_ioctl,
3970 .fo_poll = badfo_poll,
3971 .fo_kqfilter = badfo_kqfilter,
3972 .fo_stat = badfo_stat,
3973 .fo_close = badfo_close,
3974 .fo_chmod = badfo_chmod,
3975 .fo_chown = badfo_chown,
3976 .fo_sendfile = badfo_sendfile,
3980 invfo_chmod(struct file *fp, mode_t mode, struct ucred *active_cred,
3988 invfo_chown(struct file *fp, uid_t uid, gid_t gid, struct ucred *active_cred,
3996 invfo_sendfile(struct file *fp, int sockfd, struct uio *hdr_uio,
3997 struct uio *trl_uio, off_t offset, size_t nbytes, off_t *sent, int flags,
3998 int kflags, struct thread *td)
4004 /*-------------------------------------------------------------------*/
4007 * File Descriptor pseudo-device driver (/dev/fd/).
4009 * Opening minor device N dup()s the file (if any) connected to file
4010 * descriptor N belonging to the calling process. Note that this driver
4011 * consists of only the ``open()'' routine, because all subsequent
4012 * references to this file will be direct to the other driver.
4014 * XXX: we could give this one a cloning event handler if necessary.
4019 fdopen(struct cdev *dev, int mode, int type, struct thread *td)
4023 * XXX Kludge: set curthread->td_dupfd to contain the value of the
4024 * the file descriptor being sought for duplication. The error
4025 * return ensures that the vnode for this device will be released
4026 * by vn_open. Open will detect this special error and take the
4027 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
4028 * will simply report the error.
4030 td->td_dupfd = dev2unit(dev);
4034 static struct cdevsw fildesc_cdevsw = {
4035 .d_version = D_VERSION,
4041 fildesc_drvinit(void *unused)
4045 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 0, NULL,
4046 UID_ROOT, GID_WHEEL, 0666, "fd/0");
4047 make_dev_alias(dev, "stdin");
4048 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 1, NULL,
4049 UID_ROOT, GID_WHEEL, 0666, "fd/1");
4050 make_dev_alias(dev, "stdout");
4051 dev = make_dev_credf(MAKEDEV_ETERNAL, &fildesc_cdevsw, 2, NULL,
4052 UID_ROOT, GID_WHEEL, 0666, "fd/2");
4053 make_dev_alias(dev, "stderr");
4056 SYSINIT(fildescdev, SI_SUB_DRIVERS, SI_ORDER_MIDDLE, fildesc_drvinit, NULL);