2 * Copyright (c) 2006 Apple Computer, Inc. All Rights Reserved.
4 * @APPLE_LICENSE_OSREFERENCE_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. The rights granted to you under the
10 * License may not be used to create, or enable the creation or
11 * redistribution of, unlawful or unlicensed copies of an Apple operating
12 * system, or to circumvent, violate, or enable the circumvention or
13 * violation of, any terms of an Apple operating system software license
16 * Please obtain a copy of the License at
17 * http://www.opensource.apple.com/apsl/ and read it before using this
20 * The Original Code and all software distributed under the License are
21 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
22 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
23 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
24 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
25 * Please see the License for the specific language governing rights and
26 * limitations under the License.
28 * @APPLE_LICENSE_OSREFERENCE_HEADER_END@
30 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
32 * Copyright (c) 1992, 1993, 1995
33 * The Regents of the University of California. All rights reserved.
35 * This code is derived from software donated to Berkeley by
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. All advertising materials mentioning features or use of this software
47 * must display the following acknowledgement:
48 * This product includes software developed by the University of
49 * California, Berkeley and its contributors.
50 * 4. Neither the name of the University nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 * @(#)fdesc_vfsops.c 8.10 (Berkeley) 5/14/95
74 #include <sys/param.h>
75 #include <sys/systm.h>
77 #include <sys/types.h>
78 #include <sys/proc_internal.h>
79 #include <sys/resourcevar.h>
80 #include <sys/filedesc.h>
81 #include <sys/vnode.h>
82 #include <sys/mount_internal.h>
83 #include <sys/namei.h>
84 #include <sys/malloc.h>
85 #include <miscfs/fdesc/fdesc.h>
88 * Mount the per-process file descriptors (/dev/fd)
91 fdesc_mount(struct mount
*mp
, vnode_t devvp
, __unused user_addr_t data
, vfs_context_t context
)
94 struct fdescmount
*fmp
;
100 if (mp
->mnt_flag
& MNT_UPDATE
)
103 error
= fdesc_allocvp(Froot
, FD_ROOT
, mp
, &rvp
, VDIR
);
107 MALLOC(fmp
, struct fdescmount
*, sizeof(struct fdescmount
),
108 M_UFSMNT
, M_WAITOK
); /* XXX */
110 vnode_setnoflush(rvp
);
115 /* XXX -- don't mark as local to work around fts() problems */
116 /*mp->mnt_flag |= MNT_LOCAL;*/
117 mp
->mnt_data
= (qaddr_t
) fmp
;
120 bzero(mp
->mnt_vfsstat
.f_mntfromname
, MAXPATHLEN
);
121 bcopy("fdesc", mp
->mnt_vfsstat
.f_mntfromname
, sizeof("fdesc"));
126 fdesc_start(mp
, flags
, context
)
129 vfs_context_t context
;
135 fdesc_unmount(mp
, mntflags
, context
)
138 vfs_context_t context
;
143 struct vnode
*rvp
= VFSTOFDESC(mp
)->f_root
;
145 if (mntflags
& MNT_FORCE
) {
150 if ( vnode_isinuse(rvp
, 1) && !force
)
152 if ( (error
= vflush(mp
, rvp
, flags
|SKIPSYSTEM
)) && !force
)
156 * And mark for recycle after we drop its reference; it away for future re-use
160 * Release reference on underlying root vnode
164 * Finally, throw away the fdescmount structure
166 _FREE(mp
->mnt_data
, M_UFSMNT
); /* XXX */
173 fdesc_root(mp
, vpp
, context
)
176 vfs_context_t context
;
181 * Return locked reference to root.
183 vp
= VFSTOFDESC(mp
)->f_root
;
190 fdesc_statfs(mp
, sbp
, context
)
192 struct vfsstatfs
*sbp
;
193 vfs_context_t context
;
195 struct proc
*p
= vfs_context_proc(context
);
196 struct filedesc
*fdp
;
203 * Compute number of free file descriptors.
204 * [ Strange results will ensue if the open file
205 * limit is ever reduced below the current number
208 lim
= p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
;
210 last
= min(fdp
->fd_nfiles
, lim
);
212 for (i
= fdp
->fd_freefile
; i
< last
; i
++)
213 if (fdp
->fd_ofiles
[i
] == NULL
&&
214 !(fdp
->fd_ofileflags
[i
] & UF_RESERVED
))
218 * Adjust for the fact that the fdesc array may not
219 * have been fully allocated yet.
221 if (fdp
->fd_nfiles
< lim
)
222 freefd
+= (lim
- fdp
->fd_nfiles
);
225 sbp
->f_bsize
= DEV_BSIZE
;
226 sbp
->f_iosize
= DEV_BSIZE
;
227 sbp
->f_blocks
= (uint64_t)2; /* 1K to keep df happy */
230 sbp
->f_files
= (uint64_t)((unsigned long)(lim
+ 1)); /* Allow for "." */
231 sbp
->f_ffree
= (uint64_t)((unsigned long)freefd
); /* See comments above */
237 fdesc_vfs_getattr(mount_t mp
, struct vfs_attr
*fsap
, vfs_context_t context
)
239 VFSATTR_RETURN(fsap
, f_bsize
, DEV_BSIZE
);
240 VFSATTR_RETURN(fsap
, f_iosize
, DEV_BSIZE
);
241 VFSATTR_RETURN(fsap
, f_blocks
, 2);
242 VFSATTR_RETURN(fsap
, f_bfree
, 0);
243 VFSATTR_RETURN(fsap
, f_bavail
, 0);
244 VFSATTR_RETURN(fsap
, f_fssubtype
, 0);
246 if (VFSATTR_IS_ACTIVE(fsap
, f_objcount
) ||
247 VFSATTR_IS_ACTIVE(fsap
, f_maxobjcount
) ||
248 VFSATTR_IS_ACTIVE(fsap
, f_files
) ||
249 VFSATTR_IS_ACTIVE(fsap
, f_ffree
))
251 struct proc
*p
= vfs_context_proc(context
);
252 struct filedesc
*fdp
;
259 * Compute number of free file descriptors.
260 * [ Strange results will ensue if the open file
261 * limit is ever reduced below the current number
264 lim
= p
->p_rlimit
[RLIMIT_NOFILE
].rlim_cur
;
266 last
= min(fdp
->fd_nfiles
, lim
);
268 for (i
= fdp
->fd_freefile
; i
< last
; i
++)
269 if (fdp
->fd_ofiles
[i
] == NULL
&&
270 !(fdp
->fd_ofileflags
[i
] & UF_RESERVED
))
274 * Adjust for the fact that the fdesc array may not
275 * have been fully allocated yet.
277 if (fdp
->fd_nfiles
< lim
)
278 freefd
+= (lim
- fdp
->fd_nfiles
);
280 VFSATTR_RETURN(fsap
, f_objcount
, lim
+1);
281 VFSATTR_RETURN(fsap
, f_maxobjcount
, lim
+1);
282 VFSATTR_RETURN(fsap
, f_files
, lim
+1);
283 VFSATTR_RETURN(fsap
, f_ffree
, freefd
);
290 fdesc_sync(mp
, waitfor
, context
)
293 vfs_context_t context
;
299 #define fdesc_fhtovp (int (*) (mount_t, int, unsigned char *, vnode_t *, vfs_context_t))eopnotsupp
300 #define fdesc_sysctl (int (*) (int *, u_int, user_addr_t, size_t *, user_addr_t, size_t, vfs_context_t))eopnotsupp
301 #define fdesc_vget (int (*) (mount_t, ino64_t, vnode_t *, vfs_context_t))eopnotsupp
302 #define fdesc_vptofh (int (*) (vnode_t, int *, unsigned char *, vfs_context_t))eopnotsupp
304 struct vfsops fdesc_vfsops
= {