2 * modified for Lites 1.1
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
8 * SPDX-License-Identifier: BSD-3-Clause
10 * Copyright (c) 1982, 1986, 1989, 1993
11 * The Regents of the University of California. All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#)ffs_inode.c 8.5 (Berkeley) 12/30/93
40 #include <sys/param.h>
41 #include <sys/systm.h>
42 #include <sys/mount.h>
45 #include <sys/endian.h>
46 #include <sys/vnode.h>
47 #include <sys/malloc.h>
48 #include <sys/rwlock.h>
52 #include <vm/vm_extern.h>
54 #include <fs/ext2fs/fs.h>
55 #include <fs/ext2fs/inode.h>
56 #include <fs/ext2fs/ext2_mount.h>
57 #include <fs/ext2fs/ext2fs.h>
58 #include <fs/ext2fs/fs.h>
59 #include <fs/ext2fs/ext2_extern.h>
60 #include <fs/ext2fs/ext2_extattr.h>
63 * Update the access, modified, and inode change times as specified by the
64 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
65 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
66 * the timestamp update). The IN_LAZYMOD flag is set to force a write
67 * later if not now. If we write now, then clear both IN_MODIFIED and
68 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
69 * set, then wait for the write to complete.
72 ext2_update(struct vnode *vp, int waitfor)
79 ASSERT_VOP_ELOCKED(vp, "ext2_update");
82 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0)
84 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED);
88 if ((error = bread(ip->i_devvp,
89 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
90 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) {
94 error = ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
95 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
100 if (waitfor && !DOINGASYNC(vp))
108 #define SINGLE 0 /* index of single indirect block */
109 #define DOUBLE 1 /* index of double indirect block */
110 #define TRIPLE 2 /* index of triple indirect block */
113 * Release blocks associated with the inode ip and stored in the indirect
114 * block bn. Blocks are free'd in LIFO order up to (but not including)
115 * lastbn. If level is greater than SINGLE, the block is an indirect block
116 * and recursive calls to indirtrunc must be used to cleanse other indirect
119 * NB: triple indirect blocks are untested.
122 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn,
123 daddr_t lastbn, int level, e4fs_daddr_t *countp)
126 struct m_ext2fs *fs = ip->i_e2fs;
128 e2fs_daddr_t *bap, *copy;
129 int i, nblocks, error = 0, allerror = 0;
130 e2fs_lbn_t nb, nlbn, last;
131 e4fs_daddr_t blkcount, factor, blocksreleased = 0;
134 * Calculate index in current block of last
135 * block to be kept. -1 indicates the entire
136 * block so we need not calculate the index.
139 for (i = SINGLE; i < level; i++)
140 factor *= NINDIR(fs);
144 nblocks = btodb(fs->e2fs_bsize);
146 * Get buffer of block pointers, zero those entries corresponding
147 * to blocks to be free'd, and update on disk copy first. Since
148 * double(triple) indirect before single(double) indirect, calls
149 * to bmap on these blocks will fail. However, we already have
150 * the on disk address, so we have to set the b_blkno field
151 * explicitly instead of letting bread do everything for us.
154 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
155 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) {
156 bp->b_iocmd = BIO_READ;
157 if (bp->b_bcount > bp->b_bufsize)
158 panic("ext2_indirtrunc: bad buffer size");
160 vfs_busy_pages(bp, 0);
161 bp->b_iooffset = dbtob(bp->b_blkno);
170 bap = (e2fs_daddr_t *)bp->b_data;
171 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
172 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
173 bzero((caddr_t)&bap[last + 1],
174 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
176 bp->b_flags |= B_INVAL;
177 if (DOINGASYNC(vp)) {
187 * Recursively free totally unused blocks.
189 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
190 i--, nlbn += factor) {
191 nb = le32toh(bap[i]);
194 if (level > SINGLE) {
195 if ((error = ext2_indirtrunc(ip, nlbn,
196 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
198 blocksreleased += blkcount;
200 ext2_blkfree(ip, nb, fs->e2fs_bsize);
201 blocksreleased += nblocks;
205 * Recursively free last partial block.
207 if (level > SINGLE && lastbn >= 0) {
208 last = lastbn % factor;
209 nb = le32toh(bap[i]);
211 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
212 last, level - 1, &blkcount)) != 0)
214 blocksreleased += blkcount;
218 *countp = blocksreleased;
223 * Truncate the inode oip to at most length size, freeing the
227 ext2_ind_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
230 struct vnode *ovp = vp;
231 e4fs_daddr_t lastblock;
233 e4fs_daddr_t bn, lbn, lastiblock[EXT2_NIADDR], indir_lbn[EXT2_NIADDR];
234 uint32_t oldblks[EXT2_NDADDR + EXT2_NIADDR];
235 uint32_t newblks[EXT2_NDADDR + EXT2_NIADDR];
238 int offset, size, level;
239 e4fs_daddr_t count, nblocks, blocksreleased = 0;
240 int error, i, allerror;
254 * Lengthen the size of the file. We must ensure that the
255 * last byte of the file is allocated. Since the smallest
256 * value of osize is 0, length will be at least 1.
258 if (osize < length) {
259 if (length > oip->i_e2fs->e2fs_maxfilesize)
261 vnode_pager_setsize(ovp, length);
262 offset = blkoff(fs, length - 1);
263 lbn = lblkno(fs, length - 1);
265 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
267 vnode_pager_setsize(vp, osize);
270 oip->i_size = length;
271 if (bp->b_bufsize == fs->e2fs_bsize)
272 bp->b_flags |= B_CLUSTEROK;
275 else if (DOINGASYNC(ovp))
279 oip->i_flag |= IN_CHANGE | IN_UPDATE;
280 return (ext2_update(ovp, !DOINGASYNC(ovp)));
283 * Shorten the size of the file. If the file is not being
284 * truncated to a block boundary, the contents of the
285 * partial block following the end of the file must be
286 * zero'ed in case it ever become accessible again because
287 * of subsequent file growth.
289 /* I don't understand the comment above */
290 offset = blkoff(fs, length);
292 oip->i_size = length;
294 lbn = lblkno(fs, length);
296 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
299 oip->i_size = length;
300 size = blksize(fs, oip, lbn);
301 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
303 if (bp->b_bufsize == fs->e2fs_bsize)
304 bp->b_flags |= B_CLUSTEROK;
307 else if (DOINGASYNC(ovp))
313 * Calculate index into inode's block list of
314 * last direct and indirect blocks (if any)
315 * which we want to keep. Lastblock is -1 when
316 * the file is truncated to 0.
318 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
319 lastiblock[SINGLE] = lastblock - EXT2_NDADDR;
320 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
321 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
322 nblocks = btodb(fs->e2fs_bsize);
324 * Update file and block pointers on disk before we start freeing
325 * blocks. If we crash before free'ing blocks below, the blocks
326 * will be returned to the free list. lastiblock values are also
327 * normalized to -1 for calls to ext2_indirtrunc below.
329 for (level = TRIPLE; level >= SINGLE; level--) {
330 oldblks[EXT2_NDADDR + level] = oip->i_ib[level];
331 if (lastiblock[level] < 0) {
332 oip->i_ib[level] = 0;
333 lastiblock[level] = -1;
336 for (i = 0; i < EXT2_NDADDR; i++) {
337 oldblks[i] = oip->i_db[i];
341 oip->i_flag |= IN_CHANGE | IN_UPDATE;
342 allerror = ext2_update(ovp, !DOINGASYNC(ovp));
345 * Having written the new inode to disk, save its new configuration
346 * and put back the old block pointers long enough to process them.
347 * Note that we save the new block configuration so we can check it
350 for (i = 0; i < EXT2_NDADDR; i++) {
351 newblks[i] = oip->i_db[i];
352 oip->i_db[i] = oldblks[i];
354 for (i = 0; i < EXT2_NIADDR; i++) {
355 newblks[EXT2_NDADDR + i] = oip->i_ib[i];
356 oip->i_ib[i] = oldblks[EXT2_NDADDR + i];
359 error = vtruncbuf(ovp, length, (int)fs->e2fs_bsize);
360 if (error && (allerror == 0))
362 vnode_pager_setsize(ovp, length);
365 * Indirect blocks first.
367 indir_lbn[SINGLE] = -EXT2_NDADDR;
368 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
369 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
370 for (level = TRIPLE; level >= SINGLE; level--) {
371 bn = oip->i_ib[level];
373 error = ext2_indirtrunc(oip, indir_lbn[level],
374 fsbtodb(fs, bn), lastiblock[level], level, &count);
377 blocksreleased += count;
378 if (lastiblock[level] < 0) {
379 oip->i_ib[level] = 0;
380 ext2_blkfree(oip, bn, fs->e2fs_fsize);
381 blocksreleased += nblocks;
384 if (lastiblock[level] >= 0)
389 * All whole direct blocks or frags.
391 for (i = EXT2_NDADDR - 1; i > lastblock; i--) {
398 bsize = blksize(fs, oip, i);
399 ext2_blkfree(oip, bn, bsize);
400 blocksreleased += btodb(bsize);
406 * Finally, look for a change in size of the
407 * last direct block; release any frags.
409 bn = oip->i_db[lastblock];
411 long oldspace, newspace;
414 * Calculate amount of space we're giving
415 * back as old block size minus new block size.
417 oldspace = blksize(fs, oip, lastblock);
418 oip->i_size = length;
419 newspace = blksize(fs, oip, lastblock);
421 panic("ext2_truncate: newspace");
422 if (oldspace - newspace > 0) {
424 * Block number of space to be free'd is
425 * the old block # plus the number of frags
426 * required for the storage we're keeping.
428 bn += numfrags(fs, newspace);
429 ext2_blkfree(oip, bn, oldspace - newspace);
430 blocksreleased += btodb(oldspace - newspace);
435 for (level = SINGLE; level <= TRIPLE; level++)
436 if (newblks[EXT2_NDADDR + level] != oip->i_ib[level])
438 for (i = 0; i < EXT2_NDADDR; i++)
439 if (newblks[i] != oip->i_db[i])
442 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
443 bo->bo_clean.bv_cnt != 0))
446 #endif /* INVARIANTS */
448 * Put back the real size.
450 oip->i_size = length;
451 if (oip->i_blocks >= blocksreleased)
452 oip->i_blocks -= blocksreleased;
455 oip->i_flag |= IN_CHANGE;
456 vnode_pager_setsize(ovp, length);
461 ext2_ext_truncate(struct vnode *vp, off_t length, int flags,
462 struct ucred *cred, struct thread *td)
464 struct vnode *ovp = vp;
469 uint32_t lbn, offset;
477 if (osize < length) {
478 if (length > oip->i_e2fs->e2fs_maxfilesize) {
481 vnode_pager_setsize(ovp, length);
482 offset = blkoff(fs, length - 1);
483 lbn = lblkno(fs, length - 1);
485 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
487 vnode_pager_setsize(vp, osize);
490 oip->i_size = length;
491 if (bp->b_bufsize == fs->e2fs_bsize)
492 bp->b_flags |= B_CLUSTEROK;
495 else if (DOINGASYNC(ovp))
499 oip->i_flag |= IN_CHANGE | IN_UPDATE;
500 return (ext2_update(ovp, !DOINGASYNC(ovp)));
503 lastblock = (length + fs->e2fs_bsize - 1) / fs->e2fs_bsize;
504 error = ext4_ext_remove_space(oip, lastblock, flags, cred, td);
508 offset = blkoff(fs, length);
510 oip->i_size = length;
512 lbn = lblkno(fs, length);
514 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
518 oip->i_size = length;
519 size = blksize(fs, oip, lbn);
520 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
522 if (bp->b_bufsize == fs->e2fs_bsize)
523 bp->b_flags |= B_CLUSTEROK;
526 else if (DOINGASYNC(ovp))
533 error = vtruncbuf(ovp, length, (int)fs->e2fs_bsize);
537 vnode_pager_setsize(ovp, length);
539 oip->i_size = length;
540 oip->i_flag |= IN_CHANGE | IN_UPDATE;
541 error = ext2_update(ovp, !DOINGASYNC(ovp));
547 * Truncate the inode ip to at most length size, freeing the
551 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
557 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
563 if (vp->v_type == VLNK &&
564 ip->i_size < VFSTOEXT2(vp->v_mount)->um_e2fs->e2fs_maxsymlinklen) {
567 panic("ext2_truncate: partial truncate of symlink");
569 bzero((char *)&ip->i_shortlink, (u_int)ip->i_size);
571 ip->i_flag |= IN_CHANGE | IN_UPDATE;
572 return (ext2_update(vp, 1));
574 if (ip->i_size == length) {
575 ip->i_flag |= IN_CHANGE | IN_UPDATE;
576 return (ext2_update(vp, 0));
579 if (ip->i_flag & IN_E4EXTENTS)
580 error = ext2_ext_truncate(vp, length, flags, cred, td);
582 error = ext2_ind_truncate(vp, length, flags, cred, td);
583 cluster_init_vn(&ip->i_clusterw);
589 * discard preallocated blocks
592 ext2_inactive(struct vop_inactive_args *ap)
594 struct vnode *vp = ap->a_vp;
595 struct inode *ip = VTOI(vp);
596 struct thread *td = curthread;
600 * Ignore inodes related to stale file handles.
604 if (ip->i_nlink <= 0) {
605 ext2_extattr_free(ip);
606 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
610 ip->i_flag |= IN_CHANGE | IN_UPDATE;
611 ext2_vfree(vp, ip->i_number, mode);
613 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
617 * If we are done with the inode, reclaim it
618 * so that it can be reused immediately.
626 * Reclaim an inode so that it can be used for other purposes.
629 ext2_reclaim(struct vop_reclaim_args *ap)
632 struct vnode *vp = ap->a_vp;
635 if (ip->i_flag & IN_LAZYMOD) {
636 ip->i_flag |= IN_MODIFIED;
640 free(vp->v_data, M_EXT2NODE);