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>
59 * Update the access, modified, and inode change times as specified by the
60 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
61 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
62 * the timestamp update). The IN_LAZYMOD flag is set to force a write
63 * later if not now. If we write now, then clear both IN_MODIFIED and
64 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
65 * set, then wait for the write to complete.
68 ext2_update(struct vnode *vp, int waitfor)
75 ASSERT_VOP_ELOCKED(vp, "ext2_update");
78 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0)
80 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED);
84 if ((error = bread(ip->i_devvp,
85 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
86 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) {
90 error = ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
91 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
96 if (waitfor && !DOINGASYNC(vp))
104 #define SINGLE 0 /* index of single indirect block */
105 #define DOUBLE 1 /* index of double indirect block */
106 #define TRIPLE 2 /* index of triple indirect block */
109 * Release blocks associated with the inode ip and stored in the indirect
110 * block bn. Blocks are free'd in LIFO order up to (but not including)
111 * lastbn. If level is greater than SINGLE, the block is an indirect block
112 * and recursive calls to indirtrunc must be used to cleanse other indirect
115 * NB: triple indirect blocks are untested.
118 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn,
119 daddr_t lastbn, int level, e4fs_daddr_t *countp)
122 struct m_ext2fs *fs = ip->i_e2fs;
124 e2fs_daddr_t *bap, *copy;
125 int i, nblocks, error = 0, allerror = 0;
126 e2fs_lbn_t nb, nlbn, last;
127 e4fs_daddr_t blkcount, factor, blocksreleased = 0;
130 * Calculate index in current block of last
131 * block to be kept. -1 indicates the entire
132 * block so we need not calculate the index.
135 for (i = SINGLE; i < level; i++)
136 factor *= NINDIR(fs);
140 nblocks = btodb(fs->e2fs_bsize);
142 * Get buffer of block pointers, zero those entries corresponding
143 * to blocks to be free'd, and update on disk copy first. Since
144 * double(triple) indirect before single(double) indirect, calls
145 * to bmap on these blocks will fail. However, we already have
146 * the on disk address, so we have to set the b_blkno field
147 * explicitly instead of letting bread do everything for us.
150 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
151 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) {
152 bp->b_iocmd = BIO_READ;
153 if (bp->b_bcount > bp->b_bufsize)
154 panic("ext2_indirtrunc: bad buffer size");
156 vfs_busy_pages(bp, 0);
157 bp->b_iooffset = dbtob(bp->b_blkno);
166 bap = (e2fs_daddr_t *)bp->b_data;
167 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
168 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
169 bzero((caddr_t)&bap[last + 1],
170 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
172 bp->b_flags |= B_INVAL;
173 if (DOINGASYNC(vp)) {
183 * Recursively free totally unused blocks.
185 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
186 i--, nlbn += factor) {
190 if (level > SINGLE) {
191 if ((error = ext2_indirtrunc(ip, nlbn,
192 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
194 blocksreleased += blkcount;
196 ext2_blkfree(ip, nb, fs->e2fs_bsize);
197 blocksreleased += nblocks;
201 * Recursively free last partial block.
203 if (level > SINGLE && lastbn >= 0) {
204 last = lastbn % factor;
207 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
208 last, level - 1, &blkcount)) != 0)
210 blocksreleased += blkcount;
214 *countp = blocksreleased;
219 * Truncate the inode oip to at most length size, freeing the
223 ext2_ind_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
226 struct vnode *ovp = vp;
227 e4fs_daddr_t lastblock;
229 e4fs_daddr_t bn, lbn, lastiblock[EXT2_NIADDR], indir_lbn[EXT2_NIADDR];
230 uint32_t oldblks[EXT2_NDADDR + EXT2_NIADDR];
231 uint32_t newblks[EXT2_NDADDR + EXT2_NIADDR];
234 int offset, size, level;
235 e4fs_daddr_t count, nblocks, blocksreleased = 0;
236 int error, i, allerror;
250 * Lengthen the size of the file. We must ensure that the
251 * last byte of the file is allocated. Since the smallest
252 * value of osize is 0, length will be at least 1.
254 if (osize < length) {
255 if (length > oip->i_e2fs->e2fs_maxfilesize)
257 vnode_pager_setsize(ovp, length);
258 offset = blkoff(fs, length - 1);
259 lbn = lblkno(fs, length - 1);
261 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
263 vnode_pager_setsize(vp, osize);
266 oip->i_size = length;
267 if (bp->b_bufsize == fs->e2fs_bsize)
268 bp->b_flags |= B_CLUSTEROK;
271 else if (DOINGASYNC(ovp))
275 oip->i_flag |= IN_CHANGE | IN_UPDATE;
276 return (ext2_update(ovp, !DOINGASYNC(ovp)));
279 * Shorten the size of the file. If the file is not being
280 * truncated to a block boundary, the contents of the
281 * partial block following the end of the file must be
282 * zero'ed in case it ever become accessible again because
283 * of subsequent file growth.
285 /* I don't understand the comment above */
286 offset = blkoff(fs, length);
288 oip->i_size = length;
290 lbn = lblkno(fs, length);
292 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
295 oip->i_size = length;
296 size = blksize(fs, oip, lbn);
297 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
299 if (bp->b_bufsize == fs->e2fs_bsize)
300 bp->b_flags |= B_CLUSTEROK;
303 else if (DOINGASYNC(ovp))
309 * Calculate index into inode's block list of
310 * last direct and indirect blocks (if any)
311 * which we want to keep. Lastblock is -1 when
312 * the file is truncated to 0.
314 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
315 lastiblock[SINGLE] = lastblock - EXT2_NDADDR;
316 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
317 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
318 nblocks = btodb(fs->e2fs_bsize);
320 * Update file and block pointers on disk before we start freeing
321 * blocks. If we crash before free'ing blocks below, the blocks
322 * will be returned to the free list. lastiblock values are also
323 * normalized to -1 for calls to ext2_indirtrunc below.
325 for (level = TRIPLE; level >= SINGLE; level--) {
326 oldblks[EXT2_NDADDR + level] = oip->i_ib[level];
327 if (lastiblock[level] < 0) {
328 oip->i_ib[level] = 0;
329 lastiblock[level] = -1;
332 for (i = 0; i < EXT2_NDADDR; i++) {
333 oldblks[i] = oip->i_db[i];
337 oip->i_flag |= IN_CHANGE | IN_UPDATE;
338 allerror = ext2_update(ovp, !DOINGASYNC(ovp));
341 * Having written the new inode to disk, save its new configuration
342 * and put back the old block pointers long enough to process them.
343 * Note that we save the new block configuration so we can check it
346 for (i = 0; i < EXT2_NDADDR; i++) {
347 newblks[i] = oip->i_db[i];
348 oip->i_db[i] = oldblks[i];
350 for (i = 0; i < EXT2_NIADDR; i++) {
351 newblks[EXT2_NDADDR + i] = oip->i_ib[i];
352 oip->i_ib[i] = oldblks[EXT2_NDADDR + i];
355 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize);
356 if (error && (allerror == 0))
358 vnode_pager_setsize(ovp, length);
361 * Indirect blocks first.
363 indir_lbn[SINGLE] = -EXT2_NDADDR;
364 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
365 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
366 for (level = TRIPLE; level >= SINGLE; level--) {
367 bn = oip->i_ib[level];
369 error = ext2_indirtrunc(oip, indir_lbn[level],
370 fsbtodb(fs, bn), lastiblock[level], level, &count);
373 blocksreleased += count;
374 if (lastiblock[level] < 0) {
375 oip->i_ib[level] = 0;
376 ext2_blkfree(oip, bn, fs->e2fs_fsize);
377 blocksreleased += nblocks;
380 if (lastiblock[level] >= 0)
385 * All whole direct blocks or frags.
387 for (i = EXT2_NDADDR - 1; i > lastblock; i--) {
394 bsize = blksize(fs, oip, i);
395 ext2_blkfree(oip, bn, bsize);
396 blocksreleased += btodb(bsize);
402 * Finally, look for a change in size of the
403 * last direct block; release any frags.
405 bn = oip->i_db[lastblock];
407 long oldspace, newspace;
410 * Calculate amount of space we're giving
411 * back as old block size minus new block size.
413 oldspace = blksize(fs, oip, lastblock);
414 oip->i_size = length;
415 newspace = blksize(fs, oip, lastblock);
417 panic("ext2_truncate: newspace");
418 if (oldspace - newspace > 0) {
420 * Block number of space to be free'd is
421 * the old block # plus the number of frags
422 * required for the storage we're keeping.
424 bn += numfrags(fs, newspace);
425 ext2_blkfree(oip, bn, oldspace - newspace);
426 blocksreleased += btodb(oldspace - newspace);
431 for (level = SINGLE; level <= TRIPLE; level++)
432 if (newblks[EXT2_NDADDR + level] != oip->i_ib[level])
434 for (i = 0; i < EXT2_NDADDR; i++)
435 if (newblks[i] != oip->i_db[i])
438 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
439 bo->bo_clean.bv_cnt != 0))
442 #endif /* INVARIANTS */
444 * Put back the real size.
446 oip->i_size = length;
447 if (oip->i_blocks >= blocksreleased)
448 oip->i_blocks -= blocksreleased;
451 oip->i_flag |= IN_CHANGE;
452 vnode_pager_setsize(ovp, length);
457 ext2_ext_truncate(struct vnode *vp, off_t length, int flags,
458 struct ucred *cred, struct thread *td)
460 struct vnode *ovp = vp;
465 uint32_t lbn, offset;
473 if (osize < length) {
474 if (length > oip->i_e2fs->e2fs_maxfilesize) {
477 vnode_pager_setsize(ovp, length);
478 offset = blkoff(fs, length - 1);
479 lbn = lblkno(fs, length - 1);
481 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
483 vnode_pager_setsize(vp, osize);
486 oip->i_size = length;
487 if (bp->b_bufsize == fs->e2fs_bsize)
488 bp->b_flags |= B_CLUSTEROK;
491 else if (DOINGASYNC(ovp))
495 oip->i_flag |= IN_CHANGE | IN_UPDATE;
496 return (ext2_update(ovp, !DOINGASYNC(ovp)));
499 lastblock = (length + fs->e2fs_bsize - 1) / fs->e2fs_bsize;
500 error = ext4_ext_remove_space(oip, lastblock, flags, cred, td);
504 offset = blkoff(fs, length);
506 oip->i_size = length;
508 lbn = lblkno(fs, length);
510 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
514 oip->i_size = length;
515 size = blksize(fs, oip, lbn);
516 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
518 if (bp->b_bufsize == fs->e2fs_bsize)
519 bp->b_flags |= B_CLUSTEROK;
522 else if (DOINGASYNC(ovp))
529 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize);
533 vnode_pager_setsize(ovp, length);
535 oip->i_size = length;
536 oip->i_flag |= IN_CHANGE | IN_UPDATE;
537 error = ext2_update(ovp, !DOINGASYNC(ovp));
543 * Truncate the inode ip to at most length size, freeing the
547 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
553 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
559 if (vp->v_type == VLNK &&
560 ip->i_size < vp->v_mount->mnt_maxsymlinklen) {
563 panic("ext2_truncate: partial truncate of symlink");
565 bzero((char *)&ip->i_shortlink, (u_int)ip->i_size);
567 ip->i_flag |= IN_CHANGE | IN_UPDATE;
568 return (ext2_update(vp, 1));
570 if (ip->i_size == length) {
571 ip->i_flag |= IN_CHANGE | IN_UPDATE;
572 return (ext2_update(vp, 0));
575 if (ip->i_flag & IN_E4EXTENTS)
576 error = ext2_ext_truncate(vp, length, flags, cred, td);
578 error = ext2_ind_truncate(vp, length, flags, cred, td);
584 * discard preallocated blocks
587 ext2_inactive(struct vop_inactive_args *ap)
589 struct vnode *vp = ap->a_vp;
590 struct inode *ip = VTOI(vp);
591 struct thread *td = ap->a_td;
595 * Ignore inodes related to stale file handles.
599 if (ip->i_nlink <= 0) {
600 ext2_extattr_free(ip);
601 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
602 if (!(ip->i_flag & IN_E4EXTENTS))
606 ip->i_flag |= IN_CHANGE | IN_UPDATE;
607 ext2_vfree(vp, ip->i_number, mode);
609 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
613 * If we are done with the inode, reclaim it
614 * so that it can be reused immediately.
622 * Reclaim an inode so that it can be used for other purposes.
625 ext2_reclaim(struct vop_reclaim_args *ap)
628 struct vnode *vp = ap->a_vp;
631 if (ip->i_flag & IN_LAZYMOD) {
632 ip->i_flag |= IN_MODIFIED;
636 free(vp->v_data, M_EXT2NODE);
638 vnode_destroy_vobject(vp);