__P()!=wanted, remove old style prototypes from the vfs subtree
[dragonfly.git] / sys / vfs / gnu / ext2fs / ext2_inode.c
CommitLineData
984263bc
MD
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 * 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.
26 *
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
37 * SUCH DAMAGE.
38 *
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 $
a6ee311a 41 * $DragonFly: src/sys/vfs/gnu/ext2fs/ext2_inode.c,v 1.6 2003/08/20 09:56:31 rob Exp $
984263bc
MD
42 */
43
44#include "opt_quota.h"
45
46#include <sys/param.h>
47#include <sys/systm.h>
48#include <sys/mount.h>
49#include <sys/buf.h>
50#include <sys/vnode.h>
51#include <sys/malloc.h>
52
53#include <vm/vm.h>
54#include <vm/vm_extern.h>
55
1f2de5d4
MD
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>
984263bc 60
1f2de5d4
MD
61#include "ext2_fs.h"
62#include "ext2_fs_sb.h"
63#include "fs.h"
64#include "ext2_extern.h"
984263bc 65
a6ee311a
RG
66static int ext2_indirtrunc (struct inode *, daddr_t, daddr_t, daddr_t, int,
67 long *);
984263bc
MD
68
69int
70ext2_init(struct vfsconf *vfsp)
71{
72 return (ufs_init(vfsp));
73}
74
75/*
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.
83 */
84int
85ext2_update(vp, waitfor)
86 struct vnode *vp;
87 int waitfor;
88{
f7aae92f 89 struct ext2_sb_info *fs;
984263bc
MD
90 struct buf *bp;
91 struct inode *ip;
92 int error;
93
94 ufs_itimes(vp);
95 ip = VTOI(vp);
96 if ((ip->i_flag & IN_MODIFIED) == 0)
97 return (0);
98 ip->i_flag &= ~(IN_LAZYMOD | IN_MODIFIED);
99 if (vp->v_mount->mnt_flag & MNT_RDONLY)
100 return (0);
101 fs = ip->i_e2fs;
102 if ((error = bread(ip->i_devvp,
103 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
7b95be2a 104 (int)fs->s_blocksize, &bp)) != 0) {
984263bc
MD
105 brelse(bp);
106 return (error);
107 }
108 ext2_di2ei( &ip->i_din, (struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE *
109 ino_to_fsbo(fs, ip->i_number)));
110/*
111 if (waitfor && (vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
112 return (bwrite(bp));
113 else {
114*/
115 bdwrite(bp);
116 return (0);
117/*
118 }
119*/
120}
121
122#define SINGLE 0 /* index of single indirect block */
123#define DOUBLE 1 /* index of double indirect block */
124#define TRIPLE 2 /* index of triple indirect block */
125/*
126 * Truncate the inode oip to at most length size, freeing the
127 * disk blocks.
128 */
129int
7b95be2a 130ext2_truncate(vp, length, flags, cred, td)
984263bc
MD
131 struct vnode *vp;
132 off_t length;
133 int flags;
134 struct ucred *cred;
7b95be2a 135 struct thread *td;
984263bc 136{
f7aae92f
RG
137 struct vnode *ovp = vp;
138 daddr_t lastblock;
139 struct inode *oip;
984263bc
MD
140 daddr_t bn, lbn, lastiblock[NIADDR], indir_lbn[NIADDR];
141 daddr_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
f7aae92f 142 struct ext2_sb_info *fs;
984263bc
MD
143 struct buf *bp;
144 int offset, size, level;
145 long count, nblocks, blocksreleased = 0;
f7aae92f 146 int i;
984263bc
MD
147 int aflags, error, allerror;
148 off_t osize;
149/*
150printf("ext2_truncate called %d to %d\n", VTOI(ovp)->i_number, length);
151*/ /*
152 * negative file sizes will totally break the code below and
153 * are not meaningful anyways.
154 */
155 if (length < 0)
156 return EFBIG;
157
158 oip = VTOI(ovp);
159 if (ovp->v_type == VLNK &&
160 oip->i_size < ovp->v_mount->mnt_maxsymlinklen) {
161#if DIAGNOSTIC
162 if (length != 0)
163 panic("ext2_truncate: partial truncate of symlink");
164#endif
165 bzero((char *)&oip->i_shortlink, (u_int)oip->i_size);
166 oip->i_size = 0;
167 oip->i_flag |= IN_CHANGE | IN_UPDATE;
168 return (UFS_UPDATE(ovp, 1));
169 }
170 if (oip->i_size == length) {
171 oip->i_flag |= IN_CHANGE | IN_UPDATE;
172 return (UFS_UPDATE(ovp, 0));
173 }
174#if QUOTA
175 if ((error = getinoquota(oip)) != 0)
176 return (error);
177#endif
178 fs = oip->i_e2fs;
179 osize = oip->i_size;
180 ext2_discard_prealloc(oip);
181 /*
182 * Lengthen the size of the file. We must ensure that the
183 * last byte of the file is allocated. Since the smallest
184 * value of oszie is 0, length will be at least 1.
185 */
186 if (osize < length) {
187 offset = blkoff(fs, length - 1);
188 lbn = lblkno(fs, length - 1);
189 aflags = B_CLRBUF;
190 if (flags & IO_SYNC)
191 aflags |= B_SYNC;
192 vnode_pager_setsize(ovp, length);
193 if ((error = ext2_balloc(oip, lbn, offset + 1, cred, &bp,
194 aflags)) != 0)
195 return (error);
196 oip->i_size = length;
197 if (aflags & IO_SYNC)
198 bwrite(bp);
199 else
200 bawrite(bp);
201 oip->i_flag |= IN_CHANGE | IN_UPDATE;
202 return (UFS_UPDATE(ovp, 1));
203 }
204 /*
205 * Shorten the size of the file. If the file is not being
206 * truncated to a block boundry, the contents of the
207 * partial block following the end of the file must be
208 * zero'ed in case it ever become accessable again because
209 * of subsequent file growth.
210 */
211 /* I don't understand the comment above */
212 offset = blkoff(fs, length);
213 if (offset == 0) {
214 oip->i_size = length;
215 } else {
216 lbn = lblkno(fs, length);
217 aflags = B_CLRBUF;
218 if (flags & IO_SYNC)
219 aflags |= B_SYNC;
220 if ((error = ext2_balloc(oip, lbn, offset, cred, &bp,
221 aflags)) != 0)
222 return (error);
223 oip->i_size = length;
224 size = blksize(fs, oip, lbn);
225 bzero((char *)bp->b_data + offset, (u_int)(size - offset));
226 allocbuf(bp, size);
227 if (aflags & IO_SYNC)
228 bwrite(bp);
229 else
230 bawrite(bp);
231 }
232 /*
233 * Calculate index into inode's block list of
234 * last direct and indirect blocks (if any)
235 * which we want to keep. Lastblock is -1 when
236 * the file is truncated to 0.
237 */
238 lastblock = lblkno(fs, length + fs->s_blocksize - 1) - 1;
239 lastiblock[SINGLE] = lastblock - NDADDR;
240 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
241 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
242 nblocks = btodb(fs->s_blocksize);
243 /*
244 * Update file and block pointers on disk before we start freeing
245 * blocks. If we crash before free'ing blocks below, the blocks
246 * will be returned to the free list. lastiblock values are also
247 * normalized to -1 for calls to ext2_indirtrunc below.
248 */
249 bcopy((caddr_t)&oip->i_db[0], (caddr_t)oldblks, sizeof oldblks);
250 for (level = TRIPLE; level >= SINGLE; level--)
251 if (lastiblock[level] < 0) {
252 oip->i_ib[level] = 0;
253 lastiblock[level] = -1;
254 }
255 for (i = NDADDR - 1; i > lastblock; i--)
256 oip->i_db[i] = 0;
257 oip->i_flag |= IN_CHANGE | IN_UPDATE;
258 allerror = UFS_UPDATE(ovp, 1);
259
260 /*
261 * Having written the new inode to disk, save its new configuration
262 * and put back the old block pointers long enough to process them.
263 * Note that we save the new block configuration so we can check it
264 * when we are done.
265 */
266 bcopy((caddr_t)&oip->i_db[0], (caddr_t)newblks, sizeof newblks);
267 bcopy((caddr_t)oldblks, (caddr_t)&oip->i_db[0], sizeof oldblks);
268 oip->i_size = osize;
7b95be2a 269 error = vtruncbuf(ovp, td, length, (int)fs->s_blocksize);
984263bc
MD
270 if (error && (allerror == 0))
271 allerror = error;
272
273 /*
274 * Indirect blocks first.
275 */
276 indir_lbn[SINGLE] = -NDADDR;
277 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1;
278 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
279 for (level = TRIPLE; level >= SINGLE; level--) {
280 bn = oip->i_ib[level];
281 if (bn != 0) {
282 error = ext2_indirtrunc(oip, indir_lbn[level],
283 fsbtodb(fs, bn), lastiblock[level], level, &count);
284 if (error)
285 allerror = error;
286 blocksreleased += count;
287 if (lastiblock[level] < 0) {
288 oip->i_ib[level] = 0;
289 ext2_blkfree(oip, bn, fs->s_frag_size);
290 blocksreleased += nblocks;
291 }
292 }
293 if (lastiblock[level] >= 0)
294 goto done;
295 }
296
297 /*
298 * All whole direct blocks or frags.
299 */
300 for (i = NDADDR - 1; i > lastblock; i--) {
f7aae92f 301 long bsize;
984263bc
MD
302
303 bn = oip->i_db[i];
304 if (bn == 0)
305 continue;
306 oip->i_db[i] = 0;
307 bsize = blksize(fs, oip, i);
308 ext2_blkfree(oip, bn, bsize);
309 blocksreleased += btodb(bsize);
310 }
311 if (lastblock < 0)
312 goto done;
313
314 /*
315 * Finally, look for a change in size of the
316 * last direct block; release any frags.
317 */
318 bn = oip->i_db[lastblock];
319 if (bn != 0) {
320 long oldspace, newspace;
321
322 /*
323 * Calculate amount of space we're giving
324 * back as old block size minus new block size.
325 */
326 oldspace = blksize(fs, oip, lastblock);
327 oip->i_size = length;
328 newspace = blksize(fs, oip, lastblock);
329 if (newspace == 0)
330 panic("itrunc: newspace");
331 if (oldspace - newspace > 0) {
332 /*
333 * Block number of space to be free'd is
334 * the old block # plus the number of frags
335 * required for the storage we're keeping.
336 */
337 bn += numfrags(fs, newspace);
338 ext2_blkfree(oip, bn, oldspace - newspace);
339 blocksreleased += btodb(oldspace - newspace);
340 }
341 }
342done:
343#if DIAGNOSTIC
344 for (level = SINGLE; level <= TRIPLE; level++)
345 if (newblks[NDADDR + level] != oip->i_ib[level])
346 panic("itrunc1");
347 for (i = 0; i < NDADDR; i++)
348 if (newblks[i] != oip->i_db[i])
349 panic("itrunc2");
350 if (length == 0 && (!TAILQ_EMPTY(&ovp->v_dirtyblkhd) ||
351 !TAILQ_EMPTY(&ovp->v_cleanblkhd)))
352 panic("itrunc3");
353#endif /* DIAGNOSTIC */
354 /*
355 * Put back the real size.
356 */
357 oip->i_size = length;
358 oip->i_blocks -= blocksreleased;
359 if (oip->i_blocks < 0) /* sanity */
360 oip->i_blocks = 0;
361 oip->i_flag |= IN_CHANGE;
362 vnode_pager_setsize(ovp, length);
363#if QUOTA
364 (void) chkdq(oip, -blocksreleased, NOCRED, 0);
365#endif
366 return (allerror);
367}
368
369/*
370 * Release blocks associated with the inode ip and stored in the indirect
371 * block bn. Blocks are free'd in LIFO order up to (but not including)
372 * lastbn. If level is greater than SINGLE, the block is an indirect block
373 * and recursive calls to indirtrunc must be used to cleanse other indirect
374 * blocks.
375 *
376 * NB: triple indirect blocks are untested.
377 */
378
379static int
380ext2_indirtrunc(ip, lbn, dbn, lastbn, level, countp)
f7aae92f 381 struct inode *ip;
984263bc
MD
382 daddr_t lbn, lastbn;
383 daddr_t dbn;
384 int level;
385 long *countp;
386{
f7aae92f 387 int i;
984263bc 388 struct buf *bp;
f7aae92f
RG
389 struct ext2_sb_info *fs = ip->i_e2fs;
390 daddr_t *bap;
984263bc
MD
391 struct vnode *vp;
392 daddr_t *copy, nb, nlbn, last;
393 long blkcount, factor;
394 int nblocks, blocksreleased = 0;
395 int error = 0, allerror = 0;
396
397 /*
398 * Calculate index in current block of last
399 * block to be kept. -1 indicates the entire
400 * block so we need not calculate the index.
401 */
402 factor = 1;
403 for (i = SINGLE; i < level; i++)
404 factor *= NINDIR(fs);
405 last = lastbn;
406 if (lastbn > 0)
407 last /= factor;
408 nblocks = btodb(fs->s_blocksize);
409 /*
410 * Get buffer of block pointers, zero those entries corresponding
411 * to blocks to be free'd, and update on disk copy first. Since
412 * double(triple) indirect before single(double) indirect, calls
413 * to bmap on these blocks will fail. However, we already have
414 * the on disk address, so we have to set the b_blkno field
415 * explicitly instead of letting bread do everything for us.
416 */
417 vp = ITOV(ip);
418 bp = getblk(vp, lbn, (int)fs->s_blocksize, 0, 0);
419 if (bp->b_flags & (B_DONE | B_DELWRI)) {
420 } else {
421 bp->b_flags |= B_READ;
422 if (bp->b_bcount > bp->b_bufsize)
423 panic("ext2_indirtrunc: bad buffer size");
424 bp->b_blkno = dbn;
425 vfs_busy_pages(bp, 0);
426 VOP_STRATEGY(vp, bp);
427 error = biowait(bp);
428 }
429 if (error) {
430 brelse(bp);
431 *countp = 0;
432 return (error);
433 }
434
435 bap = (daddr_t *)bp->b_data;
436 MALLOC(copy, daddr_t *, fs->s_blocksize, M_TEMP, M_WAITOK);
437 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->s_blocksize);
438 bzero((caddr_t)&bap[last + 1],
439 (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t));
440 if (last == -1)
441 bp->b_flags |= B_INVAL;
442 error = bwrite(bp);
443 if (error)
444 allerror = error;
445 bap = copy;
446
447 /*
448 * Recursively free totally unused blocks.
449 */
450 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
451 i--, nlbn += factor) {
452 nb = bap[i];
453 if (nb == 0)
454 continue;
455 if (level > SINGLE) {
456 if ((error = ext2_indirtrunc(ip, nlbn,
457 fsbtodb(fs, nb), (daddr_t)-1, level - 1, &blkcount)) != 0)
458 allerror = error;
459 blocksreleased += blkcount;
460 }
461 ext2_blkfree(ip, nb, fs->s_blocksize);
462 blocksreleased += nblocks;
463 }
464
465 /*
466 * Recursively free last partial block.
467 */
468 if (level > SINGLE && lastbn >= 0) {
469 last = lastbn % factor;
470 nb = bap[i];
471 if (nb != 0) {
472 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
473 last, level - 1, &blkcount)) != 0)
474 allerror = error;
475 blocksreleased += blkcount;
476 }
477 }
478 FREE(copy, M_TEMP);
479 *countp = blocksreleased;
480 return (allerror);
481}
482
483/*
484 * discard preallocated blocks
485 */
486int
487ext2_inactive(ap)
488 struct vop_inactive_args /* {
489 struct vnode *a_vp;
490 } */ *ap;
491{
492 ext2_discard_prealloc(VTOI(ap->a_vp));
493 return ufs_inactive(ap);
494}
495