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 * 3. 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>
56 #include <fs/ext2fs/ext2_extattr.h>
58 static int ext2_indirtrunc(struct inode *, daddr_t, daddr_t,
59 daddr_t, int, e4fs_daddr_t *);
62 * Update the access, modified, and inode change times as specified by the
63 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
64 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
65 * the timestamp update). The IN_LAZYMOD flag is set to force a write
66 * later if not now. If we write now, then clear both IN_MODIFIED and
67 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
68 * set, then wait for the write to complete.
71 ext2_update(struct vnode *vp, int 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 error = ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
94 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
99 if (waitfor && !DOINGASYNC(vp))
107 #define SINGLE 0 /* index of single indirect block */
108 #define DOUBLE 1 /* index of double indirect block */
109 #define TRIPLE 2 /* index of triple indirect block */
111 * Truncate the inode oip to at most length size, freeing the
115 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
118 struct vnode *ovp = vp;
121 int32_t bn, lbn, lastiblock[EXT2_NIADDR], indir_lbn[EXT2_NIADDR];
122 uint32_t oldblks[EXT2_NDADDR + EXT2_NIADDR];
123 uint32_t newblks[EXT2_NDADDR + EXT2_NIADDR];
126 int offset, size, level;
127 e4fs_daddr_t count, nblocks, blocksreleased = 0;
128 int error, i, allerror;
139 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
144 if (ovp->v_type == VLNK &&
145 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
148 panic("ext2_truncate: partial truncate of symlink");
150 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
152 oip->i_flag |= IN_CHANGE | IN_UPDATE;
153 return (ext2_update(ovp, 1));
155 if (oip->i_size == length) {
156 oip->i_flag |= IN_CHANGE | IN_UPDATE;
157 return (ext2_update(ovp, 0));
162 * Lengthen the size of the file. We must ensure that the
163 * last byte of the file is allocated. Since the smallest
164 * value of osize is 0, length will be at least 1.
166 if (osize < length) {
167 if (length > oip->i_e2fs->e2fs_maxfilesize)
169 vnode_pager_setsize(ovp, length);
170 offset = blkoff(fs, length - 1);
171 lbn = lblkno(fs, length - 1);
173 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
175 vnode_pager_setsize(vp, osize);
178 oip->i_size = length;
179 if (bp->b_bufsize == fs->e2fs_bsize)
180 bp->b_flags |= B_CLUSTEROK;
183 else if (DOINGASYNC(ovp))
187 oip->i_flag |= IN_CHANGE | IN_UPDATE;
188 return (ext2_update(ovp, !DOINGASYNC(ovp)));
191 * Shorten the size of the file. If the file is not being
192 * truncated to a block boundary, the contents of the
193 * partial block following the end of the file must be
194 * zero'ed in case it ever become accessible again because
195 * of subsequent file growth.
197 /* I don't understand the comment above */
198 offset = blkoff(fs, length);
200 oip->i_size = length;
202 lbn = lblkno(fs, length);
204 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
207 oip->i_size = length;
208 size = blksize(fs, oip, lbn);
209 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
211 if (bp->b_bufsize == fs->e2fs_bsize)
212 bp->b_flags |= B_CLUSTEROK;
215 else if (DOINGASYNC(ovp))
221 * Calculate index into inode's block list of
222 * last direct and indirect blocks (if any)
223 * which we want to keep. Lastblock is -1 when
224 * the file is truncated to 0.
226 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
227 lastiblock[SINGLE] = lastblock - EXT2_NDADDR;
228 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
229 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
230 nblocks = btodb(fs->e2fs_bsize);
232 * Update file and block pointers on disk before we start freeing
233 * blocks. If we crash before free'ing blocks below, the blocks
234 * will be returned to the free list. lastiblock values are also
235 * normalized to -1 for calls to ext2_indirtrunc below.
237 for (level = TRIPLE; level >= SINGLE; level--) {
238 oldblks[EXT2_NDADDR + level] = oip->i_ib[level];
239 if (lastiblock[level] < 0) {
240 oip->i_ib[level] = 0;
241 lastiblock[level] = -1;
244 for (i = 0; i < EXT2_NDADDR; i++) {
245 oldblks[i] = oip->i_db[i];
249 oip->i_flag |= IN_CHANGE | IN_UPDATE;
250 allerror = ext2_update(ovp, !DOINGASYNC(ovp));
253 * Having written the new inode to disk, save its new configuration
254 * and put back the old block pointers long enough to process them.
255 * Note that we save the new block configuration so we can check it
258 for (i = 0; i < EXT2_NDADDR; i++) {
259 newblks[i] = oip->i_db[i];
260 oip->i_db[i] = oldblks[i];
262 for (i = 0; i < EXT2_NIADDR; i++) {
263 newblks[EXT2_NDADDR + i] = oip->i_ib[i];
264 oip->i_ib[i] = oldblks[EXT2_NDADDR + i];
267 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize);
268 if (error && (allerror == 0))
270 vnode_pager_setsize(ovp, length);
273 * Indirect blocks first.
275 indir_lbn[SINGLE] = -EXT2_NDADDR;
276 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
277 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
278 for (level = TRIPLE; level >= SINGLE; level--) {
279 bn = oip->i_ib[level];
281 error = ext2_indirtrunc(oip, indir_lbn[level],
282 fsbtodb(fs, bn), lastiblock[level], level, &count);
285 blocksreleased += count;
286 if (lastiblock[level] < 0) {
287 oip->i_ib[level] = 0;
288 ext2_blkfree(oip, bn, fs->e2fs_fsize);
289 blocksreleased += nblocks;
292 if (lastiblock[level] >= 0)
297 * All whole direct blocks or frags.
299 for (i = EXT2_NDADDR - 1; i > lastblock; i--) {
306 bsize = blksize(fs, oip, i);
307 ext2_blkfree(oip, bn, bsize);
308 blocksreleased += btodb(bsize);
314 * Finally, look for a change in size of the
315 * last direct block; release any frags.
317 bn = oip->i_db[lastblock];
319 long oldspace, newspace;
322 * Calculate amount of space we're giving
323 * back as old block size minus new block size.
325 oldspace = blksize(fs, oip, lastblock);
326 oip->i_size = length;
327 newspace = blksize(fs, oip, lastblock);
329 panic("ext2_truncate: newspace");
330 if (oldspace - newspace > 0) {
332 * Block number of space to be free'd is
333 * the old block # plus the number of frags
334 * required for the storage we're keeping.
336 bn += numfrags(fs, newspace);
337 ext2_blkfree(oip, bn, oldspace - newspace);
338 blocksreleased += btodb(oldspace - newspace);
343 for (level = SINGLE; level <= TRIPLE; level++)
344 if (newblks[EXT2_NDADDR + level] != oip->i_ib[level])
346 for (i = 0; i < EXT2_NDADDR; i++)
347 if (newblks[i] != oip->i_db[i])
350 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
351 bo->bo_clean.bv_cnt != 0))
354 #endif /* INVARIANTS */
356 * Put back the real size.
358 oip->i_size = length;
359 if (oip->i_blocks >= blocksreleased)
360 oip->i_blocks -= blocksreleased;
363 oip->i_flag |= IN_CHANGE;
364 vnode_pager_setsize(ovp, length);
369 * Release blocks associated with the inode ip and stored in the indirect
370 * block bn. Blocks are free'd in LIFO order up to (but not including)
371 * lastbn. If level is greater than SINGLE, the block is an indirect block
372 * and recursive calls to indirtrunc must be used to cleanse other indirect
375 * NB: triple indirect blocks are untested.
379 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn,
380 daddr_t lastbn, int level, e4fs_daddr_t *countp)
383 struct m_ext2fs *fs = ip->i_e2fs;
385 e2fs_daddr_t *bap, *copy;
386 int i, nblocks, error = 0, allerror = 0;
387 e2fs_lbn_t nb, nlbn, last;
388 e4fs_daddr_t blkcount, factor, blocksreleased = 0;
391 * Calculate index in current block of last
392 * block to be kept. -1 indicates the entire
393 * block so we need not calculate the index.
396 for (i = SINGLE; i < level; i++)
397 factor *= NINDIR(fs);
401 nblocks = btodb(fs->e2fs_bsize);
403 * Get buffer of block pointers, zero those entries corresponding
404 * to blocks to be free'd, and update on disk copy first. Since
405 * double(triple) indirect before single(double) indirect, calls
406 * to bmap on these blocks will fail. However, we already have
407 * the on disk address, so we have to set the b_blkno field
408 * explicitly instead of letting bread do everything for us.
411 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
412 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) {
413 bp->b_iocmd = BIO_READ;
414 if (bp->b_bcount > bp->b_bufsize)
415 panic("ext2_indirtrunc: bad buffer size");
417 vfs_busy_pages(bp, 0);
418 bp->b_iooffset = dbtob(bp->b_blkno);
427 bap = (e2fs_daddr_t *)bp->b_data;
428 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
429 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
430 bzero((caddr_t)&bap[last + 1],
431 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
433 bp->b_flags |= B_INVAL;
434 if (DOINGASYNC(vp)) {
444 * Recursively free totally unused blocks.
446 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
447 i--, nlbn += factor) {
451 if (level > SINGLE) {
452 if ((error = ext2_indirtrunc(ip, nlbn,
453 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
455 blocksreleased += blkcount;
457 ext2_blkfree(ip, nb, fs->e2fs_bsize);
458 blocksreleased += nblocks;
462 * Recursively free last partial block.
464 if (level > SINGLE && lastbn >= 0) {
465 last = lastbn % factor;
468 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
469 last, level - 1, &blkcount)) != 0)
471 blocksreleased += blkcount;
475 *countp = blocksreleased;
480 * discard preallocated blocks
483 ext2_inactive(struct vop_inactive_args *ap)
485 struct vnode *vp = ap->a_vp;
486 struct inode *ip = VTOI(vp);
487 struct thread *td = ap->a_td;
491 * Ignore inodes related to stale file handles.
495 if (ip->i_nlink <= 0) {
496 ext2_extattr_free(ip);
497 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
501 ip->i_flag |= IN_CHANGE | IN_UPDATE;
502 ext2_vfree(vp, ip->i_number, mode);
504 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
508 * If we are done with the inode, reclaim it
509 * so that it can be reused immediately.
517 * Reclaim an inode so that it can be used for other purposes.
520 ext2_reclaim(struct vop_reclaim_args *ap)
523 struct vnode *vp = ap->a_vp;
526 if (ip->i_flag & IN_LAZYMOD) {
527 ip->i_flag |= IN_MODIFIED;
531 free(vp->v_data, M_EXT2NODE);
533 vnode_destroy_vobject(vp);