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.7 2004/05/18 00:16:46 cpressey 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(struct vnode *vp, off_t offset, char **res, struct buf **bpp)
76 lbn = lblkno(fs, offset);
77 bsize = blksize(fs, ip, lbn);
80 error = bread(vp, lbn, bsize, &bp);
86 *res = (char *)bp->b_data + blkoff(fs, offset);
93 * Update the frsum fields to reflect addition or deletion
97 ffs_fragacct(struct fs *fs, int fragmap, int32_t fraglist[], int cnt)
103 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
105 for (siz = 1; siz < fs->fs_frag; siz++) {
106 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0)
109 subfield = inside[siz];
110 for (pos = siz; pos <= fs->fs_frag; pos++) {
111 if ((fragmap & field) == subfield) {
112 fraglist[siz] += cnt;
125 ffs_checkoverlap(struct buf *bp, struct inode *ip)
127 struct buf *ebp, *ep;
128 ufs_daddr_t start, last;
133 last = start + btodb(bp->b_bcount) - 1;
134 for (ep = buf; ep < ebp; ep++) {
135 if (ep == bp || (ep->b_flags & B_INVAL) ||
138 if (VOP_BMAP(ep->b_vp, (ufs_daddr_t)0, &vp, (ufs_daddr_t *)NULL,
139 (int *)NULL, (int *)NULL))
141 if (vp != ip->i_devvp)
143 /* look for overlap */
144 if (ep->b_bcount == 0 || ep->b_blkno > last ||
145 ep->b_blkno + btodb(ep->b_bcount) <= start)
147 vprint("Disk overlap", vp);
148 (void)printf("\tstart %lu, end %lu overlap start %lu, end %lu\n",
149 (u_long)start, (u_long)last, (u_long)ep->b_blkno,
150 (u_long)(ep->b_blkno + btodb(ep->b_bcount) - 1));
151 panic("ffs_checkoverlap: Disk buffer overlap");
159 * check if a block is available
162 ffs_isblock(struct fs *fs, unsigned char *cp, ufs_daddr_t h)
166 switch ((int)fs->fs_frag) {
168 return (cp[h] == 0xff);
170 mask = 0x0f << ((h & 0x1) << 2);
171 return ((cp[h >> 1] & mask) == mask);
173 mask = 0x03 << ((h & 0x3) << 1);
174 return ((cp[h >> 2] & mask) == mask);
176 mask = 0x01 << (h & 0x7);
177 return ((cp[h >> 3] & mask) == mask);
179 panic("ffs_isblock");
184 * check if a block is free
187 ffs_isfreeblock(struct fs *fs, unsigned char *cp, ufs_daddr_t h)
189 switch ((int)fs->fs_frag) {
193 return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0);
195 return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0);
197 return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0);
199 panic("ffs_isfreeblock");
204 * take a block out of the map
207 ffs_clrblock(struct fs *fs, u_char *cp, ufs_daddr_t h)
209 switch ((int)fs->fs_frag) {
214 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
217 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
220 cp[h >> 3] &= ~(0x01 << (h & 0x7));
223 panic("ffs_clrblock");
228 * put a block into the map
231 ffs_setblock(struct fs *fs, unsigned char *cp, ufs_daddr_t h)
233 switch ((int)fs->fs_frag) {
238 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
241 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
244 cp[h >> 3] |= (0x01 << (h & 0x7));
247 panic("ffs_setblock");