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 * @(#)ext2_inode.c 8.5 (Berkeley) 12/30/93
36 * $FreeBSD: src/sys/gnu/ext2fs/ext2_inode.c,v 1.24.2.1 2000/08/03 00:52:57 peter Exp $
39 #include "opt_quota.h"
41 #include <sys/param.h>
42 #include <sys/systm.h>
43 #include <sys/mount.h>
45 #include <sys/vnode.h>
46 #include <sys/malloc.h>
49 #include <vm/vm_extern.h>
55 #include "ext2_mount.h"
58 #include "ext2_fs_sb.h"
60 #include "ext2_extern.h"
62 static int ext2_indirtrunc (struct inode *, daddr_t, off_t, daddr_t,
66 * Update the access, modified, and inode change times as specified by the
67 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
68 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
69 * the timestamp update). The IN_LAZYMOD flag is set to force a write
70 * later if not now. If we write now, then clear both IN_MODIFIED and
71 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
72 * set, then wait for the write to complete.
75 ext2_update(struct vnode *vp, int waitfor)
77 struct ext2_sb_info *fs;
84 if ((ip->i_flag & IN_MODIFIED) == 0)
86 ip->i_flag &= ~(IN_LAZYMOD | IN_MODIFIED);
87 if (vp->v_mount->mnt_flag & MNT_RDONLY)
90 error = bread(ip->i_devvp,
91 fsbtodoff(fs, ino_to_fsba(fs, ip->i_number)),
92 (int)fs->s_blocksize, &bp);
97 ext2_di2ei( &ip->i_din, (struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE(fs) *
98 ino_to_fsbo(fs, ip->i_number)));
100 if (waitfor && (vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
111 #define SINGLE 0 /* index of single indirect block */
112 #define DOUBLE 1 /* index of double indirect block */
113 #define TRIPLE 2 /* index of triple indirect block */
115 * Truncate the inode oip to at most length size, freeing the
119 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred)
121 struct vnode *ovp = vp;
124 daddr_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
125 daddr_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
126 struct ext2_sb_info *fs;
128 int offset, size, level;
129 long count, nblocks, blocksreleased = 0;
131 int aflags, error, allerror;
134 kprintf("ext2_truncate called %d to %d\n", VTOI(ovp)->i_number, length);
136 * negative file sizes will totally break the code below and
137 * are not meaningful anyways.
143 if (ovp->v_type == VLNK &&
144 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
147 panic("ext2_truncate: partial truncate of symlink");
149 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
151 oip->i_flag |= IN_CHANGE | IN_UPDATE;
152 return (EXT2_UPDATE(ovp, 1));
154 if (oip->i_size == length) {
155 oip->i_flag |= IN_CHANGE | IN_UPDATE;
156 return (EXT2_UPDATE(ovp, 0));
159 if ((error = ext2_getinoquota(oip)) != 0)
164 ext2_discard_prealloc(oip);
166 * Lengthen the size of the file. We must ensure that the
167 * last byte of the file is allocated. Since the smallest
168 * value of osize is 0, length will be at least 1.
170 if (osize < length) {
171 offset = blkoff(fs, length - 1);
172 lbn = lblkno(fs, length - 1);
176 vnode_pager_setsize(ovp, length);
177 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, aflags);
179 vnode_pager_setsize(ovp, osize);
182 oip->i_size = length;
183 if (aflags & IO_SYNC)
187 oip->i_flag |= IN_CHANGE | IN_UPDATE;
188 return (EXT2_UPDATE(ovp, 1));
191 * Shorten the size of the file. If the file is not being
192 * truncated to a block boundry, the contents of the
193 * partial block following the end of the file must be
194 * zero'ed in case it ever become accessable 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);
206 error = ext2_balloc(oip, lbn, offset, cred, &bp, aflags);
209 oip->i_size = length;
210 size = blksize(fs, oip, lbn);
211 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
213 if (aflags & IO_SYNC)
219 * Calculate index into inode's block list of
220 * last direct and indirect blocks (if any)
221 * which we want to keep. Lastblock is -1 when
222 * the file is truncated to 0.
224 lastblock = lblkno(fs, length + fs->s_blocksize - 1) - 1;
225 lastiblock[SINGLE] = lastblock - NDADDR;
226 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
227 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
228 nblocks = btodb(fs->s_blocksize);
230 * Update file and block pointers on disk before we start freeing
231 * blocks. If we crash before free'ing blocks below, the blocks
232 * will be returned to the free list. lastiblock values are also
233 * normalized to -1 for calls to ext2_indirtrunc below.
235 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
236 for (level = TRIPLE; level >= SINGLE; level--)
237 if (lastiblock[level] < 0) {
238 oip->i_ib[level] = 0;
239 lastiblock[level] = -1;
241 for (i = NDADDR - 1; i > lastblock; i--)
243 oip->i_flag |= IN_CHANGE | IN_UPDATE;
244 allerror = EXT2_UPDATE(ovp, 1);
247 * Having written the new inode to disk, save its new configuration
248 * and put back the old block pointers long enough to process them.
249 * Note that we save the new block configuration so we can check it
252 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
253 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
255 error = vtruncbuf(ovp, length, (int)fs->s_blocksize);
256 if (error && (allerror == 0))
260 * Indirect blocks first.
262 indir_lbn[SINGLE] = -NDADDR;
263 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
264 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
265 for (level = TRIPLE; level >= SINGLE; level--) {
266 bn = oip->i_ib[level];
268 error = ext2_indirtrunc(oip, indir_lbn[level],
269 fsbtodoff(fs, bn), lastiblock[level], level, &count);
272 blocksreleased += count;
273 if (lastiblock[level] < 0) {
274 oip->i_ib[level] = 0;
275 ext2_blkfree(oip, bn, fs->s_frag_size);
276 blocksreleased += nblocks;
279 if (lastiblock[level] >= 0)
284 * All whole direct blocks or frags.
286 for (i = NDADDR - 1; i > lastblock; i--) {
293 bsize = blksize(fs, oip, i);
294 ext2_blkfree(oip, bn, bsize);
295 blocksreleased += btodb(bsize);
301 * Finally, look for a change in size of the
302 * last direct block; release any frags.
304 bn = oip->i_db[lastblock];
306 long oldspace, newspace;
309 * Calculate amount of space we're giving
310 * back as old block size minus new block size.
312 oldspace = blksize(fs, oip, lastblock);
313 oip->i_size = length;
314 newspace = blksize(fs, oip, lastblock);
316 panic("itrunc: newspace");
317 if (oldspace - newspace > 0) {
319 * Block number of space to be free'd is
320 * the old block # plus the number of frags
321 * required for the storage we're keeping.
323 bn += numfrags(fs, newspace);
324 ext2_blkfree(oip, bn, oldspace - newspace);
325 blocksreleased += btodb(oldspace - newspace);
330 for (level = SINGLE; level <= TRIPLE; level++)
331 if (newblks[NDADDR + level] != oip->i_ib[level])
333 for (i = 0; i < NDADDR; i++)
334 if (newblks[i] != oip->i_db[i])
336 if (length == 0 && (!RB_EMPTY(&ovp->v_rbdirty_tree) ||
337 !RB_EMPTY(&ovp->v_rbclean_tree)))
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);
350 ext2_chkdq(oip, -blocksreleased, NOCRED, 0);
356 * Release blocks associated with the inode ip and stored in the indirect
357 * block bn. Blocks are free'd in LIFO order up to (but not including)
358 * lastbn. If level is greater than SINGLE, the block is an indirect block
359 * and recursive calls to indirtrunc must be used to cleanse other indirect
362 * NB: triple indirect blocks are untested.
366 ext2_indirtrunc(struct inode *ip, daddr_t lbn, off_t doffset, daddr_t lastbn,
367 int level, long *countp)
371 struct ext2_sb_info *fs = ip->i_e2fs;
374 daddr_t *copy, nb, nlbn, last;
375 long blkcount, factor;
376 int nblocks, blocksreleased = 0;
377 int error = 0, allerror = 0;
380 * Calculate index in current block of last
381 * block to be kept. -1 indicates the entire
382 * block so we need not calculate the index.
385 for (i = SINGLE; i < level; i++)
386 factor *= NINDIR(fs);
390 nblocks = btodb(fs->s_blocksize);
392 * Get buffer of block pointers, zero those entries corresponding
393 * to blocks to be free'd, and update on disk copy first. Since
394 * double(triple) indirect before single(double) indirect, calls
395 * to bmap on these blocks will fail. However, we already have
396 * the on disk address, so we have to set the bio_offset field
397 * explicitly instead of letting bread do everything for us.
400 bp = getblk(vp, lblktodoff(fs, lbn), (int)fs->s_blocksize, 0, 0);
401 if ((bp->b_flags & B_CACHE) == 0) {
402 bp->b_flags &= ~(B_ERROR | B_INVAL);
403 bp->b_cmd = BUF_CMD_READ;
404 if (bp->b_bcount > bp->b_bufsize)
405 panic("ext2_indirtrunc: bad buffer size");
406 bp->b_bio2.bio_offset = doffset;
407 bp->b_bio1.bio_done = biodone_sync;
408 bp->b_bio1.bio_flags |= BIO_SYNC;
409 vfs_busy_pages(bp->b_vp, bp);
410 vn_strategy(vp, &bp->b_bio1);
411 error = biowait(&bp->b_bio1, "biord");
419 bap = (daddr_t *)bp->b_data;
420 copy = kmalloc(fs->s_blocksize, M_TEMP, M_WAITOK);
421 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->s_blocksize);
422 bzero((caddr_t)&bap[last + 1],
423 (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t));
425 bp->b_flags |= B_INVAL;
432 * Recursively free totally unused blocks.
434 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
435 i--, nlbn += factor) {
439 if (level > SINGLE) {
440 if ((error = ext2_indirtrunc(ip, nlbn,
441 fsbtodoff(fs, nb), (daddr_t)-1, level - 1, &blkcount)) != 0)
443 blocksreleased += blkcount;
445 ext2_blkfree(ip, nb, fs->s_blocksize);
446 blocksreleased += nblocks;
450 * Recursively free last partial block.
452 if (level > SINGLE && lastbn >= 0) {
453 last = lastbn % factor;
456 error = ext2_indirtrunc(ip, nlbn, fsbtodoff(fs, nb),
457 last, level - 1, &blkcount);
460 blocksreleased += blkcount;
464 *countp = blocksreleased;
469 * Last reference to an inode. If necessary, write or delete it.
471 * ext2_inactive(struct vnode *a_vp)
474 ext2_inactive(struct vop_inactive_args *ap)
476 struct vnode *vp = ap->a_vp;
477 struct inode *ip = VTOI(vp);
480 ext2_discard_prealloc(ip);
481 if (prtactive && VREFCNT(vp) > 1)
482 vprint("ext2_inactive: pushing active", vp);
485 * Ignore inodes related to stale file handles.
487 if (ip == NULL || ip->i_mode == 0)
489 if (ip->i_nlink <= 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) {
491 if (!ext2_getinoquota(ip))
492 (void)ext2_chkiq(ip, -1, NOCRED, FORCE);
494 error = EXT2_TRUNCATE(vp, (off_t)0, 0, NOCRED);
498 ip->i_flag |= IN_CHANGE | IN_UPDATE;
499 EXT2_VFREE(vp, ip->i_number, mode);
501 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
505 * If we are done with the inode, reclaim it
506 * so that it can be reused immediately.
508 if (ip == NULL || ip->i_mode == 0)
514 * Reclaim an inode so that it can be used for other purposes.
516 * ext2_reclaim(struct vnode *a_vp)
519 ext2_reclaim(struct vop_reclaim_args *ap)
522 struct vnode *vp = ap->a_vp;
527 if (prtactive && VREFCNT(vp) > 1)
528 vprint("ext2_reclaim: pushing active", vp);
535 if (ip->i_flag & IN_LAZYMOD) {
536 ip->i_flag |= IN_MODIFIED;
541 if (ip && (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))) {
542 kprintf("WARNING: INODE %ld flags %08x: modified inode being released!\n", (long)ip->i_number, (int)ip->i_flag);
543 ip->i_flag |= IN_MODIFIED;
548 * Remove the inode from its hash chain and purge namecache
549 * data associated with the vnode.
559 for (i = 0; i < MAXQUOTAS; i++) {
560 if (ip->i_dquot[i] != NODQUOT) {
561 ext2_dqrele(vp, ip->i_dquot[i]);
562 ip->i_dquot[i] = NODQUOT;
567 if (ip->i_dirhash != NULL)
568 ext2dirhash_free(ip);
570 kfree(ip, VFSTOEXT2(vp->v_mount)->um_malloctype);