2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
21 * @APPLE_LICENSE_HEADER_END@
23 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
25 * Copyright (c) 1992, 1993, 1995
26 * The Regents of the University of California. All rights reserved.
28 * This code is derived from software donated to Berkeley by
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions
34 * 1. Redistributions of source code must retain the above copyright
35 * notice, this list of conditions and the following disclaimer.
36 * 2. Redistributions in binary form must reproduce the above copyright
37 * notice, this list of conditions and the following disclaimer in the
38 * documentation and/or other materials provided with the distribution.
39 * 3. All advertising materials mentioning features or use of this software
40 * must display the following acknowledgement:
41 * This product includes software developed by the University of
42 * California, Berkeley and its contributors.
43 * 4. Neither the name of the University nor the names of its contributors
44 * may be used to endorse or promote products derived from this software
45 * without specific prior written permission.
47 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
48 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
51 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
52 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
55 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
56 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 * @(#)fdesc_vfsops.c 8.10 (Berkeley) 5/14/95
67 #include <sys/param.h>
68 #include <sys/systm.h>
70 #include <sys/types.h>
71 #include <sys/proc_internal.h>
72 #include <sys/resourcevar.h>
73 #include <sys/filedesc.h>
74 #include <sys/vnode.h>
75 #include <sys/mount_internal.h>
76 #include <sys/namei.h>
77 #include <sys/malloc.h>
78 #include <miscfs/fdesc/fdesc.h>
81 * Mount the per-process file descriptors (/dev/fd)
84 fdesc_mount(struct mount
*mp
, vnode_t devvp
, __unused user_addr_t data
, vfs_context_t context
)
87 struct fdescmount
*fmp
;
93 if (mp
->mnt_flag
& MNT_UPDATE
)
96 error
= fdesc_allocvp(Froot
, FD_ROOT
, mp
, &rvp
, VDIR
);
100 MALLOC(fmp
, struct fdescmount
*, sizeof(struct fdescmount
),
101 M_UFSMNT
, M_WAITOK
); /* XXX */
103 vnode_setnoflush(rvp
);
108 /* XXX -- don't mark as local to work around fts() problems */
109 /*mp->mnt_flag |= MNT_LOCAL;*/
110 mp
->mnt_data
= (qaddr_t
) fmp
;
113 bzero(mp
->mnt_vfsstat
.f_mntfromname
, MAXPATHLEN
);
114 bcopy("fdesc", mp
->mnt_vfsstat
.f_mntfromname
, sizeof("fdesc"));
119 fdesc_start(mp
, flags
, context
)
122 vfs_context_t context
;
128 fdesc_unmount(mp
, mntflags
, context
)
131 vfs_context_t context
;
136 struct vnode
*rvp
= VFSTOFDESC(mp
)->f_root
;
138 if (mntflags
& MNT_FORCE
) {
143 if ( vnode_isinuse(rvp
, 1) && !force
)
145 if ( (error
= vflush(mp
, rvp
, flags
|SKIPSYSTEM
)) && !force
)
149 * And mark for recycle after we drop its reference; it away for future re-use
153 * Release reference on underlying root vnode
157 * Finally, throw away the fdescmount structure
159 _FREE(mp
->mnt_data
, M_UFSMNT
); /* XXX */
166 fdesc_root(mp
, vpp
, context
)
169 vfs_context_t context
;
174 * Return locked reference to root.
176 vp
= VFSTOFDESC(mp
)->f_root
;
183 fdesc_statfs(mp
, sbp
, context
)
185 struct vfsstatfs
*sbp
;
186 vfs_context_t context
;
188 struct proc
*p
= vfs_context_proc(context
);
189 struct filedesc
*fdp
;
196 * Compute number of free file descriptors.
197 * [ Strange results will ensue if the open file
198 * limit is ever reduced below the current number
201 lim
= p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
;
203 last
= min(fdp
->fd_nfiles
, lim
);
205 for (i
= fdp
->fd_freefile
; i
< last
; i
++)
206 if (fdp
->fd_ofiles
[i
] == NULL
&&
207 !(fdp
->fd_ofileflags
[i
] & UF_RESERVED
))
211 * Adjust for the fact that the fdesc array may not
212 * have been fully allocated yet.
214 if (fdp
->fd_nfiles
< lim
)
215 freefd
+= (lim
- fdp
->fd_nfiles
);
218 sbp
->f_bsize
= DEV_BSIZE
;
219 sbp
->f_iosize
= DEV_BSIZE
;
220 sbp
->f_blocks
= (uint64_t)2; /* 1K to keep df happy */
223 sbp
->f_files
= (uint64_t)((unsigned long)(lim
+ 1)); /* Allow for "." */
224 sbp
->f_ffree
= (uint64_t)((unsigned long)freefd
); /* See comments above */
230 fdesc_vfs_getattr(mount_t mp
, struct vfs_attr
*fsap
, vfs_context_t context
)
232 VFSATTR_RETURN(fsap
, f_bsize
, DEV_BSIZE
);
233 VFSATTR_RETURN(fsap
, f_iosize
, DEV_BSIZE
);
234 VFSATTR_RETURN(fsap
, f_blocks
, 2);
235 VFSATTR_RETURN(fsap
, f_bfree
, 0);
236 VFSATTR_RETURN(fsap
, f_bavail
, 0);
237 VFSATTR_RETURN(fsap
, f_fssubtype
, 0);
239 if (VFSATTR_IS_ACTIVE(fsap
, f_objcount
) ||
240 VFSATTR_IS_ACTIVE(fsap
, f_maxobjcount
) ||
241 VFSATTR_IS_ACTIVE(fsap
, f_files
) ||
242 VFSATTR_IS_ACTIVE(fsap
, f_ffree
))
244 struct proc
*p
= vfs_context_proc(context
);
245 struct filedesc
*fdp
;
252 * Compute number of free file descriptors.
253 * [ Strange results will ensue if the open file
254 * limit is ever reduced below the current number
257 lim
= p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
;
259 last
= min(fdp
->fd_nfiles
, lim
);
261 for (i
= fdp
->fd_freefile
; i
< last
; i
++)
262 if (fdp
->fd_ofiles
[i
] == NULL
&&
263 !(fdp
->fd_ofileflags
[i
] & UF_RESERVED
))
267 * Adjust for the fact that the fdesc array may not
268 * have been fully allocated yet.
270 if (fdp
->fd_nfiles
< lim
)
271 freefd
+= (lim
- fdp
->fd_nfiles
);
273 VFSATTR_RETURN(fsap
, f_objcount
, lim
+1);
274 VFSATTR_RETURN(fsap
, f_maxobjcount
, lim
+1);
275 VFSATTR_RETURN(fsap
, f_files
, lim
+1);
276 VFSATTR_RETURN(fsap
, f_ffree
, freefd
);
283 fdesc_sync(mp
, waitfor
, context
)
286 vfs_context_t context
;
292 #define fdesc_fhtovp (int (*) (mount_t, int, unsigned char *, vnode_t *, vfs_context_t))eopnotsupp
293 #define fdesc_sysctl (int (*) (int *, u_int, user_addr_t, size_t *, user_addr_t, size_t, vfs_context_t))eopnotsupp
294 #define fdesc_vget (int (*) (mount_t, ino64_t, vnode_t *, vfs_context_t))eopnotsupp
295 #define fdesc_vptofh (int (*) (vnode_t, int *, unsigned char *, vfs_context_t))eopnotsupp
297 struct vfsops fdesc_vfsops
= {