1 /* 2 * Copyright (c) 1982, 1986, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 20 * 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 31 * SUCH DAMAGE. 32 * 33 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95 34 * $FreeBSD$ 35 */ 36 37 #include <sys/param.h> 38 39 #ifndef _KERNEL 40 #include <ufs/ufs/dinode.h> 41 #include <ufs/ffs/fs.h> 42 #else 43 #include "opt_ddb.h" 44 45 #include <sys/systm.h> 46 #include <sys/stdint.h> 47 #include <sys/lock.h> 48 #include <sys/malloc.h> 49 #include <sys/mount.h> 50 #include <sys/vnode.h> 51 #include <sys/bio.h> 52 #include <sys/buf.h> 53 #include <sys/ucred.h> 54 55 #include <ufs/ufs/quota.h> 56 #include <ufs/ufs/inode.h> 57 #include <ufs/ufs/extattr.h> 58 #include <ufs/ufs/ufsmount.h> 59 #include <ufs/ufs/ufs_extern.h> 60 #include <ufs/ffs/ffs_extern.h> 61 #include <ufs/ffs/fs.h> 62 63 #ifdef DDB 64 void ffs_checkoverlap(struct buf *, struct inode *); 65 #endif 66 67 /* 68 * Return buffer with the contents of block "offset" from the beginning of 69 * directory "ip". If "res" is non-zero, fill it in with a pointer to the 70 * remaining space in the directory. 71 */ 72 int 73 ffs_blkatoff(vp, offset, res, bpp) 74 struct vnode *vp; 75 off_t offset; 76 char **res; 77 struct buf **bpp; 78 { 79 struct inode *ip; 80 struct fs *fs; 81 struct buf *bp; 82 ufs_lbn_t lbn; 83 int bsize, error; 84 85 ip = VTOI(vp); 86 fs = ip->i_fs; 87 lbn = lblkno(fs, offset); 88 bsize = blksize(fs, ip, lbn); 89 90 *bpp = NULL; 91 error = bread(vp, lbn, bsize, NOCRED, &bp); 92 if (error) { 93 brelse(bp); 94 return (error); 95 } 96 if (res) 97 *res = (char *)bp->b_data + blkoff(fs, offset); 98 *bpp = bp; 99 return (0); 100 } 101 102 /* 103 * Load up the contents of an inode and copy the appropriate pieces 104 * to the incore copy. 105 */ 106 void 107 ffs_load_inode(bp, ip, mtype, fs, ino) 108 struct buf *bp; 109 struct inode *ip; 110 struct malloc_type *mtype; 111 struct fs *fs; 112 ino_t ino; 113 { 114 115 if (ip->i_ump->um_fstype == UFS1) { 116 if (mtype != NULL) 117 MALLOC(ip->i_din1, struct ufs1_dinode *, 118 sizeof(struct ufs1_dinode), mtype, M_WAITOK); 119 *ip->i_din1 = 120 *((struct ufs1_dinode *)bp->b_data + ino_to_fsbo(fs, ino)); 121 ip->i_mode = ip->i_din1->di_mode; 122 ip->i_nlink = ip->i_din1->di_nlink; 123 ip->i_size = ip->i_din1->di_size; 124 ip->i_flags = ip->i_din1->di_flags; 125 ip->i_gen = ip->i_din1->di_gen; 126 ip->i_uid = ip->i_din1->di_uid; 127 ip->i_gid = ip->i_din1->di_gid; 128 } else { 129 if (mtype != NULL) 130 MALLOC(ip->i_din2, struct ufs2_dinode *, 131 sizeof(struct ufs2_dinode), mtype, M_WAITOK); 132 *ip->i_din2 = 133 *((struct ufs2_dinode *)bp->b_data + ino_to_fsbo(fs, ino)); 134 ip->i_mode = ip->i_din2->di_mode; 135 ip->i_nlink = ip->i_din2->di_nlink; 136 ip->i_size = ip->i_din2->di_size; 137 ip->i_flags = ip->i_din2->di_flags; 138 ip->i_gen = ip->i_din2->di_gen; 139 ip->i_uid = ip->i_din2->di_uid; 140 ip->i_gid = ip->i_din2->di_gid; 141 } 142 } 143 #endif /* KERNEL */ 144 145 /* 146 * Update the frsum fields to reflect addition or deletion 147 * of some frags. 148 */ 149 void 150 ffs_fragacct(fs, fragmap, fraglist, cnt) 151 struct fs *fs; 152 int fragmap; 153 int32_t fraglist[]; 154 int cnt; 155 { 156 int inblk; 157 int field, subfield; 158 int siz, pos; 159 160 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1; 161 fragmap <<= 1; 162 for (siz = 1; siz < fs->fs_frag; siz++) { 163 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0) 164 continue; 165 field = around[siz]; 166 subfield = inside[siz]; 167 for (pos = siz; pos <= fs->fs_frag; pos++) { 168 if ((fragmap & field) == subfield) { 169 fraglist[siz] += cnt; 170 pos += siz; 171 field <<= siz; 172 subfield <<= siz; 173 } 174 field <<= 1; 175 subfield <<= 1; 176 } 177 } 178 } 179 180 #ifdef DDB 181 void 182 ffs_checkoverlap(bp, ip) 183 struct buf *bp; 184 struct inode *ip; 185 { 186 struct buf *ebp, *ep; 187 ufs2_daddr_t start, last; 188 struct vnode *vp; 189 190 ebp = &buf[nbuf]; 191 start = bp->b_blkno; 192 last = start + btodb(bp->b_bcount) - 1; 193 for (ep = buf; ep < ebp; ep++) { 194 if (ep == bp || (ep->b_flags & B_INVAL) || 195 ep->b_vp == NULLVP) 196 continue; 197 vp = ip->i_devvp; 198 /* look for overlap */ 199 if (ep->b_bcount == 0 || ep->b_blkno > last || 200 ep->b_blkno + btodb(ep->b_bcount) <= start) 201 continue; 202 vprint("Disk overlap", vp); 203 printf("\tstart %jd, end %jd overlap start %jd, end %jd\n", 204 (intmax_t)start, (intmax_t)last, (intmax_t)ep->b_blkno, 205 (intmax_t)(ep->b_blkno + btodb(ep->b_bcount) - 1)); 206 panic("ffs_checkoverlap: Disk buffer overlap"); 207 } 208 } 209 #endif /* DDB */ 210 211 /* 212 * block operations 213 * 214 * check if a block is available 215 */ 216 int 217 ffs_isblock(fs, cp, h) 218 struct fs *fs; 219 unsigned char *cp; 220 ufs1_daddr_t h; 221 { 222 unsigned char mask; 223 224 switch ((int)fs->fs_frag) { 225 case 8: 226 return (cp[h] == 0xff); 227 case 4: 228 mask = 0x0f << ((h & 0x1) << 2); 229 return ((cp[h >> 1] & mask) == mask); 230 case 2: 231 mask = 0x03 << ((h & 0x3) << 1); 232 return ((cp[h >> 2] & mask) == mask); 233 case 1: 234 mask = 0x01 << (h & 0x7); 235 return ((cp[h >> 3] & mask) == mask); 236 default: 237 panic("ffs_isblock"); 238 } 239 return (0); 240 } 241 242 /* 243 * check if a block is free 244 */ 245 int 246 ffs_isfreeblock(fs, cp, h) 247 struct fs *fs; 248 unsigned char *cp; 249 ufs1_daddr_t h; 250 { 251 252 switch ((int)fs->fs_frag) { 253 case 8: 254 return (cp[h] == 0); 255 case 4: 256 return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0); 257 case 2: 258 return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0); 259 case 1: 260 return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0); 261 default: 262 panic("ffs_isfreeblock"); 263 } 264 return (0); 265 } 266 267 /* 268 * take a block out of the map 269 */ 270 void 271 ffs_clrblock(fs, cp, h) 272 struct fs *fs; 273 u_char *cp; 274 ufs1_daddr_t h; 275 { 276 277 switch ((int)fs->fs_frag) { 278 case 8: 279 cp[h] = 0; 280 return; 281 case 4: 282 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 283 return; 284 case 2: 285 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 286 return; 287 case 1: 288 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 289 return; 290 default: 291 panic("ffs_clrblock"); 292 } 293 } 294 295 /* 296 * put a block into the map 297 */ 298 void 299 ffs_setblock(fs, cp, h) 300 struct fs *fs; 301 unsigned char *cp; 302 ufs1_daddr_t h; 303 { 304 305 switch ((int)fs->fs_frag) { 306 307 case 8: 308 cp[h] = 0xff; 309 return; 310 case 4: 311 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 312 return; 313 case 2: 314 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 315 return; 316 case 1: 317 cp[h >> 3] |= (0x01 << (h & 0x7)); 318 return; 319 default: 320 panic("ffs_setblock"); 321 } 322 } 323