lfs_alloc.c revision 1.103
1 /* $NetBSD: lfs_alloc.c,v 1.103 2007/10/10 20:42:34 ad Exp $ */ 2 3 /*- 4 * Copyright (c) 1999, 2000, 2001, 2002, 2003, 2007 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.103 2007/10/10 20:42:34 ad 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 #include <sys/kauth.h> 89 90 #include <ufs/ufs/quota.h> 91 #include <ufs/ufs/inode.h> 92 #include <ufs/ufs/ufsmount.h> 93 #include <ufs/ufs/ufs_extern.h> 94 95 #include <ufs/lfs/lfs.h> 96 #include <ufs/lfs/lfs_extern.h> 97 98 extern kmutex_t ufs_hashlock; 99 100 /* Constants for inode free bitmap */ 101 #define BMSHIFT 5 /* 2 ** 5 = 32 */ 102 #define BMMASK ((1 << BMSHIFT) - 1) 103 #define SET_BITMAP_FREE(F, I) do { \ 104 DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d set\n", (int)(I), \ 105 (int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \ 106 (F)->lfs_ino_bitmap[(I) >> BMSHIFT] |= (1 << ((I) & BMMASK)); \ 107 } while (0) 108 #define CLR_BITMAP_FREE(F, I) do { \ 109 DLOG((DLOG_ALLOC, "lfs: ino %d wrd %d bit %d clr\n", (int)(I), \ 110 (int)((I) >> BMSHIFT), (int)((I) & BMMASK))); \ 111 (F)->lfs_ino_bitmap[(I) >> BMSHIFT] &= ~(1 << ((I) & BMMASK)); \ 112 } while(0) 113 114 #define ISSET_BITMAP_FREE(F, I) \ 115 ((F)->lfs_ino_bitmap[(I) >> BMSHIFT] & (1 << ((I) & BMMASK))) 116 117 /* 118 * Add a new block to the Ifile, to accommodate future file creations. 119 * Called with the segment lock held. 120 */ 121 int 122 lfs_extend_ifile(struct lfs *fs, kauth_cred_t cred) 123 { 124 struct vnode *vp; 125 struct inode *ip; 126 IFILE *ifp; 127 IFILE_V1 *ifp_v1; 128 struct buf *bp, *cbp; 129 int error; 130 daddr_t i, blkno, xmax; 131 ino_t oldlast, maxino; 132 CLEANERINFO *cip; 133 134 ASSERT_SEGLOCK(fs); 135 136 vp = fs->lfs_ivnode; 137 ip = VTOI(vp); 138 blkno = lblkno(fs, ip->i_size); 139 if ((error = lfs_balloc(vp, ip->i_size, fs->lfs_bsize, cred, 0, 140 &bp)) != 0) { 141 return (error); 142 } 143 ip->i_size += fs->lfs_bsize; 144 ip->i_ffs1_size = ip->i_size; 145 uvm_vnp_setsize(vp, ip->i_size); 146 147 maxino = ((ip->i_size >> fs->lfs_bshift) - fs->lfs_cleansz - 148 fs->lfs_segtabsz) * fs->lfs_ifpb; 149 fs->lfs_ino_bitmap = (lfs_bm_t *) 150 realloc(fs->lfs_ino_bitmap, ((maxino + BMMASK) >> BMSHIFT) * 151 sizeof(lfs_bm_t), M_SEGMENT, M_WAITOK); 152 KASSERT(fs->lfs_ino_bitmap != NULL); 153 154 i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) * 155 fs->lfs_ifpb; 156 157 /* 158 * We insert the new inodes at the head of the free list. 159 * Under normal circumstances, the free list is empty here, 160 * so we are also incidentally placing them at the end (which 161 * we must do if we are to keep them in order). 162 */ 163 LFS_GET_HEADFREE(fs, cip, cbp, &oldlast); 164 LFS_PUT_HEADFREE(fs, cip, cbp, i); 165 #ifdef DIAGNOSTIC 166 if (fs->lfs_freehd == LFS_UNUSED_INUM) 167 panic("inode 0 allocated [2]"); 168 #endif /* DIAGNOSTIC */ 169 xmax = i + fs->lfs_ifpb; 170 171 if (fs->lfs_version == 1) { 172 for (ifp_v1 = (IFILE_V1 *)bp->b_data; i < xmax; ++ifp_v1) { 173 SET_BITMAP_FREE(fs, i); 174 ifp_v1->if_version = 1; 175 ifp_v1->if_daddr = LFS_UNUSED_DADDR; 176 ifp_v1->if_nextfree = ++i; 177 } 178 ifp_v1--; 179 ifp_v1->if_nextfree = oldlast; 180 } else { 181 for (ifp = (IFILE *)bp->b_data; i < xmax; ++ifp) { 182 SET_BITMAP_FREE(fs, i); 183 ifp->if_version = 1; 184 ifp->if_daddr = LFS_UNUSED_DADDR; 185 ifp->if_nextfree = ++i; 186 } 187 ifp--; 188 ifp->if_nextfree = oldlast; 189 } 190 LFS_PUT_TAILFREE(fs, cip, cbp, xmax - 1); 191 192 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 193 194 return 0; 195 } 196 197 /* Allocate a new inode. */ 198 /* ARGSUSED */ 199 /* VOP_BWRITE 2i times */ 200 int 201 lfs_valloc(struct vnode *pvp, int mode, kauth_cred_t cred, 202 struct vnode **vpp) 203 { 204 struct lfs *fs; 205 struct buf *bp, *cbp; 206 struct ifile *ifp; 207 ino_t new_ino; 208 int error; 209 int new_gen; 210 CLEANERINFO *cip; 211 212 fs = VTOI(pvp)->i_lfs; 213 if (fs->lfs_ronly) 214 return EROFS; 215 216 ASSERT_NO_SEGLOCK(fs); 217 218 lfs_seglock(fs, SEGM_PROT); 219 vn_lock(fs->lfs_ivnode, LK_EXCLUSIVE); 220 221 /* Get the head of the freelist. */ 222 LFS_GET_HEADFREE(fs, cip, cbp, &new_ino); 223 KASSERT(new_ino != LFS_UNUSED_INUM && new_ino != LFS_IFILE_INUM); 224 225 DLOG((DLOG_ALLOC, "lfs_valloc: allocate inode %lld\n", 226 (long long)new_ino)); 227 228 /* 229 * Remove the inode from the free list and write the new start 230 * of the free list into the superblock. 231 */ 232 CLR_BITMAP_FREE(fs, new_ino); 233 LFS_IENTRY(ifp, fs, new_ino, bp); 234 if (ifp->if_daddr != LFS_UNUSED_DADDR) 235 panic("lfs_valloc: inuse inode %llu on the free list", 236 (unsigned long long)new_ino); 237 LFS_PUT_HEADFREE(fs, cip, cbp, ifp->if_nextfree); 238 DLOG((DLOG_ALLOC, "lfs_valloc: headfree %lld -> %lld\n", 239 (long long)new_ino, (long long)ifp->if_nextfree)); 240 241 new_gen = ifp->if_version; /* version was updated by vfree */ 242 brelse(bp, 0); 243 244 /* Extend IFILE so that the next lfs_valloc will succeed. */ 245 if (fs->lfs_freehd == LFS_UNUSED_INUM) { 246 if ((error = lfs_extend_ifile(fs, cred)) != 0) { 247 LFS_PUT_HEADFREE(fs, cip, cbp, new_ino); 248 VOP_UNLOCK(fs->lfs_ivnode, 0); 249 lfs_segunlock(fs); 250 return error; 251 } 252 } 253 #ifdef DIAGNOSTIC 254 if (fs->lfs_freehd == LFS_UNUSED_INUM) 255 panic("inode 0 allocated [3]"); 256 #endif /* DIAGNOSTIC */ 257 258 /* Set superblock modified bit and increment file count. */ 259 simple_lock(&fs->lfs_interlock); 260 fs->lfs_fmod = 1; 261 simple_unlock(&fs->lfs_interlock); 262 ++fs->lfs_nfiles; 263 264 VOP_UNLOCK(fs->lfs_ivnode, 0); 265 lfs_segunlock(fs); 266 267 return lfs_ialloc(fs, pvp, new_ino, new_gen, vpp); 268 } 269 270 /* 271 * Finish allocating a new inode, given an inode and generation number. 272 */ 273 int 274 lfs_ialloc(struct lfs *fs, struct vnode *pvp, ino_t new_ino, int new_gen, 275 struct vnode **vpp) 276 { 277 struct inode *ip; 278 struct vnode *vp; 279 280 ASSERT_NO_SEGLOCK(fs); 281 282 vp = *vpp; 283 mutex_enter(&ufs_hashlock); 284 /* Create an inode to associate with the vnode. */ 285 lfs_vcreate(pvp->v_mount, new_ino, vp); 286 287 ip = VTOI(vp); 288 LFS_SET_UINO(ip, IN_CHANGE); 289 /* on-disk structure has been zeroed out by lfs_vcreate */ 290 ip->i_din.ffs1_din->di_inumber = new_ino; 291 292 /* Note no blocks yet */ 293 ip->i_lfs_hiblk = -1; 294 295 /* Set a new generation number for this inode. */ 296 if (new_gen) { 297 ip->i_gen = new_gen; 298 ip->i_ffs1_gen = new_gen; 299 } 300 301 /* Insert into the inode hash table. */ 302 ufs_ihashins(ip); 303 mutex_exit(&ufs_hashlock); 304 305 ufs_vinit(vp->v_mount, lfs_specop_p, lfs_fifoop_p, vpp); 306 vp = *vpp; 307 ip = VTOI(vp); 308 309 memset(ip->i_lfs_fragsize, 0, NDADDR * sizeof(*ip->i_lfs_fragsize)); 310 311 uvm_vnp_setsize(vp, 0); 312 lfs_mark_vnode(vp); 313 genfs_node_init(vp, &lfs_genfsops); 314 VREF(ip->i_devvp); 315 return (0); 316 } 317 318 /* Create a new vnode/inode pair and initialize what fields we can. */ 319 void 320 lfs_vcreate(struct mount *mp, ino_t ino, struct vnode *vp) 321 { 322 struct inode *ip; 323 struct ufs1_dinode *dp; 324 struct ufsmount *ump; 325 326 /* Get a pointer to the private mount structure. */ 327 ump = VFSTOUFS(mp); 328 329 ASSERT_NO_SEGLOCK(ump->um_lfs); 330 331 /* Initialize the inode. */ 332 ip = pool_get(&lfs_inode_pool, PR_WAITOK); 333 memset(ip, 0, sizeof(*ip)); 334 dp = pool_get(&lfs_dinode_pool, PR_WAITOK); 335 memset(dp, 0, sizeof(*dp)); 336 ip->inode_ext.lfs = pool_get(&lfs_inoext_pool, PR_WAITOK); 337 memset(ip->inode_ext.lfs, 0, sizeof(*ip->inode_ext.lfs)); 338 vp->v_data = ip; 339 ip->i_din.ffs1_din = dp; 340 ip->i_ump = ump; 341 ip->i_vnode = vp; 342 ip->i_devvp = ump->um_devvp; 343 ip->i_dev = ump->um_dev; 344 ip->i_number = dp->di_inumber = ino; 345 ip->i_lfs = ump->um_lfs; 346 ip->i_lfs_effnblks = 0; 347 SPLAY_INIT(&ip->i_lfs_lbtree); 348 ip->i_lfs_nbtree = 0; 349 LIST_INIT(&ip->i_lfs_segdhd); 350 #ifdef QUOTA 351 ufsquota_init(ip); 352 #endif 353 #ifdef DEBUG 354 if (ino == LFS_IFILE_INUM) 355 vp->v_vnlock->lk_wmesg = "inlock"; 356 #endif 357 } 358 359 #if 0 360 /* 361 * Find the highest-numbered allocated inode. 362 * This will be used to shrink the Ifile. 363 */ 364 static inline ino_t 365 lfs_last_alloc_ino(struct lfs *fs) 366 { 367 ino_t ino, maxino; 368 369 maxino = ((fs->lfs_ivnode->v_size >> fs->lfs_bshift) - 370 fs->lfs_cleansz - fs->lfs_segtabsz) * fs->lfs_ifpb; 371 for (ino = maxino - 1; ino > LFS_UNUSED_INUM; --ino) { 372 if (ISSET_BITMAP_FREE(fs, ino) == 0) 373 break; 374 } 375 return ino; 376 } 377 #endif 378 379 /* 380 * Find the previous (next lowest numbered) free inode, if any. 381 * If there is none, return LFS_UNUSED_INUM. 382 */ 383 static inline ino_t 384 lfs_freelist_prev(struct lfs *fs, ino_t ino) 385 { 386 ino_t tino, bound, bb, freehdbb; 387 388 if (fs->lfs_freehd == LFS_UNUSED_INUM) /* No free inodes at all */ 389 return LFS_UNUSED_INUM; 390 391 /* Search our own word first */ 392 bound = ino & ~BMMASK; 393 for (tino = ino - 1; tino >= bound && tino > LFS_UNUSED_INUM; tino--) 394 if (ISSET_BITMAP_FREE(fs, tino)) 395 return tino; 396 /* If there are no lower words to search, just return */ 397 if (ino >> BMSHIFT == 0) 398 return LFS_UNUSED_INUM; 399 400 /* 401 * Find a word with a free inode in it. We have to be a bit 402 * careful here since ino_t is unsigned. 403 */ 404 freehdbb = (fs->lfs_freehd >> BMSHIFT); 405 for (bb = (ino >> BMSHIFT) - 1; bb >= freehdbb && bb > 0; --bb) 406 if (fs->lfs_ino_bitmap[bb]) 407 break; 408 if (fs->lfs_ino_bitmap[bb] == 0) 409 return LFS_UNUSED_INUM; 410 411 /* Search the word we found */ 412 for (tino = (bb << BMSHIFT) | BMMASK; tino >= (bb << BMSHIFT) && 413 tino > LFS_UNUSED_INUM; tino--) 414 if (ISSET_BITMAP_FREE(fs, tino)) 415 break; 416 417 if (tino <= LFS_IFILE_INUM) 418 tino = LFS_UNUSED_INUM; 419 420 return tino; 421 } 422 423 /* Free an inode. */ 424 /* ARGUSED */ 425 /* VOP_BWRITE 2i times */ 426 int 427 lfs_vfree(struct vnode *vp, ino_t ino, int mode) 428 { 429 SEGUSE *sup; 430 CLEANERINFO *cip; 431 struct buf *cbp, *bp; 432 struct ifile *ifp; 433 struct inode *ip; 434 struct lfs *fs; 435 daddr_t old_iaddr; 436 ino_t otail; 437 int s; 438 439 /* Get the inode number and file system. */ 440 ip = VTOI(vp); 441 fs = ip->i_lfs; 442 ino = ip->i_number; 443 444 ASSERT_NO_SEGLOCK(fs); 445 DLOG((DLOG_ALLOC, "lfs_vfree: free ino %lld\n", (long long)ino)); 446 447 /* Drain of pending writes */ 448 simple_lock(&vp->v_interlock); 449 s = splbio(); 450 if (fs->lfs_version > 1 && WRITEINPROG(vp)) 451 ltsleep(vp, (PRIBIO+1), "lfs_vfree", 0, &vp->v_interlock); 452 splx(s); 453 simple_unlock(&vp->v_interlock); 454 455 lfs_seglock(fs, SEGM_PROT); 456 vn_lock(fs->lfs_ivnode, LK_EXCLUSIVE); 457 458 lfs_unmark_vnode(vp); 459 if (vp->v_uflag & VU_DIROP) { 460 vp->v_uflag &= ~VU_DIROP; 461 simple_lock(&fs->lfs_interlock); 462 simple_lock(&lfs_subsys_lock); 463 --lfs_dirvcount; 464 simple_unlock(&lfs_subsys_lock); 465 --fs->lfs_dirvcount; 466 TAILQ_REMOVE(&fs->lfs_dchainhd, ip, i_lfs_dchain); 467 simple_unlock(&fs->lfs_interlock); 468 wakeup(&fs->lfs_dirvcount); 469 wakeup(&lfs_dirvcount); 470 lfs_vunref(vp); 471 472 /* 473 * If this inode is not going to be written any more, any 474 * segment accounting left over from its truncation needs 475 * to occur at the end of the next dirops flush. Attach 476 * them to the fs-wide list for that purpose. 477 */ 478 if (LIST_FIRST(&ip->i_lfs_segdhd) != NULL) { 479 struct segdelta *sd; 480 481 while((sd = LIST_FIRST(&ip->i_lfs_segdhd)) != NULL) { 482 LIST_REMOVE(sd, list); 483 LIST_INSERT_HEAD(&fs->lfs_segdhd, sd, list); 484 } 485 } 486 } else { 487 /* 488 * If it's not a dirop, we can finalize right away. 489 */ 490 lfs_finalize_ino_seguse(fs, ip); 491 } 492 493 LFS_CLR_UINO(ip, IN_ACCESSED|IN_CLEANING|IN_MODIFIED); 494 ip->i_flag &= ~IN_ALLMOD; 495 ip->i_lfs_iflags |= LFSI_DELETED; 496 497 /* 498 * Set the ifile's inode entry to unused, increment its version number 499 * and link it onto the free chain. 500 */ 501 SET_BITMAP_FREE(fs, ino); 502 LFS_IENTRY(ifp, fs, ino, bp); 503 old_iaddr = ifp->if_daddr; 504 ifp->if_daddr = LFS_UNUSED_DADDR; 505 ++ifp->if_version; 506 if (fs->lfs_version == 1) { 507 LFS_GET_HEADFREE(fs, cip, cbp, &(ifp->if_nextfree)); 508 LFS_PUT_HEADFREE(fs, cip, cbp, ino); 509 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 510 } else { 511 ino_t tino, onf; 512 513 ifp->if_nextfree = LFS_UNUSED_INUM; 514 (void) LFS_BWRITE_LOG(bp); /* Ifile */ 515 516 tino = lfs_freelist_prev(fs, ino); 517 if (tino == LFS_UNUSED_INUM) { 518 /* Nothing free below us, put us on the head */ 519 LFS_IENTRY(ifp, fs, ino, bp); 520 LFS_GET_HEADFREE(fs, cip, cbp, &(ifp->if_nextfree)); 521 LFS_PUT_HEADFREE(fs, cip, cbp, ino); 522 DLOG((DLOG_ALLOC, "lfs_vfree: headfree %lld -> %lld\n", 523 (long long)ifp->if_nextfree, (long long)ino)); 524 LFS_BWRITE_LOG(bp); /* Ifile */ 525 526 /* If the list was empty, set tail too */ 527 LFS_GET_TAILFREE(fs, cip, cbp, &otail); 528 if (otail == LFS_UNUSED_INUM) { 529 LFS_PUT_TAILFREE(fs, cip, cbp, ino); 530 DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld " 531 "-> %lld\n", (long long)otail, 532 (long long)ino)); 533 } 534 } else { 535 /* 536 * Insert this inode into the list after tino. 537 * We hold the segment lock so we don't have to 538 * worry about blocks being written out of order. 539 */ 540 DLOG((DLOG_ALLOC, "lfs_vfree: insert ino %lld " 541 " after %lld\n", ino, tino)); 542 543 LFS_IENTRY(ifp, fs, tino, bp); 544 onf = ifp->if_nextfree; 545 ifp->if_nextfree = ino; 546 LFS_BWRITE_LOG(bp); /* Ifile */ 547 548 LFS_IENTRY(ifp, fs, ino, bp); 549 ifp->if_nextfree = onf; 550 LFS_BWRITE_LOG(bp); /* Ifile */ 551 552 /* If we're last, put us on the tail */ 553 if (onf == LFS_UNUSED_INUM) { 554 LFS_GET_TAILFREE(fs, cip, cbp, &otail); 555 LFS_PUT_TAILFREE(fs, cip, cbp, ino); 556 DLOG((DLOG_ALLOC, "lfs_vfree: tailfree %lld " 557 "-> %lld\n", (long long)otail, 558 (long long)ino)); 559 } 560 } 561 } 562 #ifdef DIAGNOSTIC 563 if (ino == LFS_UNUSED_INUM) { 564 panic("inode 0 freed"); 565 } 566 #endif /* DIAGNOSTIC */ 567 if (old_iaddr != LFS_UNUSED_DADDR) { 568 LFS_SEGENTRY(sup, fs, dtosn(fs, old_iaddr), bp); 569 #ifdef DIAGNOSTIC 570 if (sup->su_nbytes < sizeof (struct ufs1_dinode)) { 571 printf("lfs_vfree: negative byte count" 572 " (segment %" PRIu32 " short by %d)\n", 573 dtosn(fs, old_iaddr), 574 (int)sizeof (struct ufs1_dinode) - 575 sup->su_nbytes); 576 panic("lfs_vfree: negative byte count"); 577 sup->su_nbytes = sizeof (struct ufs1_dinode); 578 } 579 #endif 580 sup->su_nbytes -= sizeof (struct ufs1_dinode); 581 LFS_WRITESEGENTRY(sup, fs, dtosn(fs, old_iaddr), bp); /* Ifile */ 582 } 583 584 /* Set superblock modified bit and decrement file count. */ 585 simple_lock(&fs->lfs_interlock); 586 fs->lfs_fmod = 1; 587 simple_unlock(&fs->lfs_interlock); 588 --fs->lfs_nfiles; 589 590 VOP_UNLOCK(fs->lfs_ivnode, 0); 591 lfs_segunlock(fs); 592 593 return (0); 594 } 595 596 /* 597 * Sort the freelist and set up the free-inode bitmap. 598 * To be called by lfs_mountfs(). 599 */ 600 void 601 lfs_order_freelist(struct lfs *fs) 602 { 603 CLEANERINFO *cip; 604 IFILE *ifp = NULL; 605 struct buf *bp; 606 ino_t ino, firstino, lastino, maxino; 607 #ifdef notyet 608 struct vnode *vp; 609 #endif 610 611 ASSERT_NO_SEGLOCK(fs); 612 lfs_seglock(fs, SEGM_PROT); 613 614 maxino = ((fs->lfs_ivnode->v_size >> fs->lfs_bshift) - 615 fs->lfs_cleansz - fs->lfs_segtabsz) * fs->lfs_ifpb; 616 fs->lfs_ino_bitmap = (lfs_bm_t *) 617 malloc(((maxino + BMMASK) >> BMSHIFT) * sizeof(lfs_bm_t), 618 M_SEGMENT, M_WAITOK | M_ZERO); 619 KASSERT(fs->lfs_ino_bitmap != NULL); 620 621 firstino = lastino = LFS_UNUSED_INUM; 622 for (ino = 0; ino < maxino; ino++) { 623 if (ino % fs->lfs_ifpb == 0) 624 LFS_IENTRY(ifp, fs, ino, bp); 625 else 626 ++ifp; 627 628 /* Don't put zero or ifile on the free list */ 629 if (ino == LFS_UNUSED_INUM || ino == LFS_IFILE_INUM) 630 continue; 631 632 #ifdef notyet 633 /* Address orphaned files */ 634 if (ifp->if_nextfree == LFS_ORPHAN_NEXTFREE && 635 VFS_VGET(fs->lfs_ivnode->v_mount, ino, &vp) == 0) { 636 lfs_truncate(vp, 0, 0, NOCRED, curlwp); 637 vput(vp); 638 LFS_SEGENTRY(sup, fs, dtosn(fs, ifp->if_daddr), bp); 639 KASSERT(sup->su_nbytes >= DINODE1_SIZE); 640 sup->su_nbytes -= DINODE1_SIZE; 641 LFS_WRITESEGENTRY(sup, fs, dtosn(fs, ifp->if_daddr), bp); 642 643 /* Set up to fall through to next section */ 644 ifp->if_daddr = LFS_UNUSED_DADDR; 645 LFS_BWRITE_LOG(bp); 646 LFS_IENTRY(ifp, fs, ino, bp); 647 } 648 #endif 649 650 if (ifp->if_daddr == LFS_UNUSED_DADDR) { 651 if (firstino == LFS_UNUSED_INUM) 652 firstino = ino; 653 else { 654 brelse(bp, 0); 655 656 LFS_IENTRY(ifp, fs, lastino, bp); 657 ifp->if_nextfree = ino; 658 LFS_BWRITE_LOG(bp); 659 660 LFS_IENTRY(ifp, fs, ino, bp); 661 } 662 lastino = ino; 663 664 SET_BITMAP_FREE(fs, ino); 665 } 666 667 if ((ino + 1) % fs->lfs_ifpb == 0) 668 brelse(bp, 0); 669 } 670 671 LFS_PUT_HEADFREE(fs, cip, bp, firstino); 672 LFS_PUT_TAILFREE(fs, cip, bp, lastino); 673 674 lfs_segunlock(fs); 675 } 676 677 void 678 lfs_orphan(struct lfs *fs, ino_t ino) 679 { 680 IFILE *ifp; 681 struct buf *bp; 682 683 LFS_IENTRY(ifp, fs, ino, bp); 684 ifp->if_nextfree = LFS_ORPHAN_NEXTFREE; 685 LFS_BWRITE_LOG(bp); 686 } 687
Indexes created Mon Sep 22 05:09:51 GMT 2025