lfs_alloc.c revision 1.76.2.11
1 /* $NetBSD: lfs_alloc.c,v 1.76.2.11 2006/05/20 22:43:42 riz Exp $ */ 2 3 /*- 4 * Copyright (c) 1999, 2000, 2001, 2002, 2003 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. Neither the name of the University nor the names of its contributors 51 * may be used to endorse or promote products derived from this software 52 * without specific prior written permission. 53 * 54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 64 * SUCH DAMAGE. 65 * 66 * @(#)lfs_alloc.c 8.4 (Berkeley) 1/4/94 67 */ 68 69 #include <sys/cdefs.h> 70 __KERNEL_RCSID(0, "$NetBSD: lfs_alloc.c,v 1.76.2.11 2006/05/20 22:43:42 riz Exp $"); 71 72 #if defined(_KERNEL_OPT) 73 #include "opt_quota.h" 74 #endif 75 76 #include <sys/param.h> 77 #include <sys/systm.h> 78 #include <sys/kernel.h> 79 #include <sys/buf.h> 80 #include <sys/lock.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 #include <sys/proc.h> 87 #include <sys/tree.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 static int extend_ifile(struct lfs *, struct ucred *); 100 static int lfs_ialloc(struct lfs *, struct vnode *, ino_t, int, 101 struct vnode **); 102 103 /* Constants for inode free bitmap */ 104 #define BMSHIFT 5 /* 2 ** 5 = 32 */ 105 #define BMMASK ((1 << BMSHIFT) - 1) 106 #define SET_BITMAP_FREE(F, I) do { \ 107 DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d set\n", (int)(I), \ 108 (int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \ 109 (F)->lfs_ino_bitmap[(I) >> BMSHIFT] |= (1 << ((I) & BMMASK)); \ 110 } while (0) 111 #define CLR_BITMAP_FREE(F, I) do { \ 112 DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d clr\n", (int)(I), \ 113 (int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \ 114 (F)->lfs_ino_bitmap[(I) >> BMSHIFT] &= ~(1 << ((I) & BMMASK)); \ 115 } while(0) 116 117 #define ISSET_BITMAP_FREE(F, I) \ 118 ((F)->lfs_ino_bitmap[(I) >> BMSHIFT] & (1 << ((I) & BMMASK))) 119 120 /* 121 * Allocate a particular inode with a particular version number, freeing 122 * any previous versions of this inode that may have gone before. 123 * Used by the roll-forward code. 124 * 125 * XXX this function does not have appropriate locking to be used on a live fs; 126 * XXX but something similar could probably be used for an "undelete" call. 127 * 128 * Called with the Ifile inode locked. 129 */ 130 int 131 lfs_rf_valloc(struct lfs *fs, ino_t ino, int vers, struct proc *p, 132 struct vnode **vpp) 133 { 134 IFILE *ifp; 135 struct buf *bp, *cbp; 136 struct vnode *vp; 137 struct inode *ip; 138 ino_t tino, oldnext; 139 int error; 140 CLEANERINFO *cip; 141 142 ASSERT_SEGLOCK(fs); /* XXX it doesn't, really */ 143 144 /* 145 * First, just try a vget. If the version number is the one we want, 146 * we don't have to do anything else. If the version number is wrong, 147 * take appropriate action. 148 */ 149 error = VFS_VGET(fs->lfs_ivnode->v_mount, ino, &vp); 150 if (error == 0) { 151 DLOG((DLOG_RF, "lfs_rf_valloc[1]: ino %d vp %p\n", ino, vp)); 152 153 *vpp = vp; 154 ip = VTOI(vp); 155 if (ip->i_gen == vers) 156 return 0; 157 else if (ip->i_gen < vers) { 158 VOP_TRUNCATE(vp, (off_t)0, 0, NOCRED, p); 159 ip->i_gen = ip->i_ffs1_gen = vers; 160 LFS_SET_UINO(ip, IN_CHANGE | IN_UPDATE); 161 return 0; 162 } else { 163 DLOG((DLOG_RF, "ino %d: sought version %d, got %d\n", 164 ino, vers, ip->i_ffs1_gen)); 165 vput(vp); 166 *vpp = NULLVP; 167 return EEXIST; 168 } 169 } 170 171 /* 172 * The inode is not in use. Find it on the free list. 173 */ 174 /* If the Ifile is too short to contain this inum, extend it */ 175 while (VTOI(fs->lfs_ivnode)->i_size <= (ino / 176 fs->lfs_ifpb + fs->lfs_cleansz + fs->lfs_segtabsz) 177 << fs->lfs_bshift) { 178 extend_ifile(fs, NOCRED); 179 } 180 181 LFS_IENTRY(ifp, fs, ino, bp); 182 oldnext = ifp->if_nextfree; 183 ifp->if_version = vers; 184 brelse(bp); 185 186 LFS_GET_HEADFREE(fs, cip, cbp, &ino); 187 if (ino) { 188 LFS_PUT_HEADFREE(fs, cip, cbp, oldnext); 189 } else { 190 tino = ino; 191 while (1) { 192 LFS_IENTRY(ifp, fs, tino, bp); 193 if (ifp->if_nextfree == ino || 194 ifp->if_nextfree == LFS_UNUSED_INUM) 195 break; 196 tino = ifp->if_nextfree; 197 brelse(bp); 198 } 199 if (ifp->if_nextfree == LFS_UNUSED_INUM) { 200 brelse(bp); 201 return ENOENT; 202 } 203 ifp->if_nextfree = oldnext; 204 LFS_BWRITE_LOG(bp); 205 } 206 207 error = lfs_ialloc(fs, fs->lfs_ivnode, ino, vers, &vp); 208 if (error == 0) { 209 /* 210 * Make it VREG so we can put blocks on it. We will change 211 * this later if it turns out to be some other kind of file. 212 */ 213 ip = VTOI(vp); 214 ip->i_mode = ip->i_ffs1_mode = IFREG; 215 ip->i_nlink = ip->i_ffs1_nlink = 1; 216 ip->i_ffs_effnlink = 1; 217 ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, &vp); 218 ip = VTOI(vp); 219 220 DLOG((DLOG_RF, "lfs_rf_valloc: ino %d vp %p\n", ino, vp)); 221 222 /* The dirop-nature of this vnode is past */ 223 lfs_unmark_vnode(vp); 224 (void)lfs_vunref(vp); 225 vp->v_flag &= ~VDIROP; 226 simple_lock(&fs->lfs_interlock); 227 simple_lock(&lfs_subsys_lock); 228 --lfs_dirvcount; 229 simple_unlock(&lfs_subsys_lock); 230 --fs->lfs_dirvcount; 231 TAILQ_REMOVE(&fs->lfs_dchainhd, ip, i_lfs_dchain); 232 wakeup(&lfs_dirvcount); 233 wakeup(&fs->lfs_dirvcount); 234 simple_unlock(&fs->lfs_interlock); 235 } 236 *vpp = vp; 237 return error; 238 } 239 240 /* 241 * Add a new block to the Ifile, to accommodate future file creations. 242 * Called with the segment lock held. 243 */ 244 static int 245 extend_ifile(struct lfs *fs, struct ucred *cred) 246 { 247 struct vnode *vp; 248 struct inode *ip; 249 IFILE *ifp; 250 IFILE_V1 *ifp_v1; 251 struct buf *bp, *cbp; 252 int error; 253 daddr_t i, blkno, xmax; 254 ino_t oldlast, maxino; 255 CLEANERINFO *cip; 256 257 ASSERT_SEGLOCK(fs); 258 259 vp = fs->lfs_ivnode; 260 ip = VTOI(vp); 261 blkno = lblkno(fs, ip->i_size); 262 if ((error = VOP_BALLOC(vp, ip->i_size, fs->lfs_bsize, cred, 0, 263 &bp)) != 0) { 264 return (error); 265 } 266 ip->i_size += fs->lfs_bsize; 267 ip->i_ffs1_size = ip->i_size; 268 uvm_vnp_setsize(vp, ip->i_size); 269 270 maxino = ((ip->i_size >> fs->lfs_bshift) - fs->lfs_cleansz - 271 fs->lfs_segtabsz) * fs->lfs_ifpb; 272 fs->lfs_ino_bitmap = (lfs_bm_t *) 273 realloc(fs->lfs_ino_bitmap, ((maxino + BMMASK) >> BMSHIFT) * 274 sizeof(lfs_bm_t), M_SEGMENT, M_WAITOK); 275 KASSERT(fs->lfs_ino_bitmap != NULL); 276 277 i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) * 278 fs->lfs_ifpb; 279 280 /* 281 * We insert the new inodes at the head of the free list. 282 * Under normal circumstances, the free list is empty here, 283 * so we are also incidentally placing them at the end (which 284 * we must do if we are to keep them in order). 285 */ 286 LFS_GET_HEADFREE(fs, cip, cbp, &oldlast); 287 LFS_PUT_HEADFREE(fs, cip, cbp, i); 288 #ifdef DIAGNOSTIC 289 if (fs->lfs_freehd == LFS_UNUSED_INUM) 290 panic("inode 0 allocated [2]"); 291 #endif /* DIAGNOSTIC */ 292 xmax = i + fs->lfs_ifpb; 293 294 if (fs->lfs_version == 1) { 295 for (ifp_v1 = (IFILE_V1 *)bp->b_data; i < xmax; ++ifp_v1) { 296 SET_BITMAP_FREE(fs, i); 297 ifp_v1->if_version = 1; 298 ifp_v1->if_daddr = LFS_UNUSED_DADDR; 299 ifp_v1->if_nextfree = ++i; 300 } 301 ifp_v1--; 302 ifp_v1->if_nextfree = oldlast; 303 } else { 304 for (ifp = (IFILE *)bp->b_data; i < xmax; ++ifp) { 305 SET_BITMAP_FREE(fs, i); 306 ifp->if_version = 1; 307 ifp->if_daddr = LFS_UNUSED_DADDR; 308 ifp->if_nextfree = ++i; 309 } 310 ifp--; 311 ifp->if_nextfree = oldlast; 312 } 313 LFS_PUT_TAILFREE(fs, cip, cbp, xmax - 1); 314 315 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 316 317 return 0; 318 } 319 320 /* Allocate a new inode. */ 321 /* ARGSUSED */ 322 /* VOP_BWRITE 2i times */ 323 int 324 lfs_valloc(void *v) 325 { 326 struct vop_valloc_args /* { 327 struct vnode *a_pvp; 328 int a_mode; 329 struct ucred *a_cred; 330 struct vnode **a_vpp; 331 } */ *ap = v; 332 struct lfs *fs; 333 struct buf *bp, *cbp; 334 struct ifile *ifp; 335 ino_t new_ino; 336 int error; 337 int new_gen; 338 CLEANERINFO *cip; 339 340 fs = VTOI(ap->a_pvp)->i_lfs; 341 if (fs->lfs_ronly) 342 return EROFS; 343 344 ASSERT_NO_SEGLOCK(fs); 345 346 lfs_seglock(fs, SEGM_PROT); 347 vn_lock(fs->lfs_ivnode, LK_EXCLUSIVE); 348 349 /* Get the head of the freelist. */ 350 LFS_GET_HEADFREE(fs, cip, cbp, &new_ino); 351 KASSERT(new_ino != LFS_UNUSED_INUM && new_ino != LFS_IFILE_INUM); 352 353 DLOG((DLOG_ALLOC, "lfs_valloc: allocate inode %lld\n", 354 (long long)new_ino)); 355 356 /* 357 * Remove the inode from the free list and write the new start 358 * of the free list into the superblock. 359 */ 360 CLR_BITMAP_FREE(fs, new_ino); 361 LFS_IENTRY(ifp, fs, new_ino, bp); 362 if (ifp->if_daddr != LFS_UNUSED_DADDR) 363 panic("lfs_valloc: inuse inode %llu on the free list", 364 (unsigned long long)new_ino); 365 LFS_PUT_HEADFREE(fs, cip, cbp, ifp->if_nextfree); 366 DLOG((DLOG_ALLOC, "lfs_valloc: headfree %lld -> %lld\n", 367 (long long)new_ino, (long long)ifp->if_nextfree)); 368 369 new_gen = ifp->if_version; /* version was updated by vfree */ 370 brelse(bp); 371 372 /* Extend IFILE so that the next lfs_valloc will succeed. */ 373 if (fs->lfs_freehd == LFS_UNUSED_INUM) { 374 if ((error = extend_ifile(fs, ap->a_cred)) != 0) { 375 LFS_PUT_HEADFREE(fs, cip, cbp, new_ino); 376 VOP_UNLOCK(fs->lfs_ivnode, 0); 377 lfs_segunlock(fs); 378 return error; 379 } 380 } 381 #ifdef DIAGNOSTIC 382 if (fs->lfs_freehd == LFS_UNUSED_INUM) 383 panic("inode 0 allocated [3]"); 384 #endif /* DIAGNOSTIC */ 385 386 /* Set superblock modified bit and increment file count. */ 387 simple_lock(&fs->lfs_interlock); 388 fs->lfs_fmod = 1; 389 simple_unlock(&fs->lfs_interlock); 390 ++fs->lfs_nfiles; 391 392 VOP_UNLOCK(fs->lfs_ivnode, 0); 393 lfs_segunlock(fs); 394 395 return lfs_ialloc(fs, ap->a_pvp, new_ino, new_gen, ap->a_vpp); 396 } 397 398 /* 399 * Finish allocating a new inode, given an inode and generation number. 400 */ 401 static int 402 lfs_ialloc(struct lfs *fs, struct vnode *pvp, ino_t new_ino, int new_gen, 403 struct vnode **vpp) 404 { 405 struct inode *ip; 406 struct vnode *vp; 407 408 ASSERT_NO_SEGLOCK(fs); 409 410 vp = *vpp; 411 lockmgr(&ufs_hashlock, LK_EXCLUSIVE, 0); 412 /* Create an inode to associate with the vnode. */ 413 lfs_vcreate(pvp->v_mount, new_ino, vp); 414 415 ip = VTOI(vp); 416 LFS_SET_UINO(ip, IN_CHANGE); 417 /* on-disk structure has been zeroed out by lfs_vcreate */ 418 ip->i_din.ffs1_din->di_inumber = new_ino; 419 420 /* Note no blocks yet */ 421 ip->i_lfs_hiblk = -1; 422 423 /* Set a new generation number for this inode. */ 424 if (new_gen) { 425 ip->i_gen = new_gen; 426 ip->i_ffs1_gen = new_gen; 427 } 428 429 /* Insert into the inode hash table. */ 430 ufs_ihashins(ip); 431 lockmgr(&ufs_hashlock, LK_RELEASE, 0); 432 433 ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, vpp); 434 vp = *vpp; 435 ip = VTOI(vp); 436 437 memset(ip->i_lfs_fragsize, 0, NDADDR * sizeof(*ip->i_lfs_fragsize)); 438 439 uvm_vnp_setsize(vp, 0); 440 lfs_mark_vnode(vp); 441 genfs_node_init(vp, &lfs_genfsops); 442 VREF(ip->i_devvp); 443 return (0); 444 } 445 446 /* Create a new vnode/inode pair and initialize what fields we can. */ 447 void 448 lfs_vcreate(struct mount *mp, ino_t ino, struct vnode *vp) 449 { 450 struct inode *ip; 451 struct ufs1_dinode *dp; 452 struct ufsmount *ump; 453 #ifdef QUOTA 454 int i; 455 #endif 456 457 /* Get a pointer to the private mount structure. */ 458 ump = VFSTOUFS(mp); 459 460 ASSERT_NO_SEGLOCK(ump->um_lfs); 461 462 /* Initialize the inode. */ 463 ip = pool_get(&lfs_inode_pool, PR_WAITOK); 464 memset(ip, 0, sizeof(*ip)); 465 dp = pool_get(&lfs_dinode_pool, PR_WAITOK); 466 memset(dp, 0, sizeof(*dp)); 467 ip->inode_ext.lfs = pool_get(&lfs_inoext_pool, PR_WAITOK); 468 memset(ip->inode_ext.lfs, 0, sizeof(*ip->inode_ext.lfs)); 469 vp->v_data = ip; 470 ip->i_din.ffs1_din = dp; 471 ip->i_ump = ump; 472 ip->i_vnode = vp; 473 ip->i_devvp = ump->um_devvp; 474 ip->i_dev = ump->um_dev; 475 ip->i_number = dp->di_inumber = ino; 476 ip->i_lfs = ump->um_lfs; 477 ip->i_lfs_effnblks = 0; 478 SPLAY_INIT(&ip->i_lfs_lbtree); 479 ip->i_lfs_nbtree = 0; 480 LIST_INIT(&ip->i_lfs_segdhd); 481 #ifdef QUOTA 482 for (i = 0; i < MAXQUOTAS; i++) 483 ip->i_dquot[i] = NODQUOT; 484 #endif 485 #ifdef DEBUG 486 if (ino == LFS_IFILE_INUM) 487 vp->v_vnlock->lk_wmesg = "inlock"; 488 #endif 489 } 490 491 #if 0 492 /* 493 * Find the highest-numbered allocated inode. 494 * This will be used to shrink the Ifile. 495 */ 496 static inline ino_t 497 lfs_last_alloc_ino(struct lfs *fs) 498 { 499 ino_t ino, maxino; 500 501 maxino = ((fs->lfs_ivnode->v_size >> fs->lfs_bshift) - 502 fs->lfs_cleansz - fs->lfs_segtabsz) * fs->lfs_ifpb; 503 for (ino = maxino - 1; ino > LFS_UNUSED_INUM; --ino) { 504 if (ISSET_BITMAP_FREE(fs, ino) == 0) 505 break; 506 } 507 return ino; 508 } 509 #endif 510 511 /* 512 * Find the previous (next lowest numbered) free inode, if any. 513 * If there is none, return LFS_UNUSED_INUM. 514 */ 515 static inline ino_t 516 lfs_freelist_prev(struct lfs *fs, ino_t ino) 517 { 518 ino_t tino, bound, bb, freehdbb; 519 520 if (fs->lfs_freehd == LFS_UNUSED_INUM) /* No free inodes at all */ 521 return LFS_UNUSED_INUM; 522 523 /* Search our own word first */ 524 bound = ino & ~BMMASK; 525 for (tino = ino - 1; tino >= bound && tino > LFS_UNUSED_INUM; tino--) 526 if (ISSET_BITMAP_FREE(fs, tino)) 527 return tino; 528 /* If there are no lower words to search, just return */ 529 if (ino >> BMSHIFT == 0) 530 return LFS_UNUSED_INUM; 531 532 /* 533 * Find a word with a free inode in it. We have to be a bit 534 * careful here since ino_t is unsigned. 535 */ 536 freehdbb = (fs->lfs_freehd >> BMSHIFT); 537 for (bb = (ino >> BMSHIFT) - 1; bb >= freehdbb && bb > 0; --bb) 538 if (fs->lfs_ino_bitmap[bb]) 539 break; 540 if (fs->lfs_ino_bitmap[bb] == 0) 541 return LFS_UNUSED_INUM; 542 543 /* Search the word we found */ 544 for (tino = (bb << BMSHIFT) | BMMASK; tino >= (bb << BMSHIFT) && 545 tino > LFS_UNUSED_INUM; tino--) 546 if (ISSET_BITMAP_FREE(fs, tino)) 547 break; 548 549 if (tino <= LFS_IFILE_INUM) 550 tino = LFS_UNUSED_INUM; 551 552 return tino; 553 } 554 555 /* Free an inode. */ 556 /* ARGUSED */ 557 /* VOP_BWRITE 2i times */ 558 int 559 lfs_vfree(void *v) 560 { 561 struct vop_vfree_args /* { 562 struct vnode *a_pvp; 563 ino_t a_ino; 564 int a_mode; 565 } */ *ap = v; 566 SEGUSE *sup; 567 CLEANERINFO *cip; 568 struct buf *cbp, *bp; 569 struct ifile *ifp; 570 struct inode *ip; 571 struct vnode *vp; 572 struct lfs *fs; 573 daddr_t old_iaddr; 574 ino_t ino, otail; 575 int s; 576 577 /* Get the inode number and file system. */ 578 vp = ap->a_pvp; 579 ip = VTOI(vp); 580 fs = ip->i_lfs; 581 ino = ip->i_number; 582 583 ASSERT_NO_SEGLOCK(fs); 584 DLOG((DLOG_ALLOC, "lfs_vfree: free ino %lld\n", (long long)ino)); 585 586 /* Drain of pending writes */ 587 simple_lock(&vp->v_interlock); 588 s = splbio(); 589 if (fs->lfs_version > 1 && WRITEINPROG(vp)) 590 ltsleep(vp, (PRIBIO+1), "lfs_vfree", 0, &vp->v_interlock); 591 splx(s); 592 simple_unlock(&vp->v_interlock); 593 594 lfs_seglock(fs, SEGM_PROT); 595 vn_lock(fs->lfs_ivnode, LK_EXCLUSIVE); 596 597 lfs_unmark_vnode(vp); 598 if (vp->v_flag & VDIROP) { 599 vp->v_flag &= ~VDIROP; 600 simple_lock(&fs->lfs_interlock); 601 simple_lock(&lfs_subsys_lock); 602 --lfs_dirvcount; 603 simple_unlock(&lfs_subsys_lock); 604 --fs->lfs_dirvcount; 605 TAILQ_REMOVE(&fs->lfs_dchainhd, ip, i_lfs_dchain); 606 simple_unlock(&fs->lfs_interlock); 607 wakeup(&fs->lfs_dirvcount); 608 wakeup(&lfs_dirvcount); 609 lfs_vunref(vp); 610 611 /* 612 * If this inode is not going to be written any more, any 613 * segment accounting left over from its truncation needs 614 * to occur at the end of the next dirops flush. Attach 615 * them to the fs-wide list for that purpose. 616 */ 617 if (LIST_FIRST(&ip->i_lfs_segdhd) != NULL) { 618 struct segdelta *sd; 619 620 while((sd = LIST_FIRST(&ip->i_lfs_segdhd)) != NULL) { 621 LIST_REMOVE(sd, list); 622 LIST_INSERT_HEAD(&fs->lfs_segdhd, sd, list); 623 } 624 } 625 } else { 626 /* 627 * If it's not a dirop, we can finalize right away. 628 */ 629 lfs_finalize_ino_seguse(fs, ip); 630 } 631 632 LFS_CLR_UINO(ip, IN_ACCESSED|IN_CLEANING|IN_MODIFIED); 633 ip->i_flag &= ~IN_ALLMOD; 634 ip->i_lfs_iflags |= LFSI_DELETED; 635 636 /* 637 * Set the ifile's inode entry to unused, increment its version number 638 * and link it onto the free chain. 639 */ 640 SET_BITMAP_FREE(fs, ino); 641 LFS_IENTRY(ifp, fs, ino, bp); 642 old_iaddr = ifp->if_daddr; 643 ifp->if_daddr = LFS_UNUSED_DADDR; 644 ++ifp->if_version; 645 if (fs->lfs_version == 1) { 646 LFS_GET_HEADFREE(fs, cip, cbp, &(ifp->if_nextfree)); 647 LFS_PUT_HEADFREE(fs, cip, cbp, ino); 648 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 649 } else { 650 ino_t tino, onf; 651 652 ifp->if_nextfree = LFS_UNUSED_INUM; 653 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 654 655 tino = lfs_freelist_prev(fs, ino); 656 if (tino == LFS_UNUSED_INUM) { 657 /* Nothing free below us, put us on the head */ 658 LFS_IENTRY(ifp, fs, ino, bp); 659 LFS_GET_HEADFREE(fs, cip, cbp, &(ifp->if_nextfree)); 660 LFS_PUT_HEADFREE(fs, cip, cbp, ino); 661 DLOG((DLOG_ALLOC, "lfs_vfree: headfree %lld -> %lld\n", 662 (long long)ifp->if_nextfree, (long long)ino)); 663 LFS_BWRITE_LOG(bp); /* Ifile */ 664 665 /* If the list was empty, set tail too */ 666 LFS_GET_TAILFREE(fs, cip, cbp, &otail); 667 if (otail == LFS_UNUSED_INUM) { 668 LFS_PUT_TAILFREE(fs, cip, cbp, ino); 669 DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld " 670 "-> %lld\n", (long long)otail, 671 (long long)ino)); 672 } 673 } else { 674 /* 675 * Insert this inode into the list after tino. 676 * We hold the segment lock so we don't have to 677 * worry about blocks being written out of order. 678 */ 679 DLOG((DLOG_ALLOC, "lfs_vfree: insert ino %lld " 680 " after %lld\n", ino, tino)); 681 682 LFS_IENTRY(ifp, fs, tino, bp); 683 onf = ifp->if_nextfree; 684 ifp->if_nextfree = ino; 685 LFS_BWRITE_LOG(bp); /* Ifile */ 686 687 LFS_IENTRY(ifp, fs, ino, bp); 688 ifp->if_nextfree = onf; 689 LFS_BWRITE_LOG(bp); /* Ifile */ 690 691 /* If we're last, put us on the tail */ 692 if (onf == LFS_UNUSED_INUM) { 693 LFS_GET_TAILFREE(fs, cip, cbp, &otail); 694 LFS_PUT_TAILFREE(fs, cip, cbp, ino); 695 DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld " 696 "-> %lld\n", (long long)otail, 697 (long long)ino)); 698 } 699 } 700 } 701 #ifdef DIAGNOSTIC 702 if (ino == LFS_UNUSED_INUM) { 703 panic("inode 0 freed"); 704 } 705 #endif /* DIAGNOSTIC */ 706 if (old_iaddr != LFS_UNUSED_DADDR) { 707 LFS_SEGENTRY(sup, fs, dtosn(fs, old_iaddr), bp); 708 #ifdef DIAGNOSTIC 709 if (sup->su_nbytes < sizeof (struct ufs1_dinode)) { 710 printf("lfs_vfree: negative byte count" 711 " (segment %" PRIu32 " short by %d)\n", 712 dtosn(fs, old_iaddr), 713 (int)sizeof (struct ufs1_dinode) - 714 sup->su_nbytes); 715 panic("lfs_vfree: negative byte count"); 716 sup->su_nbytes = sizeof (struct ufs1_dinode); 717 } 718 #endif 719 sup->su_nbytes -= sizeof (struct ufs1_dinode); 720 LFS_WRITESEGENTRY(sup, fs, dtosn(fs, old_iaddr), bp); /* Ifile */ 721 } 722 723 /* Set superblock modified bit and decrement file count. */ 724 simple_lock(&fs->lfs_interlock); 725 fs->lfs_fmod = 1; 726 simple_unlock(&fs->lfs_interlock); 727 --fs->lfs_nfiles; 728 729 VOP_UNLOCK(fs->lfs_ivnode, 0); 730 lfs_segunlock(fs); 731 732 return (0); 733 } 734 735 /* 736 * Sort the freelist and set up the free-inode bitmap. 737 * To be called by lfs_mountfs(). 738 */ 739 void 740 lfs_order_freelist(struct lfs *fs) 741 { 742 CLEANERINFO *cip; 743 IFILE *ifp = NULL; 744 struct buf *bp; 745 ino_t ino, firstino, lastino, maxino; 746 747 maxino = ((fs->lfs_ivnode->v_size >> fs->lfs_bshift) - 748 fs->lfs_cleansz - fs->lfs_segtabsz) * fs->lfs_ifpb; 749 fs->lfs_ino_bitmap = (lfs_bm_t *) 750 malloc(((maxino + BMMASK) >> BMSHIFT) * sizeof(lfs_bm_t), 751 M_SEGMENT, M_WAITOK | M_ZERO); 752 KASSERT(fs->lfs_ino_bitmap != NULL); 753 754 firstino = lastino = LFS_UNUSED_INUM; 755 for (ino = 0; ino < maxino; ino++) { 756 if (ino % fs->lfs_ifpb == 0) 757 LFS_IENTRY(ifp, fs, ino, bp); 758 else 759 ++ifp; 760 761 /* Don't put zero or ifile on the free list */ 762 if (ino == LFS_UNUSED_INUM || ino == LFS_IFILE_INUM) 763 continue; 764 765 if (ifp->if_daddr == LFS_UNUSED_DADDR) { 766 if (firstino == LFS_UNUSED_INUM) 767 firstino = ino; 768 else { 769 brelse(bp); 770 771 LFS_IENTRY(ifp, fs, lastino, bp); 772 ifp->if_nextfree = ino; 773 LFS_BWRITE_LOG(bp); 774 775 LFS_IENTRY(ifp, fs, ino, bp); 776 } 777 lastino = ino; 778 779 SET_BITMAP_FREE(fs, ino); 780 } 781 782 if ((ino + 1) % fs->lfs_ifpb == 0) 783 brelse(bp); 784 } 785 786 LFS_PUT_HEADFREE(fs, cip, bp, firstino); 787 LFS_PUT_TAILFREE(fs, cip, bp, lastino); 788 } 789
Indexes created Wed Oct 01 19:09:53 GMT 2025