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>
48 #include <vm/vm_extern.h>
50 #include <fs/ext2fs/inode.h>
51 #include <fs/ext2fs/ext2_mount.h>
52 #include <fs/ext2fs/ext2fs.h>
53 #include <fs/ext2fs/fs.h>
54 #include <fs/ext2fs/ext2_extern.h>
56 static int ext2_indirtrunc(struct inode *, int32_t, int32_t, int32_t, int,
60 * Update the access, modified, and inode change times as specified by the
61 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
62 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
63 * the timestamp update). The IN_LAZYMOD flag is set to force a write
64 * later if not now. If we write now, then clear both IN_MODIFIED and
65 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
66 * set, then wait for the write to complete.
69 ext2_update(vp, waitfor)
78 ASSERT_VOP_ELOCKED(vp, "ext2_update");
81 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0)
83 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED);
87 if ((error = bread(ip->i_devvp,
88 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
89 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) {
93 ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
94 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
95 if (waitfor && !DOINGASYNC(vp))
103 #define SINGLE 0 /* index of single indirect block */
104 #define DOUBLE 1 /* index of double indirect block */
105 #define TRIPLE 2 /* index of triple indirect block */
107 * Truncate the inode oip to at most length size, freeing the
111 ext2_truncate(vp, length, flags, cred, td)
118 struct vnode *ovp = vp;
121 int32_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
122 int32_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
126 int offset, size, level;
127 long count, nblocks, blocksreleased = 0;
128 int error, i, allerror;
134 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
139 if (ovp->v_type == VLNK &&
140 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
143 panic("ext2_truncate: partial truncate of symlink");
145 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
147 oip->i_flag |= IN_CHANGE | IN_UPDATE;
148 return (ext2_update(ovp, 1));
150 if (oip->i_size == length) {
151 oip->i_flag |= IN_CHANGE | IN_UPDATE;
152 return (ext2_update(ovp, 0));
157 * Lengthen the size of the file. We must ensure that the
158 * last byte of the file is allocated. Since the smallest
159 * value of osize is 0, length will be at least 1.
161 if (osize < length) {
162 if (length > oip->i_e2fs->e2fs_maxfilesize)
164 vnode_pager_setsize(ovp, length);
165 offset = blkoff(fs, length - 1);
166 lbn = lblkno(fs, length - 1);
168 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
170 vnode_pager_setsize(vp, osize);
173 oip->i_size = length;
174 if (bp->b_bufsize == fs->e2fs_bsize)
175 bp->b_flags |= B_CLUSTEROK;
178 else if (DOINGASYNC(ovp))
182 oip->i_flag |= IN_CHANGE | IN_UPDATE;
183 return (ext2_update(ovp, 1));
186 * Shorten the size of the file. If the file is not being
187 * truncated to a block boundry, the contents of the
188 * partial block following the end of the file must be
189 * zero'ed in case it ever become accessible again because
190 * of subsequent file growth.
192 /* I don't understand the comment above */
193 offset = blkoff(fs, length);
195 oip->i_size = length;
197 lbn = lblkno(fs, length);
199 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
202 oip->i_size = length;
203 size = blksize(fs, oip, lbn);
204 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
206 if (bp->b_bufsize == fs->e2fs_bsize)
207 bp->b_flags |= B_CLUSTEROK;
210 else if (DOINGASYNC(ovp))
216 * Calculate index into inode's block list of
217 * last direct and indirect blocks (if any)
218 * which we want to keep. Lastblock is -1 when
219 * the file is truncated to 0.
221 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
222 lastiblock[SINGLE] = lastblock - NDADDR;
223 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
224 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
225 nblocks = btodb(fs->e2fs_bsize);
227 * Update file and block pointers on disk before we start freeing
228 * blocks. If we crash before free'ing blocks below, the blocks
229 * will be returned to the free list. lastiblock values are also
230 * normalized to -1 for calls to ext2_indirtrunc below.
232 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
233 for (level = TRIPLE; level >= SINGLE; level--)
234 if (lastiblock[level] < 0) {
235 oip->i_ib[level] = 0;
236 lastiblock[level] = -1;
238 for (i = NDADDR - 1; i > lastblock; i--)
240 oip->i_flag |= IN_CHANGE | IN_UPDATE;
241 allerror = ext2_update(ovp, 1);
244 * Having written the new inode to disk, save its new configuration
245 * and put back the old block pointers long enough to process them.
246 * Note that we save the new block configuration so we can check it
249 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
250 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
252 error = vtruncbuf(ovp, cred, td, length, (int)fs->e2fs_bsize);
253 if (error && (allerror == 0))
255 vnode_pager_setsize(ovp, length);
258 * Indirect blocks first.
260 indir_lbn[SINGLE] = -NDADDR;
261 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
262 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
263 for (level = TRIPLE; level >= SINGLE; level--) {
264 bn = oip->i_ib[level];
266 error = ext2_indirtrunc(oip, indir_lbn[level],
267 fsbtodb(fs, bn), lastiblock[level], level, &count);
270 blocksreleased += count;
271 if (lastiblock[level] < 0) {
272 oip->i_ib[level] = 0;
273 ext2_blkfree(oip, bn, fs->e2fs_fsize);
274 blocksreleased += nblocks;
277 if (lastiblock[level] >= 0)
282 * All whole direct blocks or frags.
284 for (i = NDADDR - 1; i > lastblock; i--) {
291 bsize = blksize(fs, oip, i);
292 ext2_blkfree(oip, bn, bsize);
293 blocksreleased += btodb(bsize);
299 * Finally, look for a change in size of the
300 * last direct block; release any frags.
302 bn = oip->i_db[lastblock];
304 long oldspace, newspace;
307 * Calculate amount of space we're giving
308 * back as old block size minus new block size.
310 oldspace = blksize(fs, oip, lastblock);
311 oip->i_size = length;
312 newspace = blksize(fs, oip, lastblock);
314 panic("itrunc: newspace");
315 if (oldspace - newspace > 0) {
317 * Block number of space to be free'd is
318 * the old block # plus the number of frags
319 * required for the storage we're keeping.
321 bn += numfrags(fs, newspace);
322 ext2_blkfree(oip, bn, oldspace - newspace);
323 blocksreleased += btodb(oldspace - newspace);
328 for (level = SINGLE; level <= TRIPLE; level++)
329 if (newblks[NDADDR + level] != oip->i_ib[level])
331 for (i = 0; i < NDADDR; i++)
332 if (newblks[i] != oip->i_db[i])
335 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
336 bo->bo_clean.bv_cnt != 0))
339 #endif /* DIAGNOSTIC */
341 * Put back the real size.
343 oip->i_size = length;
344 oip->i_blocks -= blocksreleased;
345 if (oip->i_blocks < 0) /* sanity */
347 oip->i_flag |= IN_CHANGE;
348 vnode_pager_setsize(ovp, length);
353 * Release blocks associated with the inode ip and stored in the indirect
354 * block bn. Blocks are free'd in LIFO order up to (but not including)
355 * lastbn. If level is greater than SINGLE, the block is an indirect block
356 * and recursive calls to indirtrunc must be used to cleanse other indirect
359 * NB: triple indirect blocks are untested.
363 ext2_indirtrunc(ip, lbn, dbn, lastbn, level, countp)
371 struct m_ext2fs *fs = ip->i_e2fs;
373 int32_t *bap, *copy, nb, nlbn, last;
374 long blkcount, factor;
375 int i, nblocks, blocksreleased = 0;
376 int error = 0, allerror = 0;
379 * Calculate index in current block of last
380 * block to be kept. -1 indicates the entire
381 * block so we need not calculate the index.
384 for (i = SINGLE; i < level; i++)
385 factor *= NINDIR(fs);
389 nblocks = btodb(fs->e2fs_bsize);
391 * Get buffer of block pointers, zero those entries corresponding
392 * to blocks to be free'd, and update on disk copy first. Since
393 * double(triple) indirect before single(double) indirect, calls
394 * to bmap on these blocks will fail. However, we already have
395 * the on disk address, so we have to set the b_blkno field
396 * explicitly instead of letting bread do everything for us.
399 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
400 if (bp->b_flags & (B_DONE | B_DELWRI)) {
402 bp->b_iocmd = BIO_READ;
403 if (bp->b_bcount > bp->b_bufsize)
404 panic("ext2_indirtrunc: bad buffer size");
406 vfs_busy_pages(bp, 0);
407 bp->b_iooffset = dbtob(bp->b_blkno);
417 bap = (int32_t *)bp->b_data;
418 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
419 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
420 bzero((caddr_t)&bap[last + 1],
421 (u_int)(NINDIR(fs) - (last + 1)) * sizeof (int32_t));
423 bp->b_flags |= B_INVAL;
430 * Recursively free totally unused blocks.
432 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
433 i--, nlbn += factor) {
437 if (level > SINGLE) {
438 if ((error = ext2_indirtrunc(ip, nlbn,
439 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
441 blocksreleased += blkcount;
443 ext2_blkfree(ip, nb, fs->e2fs_bsize);
444 blocksreleased += nblocks;
448 * Recursively free last partial block.
450 if (level > SINGLE && lastbn >= 0) {
451 last = lastbn % factor;
454 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
455 last, level - 1, &blkcount)) != 0)
457 blocksreleased += blkcount;
461 *countp = blocksreleased;
466 * discard preallocated blocks
470 struct vop_inactive_args /* {
475 struct vnode *vp = ap->a_vp;
476 struct inode *ip = VTOI(vp);
477 struct thread *td = ap->a_td;
481 * Ignore inodes related to stale file handles.
485 if (ip->i_nlink <= 0) {
486 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
490 ip->i_flag |= IN_CHANGE | IN_UPDATE;
491 ext2_vfree(vp, ip->i_number, mode);
493 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
497 * If we are done with the inode, reclaim it
498 * so that it can be reused immediately.
506 * Reclaim an inode so that it can be used for other purposes.
510 struct vop_reclaim_args /* {
516 struct vnode *vp = ap->a_vp;
519 if (ip->i_flag & IN_LAZYMOD) {
520 ip->i_flag |= IN_MODIFIED;
524 free(vp->v_data, M_EXT2NODE);
526 vnode_destroy_vobject(vp);