Home | History | Annotate | Line # | Download | only in fsck_lfs
pass4.c revision 1.3 
      1 /* $NetBSD: pass4.c,v 1.3 2000/05/23 01:48:55 perseant 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/param.h>
     37 #include <sys/time.h>
     38 #include <ufs/ufs/dinode.h>
     39 #include <sys/mount.h>
     40 #include <ufs/lfs/lfs.h>
     41 #include <stdlib.h>
     42 #include <string.h>
     43 
     44 #include "fsutil.h"
     45 #include "fsck.h"
     46 #include "extern.h"
     47 
     48 void
     49 pass4()
     50 {
     51 	register ino_t  inumber;
     52 	register struct zlncnt *zlnp;
     53 	struct dinode  *dp;
     54 	struct inodesc  idesc;
     55 	int             n;
     56 
     57 	memset(&idesc, 0, sizeof(struct inodesc));
     58 	idesc.id_type = ADDR;
     59 	idesc.id_func = pass4check;
     60 	for (inumber = ROOTINO; inumber <= lastino; inumber++) {
     61 		idesc.id_number = inumber;
     62 		switch (statemap[inumber]) {
     63 
     64 		case FSTATE:
     65 		case DFOUND:
     66 			n = lncntp[inumber];
     67 			if (n)
     68 				adjust(&idesc, (short)n);
     69 			else {
     70 				for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
     71 					if (zlnp->zlncnt == inumber) {
     72 						zlnp->zlncnt = zlnhead->zlncnt;
     73 						zlnp = zlnhead;
     74 						zlnhead = zlnhead->next;
     75 						free((char *)zlnp);
     76 						clri(&idesc, "UNREF", 1);
     77 						break;
     78 					}
     79 			}
     80 			break;
     81 
     82 		case DSTATE:
     83 			clri(&idesc, "UNREF", 1);
     84 			break;
     85 
     86 		case DCLEAR:
     87 			dp = ginode(inumber);
     88 			if (dp->di_size == 0) {
     89 				clri(&idesc, "ZERO LENGTH", 1);
     90 				break;
     91 			}
     92 			/* fall through */
     93 		case FCLEAR:
     94 			clri(&idesc, "BAD/DUP", 1);
     95 			break;
     96 
     97 		case USTATE:
     98 			break;
     99 
    100 		default:
    101 			errexit("BAD STATE %d FOR INODE I=%d",
    102 				statemap[inumber], inumber);
    103 		}
    104 	}
    105 }
    106 
    107 int
    108 pass4check(struct inodesc * idesc)
    109 {
    110 	register struct dups *dlp;
    111 	int             nfrags, res = KEEPON;
    112 	daddr_t         blkno = idesc->id_blkno;
    113 
    114 	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
    115 		if (chkrange(blkno, 1)) {
    116 			res = SKIP;
    117 		} else if (testbmap(blkno)) {
    118 			for (dlp = duplist; dlp; dlp = dlp->next) {
    119 				if (dlp->dup != blkno)
    120 					continue;
    121 				dlp->dup = duplist->dup;
    122 				dlp = duplist;
    123 				duplist = duplist->next;
    124 				free((char *)dlp);
    125 				break;
    126 			}
    127 			if (dlp == 0) {
    128 				clrbmap(blkno);
    129 				n_blks--;
    130 			}
    131 		}
    132 	}
    133 	return (res);
    134 }
    135