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.8 2005/04/15 19:08:16 dillon 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 ext2_init(struct vfsconf *vfsp)
72 return (ufs_init(vfsp));
76 * Update the access, modified, and inode change times as specified by the
77 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
78 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
79 * the timestamp update). The IN_LAZYMOD flag is set to force a write
80 * later if not now. If we write now, then clear both IN_MODIFIED and
81 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
82 * set, then wait for the write to complete.
85 ext2_update(struct vnode *vp, int waitfor)
87 struct ext2_sb_info *fs;
94 if ((ip->i_flag & IN_MODIFIED) == 0)
96 ip->i_flag &= ~(IN_LAZYMOD | IN_MODIFIED);
97 if (vp->v_mount->mnt_flag & MNT_RDONLY)
100 if ((error = bread(ip->i_devvp,
101 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
102 (int)fs->s_blocksize, &bp)) != 0) {
106 ext2_di2ei( &ip->i_din, (struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE *
107 ino_to_fsbo(fs, ip->i_number)));
109 if (waitfor && (vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
120 #define SINGLE 0 /* index of single indirect block */
121 #define DOUBLE 1 /* index of double indirect block */
122 #define TRIPLE 2 /* index of triple indirect block */
124 * Truncate the inode oip to at most length size, freeing the
128 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
131 struct vnode *ovp = vp;
134 daddr_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
135 daddr_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
136 struct ext2_sb_info *fs;
138 int offset, size, level;
139 long count, nblocks, blocksreleased = 0;
141 int aflags, error, allerror;
144 printf("ext2_truncate called %d to %d\n", VTOI(ovp)->i_number, length);
146 * negative file sizes will totally break the code below and
147 * are not meaningful anyways.
153 if (ovp->v_type == VLNK &&
154 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
157 panic("ext2_truncate: partial truncate of symlink");
159 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
161 oip->i_flag |= IN_CHANGE | IN_UPDATE;
162 return (UFS_UPDATE(ovp, 1));
164 if (oip->i_size == length) {
165 oip->i_flag |= IN_CHANGE | IN_UPDATE;
166 return (UFS_UPDATE(ovp, 0));
169 if ((error = getinoquota(oip)) != 0)
174 ext2_discard_prealloc(oip);
176 * Lengthen the size of the file. We must ensure that the
177 * last byte of the file is allocated. Since the smallest
178 * value of oszie is 0, length will be at least 1.
180 if (osize < length) {
181 offset = blkoff(fs, length - 1);
182 lbn = lblkno(fs, length - 1);
186 vnode_pager_setsize(ovp, length);
187 if ((error = ext2_balloc(oip, lbn, offset + 1, cred, &bp,
190 oip->i_size = length;
191 if (aflags & IO_SYNC)
195 oip->i_flag |= IN_CHANGE | IN_UPDATE;
196 return (UFS_UPDATE(ovp, 1));
199 * Shorten the size of the file. If the file is not being
200 * truncated to a block boundry, the contents of the
201 * partial block following the end of the file must be
202 * zero'ed in case it ever become accessable again because
203 * of subsequent file growth.
205 /* I don't understand the comment above */
206 offset = blkoff(fs, length);
208 oip->i_size = length;
210 lbn = lblkno(fs, length);
214 if ((error = ext2_balloc(oip, lbn, offset, cred, &bp,
217 oip->i_size = length;
218 size = blksize(fs, oip, lbn);
219 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
221 if (aflags & IO_SYNC)
227 * Calculate index into inode's block list of
228 * last direct and indirect blocks (if any)
229 * which we want to keep. Lastblock is -1 when
230 * the file is truncated to 0.
232 lastblock = lblkno(fs, length + fs->s_blocksize - 1) - 1;
233 lastiblock[SINGLE] = lastblock - NDADDR;
234 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
235 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
236 nblocks = btodb(fs->s_blocksize);
238 * Update file and block pointers on disk before we start freeing
239 * blocks. If we crash before free'ing blocks below, the blocks
240 * will be returned to the free list. lastiblock values are also
241 * normalized to -1 for calls to ext2_indirtrunc below.
243 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
244 for (level = TRIPLE; level >= SINGLE; level--)
245 if (lastiblock[level] < 0) {
246 oip->i_ib[level] = 0;
247 lastiblock[level] = -1;
249 for (i = NDADDR - 1; i > lastblock; i--)
251 oip->i_flag |= IN_CHANGE | IN_UPDATE;
252 allerror = UFS_UPDATE(ovp, 1);
255 * Having written the new inode to disk, save its new configuration
256 * and put back the old block pointers long enough to process them.
257 * Note that we save the new block configuration so we can check it
260 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
261 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
263 error = vtruncbuf(ovp, td, length, (int)fs->s_blocksize);
264 if (error && (allerror == 0))
268 * Indirect blocks first.
270 indir_lbn[SINGLE] = -NDADDR;
271 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
272 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
273 for (level = TRIPLE; level >= SINGLE; level--) {
274 bn = oip->i_ib[level];
276 error = ext2_indirtrunc(oip, indir_lbn[level],
277 fsbtodb(fs, bn), lastiblock[level], level, &count);
280 blocksreleased += count;
281 if (lastiblock[level] < 0) {
282 oip->i_ib[level] = 0;
283 ext2_blkfree(oip, bn, fs->s_frag_size);
284 blocksreleased += nblocks;
287 if (lastiblock[level] >= 0)
292 * All whole direct blocks or frags.
294 for (i = NDADDR - 1; i > lastblock; i--) {
301 bsize = blksize(fs, oip, i);
302 ext2_blkfree(oip, bn, bsize);
303 blocksreleased += btodb(bsize);
309 * Finally, look for a change in size of the
310 * last direct block; release any frags.
312 bn = oip->i_db[lastblock];
314 long oldspace, newspace;
317 * Calculate amount of space we're giving
318 * back as old block size minus new block size.
320 oldspace = blksize(fs, oip, lastblock);
321 oip->i_size = length;
322 newspace = blksize(fs, oip, lastblock);
324 panic("itrunc: newspace");
325 if (oldspace - newspace > 0) {
327 * Block number of space to be free'd is
328 * the old block # plus the number of frags
329 * required for the storage we're keeping.
331 bn += numfrags(fs, newspace);
332 ext2_blkfree(oip, bn, oldspace - newspace);
333 blocksreleased += btodb(oldspace - newspace);
338 for (level = SINGLE; level <= TRIPLE; level++)
339 if (newblks[NDADDR + level] != oip->i_ib[level])
341 for (i = 0; i < NDADDR; i++)
342 if (newblks[i] != oip->i_db[i])
344 if (length == 0 && (!RB_EMPTY(&ovp->v_rbdirty_tree) ||
345 !RB_EMPTY(&ovp->v_rbclean_tree)))
347 #endif /* DIAGNOSTIC */
349 * Put back the real size.
351 oip->i_size = length;
352 oip->i_blocks -= blocksreleased;
353 if (oip->i_blocks < 0) /* sanity */
355 oip->i_flag |= IN_CHANGE;
356 vnode_pager_setsize(ovp, length);
358 (void) chkdq(oip, -blocksreleased, NOCRED, 0);
364 * Release blocks associated with the inode ip and stored in the indirect
365 * block bn. Blocks are free'd in LIFO order up to (but not including)
366 * lastbn. If level is greater than SINGLE, the block is an indirect block
367 * and recursive calls to indirtrunc must be used to cleanse other indirect
370 * NB: triple indirect blocks are untested.
374 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn, daddr_t lastbn,
375 int level, long *countp)
379 struct ext2_sb_info *fs = ip->i_e2fs;
382 daddr_t *copy, nb, nlbn, last;
383 long blkcount, factor;
384 int nblocks, blocksreleased = 0;
385 int error = 0, allerror = 0;
388 * Calculate index in current block of last
389 * block to be kept. -1 indicates the entire
390 * block so we need not calculate the index.
393 for (i = SINGLE; i < level; i++)
394 factor *= NINDIR(fs);
398 nblocks = btodb(fs->s_blocksize);
400 * Get buffer of block pointers, zero those entries corresponding
401 * to blocks to be free'd, and update on disk copy first. Since
402 * double(triple) indirect before single(double) indirect, calls
403 * to bmap on these blocks will fail. However, we already have
404 * the on disk address, so we have to set the b_blkno field
405 * explicitly instead of letting bread do everything for us.
408 bp = getblk(vp, lbn, (int)fs->s_blocksize, 0, 0);
409 if (bp->b_flags & (B_DONE | B_DELWRI)) {
411 bp->b_flags |= B_READ;
412 if (bp->b_bcount > bp->b_bufsize)
413 panic("ext2_indirtrunc: bad buffer size");
415 vfs_busy_pages(bp, 0);
416 VOP_STRATEGY(vp, bp);
425 bap = (daddr_t *)bp->b_data;
426 MALLOC(copy, daddr_t *, fs->s_blocksize, M_TEMP, M_WAITOK);
427 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->s_blocksize);
428 bzero((caddr_t)&bap[last + 1],
429 (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t));
431 bp->b_flags |= B_INVAL;
438 * Recursively free totally unused blocks.
440 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
441 i--, nlbn += factor) {
445 if (level > SINGLE) {
446 if ((error = ext2_indirtrunc(ip, nlbn,
447 fsbtodb(fs, nb), (daddr_t)-1, level - 1, &blkcount)) != 0)
449 blocksreleased += blkcount;
451 ext2_blkfree(ip, nb, fs->s_blocksize);
452 blocksreleased += nblocks;
456 * Recursively free last partial block.
458 if (level > SINGLE && lastbn >= 0) {
459 last = lastbn % factor;
462 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
463 last, level - 1, &blkcount)) != 0)
465 blocksreleased += blkcount;
469 *countp = blocksreleased;
474 * discard preallocated blocks
476 * ext2_inactive(struct vnode *a_vp)
479 ext2_inactive(struct vop_inactive_args *ap)
481 ext2_discard_prealloc(VTOI(ap->a_vp));
482 return ufs_inactive(ap);