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