1 /* $NetBSD: ffs_subr.c,v 1.32 2003/12/30 12:33:24 pk Exp $ */
4 * Copyright (c) 1982, 1986, 1989, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
37 #include <sys/param.h>
39 #include <ufs/ufs/dinode.h>
40 #include <ufs/ffs/fs.h>
41 #include "ffs/ffs_extern.h"
42 #include "ffs/ufs_bswap.h"
45 * Update the frsum fields to reflect addition or deletion
49 ffs_fragacct_swap(struct fs *fs, int fragmap, int32_t fraglist[], int cnt, int needswap)
55 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
57 for (siz = 1; siz < fs->fs_frag; siz++) {
58 if ((inblk & (1 << (siz + (fs->fs_frag & (NBBY - 1))))) == 0)
61 subfield = inside[siz];
62 for (pos = siz; pos <= fs->fs_frag; pos++) {
63 if ((fragmap & field) == subfield) {
64 fraglist[siz] = ufs_rw32(
65 ufs_rw32(fraglist[siz], needswap) + cnt,
80 * check if a block is available
81 * returns true if all the corresponding bits in the free map are 1
82 * returns false if any corresponding bit in the free map is 0
85 ffs_isblock(fs, cp, h)
92 switch ((int)fs->fs_fragshift) {
94 return (cp[h] == 0xff);
96 mask = 0x0f << ((h & 0x1) << 2);
97 return ((cp[h >> 1] & mask) == mask);
99 mask = 0x03 << ((h & 0x3) << 1);
100 return ((cp[h >> 2] & mask) == mask);
102 mask = 0x01 << (h & 0x7);
103 return ((cp[h >> 3] & mask) == mask);
105 panic("ffs_isblock: unknown fs_fragshift %d",
106 (int)fs->fs_fragshift);
111 * check if a block is completely allocated
112 * returns true if all the corresponding bits in the free map are 0
113 * returns false if any corresponding bit in the free map is 1
116 ffs_isfreeblock(fs, cp, h)
122 switch ((int)fs->fs_fragshift) {
126 return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0);
128 return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0);
130 return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0);
132 panic("ffs_isfreeblock: unknown fs_fragshift %d",
133 (int)fs->fs_fragshift);
138 * take a block out of the map
141 ffs_clrblock(fs, cp, h)
147 switch ((int)fs->fs_fragshift) {
152 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
155 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
158 cp[h >> 3] &= ~(0x01 << (h & 0x7));
161 panic("ffs_clrblock: unknown fs_fragshift %d",
162 (int)fs->fs_fragshift);
167 * put a block into the map
170 ffs_setblock(fs, cp, h)
176 switch ((int)fs->fs_fragshift) {
181 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
184 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
187 cp[h >> 3] |= (0x01 << (h & 0x7));
190 panic("ffs_setblock: unknown fs_fragshift %d",
191 (int)fs->fs_fragshift);