sbin/fsck/pass4.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  * @(#)pass4.c  8.4 (Berkeley) 4/28/95
  34  * $FreeBSD: src/sbin/fsck/pass4.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $
  35  */
  36
  37 #include <sys/param.h>
  38
  39 #include <vfs/ufs/dinode.h>
  40 #include <vfs/ufs/fs.h>
  41
  42 #include <err.h>
  43 #include <string.h>
  44
  45 #include "fsck.h"
  46
  47 void
  48 pass4(void)
  49 {
  50         ufs1_ino_t inumber;
  51         struct zlncnt *zlnp;
  52         struct ufs1_dinode *dp;
  53         struct inodesc idesc;
  54         int i, n, cg;
  55
  56         memset(&idesc, 0, sizeof(struct inodesc));
  57         idesc.id_type = ADDR;
  58         idesc.id_func = pass4check;
  59         for (cg = 0; cg < sblock.fs_ncg; cg++) {
  60                 if (got_siginfo) {
  61                         printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
  62                             cdevname, cg, sblock.fs_ncg,
  63                             cg * 100 / sblock.fs_ncg);
  64                         got_siginfo = 0;
  65                 }
  66                 inumber = cg * sblock.fs_ipg;
  67                 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
  68                         if (inumber < ROOTINO)
  69                                 continue;
  70                         idesc.id_number = inumber;
  71                         switch (inoinfo(inumber)->ino_state) {
  72
  73                         case FSTATE:
  74                         case DFOUND:
  75                                 n = inoinfo(inumber)->ino_linkcnt;
  76                                 if (n) {
  77                                         adjust(&idesc, (short)n);
  78                                         break;
  79                                 }
  80                                 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
  81                                         if (zlnp->zlncnt == inumber) {
  82                                                 zlnp->zlncnt = zlnhead->zlncnt;
  83                                                 zlnp = zlnhead;
  84                                                 zlnhead = zlnhead->next;
  85                                                 free((char *)zlnp);
  86                                                 clri(&idesc, "UNREF", 1);
  87                                                 break;
  88                                         }
  89                                 }
  90                                 break;
  91
  92                         case DSTATE:
  93                                 clri(&idesc, "UNREF", 1);
  94                                 break;
  95
  96                         case DCLEAR:
  97                                 dp = ginode(inumber);
  98                                 if (dp->di_size == 0) {
  99                                         clri(&idesc, "ZERO LENGTH", 1);
 100                                         break;
 101                                 }
 102                                 /* fall through */
 103                         case FCLEAR:
 104                                 clri(&idesc, "BAD/DUP", 1);
 105                                 break;
 106
 107                         case USTATE:
 108                                 break;
 109
 110                         default:
 111                                 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
 112                                     inoinfo(inumber)->ino_state, inumber);
 113                         }
 114                 }
 115         }
 116 }
 117
 118 int
 119 pass4check(struct inodesc *idesc)
 120 {
 121         struct dups *dlp;
 122         int nfrags, res = KEEPON;
 123         ufs_daddr_t blkno = idesc->id_blkno;
 124
 125         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
 126                 if (chkrange(blkno, 1)) {
 127                         res = SKIP;
 128                 } else if (testbmap(blkno)) {
 129                         for (dlp = duplist; dlp; dlp = dlp->next) {
 130                                 if (dlp->dup != blkno)
 131                                         continue;
 132                                 dlp->dup = duplist->dup;
 133                                 dlp = duplist;
 134                                 duplist = duplist->next;
 135                                 free((char *)dlp);
 136                                 break;
 137                         }
 138                         if (dlp == NULL) {
 139                                 clrbmap(blkno);
 140                                 n_blks--;
 141                         }
 142                 }
 143         }
 144         return (res);
 145 }