2 * Copyright (c) 2005 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 1982, 1986, 1989, 1991, 1993
36 * The Regents of the University of California. All rights reserved.
37 * (c) UNIX System Laboratories, Inc.
38 * All or some portions of this file are derived from material licensed
39 * to the University of California by American Telephone and Telegraph
40 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
41 * the permission of UNIX System Laboratories, Inc.
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
71 * @(#)kern_descrip.c 8.6 (Berkeley) 4/19/94
72 * $FreeBSD: src/sys/kern/kern_descrip.c,v 1.81.2.19 2004/02/28 00:43:31 tegge Exp $
73 * $DragonFly: src/sys/kern/kern_descrip.c,v 1.79 2008/08/31 13:18:28 aggelos Exp $
76 #include "opt_compat.h"
77 #include <sys/param.h>
78 #include <sys/systm.h>
79 #include <sys/malloc.h>
80 #include <sys/sysproto.h>
82 #include <sys/device.h>
83 #include <sys/filedesc.h>
84 #include <sys/kernel.h>
85 #include <sys/sysctl.h>
86 #include <sys/vnode.h>
88 #include <sys/nlookup.h>
91 #include <sys/filio.h>
92 #include <sys/fcntl.h>
93 #include <sys/unistd.h>
94 #include <sys/resourcevar.h>
95 #include <sys/event.h>
96 #include <sys/kern_syscall.h>
97 #include <sys/kcore.h>
98 #include <sys/kinfo.h>
102 #include <vm/vm_extern.h>
104 #include <sys/thread2.h>
105 #include <sys/file2.h>
106 #include <sys/spinlock2.h>
108 static void fsetfd_locked(struct filedesc
*fdp
, struct file
*fp
, int fd
);
109 static void fdreserve_locked (struct filedesc
*fdp
, int fd0
, int incr
);
110 static struct file
*funsetfd_locked (struct filedesc
*fdp
, int fd
);
111 static int checkfpclosed(struct filedesc
*fdp
, int fd
, struct file
*fp
);
112 static void ffree(struct file
*fp
);
114 static MALLOC_DEFINE(M_FILEDESC
, "file desc", "Open file descriptor table");
115 static MALLOC_DEFINE(M_FILEDESC_TO_LEADER
, "file desc to leader",
116 "file desc to leader structures");
117 MALLOC_DEFINE(M_FILE
, "file", "Open file structure");
118 static MALLOC_DEFINE(M_SIGIO
, "sigio", "sigio structures");
120 static d_open_t fdopen
;
123 #define CDEV_MAJOR 22
124 static struct dev_ops fildesc_ops
= {
125 { "FD", CDEV_MAJOR
, 0 },
129 static int badfo_readwrite (struct file
*fp
, struct uio
*uio
,
130 struct ucred
*cred
, int flags
);
131 static int badfo_ioctl (struct file
*fp
, u_long com
, caddr_t data
,
133 static int badfo_poll (struct file
*fp
, int events
, struct ucred
*cred
);
134 static int badfo_kqfilter (struct file
*fp
, struct knote
*kn
);
135 static int badfo_stat (struct file
*fp
, struct stat
*sb
, struct ucred
*cred
);
136 static int badfo_close (struct file
*fp
);
137 static int badfo_shutdown (struct file
*fp
, int how
);
140 * Descriptor management.
142 static struct filelist filehead
= LIST_HEAD_INITIALIZER(&filehead
);
143 static struct spinlock filehead_spin
= SPINLOCK_INITIALIZER(&filehead_spin
);
144 static int nfiles
; /* actual number of open files */
148 * Fixup fd_freefile and fd_lastfile after a descriptor has been cleared.
150 * MPSAFE - must be called with fdp->fd_spin exclusively held
154 fdfixup_locked(struct filedesc
*fdp
, int fd
)
156 if (fd
< fdp
->fd_freefile
) {
157 fdp
->fd_freefile
= fd
;
159 while (fdp
->fd_lastfile
>= 0 &&
160 fdp
->fd_files
[fdp
->fd_lastfile
].fp
== NULL
&&
161 fdp
->fd_files
[fdp
->fd_lastfile
].reserved
== 0
168 * System calls on descriptors.
173 sys_getdtablesize(struct getdtablesize_args
*uap
)
175 struct proc
*p
= curproc
;
176 struct plimit
*limit
= p
->p_limit
;
178 spin_lock_rd(&limit
->p_spin
);
180 min((int)limit
->pl_rlimit
[RLIMIT_NOFILE
].rlim_cur
, maxfilesperproc
);
181 spin_unlock_rd(&limit
->p_spin
);
186 * Duplicate a file descriptor to a particular value.
188 * note: keep in mind that a potential race condition exists when closing
189 * descriptors from a shared descriptor table (via rfork).
194 sys_dup2(struct dup2_args
*uap
)
199 error
= kern_dup(DUP_FIXED
, uap
->from
, uap
->to
, &fd
);
200 uap
->sysmsg_fds
[0] = fd
;
206 * Duplicate a file descriptor.
211 sys_dup(struct dup_args
*uap
)
216 error
= kern_dup(DUP_VARIABLE
, uap
->fd
, 0, &fd
);
217 uap
->sysmsg_fds
[0] = fd
;
223 * MPALMOSTSAFE - acquires mplock for fp operations
226 kern_fcntl(int fd
, int cmd
, union fcntl_dat
*dat
, struct ucred
*cred
)
228 struct thread
*td
= curthread
;
229 struct proc
*p
= td
->td_proc
;
235 int tmp
, error
, flg
= F_POSIX
;
240 * Operations on file descriptors that do not require a file pointer.
244 error
= fgetfdflags(p
->p_fd
, fd
, &tmp
);
246 dat
->fc_cloexec
= (tmp
& UF_EXCLOSE
) ? FD_CLOEXEC
: 0;
250 if (dat
->fc_cloexec
& FD_CLOEXEC
)
251 error
= fsetfdflags(p
->p_fd
, fd
, UF_EXCLOSE
);
253 error
= fclrfdflags(p
->p_fd
, fd
, UF_EXCLOSE
);
257 error
= kern_dup(DUP_VARIABLE
, fd
, newmin
, &dat
->fc_fd
);
264 * Operations on file pointers
266 if ((fp
= holdfp(p
->p_fd
, fd
, -1)) == NULL
)
272 dat
->fc_flags
= OFLAGS(fp
->f_flag
);
278 nflags
= FFLAGS(dat
->fc_flags
& ~O_ACCMODE
) & FCNTLFLAGS
;
279 nflags
|= oflags
& ~FCNTLFLAGS
;
282 if (((nflags
^ oflags
) & O_APPEND
) && (oflags
& FAPPENDONLY
))
284 if (error
== 0 && ((nflags
^ oflags
) & FASYNC
)) {
285 tmp
= nflags
& FASYNC
;
286 error
= fo_ioctl(fp
, FIOASYNC
, (caddr_t
)&tmp
, cred
);
293 error
= fo_ioctl(fp
, FIOGETOWN
, (caddr_t
)&dat
->fc_owner
, cred
);
297 error
= fo_ioctl(fp
, FIOSETOWN
, (caddr_t
)&dat
->fc_owner
, cred
);
302 /* Fall into F_SETLK */
305 if (fp
->f_type
!= DTYPE_VNODE
) {
309 vp
= (struct vnode
*)fp
->f_data
;
312 * copyin/lockop may block
314 if (dat
->fc_flock
.l_whence
== SEEK_CUR
)
315 dat
->fc_flock
.l_start
+= fp
->f_offset
;
317 switch (dat
->fc_flock
.l_type
) {
319 if ((fp
->f_flag
& FREAD
) == 0) {
323 p
->p_leader
->p_flag
|= P_ADVLOCK
;
324 error
= VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
, F_SETLK
,
325 &dat
->fc_flock
, flg
);
328 if ((fp
->f_flag
& FWRITE
) == 0) {
332 p
->p_leader
->p_flag
|= P_ADVLOCK
;
333 error
= VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
, F_SETLK
,
334 &dat
->fc_flock
, flg
);
337 error
= VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
, F_UNLCK
,
338 &dat
->fc_flock
, F_POSIX
);
346 * It is possible to race a close() on the descriptor while
347 * we were blocked getting the lock. If this occurs the
348 * close might not have caught the lock.
350 if (checkfpclosed(p
->p_fd
, fd
, fp
)) {
351 dat
->fc_flock
.l_whence
= SEEK_SET
;
352 dat
->fc_flock
.l_start
= 0;
353 dat
->fc_flock
.l_len
= 0;
354 dat
->fc_flock
.l_type
= F_UNLCK
;
355 (void) VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
,
356 F_UNLCK
, &dat
->fc_flock
, F_POSIX
);
361 if (fp
->f_type
!= DTYPE_VNODE
) {
365 vp
= (struct vnode
*)fp
->f_data
;
367 * copyin/lockop may block
369 if (dat
->fc_flock
.l_type
!= F_RDLCK
&&
370 dat
->fc_flock
.l_type
!= F_WRLCK
&&
371 dat
->fc_flock
.l_type
!= F_UNLCK
) {
375 if (dat
->fc_flock
.l_whence
== SEEK_CUR
)
376 dat
->fc_flock
.l_start
+= fp
->f_offset
;
377 error
= VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
, F_GETLK
,
378 &dat
->fc_flock
, F_POSIX
);
391 * The file control system call.
396 sys_fcntl(struct fcntl_args
*uap
)
403 dat
.fc_fd
= uap
->arg
;
406 dat
.fc_cloexec
= uap
->arg
;
409 dat
.fc_flags
= uap
->arg
;
412 dat
.fc_owner
= uap
->arg
;
417 error
= copyin((caddr_t
)uap
->arg
, &dat
.fc_flock
,
418 sizeof(struct flock
));
424 error
= kern_fcntl(uap
->fd
, uap
->cmd
, &dat
, curproc
->p_ucred
);
429 uap
->sysmsg_result
= dat
.fc_fd
;
432 uap
->sysmsg_result
= dat
.fc_cloexec
;
435 uap
->sysmsg_result
= dat
.fc_flags
;
438 uap
->sysmsg_result
= dat
.fc_owner
;
440 error
= copyout(&dat
.fc_flock
, (caddr_t
)uap
->arg
,
441 sizeof(struct flock
));
450 * Common code for dup, dup2, and fcntl(F_DUPFD).
452 * The type flag can be either DUP_FIXED or DUP_VARIABLE. DUP_FIXED tells
453 * kern_dup() to destructively dup over an existing file descriptor if new
454 * is already open. DUP_VARIABLE tells kern_dup() to find the lowest
455 * unused file descriptor that is greater than or equal to new.
460 kern_dup(enum dup_type type
, int old
, int new, int *res
)
462 struct thread
*td
= curthread
;
463 struct proc
*p
= td
->td_proc
;
464 struct filedesc
*fdp
= p
->p_fd
;
472 * Verify that we have a valid descriptor to dup from and
473 * possibly to dup to.
476 spin_lock_wr(&fdp
->fd_spin
);
477 if (new < 0 || new > p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
||
478 new >= maxfilesperproc
) {
479 spin_unlock_wr(&fdp
->fd_spin
);
482 if ((unsigned)old
>= fdp
->fd_nfiles
|| fdp
->fd_files
[old
].fp
== NULL
) {
483 spin_unlock_wr(&fdp
->fd_spin
);
486 if (type
== DUP_FIXED
&& old
== new) {
488 spin_unlock_wr(&fdp
->fd_spin
);
491 fp
= fdp
->fd_files
[old
].fp
;
492 oldflags
= fdp
->fd_files
[old
].fileflags
;
493 fhold(fp
); /* MPSAFE - can be called with a spinlock held */
496 * Allocate a new descriptor if DUP_VARIABLE, or expand the table
497 * if the requested descriptor is beyond the current table size.
499 * This can block. Retry if the source descriptor no longer matches
500 * or if our expectation in the expansion case races.
502 * If we are not expanding or allocating a new decriptor, then reset
503 * the target descriptor to a reserved state so we have a uniform
504 * setup for the next code block.
506 if (type
== DUP_VARIABLE
|| new >= fdp
->fd_nfiles
) {
507 spin_unlock_wr(&fdp
->fd_spin
);
508 error
= fdalloc(p
, new, &newfd
);
509 spin_lock_wr(&fdp
->fd_spin
);
511 spin_unlock_wr(&fdp
->fd_spin
);
518 if (old
>= fdp
->fd_nfiles
|| fdp
->fd_files
[old
].fp
!= fp
) {
519 fsetfd_locked(fdp
, NULL
, newfd
);
520 spin_unlock_wr(&fdp
->fd_spin
);
525 * Check for expansion race
527 if (type
!= DUP_VARIABLE
&& new != newfd
) {
528 fsetfd_locked(fdp
, NULL
, newfd
);
529 spin_unlock_wr(&fdp
->fd_spin
);
534 * Check for ripout, newfd reused old (this case probably
538 fsetfd_locked(fdp
, NULL
, newfd
);
539 spin_unlock_wr(&fdp
->fd_spin
);
546 if (fdp
->fd_files
[new].reserved
) {
547 spin_unlock_wr(&fdp
->fd_spin
);
549 kprintf("Warning: dup(): target descriptor %d is reserved, waiting for it to be resolved\n", new);
550 tsleep(fdp
, 0, "fdres", hz
);
555 * If the target descriptor was never allocated we have
556 * to allocate it. If it was we have to clean out the
557 * old descriptor. delfp inherits the ref from the
560 delfp
= fdp
->fd_files
[new].fp
;
561 fdp
->fd_files
[new].fp
= NULL
;
562 fdp
->fd_files
[new].reserved
= 1;
564 fdreserve_locked(fdp
, new, 1);
565 if (new > fdp
->fd_lastfile
)
566 fdp
->fd_lastfile
= new;
572 * NOTE: still holding an exclusive spinlock
576 * If a descriptor is being overwritten we may hve to tell
577 * fdfree() to sleep to ensure that all relevant process
578 * leaders can be traversed in closef().
580 if (delfp
!= NULL
&& p
->p_fdtol
!= NULL
) {
581 fdp
->fd_holdleaderscount
++;
586 KASSERT(delfp
== NULL
|| type
== DUP_FIXED
,
587 ("dup() picked an open file"));
590 * Duplicate the source descriptor, update lastfile. If the new
591 * descriptor was not allocated and we aren't replacing an existing
592 * descriptor we have to mark the descriptor as being in use.
594 * The fd_files[] array inherits fp's hold reference.
596 fsetfd_locked(fdp
, fp
, new);
597 fdp
->fd_files
[new].fileflags
= oldflags
& ~UF_EXCLOSE
;
598 spin_unlock_wr(&fdp
->fd_spin
);
603 * If we dup'd over a valid file, we now own the reference to it
604 * and must dispose of it using closef() semantics (as if a
605 * close() were performed on it).
610 spin_lock_wr(&fdp
->fd_spin
);
611 fdp
->fd_holdleaderscount
--;
612 if (fdp
->fd_holdleaderscount
== 0 &&
613 fdp
->fd_holdleaderswakeup
!= 0) {
614 fdp
->fd_holdleaderswakeup
= 0;
615 spin_unlock_wr(&fdp
->fd_spin
);
616 wakeup(&fdp
->fd_holdleaderscount
);
618 spin_unlock_wr(&fdp
->fd_spin
);
626 * If sigio is on the list associated with a process or process group,
627 * disable signalling from the device, remove sigio from the list and
631 funsetown(struct sigio
*sigio
)
636 *(sigio
->sio_myref
) = NULL
;
638 if (sigio
->sio_pgid
< 0) {
639 SLIST_REMOVE(&sigio
->sio_pgrp
->pg_sigiolst
, sigio
,
641 } else /* if ((*sigiop)->sio_pgid > 0) */ {
642 SLIST_REMOVE(&sigio
->sio_proc
->p_sigiolst
, sigio
,
645 crfree(sigio
->sio_ucred
);
646 kfree(sigio
, M_SIGIO
);
649 /* Free a list of sigio structures. */
651 funsetownlst(struct sigiolst
*sigiolst
)
655 while ((sigio
= SLIST_FIRST(sigiolst
)) != NULL
)
660 * This is common code for FIOSETOWN ioctl called by fcntl(fd, F_SETOWN, arg).
662 * After permission checking, add a sigio structure to the sigio list for
663 * the process or process group.
666 fsetown(pid_t pgid
, struct sigio
**sigiop
)
682 * Policy - Don't allow a process to FSETOWN a process
683 * in another session.
685 * Remove this test to allow maximum flexibility or
686 * restrict FSETOWN to the current process or process
687 * group for maximum safety.
689 if (proc
->p_session
!= curproc
->p_session
)
693 } else /* if (pgid < 0) */ {
694 pgrp
= pgfind(-pgid
);
699 * Policy - Don't allow a process to FSETOWN a process
700 * in another session.
702 * Remove this test to allow maximum flexibility or
703 * restrict FSETOWN to the current process or process
704 * group for maximum safety.
706 if (pgrp
->pg_session
!= curproc
->p_session
)
712 sigio
= kmalloc(sizeof(struct sigio
), M_SIGIO
, M_WAITOK
);
714 SLIST_INSERT_HEAD(&proc
->p_sigiolst
, sigio
, sio_pgsigio
);
715 sigio
->sio_proc
= proc
;
717 SLIST_INSERT_HEAD(&pgrp
->pg_sigiolst
, sigio
, sio_pgsigio
);
718 sigio
->sio_pgrp
= pgrp
;
720 sigio
->sio_pgid
= pgid
;
721 sigio
->sio_ucred
= crhold(curproc
->p_ucred
);
722 /* It would be convenient if p_ruid was in ucred. */
723 sigio
->sio_ruid
= curproc
->p_ucred
->cr_ruid
;
724 sigio
->sio_myref
= sigiop
;
732 * This is common code for FIOGETOWN ioctl called by fcntl(fd, F_GETOWN, arg).
735 fgetown(struct sigio
*sigio
)
737 return (sigio
!= NULL
? sigio
->sio_pgid
: 0);
741 * Close many file descriptors.
746 sys_closefrom(struct closefrom_args
*uap
)
748 return(kern_closefrom(uap
->fd
));
752 * Close all file descriptors greater then or equal to fd
757 kern_closefrom(int fd
)
759 struct thread
*td
= curthread
;
760 struct proc
*p
= td
->td_proc
;
761 struct filedesc
*fdp
;
770 * NOTE: This function will skip unassociated descriptors and
771 * reserved descriptors that have not yet been assigned.
772 * fd_lastfile can change as a side effect of kern_close().
774 spin_lock_wr(&fdp
->fd_spin
);
775 while (fd
<= fdp
->fd_lastfile
) {
776 if (fdp
->fd_files
[fd
].fp
!= NULL
) {
777 spin_unlock_wr(&fdp
->fd_spin
);
778 /* ok if this races another close */
779 if (kern_close(fd
) == EINTR
)
781 spin_lock_wr(&fdp
->fd_spin
);
785 spin_unlock_wr(&fdp
->fd_spin
);
790 * Close a file descriptor.
795 sys_close(struct close_args
*uap
)
797 return(kern_close(uap
->fd
));
801 * MPALMOSTSAFE - acquires mplock around knote_fdclose() calls
806 struct thread
*td
= curthread
;
807 struct proc
*p
= td
->td_proc
;
808 struct filedesc
*fdp
;
816 spin_lock_wr(&fdp
->fd_spin
);
817 if ((fp
= funsetfd_locked(fdp
, fd
)) == NULL
) {
818 spin_unlock_wr(&fdp
->fd_spin
);
822 if (p
->p_fdtol
!= NULL
) {
824 * Ask fdfree() to sleep to ensure that all relevant
825 * process leaders can be traversed in closef().
827 fdp
->fd_holdleaderscount
++;
832 * we now hold the fp reference that used to be owned by the descriptor
835 spin_unlock_wr(&fdp
->fd_spin
);
836 if (fd
< fdp
->fd_knlistsize
) {
838 if (fd
< fdp
->fd_knlistsize
)
839 knote_fdclose(p
, fd
);
842 error
= closef(fp
, p
);
844 spin_lock_wr(&fdp
->fd_spin
);
845 fdp
->fd_holdleaderscount
--;
846 if (fdp
->fd_holdleaderscount
== 0 &&
847 fdp
->fd_holdleaderswakeup
!= 0) {
848 fdp
->fd_holdleaderswakeup
= 0;
849 spin_unlock_wr(&fdp
->fd_spin
);
850 wakeup(&fdp
->fd_holdleaderscount
);
852 spin_unlock_wr(&fdp
->fd_spin
);
859 * shutdown_args(int fd, int how)
862 kern_shutdown(int fd
, int how
)
864 struct thread
*td
= curthread
;
865 struct proc
*p
= td
->td_proc
;
871 if ((fp
= holdfp(p
->p_fd
, fd
, -1)) == NULL
)
873 error
= fo_shutdown(fp
, how
);
880 sys_shutdown(struct shutdown_args
*uap
)
884 error
= kern_shutdown(uap
->s
, uap
->how
);
890 kern_fstat(int fd
, struct stat
*ub
)
892 struct thread
*td
= curthread
;
893 struct proc
*p
= td
->td_proc
;
899 if ((fp
= holdfp(p
->p_fd
, fd
, -1)) == NULL
)
901 error
= fo_stat(fp
, ub
, p
->p_ucred
);
908 * Return status information about a file descriptor.
911 sys_fstat(struct fstat_args
*uap
)
916 error
= kern_fstat(uap
->fd
, &st
);
919 error
= copyout(&st
, uap
->sb
, sizeof(st
));
924 * Return pathconf information about a file descriptor.
928 sys_fpathconf(struct fpathconf_args
*uap
)
930 struct thread
*td
= curthread
;
931 struct proc
*p
= td
->td_proc
;
938 if ((fp
= holdfp(p
->p_fd
, uap
->fd
, -1)) == NULL
)
941 switch (fp
->f_type
) {
944 if (uap
->name
!= _PC_PIPE_BUF
) {
947 uap
->sysmsg_result
= PIPE_BUF
;
953 vp
= (struct vnode
*)fp
->f_data
;
954 error
= VOP_PATHCONF(vp
, uap
->name
, uap
->sysmsg_fds
);
965 SYSCTL_INT(_debug
, OID_AUTO
, fdexpand
, CTLFLAG_RD
, &fdexpand
, 0, "");
968 * Grow the file table so it can hold through descriptor (want).
970 * The fdp's spinlock must be held exclusively on entry and may be held
971 * exclusively on return. The spinlock may be cycled by the routine.
976 fdgrow_locked(struct filedesc
*fdp
, int want
)
978 struct fdnode
*newfiles
;
979 struct fdnode
*oldfiles
;
984 /* nf has to be of the form 2^n - 1 */
986 } while (nf
<= want
);
988 spin_unlock_wr(&fdp
->fd_spin
);
989 newfiles
= kmalloc(nf
* sizeof(struct fdnode
), M_FILEDESC
, M_WAITOK
);
990 spin_lock_wr(&fdp
->fd_spin
);
993 * We could have raced another extend while we were not holding
996 if (fdp
->fd_nfiles
>= nf
) {
997 spin_unlock_wr(&fdp
->fd_spin
);
998 kfree(newfiles
, M_FILEDESC
);
999 spin_lock_wr(&fdp
->fd_spin
);
1003 * Copy the existing ofile and ofileflags arrays
1004 * and zero the new portion of each array.
1006 extra
= nf
- fdp
->fd_nfiles
;
1007 bcopy(fdp
->fd_files
, newfiles
, fdp
->fd_nfiles
* sizeof(struct fdnode
));
1008 bzero(&newfiles
[fdp
->fd_nfiles
], extra
* sizeof(struct fdnode
));
1010 oldfiles
= fdp
->fd_files
;
1011 fdp
->fd_files
= newfiles
;
1012 fdp
->fd_nfiles
= nf
;
1014 if (oldfiles
!= fdp
->fd_builtin_files
) {
1015 spin_unlock_wr(&fdp
->fd_spin
);
1016 kfree(oldfiles
, M_FILEDESC
);
1017 spin_lock_wr(&fdp
->fd_spin
);
1023 * Number of nodes in right subtree, including the root.
1026 right_subtree_size(int n
)
1028 return (n
^ (n
| (n
+ 1)));
1035 right_ancestor(int n
)
1037 return (n
| (n
+ 1));
1044 left_ancestor(int n
)
1046 return ((n
& (n
+ 1)) - 1);
1050 * Traverse the in-place binary tree buttom-up adjusting the allocation
1051 * count so scans can determine where free descriptors are located.
1053 * MPSAFE - caller must be holding an exclusive spinlock on fdp
1057 fdreserve_locked(struct filedesc
*fdp
, int fd
, int incr
)
1060 fdp
->fd_files
[fd
].allocated
+= incr
;
1061 KKASSERT(fdp
->fd_files
[fd
].allocated
>= 0);
1062 fd
= left_ancestor(fd
);
1067 * Reserve a file descriptor for the process. If no error occurs, the
1068 * caller MUST at some point call fsetfd() or assign a file pointer
1069 * or dispose of the reservation.
1074 fdalloc(struct proc
*p
, int want
, int *result
)
1076 struct filedesc
*fdp
= p
->p_fd
;
1077 int fd
, rsize
, rsum
, node
, lim
;
1079 spin_lock_rd(&p
->p_limit
->p_spin
);
1080 lim
= min((int)p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
, maxfilesperproc
);
1081 spin_unlock_rd(&p
->p_limit
->p_spin
);
1084 spin_lock_wr(&fdp
->fd_spin
);
1085 if (want
>= fdp
->fd_nfiles
)
1086 fdgrow_locked(fdp
, want
);
1089 * Search for a free descriptor starting at the higher
1090 * of want or fd_freefile. If that fails, consider
1091 * expanding the ofile array.
1093 * NOTE! the 'allocated' field is a cumulative recursive allocation
1094 * count. If we happen to see a value of 0 then we can shortcut
1095 * our search. Otherwise we run through through the tree going
1096 * down branches we know have free descriptor(s) until we hit a
1097 * leaf node. The leaf node will be free but will not necessarily
1098 * have an allocated field of 0.
1101 /* move up the tree looking for a subtree with a free node */
1102 for (fd
= max(want
, fdp
->fd_freefile
); fd
< min(fdp
->fd_nfiles
, lim
);
1103 fd
= right_ancestor(fd
)) {
1104 if (fdp
->fd_files
[fd
].allocated
== 0)
1107 rsize
= right_subtree_size(fd
);
1108 if (fdp
->fd_files
[fd
].allocated
== rsize
)
1109 continue; /* right subtree full */
1112 * Free fd is in the right subtree of the tree rooted at fd.
1113 * Call that subtree R. Look for the smallest (leftmost)
1114 * subtree of R with an unallocated fd: continue moving
1115 * down the left branch until encountering a full left
1116 * subtree, then move to the right.
1118 for (rsum
= 0, rsize
/= 2; rsize
> 0; rsize
/= 2) {
1120 rsum
+= fdp
->fd_files
[node
].allocated
;
1121 if (fdp
->fd_files
[fd
].allocated
== rsum
+ rsize
) {
1122 fd
= node
; /* move to the right */
1123 if (fdp
->fd_files
[node
].allocated
== 0)
1132 * No space in current array. Expand?
1134 if (fdp
->fd_nfiles
>= lim
) {
1135 spin_unlock_wr(&fdp
->fd_spin
);
1138 fdgrow_locked(fdp
, want
);
1142 KKASSERT(fd
< fdp
->fd_nfiles
);
1143 if (fd
> fdp
->fd_lastfile
)
1144 fdp
->fd_lastfile
= fd
;
1145 if (want
<= fdp
->fd_freefile
)
1146 fdp
->fd_freefile
= fd
;
1148 KKASSERT(fdp
->fd_files
[fd
].fp
== NULL
);
1149 KKASSERT(fdp
->fd_files
[fd
].reserved
== 0);
1150 fdp
->fd_files
[fd
].fileflags
= 0;
1151 fdp
->fd_files
[fd
].reserved
= 1;
1152 fdreserve_locked(fdp
, fd
, 1);
1153 spin_unlock_wr(&fdp
->fd_spin
);
1158 * Check to see whether n user file descriptors
1159 * are available to the process p.
1164 fdavail(struct proc
*p
, int n
)
1166 struct filedesc
*fdp
= p
->p_fd
;
1167 struct fdnode
*fdnode
;
1170 spin_lock_rd(&p
->p_limit
->p_spin
);
1171 lim
= min((int)p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
, maxfilesperproc
);
1172 spin_unlock_rd(&p
->p_limit
->p_spin
);
1174 spin_lock_rd(&fdp
->fd_spin
);
1175 if ((i
= lim
- fdp
->fd_nfiles
) > 0 && (n
-= i
) <= 0) {
1176 spin_unlock_rd(&fdp
->fd_spin
);
1179 last
= min(fdp
->fd_nfiles
, lim
);
1180 fdnode
= &fdp
->fd_files
[fdp
->fd_freefile
];
1181 for (i
= last
- fdp
->fd_freefile
; --i
>= 0; ++fdnode
) {
1182 if (fdnode
->fp
== NULL
&& --n
<= 0) {
1183 spin_unlock_rd(&fdp
->fd_spin
);
1187 spin_unlock_rd(&fdp
->fd_spin
);
1192 * Revoke open descriptors referencing (f_data, f_type)
1194 * Any revoke executed within a prison is only able to
1195 * revoke descriptors for processes within that prison.
1197 * Returns 0 on success or an error code.
1199 struct fdrevoke_info
{
1209 static int fdrevoke_check_callback(struct file
*fp
, void *vinfo
);
1210 static int fdrevoke_proc_callback(struct proc
*p
, void *vinfo
);
1213 fdrevoke(void *f_data
, short f_type
, struct ucred
*cred
)
1215 struct fdrevoke_info info
;
1218 bzero(&info
, sizeof(info
));
1222 error
= falloc(NULL
, &info
.nfp
, NULL
);
1227 * Scan the file pointer table once. dups do not dup file pointers,
1228 * only descriptors, so there is no leak. Set FREVOKED on the fps
1231 allfiles_scan_exclusive(fdrevoke_check_callback
, &info
);
1234 * If any fps were marked track down the related descriptors
1235 * and close them. Any dup()s at this point will notice
1236 * the FREVOKED already set in the fp and do the right thing.
1238 * Any fps with non-zero msgcounts (aka sent over a unix-domain
1239 * socket) bumped the intransit counter and will require a
1240 * scan. Races against fps leaving the socket are closed by
1241 * the socket code checking for FREVOKED.
1244 allproc_scan(fdrevoke_proc_callback
, &info
);
1246 unp_revoke_gc(info
.nfp
);
1252 * Locate matching file pointers directly.
1255 fdrevoke_check_callback(struct file
*fp
, void *vinfo
)
1257 struct fdrevoke_info
*info
= vinfo
;
1260 * File pointers already flagged for revokation are skipped.
1262 if (fp
->f_flag
& FREVOKED
)
1266 * If revoking from a prison file pointers created outside of
1267 * that prison, or file pointers without creds, cannot be revoked.
1269 if (info
->cred
->cr_prison
&&
1270 (fp
->f_cred
== NULL
||
1271 info
->cred
->cr_prison
!= fp
->f_cred
->cr_prison
)) {
1276 * If the file pointer matches then mark it for revocation. The
1277 * flag is currently only used by unp_revoke_gc().
1279 * info->count is a heuristic and can race in a SMP environment.
1281 if (info
->data
== fp
->f_data
&& info
->type
== fp
->f_type
) {
1282 atomic_set_int(&fp
->f_flag
, FREVOKED
);
1283 info
->count
+= fp
->f_count
;
1291 * Locate matching file pointers via process descriptor tables.
1294 fdrevoke_proc_callback(struct proc
*p
, void *vinfo
)
1296 struct fdrevoke_info
*info
= vinfo
;
1297 struct filedesc
*fdp
;
1301 if (p
->p_stat
== SIDL
|| p
->p_stat
== SZOMB
)
1303 if (info
->cred
->cr_prison
&&
1304 info
->cred
->cr_prison
!= p
->p_ucred
->cr_prison
) {
1309 * If the controlling terminal of the process matches the
1310 * vnode being revoked we clear the controlling terminal.
1312 * The normal spec_close() may not catch this because it
1313 * uses curproc instead of p.
1315 if (p
->p_session
&& info
->type
== DTYPE_VNODE
&&
1316 info
->data
== p
->p_session
->s_ttyvp
) {
1317 p
->p_session
->s_ttyvp
= NULL
;
1322 * Softref the fdp to prevent it from being destroyed
1324 spin_lock_wr(&p
->p_spin
);
1325 if ((fdp
= p
->p_fd
) == NULL
) {
1326 spin_unlock_wr(&p
->p_spin
);
1329 atomic_add_int(&fdp
->fd_softrefs
, 1);
1330 spin_unlock_wr(&p
->p_spin
);
1333 * Locate and close any matching file descriptors.
1335 spin_lock_wr(&fdp
->fd_spin
);
1336 for (n
= 0; n
< fdp
->fd_nfiles
; ++n
) {
1337 if ((fp
= fdp
->fd_files
[n
].fp
) == NULL
)
1339 if (fp
->f_flag
& FREVOKED
) {
1341 fdp
->fd_files
[n
].fp
= info
->nfp
;
1342 spin_unlock_wr(&fdp
->fd_spin
);
1344 spin_lock_wr(&fdp
->fd_spin
);
1348 spin_unlock_wr(&fdp
->fd_spin
);
1349 atomic_subtract_int(&fdp
->fd_softrefs
, 1);
1355 * Create a new open file structure and reserve a file decriptor
1356 * for the process that refers to it.
1358 * Root creds are checked using p, or assumed if p is NULL. If
1359 * resultfd is non-NULL then p must also be non-NULL. No file
1360 * descriptor is reserved if resultfd is NULL.
1362 * A file pointer with a refcount of 1 is returned. Note that the
1363 * file pointer is NOT associated with the descriptor. If falloc
1364 * returns success, fsetfd() MUST be called to either associate the
1365 * file pointer or clear the reservation.
1370 falloc(struct proc
*p
, struct file
**resultfp
, int *resultfd
)
1372 static struct timeval lastfail
;
1380 * Handle filetable full issues and root overfill.
1382 if (nfiles
>= maxfiles
- maxfilesrootres
&&
1383 ((p
&& p
->p_ucred
->cr_ruid
!= 0) || nfiles
>= maxfiles
)) {
1384 if (ppsratecheck(&lastfail
, &curfail
, 1)) {
1385 kprintf("kern.maxfiles limit exceeded by uid %d, please see tuning(7).\n",
1386 (p
? p
->p_ucred
->cr_ruid
: -1));
1393 * Allocate a new file descriptor.
1395 fp
= kmalloc(sizeof(struct file
), M_FILE
, M_WAITOK
| M_ZERO
);
1396 spin_init(&fp
->f_spin
);
1398 fp
->f_ops
= &badfileops
;
1401 fp
->f_cred
= crhold(p
->p_ucred
);
1403 fp
->f_cred
= crhold(proc0
.p_ucred
);
1404 spin_lock_wr(&filehead_spin
);
1406 LIST_INSERT_HEAD(&filehead
, fp
, f_list
);
1407 spin_unlock_wr(&filehead_spin
);
1409 if ((error
= fdalloc(p
, 0, resultfd
)) != 0) {
1426 checkfpclosed(struct filedesc
*fdp
, int fd
, struct file
*fp
)
1430 spin_lock_rd(&fdp
->fd_spin
);
1431 if ((unsigned) fd
>= fdp
->fd_nfiles
|| fp
!= fdp
->fd_files
[fd
].fp
)
1435 spin_unlock_rd(&fdp
->fd_spin
);
1440 * Associate a file pointer with a previously reserved file descriptor.
1441 * This function always succeeds.
1443 * If fp is NULL, the file descriptor is returned to the pool.
1447 * MPSAFE (exclusive spinlock must be held on call)
1450 fsetfd_locked(struct filedesc
*fdp
, struct file
*fp
, int fd
)
1452 KKASSERT((unsigned)fd
< fdp
->fd_nfiles
);
1453 KKASSERT(fdp
->fd_files
[fd
].reserved
!= 0);
1456 fdp
->fd_files
[fd
].fp
= fp
;
1457 fdp
->fd_files
[fd
].reserved
= 0;
1458 if (fp
->f_type
== DTYPE_KQUEUE
) {
1459 if (fdp
->fd_knlistsize
< 0)
1460 fdp
->fd_knlistsize
= 0;
1463 fdp
->fd_files
[fd
].reserved
= 0;
1464 fdreserve_locked(fdp
, fd
, -1);
1465 fdfixup_locked(fdp
, fd
);
1473 fsetfd(struct proc
*p
, struct file
*fp
, int fd
)
1475 struct filedesc
*fdp
= p
->p_fd
;
1477 spin_lock_wr(&fdp
->fd_spin
);
1478 fsetfd_locked(fdp
, fp
, fd
);
1479 spin_unlock_wr(&fdp
->fd_spin
);
1483 * MPSAFE (exclusive spinlock must be held on call)
1487 funsetfd_locked(struct filedesc
*fdp
, int fd
)
1491 if ((unsigned)fd
>= fdp
->fd_nfiles
)
1493 if ((fp
= fdp
->fd_files
[fd
].fp
) == NULL
)
1495 fdp
->fd_files
[fd
].fp
= NULL
;
1496 fdp
->fd_files
[fd
].fileflags
= 0;
1498 fdreserve_locked(fdp
, fd
, -1);
1499 fdfixup_locked(fdp
, fd
);
1507 fgetfdflags(struct filedesc
*fdp
, int fd
, int *flagsp
)
1511 spin_lock_rd(&fdp
->fd_spin
);
1512 if (((u_int
)fd
) >= fdp
->fd_nfiles
) {
1514 } else if (fdp
->fd_files
[fd
].fp
== NULL
) {
1517 *flagsp
= fdp
->fd_files
[fd
].fileflags
;
1520 spin_unlock_rd(&fdp
->fd_spin
);
1528 fsetfdflags(struct filedesc
*fdp
, int fd
, int add_flags
)
1532 spin_lock_wr(&fdp
->fd_spin
);
1533 if (((u_int
)fd
) >= fdp
->fd_nfiles
) {
1535 } else if (fdp
->fd_files
[fd
].fp
== NULL
) {
1538 fdp
->fd_files
[fd
].fileflags
|= add_flags
;
1541 spin_unlock_wr(&fdp
->fd_spin
);
1549 fclrfdflags(struct filedesc
*fdp
, int fd
, int rem_flags
)
1553 spin_lock_wr(&fdp
->fd_spin
);
1554 if (((u_int
)fd
) >= fdp
->fd_nfiles
) {
1556 } else if (fdp
->fd_files
[fd
].fp
== NULL
) {
1559 fdp
->fd_files
[fd
].fileflags
&= ~rem_flags
;
1562 spin_unlock_wr(&fdp
->fd_spin
);
1567 fsetcred(struct file
*fp
, struct ucred
*cr
)
1575 * Free a file descriptor.
1579 ffree(struct file
*fp
)
1581 KASSERT((fp
->f_count
== 0), ("ffree: fp_fcount not 0!"));
1582 spin_lock_wr(&filehead_spin
);
1583 LIST_REMOVE(fp
, f_list
);
1585 spin_unlock_wr(&filehead_spin
);
1587 if (fp
->f_nchandle
.ncp
)
1588 cache_drop(&fp
->f_nchandle
);
1593 * called from init_main, initialize filedesc0 for proc0.
1596 fdinit_bootstrap(struct proc
*p0
, struct filedesc
*fdp0
, int cmask
)
1600 fdp0
->fd_refcnt
= 1;
1601 fdp0
->fd_cmask
= cmask
;
1602 fdp0
->fd_files
= fdp0
->fd_builtin_files
;
1603 fdp0
->fd_nfiles
= NDFILE
;
1604 fdp0
->fd_lastfile
= -1;
1605 spin_init(&fdp0
->fd_spin
);
1609 * Build a new filedesc structure.
1614 fdinit(struct proc
*p
)
1616 struct filedesc
*newfdp
;
1617 struct filedesc
*fdp
= p
->p_fd
;
1619 newfdp
= kmalloc(sizeof(struct filedesc
), M_FILEDESC
, M_WAITOK
|M_ZERO
);
1620 spin_lock_rd(&fdp
->fd_spin
);
1622 newfdp
->fd_cdir
= fdp
->fd_cdir
;
1623 vref(newfdp
->fd_cdir
);
1624 cache_copy(&fdp
->fd_ncdir
, &newfdp
->fd_ncdir
);
1628 * rdir may not be set in e.g. proc0 or anything vm_fork'd off of
1629 * proc0, but should unconditionally exist in other processes.
1632 newfdp
->fd_rdir
= fdp
->fd_rdir
;
1633 vref(newfdp
->fd_rdir
);
1634 cache_copy(&fdp
->fd_nrdir
, &newfdp
->fd_nrdir
);
1637 newfdp
->fd_jdir
= fdp
->fd_jdir
;
1638 vref(newfdp
->fd_jdir
);
1639 cache_copy(&fdp
->fd_njdir
, &newfdp
->fd_njdir
);
1641 spin_unlock_rd(&fdp
->fd_spin
);
1643 /* Create the file descriptor table. */
1644 newfdp
->fd_refcnt
= 1;
1645 newfdp
->fd_cmask
= cmask
;
1646 newfdp
->fd_files
= newfdp
->fd_builtin_files
;
1647 newfdp
->fd_nfiles
= NDFILE
;
1648 newfdp
->fd_knlistsize
= -1;
1649 newfdp
->fd_lastfile
= -1;
1650 spin_init(&newfdp
->fd_spin
);
1656 * Share a filedesc structure.
1661 fdshare(struct proc
*p
)
1663 struct filedesc
*fdp
;
1666 spin_lock_wr(&fdp
->fd_spin
);
1668 spin_unlock_wr(&fdp
->fd_spin
);
1673 * Copy a filedesc structure.
1678 fdcopy(struct proc
*p
)
1680 struct filedesc
*fdp
= p
->p_fd
;
1681 struct filedesc
*newfdp
;
1682 struct fdnode
*fdnode
;
1687 * Certain daemons might not have file descriptors.
1693 * Allocate the new filedesc and fd_files[] array. This can race
1694 * with operations by other threads on the fdp so we have to be
1697 newfdp
= kmalloc(sizeof(struct filedesc
), M_FILEDESC
, M_WAITOK
| M_ZERO
);
1699 spin_lock_rd(&fdp
->fd_spin
);
1700 if (fdp
->fd_lastfile
< NDFILE
) {
1701 newfdp
->fd_files
= newfdp
->fd_builtin_files
;
1705 * We have to allocate (N^2-1) entries for our in-place
1706 * binary tree. Allow the table to shrink.
1710 while (ni
> fdp
->fd_lastfile
&& ni
> NDFILE
) {
1714 spin_unlock_rd(&fdp
->fd_spin
);
1715 newfdp
->fd_files
= kmalloc(i
* sizeof(struct fdnode
),
1716 M_FILEDESC
, M_WAITOK
| M_ZERO
);
1719 * Check for race, retry
1721 spin_lock_rd(&fdp
->fd_spin
);
1722 if (i
<= fdp
->fd_lastfile
) {
1723 spin_unlock_rd(&fdp
->fd_spin
);
1724 kfree(newfdp
->fd_files
, M_FILEDESC
);
1730 * Dup the remaining fields. vref() and cache_hold() can be
1731 * safely called while holding the read spinlock on fdp.
1733 * The read spinlock on fdp is still being held.
1735 * NOTE: vref and cache_hold calls for the case where the vnode
1736 * or cache entry already has at least one ref may be called
1737 * while holding spin locks.
1739 if ((newfdp
->fd_cdir
= fdp
->fd_cdir
) != NULL
) {
1740 vref(newfdp
->fd_cdir
);
1741 cache_copy(&fdp
->fd_ncdir
, &newfdp
->fd_ncdir
);
1744 * We must check for fd_rdir here, at least for now because
1745 * the init process is created before we have access to the
1746 * rootvode to take a reference to it.
1748 if ((newfdp
->fd_rdir
= fdp
->fd_rdir
) != NULL
) {
1749 vref(newfdp
->fd_rdir
);
1750 cache_copy(&fdp
->fd_nrdir
, &newfdp
->fd_nrdir
);
1752 if ((newfdp
->fd_jdir
= fdp
->fd_jdir
) != NULL
) {
1753 vref(newfdp
->fd_jdir
);
1754 cache_copy(&fdp
->fd_njdir
, &newfdp
->fd_njdir
);
1756 newfdp
->fd_refcnt
= 1;
1757 newfdp
->fd_nfiles
= i
;
1758 newfdp
->fd_lastfile
= fdp
->fd_lastfile
;
1759 newfdp
->fd_freefile
= fdp
->fd_freefile
;
1760 newfdp
->fd_cmask
= fdp
->fd_cmask
;
1761 newfdp
->fd_knlist
= NULL
;
1762 newfdp
->fd_knlistsize
= -1;
1763 newfdp
->fd_knhash
= NULL
;
1764 newfdp
->fd_knhashmask
= 0;
1765 spin_init(&newfdp
->fd_spin
);
1768 * Copy the descriptor table through (i). This also copies the
1769 * allocation state. Then go through and ref the file pointers
1770 * and clean up any KQ descriptors.
1772 * kq descriptors cannot be copied. Since we haven't ref'd the
1773 * copied files yet we can ignore the return value from funsetfd().
1775 * The read spinlock on fdp is still being held.
1777 bcopy(fdp
->fd_files
, newfdp
->fd_files
, i
* sizeof(struct fdnode
));
1778 for (i
= 0 ; i
< newfdp
->fd_nfiles
; ++i
) {
1779 fdnode
= &newfdp
->fd_files
[i
];
1780 if (fdnode
->reserved
) {
1781 fdreserve_locked(newfdp
, i
, -1);
1782 fdnode
->reserved
= 0;
1783 fdfixup_locked(newfdp
, i
);
1784 } else if (fdnode
->fp
) {
1785 if (fdnode
->fp
->f_type
== DTYPE_KQUEUE
) {
1786 (void)funsetfd_locked(newfdp
, i
);
1792 spin_unlock_rd(&fdp
->fd_spin
);
1797 * Release a filedesc structure.
1799 * NOT MPSAFE (MPSAFE for refs > 1, but the final cleanup code is not MPSAFE)
1802 fdfree(struct proc
*p
, struct filedesc
*repl
)
1804 struct filedesc
*fdp
;
1805 struct fdnode
*fdnode
;
1807 struct filedesc_to_leader
*fdtol
;
1813 * Certain daemons might not have file descriptors.
1822 * Severe messing around to follow.
1824 spin_lock_wr(&fdp
->fd_spin
);
1826 /* Check for special need to clear POSIX style locks */
1828 if (fdtol
!= NULL
) {
1829 KASSERT(fdtol
->fdl_refcount
> 0,
1830 ("filedesc_to_refcount botch: fdl_refcount=%d",
1831 fdtol
->fdl_refcount
));
1832 if (fdtol
->fdl_refcount
== 1 &&
1833 (p
->p_leader
->p_flag
& P_ADVLOCK
) != 0) {
1834 for (i
= 0; i
<= fdp
->fd_lastfile
; ++i
) {
1835 fdnode
= &fdp
->fd_files
[i
];
1836 if (fdnode
->fp
== NULL
||
1837 fdnode
->fp
->f_type
!= DTYPE_VNODE
) {
1842 spin_unlock_wr(&fdp
->fd_spin
);
1844 lf
.l_whence
= SEEK_SET
;
1847 lf
.l_type
= F_UNLCK
;
1848 vp
= (struct vnode
*)fp
->f_data
;
1849 (void) VOP_ADVLOCK(vp
,
1850 (caddr_t
)p
->p_leader
,
1855 spin_lock_wr(&fdp
->fd_spin
);
1859 if (fdtol
->fdl_refcount
== 1) {
1860 if (fdp
->fd_holdleaderscount
> 0 &&
1861 (p
->p_leader
->p_flag
& P_ADVLOCK
) != 0) {
1863 * close() or do_dup() has cleared a reference
1864 * in a shared file descriptor table.
1866 fdp
->fd_holdleaderswakeup
= 1;
1867 msleep(&fdp
->fd_holdleaderscount
,
1868 &fdp
->fd_spin
, 0, "fdlhold", 0);
1871 if (fdtol
->fdl_holdcount
> 0) {
1873 * Ensure that fdtol->fdl_leader
1874 * remains valid in closef().
1876 fdtol
->fdl_wakeup
= 1;
1877 msleep(fdtol
, &fdp
->fd_spin
, 0, "fdlhold", 0);
1881 fdtol
->fdl_refcount
--;
1882 if (fdtol
->fdl_refcount
== 0 &&
1883 fdtol
->fdl_holdcount
== 0) {
1884 fdtol
->fdl_next
->fdl_prev
= fdtol
->fdl_prev
;
1885 fdtol
->fdl_prev
->fdl_next
= fdtol
->fdl_next
;
1890 if (fdtol
!= NULL
) {
1891 spin_unlock_wr(&fdp
->fd_spin
);
1892 kfree(fdtol
, M_FILEDESC_TO_LEADER
);
1893 spin_lock_wr(&fdp
->fd_spin
);
1896 if (--fdp
->fd_refcnt
> 0) {
1897 spin_unlock_wr(&fdp
->fd_spin
);
1898 spin_lock_wr(&p
->p_spin
);
1900 spin_unlock_wr(&p
->p_spin
);
1905 * Even though we are the last reference to the structure allproc
1906 * scans may still reference the structure. Maintain proper
1907 * locks until we can replace p->p_fd.
1909 * Also note that kqueue's closef still needs to reference the
1910 * fdp via p->p_fd, so we have to close the descriptors before
1911 * we replace p->p_fd.
1913 for (i
= 0; i
<= fdp
->fd_lastfile
; ++i
) {
1914 if (fdp
->fd_files
[i
].fp
) {
1915 fp
= funsetfd_locked(fdp
, i
);
1917 spin_unlock_wr(&fdp
->fd_spin
);
1919 spin_lock_wr(&fdp
->fd_spin
);
1923 spin_unlock_wr(&fdp
->fd_spin
);
1926 * Interlock against an allproc scan operations (typically frevoke).
1928 spin_lock_wr(&p
->p_spin
);
1930 spin_unlock_wr(&p
->p_spin
);
1933 * Wait for any softrefs to go away. This race rarely occurs so
1934 * we can use a non-critical-path style poll/sleep loop. The
1935 * race only occurs against allproc scans.
1937 * No new softrefs can occur with the fdp disconnected from the
1940 if (fdp
->fd_softrefs
) {
1941 kprintf("pid %d: Warning, fdp race avoided\n", p
->p_pid
);
1942 while (fdp
->fd_softrefs
)
1943 tsleep(&fdp
->fd_softrefs
, 0, "fdsoft", 1);
1946 if (fdp
->fd_files
!= fdp
->fd_builtin_files
)
1947 kfree(fdp
->fd_files
, M_FILEDESC
);
1949 cache_drop(&fdp
->fd_ncdir
);
1950 vrele(fdp
->fd_cdir
);
1953 cache_drop(&fdp
->fd_nrdir
);
1954 vrele(fdp
->fd_rdir
);
1957 cache_drop(&fdp
->fd_njdir
);
1958 vrele(fdp
->fd_jdir
);
1961 kfree(fdp
->fd_knlist
, M_KQUEUE
);
1963 kfree(fdp
->fd_knhash
, M_KQUEUE
);
1964 kfree(fdp
, M_FILEDESC
);
1968 * Retrieve and reference the file pointer associated with a descriptor.
1973 holdfp(struct filedesc
*fdp
, int fd
, int flag
)
1977 spin_lock_rd(&fdp
->fd_spin
);
1978 if (((u_int
)fd
) >= fdp
->fd_nfiles
) {
1982 if ((fp
= fdp
->fd_files
[fd
].fp
) == NULL
)
1984 if ((fp
->f_flag
& flag
) == 0 && flag
!= -1) {
1990 spin_unlock_rd(&fdp
->fd_spin
);
1995 * holdsock() - load the struct file pointer associated
1996 * with a socket into *fpp. If an error occurs, non-zero
1997 * will be returned and *fpp will be set to NULL.
2002 holdsock(struct filedesc
*fdp
, int fd
, struct file
**fpp
)
2007 spin_lock_rd(&fdp
->fd_spin
);
2008 if ((unsigned)fd
>= fdp
->fd_nfiles
) {
2013 if ((fp
= fdp
->fd_files
[fd
].fp
) == NULL
) {
2017 if (fp
->f_type
!= DTYPE_SOCKET
) {
2024 spin_unlock_rd(&fdp
->fd_spin
);
2030 * Convert a user file descriptor to a held file pointer.
2035 holdvnode(struct filedesc
*fdp
, int fd
, struct file
**fpp
)
2040 spin_lock_rd(&fdp
->fd_spin
);
2041 if ((unsigned)fd
>= fdp
->fd_nfiles
) {
2046 if ((fp
= fdp
->fd_files
[fd
].fp
) == NULL
) {
2050 if (fp
->f_type
!= DTYPE_VNODE
&& fp
->f_type
!= DTYPE_FIFO
) {
2058 spin_unlock_rd(&fdp
->fd_spin
);
2064 * For setugid programs, we don't want to people to use that setugidness
2065 * to generate error messages which write to a file which otherwise would
2066 * otherwise be off-limits to the process.
2068 * This is a gross hack to plug the hole. A better solution would involve
2069 * a special vop or other form of generalized access control mechanism. We
2070 * go ahead and just reject all procfs file systems accesses as dangerous.
2072 * Since setugidsafety calls this only for fd 0, 1 and 2, this check is
2073 * sufficient. We also don't for check setugidness since we know we are.
2076 is_unsafe(struct file
*fp
)
2078 if (fp
->f_type
== DTYPE_VNODE
&&
2079 ((struct vnode
*)(fp
->f_data
))->v_tag
== VT_PROCFS
)
2085 * Make this setguid thing safe, if at all possible.
2087 * NOT MPSAFE - scans fdp without spinlocks, calls knote_fdclose()
2090 setugidsafety(struct proc
*p
)
2092 struct filedesc
*fdp
= p
->p_fd
;
2095 /* Certain daemons might not have file descriptors. */
2100 * note: fdp->fd_files may be reallocated out from under us while
2101 * we are blocked in a close. Be careful!
2103 for (i
= 0; i
<= fdp
->fd_lastfile
; i
++) {
2106 if (fdp
->fd_files
[i
].fp
&& is_unsafe(fdp
->fd_files
[i
].fp
)) {
2109 if (i
< fdp
->fd_knlistsize
)
2110 knote_fdclose(p
, i
);
2112 * NULL-out descriptor prior to close to avoid
2113 * a race while close blocks.
2115 if ((fp
= funsetfd_locked(fdp
, i
)) != NULL
)
2122 * Close any files on exec?
2124 * NOT MPSAFE - scans fdp without spinlocks, calls knote_fdclose()
2127 fdcloseexec(struct proc
*p
)
2129 struct filedesc
*fdp
= p
->p_fd
;
2132 /* Certain daemons might not have file descriptors. */
2137 * We cannot cache fd_files since operations may block and rip
2138 * them out from under us.
2140 for (i
= 0; i
<= fdp
->fd_lastfile
; i
++) {
2141 if (fdp
->fd_files
[i
].fp
!= NULL
&&
2142 (fdp
->fd_files
[i
].fileflags
& UF_EXCLOSE
)) {
2145 if (i
< fdp
->fd_knlistsize
)
2146 knote_fdclose(p
, i
);
2148 * NULL-out descriptor prior to close to avoid
2149 * a race while close blocks.
2151 if ((fp
= funsetfd_locked(fdp
, i
)) != NULL
)
2158 * It is unsafe for set[ug]id processes to be started with file
2159 * descriptors 0..2 closed, as these descriptors are given implicit
2160 * significance in the Standard C library. fdcheckstd() will create a
2161 * descriptor referencing /dev/null for each of stdin, stdout, and
2162 * stderr that is not already open.
2164 * NOT MPSAFE - calls falloc, vn_open, etc
2167 fdcheckstd(struct proc
*p
)
2169 struct nlookupdata nd
;
2170 struct filedesc
*fdp
;
2173 int i
, error
, flags
, devnull
;
2180 for (i
= 0; i
< 3; i
++) {
2181 if (fdp
->fd_files
[i
].fp
!= NULL
)
2184 if ((error
= falloc(p
, &fp
, &devnull
)) != 0)
2187 error
= nlookup_init(&nd
, "/dev/null", UIO_SYSSPACE
,
2188 NLC_FOLLOW
|NLC_LOCKVP
);
2189 flags
= FREAD
| FWRITE
;
2191 error
= vn_open(&nd
, fp
, flags
, 0);
2193 fsetfd(p
, fp
, devnull
);
2195 fsetfd(p
, NULL
, devnull
);
2200 KKASSERT(i
== devnull
);
2202 error
= kern_dup(DUP_FIXED
, devnull
, i
, &retval
);
2211 * Internal form of close.
2212 * Decrement reference count on file structure.
2213 * Note: td and/or p may be NULL when closing a file
2214 * that was being passed in a message.
2216 * MPALMOSTSAFE - acquires mplock for VOP operations
2219 closef(struct file
*fp
, struct proc
*p
)
2223 struct filedesc_to_leader
*fdtol
;
2229 * POSIX record locking dictates that any close releases ALL
2230 * locks owned by this process. This is handled by setting
2231 * a flag in the unlock to free ONLY locks obeying POSIX
2232 * semantics, and not to free BSD-style file locks.
2233 * If the descriptor was in a message, POSIX-style locks
2234 * aren't passed with the descriptor.
2236 if (p
!= NULL
&& fp
->f_type
== DTYPE_VNODE
&&
2237 (((struct vnode
*)fp
->f_data
)->v_flag
& VMAYHAVELOCKS
)
2240 if ((p
->p_leader
->p_flag
& P_ADVLOCK
) != 0) {
2241 lf
.l_whence
= SEEK_SET
;
2244 lf
.l_type
= F_UNLCK
;
2245 vp
= (struct vnode
*)fp
->f_data
;
2246 (void) VOP_ADVLOCK(vp
, (caddr_t
)p
->p_leader
, F_UNLCK
,
2250 if (fdtol
!= NULL
) {
2252 * Handle special case where file descriptor table
2253 * is shared between multiple process leaders.
2255 for (fdtol
= fdtol
->fdl_next
;
2256 fdtol
!= p
->p_fdtol
;
2257 fdtol
= fdtol
->fdl_next
) {
2258 if ((fdtol
->fdl_leader
->p_flag
&
2261 fdtol
->fdl_holdcount
++;
2262 lf
.l_whence
= SEEK_SET
;
2265 lf
.l_type
= F_UNLCK
;
2266 vp
= (struct vnode
*)fp
->f_data
;
2267 (void) VOP_ADVLOCK(vp
,
2268 (caddr_t
)fdtol
->fdl_leader
,
2269 F_UNLCK
, &lf
, F_POSIX
);
2270 fdtol
->fdl_holdcount
--;
2271 if (fdtol
->fdl_holdcount
== 0 &&
2272 fdtol
->fdl_wakeup
!= 0) {
2273 fdtol
->fdl_wakeup
= 0;
2286 * fhold() can only be called if f_count is already at least 1 (i.e. the
2287 * caller of fhold() already has a reference to the file pointer in some
2290 * f_count is not spin-locked. Instead, atomic ops are used for
2291 * incrementing, decrementing, and handling the 1->0 transition.
2294 fhold(struct file
*fp
)
2296 atomic_add_int(&fp
->f_count
, 1);
2300 * fdrop() - drop a reference to a descriptor
2302 * MPALMOSTSAFE - acquires mplock for final close sequence
2305 fdrop(struct file
*fp
)
2312 * A combined fetch and subtract is needed to properly detect
2313 * 1->0 transitions, otherwise two cpus dropping from a ref
2314 * count of 2 might both try to run the 1->0 code.
2316 if (atomic_fetchadd_int(&fp
->f_count
, -1) > 1)
2322 * The last reference has gone away, we own the fp structure free
2325 if (fp
->f_count
< 0)
2326 panic("fdrop: count < 0");
2327 if ((fp
->f_flag
& FHASLOCK
) && fp
->f_type
== DTYPE_VNODE
&&
2328 (((struct vnode
*)fp
->f_data
)->v_flag
& VMAYHAVELOCKS
)
2330 lf
.l_whence
= SEEK_SET
;
2333 lf
.l_type
= F_UNLCK
;
2334 vp
= (struct vnode
*)fp
->f_data
;
2335 (void) VOP_ADVLOCK(vp
, (caddr_t
)fp
, F_UNLCK
, &lf
, 0);
2337 if (fp
->f_ops
!= &badfileops
)
2338 error
= fo_close(fp
);
2347 * Apply an advisory lock on a file descriptor.
2349 * Just attempt to get a record lock of the requested type on
2350 * the entire file (l_whence = SEEK_SET, l_start = 0, l_len = 0).
2353 sys_flock(struct flock_args
*uap
)
2355 struct proc
*p
= curproc
;
2361 if ((fp
= holdfp(p
->p_fd
, uap
->fd
, -1)) == NULL
)
2363 if (fp
->f_type
!= DTYPE_VNODE
) {
2367 vp
= (struct vnode
*)fp
->f_data
;
2368 lf
.l_whence
= SEEK_SET
;
2371 if (uap
->how
& LOCK_UN
) {
2372 lf
.l_type
= F_UNLCK
;
2373 fp
->f_flag
&= ~FHASLOCK
;
2374 error
= VOP_ADVLOCK(vp
, (caddr_t
)fp
, F_UNLCK
, &lf
, 0);
2377 if (uap
->how
& LOCK_EX
)
2378 lf
.l_type
= F_WRLCK
;
2379 else if (uap
->how
& LOCK_SH
)
2380 lf
.l_type
= F_RDLCK
;
2385 fp
->f_flag
|= FHASLOCK
;
2386 if (uap
->how
& LOCK_NB
)
2387 error
= VOP_ADVLOCK(vp
, (caddr_t
)fp
, F_SETLK
, &lf
, 0);
2389 error
= VOP_ADVLOCK(vp
, (caddr_t
)fp
, F_SETLK
, &lf
, F_WAIT
);
2396 * File Descriptor pseudo-device driver (/dev/fd/).
2398 * Opening minor device N dup()s the file (if any) connected to file
2399 * descriptor N belonging to the calling process. Note that this driver
2400 * consists of only the ``open()'' routine, because all subsequent
2401 * references to this file will be direct to the other driver.
2405 fdopen(struct dev_open_args
*ap
)
2407 thread_t td
= curthread
;
2409 KKASSERT(td
->td_lwp
!= NULL
);
2412 * XXX Kludge: set curlwp->lwp_dupfd to contain the value of the
2413 * the file descriptor being sought for duplication. The error
2414 * return ensures that the vnode for this device will be released
2415 * by vn_open. Open will detect this special error and take the
2416 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
2417 * will simply report the error.
2419 td
->td_lwp
->lwp_dupfd
= minor(ap
->a_head
.a_dev
);
2424 * The caller has reserved the file descriptor dfd for us. On success we
2425 * must fsetfd() it. On failure the caller will clean it up.
2427 * NOT MPSAFE - isn't getting spinlocks, possibly other things
2430 dupfdopen(struct proc
*p
, int dfd
, int sfd
, int mode
, int error
)
2432 struct filedesc
*fdp
= p
->p_fd
;
2437 if ((wfp
= holdfp(fdp
, sfd
, -1)) == NULL
)
2441 * Close a revoke/dup race. Duping a descriptor marked as revoked
2442 * will dup a dummy descriptor instead of the real one.
2444 if (wfp
->f_flag
& FREVOKED
) {
2445 kprintf("Warning: attempt to dup() a revoked descriptor\n");
2448 werror
= falloc(NULL
, &wfp
, NULL
);
2454 * There are two cases of interest here.
2456 * For ENODEV simply dup sfd to file descriptor dfd and return.
2458 * For ENXIO steal away the file structure from sfd and store it
2459 * dfd. sfd is effectively closed by this operation.
2461 * Any other error code is just returned.
2466 * Check that the mode the file is being opened for is a
2467 * subset of the mode of the existing descriptor.
2469 if (((mode
& (FREAD
|FWRITE
)) | wfp
->f_flag
) != wfp
->f_flag
) {
2473 fdp
->fd_files
[dfd
].fileflags
= fdp
->fd_files
[sfd
].fileflags
;
2474 fsetfd(p
, wfp
, dfd
);
2479 * Steal away the file pointer from dfd, and stuff it into indx.
2481 fdp
->fd_files
[dfd
].fileflags
= fdp
->fd_files
[sfd
].fileflags
;
2482 fsetfd(p
, wfp
, dfd
);
2483 if ((xfp
= funsetfd_locked(fdp
, sfd
)) != NULL
)
2495 * NOT MPSAFE - I think these refer to a common file descriptor table
2496 * and we need to spinlock that to link fdtol in.
2498 struct filedesc_to_leader
*
2499 filedesc_to_leader_alloc(struct filedesc_to_leader
*old
,
2500 struct proc
*leader
)
2502 struct filedesc_to_leader
*fdtol
;
2504 fdtol
= kmalloc(sizeof(struct filedesc_to_leader
),
2505 M_FILEDESC_TO_LEADER
, M_WAITOK
);
2506 fdtol
->fdl_refcount
= 1;
2507 fdtol
->fdl_holdcount
= 0;
2508 fdtol
->fdl_wakeup
= 0;
2509 fdtol
->fdl_leader
= leader
;
2511 fdtol
->fdl_next
= old
->fdl_next
;
2512 fdtol
->fdl_prev
= old
;
2513 old
->fdl_next
= fdtol
;
2514 fdtol
->fdl_next
->fdl_prev
= fdtol
;
2516 fdtol
->fdl_next
= fdtol
;
2517 fdtol
->fdl_prev
= fdtol
;
2523 * Scan all file pointers in the system. The callback is made with
2524 * the master list spinlock held exclusively.
2529 allfiles_scan_exclusive(int (*callback
)(struct file
*, void *), void *data
)
2534 spin_lock_wr(&filehead_spin
);
2535 LIST_FOREACH(fp
, &filehead
, f_list
) {
2536 res
= callback(fp
, data
);
2540 spin_unlock_wr(&filehead_spin
);
2544 * Get file structures.
2546 * NOT MPSAFE - process list scan, SYSCTL_OUT (probably not mpsafe)
2549 struct sysctl_kern_file_info
{
2552 struct sysctl_req
*req
;
2555 static int sysctl_kern_file_callback(struct proc
*p
, void *data
);
2558 sysctl_kern_file(SYSCTL_HANDLER_ARGS
)
2560 struct sysctl_kern_file_info info
;
2563 * Note: because the number of file descriptors is calculated
2564 * in different ways for sizing vs returning the data,
2565 * there is information leakage from the first loop. However,
2566 * it is of a similar order of magnitude to the leakage from
2567 * global system statistics such as kern.openfiles.
2569 * When just doing a count, note that we cannot just count
2570 * the elements and add f_count via the filehead list because
2571 * threaded processes share their descriptor table and f_count might
2572 * still be '1' in that case.
2574 * Since the SYSCTL op can block, we must hold the process to
2575 * prevent it being ripped out from under us either in the
2576 * file descriptor loop or in the greater LIST_FOREACH. The
2577 * process may be in varying states of disrepair. If the process
2578 * is in SZOMB we may have caught it just as it is being removed
2579 * from the allproc list, we must skip it in that case to maintain
2580 * an unbroken chain through the allproc list.
2585 allproc_scan(sysctl_kern_file_callback
, &info
);
2588 * When just calculating the size, overestimate a bit to try to
2589 * prevent system activity from causing the buffer-fill call
2592 if (req
->oldptr
== NULL
) {
2593 info
.count
= (info
.count
+ 16) + (info
.count
/ 10);
2594 info
.error
= SYSCTL_OUT(req
, NULL
,
2595 info
.count
* sizeof(struct kinfo_file
));
2597 return (info
.error
);
2601 sysctl_kern_file_callback(struct proc
*p
, void *data
)
2603 struct sysctl_kern_file_info
*info
= data
;
2604 struct kinfo_file kf
;
2605 struct filedesc
*fdp
;
2610 if (p
->p_stat
== SIDL
|| p
->p_stat
== SZOMB
)
2612 if (!PRISON_CHECK(info
->req
->td
->td_proc
->p_ucred
, p
->p_ucred
) != 0)
2616 * Softref the fdp to prevent it from being destroyed
2618 spin_lock_wr(&p
->p_spin
);
2619 if ((fdp
= p
->p_fd
) == NULL
) {
2620 spin_unlock_wr(&p
->p_spin
);
2623 atomic_add_int(&fdp
->fd_softrefs
, 1);
2624 spin_unlock_wr(&p
->p_spin
);
2627 * The fdp's own spinlock prevents the contents from being
2630 spin_lock_rd(&fdp
->fd_spin
);
2631 for (n
= 0; n
< fdp
->fd_nfiles
; ++n
) {
2632 if ((fp
= fdp
->fd_files
[n
].fp
) == NULL
)
2634 if (info
->req
->oldptr
== NULL
) {
2637 uid
= p
->p_ucred
? p
->p_ucred
->cr_uid
: -1;
2638 kcore_make_file(&kf
, fp
, p
->p_pid
, uid
, n
);
2639 spin_unlock_rd(&fdp
->fd_spin
);
2640 info
->error
= SYSCTL_OUT(info
->req
, &kf
, sizeof(kf
));
2641 spin_lock_rd(&fdp
->fd_spin
);
2646 spin_unlock_rd(&fdp
->fd_spin
);
2647 atomic_subtract_int(&fdp
->fd_softrefs
, 1);
2653 SYSCTL_PROC(_kern
, KERN_FILE
, file
, CTLTYPE_OPAQUE
|CTLFLAG_RD
,
2654 0, 0, sysctl_kern_file
, "S,file", "Entire file table");
2656 SYSCTL_INT(_kern
, KERN_MAXFILESPERPROC
, maxfilesperproc
, CTLFLAG_RW
,
2657 &maxfilesperproc
, 0, "Maximum files allowed open per process");
2659 SYSCTL_INT(_kern
, KERN_MAXFILES
, maxfiles
, CTLFLAG_RW
,
2660 &maxfiles
, 0, "Maximum number of files");
2662 SYSCTL_INT(_kern
, OID_AUTO
, maxfilesrootres
, CTLFLAG_RW
,
2663 &maxfilesrootres
, 0, "Descriptors reserved for root use");
2665 SYSCTL_INT(_kern
, OID_AUTO
, openfiles
, CTLFLAG_RD
,
2666 &nfiles
, 0, "System-wide number of open files");
2669 fildesc_drvinit(void *unused
)
2673 dev_ops_add(&fildesc_ops
, 0, 0);
2674 for (fd
= 0; fd
< NUMFDESC
; fd
++) {
2675 make_dev(&fildesc_ops
, fd
,
2676 UID_BIN
, GID_BIN
, 0666, "fd/%d", fd
);
2678 make_dev(&fildesc_ops
, 0, UID_ROOT
, GID_WHEEL
, 0666, "stdin");
2679 make_dev(&fildesc_ops
, 1, UID_ROOT
, GID_WHEEL
, 0666, "stdout");
2680 make_dev(&fildesc_ops
, 2, UID_ROOT
, GID_WHEEL
, 0666, "stderr");
2686 struct fileops badfileops
= {
2687 .fo_read
= badfo_readwrite
,
2688 .fo_write
= badfo_readwrite
,
2689 .fo_ioctl
= badfo_ioctl
,
2690 .fo_poll
= badfo_poll
,
2691 .fo_kqfilter
= badfo_kqfilter
,
2692 .fo_stat
= badfo_stat
,
2693 .fo_close
= badfo_close
,
2694 .fo_shutdown
= badfo_shutdown
2714 badfo_ioctl(struct file
*fp
, u_long com
, caddr_t data
, struct ucred
*cred
)
2723 badfo_poll(struct file
*fp
, int events
, struct ucred
*cred
)
2732 badfo_kqfilter(struct file
*fp
, struct knote
*kn
)
2738 badfo_stat(struct file
*fp
, struct stat
*sb
, struct ucred
*cred
)
2747 badfo_close(struct file
*fp
)
2756 badfo_shutdown(struct file
*fp
, int how
)
2765 nofo_shutdown(struct file
*fp
, int how
)
2767 return (EOPNOTSUPP
);
2770 SYSINIT(fildescdev
,SI_SUB_DRIVERS
,SI_ORDER_MIDDLE
+CDEV_MAJOR
,
2771 fildesc_drvinit
,NULL
)