2 * modified for Lites 1.1
4 * Aug 1995, Godmar Back (gback@cs.utah.edu)
5 * University of Utah, Department of Computer Science
8 * SPDX-License-Identifier: BSD-3-Clause
10 * Copyright (c) 1982, 1986, 1989, 1993
11 * The Regents of the University of California. All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#)ffs_balloc.c 8.4 (Berkeley) 9/23/93
41 #include <sys/param.h>
42 #include <sys/systm.h>
46 #include <sys/mount.h>
47 #include <sys/vnode.h>
49 #include <fs/ext2fs/fs.h>
50 #include <fs/ext2fs/inode.h>
51 #include <fs/ext2fs/ext2fs.h>
52 #include <fs/ext2fs/ext2_dinode.h>
53 #include <fs/ext2fs/ext2_extern.h>
54 #include <fs/ext2fs/ext2_mount.h>
57 ext2_ext_balloc(struct inode *ip, uint32_t lbn, int size,
58 struct ucred *cred, struct buf **bpp, int flags)
61 struct buf *bp = NULL;
62 struct vnode *vp = ITOV(ip);
64 int osize, nsize, blks, error, allocated;
67 blks = howmany(size, fs->e2fs_bsize);
69 error = ext4_ext_get_blocks(ip, lbn, blks, cred, NULL, &allocated, &nb);
74 if (ip->i_size < (lbn + 1) * fs->e2fs_bsize)
75 nsize = fragroundup(fs, size);
77 nsize = fs->e2fs_bsize;
79 bp = getblk(vp, lbn, nsize, 0, 0, 0);
83 bp->b_blkno = fsbtodb(fs, nb);
84 if (flags & BA_CLRBUF)
87 if (ip->i_size >= (lbn + 1) * fs->e2fs_bsize) {
89 error = bread(vp, lbn, fs->e2fs_bsize, NOCRED, &bp);
94 bp->b_blkno = fsbtodb(fs, nb);
100 * Consider need to reallocate a fragment.
102 osize = fragroundup(fs, blkoff(fs, ip->i_size));
103 nsize = fragroundup(fs, size);
104 if (nsize <= osize) {
105 error = bread(vp, lbn, osize, NOCRED, &bp);
110 bp->b_blkno = fsbtodb(fs, nb);
112 error = bread(vp, lbn, fs->e2fs_bsize, NOCRED, &bp);
117 bp->b_blkno = fsbtodb(fs, nb);
127 * Balloc defines the structure of filesystem storage
128 * by allocating the physical blocks on a device given
129 * the inode and the logical block number in a file.
132 ext2_balloc(struct inode *ip, e2fs_lbn_t lbn, int size, struct ucred *cred,
133 struct buf **bpp, int flags)
136 struct ext2mount *ump;
137 struct buf *bp, *nbp;
138 struct vnode *vp = ITOV(ip);
139 struct indir indirs[EXT2_NIADDR + 2];
140 e4fs_daddr_t nb, newb;
141 e2fs_daddr_t *bap, pref;
142 int osize, nsize, num, i, error;
151 * check if this is a sequential block allocation.
152 * If so, increment next_alloc fields to allow ext2_blkpref
153 * to make a good guess
155 if (lbn == ip->i_next_alloc_block + 1) {
156 ip->i_next_alloc_block++;
157 ip->i_next_alloc_goal++;
160 if (ip->i_flag & IN_E4EXTENTS)
161 return (ext2_ext_balloc(ip, lbn, size, cred, bpp, flags));
164 * The first EXT2_NDADDR blocks are direct blocks
166 if (lbn < EXT2_NDADDR) {
169 * no new block is to be allocated, and no need to expand
172 if (nb != 0 && ip->i_size >= (lbn + 1) * fs->e2fs_bsize) {
173 error = bread(vp, lbn, fs->e2fs_bsize, NOCRED, &bp);
178 bp->b_blkno = fsbtodb(fs, nb);
184 * Consider need to reallocate a fragment.
186 osize = fragroundup(fs, blkoff(fs, ip->i_size));
187 nsize = fragroundup(fs, size);
188 if (nsize <= osize) {
189 error = bread(vp, lbn, osize, NOCRED, &bp);
194 bp->b_blkno = fsbtodb(fs, nb);
197 * Godmar thinks: this shouldn't happen w/o
200 printf("nsize %d(%d) > osize %d(%d) nb %d\n",
201 (int)nsize, (int)size, (int)osize,
202 (int)ip->i_size, (int)nb);
204 "ext2_balloc: Something is terribly wrong");
206 * please note there haven't been any changes from here on -
211 if (ip->i_size < (lbn + 1) * fs->e2fs_bsize)
212 nsize = fragroundup(fs, size);
214 nsize = fs->e2fs_bsize;
216 error = ext2_alloc(ip, lbn,
217 ext2_blkpref(ip, lbn, (int)lbn, &ip->i_db[0], 0),
221 bp = getblk(vp, lbn, nsize, 0, 0, 0);
222 bp->b_blkno = fsbtodb(fs, newb);
223 if (flags & BA_CLRBUF)
226 ip->i_db[lbn] = dbtofsb(fs, bp->b_blkno);
227 ip->i_flag |= IN_CHANGE | IN_UPDATE;
232 * Determine the number of levels of indirection.
235 if ((error = ext2_getlbns(vp, lbn, indirs, &num)) != 0)
239 panic("ext2_balloc: ext2_getlbns returned indirect block");
242 * Fetch the first indirect block allocating if necessary.
245 nb = ip->i_ib[indirs[0].in_off];
248 pref = ext2_blkpref(ip, lbn, indirs[0].in_off +
249 EXT2_NDIR_BLOCKS, &ip->i_db[0], 0);
250 if ((error = ext2_alloc(ip, lbn, pref, fs->e2fs_bsize, cred,
254 bp = getblk(vp, indirs[1].in_lbn, fs->e2fs_bsize, 0, 0, 0);
255 bp->b_blkno = fsbtodb(fs, newb);
258 * Write synchronously so that indirect blocks
259 * never point at garbage.
261 if ((error = bwrite(bp)) != 0) {
262 ext2_blkfree(ip, nb, fs->e2fs_bsize);
265 ip->i_ib[indirs[0].in_off] = newb;
266 ip->i_flag |= IN_CHANGE | IN_UPDATE;
269 * Fetch through the indirect blocks, allocating as necessary.
273 indirs[i].in_lbn, (int)fs->e2fs_bsize, NOCRED, &bp);
278 bap = (e2fs_daddr_t *)bp->b_data;
279 nb = bap[indirs[i].in_off];
289 pref = ext2_blkpref(ip, lbn, indirs[i].in_off, bap,
291 error = ext2_alloc(ip, lbn, pref, (int)fs->e2fs_bsize, cred, &newb);
297 nbp = getblk(vp, indirs[i].in_lbn, fs->e2fs_bsize, 0, 0, 0);
298 nbp->b_blkno = fsbtodb(fs, nb);
301 * Write synchronously so that indirect blocks
302 * never point at garbage.
304 if ((error = bwrite(nbp)) != 0) {
305 ext2_blkfree(ip, nb, fs->e2fs_bsize);
310 bap[indirs[i - 1].in_off] = nb;
312 * If required, write synchronously, otherwise use
315 if (flags & IO_SYNC) {
318 if (bp->b_bufsize == fs->e2fs_bsize)
319 bp->b_flags |= B_CLUSTEROK;
324 * Get the data block, allocating if necessary.
328 pref = ext2_blkpref(ip, lbn, indirs[i].in_off, &bap[0],
330 if ((error = ext2_alloc(ip,
331 lbn, pref, (int)fs->e2fs_bsize, cred, &newb)) != 0) {
336 nbp = getblk(vp, lbn, fs->e2fs_bsize, 0, 0, 0);
337 nbp->b_blkno = fsbtodb(fs, nb);
338 if (flags & BA_CLRBUF)
340 bap[indirs[i].in_off] = nb;
342 * If required, write synchronously, otherwise use
345 if (flags & IO_SYNC) {
348 if (bp->b_bufsize == fs->e2fs_bsize)
349 bp->b_flags |= B_CLUSTEROK;
356 if (flags & BA_CLRBUF) {
357 int seqcount = (flags & BA_SEQMASK) >> BA_SEQSHIFT;
359 if (seqcount && (vp->v_mount->mnt_flag & MNT_NOCLUSTERR) == 0) {
360 error = cluster_read(vp, ip->i_size, lbn,
361 (int)fs->e2fs_bsize, NOCRED,
362 MAXBSIZE, seqcount, 0, &nbp);
364 error = bread(vp, lbn, (int)fs->e2fs_bsize, NOCRED, &nbp);
371 nbp = getblk(vp, lbn, fs->e2fs_bsize, 0, 0, 0);
372 nbp->b_blkno = fsbtodb(fs, nb);