lfs_alloc.c revision 1.35
1 /* $NetBSD: lfs_alloc.c,v 1.35 2000/06/22 18:11:45 perseant 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 extern int lfs_dirvcount; 121 122 fs = VTOI(ap->a_pvp)->i_lfs; 123 124 /* 125 * Use lfs_seglock here, instead of fs->lfs_freelock, to ensure that 126 * the free list is not changed in between the time that the ifile 127 * blocks are written to disk and the time that the superblock is 128 * written to disk. 129 * 130 * XXX this sucks. We should instead encode the head of the free 131 * list into the CLEANERINFO block of the Ifile. 132 */ 133 lfs_seglock(fs, SEGM_PROT); 134 135 /* Get the head of the freelist. */ 136 new_ino = fs->lfs_free; 137 #ifdef DIAGNOSTIC 138 if(new_ino == LFS_UNUSED_INUM) { 139 #ifdef DEBUG 140 lfs_dump_super(fs); 141 #endif /* DEBUG */ 142 panic("inode 0 allocated [1]"); 143 } 144 #endif /* DIAGNOSTIC */ 145 #ifdef ALLOCPRINT 146 printf("lfs_ialloc: allocate inode %d\n", new_ino); 147 #endif 148 149 /* 150 * Remove the inode from the free list and write the new start 151 * of the free list into the superblock. 152 */ 153 LFS_IENTRY(ifp, fs, new_ino, bp); 154 if (ifp->if_daddr != LFS_UNUSED_DADDR) 155 panic("lfs_ialloc: inuse inode %d on the free list", new_ino); 156 fs->lfs_free = ifp->if_nextfree; 157 #ifdef LFS_DEBUG_NEXTFREE 158 ifp->if_nextfree = 0; 159 VOP_BWRITE(bp); 160 #else 161 brelse(bp); 162 #endif 163 164 /* Extend IFILE so that the next lfs_valloc will succeed. */ 165 if (fs->lfs_free == LFS_UNUSED_INUM) { 166 vp = fs->lfs_ivnode; 167 VOP_LOCK(vp,LK_EXCLUSIVE); 168 ip = VTOI(vp); 169 blkno = lblkno(fs, ip->i_ffs_size); 170 if ((error = VOP_BALLOC(vp, ip->i_ffs_size, fs->lfs_bsize, 171 NULL, 0, &bp)) != 0) { 172 lfs_segunlock(fs); 173 return (error); 174 } 175 ip->i_ffs_size += fs->lfs_bsize; 176 uvm_vnp_setsize(vp, ip->i_ffs_size); 177 (void)uvm_vnp_uncache(vp); 178 179 i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) * 180 fs->lfs_ifpb; 181 fs->lfs_free = i; 182 #ifdef DIAGNOSTIC 183 if(fs->lfs_free == LFS_UNUSED_INUM) 184 panic("inode 0 allocated [2]"); 185 #endif /* DIAGNOSTIC */ 186 max = i + fs->lfs_ifpb; 187 for (ifp = (struct ifile *)bp->b_data; i < max; ++ifp) { 188 ifp->if_version = 1; 189 ifp->if_daddr = LFS_UNUSED_DADDR; 190 ifp->if_nextfree = ++i; 191 } 192 ifp--; 193 ifp->if_nextfree = LFS_UNUSED_INUM; 194 VOP_UNLOCK(vp,0); 195 if ((error = VOP_BWRITE(bp)) != 0) { 196 lfs_segunlock(fs); 197 return (error); 198 } 199 } 200 #ifdef DIAGNOSTIC 201 if(fs->lfs_free == LFS_UNUSED_INUM) 202 panic("inode 0 allocated [3]"); 203 #endif /* DIAGNOSTIC */ 204 205 lfs_segunlock(fs); 206 207 lockmgr(&ufs_hashlock, LK_EXCLUSIVE, 0); 208 /* Create a vnode to associate with the inode. */ 209 if ((error = lfs_vcreate(ap->a_pvp->v_mount, new_ino, &vp)) != 0) { 210 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 211 return (error); 212 } 213 214 ip = VTOI(vp); 215 /* Zero out the direct and indirect block addresses. */ 216 bzero(&ip->i_din, sizeof(ip->i_din)); 217 ip->i_din.ffs_din.di_inumber = new_ino; 218 219 /* Set a new generation number for this inode. */ 220 ip->i_ffs_gen++; 221 222 /* Insert into the inode hash table. */ 223 ufs_ihashins(ip); 224 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 225 226 error = ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, &vp); 227 if (error) { 228 vput(vp); 229 *ap->a_vpp = NULL; 230 return (error); 231 } 232 233 *ap->a_vpp = vp; 234 if(!(vp->v_flag & VDIROP)) { 235 (void)lfs_vref(vp); 236 ++lfs_dirvcount; 237 } 238 vp->v_flag |= VDIROP; 239 VREF(ip->i_devvp); 240 241 if(!(ip->i_flag & IN_ADIROP)) 242 ++fs->lfs_nadirop; 243 ip->i_flag |= IN_ADIROP; 244 245 /* Set superblock modified bit and increment file count. */ 246 fs->lfs_fmod = 1; 247 ++fs->lfs_nfiles; 248 return (0); 249 } 250 251 /* Create a new vnode/inode pair and initialize what fields we can. */ 252 int 253 lfs_vcreate(mp, ino, vpp) 254 struct mount *mp; 255 ino_t ino; 256 struct vnode **vpp; 257 { 258 extern int (**lfs_vnodeop_p) __P((void *)); 259 struct inode *ip; 260 struct ufsmount *ump; 261 int error; 262 #ifdef QUOTA 263 int i; 264 #endif 265 266 /* Create the vnode. */ 267 if ((error = getnewvnode(VT_LFS, mp, lfs_vnodeop_p, vpp)) != 0) { 268 *vpp = NULL; 269 return (error); 270 } 271 272 /* Get a pointer to the private mount structure. */ 273 ump = VFSTOUFS(mp); 274 275 /* Initialize the inode. */ 276 ip = pool_get(&lfs_inode_pool, PR_WAITOK); 277 (*vpp)->v_data = ip; 278 ip->i_vnode = *vpp; 279 ip->i_devvp = ump->um_devvp; 280 ip->i_flag = IN_MODIFIED; 281 ip->i_dev = ump->um_dev; 282 ip->i_number = ip->i_din.ffs_din.di_inumber = ino; 283 ip->i_lfs = ump->um_lfs; 284 #ifdef QUOTA 285 for (i = 0; i < MAXQUOTAS; i++) 286 ip->i_dquot[i] = NODQUOT; 287 #endif 288 ip->i_lockf = 0; 289 ip->i_diroff = 0; 290 ip->i_ffs_mode = 0; 291 ip->i_ffs_size = 0; 292 ip->i_ffs_blocks = 0; 293 ++ump->um_lfs->lfs_uinodes; 294 return (0); 295 } 296 297 /* Free an inode. */ 298 /* ARGUSED */ 299 int 300 lfs_vfree(v) 301 void *v; 302 { 303 struct vop_vfree_args /* { 304 struct vnode *a_pvp; 305 ino_t a_ino; 306 int a_mode; 307 } */ *ap = v; 308 SEGUSE *sup; 309 struct buf *bp; 310 struct ifile *ifp; 311 struct inode *ip; 312 struct vnode *vp; 313 struct lfs *fs; 314 ufs_daddr_t old_iaddr; 315 ino_t ino; 316 extern int lfs_dirvcount; 317 318 /* Get the inode number and file system. */ 319 vp = ap->a_pvp; 320 ip = VTOI(vp); 321 fs = ip->i_lfs; 322 ino = ip->i_number; 323 324 #if 0 325 /* 326 * Right now this is unnecessary since we take the seglock. 327 * But if the seglock is no longer necessary (e.g. we put the 328 * head of the free list into the Ifile) we will need to drain 329 * this vnode of any pending writes. 330 */ 331 if (WRITEINPROG(vp)) 332 tsleep(vp, (PRIBIO+1), "lfs_vfree", 0); 333 #endif 334 lfs_seglock(fs, SEGM_PROT); 335 336 if(vp->v_flag & VDIROP) { 337 --lfs_dirvcount; 338 vp->v_flag &= ~VDIROP; 339 wakeup(&lfs_dirvcount); 340 lfs_vunref(vp); 341 } 342 343 if (ip->i_flag & IN_CLEANING) { 344 --fs->lfs_uinodes; 345 } 346 if (ip->i_flag & (IN_MODIFIED | IN_ACCESSED)) { 347 --fs->lfs_uinodes; 348 } 349 ip->i_flag &= ~IN_ALLMOD; 350 #ifdef DEBUG_LFS 351 if((int32_t)fs->lfs_uinodes<0) { 352 printf("U1"); 353 fs->lfs_uinodes=0; 354 } 355 #endif 356 /* 357 * Set the ifile's inode entry to unused, increment its version number 358 * and link it into the free chain. 359 */ 360 LFS_IENTRY(ifp, fs, ino, bp); 361 old_iaddr = ifp->if_daddr; 362 ifp->if_daddr = LFS_UNUSED_DADDR; 363 ++ifp->if_version; 364 ifp->if_nextfree = fs->lfs_free; 365 fs->lfs_free = ino; 366 (void) VOP_BWRITE(bp); 367 #ifdef DIAGNOSTIC 368 if(fs->lfs_free == LFS_UNUSED_INUM) { 369 panic("inode 0 freed"); 370 } 371 #endif /* DIAGNOSTIC */ 372 if (old_iaddr != LFS_UNUSED_DADDR) { 373 LFS_SEGENTRY(sup, fs, datosn(fs, old_iaddr), bp); 374 #ifdef DIAGNOSTIC 375 if (sup->su_nbytes < DINODE_SIZE) { 376 printf("lfs_vfree: negative byte count (segment %d short by %d)\n", datosn(fs, old_iaddr), (int)DINODE_SIZE - sup->su_nbytes); 377 panic("lfs_vfree: negative byte count"); 378 sup->su_nbytes = DINODE_SIZE; 379 } 380 #endif 381 sup->su_nbytes -= DINODE_SIZE; 382 (void) VOP_BWRITE(bp); 383 } 384 385 /* Set superblock modified bit and decrement file count. */ 386 fs->lfs_fmod = 1; 387 --fs->lfs_nfiles; 388 389 lfs_segunlock(fs); 390 return (0); 391 } 392
Indexes created Thu Sep 25 16:09:42 GMT 2025