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 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95 30 */ 31 32 #include <sys/cdefs.h> 33 __FBSDID("$FreeBSD$"); 34 35 #include <sys/param.h> 36 37 #ifndef _KERNEL 38 #include <ufs/ufs/dinode.h> 39 #include <ufs/ffs/fs.h> 40 #include "fsck.h" 41 #else 42 #include "opt_ddb.h" 43 44 #include <sys/systm.h> 45 #include <sys/lock.h> 46 #include <sys/malloc.h> 47 #include <sys/mount.h> 48 #include <sys/vnode.h> 49 #include <sys/bio.h> 50 #include <sys/buf.h> 51 #include <sys/ucred.h> 52 53 #include <ufs/ufs/quota.h> 54 #include <ufs/ufs/inode.h> 55 #include <ufs/ufs/extattr.h> 56 #include <ufs/ufs/ufsmount.h> 57 #include <ufs/ufs/ufs_extern.h> 58 #include <ufs/ffs/ffs_extern.h> 59 #include <ufs/ffs/fs.h> 60 61 #ifdef DDB 62 void ffs_checkoverlap(struct buf *, struct inode *); 63 #endif 64 65 /* 66 * Return buffer with the contents of block "offset" from the beginning of 67 * directory "ip". If "res" is non-zero, fill it in with a pointer to the 68 * remaining space in the directory. 69 */ 70 int 71 ffs_blkatoff(vp, offset, res, bpp) 72 struct vnode *vp; 73 off_t offset; 74 char **res; 75 struct buf **bpp; 76 { 77 struct inode *ip; 78 struct fs *fs; 79 struct buf *bp; 80 ufs_lbn_t lbn; 81 int bsize, error; 82 83 ip = VTOI(vp); 84 fs = ip->i_fs; 85 lbn = lblkno(fs, offset); 86 bsize = blksize(fs, ip, lbn); 87 88 *bpp = NULL; 89 error = bread(vp, lbn, bsize, NOCRED, &bp); 90 if (error) { 91 brelse(bp); 92 return (error); 93 } 94 if (res) 95 *res = (char *)bp->b_data + blkoff(fs, offset); 96 *bpp = bp; 97 return (0); 98 } 99 100 /* 101 * Load up the contents of an inode and copy the appropriate pieces 102 * to the incore copy. 103 */ 104 void 105 ffs_load_inode(bp, ip, fs, ino) 106 struct buf *bp; 107 struct inode *ip; 108 struct fs *fs; 109 ino_t ino; 110 { 111 112 if (ip->i_ump->um_fstype == UFS1) { 113 *ip->i_din1 = 114 *((struct ufs1_dinode *)bp->b_data + ino_to_fsbo(fs, ino)); 115 ip->i_mode = ip->i_din1->di_mode; 116 ip->i_nlink = ip->i_din1->di_nlink; 117 ip->i_size = ip->i_din1->di_size; 118 ip->i_flags = ip->i_din1->di_flags; 119 ip->i_gen = ip->i_din1->di_gen; 120 ip->i_uid = ip->i_din1->di_uid; 121 ip->i_gid = ip->i_din1->di_gid; 122 } else { 123 *ip->i_din2 = 124 *((struct ufs2_dinode *)bp->b_data + ino_to_fsbo(fs, ino)); 125 ip->i_mode = ip->i_din2->di_mode; 126 ip->i_nlink = ip->i_din2->di_nlink; 127 ip->i_size = ip->i_din2->di_size; 128 ip->i_flags = ip->i_din2->di_flags; 129 ip->i_gen = ip->i_din2->di_gen; 130 ip->i_uid = ip->i_din2->di_uid; 131 ip->i_gid = ip->i_din2->di_gid; 132 } 133 } 134 #endif /* KERNEL */ 135 136 /* 137 * Update the frsum fields to reflect addition or deletion 138 * of some frags. 139 */ 140 void 141 ffs_fragacct(fs, fragmap, fraglist, cnt) 142 struct fs *fs; 143 int fragmap; 144 int32_t fraglist[]; 145 int cnt; 146 { 147 int inblk; 148 int field, subfield; 149 int siz, pos; 150 151 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1; 152 fragmap <<= 1; 153 for (siz = 1; siz < fs->fs_frag; siz++) { 154 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0) 155 continue; 156 field = around[siz]; 157 subfield = inside[siz]; 158 for (pos = siz; pos <= fs->fs_frag; pos++) { 159 if ((fragmap & field) == subfield) { 160 fraglist[siz] += cnt; 161 pos += siz; 162 field <<= siz; 163 subfield <<= siz; 164 } 165 field <<= 1; 166 subfield <<= 1; 167 } 168 } 169 } 170 171 #ifdef DDB 172 void 173 ffs_checkoverlap(bp, ip) 174 struct buf *bp; 175 struct inode *ip; 176 { 177 struct buf *ebp, *ep; 178 ufs2_daddr_t start, last; 179 struct vnode *vp; 180 181 ebp = &buf[nbuf]; 182 start = bp->b_blkno; 183 last = start + btodb(bp->b_bcount) - 1; 184 for (ep = buf; ep < ebp; ep++) { 185 if (ep == bp || (ep->b_flags & B_INVAL) || 186 ep->b_vp == NULLVP) 187 continue; 188 vp = ip->i_devvp; 189 /* look for overlap */ 190 if (ep->b_bcount == 0 || ep->b_blkno > last || 191 ep->b_blkno + btodb(ep->b_bcount) <= start) 192 continue; 193 vprint("Disk overlap", vp); 194 printf("\tstart %jd, end %jd overlap start %jd, end %jd\n", 195 (intmax_t)start, (intmax_t)last, (intmax_t)ep->b_blkno, 196 (intmax_t)(ep->b_blkno + btodb(ep->b_bcount) - 1)); 197 panic("ffs_checkoverlap: Disk buffer overlap"); 198 } 199 } 200 #endif /* DDB */ 201 202 /* 203 * block operations 204 * 205 * check if a block is available 206 */ 207 int 208 ffs_isblock(fs, cp, h) 209 struct fs *fs; 210 unsigned char *cp; 211 ufs1_daddr_t h; 212 { 213 unsigned char mask; 214 215 switch ((int)fs->fs_frag) { 216 case 8: 217 return (cp[h] == 0xff); 218 case 4: 219 mask = 0x0f << ((h & 0x1) << 2); 220 return ((cp[h >> 1] & mask) == mask); 221 case 2: 222 mask = 0x03 << ((h & 0x3) << 1); 223 return ((cp[h >> 2] & mask) == mask); 224 case 1: 225 mask = 0x01 << (h & 0x7); 226 return ((cp[h >> 3] & mask) == mask); 227 default: 228 panic("ffs_isblock"); 229 } 230 return (0); 231 } 232 233 /* 234 * take a block out of the map 235 */ 236 void 237 ffs_clrblock(fs, cp, h) 238 struct fs *fs; 239 u_char *cp; 240 ufs1_daddr_t h; 241 { 242 243 switch ((int)fs->fs_frag) { 244 case 8: 245 cp[h] = 0; 246 return; 247 case 4: 248 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 249 return; 250 case 2: 251 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 252 return; 253 case 1: 254 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 255 return; 256 default: 257 panic("ffs_clrblock"); 258 } 259 } 260 261 /* 262 * put a block into the map 263 */ 264 void 265 ffs_setblock(fs, cp, h) 266 struct fs *fs; 267 unsigned char *cp; 268 ufs1_daddr_t h; 269 { 270 271 switch ((int)fs->fs_frag) { 272 273 case 8: 274 cp[h] = 0xff; 275 return; 276 case 4: 277 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 278 return; 279 case 2: 280 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 281 return; 282 case 1: 283 cp[h >> 3] |= (0x01 << (h & 0x7)); 284 return; 285 default: 286 panic("ffs_setblock"); 287 } 288 } 289