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. 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 * Return buffer with the contents of block "offset" from the beginning of
59 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
60 * remaining space in the directory.
63 ext2_blkatoff(struct vnode *vp, off_t offset, char **res, struct buf **bpp)
71 struct ext4_extent *ep;
72 struct ext4_extent_path path;
76 lbn = lblkno(fs, offset);
77 bsize = blksize(fs, ip, lbn);
81 * IN_E4EXTENTS requires special treatment as we can otherwise fall
82 * back to the normal path.
84 if (!(ip->i_flag & IN_E4EXTENTS))
87 memset(&path, 0, sizeof(path));
88 if (ext4_ext_find_extent(fs, ip, lbn, &path) == NULL)
94 newblk = lbn - ep->e_blk +
95 (ep->e_start_lo | (daddr_t)ep->e_start_hi << 32);
97 if (path.ep_bp != NULL) {
101 error = bread(ip->i_devvp, fsbtodb(fs, newblk), bsize, NOCRED, &bp);
107 *res = (char *)bp->b_data + blkoff(fs, offset);
109 * If IN_E4EXTENTS is enabled we would get a wrong offset so
110 * reset b_offset here.
112 bp->b_offset = lbn * bsize;
118 if ((error = bread(vp, lbn, bsize, NOCRED, &bp)) != 0) {
123 *res = (char *)bp->b_data + blkoff(fs, offset);
130 * Update the cluster map because of an allocation of free like ffs.
132 * Cnt == 1 means free; cnt == -1 means allocating.
135 ext2_clusteracct(struct m_ext2fs *fs, char *bbp, int cg, daddr_t bno, int cnt)
137 int32_t *sump = fs->e2fs_clustersum[cg].cs_sum;
139 int back, bit, end, forw, i, loc, start;
141 /* Initialize the cluster summary array. */
142 if (fs->e2fs_clustersum[cg].cs_init == 0) {
148 for (i = 0; i < fs->e2fs->e2fs_fpg; i++) {
149 if ((bbp[loc] & bit) == 0)
152 if (run > fs->e2fs_contigsumsize)
153 run = fs->e2fs_contigsumsize;
157 if ((i & (NBBY - 1)) != (NBBY - 1))
165 if (run > fs->e2fs_contigsumsize)
166 run = fs->e2fs_contigsumsize;
169 fs->e2fs_clustersum[cg].cs_init = 1;
172 if (fs->e2fs_contigsumsize <= 0)
175 /* Find the size of the cluster going forward. */
177 end = start + fs->e2fs_contigsumsize;
178 if (end > fs->e2fs->e2fs_fpg)
179 end = fs->e2fs->e2fs_fpg;
181 bit = 1 << (start % NBBY);
182 for (i = start; i < end; i++) {
183 if ((bbp[loc] & bit) != 0)
185 if ((i & (NBBY - 1)) != (NBBY - 1))
194 /* Find the size of the cluster going backward. */
196 end = start - fs->e2fs_contigsumsize;
200 bit = 1 << (start % NBBY);
201 for (i = start; i > end; i--) {
202 if ((bbp[loc] & bit) != 0)
204 if ((i & (NBBY - 1)) != 0)
208 bit = 1 << (NBBY - 1);
214 * Account for old cluster and the possibly new forward and
218 if (i > fs->e2fs_contigsumsize)
219 i = fs->e2fs_contigsumsize;
226 /* Update cluster summary information. */
227 lp = &sump[fs->e2fs_contigsumsize];
228 for (i = fs->e2fs_contigsumsize; i > 0; i--)
231 fs->e2fs_maxcluster[cg] = i;