1 /*-
2 * modified for Lites 1.1
3 *
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
6 */
7 /*-
8 * Copyright (c) 1982, 1986, 1989, 1993
9 * The Regents of the University of California. All rights reserved.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
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 * 4. 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.
22 *
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
33 * SUCH DAMAGE.
34 *
35 * @(#)ffs_inode.c 8.5 (Berkeley) 12/30/93
36 * $FreeBSD$
37 */
38
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/mount.h>
42 #include <sys/bio.h>
43 #include <sys/buf.h>
44 #include <sys/vnode.h>
45 #include <sys/malloc.h>
46
47 #include <vm/vm.h>
48 #include <vm/vm_extern.h>
49
50 #include <fs/ext2fs/inode.h>
51 #include <fs/ext2fs/ext2_mount.h>
52 #include <fs/ext2fs/ext2fs.h>
53 #include <fs/ext2fs/fs.h>
54 #include <fs/ext2fs/ext2_extern.h>
55
56 static int ext2_indirtrunc(struct inode *, daddr_t, daddr_t,
57 daddr_t, int, e4fs_daddr_t *);
58
59 /*
60 * Update the access, modified, and inode change times as specified by the
61 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode
62 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by
63 * the timestamp update). The IN_LAZYMOD flag is set to force a write
64 * later if not now. If we write now, then clear both IN_MODIFIED and
65 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is
66 * set, then wait for the write to complete.
67 */
68 int
69 ext2_update(struct vnode *vp, int waitfor)
70 {
71 struct m_ext2fs *fs;
72 struct buf *bp;
73 struct inode *ip;
74 int error;
75
76 ASSERT_VOP_ELOCKED(vp, "ext2_update");
77 ext2_itimes(vp);
78 ip = VTOI(vp);
79 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0)
80 return (0);
81 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED);
82 fs = ip->i_e2fs;
83 if(fs->e2fs_ronly)
84 return (0);
85 if ((error = bread(ip->i_devvp,
86 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
87 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) {
88 brelse(bp);
89 return (error);
90 }
91 ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data +
92 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number)));
93 if (waitfor && !DOINGASYNC(vp))
94 return (bwrite(bp));
95 else {
96 bdwrite(bp);
97 return (0);
98 }
99 }
100
101 #define SINGLE 0 /* index of single indirect block */
102 #define DOUBLE 1 /* index of double indirect block */
103 #define TRIPLE 2 /* index of triple indirect block */
104 /*
105 * Truncate the inode oip to at most length size, freeing the
106 * disk blocks.
107 */
108 int
109 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred,
110 struct thread *td)
111 {
112 struct vnode *ovp = vp;
113 int32_t lastblock;
114 struct inode *oip;
115 int32_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
116 uint32_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
117 struct m_ext2fs *fs;
118 struct buf *bp;
119 int offset, size, level;
120 e4fs_daddr_t count, nblocks, blocksreleased = 0;
121 int error, i, allerror;
122 off_t osize;
123 #ifdef INVARIANTS
124 struct bufobj *bo;
125 #endif
126
127 oip = VTOI(ovp);
128 #ifdef INVARIANTS
129 bo = &ovp->v_bufobj;
130 #endif
131
132 ASSERT_VOP_LOCKED(vp, "ext2_truncate");
133
134 if (length < 0)
135 return (EINVAL);
136
137 if (ovp->v_type == VLNK &&
138 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
139 #ifdef INVARIANTS
140 if (length != 0)
141 panic("ext2_truncate: partial truncate of symlink");
142 #endif
143 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
144 oip->i_size = 0;
145 oip->i_flag |= IN_CHANGE | IN_UPDATE;
146 return (ext2_update(ovp, 1));
147 }
148 if (oip->i_size == length) {
149 oip->i_flag |= IN_CHANGE | IN_UPDATE;
150 return (ext2_update(ovp, 0));
151 }
152 fs = oip->i_e2fs;
153 osize = oip->i_size;
154 /*
155 * Lengthen the size of the file. We must ensure that the
156 * last byte of the file is allocated. Since the smallest
157 * value of osize is 0, length will be at least 1.
158 */
159 if (osize < length) {
160 if (length > oip->i_e2fs->e2fs_maxfilesize)
161 return (EFBIG);
162 vnode_pager_setsize(ovp, length);
163 offset = blkoff(fs, length - 1);
164 lbn = lblkno(fs, length - 1);
165 flags |= BA_CLRBUF;
166 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags);
167 if (error) {
168 vnode_pager_setsize(vp, osize);
169 return (error);
170 }
171 oip->i_size = length;
172 if (bp->b_bufsize == fs->e2fs_bsize)
173 bp->b_flags |= B_CLUSTEROK;
174 if (flags & IO_SYNC)
175 bwrite(bp);
176 else if (DOINGASYNC(ovp))
177 bdwrite(bp);
178 else
179 bawrite(bp);
180 oip->i_flag |= IN_CHANGE | IN_UPDATE;
181 return (ext2_update(ovp, !DOINGASYNC(ovp)));
182 }
183 /*
184 * Shorten the size of the file. If the file is not being
185 * truncated to a block boundry, the contents of the
186 * partial block following the end of the file must be
187 * zero'ed in case it ever become accessible again because
188 * of subsequent file growth.
189 */
190 /* I don't understand the comment above */
191 offset = blkoff(fs, length);
192 if (offset == 0) {
193 oip->i_size = length;
194 } else {
195 lbn = lblkno(fs, length);
196 flags |= BA_CLRBUF;
197 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags);
198 if (error)
199 return (error);
200 oip->i_size = length;
201 size = blksize(fs, oip, lbn);
202 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
203 allocbuf(bp, size);
204 if (bp->b_bufsize == fs->e2fs_bsize)
205 bp->b_flags |= B_CLUSTEROK;
206 if (flags & IO_SYNC)
207 bwrite(bp);
208 else if (DOINGASYNC(ovp))
209 bdwrite(bp);
210 else
211 bawrite(bp);
212 }
213 /*
214 * Calculate index into inode's block list of
215 * last direct and indirect blocks (if any)
216 * which we want to keep. Lastblock is -1 when
217 * the file is truncated to 0.
218 */
219 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
220 lastiblock[SINGLE] = lastblock - NDADDR;
221 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
222 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
223 nblocks = btodb(fs->e2fs_bsize);
224 /*
225 * Update file and block pointers on disk before we start freeing
226 * blocks. If we crash before free'ing blocks below, the blocks
227 * will be returned to the free list. lastiblock values are also
228 * normalized to -1 for calls to ext2_indirtrunc below.
229 */
230 for (level = TRIPLE; level >= SINGLE; level--) {
231 oldblks[NDADDR + level] = oip->i_ib[level];
232 if (lastiblock[level] < 0) {
233 oip->i_ib[level] = 0;
234 lastiblock[level] = -1;
235 }
236 }
237 for (i = 0; i < NDADDR; i++) {
238 oldblks[i] = oip->i_db[i];
239 if (i > lastblock)
240 oip->i_db[i] = 0;
241 }
242 oip->i_flag |= IN_CHANGE | IN_UPDATE;
243 allerror = ext2_update(ovp, !DOINGASYNC(ovp));
244
245 /*
246 * Having written the new inode to disk, save its new configuration
247 * and put back the old block pointers long enough to process them.
248 * Note that we save the new block configuration so we can check it
249 * when we are done.
250 */
251 for (i = 0; i < NDADDR; i++) {
252 newblks[i] = oip->i_db[i];
253 oip->i_db[i] = oldblks[i];
254 }
255 for (i = 0; i < NIADDR; i++) {
256 newblks[NDADDR + i] = oip->i_ib[i];
257 oip->i_ib[i] = oldblks[NDADDR + i];
258 }
259 oip->i_size = osize;
260 error = vtruncbuf(ovp, cred, td, length, (int)fs->e2fs_bsize);
261 if (error && (allerror == 0))
262 allerror = error;
263 vnode_pager_setsize(ovp, length);
264
265 /*
266 * Indirect blocks first.
267 */
268 indir_lbn[SINGLE] = -NDADDR;
269 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
270 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
271 for (level = TRIPLE; level >= SINGLE; level--) {
272 bn = oip->i_ib[level];
273 if (bn != 0) {
274 error = ext2_indirtrunc(oip, indir_lbn[level],
275 fsbtodb(fs, bn), lastiblock[level], level, &count);
276 if (error)
277 allerror = error;
278 blocksreleased += count;
279 if (lastiblock[level] < 0) {
280 oip->i_ib[level] = 0;
281 ext2_blkfree(oip, bn, fs->e2fs_fsize);
282 blocksreleased += nblocks;
283 }
284 }
285 if (lastiblock[level] >= 0)
286 goto done;
287 }
288
289 /*
290 * All whole direct blocks or frags.
291 */
292 for (i = NDADDR - 1; i > lastblock; i--) {
293 long bsize;
294
295 bn = oip->i_db[i];
296 if (bn == 0)
297 continue;
298 oip->i_db[i] = 0;
299 bsize = blksize(fs, oip, i);
300 ext2_blkfree(oip, bn, bsize);
301 blocksreleased += btodb(bsize);
302 }
303 if (lastblock < 0)
304 goto done;
305
306 /*
307 * Finally, look for a change in size of the
308 * last direct block; release any frags.
309 */
310 bn = oip->i_db[lastblock];
311 if (bn != 0) {
312 long oldspace, newspace;
313
314 /*
315 * Calculate amount of space we're giving
316 * back as old block size minus new block size.
317 */
318 oldspace = blksize(fs, oip, lastblock);
319 oip->i_size = length;
320 newspace = blksize(fs, oip, lastblock);
321 if (newspace == 0)
322 panic("ext2_truncate: newspace");
323 if (oldspace - newspace > 0) {
324 /*
325 * Block number of space to be free'd is
326 * the old block # plus the number of frags
327 * required for the storage we're keeping.
328 */
329 bn += numfrags(fs, newspace);
330 ext2_blkfree(oip, bn, oldspace - newspace);
331 blocksreleased += btodb(oldspace - newspace);
332 }
333 }
334 done:
335 #ifdef INVARIANTS
336 for (level = SINGLE; level <= TRIPLE; level++)
337 if (newblks[NDADDR + level] != oip->i_ib[level])
338 panic("itrunc1");
339 for (i = 0; i < NDADDR; i++)
340 if (newblks[i] != oip->i_db[i])
341 panic("itrunc2");
342 BO_LOCK(bo);
343 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 ||
344 bo->bo_clean.bv_cnt != 0))
345 panic("itrunc3");
346 BO_UNLOCK(bo);
347 #endif /* INVARIANTS */
348 /*
349 * Put back the real size.
350 */
351 oip->i_size = length;
352 if (oip->i_blocks >= blocksreleased)
353 oip->i_blocks -= blocksreleased;
354 else /* sanity */
355 oip->i_blocks = 0;
356 oip->i_flag |= IN_CHANGE;
357 vnode_pager_setsize(ovp, length);
358 return (allerror);
359 }
360
361 /*
362 * Release blocks associated with the inode ip and stored in the indirect
363 * block bn. Blocks are free'd in LIFO order up to (but not including)
364 * lastbn. If level is greater than SINGLE, the block is an indirect block
365 * and recursive calls to indirtrunc must be used to cleanse other indirect
366 * blocks.
367 *
368 * NB: triple indirect blocks are untested.
369 */
370
371 static int
372 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn,
373 daddr_t lastbn, int level, e4fs_daddr_t *countp)
374 {
375 struct buf *bp;
376 struct m_ext2fs *fs = ip->i_e2fs;
377 struct vnode *vp;
378 e2fs_daddr_t *bap, *copy;
379 int i, nblocks, error = 0, allerror = 0;
380 e2fs_lbn_t nb, nlbn, last;
381 e4fs_daddr_t blkcount, factor, blocksreleased = 0;
382
383 /*
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.
387 */
388 factor = 1;
389 for (i = SINGLE; i < level; i++)
390 factor *= NINDIR(fs);
391 last = lastbn;
392 if (lastbn > 0)
393 last /= factor;
394 nblocks = btodb(fs->e2fs_bsize);
395 /*
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 b_blkno field
401 * explicitly instead of letting bread do everything for us.
402 */
403 vp = ITOV(ip);
404 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0);
405 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) {
406 bp->b_iocmd = BIO_READ;
407 if (bp->b_bcount > bp->b_bufsize)
408 panic("ext2_indirtrunc: bad buffer size");
409 bp->b_blkno = dbn;
410 vfs_busy_pages(bp, 0);
411 bp->b_iooffset = dbtob(bp->b_blkno);
412 bstrategy(bp);
413 error = bufwait(bp);
414 }
415 if (error) {
416 brelse(bp);
417 *countp = 0;
418 return (error);
419 }
420
421 bap = (e2fs_daddr_t *)bp->b_data;
422 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK);
423 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize);
424 bzero((caddr_t)&bap[last + 1],
425 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
426 if (last == -1)
427 bp->b_flags |= B_INVAL;
428 if (DOINGASYNC(vp)) {
429 bdwrite(bp);
430 } else {
431 error = bwrite(bp);
432 if (error)
433 allerror = error;
434 }
435 bap = copy;
436
437 /*
438 * Recursively free totally unused blocks.
439 */
440 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
441 i--, nlbn += factor) {
442 nb = bap[i];
443 if (nb == 0)
444 continue;
445 if (level > SINGLE) {
446 if ((error = ext2_indirtrunc(ip, nlbn,
447 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0)
448 allerror = error;
449 blocksreleased += blkcount;
450 }
451 ext2_blkfree(ip, nb, fs->e2fs_bsize);
452 blocksreleased += nblocks;
453 }
454
455 /*
456 * Recursively free last partial block.
457 */
458 if (level > SINGLE && lastbn >= 0) {
459 last = lastbn % factor;
460 nb = bap[i];
461 if (nb != 0) {
462 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
463 last, level - 1, &blkcount)) != 0)
464 allerror = error;
465 blocksreleased += blkcount;
466 }
467 }
468 free(copy, M_TEMP);
469 *countp = blocksreleased;
470 return (allerror);
471 }
472
473 /*
474 * discard preallocated blocks
475 */
476 int
477 ext2_inactive(struct vop_inactive_args *ap)
478 {
479 struct vnode *vp = ap->a_vp;
480 struct inode *ip = VTOI(vp);
481 struct thread *td = ap->a_td;
482 int mode, error = 0;
483
484 /*
485 * Ignore inodes related to stale file handles.
486 */
487 if (ip->i_mode == 0)
488 goto out;
489 if (ip->i_nlink <= 0) {
490 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td);
491 ip->i_rdev = 0;
492 mode = ip->i_mode;
493 ip->i_mode = 0;
494 ip->i_flag |= IN_CHANGE | IN_UPDATE;
495 ext2_vfree(vp, ip->i_number, mode);
496 }
497 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))
498 ext2_update(vp, 0);
499 out:
500 /*
501 * If we are done with the inode, reclaim it
502 * so that it can be reused immediately.
503 */
504 if (ip->i_mode == 0)
505 vrecycle(vp, td);
506 return (error);
507 }
508
509 /*
510 * Reclaim an inode so that it can be used for other purposes.
511 */
512 int
513 ext2_reclaim(struct vop_reclaim_args *ap)
514 {
515 struct inode *ip;
516 struct vnode *vp = ap->a_vp;
517
518 ip = VTOI(vp);
519 if (ip->i_flag & IN_LAZYMOD) {
520 ip->i_flag |= IN_MODIFIED;
521 ext2_update(vp, 0);
522 }
523 vfs_hash_remove(vp);
524 free(vp->v_data, M_EXT2NODE);
525 vp->v_data = 0;
526 vnode_destroy_vobject(vp);
527 return (0);
528 }
Cache object: 623d79bfb37b0d36957c542251d3d7de
|