ext2fs_inode.c revision 1.36 1 1.36 bouyer /* $NetBSD: ext2fs_inode.c,v 1.36 2003/10/05 17:48:49 bouyer Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1982, 1986, 1989, 1993
5 1.1 bouyer * The Regents of the University of California. All rights reserved.
6 1.1 bouyer *
7 1.1 bouyer * Redistribution and use in source and binary forms, with or without
8 1.1 bouyer * modification, are permitted provided that the following conditions
9 1.1 bouyer * are met:
10 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
11 1.1 bouyer * notice, this list of conditions and the following disclaimer.
12 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
14 1.1 bouyer * documentation and/or other materials provided with the distribution.
15 1.35 agc * 3. Neither the name of the University nor the names of its contributors
16 1.35 agc * may be used to endorse or promote products derived from this software
17 1.35 agc * without specific prior written permission.
18 1.35 agc *
19 1.35 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.35 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.35 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.35 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.35 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.35 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.35 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.35 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.35 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.35 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.35 agc * SUCH DAMAGE.
30 1.35 agc *
31 1.35 agc * @(#)ffs_inode.c 8.8 (Berkeley) 10/19/94
32 1.35 agc * Modified for ext2fs by Manuel Bouyer.
33 1.35 agc */
34 1.35 agc
35 1.35 agc /*
36 1.35 agc * Copyright (c) 1997 Manuel Bouyer.
37 1.35 agc *
38 1.35 agc * Redistribution and use in source and binary forms, with or without
39 1.35 agc * modification, are permitted provided that the following conditions
40 1.35 agc * are met:
41 1.35 agc * 1. Redistributions of source code must retain the above copyright
42 1.35 agc * notice, this list of conditions and the following disclaimer.
43 1.35 agc * 2. Redistributions in binary form must reproduce the above copyright
44 1.35 agc * notice, this list of conditions and the following disclaimer in the
45 1.35 agc * documentation and/or other materials provided with the distribution.
46 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
47 1.1 bouyer * must display the following acknowledgement:
48 1.36 bouyer * This product includes software developed by Manuel Bouyer.
49 1.36 bouyer * 4. The name of the author may not be used to endorse or promote products
50 1.36 bouyer * derived from this software without specific prior written permission.
51 1.1 bouyer *
52 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 1.1 bouyer * SUCH DAMAGE.
63 1.1 bouyer *
64 1.1 bouyer * @(#)ffs_inode.c 8.8 (Berkeley) 10/19/94
65 1.1 bouyer * Modified for ext2fs by Manuel Bouyer.
66 1.1 bouyer */
67 1.27 lukem
68 1.27 lukem #include <sys/cdefs.h>
69 1.36 bouyer __KERNEL_RCSID(0, "$NetBSD: ext2fs_inode.c,v 1.36 2003/10/05 17:48:49 bouyer Exp $");
70 1.5 mrg
71 1.1 bouyer #include <sys/param.h>
72 1.1 bouyer #include <sys/systm.h>
73 1.1 bouyer #include <sys/mount.h>
74 1.1 bouyer #include <sys/proc.h>
75 1.1 bouyer #include <sys/file.h>
76 1.1 bouyer #include <sys/buf.h>
77 1.1 bouyer #include <sys/vnode.h>
78 1.1 bouyer #include <sys/kernel.h>
79 1.1 bouyer #include <sys/malloc.h>
80 1.1 bouyer #include <sys/trace.h>
81 1.1 bouyer #include <sys/resourcevar.h>
82 1.1 bouyer
83 1.1 bouyer #include <ufs/ufs/inode.h>
84 1.1 bouyer #include <ufs/ufs/ufsmount.h>
85 1.1 bouyer #include <ufs/ufs/ufs_extern.h>
86 1.1 bouyer
87 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
88 1.1 bouyer #include <ufs/ext2fs/ext2fs_extern.h>
89 1.1 bouyer
90 1.22 tsutsui extern int prtactive;
91 1.22 tsutsui
92 1.29 fvdl static int ext2fs_indirtrunc __P((struct inode *, daddr_t, daddr_t,
93 1.29 fvdl daddr_t, int, long *));
94 1.1 bouyer
95 1.1 bouyer /*
96 1.1 bouyer * Last reference to an inode. If necessary, write or delete it.
97 1.1 bouyer */
98 1.1 bouyer int
99 1.1 bouyer ext2fs_inactive(v)
100 1.1 bouyer void *v;
101 1.1 bouyer {
102 1.1 bouyer struct vop_inactive_args /* {
103 1.1 bouyer struct vnode *a_vp;
104 1.34 fvdl struct proc *a_p;
105 1.1 bouyer } */ *ap = v;
106 1.6 fvdl struct vnode *vp = ap->a_vp;
107 1.6 fvdl struct inode *ip = VTOI(vp);
108 1.34 fvdl struct proc *p = ap->a_p;
109 1.1 bouyer struct timespec ts;
110 1.6 fvdl int error = 0;
111 1.1 bouyer
112 1.1 bouyer if (prtactive && vp->v_usecount != 0)
113 1.7 mikel vprint("ext2fs_inactive: pushing active", vp);
114 1.1 bouyer /* Get rid of inodes related to stale file handles. */
115 1.6 fvdl if (ip->i_e2fs_mode == 0 || ip->i_e2fs_dtime != 0)
116 1.6 fvdl goto out;
117 1.1 bouyer
118 1.1 bouyer error = 0;
119 1.1 bouyer if (ip->i_e2fs_nlink == 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) {
120 1.23 chs if (ip->i_e2fs_size != 0) {
121 1.23 chs error = VOP_TRUNCATE(vp, (off_t)0, 0, NOCRED, NULL);
122 1.23 chs }
123 1.1 bouyer TIMEVAL_TO_TIMESPEC(&time, &ts);
124 1.1 bouyer ip->i_e2fs_dtime = ts.tv_sec;
125 1.1 bouyer ip->i_flag |= IN_CHANGE | IN_UPDATE;
126 1.1 bouyer VOP_VFREE(vp, ip->i_number, ip->i_e2fs_mode);
127 1.1 bouyer }
128 1.18 mycroft if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_UPDATE | IN_MODIFIED | IN_ACCESSED))
129 1.12 mycroft VOP_UPDATE(vp, NULL, NULL, 0);
130 1.6 fvdl out:
131 1.6 fvdl VOP_UNLOCK(vp, 0);
132 1.1 bouyer /*
133 1.1 bouyer * If we are done with the inode, reclaim it
134 1.1 bouyer * so that it can be reused immediately.
135 1.1 bouyer */
136 1.6 fvdl if (ip->i_e2fs_dtime != 0)
137 1.34 fvdl vrecycle(vp, NULL, p);
138 1.1 bouyer return (error);
139 1.1 bouyer }
140 1.1 bouyer
141 1.1 bouyer
142 1.1 bouyer /*
143 1.1 bouyer * Update the access, modified, and inode change times as specified by the
144 1.1 bouyer * IACCESS, IUPDATE, and ICHANGE flags respectively. The IMODIFIED flag is
145 1.1 bouyer * used to specify that the inode needs to be updated but that the times have
146 1.1 bouyer * already been set. The access and modified times are taken from the second
147 1.1 bouyer * and third parameters; the inode change time is always taken from the current
148 1.15 perseant * time. If UPDATE_WAIT or UPDATE_DIROP is set, then wait for the disk
149 1.15 perseant * write of the inode to complete.
150 1.1 bouyer */
151 1.1 bouyer int
152 1.1 bouyer ext2fs_update(v)
153 1.1 bouyer void *v;
154 1.1 bouyer {
155 1.1 bouyer struct vop_update_args /* {
156 1.1 bouyer struct vnode *a_vp;
157 1.1 bouyer struct timespec *a_access;
158 1.1 bouyer struct timespec *a_modify;
159 1.15 perseant int a_flags;
160 1.1 bouyer } */ *ap = v;
161 1.14 augustss struct m_ext2fs *fs;
162 1.1 bouyer struct buf *bp;
163 1.1 bouyer struct inode *ip;
164 1.1 bouyer int error;
165 1.1 bouyer struct timespec ts;
166 1.10 thorpej caddr_t cp;
167 1.18 mycroft int flags;
168 1.1 bouyer
169 1.1 bouyer if (ap->a_vp->v_mount->mnt_flag & MNT_RDONLY)
170 1.1 bouyer return (0);
171 1.1 bouyer ip = VTOI(ap->a_vp);
172 1.1 bouyer TIMEVAL_TO_TIMESPEC(&time, &ts);
173 1.11 mycroft EXT2FS_ITIMES(ip,
174 1.11 mycroft ap->a_access ? ap->a_access : &ts,
175 1.11 mycroft ap->a_modify ? ap->a_modify : &ts, &ts);
176 1.18 mycroft flags = ip->i_flag & (IN_MODIFIED | IN_ACCESSED);
177 1.18 mycroft if (flags == 0)
178 1.1 bouyer return (0);
179 1.1 bouyer fs = ip->i_e2fs;
180 1.18 mycroft
181 1.1 bouyer error = bread(ip->i_devvp,
182 1.1 bouyer fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
183 1.1 bouyer (int)fs->e2fs_bsize, NOCRED, &bp);
184 1.1 bouyer if (error) {
185 1.1 bouyer brelse(bp);
186 1.1 bouyer return (error);
187 1.1 bouyer }
188 1.19 mycroft ip->i_flag &= ~(IN_MODIFIED | IN_ACCESSED);
189 1.10 thorpej cp = (caddr_t)bp->b_data +
190 1.10 thorpej (ino_to_fsbo(fs, ip->i_number) * EXT2_DINODE_SIZE);
191 1.32 he e2fs_isave(ip->i_din.e2fs_din, (struct ext2fs_dinode *)cp);
192 1.19 mycroft if ((ap->a_flags & (UPDATE_WAIT|UPDATE_DIROP)) != 0 &&
193 1.18 mycroft (flags & IN_MODIFIED) != 0 &&
194 1.15 perseant (ap->a_vp->v_mount->mnt_flag & MNT_ASYNC) == 0)
195 1.1 bouyer return (bwrite(bp));
196 1.1 bouyer else {
197 1.1 bouyer bdwrite(bp);
198 1.1 bouyer return (0);
199 1.1 bouyer }
200 1.1 bouyer }
201 1.1 bouyer
202 1.1 bouyer #define SINGLE 0 /* index of single indirect block */
203 1.1 bouyer #define DOUBLE 1 /* index of double indirect block */
204 1.1 bouyer #define TRIPLE 2 /* index of triple indirect block */
205 1.1 bouyer /*
206 1.1 bouyer * Truncate the inode oip to at most length size, freeing the
207 1.1 bouyer * disk blocks.
208 1.1 bouyer */
209 1.1 bouyer int
210 1.1 bouyer ext2fs_truncate(v)
211 1.1 bouyer void *v;
212 1.1 bouyer {
213 1.1 bouyer struct vop_truncate_args /* {
214 1.1 bouyer struct vnode *a_vp;
215 1.1 bouyer off_t a_length;
216 1.1 bouyer int a_flags;
217 1.1 bouyer struct ucred *a_cred;
218 1.1 bouyer struct proc *a_p;
219 1.1 bouyer } */ *ap = v;
220 1.14 augustss struct vnode *ovp = ap->a_vp;
221 1.29 fvdl daddr_t lastblock;
222 1.14 augustss struct inode *oip;
223 1.29 fvdl daddr_t bn, lastiblock[NIADDR], indir_lbn[NIADDR];
224 1.30 fvdl /* XXX ondisk32 */
225 1.30 fvdl int32_t oldblks[NDADDR + NIADDR], newblks[NDADDR + NIADDR];
226 1.1 bouyer off_t length = ap->a_length;
227 1.14 augustss struct m_ext2fs *fs;
228 1.1 bouyer int offset, size, level;
229 1.16 mycroft long count, nblocks, blocksreleased = 0;
230 1.14 augustss int i;
231 1.21 chs int error, allerror = 0;
232 1.1 bouyer off_t osize;
233 1.1 bouyer
234 1.1 bouyer if (length < 0)
235 1.1 bouyer return (EINVAL);
236 1.1 bouyer
237 1.1 bouyer oip = VTOI(ovp);
238 1.1 bouyer if (ovp->v_type == VLNK &&
239 1.1 bouyer (oip->i_e2fs_size < ovp->v_mount->mnt_maxsymlinklen ||
240 1.1 bouyer (ovp->v_mount->mnt_maxsymlinklen == 0 &&
241 1.1 bouyer oip->i_e2fs_nblock == 0))) {
242 1.1 bouyer #ifdef DIAGNOSTIC
243 1.1 bouyer if (length != 0)
244 1.1 bouyer panic("ext2fs_truncate: partial truncate of symlink");
245 1.1 bouyer #endif
246 1.31 fvdl memset((char *)&oip->i_din.e2fs_din->e2di_shortlink, 0,
247 1.1 bouyer (u_int)oip->i_e2fs_size);
248 1.1 bouyer oip->i_e2fs_size = 0;
249 1.1 bouyer oip->i_flag |= IN_CHANGE | IN_UPDATE;
250 1.15 perseant return (VOP_UPDATE(ovp, NULL, NULL, UPDATE_WAIT));
251 1.1 bouyer }
252 1.1 bouyer if (oip->i_e2fs_size == length) {
253 1.1 bouyer oip->i_flag |= IN_CHANGE | IN_UPDATE;
254 1.12 mycroft return (VOP_UPDATE(ovp, NULL, NULL, 0));
255 1.1 bouyer }
256 1.1 bouyer fs = oip->i_e2fs;
257 1.1 bouyer osize = oip->i_e2fs_size;
258 1.1 bouyer /*
259 1.1 bouyer * Lengthen the size of the file. We must ensure that the
260 1.1 bouyer * last byte of the file is allocated. Since the smallest
261 1.1 bouyer * value of osize is 0, length will be at least 1.
262 1.1 bouyer */
263 1.1 bouyer if (osize < length) {
264 1.1 bouyer #if 0 /* XXX */
265 1.1 bouyer if (length > fs->fs_maxfilesize)
266 1.1 bouyer return (EFBIG);
267 1.1 bouyer #endif
268 1.28 jdolecek ufs_balloc_range(ovp, length - 1, 1, ap->a_cred,
269 1.21 chs ap->a_flags & IO_SYNC ? B_SYNC : 0);
270 1.1 bouyer oip->i_flag |= IN_CHANGE | IN_UPDATE;
271 1.21 chs return (VOP_UPDATE(ovp, NULL, NULL, 1));
272 1.1 bouyer }
273 1.1 bouyer /*
274 1.1 bouyer * Shorten the size of the file. If the file is not being
275 1.1 bouyer * truncated to a block boundry, the contents of the
276 1.1 bouyer * partial block following the end of the file must be
277 1.24 wiz * zero'ed in case it ever become accessible again because
278 1.1 bouyer * of subsequent file growth.
279 1.1 bouyer */
280 1.1 bouyer offset = blkoff(fs, length);
281 1.21 chs if (offset != 0) {
282 1.1 bouyer size = fs->e2fs_bsize;
283 1.21 chs
284 1.21 chs /* XXXUBC we should handle more than just VREG */
285 1.21 chs uvm_vnp_zerorange(ovp, length, size - offset);
286 1.1 bouyer }
287 1.21 chs oip->i_e2fs_size = length;
288 1.6 fvdl uvm_vnp_setsize(ovp, length);
289 1.13 mrg
290 1.1 bouyer /*
291 1.1 bouyer * Calculate index into inode's block list of
292 1.1 bouyer * last direct and indirect blocks (if any)
293 1.1 bouyer * which we want to keep. Lastblock is -1 when
294 1.1 bouyer * the file is truncated to 0.
295 1.1 bouyer */
296 1.1 bouyer lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1;
297 1.1 bouyer lastiblock[SINGLE] = lastblock - NDADDR;
298 1.1 bouyer lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs);
299 1.1 bouyer lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
300 1.1 bouyer nblocks = btodb(fs->e2fs_bsize);
301 1.1 bouyer /*
302 1.1 bouyer * Update file and block pointers on disk before we start freeing
303 1.1 bouyer * blocks. If we crash before free'ing blocks below, the blocks
304 1.1 bouyer * will be returned to the free list. lastiblock values are also
305 1.1 bouyer * normalized to -1 for calls to ext2fs_indirtrunc below.
306 1.1 bouyer */
307 1.8 perry memcpy((caddr_t)oldblks, (caddr_t)&oip->i_e2fs_blocks[0], sizeof oldblks);
308 1.1 bouyer for (level = TRIPLE; level >= SINGLE; level--)
309 1.1 bouyer if (lastiblock[level] < 0) {
310 1.1 bouyer oip->i_e2fs_blocks[NDADDR + level] = 0;
311 1.1 bouyer lastiblock[level] = -1;
312 1.1 bouyer }
313 1.1 bouyer for (i = NDADDR - 1; i > lastblock; i--)
314 1.1 bouyer oip->i_e2fs_blocks[i] = 0;
315 1.1 bouyer oip->i_flag |= IN_CHANGE | IN_UPDATE;
316 1.16 mycroft error = VOP_UPDATE(ovp, NULL, NULL, UPDATE_WAIT);
317 1.16 mycroft if (error && !allerror)
318 1.1 bouyer allerror = error;
319 1.16 mycroft
320 1.1 bouyer /*
321 1.1 bouyer * Having written the new inode to disk, save its new configuration
322 1.1 bouyer * and put back the old block pointers long enough to process them.
323 1.1 bouyer * Note that we save the new block configuration so we can check it
324 1.1 bouyer * when we are done.
325 1.1 bouyer */
326 1.21 chs
327 1.8 perry memcpy((caddr_t)newblks, (caddr_t)&oip->i_e2fs_blocks[0], sizeof newblks);
328 1.8 perry memcpy((caddr_t)&oip->i_e2fs_blocks[0], (caddr_t)oldblks, sizeof oldblks);
329 1.1 bouyer oip->i_e2fs_size = osize;
330 1.16 mycroft error = vtruncbuf(ovp, lastblock + 1, 0, 0);
331 1.16 mycroft if (error && !allerror)
332 1.16 mycroft allerror = error;
333 1.1 bouyer
334 1.1 bouyer /*
335 1.1 bouyer * Indirect blocks first.
336 1.1 bouyer */
337 1.1 bouyer indir_lbn[SINGLE] = -NDADDR;
338 1.1 bouyer indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) -1;
339 1.1 bouyer indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1;
340 1.1 bouyer for (level = TRIPLE; level >= SINGLE; level--) {
341 1.29 fvdl /* XXX ondisk32 */
342 1.3 bouyer bn = fs2h32(oip->i_e2fs_blocks[NDADDR + level]);
343 1.1 bouyer if (bn != 0) {
344 1.1 bouyer error = ext2fs_indirtrunc(oip, indir_lbn[level],
345 1.16 mycroft fsbtodb(fs, bn), lastiblock[level], level, &count);
346 1.1 bouyer if (error)
347 1.1 bouyer allerror = error;
348 1.1 bouyer blocksreleased += count;
349 1.1 bouyer if (lastiblock[level] < 0) {
350 1.1 bouyer oip->i_e2fs_blocks[NDADDR + level] = 0;
351 1.1 bouyer ext2fs_blkfree(oip, bn);
352 1.1 bouyer blocksreleased += nblocks;
353 1.1 bouyer }
354 1.1 bouyer }
355 1.1 bouyer if (lastiblock[level] >= 0)
356 1.1 bouyer goto done;
357 1.1 bouyer }
358 1.1 bouyer
359 1.1 bouyer /*
360 1.1 bouyer * All whole direct blocks or frags.
361 1.1 bouyer */
362 1.1 bouyer for (i = NDADDR - 1; i > lastblock; i--) {
363 1.29 fvdl /* XXX ondisk32 */
364 1.3 bouyer bn = fs2h32(oip->i_e2fs_blocks[i]);
365 1.1 bouyer if (bn == 0)
366 1.1 bouyer continue;
367 1.1 bouyer oip->i_e2fs_blocks[i] = 0;
368 1.1 bouyer ext2fs_blkfree(oip, bn);
369 1.1 bouyer blocksreleased += btodb(fs->e2fs_bsize);
370 1.1 bouyer }
371 1.1 bouyer
372 1.1 bouyer done:
373 1.1 bouyer #ifdef DIAGNOSTIC
374 1.1 bouyer for (level = SINGLE; level <= TRIPLE; level++)
375 1.21 chs if (newblks[NDADDR + level] !=
376 1.21 chs oip->i_e2fs_blocks[NDADDR + level])
377 1.21 chs panic("ext2fs_truncate1");
378 1.1 bouyer for (i = 0; i < NDADDR; i++)
379 1.16 mycroft if (newblks[i] != oip->i_e2fs_blocks[i])
380 1.21 chs panic("ext2fs_truncate2");
381 1.1 bouyer if (length == 0 &&
382 1.21 chs (!LIST_EMPTY(&ovp->v_cleanblkhd) ||
383 1.21 chs !LIST_EMPTY(&ovp->v_dirtyblkhd)))
384 1.21 chs panic("ext2fs_truncate3");
385 1.1 bouyer #endif /* DIAGNOSTIC */
386 1.1 bouyer /*
387 1.1 bouyer * Put back the real size.
388 1.1 bouyer */
389 1.1 bouyer oip->i_e2fs_size = length;
390 1.1 bouyer oip->i_e2fs_nblock -= blocksreleased;
391 1.1 bouyer oip->i_flag |= IN_CHANGE;
392 1.1 bouyer return (allerror);
393 1.1 bouyer }
394 1.1 bouyer
395 1.1 bouyer /*
396 1.1 bouyer * Release blocks associated with the inode ip and stored in the indirect
397 1.1 bouyer * block bn. Blocks are free'd in LIFO order up to (but not including)
398 1.1 bouyer * lastbn. If level is greater than SINGLE, the block is an indirect block
399 1.1 bouyer * and recursive calls to indirtrunc must be used to cleanse other indirect
400 1.1 bouyer * blocks.
401 1.1 bouyer *
402 1.1 bouyer * NB: triple indirect blocks are untested.
403 1.1 bouyer */
404 1.1 bouyer static int
405 1.1 bouyer ext2fs_indirtrunc(ip, lbn, dbn, lastbn, level, countp)
406 1.14 augustss struct inode *ip;
407 1.29 fvdl daddr_t lbn, lastbn;
408 1.29 fvdl daddr_t dbn;
409 1.1 bouyer int level;
410 1.1 bouyer long *countp;
411 1.1 bouyer {
412 1.14 augustss int i;
413 1.1 bouyer struct buf *bp;
414 1.14 augustss struct m_ext2fs *fs = ip->i_e2fs;
415 1.29 fvdl int32_t *bap; /* XXX ondisk32 */
416 1.1 bouyer struct vnode *vp;
417 1.29 fvdl daddr_t nb, nlbn, last;
418 1.29 fvdl int32_t *copy = NULL; /* XXX ondisk32 */
419 1.1 bouyer long blkcount, factor;
420 1.1 bouyer int nblocks, blocksreleased = 0;
421 1.1 bouyer int error = 0, allerror = 0;
422 1.1 bouyer
423 1.1 bouyer /*
424 1.1 bouyer * Calculate index in current block of last
425 1.1 bouyer * block to be kept. -1 indicates the entire
426 1.1 bouyer * block so we need not calculate the index.
427 1.1 bouyer */
428 1.1 bouyer factor = 1;
429 1.1 bouyer for (i = SINGLE; i < level; i++)
430 1.1 bouyer factor *= NINDIR(fs);
431 1.1 bouyer last = lastbn;
432 1.1 bouyer if (lastbn > 0)
433 1.1 bouyer last /= factor;
434 1.1 bouyer nblocks = btodb(fs->e2fs_bsize);
435 1.1 bouyer /*
436 1.1 bouyer * Get buffer of block pointers, zero those entries corresponding
437 1.1 bouyer * to blocks to be free'd, and update on disk copy first. Since
438 1.1 bouyer * double(triple) indirect before single(double) indirect, calls
439 1.1 bouyer * to bmap on these blocks will fail. However, we already have
440 1.1 bouyer * the on disk address, so we have to set the b_blkno field
441 1.1 bouyer * explicitly instead of letting bread do everything for us.
442 1.1 bouyer */
443 1.1 bouyer vp = ITOV(ip);
444 1.1 bouyer bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0);
445 1.1 bouyer if (bp->b_flags & (B_DONE | B_DELWRI)) {
446 1.1 bouyer /* Braces must be here in case trace evaluates to nothing. */
447 1.1 bouyer trace(TR_BREADHIT, pack(vp, fs->e2fs_bsize), lbn);
448 1.1 bouyer } else {
449 1.1 bouyer trace(TR_BREADMISS, pack(vp, fs->e2fs_bsize), lbn);
450 1.1 bouyer curproc->p_stats->p_ru.ru_inblock++; /* pay for read */
451 1.1 bouyer bp->b_flags |= B_READ;
452 1.1 bouyer if (bp->b_bcount > bp->b_bufsize)
453 1.1 bouyer panic("ext2fs_indirtrunc: bad buffer size");
454 1.1 bouyer bp->b_blkno = dbn;
455 1.1 bouyer VOP_STRATEGY(bp);
456 1.1 bouyer error = biowait(bp);
457 1.1 bouyer }
458 1.1 bouyer if (error) {
459 1.1 bouyer brelse(bp);
460 1.1 bouyer *countp = 0;
461 1.1 bouyer return (error);
462 1.1 bouyer }
463 1.1 bouyer
464 1.29 fvdl bap = (int32_t *)bp->b_data; /* XXX ondisk32 */
465 1.17 mycroft if (lastbn >= 0) {
466 1.29 fvdl /* XXX ondisk32 */
467 1.29 fvdl MALLOC(copy, int32_t *, fs->e2fs_bsize, M_TEMP, M_WAITOK);
468 1.8 perry memcpy((caddr_t)copy, (caddr_t)bap, (u_int)fs->e2fs_bsize);
469 1.8 perry memset((caddr_t)&bap[last + 1], 0,
470 1.1 bouyer (u_int)(NINDIR(fs) - (last + 1)) * sizeof (u_int32_t));
471 1.1 bouyer error = bwrite(bp);
472 1.1 bouyer if (error)
473 1.1 bouyer allerror = error;
474 1.1 bouyer bap = copy;
475 1.1 bouyer }
476 1.1 bouyer
477 1.1 bouyer /*
478 1.1 bouyer * Recursively free totally unused blocks.
479 1.1 bouyer */
480 1.1 bouyer for (i = NINDIR(fs) - 1,
481 1.1 bouyer nlbn = lbn + 1 - i * factor; i > last;
482 1.1 bouyer i--, nlbn += factor) {
483 1.29 fvdl /* XXX ondisk32 */
484 1.3 bouyer nb = fs2h32(bap[i]);
485 1.1 bouyer if (nb == 0)
486 1.1 bouyer continue;
487 1.1 bouyer if (level > SINGLE) {
488 1.1 bouyer error = ext2fs_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
489 1.29 fvdl (daddr_t)-1, level - 1,
490 1.1 bouyer &blkcount);
491 1.1 bouyer if (error)
492 1.1 bouyer allerror = error;
493 1.1 bouyer blocksreleased += blkcount;
494 1.1 bouyer }
495 1.1 bouyer ext2fs_blkfree(ip, nb);
496 1.1 bouyer blocksreleased += nblocks;
497 1.1 bouyer }
498 1.1 bouyer
499 1.1 bouyer /*
500 1.1 bouyer * Recursively free last partial block.
501 1.1 bouyer */
502 1.1 bouyer if (level > SINGLE && lastbn >= 0) {
503 1.1 bouyer last = lastbn % factor;
504 1.29 fvdl /* XXX ondisk32 */
505 1.3 bouyer nb = fs2h32(bap[i]);
506 1.1 bouyer if (nb != 0) {
507 1.1 bouyer error = ext2fs_indirtrunc(ip, nlbn, fsbtodb(fs, nb),
508 1.1 bouyer last, level - 1, &blkcount);
509 1.1 bouyer if (error)
510 1.1 bouyer allerror = error;
511 1.1 bouyer blocksreleased += blkcount;
512 1.1 bouyer }
513 1.1 bouyer }
514 1.1 bouyer
515 1.1 bouyer if (copy != NULL) {
516 1.1 bouyer FREE(copy, M_TEMP);
517 1.1 bouyer } else {
518 1.1 bouyer bp->b_flags |= B_INVAL;
519 1.1 bouyer brelse(bp);
520 1.1 bouyer }
521 1.1 bouyer
522 1.1 bouyer *countp = blocksreleased;
523 1.1 bouyer return (allerror);
524 1.1 bouyer }
525