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)
73 lbn = lblkno(fs, offset);
74 bsize = blksize(fs, ip, lbn);
76 if ((error = bread(vp, lbn, bsize, NOCRED, &bp)) != 0) {
81 *res = (char *)bp->b_data + blkoff(fs, offset);
89 * Update the cluster map because of an allocation of free like ffs.
91 * Cnt == 1 means free; cnt == -1 means allocating.
94 ext2_clusteracct(struct m_ext2fs *fs, char *bbp, int cg, e4fs_daddr_t bno, int cnt)
96 int32_t *sump = fs->e2fs_clustersum[cg].cs_sum;
98 e4fs_daddr_t start, end, loc, forw, back;
101 /* Initialize the cluster summary array. */
102 if (fs->e2fs_clustersum[cg].cs_init == 0) {
108 for (i = 0; i < fs->e2fs->e2fs_fpg; i++) {
109 if ((bbp[loc] & bit) == 0)
112 if (run > fs->e2fs_contigsumsize)
113 run = fs->e2fs_contigsumsize;
117 if ((i & (NBBY - 1)) != (NBBY - 1))
125 if (run > fs->e2fs_contigsumsize)
126 run = fs->e2fs_contigsumsize;
129 fs->e2fs_clustersum[cg].cs_init = 1;
132 if (fs->e2fs_contigsumsize <= 0)
135 /* Find the size of the cluster going forward. */
137 end = start + fs->e2fs_contigsumsize;
138 if (end > fs->e2fs->e2fs_fpg)
139 end = fs->e2fs->e2fs_fpg;
141 bit = 1 << (start % NBBY);
142 for (i = start; i < end; i++) {
143 if ((bbp[loc] & bit) != 0)
145 if ((i & (NBBY - 1)) != (NBBY - 1))
154 /* Find the size of the cluster going backward. */
156 end = start - fs->e2fs_contigsumsize;
160 bit = 1 << (start % NBBY);
161 for (i = start; i > end; i--) {
162 if ((bbp[loc] & bit) != 0)
164 if ((i & (NBBY - 1)) != 0)
168 bit = 1 << (NBBY - 1);
174 * Account for old cluster and the possibly new forward and
178 if (i > fs->e2fs_contigsumsize)
179 i = fs->e2fs_contigsumsize;
186 /* Update cluster summary information. */
187 lp = &sump[fs->e2fs_contigsumsize];
188 for (i = fs->e2fs_contigsumsize; i > 0; i--)
191 fs->e2fs_maxcluster[cg] = i;