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_subr.c 8.2 (Berkeley) 9/21/93
40 #include <sys/param.h>
44 #include <sys/systm.h>
48 #include <sys/ucred.h>
49 #include <sys/vnode.h>
51 #include <fs/ext2fs/fs.h>
52 #include <fs/ext2fs/inode.h>
53 #include <fs/ext2fs/ext2fs.h>
54 #include <fs/ext2fs/ext2_extern.h>
55 #include <fs/ext2fs/fs.h>
56 #include <fs/ext2fs/ext2_extents.h>
57 #include <fs/ext2fs/ext2_mount.h>
58 #include <fs/ext2fs/ext2_dinode.h>
61 * Return buffer with the contents of block "offset" from the beginning of
62 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
63 * remaining space in the directory.
66 ext2_blkatoff(struct vnode *vp, off_t offset, char **res, struct buf **bpp)
76 lbn = lblkno(fs, offset);
77 bsize = blksize(fs, ip, lbn);
79 if ((error = bread(vp, lbn, bsize, NOCRED, &bp)) != 0) {
83 error = ext2_dir_blk_csum_verify(ip, bp);
89 *res = (char *)bp->b_data + blkoff(fs, offset);
97 * Update the cluster map because of an allocation of free like ffs.
99 * Cnt == 1 means free; cnt == -1 means allocating.
102 ext2_clusteracct(struct m_ext2fs *fs, char *bbp, int cg, e4fs_daddr_t bno, int cnt)
104 int32_t *sump = fs->e2fs_clustersum[cg].cs_sum;
106 e4fs_daddr_t start, end, loc, forw, back;
109 /* Initialize the cluster summary array. */
110 if (fs->e2fs_clustersum[cg].cs_init == 0) {
116 for (i = 0; i < fs->e2fs_fpg; i++) {
117 if ((bbp[loc] & bit) == 0)
120 if (run > fs->e2fs_contigsumsize)
121 run = fs->e2fs_contigsumsize;
125 if ((i & (NBBY - 1)) != (NBBY - 1))
133 if (run > fs->e2fs_contigsumsize)
134 run = fs->e2fs_contigsumsize;
137 fs->e2fs_clustersum[cg].cs_init = 1;
140 if (fs->e2fs_contigsumsize <= 0)
143 /* Find the size of the cluster going forward. */
145 end = start + fs->e2fs_contigsumsize;
146 if (end > fs->e2fs_fpg)
149 bit = 1 << (start % NBBY);
150 for (i = start; i < end; i++) {
151 if ((bbp[loc] & bit) != 0)
153 if ((i & (NBBY - 1)) != (NBBY - 1))
162 /* Find the size of the cluster going backward. */
164 end = start - fs->e2fs_contigsumsize;
168 bit = 1 << (start % NBBY);
169 for (i = start; i > end; i--) {
170 if ((bbp[loc] & bit) != 0)
172 if ((i & (NBBY - 1)) != 0)
176 bit = 1 << (NBBY - 1);
182 * Account for old cluster and the possibly new forward and
186 if (i > fs->e2fs_contigsumsize)
187 i = fs->e2fs_contigsumsize;
194 /* Update cluster summary information. */
195 lp = &sump[fs->e2fs_contigsumsize];
196 for (i = fs->e2fs_contigsumsize; i > 0; i--)
199 fs->e2fs_maxcluster[cg] = i;