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