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