Home | History | Annotate | Line # | Download | only in fsck_ffs
pass4.c revision 1.17 
      1 /*	$NetBSD: pass4.c,v 1.17 2003/04/02 10:39:26 fvdl Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1980, 1986, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  */
     35 
     36 #include <sys/cdefs.h>
     37 #ifndef lint
     38 #if 0
     39 static char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
     40 #else
     41 __RCSID("$NetBSD: pass4.c,v 1.17 2003/04/02 10:39:26 fvdl Exp $");
     42 #endif
     43 #endif /* not lint */
     44 
     45 #include <sys/param.h>
     46 #include <sys/time.h>
     47 
     48 #include <ufs/ufs/dinode.h>
     49 #include <ufs/ffs/fs.h>
     50 
     51 #include <err.h>
     52 #include <stdlib.h>
     53 #include <string.h>
     54 
     55 #include "fsutil.h"
     56 #include "fsck.h"
     57 #include "extern.h"
     58 
     59 void
     60 pass4()
     61 {
     62 	ino_t inumber;
     63 	struct zlncnt *zlnp;
     64 	union dinode *dp;
     65 	struct inodesc idesc;
     66 	int n, i, cg;
     67 	struct inostat *info;
     68 
     69 	memset(&idesc, 0, sizeof(struct inodesc));
     70 	idesc.id_type = ADDR;
     71 	idesc.id_func = pass4check;
     72 
     73 	for (cg = 0; cg < sblock->fs_ncg; cg++) {
     74 		if (got_siginfo) {
     75 			fprintf(stderr,
     76 			    "%s: phase 4: cyl group %d of %d (%d%%)\n",
     77 			    cdevname(), cg, sblock->fs_ncg,
     78 			    cg * 100 / sblock->fs_ncg);
     79 			got_siginfo = 0;
     80 		}
     81 		inumber = cg * sblock->fs_ipg;
     82 		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
     83 			if (inumber < ROOTINO)
     84 				continue;
     85 			info = inoinfo(inumber);
     86 			idesc.id_number = inumber;
     87 			switch (info->ino_state) {
     88 			case FSTATE:
     89 			case DFOUND:
     90 				n = info->ino_linkcnt;
     91 				if (n) {
     92 					adjust(&idesc, (short)n);
     93 					break;
     94 				}
     95 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
     96 					if (zlnp->zlncnt == inumber) {
     97 						zlnp->zlncnt = zlnhead->zlncnt;
     98 						zlnp = zlnhead;
     99 						zlnhead = zlnhead->next;
    100 						free((char *)zlnp);
    101 						clri(&idesc, "UNREF", 1);
    102 						break;
    103 					}
    104 				break;
    105 
    106 			case DSTATE:
    107 				clri(&idesc, "UNREF", 1);
    108 				break;
    109 
    110 			case DCLEAR:
    111 				dp = ginode(inumber);
    112 				if (DIP(dp, size) == 0) {
    113 					clri(&idesc, "ZERO LENGTH", 1);
    114 					break;
    115 				}
    116 				/* fall through */
    117 			case FCLEAR:
    118 				clri(&idesc, "BAD/DUP", 1);
    119 				break;
    120 
    121 			case USTATE:
    122 				break;
    123 
    124 			default:
    125 				errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
    126 				    info->ino_state, inumber);
    127 			}
    128 		}
    129 	}
    130 }
    131 
    132 int
    133 pass4check(idesc)
    134 	struct inodesc *idesc;
    135 {
    136 	struct dups *dlp;
    137 	int nfrags, res = KEEPON;
    138 	daddr_t blkno = idesc->id_blkno;
    139 
    140 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
    141 		if (chkrange(blkno, 1)) {
    142 			res = SKIP;
    143 		} else if (testbmap(blkno)) {
    144 			for (dlp = duplist; dlp; dlp = dlp->next) {
    145 				if (dlp->dup != blkno)
    146 					continue;
    147 				dlp->dup = duplist->dup;
    148 				dlp = duplist;
    149 				duplist = duplist->next;
    150 				free((char *)dlp);
    151 				break;
    152 			}
    153 			if (dlp == 0) {
    154 				clrbmap(blkno);
    155 				n_blks--;
    156 			}
    157 		}
    158 	}
    159 	return (res);
    160 }
    161