2 * modified for Lites 1.1
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
8 * Copyright (c) 1982, 1986, 1989, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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.
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
39 * @(#)ffs_balloc.c 8.4 (Berkeley) 9/23/93
42 #include <sys/param.h>
43 #include <sys/systm.h>
46 #include <sys/ucred.h>
47 #include <sys/vnode.h>
49 #include <ufs/ufs/quota.h>
50 #include <ufs/ufs/inode.h>
51 #include <ufs/ufs/ufs_extern.h>
53 #include <gnu/ext2fs/ext2_fs.h>
54 #include <gnu/ext2fs/ext2_fs_sb.h>
55 #include <gnu/ext2fs/fs.h>
56 #include <gnu/ext2fs/ext2_extern.h>
59 * Balloc defines the structure of file system storage
60 * by allocating the physical blocks on a device given
61 * the inode and the logical block number in a file.
64 ext2_balloc(ip, bn, size, cred, bpp, flags)
65 register struct inode *ip;
72 register struct ext2_sb_info *fs;
75 struct vnode *vp = ITOV(ip);
76 struct indir indirs[NIADDR + 2];
77 daddr_t newb, lbn, *bap, pref;
78 int osize, nsize, num, i, error;
80 ext2_debug("ext2_balloc called (%d, %d, %d)\n",
81 ip->i_number, (int)bn, (int)size);
90 * check if this is a sequential block allocation.
91 * If so, increment next_alloc fields to allow ext2_blkpref
92 * to make a good guess
94 if (lbn == ip->i_next_alloc_block + 1) {
95 ip->i_next_alloc_block++;
96 ip->i_next_alloc_goal++;
100 * The first NDADDR blocks are direct blocks
104 /* no new block is to be allocated, and no need to expand
106 if (nb != 0 && ip->i_size >= (bn + 1) * fs->s_blocksize) {
107 error = bread(vp, bn, fs->s_blocksize, NOCRED, &bp);
117 * Consider need to reallocate a fragment.
119 osize = fragroundup(fs, blkoff(fs, ip->i_size));
120 nsize = fragroundup(fs, size);
121 if (nsize <= osize) {
122 error = bread(vp, bn, osize, NOCRED, &bp);
128 /* Godmar thinks: this shouldn't happen w/o fragments */
129 printf("nsize %d(%d) > osize %d(%d) nb %d\n",
130 (int)nsize, (int)size, (int)osize,
131 (int)ip->i_size, (int)nb);
133 "ext2_balloc: Something is terribly wrong");
135 * please note there haven't been any changes from here on -
140 if (ip->i_size < (bn + 1) * fs->s_blocksize)
141 nsize = fragroundup(fs, size);
143 nsize = fs->s_blocksize;
144 error = ext2_alloc(ip, bn,
145 ext2_blkpref(ip, bn, (int)bn, &ip->i_db[0], 0),
149 bp = getblk(vp, bn, nsize, 0, 0);
150 bp->b_blkno = fsbtodb(fs, newb);
151 if (flags & B_CLRBUF)
154 ip->i_db[bn] = dbtofsb(fs, bp->b_blkno);
155 ip->i_flag |= IN_CHANGE | IN_UPDATE;
160 * Determine the number of levels of indirection.
163 if ((error = ufs_getlbns(vp, bn, indirs, &num)) != 0)
167 panic ("ext2_balloc: ufs_bmaparray returned indirect block");
170 * Fetch the first indirect block allocating if necessary.
173 nb = ip->i_ib[indirs[0].in_off];
176 pref = ext2_blkpref(ip, lbn, 0, (daddr_t *)0, 0);
178 /* see the comment by ext2_blkpref. What we do here is
179 to pretend that it'd be good for a block holding indirect
180 pointers to be allocated near its predecessor in terms
181 of indirection, or the last direct block.
182 We shamelessly exploit the fact that i_ib immediately
184 Godmar thinks it make sense to allocate i_ib[0] immediately
185 after i_db[11], but it's not utterly clear whether this also
186 applies to i_ib[1] and i_ib[0]
189 pref = ext2_blkpref(ip, lbn, indirs[0].in_off +
190 EXT2_NDIR_BLOCKS, &ip->i_db[0], 0);
192 if ((error = ext2_alloc(ip, lbn, pref, (int)fs->s_blocksize,
196 bp = getblk(vp, indirs[1].in_lbn, fs->s_blocksize, 0, 0);
197 bp->b_blkno = fsbtodb(fs, newb);
200 * Write synchronously so that indirect blocks
201 * never point at garbage.
203 if ((error = bwrite(bp)) != 0) {
204 ext2_blkfree(ip, nb, fs->s_blocksize);
207 ip->i_ib[indirs[0].in_off] = newb;
208 ip->i_flag |= IN_CHANGE | IN_UPDATE;
211 * Fetch through the indirect blocks, allocating as necessary.
215 indirs[i].in_lbn, (int)fs->s_blocksize, NOCRED, &bp);
220 bap = (daddr_t *)bp->b_data;
221 nb = bap[indirs[i].in_off];
231 /* see the comment above and by ext2_blkpref
232 * I think this implements Linux policy, but
233 * does it really make sense to allocate to
234 * block containing pointers together ?
235 * Also, will it ever succeed ?
237 pref = ext2_blkpref(ip, lbn, indirs[i].in_off, bap,
240 pref = ext2_blkpref(ip, lbn, 0, (daddr_t *)0, 0);
243 ext2_alloc(ip, lbn, pref, (int)fs->s_blocksize, cred, &newb)) != 0) {
248 nbp = getblk(vp, indirs[i].in_lbn, fs->s_blocksize, 0, 0);
249 nbp->b_blkno = fsbtodb(fs, nb);
252 * Write synchronously so that indirect blocks
253 * never point at garbage.
255 if ((error = bwrite(nbp)) != 0) {
256 ext2_blkfree(ip, nb, fs->s_blocksize);
260 bap[indirs[i - 1].in_off] = nb;
262 * If required, write synchronously, otherwise use
265 if (flags & B_SYNC) {
272 * Get the data block, allocating if necessary.
275 pref = ext2_blkpref(ip, lbn, indirs[i].in_off, &bap[0],
277 if ((error = ext2_alloc(ip,
278 lbn, pref, (int)fs->s_blocksize, cred, &newb)) != 0) {
283 nbp = getblk(vp, lbn, fs->s_blocksize, 0, 0);
284 nbp->b_blkno = fsbtodb(fs, nb);
285 if (flags & B_CLRBUF)
287 bap[indirs[i].in_off] = nb;
289 * If required, write synchronously, otherwise use
292 if (flags & B_SYNC) {
301 if (flags & B_CLRBUF) {
302 error = bread(vp, lbn, (int)fs->s_blocksize, NOCRED, &nbp);
308 nbp = getblk(vp, lbn, fs->s_blocksize, 0, 0);
309 nbp->b_blkno = fsbtodb(fs, nb);