ffs_inode.c revision 1.68
1 /* $NetBSD: ffs_inode.c,v 1.68 2004/08/15 07:19:56 mycroft Exp $ */ 2 3 /* 4 * Copyright (c) 1982, 1986, 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 * 31 * @(#)ffs_inode.c 8.13 (Berkeley) 4/21/95 32 */ 33 34 #include <sys/cdefs.h> 35 __KERNEL_RCSID(0, "$NetBSD: ffs_inode.c,v 1.68 2004/08/15 07:19:56 mycroft Exp $"); 36 37 #if defined(_KERNEL_OPT) 38 #include "opt_ffs.h" 39 #include "opt_quota.h" 40 #endif 41 42 #include <sys/param.h> 43 #include <sys/systm.h> 44 #include <sys/mount.h> 45 #include <sys/proc.h> 46 #include <sys/file.h> 47 #include <sys/buf.h> 48 #include <sys/vnode.h> 49 #include <sys/kernel.h> 50 #include <sys/malloc.h> 51 #include <sys/trace.h> 52 #include <sys/resourcevar.h> 53 54 #include <ufs/ufs/quota.h> 55 #include <ufs/ufs/inode.h> 56 #include <ufs/ufs/ufsmount.h> 57 #include <ufs/ufs/ufs_extern.h> 58 #include <ufs/ufs/ufs_bswap.h> 59 60 #include <ufs/ffs/fs.h> 61 #include <ufs/ffs/ffs_extern.h> 62 63 static int ffs_indirtrunc __P((struct inode *, daddr_t, daddr_t, 64 daddr_t, int, int64_t *)); 65 66 /* 67 * Update the access, modified, and inode change times as specified 68 * by the IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. 69 * The IN_MODIFIED flag is used to specify that the inode needs to be 70 * updated but that the times have already been set. The access 71 * and modified times are taken from the second and third parameters; 72 * the inode change time is always taken from the current time. If 73 * UPDATE_WAIT flag is set, or UPDATE_DIROP is set and we are not doing 74 * softupdates, then wait for the disk write of the inode to complete. 75 */ 76 77 int 78 ffs_update(v) 79 void *v; 80 { 81 struct vop_update_args /* { 82 struct vnode *a_vp; 83 struct timespec *a_access; 84 struct timespec *a_modify; 85 int a_flags; 86 } */ *ap = v; 87 struct fs *fs; 88 struct buf *bp; 89 struct inode *ip; 90 int error; 91 struct timespec ts; 92 caddr_t cp; 93 int waitfor, flags; 94 95 if (ap->a_vp->v_mount->mnt_flag & MNT_RDONLY) 96 return (0); 97 ip = VTOI(ap->a_vp); 98 TIMEVAL_TO_TIMESPEC(&time, &ts); 99 FFS_ITIMES(ip, 100 ap->a_access ? ap->a_access : &ts, 101 ap->a_modify ? ap->a_modify : &ts, &ts); 102 if (ap->a_flags & UPDATE_CLOSE) 103 flags = ip->i_flag & (IN_MODIFIED | IN_ACCESSED); 104 else 105 flags = ip->i_flag & IN_MODIFIED; 106 if (flags == 0) 107 return (0); 108 fs = ip->i_fs; 109 110 if ((flags & IN_MODIFIED) != 0 && 111 (ap->a_vp->v_mount->mnt_flag & MNT_ASYNC) == 0) { 112 waitfor = ap->a_flags & UPDATE_WAIT; 113 if ((ap->a_flags & UPDATE_DIROP) && !DOINGSOFTDEP(ap->a_vp)) 114 waitfor |= UPDATE_WAIT; 115 } else 116 waitfor = 0; 117 118 /* 119 * Ensure that uid and gid are correct. This is a temporary 120 * fix until fsck has been changed to do the update. 121 */ 122 if (fs->fs_magic == FS_UFS1_MAGIC && /* XXX */ 123 fs->fs_old_inodefmt < FS_44INODEFMT) { /* XXX */ 124 ip->i_ffs1_ouid = ip->i_uid; /* XXX */ 125 ip->i_ffs1_ogid = ip->i_gid; /* XXX */ 126 } /* XXX */ 127 error = bread(ip->i_devvp, 128 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)), 129 (int)fs->fs_bsize, NOCRED, &bp); 130 if (error) { 131 brelse(bp); 132 return (error); 133 } 134 ip->i_flag &= ~(IN_MODIFIED | IN_ACCESSED); 135 if (DOINGSOFTDEP(ap->a_vp)) 136 softdep_update_inodeblock(ip, bp, waitfor); 137 else if (ip->i_ffs_effnlink != ip->i_nlink) 138 panic("ffs_update: bad link cnt"); 139 if (fs->fs_magic == FS_UFS1_MAGIC) { 140 cp = (caddr_t)bp->b_data + 141 (ino_to_fsbo(fs, ip->i_number) * DINODE1_SIZE); 142 #ifdef FFS_EI 143 if (UFS_FSNEEDSWAP(fs)) 144 ffs_dinode1_swap(ip->i_din.ffs1_din, 145 (struct ufs1_dinode *)cp); 146 else 147 #endif 148 memcpy(cp, ip->i_din.ffs1_din, DINODE1_SIZE); 149 } else { 150 cp = (caddr_t)bp->b_data + 151 (ino_to_fsbo(fs, ip->i_number) * DINODE2_SIZE); 152 #ifdef FFS_EI 153 if (UFS_FSNEEDSWAP(fs)) 154 ffs_dinode2_swap(ip->i_din.ffs2_din, 155 (struct ufs2_dinode *)cp); 156 else 157 #endif 158 memcpy(cp, ip->i_din.ffs2_din, DINODE2_SIZE); 159 } 160 if (waitfor) { 161 return (bwrite(bp)); 162 } else { 163 bdwrite(bp); 164 return (0); 165 } 166 } 167 168 #define SINGLE 0 /* index of single indirect block */ 169 #define DOUBLE 1 /* index of double indirect block */ 170 #define TRIPLE 2 /* index of triple indirect block */ 171 /* 172 * Truncate the inode oip to at most length size, freeing the 173 * disk blocks. 174 */ 175 int 176 ffs_truncate(v) 177 void *v; 178 { 179 struct vop_truncate_args /* { 180 struct vnode *a_vp; 181 off_t a_length; 182 int a_flags; 183 struct ucred *a_cred; 184 struct proc *a_p; 185 } */ *ap = v; 186 struct vnode *ovp = ap->a_vp; 187 struct genfs_node *gp = VTOG(ovp); 188 daddr_t lastblock; 189 struct inode *oip = VTOI(ovp); 190 daddr_t bn, lastiblock[NIADDR], indir_lbn[NIADDR]; 191 daddr_t blks[NDADDR + NIADDR]; 192 off_t length = ap->a_length; 193 struct fs *fs; 194 int offset, size, level; 195 int64_t count, blocksreleased = 0; 196 int i, ioflag, aflag, nblocks; 197 int error, allerror = 0; 198 off_t osize; 199 int sync; 200 struct ufsmount *ump = oip->i_ump; 201 202 if (length < 0) 203 return (EINVAL); 204 205 if (ovp->v_type == VLNK && 206 (oip->i_size < ump->um_maxsymlinklen || 207 (ump->um_maxsymlinklen == 0 && DIP(oip, blocks) == 0))) { 208 KDASSERT(length == 0); 209 memset(SHORTLINK(oip), 0, (size_t)oip->i_size); 210 oip->i_size = 0; 211 DIP_ASSIGN(oip, size, 0); 212 oip->i_flag |= IN_CHANGE | IN_UPDATE; 213 return (VOP_UPDATE(ovp, NULL, NULL, 0)); 214 } 215 if (oip->i_size == length) { 216 oip->i_flag |= IN_CHANGE | IN_UPDATE; 217 return (VOP_UPDATE(ovp, NULL, NULL, 0)); 218 } 219 #ifdef QUOTA 220 if ((error = getinoquota(oip)) != 0) 221 return (error); 222 #endif 223 fs = oip->i_fs; 224 if (length > ump->um_maxfilesize) 225 return (EFBIG); 226 227 if ((oip->i_flags & SF_SNAPSHOT) != 0) 228 ffs_snapremove(ovp); 229 230 osize = oip->i_size; 231 ioflag = ap->a_flags; 232 aflag = ioflag & IO_SYNC ? B_SYNC : 0; 233 234 /* 235 * Lengthen the size of the file. We must ensure that the 236 * last byte of the file is allocated. Since the smallest 237 * value of osize is 0, length will be at least 1. 238 */ 239 240 if (osize < length) { 241 if (lblkno(fs, osize) < NDADDR && 242 lblkno(fs, osize) != lblkno(fs, length) && 243 blkroundup(fs, osize) != osize) { 244 error = ufs_balloc_range(ovp, osize, 245 blkroundup(fs, osize) - osize, ap->a_cred, aflag); 246 if (error) 247 return error; 248 if (ioflag & IO_SYNC) { 249 ovp->v_size = blkroundup(fs, osize); 250 simple_lock(&ovp->v_interlock); 251 VOP_PUTPAGES(ovp, 252 trunc_page(osize & ~(fs->fs_bsize - 1)), 253 round_page(ovp->v_size), 254 PGO_CLEANIT | PGO_SYNCIO); 255 } 256 } 257 error = ufs_balloc_range(ovp, length - 1, 1, ap->a_cred, 258 aflag); 259 if (error) { 260 (void) VOP_TRUNCATE(ovp, osize, ioflag & IO_SYNC, 261 ap->a_cred, ap->a_p); 262 return (error); 263 } 264 uvm_vnp_setsize(ovp, length); 265 oip->i_flag |= IN_CHANGE | IN_UPDATE; 266 KASSERT(ovp->v_size == oip->i_size); 267 return (VOP_UPDATE(ovp, NULL, NULL, 0)); 268 } 269 270 /* 271 * When truncating a regular file down to a non-block-aligned size, 272 * we must zero the part of last block which is past the new EOF. 273 * We must synchronously flush the zeroed pages to disk 274 * since the new pages will be invalidated as soon as we 275 * inform the VM system of the new, smaller size. 276 * We must do this before acquiring the GLOCK, since fetching 277 * the pages will acquire the GLOCK internally. 278 * So there is a window where another thread could see a whole 279 * zeroed page past EOF, but that's life. 280 */ 281 282 offset = blkoff(fs, length); 283 if (ovp->v_type == VREG && offset != 0 && osize > length && 284 round_page(osize) > round_page(length)) { 285 voff_t eoz; 286 287 error = ufs_balloc_range(ovp, length - 1, 1, ap->a_cred, 288 aflag); 289 if (error) 290 return error; 291 size = blksize(fs, oip, lblkno(fs, length)); 292 eoz = MIN(lblktosize(fs, lblkno(fs, length)) + size, osize); 293 uvm_vnp_zerorange(ovp, length, eoz - length); 294 simple_lock(&ovp->v_interlock); 295 error = VOP_PUTPAGES(ovp, trunc_page(length), round_page(eoz), 296 PGO_CLEANIT | PGO_DEACTIVATE | PGO_SYNCIO); 297 if (error) 298 return error; 299 } 300 301 lockmgr(&gp->g_glock, LK_EXCLUSIVE, NULL); 302 303 if (DOINGSOFTDEP(ovp)) { 304 if (length > 0) { 305 /* 306 * If a file is only partially truncated, then 307 * we have to clean up the data structures 308 * describing the allocation past the truncation 309 * point. Finding and deallocating those structures 310 * is a lot of work. Since partial truncation occurs 311 * rarely, we solve the problem by syncing the file 312 * so that it will have no data structures left. 313 */ 314 if ((error = VOP_FSYNC(ovp, ap->a_cred, FSYNC_WAIT, 315 0, 0, ap->a_p)) != 0) { 316 lockmgr(&gp->g_glock, LK_RELEASE, NULL); 317 return (error); 318 } 319 if (oip->i_flag & IN_SPACECOUNTED) 320 fs->fs_pendingblocks -= DIP(oip, blocks); 321 } else { 322 uvm_vnp_setsize(ovp, length); 323 #ifdef QUOTA 324 (void) chkdq(oip, -DIP(oip, blocks), NOCRED, 0); 325 #endif 326 softdep_setup_freeblocks(oip, length, 0); 327 (void) vinvalbuf(ovp, 0, ap->a_cred, ap->a_p, 0, 0); 328 lockmgr(&gp->g_glock, LK_RELEASE, NULL); 329 oip->i_flag |= IN_CHANGE | IN_UPDATE; 330 return (VOP_UPDATE(ovp, NULL, NULL, 0)); 331 } 332 } 333 oip->i_size = length; 334 DIP_ASSIGN(oip, size, length); 335 uvm_vnp_setsize(ovp, length); 336 /* 337 * Calculate index into inode's block list of 338 * last direct and indirect blocks (if any) 339 * which we want to keep. Lastblock is -1 when 340 * the file is truncated to 0. 341 */ 342 lastblock = lblkno(fs, length + fs->fs_bsize - 1) - 1; 343 lastiblock[SINGLE] = lastblock - NDADDR; 344 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs); 345 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs); 346 nblocks = btodb(fs->fs_bsize); 347 /* 348 * Update file and block pointers on disk before we start freeing 349 * blocks. If we crash before free'ing blocks below, the blocks 350 * will be returned to the free list. lastiblock values are also 351 * normalized to -1 for calls to ffs_indirtrunc below. 352 */ 353 sync = 0; 354 for (level = TRIPLE; level >= SINGLE; level--) { 355 blks[NDADDR + level] = DIP(oip, ib[level]); 356 if (lastiblock[level] < 0 && blks[NDADDR + level] != 0) { 357 sync = 1; 358 DIP_ASSIGN(oip, ib[level], 0); 359 lastiblock[level] = -1; 360 } 361 } 362 for (i = 0; i < NDADDR; i++) { 363 blks[i] = DIP(oip, db[i]); 364 if (i > lastblock && blks[i] != 0) { 365 sync = 1; 366 DIP_ASSIGN(oip, db[i], 0); 367 } 368 } 369 oip->i_flag |= IN_CHANGE | IN_UPDATE; 370 if (sync) { 371 error = VOP_UPDATE(ovp, NULL, NULL, UPDATE_WAIT); 372 if (error && !allerror) 373 allerror = error; 374 } 375 376 /* 377 * Having written the new inode to disk, save its new configuration 378 * and put back the old block pointers long enough to process them. 379 * Note that we save the new block configuration so we can check it 380 * when we are done. 381 */ 382 for (i = 0; i < NDADDR; i++) { 383 bn = DIP(oip, db[i]); 384 DIP_ASSIGN(oip, db[i], blks[i]); 385 blks[i] = bn; 386 } 387 for (i = 0; i < NIADDR; i++) { 388 bn = DIP(oip, ib[i]); 389 DIP_ASSIGN(oip, ib[i], blks[NDADDR + i]); 390 blks[NDADDR + i] = bn; 391 } 392 393 oip->i_size = osize; 394 DIP_ASSIGN(oip, size, osize); 395 error = vtruncbuf(ovp, lastblock + 1, 0, 0); 396 if (error && !allerror) 397 allerror = error; 398 399 /* 400 * Indirect blocks first. 401 */ 402 indir_lbn[SINGLE] = -NDADDR; 403 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1; 404 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1; 405 for (level = TRIPLE; level >= SINGLE; level--) { 406 if (oip->i_ump->um_fstype == UFS1) 407 bn = ufs_rw32(oip->i_ffs1_ib[level],UFS_FSNEEDSWAP(fs)); 408 else 409 bn = ufs_rw64(oip->i_ffs2_ib[level],UFS_FSNEEDSWAP(fs)); 410 if (bn != 0) { 411 error = ffs_indirtrunc(oip, indir_lbn[level], 412 fsbtodb(fs, bn), lastiblock[level], level, &count); 413 if (error) 414 allerror = error; 415 blocksreleased += count; 416 if (lastiblock[level] < 0) { 417 DIP_ASSIGN(oip, ib[level], 0); 418 ffs_blkfree(fs, oip->i_devvp, bn, fs->fs_bsize, 419 oip->i_number); 420 blocksreleased += nblocks; 421 } 422 } 423 if (lastiblock[level] >= 0) 424 goto done; 425 } 426 427 /* 428 * All whole direct blocks or frags. 429 */ 430 for (i = NDADDR - 1; i > lastblock; i--) { 431 long bsize; 432 433 if (oip->i_ump->um_fstype == UFS1) 434 bn = ufs_rw32(oip->i_ffs1_db[i], UFS_FSNEEDSWAP(fs)); 435 else 436 bn = ufs_rw64(oip->i_ffs2_db[i], UFS_FSNEEDSWAP(fs)); 437 if (bn == 0) 438 continue; 439 DIP_ASSIGN(oip, db[i], 0); 440 bsize = blksize(fs, oip, i); 441 ffs_blkfree(fs, oip->i_devvp, bn, bsize, oip->i_number); 442 blocksreleased += btodb(bsize); 443 } 444 if (lastblock < 0) 445 goto done; 446 447 /* 448 * Finally, look for a change in size of the 449 * last direct block; release any frags. 450 */ 451 if (oip->i_ump->um_fstype == UFS1) 452 bn = ufs_rw32(oip->i_ffs1_db[lastblock], UFS_FSNEEDSWAP(fs)); 453 else 454 bn = ufs_rw64(oip->i_ffs2_db[lastblock], UFS_FSNEEDSWAP(fs)); 455 if (bn != 0) { 456 long oldspace, newspace; 457 458 /* 459 * Calculate amount of space we're giving 460 * back as old block size minus new block size. 461 */ 462 oldspace = blksize(fs, oip, lastblock); 463 oip->i_size = length; 464 DIP_ASSIGN(oip, size, length); 465 newspace = blksize(fs, oip, lastblock); 466 if (newspace == 0) 467 panic("itrunc: newspace"); 468 if (oldspace - newspace > 0) { 469 /* 470 * Block number of space to be free'd is 471 * the old block # plus the number of frags 472 * required for the storage we're keeping. 473 */ 474 bn += numfrags(fs, newspace); 475 ffs_blkfree(fs, oip->i_devvp, bn, oldspace - newspace, 476 oip->i_number); 477 blocksreleased += btodb(oldspace - newspace); 478 } 479 } 480 481 done: 482 #ifdef DIAGNOSTIC 483 for (level = SINGLE; level <= TRIPLE; level++) 484 if (blks[NDADDR + level] != DIP(oip, ib[level])) 485 panic("itrunc1"); 486 for (i = 0; i < NDADDR; i++) 487 if (blks[i] != DIP(oip, db[i])) 488 panic("itrunc2"); 489 if (length == 0 && 490 (!LIST_EMPTY(&ovp->v_cleanblkhd) || !LIST_EMPTY(&ovp->v_dirtyblkhd))) 491 panic("itrunc3"); 492 #endif /* DIAGNOSTIC */ 493 /* 494 * Put back the real size. 495 */ 496 oip->i_size = length; 497 DIP_ASSIGN(oip, size, length); 498 DIP_ADD(oip, blocks, -blocksreleased); 499 lockmgr(&gp->g_glock, LK_RELEASE, NULL); 500 oip->i_flag |= IN_CHANGE; 501 #ifdef QUOTA 502 (void) chkdq(oip, -blocksreleased, NOCRED, 0); 503 #endif 504 KASSERT(ovp->v_type != VREG || ovp->v_size == oip->i_size); 505 return (allerror); 506 } 507 508 /* 509 * Release blocks associated with the inode ip and stored in the indirect 510 * block bn. Blocks are free'd in LIFO order up to (but not including) 511 * lastbn. If level is greater than SINGLE, the block is an indirect block 512 * and recursive calls to indirtrunc must be used to cleanse other indirect 513 * blocks. 514 * 515 * NB: triple indirect blocks are untested. 516 */ 517 static int 518 ffs_indirtrunc(ip, lbn, dbn, lastbn, level, countp) 519 struct inode *ip; 520 daddr_t lbn, lastbn; 521 daddr_t dbn; 522 int level; 523 int64_t *countp; 524 { 525 int i; 526 struct buf *bp; 527 struct fs *fs = ip->i_fs; 528 int32_t *bap1 = NULL; 529 int64_t *bap2 = NULL; 530 struct vnode *vp; 531 daddr_t nb, nlbn, last; 532 char *copy = NULL; 533 int64_t blkcount, factor, blocksreleased = 0; 534 int nblocks; 535 int error = 0, allerror = 0; 536 #ifdef FFS_EI 537 const int needswap = UFS_FSNEEDSWAP(fs); 538 #endif 539 #define RBAP(ip, i) (((ip)->i_ump->um_fstype == UFS1) ? \ 540 ufs_rw32(bap1[i], needswap) : ufs_rw64(bap2[i], needswap)) 541 #define BAP_ASSIGN(ip, i, value) \ 542 do { \ 543 if ((ip)->i_ump->um_fstype == UFS1) \ 544 bap1[i] = (value); \ 545 else \ 546 bap2[i] = (value); \ 547 } while(0) 548 549 /* 550 * Calculate index in current block of last 551 * block to be kept. -1 indicates the entire 552 * block so we need not calculate the index. 553 */ 554 factor = 1; 555 for (i = SINGLE; i < level; i++) 556 factor *= NINDIR(fs); 557 last = lastbn; 558 if (lastbn > 0) 559 last /= factor; 560 nblocks = btodb(fs->fs_bsize); 561 /* 562 * Get buffer of block pointers, zero those entries corresponding 563 * to blocks to be free'd, and update on disk copy first. Since 564 * double(triple) indirect before single(double) indirect, calls 565 * to bmap on these blocks will fail. However, we already have 566 * the on disk address, so we have to set the b_blkno field 567 * explicitly instead of letting bread do everything for us. 568 */ 569 vp = ITOV(ip); 570 bp = getblk(vp, lbn, (int)fs->fs_bsize, 0, 0); 571 if (bp->b_flags & (B_DONE | B_DELWRI)) { 572 /* Braces must be here in case trace evaluates to nothing. */ 573 trace(TR_BREADHIT, pack(vp, fs->fs_bsize), lbn); 574 } else { 575 trace(TR_BREADMISS, pack(vp, fs->fs_bsize), lbn); 576 curproc->p_stats->p_ru.ru_inblock++; /* pay for read */ 577 bp->b_flags |= B_READ; 578 if (bp->b_bcount > bp->b_bufsize) 579 panic("ffs_indirtrunc: bad buffer size"); 580 bp->b_blkno = dbn; 581 BIO_SETPRIO(bp, BPRIO_TIMECRITICAL); 582 VOP_STRATEGY(vp, bp); 583 error = biowait(bp); 584 } 585 if (error) { 586 brelse(bp); 587 *countp = 0; 588 return (error); 589 } 590 591 if (ip->i_ump->um_fstype == UFS1) 592 bap1 = (int32_t *)bp->b_data; 593 else 594 bap2 = (int64_t *)bp->b_data; 595 if (lastbn >= 0) { 596 copy = malloc(fs->fs_bsize, M_TEMP, M_WAITOK); 597 memcpy((caddr_t)copy, bp->b_data, (u_int)fs->fs_bsize); 598 for (i = last + 1; i < NINDIR(fs); i++) 599 BAP_ASSIGN(ip, i, 0); 600 error = bwrite(bp); 601 if (error) 602 allerror = error; 603 if (ip->i_ump->um_fstype == UFS1) 604 bap1 = (int32_t *)copy; 605 else 606 bap2 = (int64_t *)copy; 607 } 608 609 /* 610 * Recursively free totally unused blocks. 611 */ 612 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 613 i--, nlbn += factor) { 614 nb = RBAP(ip, i); 615 if (nb == 0) 616 continue; 617 if (level > SINGLE) { 618 error = ffs_indirtrunc(ip, nlbn, fsbtodb(fs, nb), 619 (daddr_t)-1, level - 1, 620 &blkcount); 621 if (error) 622 allerror = error; 623 blocksreleased += blkcount; 624 } 625 ffs_blkfree(fs, ip->i_devvp, nb, fs->fs_bsize, ip->i_number); 626 blocksreleased += nblocks; 627 } 628 629 /* 630 * Recursively free last partial block. 631 */ 632 if (level > SINGLE && lastbn >= 0) { 633 last = lastbn % factor; 634 nb = RBAP(ip, i); 635 if (nb != 0) { 636 error = ffs_indirtrunc(ip, nlbn, fsbtodb(fs, nb), 637 last, level - 1, &blkcount); 638 if (error) 639 allerror = error; 640 blocksreleased += blkcount; 641 } 642 } 643 644 if (copy != NULL) { 645 FREE(copy, M_TEMP); 646 } else { 647 bp->b_flags |= B_INVAL; 648 brelse(bp); 649 } 650 651 *countp = blocksreleased; 652 return (allerror); 653 } 654
Indexes created Tue Sep 30 06:09:59 GMT 2025