Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 | /* * Copyright (c) 2000-2003 Silicon Graphics, Inc. All Rights Reserved. * * This program is free software; you can redistribute it and/or modify it * under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * This program is distributed in the hope that it would be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * * Further, this software is distributed without any warranty that it is * free of the rightful claim of any third person regarding infringement * or the like. Any license provided herein, whether implied or * otherwise, applies only to this software file. Patent licenses, if * any, provided herein do not apply to combinations of this program with * other software, or any other product whatsoever. * * You should have received a copy of the GNU General Public License along * with this program; if not, write the Free Software Foundation, Inc., 59 * Temple Place - Suite 330, Boston MA 02111-1307, USA. * * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, * Mountain View, CA 94043, or: * * http://www.sgi.com * * For further information regarding this notice, see: * * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/ */ #include "xfs.h" #include "xfs_fs.h" #include "xfs_macros.h" #include "xfs_inum.h" #include "xfs_log.h" #include "xfs_clnt.h" #include "xfs_trans.h" #include "xfs_sb.h" #include "xfs_ag.h" #include "xfs_dir.h" #include "xfs_dir2.h" #include "xfs_imap.h" #include "xfs_alloc.h" #include "xfs_dmapi.h" #include "xfs_mount.h" #include "xfs_quota.h" int vfs_mount( struct bhv_desc *bdp, struct xfs_mount_args *args, struct cred *cr) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_mount) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_mount)(next, args, cr)); } int vfs_parseargs( struct bhv_desc *bdp, char *s, struct xfs_mount_args *args, int f) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_parseargs) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_parseargs)(next, s, args, f)); } int vfs_showargs( struct bhv_desc *bdp, struct seq_file *m) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_showargs) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_showargs)(next, m)); } int vfs_unmount( struct bhv_desc *bdp, int fl, struct cred *cr) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_unmount) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_unmount)(next, fl, cr)); } int vfs_mntupdate( struct bhv_desc *bdp, int *fl, struct xfs_mount_args *args) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_mntupdate) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_mntupdate)(next, fl, args)); } int vfs_root( struct bhv_desc *bdp, struct vnode **vpp) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_root) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_root)(next, vpp)); } int vfs_statvfs( struct bhv_desc *bdp, xfs_statfs_t *sp, struct vnode *vp) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_statvfs) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_statvfs)(next, sp, vp)); } int vfs_sync( struct bhv_desc *bdp, int fl, struct cred *cr) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_sync) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_sync)(next, fl, cr)); } int vfs_vget( struct bhv_desc *bdp, struct vnode **vpp, struct fid *fidp) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_vget) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_vget)(next, vpp, fidp)); } int vfs_dmapiops( struct bhv_desc *bdp, caddr_t addr) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_dmapiops) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_dmapiops)(next, addr)); } int vfs_quotactl( struct bhv_desc *bdp, int cmd, int id, caddr_t addr) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_quotactl) next = BHV_NEXT(next); return ((*bhvtovfsops(next)->vfs_quotactl)(next, cmd, id, addr)); } void vfs_init_vnode( struct bhv_desc *bdp, struct vnode *vp, struct bhv_desc *bp, int unlock) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_init_vnode) next = BHV_NEXT(next); ((*bhvtovfsops(next)->vfs_init_vnode)(next, vp, bp, unlock)); } void vfs_force_shutdown( struct bhv_desc *bdp, int fl, char *file, int line) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_force_shutdown) next = BHV_NEXT(next); ((*bhvtovfsops(next)->vfs_force_shutdown)(next, fl, file, line)); } void vfs_freeze( struct bhv_desc *bdp) { struct bhv_desc *next = bdp; ASSERT(next); while (! (bhvtovfsops(next))->vfs_freeze) next = BHV_NEXT(next); ((*bhvtovfsops(next)->vfs_freeze)(next)); } vfs_t * vfs_allocate( void ) { struct vfs *vfsp; vfsp = kmem_zalloc(sizeof(vfs_t), KM_SLEEP); bhv_head_init(VFS_BHVHEAD(vfsp), "vfs"); INIT_LIST_HEAD(&vfsp->vfs_sync_list); spin_lock_init(&vfsp->vfs_sync_lock); init_waitqueue_head(&vfsp->vfs_wait_sync_task); init_waitqueue_head(&vfsp->vfs_wait_single_sync_task); return vfsp; } void vfs_deallocate( struct vfs *vfsp) { bhv_head_destroy(VFS_BHVHEAD(vfsp)); kmem_free(vfsp, sizeof(vfs_t)); } void vfs_insertops( struct vfs *vfsp, struct bhv_vfsops *vfsops) { struct bhv_desc *bdp; bdp = kmem_alloc(sizeof(struct bhv_desc), KM_SLEEP); bhv_desc_init(bdp, NULL, vfsp, vfsops); bhv_insert(&vfsp->vfs_bh, bdp); } void vfs_insertbhv( struct vfs *vfsp, struct bhv_desc *bdp, struct vfsops *vfsops, void *mount) { bhv_desc_init(bdp, mount, vfsp, vfsops); bhv_insert_initial(&vfsp->vfs_bh, bdp); } void bhv_remove_vfsops( struct vfs *vfsp, int pos) { struct bhv_desc *bhv; bhv = bhv_lookup_range(&vfsp->vfs_bh, pos, pos); if (!bhv) return; bhv_remove(&vfsp->vfs_bh, bhv); kmem_free(bhv, sizeof(*bhv)); } void bhv_remove_all_vfsops( struct vfs *vfsp, int freebase) { struct xfs_mount *mp; bhv_remove_vfsops(vfsp, VFS_POSITION_QM); bhv_remove_vfsops(vfsp, VFS_POSITION_DM); if (!freebase) return; mp = XFS_BHVTOM(bhv_lookup(VFS_BHVHEAD(vfsp), &xfs_vfsops)); VFS_REMOVEBHV(vfsp, &mp->m_bhv); xfs_mount_free(mp, 0); } void bhv_insert_all_vfsops( struct vfs *vfsp) { struct xfs_mount *mp; mp = xfs_mount_init(); vfs_insertbhv(vfsp, &mp->m_bhv, &xfs_vfsops, mp); vfs_insertdmapi(vfsp); vfs_insertquota(vfsp); } |