lfs_alloc.c revision 1.18.2.2.2.3
1 /* $NetBSD: lfs_alloc.c,v 1.18.2.2.2.3 1999/08/02 22:57:34 thorpej Exp $ */ 2 3 /*- 4 * Copyright (c) 1999 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Konrad E. Schroder <perseant (at) hhhh.org>. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 /* 39 * Copyright (c) 1991, 1993 40 * The Regents of the University of California. All rights reserved. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. All advertising materials mentioning features or use of this software 51 * must display the following acknowledgement: 52 * This product includes software developed by the University of 53 * California, Berkeley and its contributors. 54 * 4. Neither the name of the University nor the names of its contributors 55 * may be used to endorse or promote products derived from this software 56 * without specific prior written permission. 57 * 58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 68 * SUCH DAMAGE. 69 * 70 * @(#)lfs_alloc.c 8.4 (Berkeley) 1/4/94 71 */ 72 73 #if defined(_KERNEL) && !defined(_LKM) 74 #include "opt_quota.h" 75 #endif 76 77 #include <sys/param.h> 78 #include <sys/systm.h> 79 #include <sys/kernel.h> 80 #include <sys/buf.h> 81 #include <sys/vnode.h> 82 #include <sys/syslog.h> 83 #include <sys/mount.h> 84 #include <sys/malloc.h> 85 #include <sys/pool.h> 86 87 #include <vm/vm.h> 88 89 #include <ufs/ufs/quota.h> 90 #include <ufs/ufs/inode.h> 91 #include <ufs/ufs/ufsmount.h> 92 #include <ufs/ufs/ufs_extern.h> 93 94 #include <ufs/lfs/lfs.h> 95 #include <ufs/lfs/lfs_extern.h> 96 97 extern struct lock ufs_hashlock; 98 99 /* Allocate a new inode. */ 100 /* ARGSUSED */ 101 int 102 lfs_valloc(v) 103 void *v; 104 { 105 struct vop_valloc_args /* { 106 struct vnode *a_pvp; 107 int a_mode; 108 struct ucred *a_cred; 109 struct vnode **a_vpp; 110 } */ *ap = v; 111 struct lfs *fs; 112 struct buf *bp; 113 struct ifile *ifp; 114 struct inode *ip; 115 struct vnode *vp; 116 ufs_daddr_t blkno; 117 ino_t new_ino; 118 u_long i, max; 119 int error; 120 121 fs = VTOI(ap->a_pvp)->i_lfs; 122 123 /* 124 * Prevent a race getting lfs_free - XXX - KS 125 * (this should be a proper lock, in struct lfs) 126 */ 127 128 while(lockmgr(&ufs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0)) 129 ; 130 131 /* Get the head of the freelist. */ 132 new_ino = fs->lfs_free; 133 #ifdef DIAGNOSTIC 134 if(new_ino == LFS_UNUSED_INUM) { 135 #ifdef DEBUG 136 lfs_dump_super(fs); 137 #endif /* DEBUG */ 138 panic("inode 0 allocated [1]"); 139 } 140 #endif /* DIAGNOSTIC */ 141 #ifdef ALLOCPRINT 142 printf("lfs_ialloc: allocate inode %d\n", new_ino); 143 #endif 144 145 /* 146 * Remove the inode from the free list and write the new start 147 * of the free list into the superblock. 148 */ 149 LFS_IENTRY(ifp, fs, new_ino, bp); 150 if (ifp->if_daddr != LFS_UNUSED_DADDR) 151 panic("lfs_ialloc: inuse inode %d on the free list", new_ino); 152 fs->lfs_free = ifp->if_nextfree; 153 brelse(bp); 154 155 /* Extend IFILE so that the next lfs_valloc will succeed. */ 156 if (fs->lfs_free == LFS_UNUSED_INUM) { 157 vp = fs->lfs_ivnode; 158 VOP_LOCK(vp,LK_EXCLUSIVE); 159 ip = VTOI(vp); 160 blkno = lblkno(fs, ip->i_ffs_size); 161 lfs_balloc(vp, 0, fs->lfs_bsize, blkno, &bp); 162 ip->i_ffs_size += fs->lfs_bsize; 163 uvm_vnp_setsize(vp, ip->i_ffs_size); 164 165 i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) * 166 fs->lfs_ifpb; 167 fs->lfs_free = i; 168 #ifdef DIAGNOSTIC 169 if(fs->lfs_free == LFS_UNUSED_INUM) 170 panic("inode 0 allocated [2]"); 171 #endif /* DIAGNOSTIC */ 172 max = i + fs->lfs_ifpb; 173 for (ifp = (struct ifile *)bp->b_data; i < max; ++ifp) { 174 ifp->if_version = 1; 175 ifp->if_daddr = LFS_UNUSED_DADDR; 176 ifp->if_nextfree = ++i; 177 } 178 ifp--; 179 ifp->if_nextfree = LFS_UNUSED_INUM; 180 VOP_UNLOCK(vp,0); 181 if ((error = VOP_BWRITE(bp)) != 0) { 182 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 183 return (error); 184 } 185 } 186 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 187 188 #ifdef DIAGNOSTIC 189 if(fs->lfs_free == LFS_UNUSED_INUM) 190 panic("inode 0 allocated [3]"); 191 #endif /* DIAGNOSTIC */ 192 193 /* Create a vnode to associate with the inode. */ 194 if ((error = lfs_vcreate(ap->a_pvp->v_mount, new_ino, &vp)) != 0) 195 return (error); 196 197 ip = VTOI(vp); 198 /* Zero out the direct and indirect block addresses. */ 199 bzero(&ip->i_din, sizeof(ip->i_din)); 200 ip->i_din.ffs_din.di_inumber = new_ino; 201 202 /* Set a new generation number for this inode. */ 203 ip->i_ffs_gen++; 204 205 /* Insert into the inode hash table. */ 206 ufs_ihashins(ip); 207 208 error = ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, &vp); 209 if (error) { 210 vput(vp); 211 *ap->a_vpp = NULL; 212 return (error); 213 } 214 215 *ap->a_vpp = vp; 216 if(!(vp->v_flag & VDIROP)) { 217 lfs_vref(vp); 218 ++fs->lfs_dirvcount; 219 } 220 vp->v_flag |= VDIROP; 221 VREF(ip->i_devvp); 222 223 /* Set superblock modified bit and increment file count. */ 224 fs->lfs_fmod = 1; 225 ++fs->lfs_nfiles; 226 return (0); 227 } 228 229 /* Create a new vnode/inode pair and initialize what fields we can. */ 230 int 231 lfs_vcreate(mp, ino, vpp) 232 struct mount *mp; 233 ino_t ino; 234 struct vnode **vpp; 235 { 236 extern int (**lfs_vnodeop_p) __P((void *)); 237 struct inode *ip; 238 struct ufsmount *ump; 239 int error; 240 #ifdef QUOTA 241 int i; 242 #endif 243 244 /* Create the vnode. */ 245 if ((error = getnewvnode(VT_LFS, mp, lfs_vnodeop_p, vpp)) != 0) { 246 *vpp = NULL; 247 return (error); 248 } 249 250 /* Get a pointer to the private mount structure. */ 251 ump = VFSTOUFS(mp); 252 253 /* Initialize the inode. */ 254 ip = pool_get(&lfs_inode_pool, PR_WAITOK); 255 (*vpp)->v_data = ip; 256 ip->i_vnode = *vpp; 257 ip->i_devvp = ump->um_devvp; 258 ip->i_flag = IN_MODIFIED; 259 ip->i_dev = ump->um_dev; 260 ip->i_number = ip->i_din.ffs_din.di_inumber = ino; 261 ip->i_lfs = ump->um_lfs; 262 #ifdef QUOTA 263 for (i = 0; i < MAXQUOTAS; i++) 264 ip->i_dquot[i] = NODQUOT; 265 #endif 266 ip->i_lockf = 0; 267 ip->i_diroff = 0; 268 ip->i_ffs_mode = 0; 269 ip->i_ffs_size = 0; 270 ip->i_ffs_blocks = 0; 271 ++ump->um_lfs->lfs_uinodes; 272 return (0); 273 } 274 275 /* Free an inode. */ 276 /* ARGUSED */ 277 int 278 lfs_vfree(v) 279 void *v; 280 { 281 struct vop_vfree_args /* { 282 struct vnode *a_pvp; 283 ino_t a_ino; 284 int a_mode; 285 } */ *ap = v; 286 SEGUSE *sup; 287 struct buf *bp; 288 struct ifile *ifp; 289 struct inode *ip; 290 struct lfs *fs; 291 ufs_daddr_t old_iaddr; 292 ino_t ino; 293 int already_locked; 294 295 /* Get the inode number and file system. */ 296 ip = VTOI(ap->a_pvp); 297 fs = ip->i_lfs; 298 ino = ip->i_number; 299 300 /* If we already hold ufs_hashlock, don't panic, just do it anyway */ 301 already_locked = lockstatus(&ufs_hashlock) && ufs_hashlock.lk_lockholder == curproc->p_pid; 302 while(WRITEINPROG(ap->a_pvp) 303 || fs->lfs_seglock 304 || (!already_locked && lockmgr(&ufs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0))) 305 { 306 if (WRITEINPROG(ap->a_pvp)) { 307 tsleep(ap->a_pvp, (PRIBIO+1), "lfs_vfree", 0); 308 } 309 if (fs->lfs_seglock) { 310 if (fs->lfs_lockpid == curproc->p_pid) { 311 break; 312 } else { 313 tsleep(&fs->lfs_seglock, PRIBIO + 1, "lfs_vfr1", 0); 314 } 315 } 316 } 317 318 if (ip->i_flag & IN_CLEANING) { 319 --fs->lfs_uinodes; 320 ip->i_flag &= ~IN_CLEANING; 321 } 322 if (ip->i_flag & IN_MODIFIED) { 323 --fs->lfs_uinodes; 324 ip->i_flag &= 325 ~(IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE); 326 } 327 #ifdef DEBUG_LFS 328 if((int32_t)fs->lfs_uinodes<0) { 329 printf("U1"); 330 fs->lfs_uinodes=0; 331 } 332 #endif 333 /* 334 * Set the ifile's inode entry to unused, increment its version number 335 * and link it into the free chain. 336 */ 337 LFS_IENTRY(ifp, fs, ino, bp); 338 old_iaddr = ifp->if_daddr; 339 ifp->if_daddr = LFS_UNUSED_DADDR; 340 ++ifp->if_version; 341 ifp->if_nextfree = fs->lfs_free; 342 fs->lfs_free = ino; 343 (void) VOP_BWRITE(bp); 344 #ifdef DIAGNOSTIC 345 if(fs->lfs_free == LFS_UNUSED_INUM) { 346 panic("inode 0 freed"); 347 } 348 #endif /* DIAGNOSTIC */ 349 if (old_iaddr != LFS_UNUSED_DADDR) { 350 LFS_SEGENTRY(sup, fs, datosn(fs, old_iaddr), bp); 351 #ifdef DIAGNOSTIC 352 if (sup->su_nbytes < DINODE_SIZE) { 353 printf("lfs_vfree: negative byte count (segment %d short by %d)\n", datosn(fs, old_iaddr), (int)DINODE_SIZE - sup->su_nbytes); 354 panic("lfs_vfree: negative byte count"); 355 sup->su_nbytes = DINODE_SIZE; 356 } 357 #endif 358 sup->su_nbytes -= DINODE_SIZE; 359 (void) VOP_BWRITE(bp); 360 } 361 if(!already_locked) 362 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 363 364 /* Set superblock modified bit and decrement file count. */ 365 fs->lfs_fmod = 1; 366 --fs->lfs_nfiles; 367 368 return (0); 369 } 370
Indexes created Wed Oct 01 19:09:53 GMT 2025