Home | History | Annotate | Line # | Download | only in ffs
ufs_bmap.c revision 1.5 
      1 /*	$NetBSD: ufs_bmap.c,v 1.5 2001/12/31 19:45:03 thorpej Exp $	*/
      2 /* From: NetBSD: ufs_bmap.c,v 1.14 2001/11/08 05:00:51 chs Exp */
      3 
      4 /*
      5  * Copyright (c) 1989, 1991, 1993
      6  *	The Regents of the University of California.  All rights reserved.
      7  * (c) UNIX System Laboratories, Inc.
      8  * All or some portions of this file are derived from material licensed
      9  * to the University of California by American Telephone and Telegraph
     10  * Co. or Unix System Laboratories, Inc. and are reproduced herein with
     11  * the permission of UNIX System Laboratories, Inc.
     12  *
     13  * Redistribution and use in source and binary forms, with or without
     14  * modification, are permitted provided that the following conditions
     15  * are met:
     16  * 1. Redistributions of source code must retain the above copyright
     17  *    notice, this list of conditions and the following disclaimer.
     18  * 2. Redistributions in binary form must reproduce the above copyright
     19  *    notice, this list of conditions and the following disclaimer in the
     20  *    documentation and/or other materials provided with the distribution.
     21  * 3. All advertising materials mentioning features or use of this software
     22  *    must display the following acknowledgement:
     23  *	This product includes software developed by the University of
     24  *	California, Berkeley and its contributors.
     25  * 4. Neither the name of the University nor the names of its contributors
     26  *    may be used to endorse or promote products derived from this software
     27  *    without specific prior written permission.
     28  *
     29  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     30  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     31  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     32  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     33  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     34  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     35  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     36  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     37  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     38  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     39  * SUCH DAMAGE.
     40  *
     41  *	@(#)ufs_bmap.c	8.8 (Berkeley) 8/11/95
     42  */
     43 
     44 #include <sys/cdefs.h>
     45 #ifndef __lint
     46 __RCSID("$NetBSD: ufs_bmap.c,v 1.5 2001/12/31 19:45:03 thorpej Exp $");
     47 #endif	/* !__lint */
     48 
     49 #include <sys/param.h>
     50 #include <sys/time.h>
     51 
     52 #include <assert.h>
     53 #include <errno.h>
     54 #include <strings.h>
     55 
     56 #include "ufs/ufs/ufs_bswap.h"
     57 #include "ufs/ufs/inode.h"
     58 #include "ufs/ffs/fs.h"
     59 
     60 #include "ffs/buf.h"
     61 #include "ffs/ffs_extern.h"
     62 
     63 /*
     64  * Create an array of logical block number/offset pairs which represent the
     65  * path of indirect blocks required to access a data block.  The first "pair"
     66  * contains the logical block number of the appropriate single, double or
     67  * triple indirect block and the offset into the inode indirect block array.
     68  * Note, the logical block number of the inode single/double/triple indirect
     69  * block appears twice in the array, once with the offset into the i_ffs_ib and
     70  * once with the offset into the page itself.
     71  */
     72 int
     73 ufs_getlbns(struct inode *ip, ufs_daddr_t bn, struct indir *ap, int *nump)
     74 {
     75 	long metalbn, realbn;
     76 	int64_t blockcnt;
     77 	int lbc;
     78 	int i, numlevels, off;
     79 	u_long lognindir;
     80 
     81 	lognindir = ffs(NINDIR(ip->i_fs)) - 1;
     82 	if (nump)
     83 		*nump = 0;
     84 	numlevels = 0;
     85 	realbn = bn;
     86 	if ((long)bn < 0)
     87 		bn = -(long)bn;
     88 
     89 	assert (bn >= NDADDR);
     90 
     91 	/*
     92 	 * Determine the number of levels of indirection.  After this loop
     93 	 * is done, blockcnt indicates the number of data blocks possible
     94 	 * at the given level of indirection, and NIADDR - i is the number
     95 	 * of levels of indirection needed to locate the requested block.
     96 	 */
     97 
     98 	bn -= NDADDR;
     99 	for (lbc = 0, i = NIADDR;; i--, bn -= blockcnt) {
    100 		if (i == 0)
    101 			return (EFBIG);
    102 
    103 		lbc += lognindir;
    104 		blockcnt = (int64_t)1 << lbc;
    105 
    106 		if (bn < blockcnt)
    107 			break;
    108 	}
    109 
    110 	/* Calculate the address of the first meta-block. */
    111 	if (realbn >= 0)
    112 		metalbn = -(realbn - bn + NIADDR - i);
    113 	else
    114 		metalbn = -(-realbn - bn + NIADDR - i);
    115 
    116 	/*
    117 	 * At each iteration, off is the offset into the bap array which is
    118 	 * an array of disk addresses at the current level of indirection.
    119 	 * The logical block number and the offset in that block are stored
    120 	 * into the argument array.
    121 	 */
    122 	ap->in_lbn = metalbn;
    123 	ap->in_off = off = NIADDR - i;
    124 	ap->in_exists = 0;
    125 	ap++;
    126 	for (++numlevels; i <= NIADDR; i++) {
    127 		/* If searching for a meta-data block, quit when found. */
    128 		if (metalbn == realbn)
    129 			break;
    130 
    131 		lbc -= lognindir;
    132 		blockcnt = (int64_t)1 << lbc;
    133 		off = (bn >> lbc) & (NINDIR(ip->i_fs) - 1);
    134 
    135 		++numlevels;
    136 		ap->in_lbn = metalbn;
    137 		ap->in_off = off;
    138 		ap->in_exists = 0;
    139 		++ap;
    140 
    141 		metalbn -= -1 + (off << lbc);
    142 	}
    143 	if (nump)
    144 		*nump = numlevels;
    145 	return (0);
    146 }
    147