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. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  * @(#)pass1b.c 8.4 (Berkeley) 4/28/95
  30  * $FreeBSD: src/sbin/fsck/pass1b.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $
  31  * $DragonFly: src/sbin/fsck/pass1b.c,v 1.8 2006/10/12 04:04:03 dillon Exp $
  32  */
  33
  34 #include <sys/param.h>
  35
  36 #include <vfs/ufs/dinode.h>
  37 #include <vfs/ufs/fs.h>
  38
  39 #include <string.h>
  40
  41 #include "fsck.h"
  42
  43 static  struct dups *duphead;
  44 static int pass1bcheck(struct inodesc *);
  45
  46 void
  47 pass1b(void)
  48 {
  49         int c, i;
  50         struct ufs1_dinode *dp;
  51         struct inodesc idesc;
  52         ufs1_ino_t inumber;
  53
  54         memset(&idesc, 0, sizeof(struct inodesc));
  55         idesc.id_type = ADDR;
  56         idesc.id_func = pass1bcheck;
  57         duphead = duplist;
  58         inumber = 0;
  59         for (c = 0; c < sblock.fs_ncg; c++) {
  60                 if (got_siginfo) {
  61                         printf("%s: phase 1b: cyl group %d of %d (%d%%)\n",
  62                             cdevname, c, sblock.fs_ncg,
  63                             c * 100 / sblock.fs_ncg);
  64                         got_siginfo = 0;
  65                 }
  66                 for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
  67                         if (inumber < ROOTINO)
  68                                 continue;
  69                         dp = ginode(inumber);
  70                         if (dp == NULL)
  71                                 continue;
  72                         idesc.id_number = inumber;
  73                         if (inoinfo(inumber)->ino_state != USTATE &&
  74                             (ckinode(dp, &idesc) & STOP))
  75                                 return;
  76                 }
  77         }
  78 }
  79
  80 static int
  81 pass1bcheck(struct inodesc *idesc)
  82 {
  83         struct dups *dlp;
  84         int nfrags, res = KEEPON;
  85         ufs_daddr_t blkno = idesc->id_blkno;
  86
  87         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
  88                 if (chkrange(blkno, 1))
  89                         res = SKIP;
  90                 for (dlp = duphead; dlp; dlp = dlp->next) {
  91                         if (dlp->dup == blkno) {
  92                                 blkerror(idesc->id_number, "DUP", blkno);
  93                                 dlp->dup = duphead->dup;
  94                                 duphead->dup = blkno;
  95                                 duphead = duphead->next;
  96                         }
  97                         if (dlp == muldup)
  98                                 break;
  99                 }
 100                 if (muldup == 0 || duphead == muldup->next)
 101                         return (STOP);
 102         }
 103         return (res);
 104 }