sbin/fsck/pass1b.c

   1 /*
   2  * Copyright (c) 1980, 1986, 1993
   3  *      The Regents of the University of California.  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  *
  33  * @(#)pass1b.c 8.4 (Berkeley) 4/28/95
  34  * $FreeBSD: src/sbin/fsck/pass1b.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $
  35  * $DragonFly: src/sbin/fsck/pass1b.c,v 1.8 2006/10/12 04:04:03 dillon Exp $
  36  */
  37
  38 #include <sys/param.h>
  39
  40 #include <vfs/ufs/dinode.h>
  41 #include <vfs/ufs/fs.h>
  42
  43 #include <string.h>
  44
  45 #include "fsck.h"
  46
  47 static  struct dups *duphead;
  48 static int pass1bcheck(struct inodesc *);
  49
  50 void
  51 pass1b(void)
  52 {
  53         int c, i;
  54         struct ufs1_dinode *dp;
  55         struct inodesc idesc;
  56         ufs1_ino_t inumber;
  57
  58         memset(&idesc, 0, sizeof(struct inodesc));
  59         idesc.id_type = ADDR;
  60         idesc.id_func = pass1bcheck;
  61         duphead = duplist;
  62         inumber = 0;
  63         for (c = 0; c < sblock.fs_ncg; c++) {
  64                 if (got_siginfo) {
  65                         printf("%s: phase 1b: cyl group %d of %d (%d%%)\n",
  66                             cdevname, c, sblock.fs_ncg,
  67                             c * 100 / sblock.fs_ncg);
  68                         got_siginfo = 0;
  69                 }
  70                 for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
  71                         if (inumber < ROOTINO)
  72                                 continue;
  73                         dp = ginode(inumber);
  74                         if (dp == NULL)
  75                                 continue;
  76                         idesc.id_number = inumber;
  77                         if (inoinfo(inumber)->ino_state != USTATE &&
  78                             (ckinode(dp, &idesc) & STOP))
  79                                 return;
  80                 }
  81         }
  82 }
  83
  84 static int
  85 pass1bcheck(struct inodesc *idesc)
  86 {
  87         struct dups *dlp;
  88         int nfrags, res = KEEPON;
  89         ufs_daddr_t blkno = idesc->id_blkno;
  90
  91         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
  92                 if (chkrange(blkno, 1))
  93                         res = SKIP;
  94                 for (dlp = duphead; dlp; dlp = dlp->next) {
  95                         if (dlp->dup == blkno) {
  96                                 blkerror(idesc->id_number, "DUP", blkno);
  97                                 dlp->dup = duphead->dup;
  98                                 duphead->dup = blkno;
  99                                 duphead = duphead->next;
 100                         }
 101                         if (dlp == muldup)
 102                                 break;
 103                 }
 104                 if (muldup == 0 || duphead == muldup->next)
 105                         return (STOP);
 106         }
 107         return (res);
 108 }