2 * modified for Lites 1.1
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
8 * Copyright (c) 1982, 1986, 1989, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * @(#)ffs_inode.c 8.5 (Berkeley) 12/30/93
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/mount.h>
44 #include <sys/vnode.h>
45 #include <sys/malloc.h>
46 #include <sys/rwlock.h>
49 #include <vm/vm_extern.h>
51 #include <fs/ext2fs/inode.h>
52 #include <fs/ext2fs/ext2_mount.h>
53 #include <fs/ext2fs/ext2fs.h>
54 #include <fs/ext2fs/fs.h>
55 #include <fs/ext2fs/ext2_extern.h>
57 static int ext2_indirtrunc(struct inode *, daddr_t, daddr_t,
58 daddr_t, int, e4fs_daddr_t *);
61 * Update the access, modified, and inode change times as specified by the
62 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
63 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
64 * the timestamp update). The IN_LAZYMOD flag is set to force a write
65 * later if not now. If we write now, then clear both IN_MODIFIED and
66 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
67 * set, then wait for the write to complete.
70 ext2_update(struct vnode *vp, int waitfor)
77 ASSERT_VOP_ELOCKED(vp, "ext2_update");
80 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0)
82 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED);
86 if ((error = bread(ip->i_devvp,
87 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
88 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) {
92 ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
93 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
94 if (waitfor && !DOINGASYNC(vp))
102 #define SINGLE 0 /* index of single indirect block */
103 #define DOUBLE 1 /* index of double indirect block */
104 #define TRIPLE 2 /* index of triple indirect block */
106 * Truncate the inode oip to at most length size, freeing the
110 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
113 struct vnode *ovp = vp;
116 int32_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
117 uint32_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
121 int offset, size, level;
122 e4fs_daddr_t count, nblocks, blocksreleased = 0;
123 int error, i, allerror;
129 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
134 if (ovp->v_type == VLNK &&
135 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
138 panic("ext2_truncate: partial truncate of symlink");
140 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
142 oip->i_flag |= IN_CHANGE | IN_UPDATE;
143 return (ext2_update(ovp, 1));
145 if (oip->i_size == length) {
146 oip->i_flag |= IN_CHANGE | IN_UPDATE;
147 return (ext2_update(ovp, 0));
152 * Lengthen the size of the file. We must ensure that the
153 * last byte of the file is allocated. Since the smallest
154 * value of osize is 0, length will be at least 1.
156 if (osize < length) {
157 if (length > oip->i_e2fs->e2fs_maxfilesize)
159 vnode_pager_setsize(ovp, length);
160 offset = blkoff(fs, length - 1);
161 lbn = lblkno(fs, length - 1);
163 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
165 vnode_pager_setsize(vp, osize);
168 oip->i_size = length;
169 if (bp->b_bufsize == fs->e2fs_bsize)
170 bp->b_flags |= B_CLUSTEROK;
173 else if (DOINGASYNC(ovp))
177 oip->i_flag |= IN_CHANGE | IN_UPDATE;
178 return (ext2_update(ovp, !DOINGASYNC(ovp)));
181 * Shorten the size of the file. If the file is not being
182 * truncated to a block boundry, the contents of the
183 * partial block following the end of the file must be
184 * zero'ed in case it ever become accessible again because
185 * of subsequent file growth.
187 /* I don't understand the comment above */
188 offset = blkoff(fs, length);
190 oip->i_size = length;
192 lbn = lblkno(fs, length);
194 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
197 oip->i_size = length;
198 size = blksize(fs, oip, lbn);
199 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
201 if (bp->b_bufsize == fs->e2fs_bsize)
202 bp->b_flags |= B_CLUSTEROK;
205 else if (DOINGASYNC(ovp))
211 * Calculate index into inode's block list of
212 * last direct and indirect blocks (if any)
213 * which we want to keep. Lastblock is -1 when
214 * the file is truncated to 0.
216 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
217 lastiblock[SINGLE] = lastblock - NDADDR;
218 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
219 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
220 nblocks = btodb(fs->e2fs_bsize);
222 * Update file and block pointers on disk before we start freeing
223 * blocks. If we crash before free'ing blocks below, the blocks
224 * will be returned to the free list. lastiblock values are also
225 * normalized to -1 for calls to ext2_indirtrunc below.
227 for (level = TRIPLE; level >= SINGLE; level--) {
228 oldblks[NDADDR + level] = oip->i_ib[level];
229 if (lastiblock[level] < 0) {
230 oip->i_ib[level] = 0;
231 lastiblock[level] = -1;
234 for (i = 0; i < NDADDR; i++) {
235 oldblks[i] = oip->i_db[i];
239 oip->i_flag |= IN_CHANGE | IN_UPDATE;
240 allerror = ext2_update(ovp, !DOINGASYNC(ovp));
243 * Having written the new inode to disk, save its new configuration
244 * and put back the old block pointers long enough to process them.
245 * Note that we save the new block configuration so we can check it
248 for (i = 0; i < NDADDR; i++) {
249 newblks[i] = oip->i_db[i];
250 oip->i_db[i] = oldblks[i];
252 for (i = 0; i < NIADDR; i++) {
253 newblks[NDADDR + i] = oip->i_ib[i];
254 oip->i_ib[i] = oldblks[NDADDR + i];
257 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize);
258 if (error && (allerror == 0))
260 vnode_pager_setsize(ovp, length);
263 * Indirect blocks first.
265 indir_lbn[SINGLE] = -NDADDR;
266 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
267 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
268 for (level = TRIPLE; level >= SINGLE; level--) {
269 bn = oip->i_ib[level];
271 error = ext2_indirtrunc(oip, indir_lbn[level],
272 fsbtodb(fs, bn), lastiblock[level], level, &count);
275 blocksreleased += count;
276 if (lastiblock[level] < 0) {
277 oip->i_ib[level] = 0;
278 ext2_blkfree(oip, bn, fs->e2fs_fsize);
279 blocksreleased += nblocks;
282 if (lastiblock[level] >= 0)
287 * All whole direct blocks or frags.
289 for (i = NDADDR - 1; i > lastblock; i--) {
296 bsize = blksize(fs, oip, i);
297 ext2_blkfree(oip, bn, bsize);
298 blocksreleased += btodb(bsize);
304 * Finally, look for a change in size of the
305 * last direct block; release any frags.
307 bn = oip->i_db[lastblock];
309 long oldspace, newspace;
312 * Calculate amount of space we're giving
313 * back as old block size minus new block size.
315 oldspace = blksize(fs, oip, lastblock);
316 oip->i_size = length;
317 newspace = blksize(fs, oip, lastblock);
319 panic("ext2_truncate: newspace");
320 if (oldspace - newspace > 0) {
322 * Block number of space to be free'd is
323 * the old block # plus the number of frags
324 * required for the storage we're keeping.
326 bn += numfrags(fs, newspace);
327 ext2_blkfree(oip, bn, oldspace - newspace);
328 blocksreleased += btodb(oldspace - newspace);
333 for (level = SINGLE; level <= TRIPLE; level++)
334 if (newblks[NDADDR + level] != oip->i_ib[level])
336 for (i = 0; i < NDADDR; i++)
337 if (newblks[i] != oip->i_db[i])
340 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
341 bo->bo_clean.bv_cnt != 0))
344 #endif /* INVARIANTS */
346 * Put back the real size.
348 oip->i_size = length;
349 if (oip->i_blocks >= blocksreleased)
350 oip->i_blocks -= blocksreleased;
353 oip->i_flag |= IN_CHANGE;
354 vnode_pager_setsize(ovp, length);
359 * Release blocks associated with the inode ip and stored in the indirect
360 * block bn. Blocks are free'd in LIFO order up to (but not including)
361 * lastbn. If level is greater than SINGLE, the block is an indirect block
362 * and recursive calls to indirtrunc must be used to cleanse other indirect
365 * NB: triple indirect blocks are untested.
369 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn,
370 daddr_t lastbn, int level, e4fs_daddr_t *countp)
373 struct m_ext2fs *fs = ip->i_e2fs;
375 e2fs_daddr_t *bap, *copy;
376 int i, nblocks, error = 0, allerror = 0;
377 e2fs_lbn_t nb, nlbn, last;
378 e4fs_daddr_t blkcount, factor, blocksreleased = 0;
381 * Calculate index in current block of last
382 * block to be kept. -1 indicates the entire
383 * block so we need not calculate the index.
386 for (i = SINGLE; i < level; i++)
387 factor *= NINDIR(fs);
391 nblocks = btodb(fs->e2fs_bsize);
393 * Get buffer of block pointers, zero those entries corresponding
394 * to blocks to be free'd, and update on disk copy first. Since
395 * double(triple) indirect before single(double) indirect, calls
396 * to bmap on these blocks will fail. However, we already have
397 * the on disk address, so we have to set the b_blkno field
398 * explicitly instead of letting bread do everything for us.
401 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
402 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) {
403 bp->b_iocmd = BIO_READ;
404 if (bp->b_bcount > bp->b_bufsize)
405 panic("ext2_indirtrunc: bad buffer size");
407 vfs_busy_pages(bp, 0);
408 bp->b_iooffset = dbtob(bp->b_blkno);
418 bap = (e2fs_daddr_t *)bp->b_data;
419 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
420 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
421 bzero((caddr_t)&bap[last + 1],
422 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
424 bp->b_flags |= B_INVAL;
425 if (DOINGASYNC(vp)) {
435 * Recursively free totally unused blocks.
437 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
438 i--, nlbn += factor) {
442 if (level > SINGLE) {
443 if ((error = ext2_indirtrunc(ip, nlbn,
444 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
446 blocksreleased += blkcount;
448 ext2_blkfree(ip, nb, fs->e2fs_bsize);
449 blocksreleased += nblocks;
453 * Recursively free last partial block.
455 if (level > SINGLE && lastbn >= 0) {
456 last = lastbn % factor;
459 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
460 last, level - 1, &blkcount)) != 0)
462 blocksreleased += blkcount;
466 *countp = blocksreleased;
471 * discard preallocated blocks
474 ext2_inactive(struct vop_inactive_args *ap)
476 struct vnode *vp = ap->a_vp;
477 struct inode *ip = VTOI(vp);
478 struct thread *td = ap->a_td;
482 * Ignore inodes related to stale file handles.
486 if (ip->i_nlink <= 0) {
487 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
491 ip->i_flag |= IN_CHANGE | IN_UPDATE;
492 ext2_vfree(vp, ip->i_number, mode);
494 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
498 * If we are done with the inode, reclaim it
499 * so that it can be reused immediately.
507 * Reclaim an inode so that it can be used for other purposes.
510 ext2_reclaim(struct vop_reclaim_args *ap)
513 struct vnode *vp = ap->a_vp;
516 if (ip->i_flag & IN_LAZYMOD) {
517 ip->i_flag |= IN_MODIFIED;
521 free(vp->v_data, M_EXT2NODE);
523 vnode_destroy_vobject(vp);