Home | History | Annotate | Line # | Download | only in fsck_lfs
pass5.c revision 1.6 
      1 /* $NetBSD: pass5.c,v 1.6 2000/09/09 04:49:56 perseant Exp $	 */
      2 
      3 /*-
      4  * Copyright (c) 2000 The NetBSD Foundation, Inc.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to The NetBSD Foundation
      8  * by Konrad E. Schroder <perseant (at) hhhh.org>.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *      This product includes software developed by the NetBSD
     21  *      Foundation, Inc. and its contributors.
     22  * 4. Neither the name of The NetBSD Foundation nor the names of its
     23  *    contributors may be used to endorse or promote products derived
     24  *    from this software without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     27  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     28  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     29  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     30  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     31  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     32  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     33  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     34  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     35  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     36  * POSSIBILITY OF SUCH DAMAGE.
     37  */
     38 
     39 #include <sys/param.h>
     40 #include <sys/time.h>
     41 #include <ufs/ufs/dinode.h>
     42 #include <ufs/ufs/dir.h>
     43 #include <sys/mount.h>
     44 #include <ufs/lfs/lfs.h>
     45 
     46 #include <string.h>
     47 #include "fsck.h"
     48 #include "extern.h"
     49 #include "fsutil.h"
     50 
     51 extern SEGUSE  *seg_table;
     52 
     53 void
     54 pass5()
     55 {
     56 	SEGUSE         *su;
     57 	struct bufarea *bp;
     58 	int             i;
     59 	unsigned long   bb; /* total number of used blocks (lower bound) */
     60 	unsigned long   ubb; /* upper bound number of used blocks */
     61 	unsigned long   avail; /* blocks available for writing */
     62 
     63 	/*
     64 	 * Check segment holdings against actual holdings.  Check for
     65 	 * "clean" segments that contain live data.
     66 	 */
     67 	avail = 0;
     68 	bb = ubb = 0;
     69 	for (i = 0; i < sblock.lfs_nseg; i++) {
     70 		su = lfs_gseguse(i, &bp);
     71 		if (!(su->su_flags & SEGUSE_DIRTY) &&
     72 		    seg_table[i].su_nbytes > 0) {
     73 			pwarn("%d bytes contained in 'clean' segment %d\n",
     74 			      seg_table[i].su_nbytes, i);
     75 			if (preen || reply("fix")) {
     76 				su->su_flags |= SEGUSE_DIRTY;
     77 				dirty(bp);
     78 			}
     79 		}
     80 		if ((su->su_flags & SEGUSE_DIRTY) &&
     81 		    su->su_nbytes != seg_table[i].su_nbytes) {
     82 			pwarn("segment %d claims %d bytes but has %d",
     83 			      i, su->su_nbytes, seg_table[i].su_nbytes);
     84 			if (su->su_nbytes > seg_table[i].su_nbytes)
     85 				pwarn(" (high by %d)\n", su->su_nbytes -
     86 				      seg_table[i].su_nbytes);
     87 			else
     88 				pwarn(" (low by %d)\n", - su->su_nbytes +
     89 				      seg_table[i].su_nbytes);
     90 			if (preen || reply("fix")) {
     91 				su->su_nbytes = seg_table[i].su_nbytes;
     92 				dirty(bp);
     93 			}
     94 		}
     95 		if (su->su_flags & SEGUSE_DIRTY) {
     96 			bb += btodb(su->su_nbytes) + su->su_nsums;
     97 			ubb += btodb(su->su_nbytes) + su->su_nsums + fsbtodb(&sblock, su->su_ninos);
     98 		} else {
     99 			avail += fsbtodb(&sblock, sblock.lfs_ssize);
    100 			if (su->su_flags & SEGUSE_SUPERBLOCK)
    101 				avail -= btodb(LFS_SBPAD);
    102 		}
    103 		bp->b_flags &= ~B_INUSE;
    104 	}
    105 	/* Also may be available bytes in current seg */
    106 	i = datosn(&sblock, sblock.lfs_offset);
    107 	avail += sntoda(&sblock, i + 1) - sblock.lfs_offset;
    108 	/* But do not count minfreesegs */
    109 	avail -= fsbtodb(&sblock, sblock.lfs_ssize) *
    110 		(sblock.lfs_minfreeseg - (sblock.lfs_minfreeseg / 2));
    111 
    112 	if (avail != sblock.lfs_avail) {
    113 		pwarn("avail given as %d, should be %ld\n", sblock.lfs_avail,
    114 		      avail);
    115 		if (preen || reply("fix")) {
    116 			sblock.lfs_avail = avail;
    117 			sbdirty();
    118 		}
    119 	}
    120 	if (sblock.lfs_bfree > sblock.lfs_dsize - bb ||
    121 	    sblock.lfs_bfree < sblock.lfs_dsize - ubb) {
    122 		pwarn("bfree given as %d, should be between %ld and %ld\n",
    123 		      sblock.lfs_bfree, sblock.lfs_dsize - ubb,
    124 		      sblock.lfs_dsize - bb);
    125 		if (preen || reply("fix")) {
    126 			sblock.lfs_bfree = sblock.lfs_dsize - (ubb + bb) / 2;
    127 			sbdirty();
    128 		}
    129 	}
    130 }
    131