Return to bmap.c CVS log

Up to [Net/2] / Net2 / arch / i386 / stand

Annotation of Net2/arch/i386/stand/bmap.c, revision 1.1.1.2

1.1       root        1: /*
                      2:  * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
                      3:  * 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:  * 3. All advertising materials mentioning features or use of this software
                     14:  *    must display the following acknowledgement:
                     15:  *     This product includes software developed by the University of
                     16:  *     California, Berkeley and its contributors.
                     17:  * 4. Neither the name of the University nor the names of its contributors
                     18:  *    may be used to endorse or promote products derived from this software
                     19:  *    without specific prior written permission.
                     20:  *
                     21:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
                     22:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
                     23:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
                     24:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
                     25:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
                     26:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
                     27:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
                     28:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
                     29:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
                     30:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
                     31:  * SUCH DAMAGE.
                     32:  *
1.1.1.2 ! root       33:  *     from: @(#)ufs_bmap.c    7.13 (Berkeley) 5/8/91
        !            34:  *     bmap.c,v 1.2 1993/05/22 08:02:08 cgd Exp
1.1       root       35:  */
                     36: 
                     37: #include "param.h"
                     38: #include "dinode.h"
                     39: #include "fs.h"
                     40: #include "errno.h"
                     41: 
                     42: /*
                     43:  * Bmap converts a the logical block number of a file
                     44:  * to its physical block number on the disk. The conversion
                     45:  * is done by using the logical block number to index into
                     46:  * the array of block pointers described by the dinode.
                     47:  */
                     48: extern struct fs *fs;
                     49: extern int bdev;
                     50: 
                     51: static daddr_t bap[2*1024];
                     52: static daddr_t bnobap;
                     53: 
                     54: bmap(dip, bn, bnp)
                     55:        register struct dinode *dip;
                     56:        register daddr_t bn;
                     57:        daddr_t *bnp;
                     58: {
                     59:        register daddr_t nb;
                     60:        int i, j, sh;
                     61:        int error;
                     62: 
                     63: /*fprintf(stderr, "bmap %d ", bn);*/
                     64:        if (bn < 0)
                     65:                return (EFBIG);
                     66: 
                     67:        /*
                     68:         * The first NDADDR blocks are direct blocks
                     69:         */
                     70:        if (bn < NDADDR) {
                     71:                nb = dip->di_db[bn];
                     72:                if (nb == 0) {
                     73:                        *bnp = (daddr_t)-1;
                     74: /*fprintf(stderr, "%d\n", *bnp);*/
                     75:                        return (0);
                     76:                }
                     77:                *bnp = fsbtodb(fs, nb);
                     78: /*fprintf(stderr, "%d\n", *bnp);*/
                     79:                return (0);
                     80:        }
                     81:        /*
                     82:         * Determine the number of levels of indirection.
                     83:         */
                     84:        sh = 1;
                     85:        bn -= NDADDR;
                     86:        for (j = NIADDR; j > 0; j--) {
                     87:                sh *= NINDIR(fs);
                     88:                if (bn < sh)
                     89:                        break;
                     90:                bn -= sh;
                     91:        }
                     92:        if (j == 0)
                     93:                return (EFBIG);
                     94:        /*
                     95:         * Fetch through the indirect blocks.
                     96:         */
                     97:        nb = dip->di_ib[NIADDR - j];
                     98:        if (nb == 0) {
                     99:                *bnp = (daddr_t)-1;
                    100: /*fprintf(stderr, "%d\n", *bnp);*/
                    101:                return (0);
                    102:        }
                    103:        for (; j <= NIADDR; j++) {
                    104:                daddr_t bno = fsbtodb(fs, nb);
                    105: 
                    106:                if (bnobap != bno &&
                    107: (error = bread(bdev, bno, &bap,
                    108:                        (int)fs->fs_bsize))) {
                    109:                        return (error);
                    110:                }
                    111:                bnobap = bno;
                    112:                sh /= NINDIR(fs);
                    113:                i = (bn / sh) % NINDIR(fs);
                    114:                nb = bap[i];
                    115:                if (nb == 0) {
                    116:                        *bnp = (daddr_t)-1;
                    117: /*fprintf(stderr, "%d\n", *bnp);*/
                    118:                        return (0);
                    119:                }
                    120:        }
                    121:        *bnp = fsbtodb(fs, nb);
                    122: /*fprintf(stderr, "%d\n", *bnp);*/
                    123:        return (0);
                    124: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.