ext2fs_bmap.c revision 1.12
1 /* $NetBSD: ext2fs_bmap.c,v 1.12 2003/08/07 16:34:25 agc Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)ufs_bmap.c 8.6 (Berkeley) 1/21/94 37 * Modified for ext2fs by Manuel Bouyer. 38 */ 39 40 /* 41 * Copyright (c) 1997 Manuel Bouyer. 42 * 43 * Redistribution and use in source and binary forms, with or without 44 * modification, are permitted provided that the following conditions 45 * are met: 46 * 1. Redistributions of source code must retain the above copyright 47 * notice, this list of conditions and the following disclaimer. 48 * 2. Redistributions in binary form must reproduce the above copyright 49 * notice, this list of conditions and the following disclaimer in the 50 * documentation and/or other materials provided with the distribution. 51 * 3. All advertising materials mentioning features or use of this software 52 * must display the following acknowledgement: 53 * This product includes software developed by the University of 54 * California, Berkeley and its contributors. 55 * 4. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * @(#)ufs_bmap.c 8.6 (Berkeley) 1/21/94 72 * Modified for ext2fs by Manuel Bouyer. 73 */ 74 75 #include <sys/cdefs.h> 76 __KERNEL_RCSID(0, "$NetBSD: ext2fs_bmap.c,v 1.12 2003/08/07 16:34:25 agc Exp $"); 77 78 #include <sys/param.h> 79 #include <sys/systm.h> 80 #include <sys/buf.h> 81 #include <sys/proc.h> 82 #include <sys/vnode.h> 83 #include <sys/mount.h> 84 #include <sys/resourcevar.h> 85 #include <sys/trace.h> 86 87 #include <miscfs/specfs/specdev.h> 88 89 #include <ufs/ufs/inode.h> 90 #include <ufs/ufs/ufsmount.h> 91 #include <ufs/ufs/ufs_extern.h> 92 #include <ufs/ext2fs/ext2fs.h> 93 #include <ufs/ext2fs/ext2fs_extern.h> 94 95 static int ext2fs_bmaparray __P((struct vnode *, daddr_t, daddr_t *, 96 struct indir *, int *, int *)); 97 98 #define is_sequential(ump, a, b) ((b) == (a) + ump->um_seqinc) 99 100 /* 101 * Bmap converts a the logical block number of a file to its physical block 102 * number on the disk. The conversion is done by using the logical block 103 * number to index into the array of block pointers described by the dinode. 104 */ 105 int 106 ext2fs_bmap(v) 107 void *v; 108 { 109 struct vop_bmap_args /* { 110 struct vnode *a_vp; 111 daddr_t a_bn; 112 struct vnode **a_vpp; 113 daddr_t *a_bnp; 114 int *a_runp; 115 } */ *ap = v; 116 /* 117 * Check for underlying vnode requests and ensure that logical 118 * to physical mapping is requested. 119 */ 120 if (ap->a_vpp != NULL) 121 *ap->a_vpp = VTOI(ap->a_vp)->i_devvp; 122 if (ap->a_bnp == NULL) 123 return (0); 124 125 return (ext2fs_bmaparray(ap->a_vp, ap->a_bn, ap->a_bnp, NULL, NULL, 126 ap->a_runp)); 127 } 128 129 /* 130 * Indirect blocks are now on the vnode for the file. They are given negative 131 * logical block numbers. Indirect blocks are addressed by the negative 132 * address of the first data block to which they point. Double indirect blocks 133 * are addressed by one less than the address of the first indirect block to 134 * which they point. Triple indirect blocks are addressed by one less than 135 * the address of the first double indirect block to which they point. 136 * 137 * ext2fs_bmaparray does the bmap conversion, and if requested returns the 138 * array of logical blocks which must be traversed to get to a block. 139 * Each entry contains the offset into that block that gets you to the 140 * next block and the disk address of the block (if it is assigned). 141 */ 142 143 int 144 ext2fs_bmaparray(vp, bn, bnp, ap, nump, runp) 145 struct vnode *vp; 146 daddr_t bn; 147 daddr_t *bnp; 148 struct indir *ap; 149 int *nump; 150 int *runp; 151 { 152 struct inode *ip; 153 struct buf *bp; 154 struct ufsmount *ump; 155 struct mount *mp; 156 struct indir a[NIADDR+1], *xap; 157 daddr_t daddr; 158 daddr_t metalbn; 159 int error, maxrun = 0, num; 160 161 ip = VTOI(vp); 162 mp = vp->v_mount; 163 ump = VFSTOUFS(mp); 164 #ifdef DIAGNOSTIC 165 if ((ap != NULL && nump == NULL) || (ap == NULL && nump != NULL)) 166 panic("ext2fs_bmaparray: invalid arguments"); 167 #endif 168 169 if (runp) { 170 /* 171 * XXX 172 * If MAXBSIZE is the largest transfer the disks can handle, 173 * we probably want maxrun to be 1 block less so that we 174 * don't create a block larger than the device can handle. 175 */ 176 *runp = 0; 177 maxrun = MAXBSIZE / mp->mnt_stat.f_iosize - 1; 178 } 179 180 if (bn >= 0 && bn < NDADDR) { 181 /* XXX ondisk32 */ 182 *bnp = blkptrtodb(ump, (daddr_t)fs2h32(ip->i_e2fs_blocks[bn])); 183 if (*bnp == 0) 184 *bnp = -1; 185 else if (runp) 186 /* XXX ondisk32 */ 187 for (++bn; bn < NDADDR && *runp < maxrun && 188 is_sequential(ump, (daddr_t)fs2h32(ip->i_e2fs_blocks[bn - 1]), 189 (daddr_t)fs2h32(ip->i_e2fs_blocks[bn])); 190 ++bn, ++*runp); 191 return (0); 192 } 193 194 xap = ap == NULL ? a : ap; 195 if (!nump) 196 nump = # 197 if ((error = ufs_getlbns(vp, bn, xap, nump)) != 0) 198 return (error); 199 200 num = *nump; 201 202 /* Get disk address out of indirect block array */ 203 /* XXX ondisk32 */ 204 daddr = fs2h32(ip->i_e2fs_blocks[NDADDR + xap->in_off]); 205 206 #ifdef DIAGNOSTIC 207 if (num > NIADDR + 1 || num < 1) { 208 printf("ext2fs_bmaparray: num=%d\n", num); 209 panic("ext2fs_bmaparray: num"); 210 } 211 #endif 212 for (bp = NULL, ++xap; --num; ++xap) { 213 /* 214 * Exit the loop if there is no disk address assigned yet and 215 * the indirect block isn't in the cache, or if we were 216 * looking for an indirect block and we've found it. 217 */ 218 219 metalbn = xap->in_lbn; 220 if ((daddr == 0 && !incore(vp, metalbn)) || metalbn == bn) 221 break; 222 /* 223 * If we get here, we've either got the block in the cache 224 * or we have a disk address for it, go fetch it. 225 */ 226 if (bp) 227 brelse(bp); 228 229 xap->in_exists = 1; 230 bp = getblk(vp, metalbn, mp->mnt_stat.f_iosize, 0, 0); 231 if (bp->b_flags & (B_DONE | B_DELWRI)) { 232 trace(TR_BREADHIT, pack(vp, size), metalbn); 233 } 234 #ifdef DIAGNOSTIC 235 else if (!daddr) 236 panic("ext2fs_bmaparry: indirect block not in cache"); 237 #endif 238 else { 239 trace(TR_BREADMISS, pack(vp, size), metalbn); 240 bp->b_blkno = blkptrtodb(ump, daddr); 241 bp->b_flags |= B_READ; 242 VOP_STRATEGY(bp); 243 curproc->p_stats->p_ru.ru_inblock++; /* XXX */ 244 if ((error = biowait(bp)) != 0) { 245 brelse(bp); 246 return (error); 247 } 248 } 249 250 /* XXX ondisk32 */ 251 daddr = fs2h32(((int32_t *)bp->b_data)[xap->in_off]); 252 if (num == 1 && daddr && runp) 253 /* XXX ondisk32 */ 254 for (bn = xap->in_off + 1; 255 bn < MNINDIR(ump) && *runp < maxrun && 256 is_sequential(ump, ((int32_t *)bp->b_data)[bn - 1], 257 ((int32_t *)bp->b_data)[bn]); 258 ++bn, ++*runp); 259 } 260 if (bp) 261 brelse(bp); 262 263 daddr = blkptrtodb(ump, daddr); 264 *bnp = daddr == 0 ? -1 : daddr; 265 return (0); 266 } 267
Indexes created Fri Sep 26 20:09:58 GMT 2025