2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95
34 * $FreeBSD: src/sys/ufs/ffs/ffs_subr.c,v 1.25 1999/12/29 04:55:04 peter Exp $
35 * $DragonFly: src/sys/vfs/ufs/ffs_subr.c,v 1.6 2003/08/20 09:56:34 rob Exp $
38 #include <sys/param.h>
46 #include <sys/systm.h>
48 #include <sys/vnode.h>
50 #include <sys/ucred.h>
54 #include "ffs_extern.h"
57 void ffs_checkoverlap (struct buf *, struct inode *);
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 ffs_blkatoff(vp, offset, res, bpp)
80 lbn = lblkno(fs, offset);
81 bsize = blksize(fs, ip, lbn);
84 error = bread(vp, lbn, bsize, &bp);
90 *res = (char *)bp->b_data + blkoff(fs, offset);
97 * Update the frsum fields to reflect addition or deletion
101 ffs_fragacct(fs, fragmap, fraglist, cnt)
111 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
113 for (siz = 1; siz < fs->fs_frag; siz++) {
114 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0)
117 subfield = inside[siz];
118 for (pos = siz; pos <= fs->fs_frag; pos++) {
119 if ((fragmap & field) == subfield) {
120 fraglist[siz] += cnt;
133 ffs_checkoverlap(bp, ip)
137 struct buf *ebp, *ep;
138 ufs_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) ||
148 if (VOP_BMAP(ep->b_vp, (ufs_daddr_t)0, &vp, (ufs_daddr_t *)NULL,
149 (int *)NULL, (int *)NULL))
151 if (vp != ip->i_devvp)
153 /* look for overlap */
154 if (ep->b_bcount == 0 || ep->b_blkno > last ||
155 ep->b_blkno + btodb(ep->b_bcount) <= start)
157 vprint("Disk overlap", vp);
158 (void)printf("\tstart %lu, end %lu overlap start %lu, end %lu\n",
159 (u_long)start, (u_long)last, (u_long)ep->b_blkno,
160 (u_long)(ep->b_blkno + btodb(ep->b_bcount) - 1));
161 panic("ffs_checkoverlap: Disk buffer overlap");
169 * check if a block is available
172 ffs_isblock(fs, cp, h)
179 switch ((int)fs->fs_frag) {
181 return (cp[h] == 0xff);
183 mask = 0x0f << ((h & 0x1) << 2);
184 return ((cp[h >> 1] & mask) == mask);
186 mask = 0x03 << ((h & 0x3) << 1);
187 return ((cp[h >> 2] & mask) == mask);
189 mask = 0x01 << (h & 0x7);
190 return ((cp[h >> 3] & mask) == mask);
192 panic("ffs_isblock");
197 * check if a block is free
200 ffs_isfreeblock(fs, cp, h)
206 switch ((int)fs->fs_frag) {
210 return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0);
212 return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0);
214 return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0);
216 panic("ffs_isfreeblock");
221 * take a block out of the map
224 ffs_clrblock(fs, cp, h)
230 switch ((int)fs->fs_frag) {
235 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
238 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
241 cp[h >> 3] &= ~(0x01 << (h & 0x7));
244 panic("ffs_clrblock");
249 * put a block into the map
252 ffs_setblock(fs, cp, h)
258 switch ((int)fs->fs_frag) {
264 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
267 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
270 cp[h >> 3] |= (0x01 << (h & 0x7));
273 panic("ffs_setblock");