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 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * @(#)ffs_subr.c 8.2 (Berkeley) 9/21/93
39 #include <sys/param.h>
42 #include <sys/systm.h>
46 #include <sys/ucred.h>
47 #include <sys/vnode.h>
49 #include <fs/ext2fs/inode.h>
50 #include <fs/ext2fs/ext2_extern.h>
51 #include <fs/ext2fs/ext2fs.h>
52 #include <fs/ext2fs/fs.h>
53 #include <fs/ext2fs/ext2_extents.h>
54 #include <fs/ext2fs/ext2_mount.h>
55 #include <fs/ext2fs/ext2_dinode.h>
58 void ext2_checkoverlap(struct buf *, struct inode *);
62 * Return buffer with the contents of block "offset" from the beginning of
63 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
64 * remaining space in the directory.
67 ext2_blkatoff(struct vnode *vp, off_t offset, char **res, struct buf **bpp)
75 struct ext4_extent *ep;
76 struct ext4_extent_path path;
80 lbn = lblkno(fs, offset);
81 bsize = blksize(fs, ip, lbn);
85 * IN_E4EXTENTS requires special treatment as we can otherwise fall
86 * back to the normal path.
88 if (!(ip->i_flag & IN_E4EXTENTS))
91 memset(&path, 0, sizeof(path));
92 if (ext4_ext_find_extent(fs, ip, lbn, &path) == NULL)
98 newblk = lbn - ep->e_blk +
99 (ep->e_start_lo | (daddr_t)ep->e_start_hi << 32);
101 if (path.ep_bp != NULL) {
105 error = bread(ip->i_devvp, fsbtodb(fs, newblk), bsize, NOCRED, &bp);
111 *res = (char *)bp->b_data + blkoff(fs, offset);
113 * If IN_E4EXTENTS is enabled we would get a wrong offset so
114 * reset b_offset here.
116 bp->b_offset = lbn * bsize;
122 if ((error = bread(vp, lbn, bsize, NOCRED, &bp)) != 0) {
127 *res = (char *)bp->b_data + blkoff(fs, offset);
135 ext2_checkoverlap(struct buf *bp, struct inode *ip)
137 struct buf *ebp, *ep;
138 e4fs_daddr_t start, last;
143 last = start + btodb(bp->b_bcount) - 1;
144 for (ep = buf; ep < ebp; ep++) {
145 if (ep == bp || (ep->b_flags & B_INVAL))
147 vp = ip->i_ump->um_devvp;
148 /* look for overlap */
149 if (ep->b_bcount == 0 || ep->b_blkno > last ||
150 ep->b_blkno + btodb(ep->b_bcount) <= start)
152 vprint("Disk overlap", vp);
153 printf("\tstart %jd, end %jd overlap start %jd, end %jd\n",
154 (intmax_t)start, (intmax_t)last, (intmax_t)ep->b_blkno,
155 (intmax_t)(ep->b_blkno + btodb(ep->b_bcount) - 1));
156 panic("ext2_checkoverlap: Disk buffer overlap");
162 * Update the cluster map because of an allocation of free like ffs.
164 * Cnt == 1 means free; cnt == -1 means allocating.
167 ext2_clusteracct(struct m_ext2fs *fs, char *bbp, int cg, daddr_t bno, int cnt)
169 int32_t *sump = fs->e2fs_clustersum[cg].cs_sum;
171 int back, bit, end, forw, i, loc, start;
173 /* Initialize the cluster summary array. */
174 if (fs->e2fs_clustersum[cg].cs_init == 0) {
179 for (i = 0; i < fs->e2fs->e2fs_fpg; i++) {
180 if ((bbp[loc] & bit) == 0)
183 if (run > fs->e2fs_contigsumsize)
184 run = fs->e2fs_contigsumsize;
188 if ((i & (NBBY - 1)) != (NBBY - 1))
196 if (run > fs->e2fs_contigsumsize)
197 run = fs->e2fs_contigsumsize;
200 fs->e2fs_clustersum[cg].cs_init = 1;
203 if (fs->e2fs_contigsumsize <= 0)
206 /* Find the size of the cluster going forward. */
208 end = start + fs->e2fs_contigsumsize;
209 if (end > fs->e2fs->e2fs_fpg)
210 end = fs->e2fs->e2fs_fpg;
212 bit = 1 << (start % NBBY);
213 for (i = start; i < end; i++) {
214 if ((bbp[loc] & bit) != 0)
216 if ((i & (NBBY - 1)) != (NBBY - 1))
225 /* Find the size of the cluster going backward. */
227 end = start - fs->e2fs_contigsumsize;
231 bit = 1 << (start % NBBY);
232 for (i = start; i > end; i--) {
233 if ((bbp[loc] & bit) != 0)
235 if ((i & (NBBY - 1)) != 0)
239 bit = 1 << (NBBY - 1);
245 * Account for old cluster and the possibly new forward and
249 if (i > fs->e2fs_contigsumsize)
250 i = fs->e2fs_contigsumsize;
257 /* Update cluster summary information. */
258 lp = &sump[fs->e2fs_contigsumsize];
259 for (i = fs->e2fs_contigsumsize; i > 0; i--)
262 fs->e2fs_maxcluster[cg] = i;