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. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)ext2_inode.c 8.5 (Berkeley) 12/30/93
40 * $FreeBSD: src/sys/gnu/ext2fs/ext2_inode.c,v 1.24.2.1 2000/08/03 00:52:57 peter Exp $
43 #include "opt_quota.h"
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/mount.h>
49 #include <sys/vnode.h>
50 #include <sys/malloc.h>
53 #include <vm/vm_extern.h>
59 #include "ext2_mount.h"
62 #include "ext2_fs_sb.h"
64 #include "ext2_extern.h"
66 static int ext2_indirtrunc (struct inode *, daddr_t, off_t, daddr_t,
70 * Update the access, modified, and inode change times as specified by the
71 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
72 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
73 * the timestamp update). The IN_LAZYMOD flag is set to force a write
74 * later if not now. If we write now, then clear both IN_MODIFIED and
75 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
76 * set, then wait for the write to complete.
79 ext2_update(struct vnode *vp, int waitfor)
81 struct ext2_sb_info *fs;
88 if ((ip->i_flag & IN_MODIFIED) == 0)
90 ip->i_flag &= ~(IN_LAZYMOD | IN_MODIFIED);
91 if (vp->v_mount->mnt_flag & MNT_RDONLY)
94 error = bread(ip->i_devvp,
95 fsbtodoff(fs, ino_to_fsba(fs, ip->i_number)),
96 (int)fs->s_blocksize, &bp);
101 ext2_di2ei( &ip->i_din, (struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE(fs) *
102 ino_to_fsbo(fs, ip->i_number)));
104 if (waitfor && (vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
115 #define SINGLE 0 /* index of single indirect block */
116 #define DOUBLE 1 /* index of double indirect block */
117 #define TRIPLE 2 /* index of triple indirect block */
119 * Truncate the inode oip to at most length size, freeing the
123 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred)
125 struct vnode *ovp = vp;
128 daddr_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
129 daddr_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
130 struct ext2_sb_info *fs;
132 int offset, size, level;
133 long count, nblocks, blocksreleased = 0;
135 int aflags, error, allerror;
138 kprintf("ext2_truncate called %d to %d\n", VTOI(ovp)->i_number, length);
140 * negative file sizes will totally break the code below and
141 * are not meaningful anyways.
147 if (ovp->v_type == VLNK &&
148 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
151 panic("ext2_truncate: partial truncate of symlink");
153 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
155 oip->i_flag |= IN_CHANGE | IN_UPDATE;
156 return (EXT2_UPDATE(ovp, 1));
158 if (oip->i_size == length) {
159 oip->i_flag |= IN_CHANGE | IN_UPDATE;
160 return (EXT2_UPDATE(ovp, 0));
163 if ((error = ext2_getinoquota(oip)) != 0)
168 ext2_discard_prealloc(oip);
170 * Lengthen the size of the file. We must ensure that the
171 * last byte of the file is allocated. Since the smallest
172 * value of osize is 0, length will be at least 1.
174 if (osize < length) {
175 offset = blkoff(fs, length - 1);
176 lbn = lblkno(fs, length - 1);
180 vnode_pager_setsize(ovp, length);
181 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, aflags);
183 vnode_pager_setsize(ovp, osize);
186 oip->i_size = length;
187 if (aflags & IO_SYNC)
191 oip->i_flag |= IN_CHANGE | IN_UPDATE;
192 return (EXT2_UPDATE(ovp, 1));
195 * Shorten the size of the file. If the file is not being
196 * truncated to a block boundry, the contents of the
197 * partial block following the end of the file must be
198 * zero'ed in case it ever become accessable again because
199 * of subsequent file growth.
201 /* I don't understand the comment above */
202 offset = blkoff(fs, length);
204 oip->i_size = length;
206 lbn = lblkno(fs, length);
210 error = ext2_balloc(oip, lbn, offset, cred, &bp, aflags);
213 oip->i_size = length;
214 size = blksize(fs, oip, lbn);
215 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
217 if (aflags & IO_SYNC)
223 * Calculate index into inode's block list of
224 * last direct and indirect blocks (if any)
225 * which we want to keep. Lastblock is -1 when
226 * the file is truncated to 0.
228 lastblock = lblkno(fs, length + fs->s_blocksize - 1) - 1;
229 lastiblock[SINGLE] = lastblock - NDADDR;
230 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
231 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
232 nblocks = btodb(fs->s_blocksize);
234 * Update file and block pointers on disk before we start freeing
235 * blocks. If we crash before free'ing blocks below, the blocks
236 * will be returned to the free list. lastiblock values are also
237 * normalized to -1 for calls to ext2_indirtrunc below.
239 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
240 for (level = TRIPLE; level >= SINGLE; level--)
241 if (lastiblock[level] < 0) {
242 oip->i_ib[level] = 0;
243 lastiblock[level] = -1;
245 for (i = NDADDR - 1; i > lastblock; i--)
247 oip->i_flag |= IN_CHANGE | IN_UPDATE;
248 allerror = EXT2_UPDATE(ovp, 1);
251 * Having written the new inode to disk, save its new configuration
252 * and put back the old block pointers long enough to process them.
253 * Note that we save the new block configuration so we can check it
256 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
257 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
259 error = vtruncbuf(ovp, length, (int)fs->s_blocksize);
260 if (error && (allerror == 0))
264 * Indirect blocks first.
266 indir_lbn[SINGLE] = -NDADDR;
267 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
268 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
269 for (level = TRIPLE; level >= SINGLE; level--) {
270 bn = oip->i_ib[level];
272 error = ext2_indirtrunc(oip, indir_lbn[level],
273 fsbtodoff(fs, bn), lastiblock[level], level, &count);
276 blocksreleased += count;
277 if (lastiblock[level] < 0) {
278 oip->i_ib[level] = 0;
279 ext2_blkfree(oip, bn, fs->s_frag_size);
280 blocksreleased += nblocks;
283 if (lastiblock[level] >= 0)
288 * All whole direct blocks or frags.
290 for (i = NDADDR - 1; i > lastblock; i--) {
297 bsize = blksize(fs, oip, i);
298 ext2_blkfree(oip, bn, bsize);
299 blocksreleased += btodb(bsize);
305 * Finally, look for a change in size of the
306 * last direct block; release any frags.
308 bn = oip->i_db[lastblock];
310 long oldspace, newspace;
313 * Calculate amount of space we're giving
314 * back as old block size minus new block size.
316 oldspace = blksize(fs, oip, lastblock);
317 oip->i_size = length;
318 newspace = blksize(fs, oip, lastblock);
320 panic("itrunc: newspace");
321 if (oldspace - newspace > 0) {
323 * Block number of space to be free'd is
324 * the old block # plus the number of frags
325 * required for the storage we're keeping.
327 bn += numfrags(fs, newspace);
328 ext2_blkfree(oip, bn, oldspace - newspace);
329 blocksreleased += btodb(oldspace - newspace);
334 for (level = SINGLE; level <= TRIPLE; level++)
335 if (newblks[NDADDR + level] != oip->i_ib[level])
337 for (i = 0; i < NDADDR; i++)
338 if (newblks[i] != oip->i_db[i])
340 if (length == 0 && (!RB_EMPTY(&ovp->v_rbdirty_tree) ||
341 !RB_EMPTY(&ovp->v_rbclean_tree)))
343 #endif /* DIAGNOSTIC */
345 * Put back the real size.
347 oip->i_size = length;
348 oip->i_blocks -= blocksreleased;
349 if (oip->i_blocks < 0) /* sanity */
351 oip->i_flag |= IN_CHANGE;
352 vnode_pager_setsize(ovp, length);
354 ext2_chkdq(oip, -blocksreleased, NOCRED, 0);
360 * Release blocks associated with the inode ip and stored in the indirect
361 * block bn. Blocks are free'd in LIFO order up to (but not including)
362 * lastbn. If level is greater than SINGLE, the block is an indirect block
363 * and recursive calls to indirtrunc must be used to cleanse other indirect
366 * NB: triple indirect blocks are untested.
370 ext2_indirtrunc(struct inode *ip, daddr_t lbn, off_t doffset, daddr_t lastbn,
371 int level, long *countp)
375 struct ext2_sb_info *fs = ip->i_e2fs;
378 daddr_t *copy, nb, nlbn, last;
379 long blkcount, factor;
380 int nblocks, blocksreleased = 0;
381 int error = 0, allerror = 0;
384 * Calculate index in current block of last
385 * block to be kept. -1 indicates the entire
386 * block so we need not calculate the index.
389 for (i = SINGLE; i < level; i++)
390 factor *= NINDIR(fs);
394 nblocks = btodb(fs->s_blocksize);
396 * Get buffer of block pointers, zero those entries corresponding
397 * to blocks to be free'd, and update on disk copy first. Since
398 * double(triple) indirect before single(double) indirect, calls
399 * to bmap on these blocks will fail. However, we already have
400 * the on disk address, so we have to set the bio_offset field
401 * explicitly instead of letting bread do everything for us.
404 bp = getblk(vp, lblktodoff(fs, lbn), (int)fs->s_blocksize, 0, 0);
405 if ((bp->b_flags & B_CACHE) == 0) {
406 bp->b_flags &= ~(B_ERROR | B_INVAL);
407 bp->b_cmd = BUF_CMD_READ;
408 if (bp->b_bcount > bp->b_bufsize)
409 panic("ext2_indirtrunc: bad buffer size");
410 bp->b_bio2.bio_offset = doffset;
411 bp->b_bio1.bio_done = biodone_sync;
412 bp->b_bio1.bio_flags |= BIO_SYNC;
413 vfs_busy_pages(bp->b_vp, bp);
414 vn_strategy(vp, &bp->b_bio1);
415 error = biowait(&bp->b_bio1, "biord");
423 bap = (daddr_t *)bp->b_data;
424 copy = kmalloc(fs->s_blocksize, M_TEMP, M_WAITOK);
425 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->s_blocksize);
426 bzero((caddr_t)&bap[last + 1],
427 (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t));
429 bp->b_flags |= B_INVAL;
436 * Recursively free totally unused blocks.
438 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
439 i--, nlbn += factor) {
443 if (level > SINGLE) {
444 if ((error = ext2_indirtrunc(ip, nlbn,
445 fsbtodoff(fs, nb), (daddr_t)-1, level - 1, &blkcount)) != 0)
447 blocksreleased += blkcount;
449 ext2_blkfree(ip, nb, fs->s_blocksize);
450 blocksreleased += nblocks;
454 * Recursively free last partial block.
456 if (level > SINGLE && lastbn >= 0) {
457 last = lastbn % factor;
460 error = ext2_indirtrunc(ip, nlbn, fsbtodoff(fs, nb),
461 last, level - 1, &blkcount);
464 blocksreleased += blkcount;
468 *countp = blocksreleased;
473 * Last reference to an inode. If necessary, write or delete it.
475 * ext2_inactive(struct vnode *a_vp)
478 ext2_inactive(struct vop_inactive_args *ap)
480 struct vnode *vp = ap->a_vp;
481 struct inode *ip = VTOI(vp);
484 ext2_discard_prealloc(ip);
485 if (prtactive && VREFCNT(vp) > 1)
486 vprint("ext2_inactive: pushing active", vp);
489 * Ignore inodes related to stale file handles.
491 if (ip == NULL || ip->i_mode == 0)
493 if (ip->i_nlink <= 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) {
495 if (!ext2_getinoquota(ip))
496 (void)ext2_chkiq(ip, -1, NOCRED, FORCE);
498 error = EXT2_TRUNCATE(vp, (off_t)0, 0, NOCRED);
502 ip->i_flag |= IN_CHANGE | IN_UPDATE;
503 EXT2_VFREE(vp, ip->i_number, mode);
505 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
509 * If we are done with the inode, reclaim it
510 * so that it can be reused immediately.
512 if (ip == NULL || ip->i_mode == 0)
518 * Reclaim an inode so that it can be used for other purposes.
520 * ext2_reclaim(struct vnode *a_vp)
523 ext2_reclaim(struct vop_reclaim_args *ap)
526 struct vnode *vp = ap->a_vp;
531 if (prtactive && VREFCNT(vp) > 1)
532 vprint("ext2_reclaim: pushing active", vp);
539 if (ip->i_flag & IN_LAZYMOD) {
540 ip->i_flag |= IN_MODIFIED;
545 if (ip && (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))) {
546 kprintf("WARNING: INODE %ld flags %08x: modified inode being released!\n", (long)ip->i_number, (int)ip->i_flag);
547 ip->i_flag |= IN_MODIFIED;
552 * Remove the inode from its hash chain and purge namecache
553 * data associated with the vnode.
563 for (i = 0; i < MAXQUOTAS; i++) {
564 if (ip->i_dquot[i] != NODQUOT) {
565 ext2_dqrele(vp, ip->i_dquot[i]);
566 ip->i_dquot[i] = NODQUOT;
571 if (ip->i_dirhash != NULL)
572 ext2dirhash_free(ip);
574 kfree(ip, VFSTOEXT2(vp->v_mount)->um_malloctype);