ext2fs_balloc.c revision 1.18 1 1.18 jdolecek /* $NetBSD: ext2fs_balloc.c,v 1.18 2002/09/26 11:06:36 jdolecek Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1997 Manuel Bouyer.
5 1.1 bouyer * Copyright (c) 1982, 1986, 1989, 1993
6 1.1 bouyer * The Regents of the University of California. All rights reserved.
7 1.1 bouyer *
8 1.1 bouyer * Redistribution and use in source and binary forms, with or without
9 1.1 bouyer * modification, are permitted provided that the following conditions
10 1.1 bouyer * are met:
11 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
12 1.1 bouyer * notice, this list of conditions and the following disclaimer.
13 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
15 1.1 bouyer * documentation and/or other materials provided with the distribution.
16 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
17 1.1 bouyer * must display the following acknowledgement:
18 1.1 bouyer * This product includes software developed by the University of
19 1.1 bouyer * California, Berkeley and its contributors.
20 1.1 bouyer * 4. Neither the name of the University nor the names of its contributors
21 1.1 bouyer * may be used to endorse or promote products derived from this software
22 1.1 bouyer * without specific prior written permission.
23 1.1 bouyer *
24 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 bouyer * SUCH DAMAGE.
35 1.1 bouyer *
36 1.1 bouyer * @(#)ffs_balloc.c 8.4 (Berkeley) 9/23/93
37 1.1 bouyer * Modified for ext2fs by Manuel Bouyer.
38 1.1 bouyer */
39 1.13 lukem
40 1.13 lukem #include <sys/cdefs.h>
41 1.18 jdolecek __KERNEL_RCSID(0, "$NetBSD: ext2fs_balloc.c,v 1.18 2002/09/26 11:06:36 jdolecek Exp $");
42 1.1 bouyer
43 1.9 mrg #if defined(_KERNEL_OPT)
44 1.7 chs #include "opt_uvmhist.h"
45 1.7 chs #endif
46 1.7 chs
47 1.1 bouyer #include <sys/param.h>
48 1.1 bouyer #include <sys/systm.h>
49 1.1 bouyer #include <sys/buf.h>
50 1.1 bouyer #include <sys/proc.h>
51 1.1 bouyer #include <sys/file.h>
52 1.1 bouyer #include <sys/vnode.h>
53 1.7 chs #include <sys/mount.h>
54 1.7 chs
55 1.7 chs #include <uvm/uvm.h>
56 1.1 bouyer
57 1.1 bouyer #include <ufs/ufs/inode.h>
58 1.1 bouyer #include <ufs/ufs/ufs_extern.h>
59 1.1 bouyer
60 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
61 1.1 bouyer #include <ufs/ext2fs/ext2fs_extern.h>
62 1.1 bouyer
63 1.1 bouyer /*
64 1.1 bouyer * Balloc defines the structure of file system storage
65 1.1 bouyer * by allocating the physical blocks on a device given
66 1.1 bouyer * the inode and the logical block number in a file.
67 1.1 bouyer */
68 1.1 bouyer int
69 1.1 bouyer ext2fs_balloc(ip, bn, size, cred, bpp, flags)
70 1.4 augustss struct inode *ip;
71 1.4 augustss ufs_daddr_t bn;
72 1.1 bouyer int size;
73 1.1 bouyer struct ucred *cred;
74 1.1 bouyer struct buf **bpp;
75 1.1 bouyer int flags;
76 1.1 bouyer {
77 1.4 augustss struct m_ext2fs *fs;
78 1.4 augustss ufs_daddr_t nb;
79 1.1 bouyer struct buf *bp, *nbp;
80 1.1 bouyer struct vnode *vp = ITOV(ip);
81 1.1 bouyer struct indir indirs[NIADDR + 2];
82 1.3 fvdl ufs_daddr_t newb, lbn, *bap, pref;
83 1.1 bouyer int num, i, error;
84 1.3 fvdl u_int deallocated;
85 1.3 fvdl ufs_daddr_t *allocib, *blkp, *allocblk, allociblk[NIADDR + 1];
86 1.5 mycroft int unwindidx = -1;
87 1.7 chs UVMHIST_FUNC("ext2fs_balloc"); UVMHIST_CALLED(ubchist);
88 1.1 bouyer
89 1.7 chs UVMHIST_LOG(ubchist, "bn 0x%x", bn,0,0,0);
90 1.7 chs
91 1.7 chs if (bpp != NULL) {
92 1.7 chs *bpp = NULL;
93 1.7 chs }
94 1.1 bouyer if (bn < 0)
95 1.1 bouyer return (EFBIG);
96 1.1 bouyer fs = ip->i_e2fs;
97 1.1 bouyer lbn = bn;
98 1.1 bouyer
99 1.1 bouyer /*
100 1.1 bouyer * The first NDADDR blocks are direct blocks
101 1.1 bouyer */
102 1.1 bouyer if (bn < NDADDR) {
103 1.2 bouyer nb = fs2h32(ip->i_e2fs_blocks[bn]);
104 1.1 bouyer if (nb != 0) {
105 1.7 chs
106 1.7 chs /*
107 1.7 chs * the block is already allocated, just read it.
108 1.7 chs */
109 1.7 chs
110 1.7 chs if (bpp != NULL) {
111 1.7 chs error = bread(vp, bn, fs->e2fs_bsize, NOCRED,
112 1.7 chs &bp);
113 1.7 chs if (error) {
114 1.7 chs brelse(bp);
115 1.7 chs return (error);
116 1.7 chs }
117 1.7 chs *bpp = bp;
118 1.1 bouyer }
119 1.1 bouyer return (0);
120 1.7 chs }
121 1.7 chs
122 1.7 chs /*
123 1.7 chs * allocate a new direct block.
124 1.7 chs */
125 1.7 chs
126 1.7 chs error = ext2fs_alloc(ip, bn,
127 1.7 chs ext2fs_blkpref(ip, bn, bn, &ip->i_e2fs_blocks[0]),
128 1.7 chs cred, &newb);
129 1.7 chs if (error)
130 1.7 chs return (error);
131 1.7 chs ip->i_e2fs_last_lblk = lbn;
132 1.7 chs ip->i_e2fs_last_blk = newb;
133 1.7 chs ip->i_e2fs_blocks[bn] = h2fs32(newb);
134 1.7 chs ip->i_flag |= IN_CHANGE | IN_UPDATE;
135 1.7 chs if (bpp != NULL) {
136 1.1 bouyer bp = getblk(vp, bn, fs->e2fs_bsize, 0, 0);
137 1.1 bouyer bp->b_blkno = fsbtodb(fs, newb);
138 1.1 bouyer if (flags & B_CLRBUF)
139 1.1 bouyer clrbuf(bp);
140 1.7 chs *bpp = bp;
141 1.1 bouyer }
142 1.1 bouyer return (0);
143 1.1 bouyer }
144 1.1 bouyer /*
145 1.1 bouyer * Determine the number of levels of indirection.
146 1.1 bouyer */
147 1.1 bouyer pref = 0;
148 1.1 bouyer if ((error = ufs_getlbns(vp, bn, indirs, &num)) != 0)
149 1.1 bouyer return(error);
150 1.1 bouyer #ifdef DIAGNOSTIC
151 1.1 bouyer if (num < 1)
152 1.1 bouyer panic ("ext2fs_balloc: ufs_getlbns returned indirect block\n");
153 1.1 bouyer #endif
154 1.1 bouyer /*
155 1.1 bouyer * Fetch the first indirect block allocating if necessary.
156 1.1 bouyer */
157 1.1 bouyer --num;
158 1.2 bouyer nb = fs2h32(ip->i_e2fs_blocks[NDADDR + indirs[0].in_off]);
159 1.3 fvdl allocib = NULL;
160 1.3 fvdl allocblk = allociblk;
161 1.1 bouyer if (nb == 0) {
162 1.3 fvdl pref = ext2fs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
163 1.5 mycroft error = ext2fs_alloc(ip, lbn, pref, cred, &newb);
164 1.1 bouyer if (error)
165 1.1 bouyer return (error);
166 1.1 bouyer nb = newb;
167 1.3 fvdl *allocblk++ = nb;
168 1.1 bouyer ip->i_e2fs_last_blk = newb;
169 1.1 bouyer bp = getblk(vp, indirs[1].in_lbn, fs->e2fs_bsize, 0, 0);
170 1.1 bouyer bp->b_blkno = fsbtodb(fs, newb);
171 1.1 bouyer clrbuf(bp);
172 1.1 bouyer /*
173 1.1 bouyer * Write synchronously so that indirect blocks
174 1.1 bouyer * never point at garbage.
175 1.1 bouyer */
176 1.3 fvdl if ((error = bwrite(bp)) != 0)
177 1.3 fvdl goto fail;
178 1.5 mycroft unwindidx = 0;
179 1.3 fvdl allocib = &ip->i_e2fs_blocks[NDADDR + indirs[0].in_off];
180 1.3 fvdl *allocib = h2fs32(newb);
181 1.1 bouyer ip->i_flag |= IN_CHANGE | IN_UPDATE;
182 1.1 bouyer }
183 1.1 bouyer /*
184 1.1 bouyer * Fetch through the indirect blocks, allocating as necessary.
185 1.1 bouyer */
186 1.1 bouyer for (i = 1;;) {
187 1.1 bouyer error = bread(vp,
188 1.5 mycroft indirs[i].in_lbn, (int)fs->e2fs_bsize, NOCRED, &bp);
189 1.1 bouyer if (error) {
190 1.1 bouyer brelse(bp);
191 1.3 fvdl goto fail;
192 1.1 bouyer }
193 1.3 fvdl bap = (ufs_daddr_t *)bp->b_data;
194 1.2 bouyer nb = fs2h32(bap[indirs[i].in_off]);
195 1.1 bouyer if (i == num)
196 1.1 bouyer break;
197 1.5 mycroft i++;
198 1.1 bouyer if (nb != 0) {
199 1.1 bouyer brelse(bp);
200 1.1 bouyer continue;
201 1.1 bouyer }
202 1.3 fvdl pref = ext2fs_blkpref(ip, lbn, 0, (ufs_daddr_t *)0);
203 1.5 mycroft error = ext2fs_alloc(ip, lbn, pref, cred, &newb);
204 1.1 bouyer if (error) {
205 1.1 bouyer brelse(bp);
206 1.3 fvdl goto fail;
207 1.1 bouyer }
208 1.1 bouyer nb = newb;
209 1.3 fvdl *allocblk++ = nb;
210 1.1 bouyer ip->i_e2fs_last_blk = newb;
211 1.1 bouyer nbp = getblk(vp, indirs[i].in_lbn, fs->e2fs_bsize, 0, 0);
212 1.1 bouyer nbp->b_blkno = fsbtodb(fs, nb);
213 1.1 bouyer clrbuf(nbp);
214 1.1 bouyer /*
215 1.1 bouyer * Write synchronously so that indirect blocks
216 1.1 bouyer * never point at garbage.
217 1.1 bouyer */
218 1.1 bouyer if ((error = bwrite(nbp)) != 0) {
219 1.1 bouyer brelse(bp);
220 1.3 fvdl goto fail;
221 1.1 bouyer }
222 1.5 mycroft if (unwindidx < 0)
223 1.5 mycroft unwindidx = i - 1;
224 1.2 bouyer bap[indirs[i - 1].in_off] = h2fs32(nb);
225 1.1 bouyer /*
226 1.1 bouyer * If required, write synchronously, otherwise use
227 1.1 bouyer * delayed write.
228 1.1 bouyer */
229 1.1 bouyer if (flags & B_SYNC) {
230 1.1 bouyer bwrite(bp);
231 1.1 bouyer } else {
232 1.1 bouyer bdwrite(bp);
233 1.1 bouyer }
234 1.1 bouyer }
235 1.1 bouyer /*
236 1.1 bouyer * Get the data block, allocating if necessary.
237 1.1 bouyer */
238 1.1 bouyer if (nb == 0) {
239 1.5 mycroft pref = ext2fs_blkpref(ip, lbn, indirs[num].in_off, &bap[0]);
240 1.5 mycroft error = ext2fs_alloc(ip, lbn, pref, cred, &newb);
241 1.1 bouyer if (error) {
242 1.1 bouyer brelse(bp);
243 1.3 fvdl goto fail;
244 1.1 bouyer }
245 1.1 bouyer nb = newb;
246 1.3 fvdl *allocblk++ = nb;
247 1.1 bouyer ip->i_e2fs_last_lblk = lbn;
248 1.1 bouyer ip->i_e2fs_last_blk = newb;
249 1.5 mycroft bap[indirs[num].in_off] = h2fs32(nb);
250 1.1 bouyer /*
251 1.1 bouyer * If required, write synchronously, otherwise use
252 1.1 bouyer * delayed write.
253 1.1 bouyer */
254 1.1 bouyer if (flags & B_SYNC) {
255 1.1 bouyer bwrite(bp);
256 1.1 bouyer } else {
257 1.1 bouyer bdwrite(bp);
258 1.1 bouyer }
259 1.7 chs if (bpp != NULL) {
260 1.7 chs nbp = getblk(vp, lbn, fs->e2fs_bsize, 0, 0);
261 1.7 chs nbp->b_blkno = fsbtodb(fs, nb);
262 1.7 chs if (flags & B_CLRBUF)
263 1.7 chs clrbuf(nbp);
264 1.7 chs *bpp = nbp;
265 1.7 chs }
266 1.1 bouyer return (0);
267 1.1 bouyer }
268 1.1 bouyer brelse(bp);
269 1.7 chs if (bpp != NULL) {
270 1.7 chs if (flags & B_CLRBUF) {
271 1.7 chs error = bread(vp, lbn, (int)fs->e2fs_bsize, NOCRED,
272 1.7 chs &nbp);
273 1.7 chs if (error) {
274 1.7 chs brelse(nbp);
275 1.7 chs goto fail;
276 1.7 chs }
277 1.7 chs } else {
278 1.7 chs nbp = getblk(vp, lbn, fs->e2fs_bsize, 0, 0);
279 1.7 chs nbp->b_blkno = fsbtodb(fs, nb);
280 1.1 bouyer }
281 1.7 chs *bpp = nbp;
282 1.1 bouyer }
283 1.1 bouyer return (0);
284 1.3 fvdl fail:
285 1.3 fvdl /*
286 1.3 fvdl * If we have failed part way through block allocation, we
287 1.3 fvdl * have to deallocate any indirect blocks that we have allocated.
288 1.3 fvdl */
289 1.3 fvdl for (deallocated = 0, blkp = allociblk; blkp < allocblk; blkp++) {
290 1.3 fvdl ext2fs_blkfree(ip, *blkp);
291 1.3 fvdl deallocated += fs->e2fs_bsize;
292 1.3 fvdl }
293 1.5 mycroft if (unwindidx >= 0) {
294 1.5 mycroft if (unwindidx == 0) {
295 1.5 mycroft *allocib = 0;
296 1.5 mycroft } else {
297 1.5 mycroft int r;
298 1.5 mycroft
299 1.5 mycroft r = bread(vp, indirs[unwindidx].in_lbn,
300 1.5 mycroft (int)fs->e2fs_bsize, NOCRED, &bp);
301 1.5 mycroft if (r) {
302 1.5 mycroft panic("Could not unwind indirect block, error %d", r);
303 1.5 mycroft brelse(bp);
304 1.5 mycroft } else {
305 1.5 mycroft bap = (ufs_daddr_t *)bp->b_data;
306 1.5 mycroft bap[indirs[unwindidx].in_off] = 0;
307 1.5 mycroft if (flags & B_SYNC)
308 1.5 mycroft bwrite(bp);
309 1.5 mycroft else
310 1.5 mycroft bdwrite(bp);
311 1.5 mycroft }
312 1.5 mycroft }
313 1.5 mycroft for (i = unwindidx + 1; i <= num; i++) {
314 1.5 mycroft bp = getblk(vp, indirs[i].in_lbn, (int)fs->e2fs_bsize,
315 1.5 mycroft 0, 0);
316 1.5 mycroft bp->b_flags |= B_INVAL;
317 1.5 mycroft brelse(bp);
318 1.5 mycroft }
319 1.5 mycroft }
320 1.3 fvdl if (deallocated) {
321 1.3 fvdl ip->i_e2fs_nblock -= btodb(deallocated);
322 1.3 fvdl ip->i_e2fs_flags |= IN_CHANGE | IN_UPDATE;
323 1.3 fvdl }
324 1.7 chs return error;
325 1.7 chs }
326 1.7 chs
327 1.7 chs int
328 1.11 chs ext2fs_gop_alloc(struct vnode *vp, off_t off, off_t len, int flags,
329 1.11 chs struct ucred *cred)
330 1.7 chs {
331 1.7 chs struct inode *ip = VTOI(vp);
332 1.7 chs struct m_ext2fs *fs = ip->i_e2fs;
333 1.7 chs int error, delta, bshift, bsize;
334 1.11 chs UVMHIST_FUNC("ext2fs_gop_alloc"); UVMHIST_CALLED(ubchist);
335 1.7 chs
336 1.7 chs bshift = fs->e2fs_bshift;
337 1.7 chs bsize = 1 << bshift;
338 1.7 chs
339 1.7 chs delta = off & (bsize - 1);
340 1.7 chs off -= delta;
341 1.7 chs len += delta;
342 1.7 chs
343 1.7 chs while (len > 0) {
344 1.7 chs bsize = min(bsize, len);
345 1.7 chs UVMHIST_LOG(ubchist, "off 0x%x len 0x%x bsize 0x%x",
346 1.7 chs off, len, bsize, 0);
347 1.7 chs
348 1.11 chs error = ext2fs_balloc(ip, lblkno(fs, off), bsize, cred,
349 1.11 chs NULL, flags);
350 1.7 chs if (error) {
351 1.7 chs UVMHIST_LOG(ubchist, "error %d", error, 0,0,0);
352 1.7 chs return error;
353 1.7 chs }
354 1.7 chs
355 1.7 chs /*
356 1.7 chs * increase file size now, VOP_BALLOC() requires that
357 1.7 chs * EOF be up-to-date before each call.
358 1.7 chs */
359 1.7 chs
360 1.7 chs if (ip->i_e2fs_size < off + bsize) {
361 1.7 chs UVMHIST_LOG(ubchist, "old 0x%x new 0x%x",
362 1.7 chs ip->i_e2fs_size, off + bsize,0,0);
363 1.7 chs ip->i_e2fs_size = off + bsize;
364 1.7 chs }
365 1.7 chs
366 1.7 chs off += bsize;
367 1.7 chs len -= bsize;
368 1.7 chs }
369 1.7 chs return 0;
370 1.1 bouyer }
371