ffs_balloc.c revision 1.21 1 1.21 agc /* $NetBSD: ffs_balloc.c,v 1.21 2015/03/29 05:52:59 agc Exp $ */
2 1.1 lukem /* From NetBSD: ffs_balloc.c,v 1.25 2001/08/08 08:36:36 lukem Exp */
3 1.1 lukem
4 1.1 lukem /*
5 1.1 lukem * Copyright (c) 1982, 1986, 1989, 1993
6 1.1 lukem * The Regents of the University of California. All rights reserved.
7 1.1 lukem *
8 1.1 lukem * Redistribution and use in source and binary forms, with or without
9 1.1 lukem * modification, are permitted provided that the following conditions
10 1.1 lukem * are met:
11 1.1 lukem * 1. Redistributions of source code must retain the above copyright
12 1.1 lukem * notice, this list of conditions and the following disclaimer.
13 1.1 lukem * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 lukem * notice, this list of conditions and the following disclaimer in the
15 1.1 lukem * documentation and/or other materials provided with the distribution.
16 1.12 agc * 3. Neither the name of the University nor the names of its contributors
17 1.1 lukem * may be used to endorse or promote products derived from this software
18 1.1 lukem * without specific prior written permission.
19 1.1 lukem *
20 1.1 lukem * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 1.1 lukem * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 1.1 lukem * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 1.1 lukem * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 1.1 lukem * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 1.1 lukem * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 1.1 lukem * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 1.1 lukem * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 1.1 lukem * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 1.1 lukem * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 1.1 lukem * SUCH DAMAGE.
31 1.1 lukem *
32 1.1 lukem * @(#)ffs_balloc.c 8.8 (Berkeley) 6/16/95
33 1.1 lukem */
34 1.2 lukem
35 1.13 jmc #if HAVE_NBTOOL_CONFIG_H
36 1.13 jmc #include "nbtool_config.h"
37 1.13 jmc #endif
38 1.13 jmc
39 1.2 lukem #include <sys/cdefs.h>
40 1.9 tv #if defined(__RCSID) && !defined(__lint)
41 1.21 agc __RCSID("$NetBSD: ffs_balloc.c,v 1.21 2015/03/29 05:52:59 agc Exp $");
42 1.2 lukem #endif /* !__lint */
43 1.1 lukem
44 1.1 lukem #include <sys/param.h>
45 1.1 lukem #include <sys/time.h>
46 1.1 lukem
47 1.1 lukem #include <assert.h>
48 1.1 lukem #include <errno.h>
49 1.1 lukem #include <stdio.h>
50 1.4 thorpej #include <stdlib.h>
51 1.1 lukem #include <string.h>
52 1.5 lukem
53 1.5 lukem #include "makefs.h"
54 1.1 lukem
55 1.8 lukem #include <ufs/ufs/dinode.h>
56 1.6 lukem #include <ufs/ufs/ufs_bswap.h>
57 1.6 lukem #include <ufs/ffs/fs.h>
58 1.1 lukem
59 1.1 lukem #include "ffs/buf.h"
60 1.7 lukem #include "ffs/ufs_inode.h"
61 1.1 lukem #include "ffs/ffs_extern.h"
62 1.1 lukem
63 1.11 fvdl static int ffs_balloc_ufs1(struct inode *, off_t, int, struct buf **);
64 1.11 fvdl static int ffs_balloc_ufs2(struct inode *, off_t, int, struct buf **);
65 1.11 fvdl
66 1.1 lukem /*
67 1.1 lukem * Balloc defines the structure of file system storage
68 1.1 lukem * by allocating the physical blocks on a device given
69 1.1 lukem * the inode and the logical block number in a file.
70 1.1 lukem *
71 1.1 lukem * Assume: flags == B_SYNC | B_CLRBUF
72 1.1 lukem */
73 1.11 fvdl
74 1.1 lukem int
75 1.1 lukem ffs_balloc(struct inode *ip, off_t offset, int bufsize, struct buf **bpp)
76 1.1 lukem {
77 1.11 fvdl if (ip->i_fs->fs_magic == FS_UFS2_MAGIC)
78 1.11 fvdl return ffs_balloc_ufs2(ip, offset, bufsize, bpp);
79 1.11 fvdl else
80 1.11 fvdl return ffs_balloc_ufs1(ip, offset, bufsize, bpp);
81 1.11 fvdl }
82 1.11 fvdl
83 1.11 fvdl static int
84 1.11 fvdl ffs_balloc_ufs1(struct inode *ip, off_t offset, int bufsize, struct buf **bpp)
85 1.11 fvdl {
86 1.11 fvdl daddr_t lbn, lastlbn;
87 1.1 lukem int size;
88 1.11 fvdl int32_t nb;
89 1.1 lukem struct buf *bp, *nbp;
90 1.1 lukem struct fs *fs = ip->i_fs;
91 1.14 dholland struct indir indirs[UFS_NIADDR + 2];
92 1.10 fvdl daddr_t newb, pref;
93 1.11 fvdl int32_t *bap;
94 1.1 lukem int osize, nsize, num, i, error;
95 1.14 dholland int32_t *allocblk, allociblk[UFS_NIADDR + 1];
96 1.11 fvdl int32_t *allocib;
97 1.1 lukem const int needswap = UFS_FSNEEDSWAP(fs);
98 1.1 lukem
99 1.20 dholland lbn = ffs_lblkno(fs, offset);
100 1.18 dholland size = ffs_blkoff(fs, offset) + bufsize;
101 1.1 lukem if (bpp != NULL) {
102 1.1 lukem *bpp = NULL;
103 1.1 lukem }
104 1.1 lukem
105 1.1 lukem assert(size <= fs->fs_bsize);
106 1.1 lukem if (lbn < 0)
107 1.1 lukem return (EFBIG);
108 1.1 lukem
109 1.1 lukem /*
110 1.1 lukem * If the next write will extend the file into a new block,
111 1.1 lukem * and the file is currently composed of a fragment
112 1.1 lukem * this fragment has to be extended to be a full block.
113 1.1 lukem */
114 1.1 lukem
115 1.20 dholland lastlbn = ffs_lblkno(fs, ip->i_ffs1_size);
116 1.14 dholland if (lastlbn < UFS_NDADDR && lastlbn < lbn) {
117 1.11 fvdl nb = lastlbn;
118 1.18 dholland osize = ffs_blksize(fs, ip, nb);
119 1.1 lukem if (osize < fs->fs_bsize && osize > 0) {
120 1.1 lukem warnx("need to ffs_realloccg; not supported!");
121 1.1 lukem abort();
122 1.1 lukem }
123 1.1 lukem }
124 1.1 lukem
125 1.1 lukem /*
126 1.14 dholland * The first UFS_NDADDR blocks are direct blocks
127 1.1 lukem */
128 1.1 lukem
129 1.14 dholland if (lbn < UFS_NDADDR) {
130 1.11 fvdl nb = ufs_rw32(ip->i_ffs1_db[lbn], needswap);
131 1.20 dholland if (nb != 0 && ip->i_ffs1_size >= ffs_lblktosize(fs, lbn + 1)) {
132 1.1 lukem
133 1.1 lukem /*
134 1.1 lukem * The block is an already-allocated direct block
135 1.1 lukem * and the file already extends past this block,
136 1.1 lukem * thus this must be a whole block.
137 1.1 lukem * Just read the block (if requested).
138 1.1 lukem */
139 1.1 lukem
140 1.1 lukem if (bpp != NULL) {
141 1.17 christos error = bread(ip->i_devvp, lbn, fs->fs_bsize,
142 1.21 agc 0, bpp);
143 1.1 lukem if (error) {
144 1.15 christos brelse(*bpp, 0);
145 1.1 lukem return (error);
146 1.1 lukem }
147 1.1 lukem }
148 1.1 lukem return (0);
149 1.1 lukem }
150 1.1 lukem if (nb != 0) {
151 1.1 lukem
152 1.1 lukem /*
153 1.1 lukem * Consider need to reallocate a fragment.
154 1.1 lukem */
155 1.1 lukem
156 1.20 dholland osize = ffs_fragroundup(fs, ffs_blkoff(fs, ip->i_ffs1_size));
157 1.20 dholland nsize = ffs_fragroundup(fs, size);
158 1.1 lukem if (nsize <= osize) {
159 1.1 lukem
160 1.1 lukem /*
161 1.1 lukem * The existing block is already
162 1.1 lukem * at least as big as we want.
163 1.1 lukem * Just read the block (if requested).
164 1.1 lukem */
165 1.1 lukem
166 1.1 lukem if (bpp != NULL) {
167 1.17 christos error = bread(ip->i_devvp, lbn, osize,
168 1.21 agc 0, bpp);
169 1.1 lukem if (error) {
170 1.15 christos brelse(*bpp, 0);
171 1.1 lukem return (error);
172 1.1 lukem }
173 1.1 lukem }
174 1.1 lukem return 0;
175 1.1 lukem } else {
176 1.1 lukem warnx("need to ffs_realloccg; not supported!");
177 1.1 lukem abort();
178 1.1 lukem }
179 1.1 lukem } else {
180 1.1 lukem
181 1.1 lukem /*
182 1.1 lukem * the block was not previously allocated,
183 1.1 lukem * allocate a new block or fragment.
184 1.1 lukem */
185 1.1 lukem
186 1.20 dholland if (ip->i_ffs1_size < ffs_lblktosize(fs, lbn + 1))
187 1.20 dholland nsize = ffs_fragroundup(fs, size);
188 1.1 lukem else
189 1.1 lukem nsize = fs->fs_bsize;
190 1.1 lukem error = ffs_alloc(ip, lbn,
191 1.11 fvdl ffs_blkpref_ufs1(ip, lbn, (int)lbn,
192 1.11 fvdl &ip->i_ffs1_db[0]),
193 1.1 lukem nsize, &newb);
194 1.1 lukem if (error)
195 1.1 lukem return (error);
196 1.1 lukem if (bpp != NULL) {
197 1.17 christos bp = getblk(ip->i_devvp, lbn, nsize, 0, 0);
198 1.19 dholland bp->b_blkno = FFS_FSBTODB(fs, newb);
199 1.1 lukem clrbuf(bp);
200 1.1 lukem *bpp = bp;
201 1.1 lukem }
202 1.1 lukem }
203 1.11 fvdl ip->i_ffs1_db[lbn] = ufs_rw32((int32_t)newb, needswap);
204 1.1 lukem return (0);
205 1.1 lukem }
206 1.11 fvdl
207 1.1 lukem /*
208 1.1 lukem * Determine the number of levels of indirection.
209 1.1 lukem */
210 1.11 fvdl
211 1.1 lukem pref = 0;
212 1.1 lukem if ((error = ufs_getlbns(ip, lbn, indirs, &num)) != 0)
213 1.11 fvdl return (error);
214 1.1 lukem
215 1.1 lukem if (num < 1) {
216 1.1 lukem warnx("ffs_balloc: ufs_getlbns returned indirect block");
217 1.1 lukem abort();
218 1.1 lukem }
219 1.11 fvdl
220 1.1 lukem /*
221 1.1 lukem * Fetch the first indirect block allocating if necessary.
222 1.1 lukem */
223 1.11 fvdl
224 1.1 lukem --num;
225 1.11 fvdl nb = ufs_rw32(ip->i_ffs1_ib[indirs[0].in_off], needswap);
226 1.1 lukem allocib = NULL;
227 1.1 lukem allocblk = allociblk;
228 1.1 lukem if (nb == 0) {
229 1.11 fvdl pref = ffs_blkpref_ufs1(ip, lbn, 0, (int32_t *)0);
230 1.1 lukem error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
231 1.1 lukem if (error)
232 1.11 fvdl return error;
233 1.1 lukem nb = newb;
234 1.1 lukem *allocblk++ = nb;
235 1.17 christos bp = getblk(ip->i_devvp, indirs[1].in_lbn, fs->fs_bsize, 0, 0);
236 1.19 dholland bp->b_blkno = FFS_FSBTODB(fs, nb);
237 1.1 lukem clrbuf(bp);
238 1.1 lukem /*
239 1.1 lukem * Write synchronously so that indirect blocks
240 1.1 lukem * never point at garbage.
241 1.1 lukem */
242 1.1 lukem if ((error = bwrite(bp)) != 0)
243 1.11 fvdl return error;
244 1.11 fvdl allocib = &ip->i_ffs1_ib[indirs[0].in_off];
245 1.10 fvdl *allocib = ufs_rw32((int32_t)nb, needswap);
246 1.1 lukem }
247 1.11 fvdl
248 1.1 lukem /*
249 1.1 lukem * Fetch through the indirect blocks, allocating as necessary.
250 1.1 lukem */
251 1.11 fvdl
252 1.1 lukem for (i = 1;;) {
253 1.17 christos error = bread(ip->i_devvp, indirs[i].in_lbn, fs->fs_bsize,
254 1.21 agc 0, &bp);
255 1.1 lukem if (error) {
256 1.15 christos brelse(bp, 0);
257 1.11 fvdl return error;
258 1.1 lukem }
259 1.10 fvdl bap = (int32_t *)bp->b_data;
260 1.1 lukem nb = ufs_rw32(bap[indirs[i].in_off], needswap);
261 1.1 lukem if (i == num)
262 1.1 lukem break;
263 1.1 lukem i++;
264 1.1 lukem if (nb != 0) {
265 1.15 christos brelse(bp, 0);
266 1.1 lukem continue;
267 1.1 lukem }
268 1.1 lukem if (pref == 0)
269 1.11 fvdl pref = ffs_blkpref_ufs1(ip, lbn, 0, (int32_t *)0);
270 1.1 lukem error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
271 1.1 lukem if (error) {
272 1.15 christos brelse(bp, 0);
273 1.11 fvdl return error;
274 1.1 lukem }
275 1.1 lukem nb = newb;
276 1.1 lukem *allocblk++ = nb;
277 1.17 christos nbp = getblk(ip->i_devvp, indirs[i].in_lbn, fs->fs_bsize, 0, 0);
278 1.19 dholland nbp->b_blkno = FFS_FSBTODB(fs, nb);
279 1.1 lukem clrbuf(nbp);
280 1.1 lukem /*
281 1.1 lukem * Write synchronously so that indirect blocks
282 1.1 lukem * never point at garbage.
283 1.1 lukem */
284 1.11 fvdl
285 1.1 lukem if ((error = bwrite(nbp)) != 0) {
286 1.15 christos brelse(bp, 0);
287 1.11 fvdl return error;
288 1.1 lukem }
289 1.1 lukem bap[indirs[i - 1].in_off] = ufs_rw32(nb, needswap);
290 1.11 fvdl
291 1.11 fvdl bwrite(bp);
292 1.11 fvdl }
293 1.11 fvdl
294 1.11 fvdl /*
295 1.11 fvdl * Get the data block, allocating if necessary.
296 1.11 fvdl */
297 1.11 fvdl
298 1.11 fvdl if (nb == 0) {
299 1.11 fvdl pref = ffs_blkpref_ufs1(ip, lbn, indirs[num].in_off, &bap[0]);
300 1.11 fvdl error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
301 1.11 fvdl if (error) {
302 1.15 christos brelse(bp, 0);
303 1.11 fvdl return error;
304 1.11 fvdl }
305 1.11 fvdl nb = newb;
306 1.11 fvdl *allocblk++ = nb;
307 1.11 fvdl if (bpp != NULL) {
308 1.17 christos nbp = getblk(ip->i_devvp, lbn, fs->fs_bsize, 0, 0);
309 1.19 dholland nbp->b_blkno = FFS_FSBTODB(fs, nb);
310 1.11 fvdl clrbuf(nbp);
311 1.11 fvdl *bpp = nbp;
312 1.11 fvdl }
313 1.11 fvdl bap[indirs[num].in_off] = ufs_rw32(nb, needswap);
314 1.11 fvdl
315 1.1 lukem /*
316 1.1 lukem * If required, write synchronously, otherwise use
317 1.1 lukem * delayed write.
318 1.1 lukem */
319 1.1 lukem bwrite(bp);
320 1.11 fvdl return (0);
321 1.11 fvdl }
322 1.15 christos brelse(bp, 0);
323 1.11 fvdl if (bpp != NULL) {
324 1.21 agc error = bread(ip->i_devvp, lbn, (int)fs->fs_bsize, 0, &nbp);
325 1.11 fvdl if (error) {
326 1.15 christos brelse(nbp, 0);
327 1.11 fvdl return error;
328 1.11 fvdl }
329 1.11 fvdl *bpp = nbp;
330 1.11 fvdl }
331 1.11 fvdl return (0);
332 1.11 fvdl }
333 1.11 fvdl
334 1.11 fvdl static int
335 1.11 fvdl ffs_balloc_ufs2(struct inode *ip, off_t offset, int bufsize, struct buf **bpp)
336 1.11 fvdl {
337 1.11 fvdl daddr_t lbn, lastlbn;
338 1.11 fvdl int size;
339 1.11 fvdl struct buf *bp, *nbp;
340 1.11 fvdl struct fs *fs = ip->i_fs;
341 1.14 dholland struct indir indirs[UFS_NIADDR + 2];
342 1.11 fvdl daddr_t newb, pref, nb;
343 1.11 fvdl int64_t *bap;
344 1.11 fvdl int osize, nsize, num, i, error;
345 1.14 dholland int64_t *allocblk, allociblk[UFS_NIADDR + 1];
346 1.11 fvdl int64_t *allocib;
347 1.11 fvdl const int needswap = UFS_FSNEEDSWAP(fs);
348 1.11 fvdl
349 1.20 dholland lbn = ffs_lblkno(fs, offset);
350 1.18 dholland size = ffs_blkoff(fs, offset) + bufsize;
351 1.11 fvdl if (bpp != NULL) {
352 1.11 fvdl *bpp = NULL;
353 1.1 lukem }
354 1.11 fvdl
355 1.11 fvdl assert(size <= fs->fs_bsize);
356 1.11 fvdl if (lbn < 0)
357 1.11 fvdl return (EFBIG);
358 1.11 fvdl
359 1.11 fvdl /*
360 1.11 fvdl * If the next write will extend the file into a new block,
361 1.11 fvdl * and the file is currently composed of a fragment
362 1.11 fvdl * this fragment has to be extended to be a full block.
363 1.11 fvdl */
364 1.11 fvdl
365 1.20 dholland lastlbn = ffs_lblkno(fs, ip->i_ffs2_size);
366 1.14 dholland if (lastlbn < UFS_NDADDR && lastlbn < lbn) {
367 1.11 fvdl nb = lastlbn;
368 1.18 dholland osize = ffs_blksize(fs, ip, nb);
369 1.11 fvdl if (osize < fs->fs_bsize && osize > 0) {
370 1.11 fvdl warnx("need to ffs_realloccg; not supported!");
371 1.11 fvdl abort();
372 1.11 fvdl }
373 1.11 fvdl }
374 1.11 fvdl
375 1.11 fvdl /*
376 1.14 dholland * The first UFS_NDADDR blocks are direct blocks
377 1.11 fvdl */
378 1.11 fvdl
379 1.14 dholland if (lbn < UFS_NDADDR) {
380 1.11 fvdl nb = ufs_rw64(ip->i_ffs2_db[lbn], needswap);
381 1.20 dholland if (nb != 0 && ip->i_ffs2_size >= ffs_lblktosize(fs, lbn + 1)) {
382 1.11 fvdl
383 1.11 fvdl /*
384 1.11 fvdl * The block is an already-allocated direct block
385 1.11 fvdl * and the file already extends past this block,
386 1.11 fvdl * thus this must be a whole block.
387 1.11 fvdl * Just read the block (if requested).
388 1.11 fvdl */
389 1.11 fvdl
390 1.11 fvdl if (bpp != NULL) {
391 1.17 christos error = bread(ip->i_devvp, lbn, fs->fs_bsize,
392 1.21 agc 0, bpp);
393 1.11 fvdl if (error) {
394 1.15 christos brelse(*bpp, 0);
395 1.11 fvdl return (error);
396 1.11 fvdl }
397 1.11 fvdl }
398 1.11 fvdl return (0);
399 1.11 fvdl }
400 1.11 fvdl if (nb != 0) {
401 1.11 fvdl
402 1.11 fvdl /*
403 1.11 fvdl * Consider need to reallocate a fragment.
404 1.11 fvdl */
405 1.11 fvdl
406 1.20 dholland osize = ffs_fragroundup(fs, ffs_blkoff(fs, ip->i_ffs2_size));
407 1.20 dholland nsize = ffs_fragroundup(fs, size);
408 1.11 fvdl if (nsize <= osize) {
409 1.11 fvdl
410 1.11 fvdl /*
411 1.11 fvdl * The existing block is already
412 1.11 fvdl * at least as big as we want.
413 1.11 fvdl * Just read the block (if requested).
414 1.11 fvdl */
415 1.11 fvdl
416 1.11 fvdl if (bpp != NULL) {
417 1.17 christos error = bread(ip->i_devvp, lbn, osize,
418 1.21 agc 0, bpp);
419 1.11 fvdl if (error) {
420 1.15 christos brelse(*bpp, 0);
421 1.11 fvdl return (error);
422 1.11 fvdl }
423 1.11 fvdl }
424 1.11 fvdl return 0;
425 1.11 fvdl } else {
426 1.11 fvdl warnx("need to ffs_realloccg; not supported!");
427 1.11 fvdl abort();
428 1.11 fvdl }
429 1.11 fvdl } else {
430 1.11 fvdl
431 1.11 fvdl /*
432 1.11 fvdl * the block was not previously allocated,
433 1.11 fvdl * allocate a new block or fragment.
434 1.11 fvdl */
435 1.11 fvdl
436 1.20 dholland if (ip->i_ffs2_size < ffs_lblktosize(fs, lbn + 1))
437 1.20 dholland nsize = ffs_fragroundup(fs, size);
438 1.11 fvdl else
439 1.11 fvdl nsize = fs->fs_bsize;
440 1.11 fvdl error = ffs_alloc(ip, lbn,
441 1.11 fvdl ffs_blkpref_ufs2(ip, lbn, (int)lbn,
442 1.11 fvdl &ip->i_ffs2_db[0]),
443 1.11 fvdl nsize, &newb);
444 1.11 fvdl if (error)
445 1.11 fvdl return (error);
446 1.11 fvdl if (bpp != NULL) {
447 1.17 christos bp = getblk(ip->i_devvp, lbn, nsize, 0, 0);
448 1.19 dholland bp->b_blkno = FFS_FSBTODB(fs, newb);
449 1.11 fvdl clrbuf(bp);
450 1.11 fvdl *bpp = bp;
451 1.11 fvdl }
452 1.11 fvdl }
453 1.11 fvdl ip->i_ffs2_db[lbn] = ufs_rw64(newb, needswap);
454 1.11 fvdl return (0);
455 1.11 fvdl }
456 1.11 fvdl
457 1.11 fvdl /*
458 1.11 fvdl * Determine the number of levels of indirection.
459 1.11 fvdl */
460 1.11 fvdl
461 1.11 fvdl pref = 0;
462 1.11 fvdl if ((error = ufs_getlbns(ip, lbn, indirs, &num)) != 0)
463 1.11 fvdl return (error);
464 1.11 fvdl
465 1.11 fvdl if (num < 1) {
466 1.11 fvdl warnx("ffs_balloc: ufs_getlbns returned indirect block");
467 1.11 fvdl abort();
468 1.11 fvdl }
469 1.11 fvdl
470 1.11 fvdl /*
471 1.11 fvdl * Fetch the first indirect block allocating if necessary.
472 1.11 fvdl */
473 1.11 fvdl
474 1.11 fvdl --num;
475 1.11 fvdl nb = ufs_rw64(ip->i_ffs2_ib[indirs[0].in_off], needswap);
476 1.11 fvdl allocib = NULL;
477 1.11 fvdl allocblk = allociblk;
478 1.11 fvdl if (nb == 0) {
479 1.11 fvdl pref = ffs_blkpref_ufs2(ip, lbn, 0, (int64_t *)0);
480 1.11 fvdl error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
481 1.11 fvdl if (error)
482 1.11 fvdl return error;
483 1.11 fvdl nb = newb;
484 1.11 fvdl *allocblk++ = nb;
485 1.17 christos bp = getblk(ip->i_devvp, indirs[1].in_lbn, fs->fs_bsize, 0, 0);
486 1.19 dholland bp->b_blkno = FFS_FSBTODB(fs, nb);
487 1.11 fvdl clrbuf(bp);
488 1.11 fvdl /*
489 1.11 fvdl * Write synchronously so that indirect blocks
490 1.11 fvdl * never point at garbage.
491 1.11 fvdl */
492 1.11 fvdl if ((error = bwrite(bp)) != 0)
493 1.11 fvdl return error;
494 1.11 fvdl allocib = &ip->i_ffs2_ib[indirs[0].in_off];
495 1.11 fvdl *allocib = ufs_rw64(nb, needswap);
496 1.11 fvdl }
497 1.11 fvdl
498 1.11 fvdl /*
499 1.11 fvdl * Fetch through the indirect blocks, allocating as necessary.
500 1.11 fvdl */
501 1.11 fvdl
502 1.11 fvdl for (i = 1;;) {
503 1.17 christos error = bread(ip->i_devvp, indirs[i].in_lbn, fs->fs_bsize,
504 1.21 agc 0, &bp);
505 1.11 fvdl if (error) {
506 1.15 christos brelse(bp, 0);
507 1.11 fvdl return error;
508 1.11 fvdl }
509 1.11 fvdl bap = (int64_t *)bp->b_data;
510 1.11 fvdl nb = ufs_rw64(bap[indirs[i].in_off], needswap);
511 1.11 fvdl if (i == num)
512 1.11 fvdl break;
513 1.11 fvdl i++;
514 1.11 fvdl if (nb != 0) {
515 1.15 christos brelse(bp, 0);
516 1.11 fvdl continue;
517 1.11 fvdl }
518 1.11 fvdl if (pref == 0)
519 1.11 fvdl pref = ffs_blkpref_ufs2(ip, lbn, 0, (int64_t *)0);
520 1.11 fvdl error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
521 1.11 fvdl if (error) {
522 1.15 christos brelse(bp, 0);
523 1.11 fvdl return error;
524 1.11 fvdl }
525 1.11 fvdl nb = newb;
526 1.11 fvdl *allocblk++ = nb;
527 1.17 christos nbp = getblk(ip->i_devvp, indirs[i].in_lbn, fs->fs_bsize, 0, 0);
528 1.19 dholland nbp->b_blkno = FFS_FSBTODB(fs, nb);
529 1.11 fvdl clrbuf(nbp);
530 1.11 fvdl /*
531 1.11 fvdl * Write synchronously so that indirect blocks
532 1.11 fvdl * never point at garbage.
533 1.11 fvdl */
534 1.11 fvdl
535 1.11 fvdl if ((error = bwrite(nbp)) != 0) {
536 1.15 christos brelse(bp, 0);
537 1.11 fvdl return error;
538 1.11 fvdl }
539 1.11 fvdl bap[indirs[i - 1].in_off] = ufs_rw64(nb, needswap);
540 1.11 fvdl
541 1.11 fvdl bwrite(bp);
542 1.11 fvdl }
543 1.11 fvdl
544 1.1 lukem /*
545 1.1 lukem * Get the data block, allocating if necessary.
546 1.1 lukem */
547 1.11 fvdl
548 1.1 lukem if (nb == 0) {
549 1.11 fvdl pref = ffs_blkpref_ufs2(ip, lbn, indirs[num].in_off, &bap[0]);
550 1.1 lukem error = ffs_alloc(ip, lbn, pref, (int)fs->fs_bsize, &newb);
551 1.1 lukem if (error) {
552 1.15 christos brelse(bp, 0);
553 1.11 fvdl return error;
554 1.1 lukem }
555 1.1 lukem nb = newb;
556 1.1 lukem *allocblk++ = nb;
557 1.1 lukem if (bpp != NULL) {
558 1.17 christos nbp = getblk(ip->i_devvp, lbn, fs->fs_bsize, 0, 0);
559 1.19 dholland nbp->b_blkno = FFS_FSBTODB(fs, nb);
560 1.1 lukem clrbuf(nbp);
561 1.1 lukem *bpp = nbp;
562 1.1 lukem }
563 1.11 fvdl bap[indirs[num].in_off] = ufs_rw64(nb, needswap);
564 1.11 fvdl
565 1.1 lukem /*
566 1.1 lukem * If required, write synchronously, otherwise use
567 1.1 lukem * delayed write.
568 1.1 lukem */
569 1.1 lukem bwrite(bp);
570 1.1 lukem return (0);
571 1.1 lukem }
572 1.15 christos brelse(bp, 0);
573 1.1 lukem if (bpp != NULL) {
574 1.21 agc error = bread(ip->i_devvp, lbn, (int)fs->fs_bsize, 0,
575 1.17 christos &nbp);
576 1.11 fvdl if (error) {
577 1.15 christos brelse(nbp, 0);
578 1.11 fvdl return error;
579 1.11 fvdl }
580 1.1 lukem *bpp = nbp;
581 1.1 lukem }
582 1.1 lukem return (0);
583 1.1 lukem }
584