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 $
41 * $DragonFly: src/sys/vfs/gnu/ext2fs/ext2_inode.c,v 1.9 2005/07/26 15:43:35 hmp Exp $
44 #include "opt_quota.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/mount.h>
50 #include <sys/vnode.h>
51 #include <sys/malloc.h>
54 #include <vm/vm_extern.h>
56 #include <vfs/ufs/quota.h>
57 #include <vfs/ufs/inode.h>
58 #include <vfs/ufs/ufsmount.h>
59 #include <vfs/ufs/ufs_extern.h>
62 #include "ext2_fs_sb.h"
64 #include "ext2_extern.h"
66 static int ext2_indirtrunc (struct inode *, daddr_t, daddr_t, daddr_t, int,
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 if ((error = bread(ip->i_devvp,
95 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
96 (int)fs->s_blocksize, &bp)) != 0) {
100 ext2_di2ei( &ip->i_din, (struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE *
101 ino_to_fsbo(fs, ip->i_number)));
103 if (waitfor && (vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
114 #define SINGLE 0 /* index of single indirect block */
115 #define DOUBLE 1 /* index of double indirect block */
116 #define TRIPLE 2 /* index of triple indirect block */
118 * Truncate the inode oip to at most length size, freeing the
122 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 printf("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 (UFS_UPDATE(ovp, 1));
158 if (oip->i_size == length) {
159 oip->i_flag |= IN_CHANGE | IN_UPDATE;
160 return (UFS_UPDATE(ovp, 0));
163 if ((error = 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 oszie 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 if ((error = ext2_balloc(oip, lbn, offset + 1, cred, &bp,
184 oip->i_size = length;
185 if (aflags & IO_SYNC)
189 oip->i_flag |= IN_CHANGE | IN_UPDATE;
190 return (UFS_UPDATE(ovp, 1));
193 * Shorten the size of the file. If the file is not being
194 * truncated to a block boundry, the contents of the
195 * partial block following the end of the file must be
196 * zero'ed in case it ever become accessable again because
197 * of subsequent file growth.
199 /* I don't understand the comment above */
200 offset = blkoff(fs, length);
202 oip->i_size = length;
204 lbn = lblkno(fs, length);
208 if ((error = ext2_balloc(oip, lbn, offset, cred, &bp,
211 oip->i_size = length;
212 size = blksize(fs, oip, lbn);
213 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
215 if (aflags & IO_SYNC)
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->s_blocksize - 1) - 1;
227 lastiblock[SINGLE] = lastblock - NDADDR;
228 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
229 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
230 nblocks = btodb(fs->s_blocksize);
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 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
238 for (level = TRIPLE; level >= SINGLE; level--)
239 if (lastiblock[level] < 0) {
240 oip->i_ib[level] = 0;
241 lastiblock[level] = -1;
243 for (i = NDADDR - 1; i > lastblock; i--)
245 oip->i_flag |= IN_CHANGE | IN_UPDATE;
246 allerror = UFS_UPDATE(ovp, 1);
249 * Having written the new inode to disk, save its new configuration
250 * and put back the old block pointers long enough to process them.
251 * Note that we save the new block configuration so we can check it
254 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
255 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
257 error = vtruncbuf(ovp, td, length, (int)fs->s_blocksize);
258 if (error && (allerror == 0))
262 * Indirect blocks first.
264 indir_lbn[SINGLE] = -NDADDR;
265 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
266 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
267 for (level = TRIPLE; level >= SINGLE; level--) {
268 bn = oip->i_ib[level];
270 error = ext2_indirtrunc(oip, indir_lbn[level],
271 fsbtodb(fs, bn), lastiblock[level], level, &count);
274 blocksreleased += count;
275 if (lastiblock[level] < 0) {
276 oip->i_ib[level] = 0;
277 ext2_blkfree(oip, bn, fs->s_frag_size);
278 blocksreleased += nblocks;
281 if (lastiblock[level] >= 0)
286 * All whole direct blocks or frags.
288 for (i = NDADDR - 1; i > lastblock; i--) {
295 bsize = blksize(fs, oip, i);
296 ext2_blkfree(oip, bn, bsize);
297 blocksreleased += btodb(bsize);
303 * Finally, look for a change in size of the
304 * last direct block; release any frags.
306 bn = oip->i_db[lastblock];
308 long oldspace, newspace;
311 * Calculate amount of space we're giving
312 * back as old block size minus new block size.
314 oldspace = blksize(fs, oip, lastblock);
315 oip->i_size = length;
316 newspace = blksize(fs, oip, lastblock);
318 panic("itrunc: newspace");
319 if (oldspace - newspace > 0) {
321 * Block number of space to be free'd is
322 * the old block # plus the number of frags
323 * required for the storage we're keeping.
325 bn += numfrags(fs, newspace);
326 ext2_blkfree(oip, bn, oldspace - newspace);
327 blocksreleased += btodb(oldspace - newspace);
332 for (level = SINGLE; level <= TRIPLE; level++)
333 if (newblks[NDADDR + level] != oip->i_ib[level])
335 for (i = 0; i < NDADDR; i++)
336 if (newblks[i] != oip->i_db[i])
338 if (length == 0 && (!RB_EMPTY(&ovp->v_rbdirty_tree) ||
339 !RB_EMPTY(&ovp->v_rbclean_tree)))
341 #endif /* DIAGNOSTIC */
343 * Put back the real size.
345 oip->i_size = length;
346 oip->i_blocks -= blocksreleased;
347 if (oip->i_blocks < 0) /* sanity */
349 oip->i_flag |= IN_CHANGE;
350 vnode_pager_setsize(ovp, length);
352 (void) chkdq(oip, -blocksreleased, NOCRED, 0);
358 * Release blocks associated with the inode ip and stored in the indirect
359 * block bn. Blocks are free'd in LIFO order up to (but not including)
360 * lastbn. If level is greater than SINGLE, the block is an indirect block
361 * and recursive calls to indirtrunc must be used to cleanse other indirect
364 * NB: triple indirect blocks are untested.
368 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn, daddr_t lastbn,
369 int level, long *countp)
373 struct ext2_sb_info *fs = ip->i_e2fs;
376 daddr_t *copy, nb, nlbn, last;
377 long blkcount, factor;
378 int nblocks, blocksreleased = 0;
379 int error = 0, allerror = 0;
382 * Calculate index in current block of last
383 * block to be kept. -1 indicates the entire
384 * block so we need not calculate the index.
387 for (i = SINGLE; i < level; i++)
388 factor *= NINDIR(fs);
392 nblocks = btodb(fs->s_blocksize);
394 * Get buffer of block pointers, zero those entries corresponding
395 * to blocks to be free'd, and update on disk copy first. Since
396 * double(triple) indirect before single(double) indirect, calls
397 * to bmap on these blocks will fail. However, we already have
398 * the on disk address, so we have to set the b_blkno field
399 * explicitly instead of letting bread do everything for us.
402 bp = getblk(vp, lbn, (int)fs->s_blocksize, 0, 0);
403 if (bp->b_flags & (B_DONE | B_DELWRI)) {
405 bp->b_flags |= B_READ;
406 if (bp->b_bcount > bp->b_bufsize)
407 panic("ext2_indirtrunc: bad buffer size");
409 vfs_busy_pages(bp, 0);
410 VOP_STRATEGY(vp, bp);
419 bap = (daddr_t *)bp->b_data;
420 MALLOC(copy, daddr_t *, 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 fsbtodb(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 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
457 last, level - 1, &blkcount)) != 0)
459 blocksreleased += blkcount;
463 *countp = blocksreleased;
468 * discard preallocated blocks
470 * ext2_inactive(struct vnode *a_vp)
473 ext2_inactive(struct vop_inactive_args *ap)
475 ext2_discard_prealloc(VTOI(ap->a_vp));
476 return ufs_inactive(ap);