lfs_alloc.c revision 1.27
1 /* $NetBSD: lfs_alloc.c,v 1.27 1999/11/09 02:21:05 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 * Prevent a race getting lfs_free. We use 126 * the ufs_hashlock here because we need that anyway for 127 * the hash insertion later. 128 */ 129 lockmgr(&ufs_hashlock, LK_EXCLUSIVE, 0); 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 #ifdef LFS_DEBUG_NEXTFREE 154 ifp->if_nextfree = 0; 155 #endif 156 /* 157 * If a vflush is called before the dirop that created us is written, 158 * and then the system crashes, we could be in limbo (allocated but 159 * not connected), and stay that way forever. To detect this 160 * condition easily, we set if_daddr=UNASSIGNED, and walk the free 161 * list at fs mount time (or roll-forward time). Any inodes with 162 * if_daddr==UNASSIGNED have never been written to disk, and will 163 * be silently restored to the free list. 164 */ 165 ifp->if_daddr = UNASSIGNED; 166 VOP_BWRITE(bp); 167 168 /* Extend IFILE so that the next lfs_valloc will succeed. */ 169 if (fs->lfs_free == LFS_UNUSED_INUM) { 170 vp = fs->lfs_ivnode; 171 VOP_LOCK(vp,LK_EXCLUSIVE); 172 ip = VTOI(vp); 173 blkno = lblkno(fs, ip->i_ffs_size); 174 lfs_balloc(vp, 0, fs->lfs_bsize, blkno, &bp); 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 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 197 return (error); 198 } 199 } 200 201 #ifdef DIAGNOSTIC 202 if(fs->lfs_free == LFS_UNUSED_INUM) 203 panic("inode 0 allocated [3]"); 204 #endif /* DIAGNOSTIC */ 205 206 /* Create a vnode to associate with the inode. */ 207 if ((error = lfs_vcreate(ap->a_pvp->v_mount, new_ino, &vp)) != 0) { 208 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 209 return (error); 210 } 211 212 ip = VTOI(vp); 213 /* Zero out the direct and indirect block addresses. */ 214 bzero(&ip->i_din, sizeof(ip->i_din)); 215 ip->i_din.ffs_din.di_inumber = new_ino; 216 217 /* Set a new generation number for this inode. */ 218 ip->i_ffs_gen++; 219 220 /* Insert into the inode hash table. */ 221 ufs_ihashins(ip); 222 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 223 224 error = ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, &vp); 225 if (error) { 226 vput(vp); 227 *ap->a_vpp = NULL; 228 return (error); 229 } 230 231 *ap->a_vpp = vp; 232 if(!(vp->v_flag & VDIROP)) { 233 lfs_vref(vp); 234 ++lfs_dirvcount; 235 } 236 vp->v_flag |= VDIROP; 237 VREF(ip->i_devvp); 238 239 /* Set superblock modified bit and increment file count. */ 240 fs->lfs_fmod = 1; 241 ++fs->lfs_nfiles; 242 return (0); 243 } 244 245 /* Create a new vnode/inode pair and initialize what fields we can. */ 246 int 247 lfs_vcreate(mp, ino, vpp) 248 struct mount *mp; 249 ino_t ino; 250 struct vnode **vpp; 251 { 252 extern int (**lfs_vnodeop_p) __P((void *)); 253 struct inode *ip; 254 struct ufsmount *ump; 255 int error; 256 #ifdef QUOTA 257 int i; 258 #endif 259 260 /* Create the vnode. */ 261 if ((error = getnewvnode(VT_LFS, mp, lfs_vnodeop_p, vpp)) != 0) { 262 *vpp = NULL; 263 return (error); 264 } 265 266 /* Get a pointer to the private mount structure. */ 267 ump = VFSTOUFS(mp); 268 269 /* Initialize the inode. */ 270 ip = pool_get(&lfs_inode_pool, PR_WAITOK); 271 (*vpp)->v_data = ip; 272 ip->i_vnode = *vpp; 273 ip->i_devvp = ump->um_devvp; 274 ip->i_flag = IN_MODIFIED; 275 ip->i_dev = ump->um_dev; 276 ip->i_number = ip->i_din.ffs_din.di_inumber = ino; 277 ip->i_lfs = ump->um_lfs; 278 #ifdef QUOTA 279 for (i = 0; i < MAXQUOTAS; i++) 280 ip->i_dquot[i] = NODQUOT; 281 #endif 282 ip->i_lockf = 0; 283 ip->i_diroff = 0; 284 ip->i_ffs_mode = 0; 285 ip->i_ffs_size = 0; 286 ip->i_ffs_blocks = 0; 287 ++ump->um_lfs->lfs_uinodes; 288 return (0); 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 lfs *fs; 307 ufs_daddr_t old_iaddr; 308 ino_t ino; 309 int already_locked; 310 311 /* Get the inode number and file system. */ 312 ip = VTOI(ap->a_pvp); 313 fs = ip->i_lfs; 314 ino = ip->i_number; 315 316 /* If we already hold ufs_hashlock, don't panic, just do it anyway */ 317 already_locked = lockstatus(&ufs_hashlock) && ufs_hashlock.lk_lockholder == curproc->p_pid; 318 while(WRITEINPROG(ap->a_pvp) 319 || fs->lfs_seglock 320 || (!already_locked && lockmgr(&ufs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0))) 321 { 322 if (WRITEINPROG(ap->a_pvp)) { 323 tsleep(ap->a_pvp, (PRIBIO+1), "lfs_vfree", 0); 324 } 325 if (fs->lfs_seglock) { 326 if (fs->lfs_lockpid == curproc->p_pid) { 327 break; 328 } else { 329 tsleep(&fs->lfs_seglock, PRIBIO + 1, "lfs_vfr1", 0); 330 } 331 } 332 } 333 334 if (ip->i_flag & IN_CLEANING) { 335 --fs->lfs_uinodes; 336 } 337 if (ip->i_flag & IN_MODIFIED) { 338 --fs->lfs_uinodes; 339 } 340 ip->i_flag &= ~(IN_CLEANING | IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE); 341 #ifdef DEBUG_LFS 342 if((int32_t)fs->lfs_uinodes<0) { 343 printf("U1"); 344 fs->lfs_uinodes=0; 345 } 346 #endif 347 /* 348 * Set the ifile's inode entry to unused, increment its version number 349 * and link it into the free chain. 350 */ 351 LFS_IENTRY(ifp, fs, ino, bp); 352 old_iaddr = ifp->if_daddr; 353 ifp->if_daddr = LFS_UNUSED_DADDR; 354 ++ifp->if_version; 355 ifp->if_nextfree = fs->lfs_free; 356 fs->lfs_free = ino; 357 (void) VOP_BWRITE(bp); 358 #ifdef DIAGNOSTIC 359 if(fs->lfs_free == LFS_UNUSED_INUM) { 360 panic("inode 0 freed"); 361 } 362 #endif /* DIAGNOSTIC */ 363 if (old_iaddr != LFS_UNUSED_DADDR) { 364 LFS_SEGENTRY(sup, fs, datosn(fs, old_iaddr), bp); 365 #ifdef DIAGNOSTIC 366 if (sup->su_nbytes < DINODE_SIZE) { 367 printf("lfs_vfree: negative byte count (segment %d short by %d)\n", datosn(fs, old_iaddr), (int)DINODE_SIZE - sup->su_nbytes); 368 panic("lfs_vfree: negative byte count"); 369 sup->su_nbytes = DINODE_SIZE; 370 } 371 #endif 372 sup->su_nbytes -= DINODE_SIZE; 373 (void) VOP_BWRITE(bp); 374 } 375 if(!already_locked) 376 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 377 378 /* Set superblock modified bit and decrement file count. */ 379 fs->lfs_fmod = 1; 380 --fs->lfs_nfiles; 381 382 return (0); 383 } 384
Indexes created Wed Sep 24 15:09:51 GMT 2025