* Copyright (c) 1982, 1986, 1989 Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* derived from: @(#)ufs_bmap.c 7.13 (Berkeley) 5/8/91
* Bmap converts a the logical block number of a file
* to its physical block number on the disk. The conversion
* is done by using the logical block number to index into
* the array of block pointers described by the dinode.
static daddr_t bap
[2*1024];
register struct dinode
*dip
;
/*fprintf(stderr, "bmap %d ", bn);*/
* The first NDADDR blocks are direct blocks
/*fprintf(stderr, "%d\n", *bnp);*/
/*fprintf(stderr, "%d\n", *bnp);*/
* Determine the number of levels of indirection.
for (j
= NIADDR
; j
> 0; j
--) {
* Fetch through the indirect blocks.
nb
= dip
->di_ib
[NIADDR
- j
];
/*fprintf(stderr, "%d\n", *bnp);*/
for (; j
<= NIADDR
; j
++) {
daddr_t bno
= fsbtodb(fs
, nb
);
(error
= bread(bdev
, bno
, &bap
,
i
= (bn
/ sh
) % NINDIR(fs
);
/*fprintf(stderr, "%d\n", *bnp);*/
/*fprintf(stderr, "%d\n", *bnp);*/