ffs_subr.c revision 1.44
1 /* $NetBSD: ffs_subr.c,v 1.44 2007/01/29 01:52:46 hubertf Exp $ */ 2 3 /* 4 * Copyright (c) 1982, 1986, 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 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. 18 * 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 29 * SUCH DAMAGE. 30 * 31 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95 32 */ 33 34 #if HAVE_NBTOOL_CONFIG_H 35 #include "nbtool_config.h" 36 #endif 37 38 #include <sys/cdefs.h> 39 __KERNEL_RCSID(0, "$NetBSD: ffs_subr.c,v 1.44 2007/01/29 01:52:46 hubertf Exp $"); 40 41 #include <sys/param.h> 42 43 /* in ffs_tables.c */ 44 extern const int inside[], around[]; 45 extern const u_char * const fragtbl[]; 46 47 #include <ufs/ffs/fs.h> 48 #include <ufs/ffs/ffs_extern.h> 49 #include <ufs/ufs/ufs_bswap.h> 50 51 #ifndef _KERNEL 52 #include <ufs/ufs/dinode.h> 53 void panic(const char *, ...) 54 __attribute__((__noreturn__,__format__(__printf__,1,2))); 55 56 #else /* _KERNEL */ 57 #include <sys/systm.h> 58 #include <sys/vnode.h> 59 #include <sys/mount.h> 60 #include <sys/buf.h> 61 #include <sys/inttypes.h> 62 #include <sys/pool.h> 63 #include <ufs/ufs/inode.h> 64 #include <ufs/ufs/ufsmount.h> 65 #include <ufs/ufs/ufs_extern.h> 66 67 /* 68 * Load up the contents of an inode and copy the appropriate pieces 69 * to the incore copy. 70 */ 71 void 72 ffs_load_inode(struct buf *bp, struct inode *ip, struct fs *fs, ino_t ino) 73 { 74 struct ufs1_dinode *dp1; 75 struct ufs2_dinode *dp2; 76 77 if (ip->i_ump->um_fstype == UFS1) { 78 dp1 = (struct ufs1_dinode *)bp->b_data + ino_to_fsbo(fs, ino); 79 #ifdef FFS_EI 80 if (UFS_FSNEEDSWAP(fs)) 81 ffs_dinode1_swap(dp1, ip->i_din.ffs1_din); 82 else 83 #endif 84 *ip->i_din.ffs1_din = *dp1; 85 86 ip->i_mode = ip->i_ffs1_mode; 87 ip->i_nlink = ip->i_ffs1_nlink; 88 ip->i_size = ip->i_ffs1_size; 89 ip->i_flags = ip->i_ffs1_flags; 90 ip->i_gen = ip->i_ffs1_gen; 91 ip->i_uid = ip->i_ffs1_uid; 92 ip->i_gid = ip->i_ffs1_gid; 93 } else { 94 dp2 = (struct ufs2_dinode *)bp->b_data + ino_to_fsbo(fs, ino); 95 #ifdef FFS_EI 96 if (UFS_FSNEEDSWAP(fs)) 97 ffs_dinode2_swap(dp2, ip->i_din.ffs2_din); 98 else 99 #endif 100 *ip->i_din.ffs2_din = *dp2; 101 102 ip->i_mode = ip->i_ffs2_mode; 103 ip->i_nlink = ip->i_ffs2_nlink; 104 ip->i_size = ip->i_ffs2_size; 105 ip->i_flags = ip->i_ffs2_flags; 106 ip->i_gen = ip->i_ffs2_gen; 107 ip->i_uid = ip->i_ffs2_uid; 108 ip->i_gid = ip->i_ffs2_gid; 109 } 110 } 111 112 #endif /* _KERNEL */ 113 114 /* 115 * Update the frsum fields to reflect addition or deletion 116 * of some frags. 117 */ 118 void 119 ffs_fragacct(struct fs *fs, int fragmap, int32_t fraglist[], int cnt, 120 int needswap) 121 { 122 int inblk; 123 int field, subfield; 124 int siz, pos; 125 126 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1; 127 fragmap <<= 1; 128 for (siz = 1; siz < fs->fs_frag; siz++) { 129 if ((inblk & (1 << (siz + (fs->fs_frag & (NBBY - 1))))) == 0) 130 continue; 131 field = around[siz]; 132 subfield = inside[siz]; 133 for (pos = siz; pos <= fs->fs_frag; pos++) { 134 if ((fragmap & field) == subfield) { 135 fraglist[siz] = ufs_rw32( 136 ufs_rw32(fraglist[siz], needswap) + cnt, 137 needswap); 138 pos += siz; 139 field <<= siz; 140 subfield <<= siz; 141 } 142 field <<= 1; 143 subfield <<= 1; 144 } 145 } 146 } 147 148 /* 149 * block operations 150 * 151 * check if a block is available 152 * returns true if all the correponding bits in the free map are 1 153 * returns false if any corresponding bit in the free map is 0 154 */ 155 int 156 ffs_isblock(struct fs *fs, u_char *cp, int32_t h) 157 { 158 u_char mask; 159 160 switch ((int)fs->fs_fragshift) { 161 case 3: 162 return (cp[h] == 0xff); 163 case 2: 164 mask = 0x0f << ((h & 0x1) << 2); 165 return ((cp[h >> 1] & mask) == mask); 166 case 1: 167 mask = 0x03 << ((h & 0x3) << 1); 168 return ((cp[h >> 2] & mask) == mask); 169 case 0: 170 mask = 0x01 << (h & 0x7); 171 return ((cp[h >> 3] & mask) == mask); 172 default: 173 panic("ffs_isblock: unknown fs_fragshift %d", 174 (int)fs->fs_fragshift); 175 } 176 } 177 178 /* 179 * check if a block is completely allocated 180 * returns true if all the corresponding bits in the free map are 0 181 * returns false if any corresponding bit in the free map is 1 182 */ 183 int 184 ffs_isfreeblock(struct fs *fs, u_char *cp, int32_t h) 185 { 186 187 switch ((int)fs->fs_fragshift) { 188 case 3: 189 return (cp[h] == 0); 190 case 2: 191 return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0); 192 case 1: 193 return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0); 194 case 0: 195 return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0); 196 default: 197 panic("ffs_isfreeblock: unknown fs_fragshift %d", 198 (int)fs->fs_fragshift); 199 } 200 } 201 202 /* 203 * take a block out of the map 204 */ 205 void 206 ffs_clrblock(struct fs *fs, u_char *cp, int32_t h) 207 { 208 209 switch ((int)fs->fs_fragshift) { 210 case 3: 211 cp[h] = 0; 212 return; 213 case 2: 214 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 215 return; 216 case 1: 217 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 218 return; 219 case 0: 220 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 221 return; 222 default: 223 panic("ffs_clrblock: unknown fs_fragshift %d", 224 (int)fs->fs_fragshift); 225 } 226 } 227 228 /* 229 * put a block into the map 230 */ 231 void 232 ffs_setblock(struct fs *fs, u_char *cp, int32_t h) 233 { 234 235 switch ((int)fs->fs_fragshift) { 236 case 3: 237 cp[h] = 0xff; 238 return; 239 case 2: 240 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 241 return; 242 case 1: 243 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 244 return; 245 case 0: 246 cp[h >> 3] |= (0x01 << (h & 0x7)); 247 return; 248 default: 249 panic("ffs_setblock: unknown fs_fragshift %d", 250 (int)fs->fs_fragshift); 251 } 252 } 253
Indexes created Tue Sep 30 17:09:57 GMT 2025