mfs_vnops.c revision 1.27.2.1
1 /* $NetBSD: mfs_vnops.c,v 1.27.2.1 2001/03/05 22:50:09 nathanw Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)mfs_vnops.c 8.11 (Berkeley) 5/22/95 36 */ 37 38 #include <sys/param.h> 39 #include <sys/systm.h> 40 #include <sys/time.h> 41 #include <sys/kernel.h> 42 #include <sys/lwp.h> 43 #include <sys/proc.h> 44 #include <sys/buf.h> 45 #include <sys/map.h> 46 #include <sys/vnode.h> 47 #include <sys/malloc.h> 48 49 #include <miscfs/genfs/genfs.h> 50 #include <miscfs/specfs/specdev.h> 51 52 #include <machine/vmparam.h> 53 54 #include <ufs/mfs/mfsnode.h> 55 #include <ufs/mfs/mfs_extern.h> 56 57 /* 58 * mfs vnode operations. 59 */ 60 int (**mfs_vnodeop_p) __P((void *)); 61 const struct vnodeopv_entry_desc mfs_vnodeop_entries[] = { 62 { &vop_default_desc, vn_default_error }, 63 { &vop_lookup_desc, mfs_lookup }, /* lookup */ 64 { &vop_create_desc, mfs_create }, /* create */ 65 { &vop_mknod_desc, mfs_mknod }, /* mknod */ 66 { &vop_open_desc, mfs_open }, /* open */ 67 { &vop_close_desc, mfs_close }, /* close */ 68 { &vop_access_desc, mfs_access }, /* access */ 69 { &vop_getattr_desc, mfs_getattr }, /* getattr */ 70 { &vop_setattr_desc, mfs_setattr }, /* setattr */ 71 { &vop_read_desc, mfs_read }, /* read */ 72 { &vop_write_desc, mfs_write }, /* write */ 73 { &vop_ioctl_desc, mfs_ioctl }, /* ioctl */ 74 { &vop_poll_desc, mfs_poll }, /* poll */ 75 { &vop_revoke_desc, mfs_revoke }, /* revoke */ 76 { &vop_mmap_desc, mfs_mmap }, /* mmap */ 77 { &vop_fsync_desc, spec_fsync }, /* fsync */ 78 { &vop_seek_desc, mfs_seek }, /* seek */ 79 { &vop_remove_desc, mfs_remove }, /* remove */ 80 { &vop_link_desc, mfs_link }, /* link */ 81 { &vop_rename_desc, mfs_rename }, /* rename */ 82 { &vop_mkdir_desc, mfs_mkdir }, /* mkdir */ 83 { &vop_rmdir_desc, mfs_rmdir }, /* rmdir */ 84 { &vop_symlink_desc, mfs_symlink }, /* symlink */ 85 { &vop_readdir_desc, mfs_readdir }, /* readdir */ 86 { &vop_readlink_desc, mfs_readlink }, /* readlink */ 87 { &vop_abortop_desc, mfs_abortop }, /* abortop */ 88 { &vop_inactive_desc, mfs_inactive }, /* inactive */ 89 { &vop_reclaim_desc, mfs_reclaim }, /* reclaim */ 90 { &vop_lock_desc, mfs_lock }, /* lock */ 91 { &vop_unlock_desc, mfs_unlock }, /* unlock */ 92 { &vop_bmap_desc, mfs_bmap }, /* bmap */ 93 { &vop_strategy_desc, mfs_strategy }, /* strategy */ 94 { &vop_print_desc, mfs_print }, /* print */ 95 { &vop_islocked_desc, mfs_islocked }, /* islocked */ 96 { &vop_pathconf_desc, mfs_pathconf }, /* pathconf */ 97 { &vop_advlock_desc, mfs_advlock }, /* advlock */ 98 { &vop_blkatoff_desc, mfs_blkatoff }, /* blkatoff */ 99 { &vop_valloc_desc, mfs_valloc }, /* valloc */ 100 { &vop_vfree_desc, mfs_vfree }, /* vfree */ 101 { &vop_truncate_desc, mfs_truncate }, /* truncate */ 102 { &vop_update_desc, mfs_update }, /* update */ 103 { &vop_bwrite_desc, mfs_bwrite }, /* bwrite */ 104 { (struct vnodeop_desc*)NULL, (int(*) __P((void *)))NULL } 105 }; 106 const struct vnodeopv_desc mfs_vnodeop_opv_desc = 107 { &mfs_vnodeop_p, mfs_vnodeop_entries }; 108 109 /* 110 * Vnode Operations. 111 * 112 * Open called to allow memory filesystem to initialize and 113 * validate before actual IO. Record our process identifier 114 * so we can tell when we are doing I/O to ourself. 115 */ 116 /* ARGSUSED */ 117 int 118 mfs_open(v) 119 void *v; 120 { 121 struct vop_open_args /* { 122 struct vnode *a_vp; 123 int a_mode; 124 struct ucred *a_cred; 125 struct proc *a_p; 126 } */ *ap = v; 127 128 if (ap->a_vp->v_type != VBLK) { 129 panic("mfs_ioctl not VBLK"); 130 /* NOTREACHED */ 131 } 132 return (0); 133 } 134 135 /* 136 * Pass I/O requests to the memory filesystem process. 137 */ 138 int 139 mfs_strategy(v) 140 void *v; 141 { 142 struct vop_strategy_args /* { 143 struct buf *a_bp; 144 } */ *ap = v; 145 struct buf *bp = ap->a_bp; 146 struct mfsnode *mfsp; 147 struct vnode *vp; 148 struct proc *p = curproc->l_proc; /* XXX */ 149 150 if (!vfinddev(bp->b_dev, VBLK, &vp) || vp->v_usecount == 0) 151 panic("mfs_strategy: bad dev"); 152 mfsp = VTOMFS(vp); 153 /* check for mini-root access */ 154 if (mfsp->mfs_proc == NULL) { 155 caddr_t base; 156 157 base = mfsp->mfs_baseoff + (bp->b_blkno << DEV_BSHIFT); 158 if (bp->b_flags & B_READ) 159 memcpy(bp->b_data, base, bp->b_bcount); 160 else 161 memcpy(base, bp->b_data, bp->b_bcount); 162 bp->b_resid = 0; 163 biodone(bp); 164 } else if (mfsp->mfs_proc == p) { 165 mfs_doio(bp, mfsp->mfs_baseoff); 166 } else if (doing_shutdown) { 167 /* 168 * bitbucket I/O during shutdown. 169 * Note that reads should *not* happen here, but.. 170 */ 171 if (bp->b_flags & B_READ) 172 printf("warning: mfs read during shutdown\n"); 173 bp->b_resid = 0; 174 biodone(bp); 175 } else { 176 BUFQ_INSERT_TAIL(&mfsp->mfs_buflist, bp); 177 wakeup((caddr_t)vp); 178 } 179 return (0); 180 } 181 182 /* 183 * Memory file system I/O. 184 * 185 * Trivial on the HP since buffer has already been mapping into KVA space. 186 */ 187 void 188 mfs_doio(bp, base) 189 struct buf *bp; 190 caddr_t base; 191 { 192 base += (bp->b_blkno << DEV_BSHIFT); 193 if (bp->b_flags & B_READ) 194 bp->b_error = copyin(base, bp->b_data, bp->b_bcount); 195 else 196 bp->b_error = copyout(bp->b_data, base, bp->b_bcount); 197 if (bp->b_error) 198 bp->b_flags |= B_ERROR; 199 else 200 bp->b_resid = 0; 201 biodone(bp); 202 } 203 204 /* 205 * This is a noop, simply returning what one has been given. 206 */ 207 int 208 mfs_bmap(v) 209 void *v; 210 { 211 struct vop_bmap_args /* { 212 struct vnode *a_vp; 213 daddr_t a_bn; 214 struct vnode **a_vpp; 215 daddr_t *a_bnp; 216 int *a_runp; 217 } */ *ap = v; 218 219 if (ap->a_vpp != NULL) 220 *ap->a_vpp = ap->a_vp; 221 if (ap->a_bnp != NULL) 222 *ap->a_bnp = ap->a_bn; 223 if (ap->a_runp != NULL) 224 *ap->a_runp = 0; 225 return (0); 226 } 227 228 /* 229 * Memory filesystem close routine 230 */ 231 /* ARGSUSED */ 232 int 233 mfs_close(v) 234 void *v; 235 { 236 struct vop_close_args /* { 237 struct vnode *a_vp; 238 int a_fflag; 239 struct ucred *a_cred; 240 struct proc *a_p; 241 } */ *ap = v; 242 struct vnode *vp = ap->a_vp; 243 struct mfsnode *mfsp = VTOMFS(vp); 244 struct buf *bp; 245 int error; 246 247 /* 248 * Finish any pending I/O requests. 249 */ 250 while ((bp = BUFQ_FIRST(&mfsp->mfs_buflist)) != NULL) { 251 BUFQ_REMOVE(&mfsp->mfs_buflist, bp); 252 mfs_doio(bp, mfsp->mfs_baseoff); 253 wakeup((caddr_t)bp); 254 } 255 /* 256 * On last close of a memory filesystem 257 * we must invalidate any in core blocks, so that 258 * we can, free up its vnode. 259 */ 260 if ((error = vinvalbuf(vp, 1, ap->a_cred, ap->a_p, 0, 0)) != 0) 261 return (error); 262 /* 263 * There should be no way to have any more uses of this 264 * vnode, so if we find any other uses, it is a panic. 265 */ 266 if (vp->v_usecount > 1) 267 printf("mfs_close: ref count %d > 1\n", vp->v_usecount); 268 if (vp->v_usecount > 1 || BUFQ_FIRST(&mfsp->mfs_buflist) != NULL) 269 panic("mfs_close"); 270 /* 271 * Send a request to the filesystem server to exit. 272 */ 273 BUFQ_FIRST(&mfsp->mfs_buflist) = (struct buf *) -1; 274 wakeup((caddr_t)vp); 275 return (0); 276 } 277 278 /* 279 * Memory filesystem inactive routine 280 */ 281 /* ARGSUSED */ 282 int 283 mfs_inactive(v) 284 void *v; 285 { 286 struct vop_inactive_args /* { 287 struct vnode *a_vp; 288 struct proc *a_p; 289 } */ *ap = v; 290 struct vnode *vp = ap->a_vp; 291 struct mfsnode *mfsp = VTOMFS(vp); 292 293 if (BUFQ_FIRST(&mfsp->mfs_buflist) != NULL && 294 BUFQ_FIRST(&mfsp->mfs_buflist) != (struct buf *) -1) 295 panic("mfs_inactive: not inactive (mfs_buflist %p)", 296 BUFQ_FIRST(&mfsp->mfs_buflist)); 297 VOP_UNLOCK(vp, 0); 298 return (0); 299 } 300 301 /* 302 * Reclaim a memory filesystem devvp so that it can be reused. 303 */ 304 int 305 mfs_reclaim(v) 306 void *v; 307 { 308 struct vop_reclaim_args /* { 309 struct vnode *a_vp; 310 } */ *ap = v; 311 struct vnode *vp = ap->a_vp; 312 313 FREE(vp->v_data, M_MFSNODE); 314 vp->v_data = NULL; 315 return (0); 316 } 317 318 /* 319 * Print out the contents of an mfsnode. 320 */ 321 int 322 mfs_print(v) 323 void *v; 324 { 325 struct vop_print_args /* { 326 struct vnode *a_vp; 327 } */ *ap = v; 328 struct mfsnode *mfsp = VTOMFS(ap->a_vp); 329 330 printf("tag VT_MFS, pid %d, base %p, size %ld\n", 331 (mfsp->mfs_proc != NULL) ? mfsp->mfs_proc->p_pid : 0, 332 mfsp->mfs_baseoff, mfsp->mfs_size); 333 return (0); 334 } 335
Indexes created Tue Oct 21 07:10:13 GMT 2025