131 lines
4.6 KiB
C
131 lines
4.6 KiB
C
/* $NetBSD: pass5.c,v 1.6 2000/09/09 04:49:56 perseant Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 2000 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Konrad E. Schroder <perseant@hhhh.org>.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the NetBSD
|
|
* Foundation, Inc. and its contributors.
|
|
* 4. Neither the name of The NetBSD Foundation nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/time.h>
|
|
#include <ufs/ufs/dinode.h>
|
|
#include <ufs/ufs/dir.h>
|
|
#include <sys/mount.h>
|
|
#include <ufs/lfs/lfs.h>
|
|
|
|
#include <string.h>
|
|
#include "fsck.h"
|
|
#include "extern.h"
|
|
#include "fsutil.h"
|
|
|
|
extern SEGUSE *seg_table;
|
|
|
|
void
|
|
pass5()
|
|
{
|
|
SEGUSE *su;
|
|
struct bufarea *bp;
|
|
int i;
|
|
unsigned long bb; /* total number of used blocks (lower bound) */
|
|
unsigned long ubb; /* upper bound number of used blocks */
|
|
unsigned long avail; /* blocks available for writing */
|
|
|
|
/*
|
|
* Check segment holdings against actual holdings. Check for
|
|
* "clean" segments that contain live data.
|
|
*/
|
|
avail = 0;
|
|
bb = ubb = 0;
|
|
for (i = 0; i < sblock.lfs_nseg; i++) {
|
|
su = lfs_gseguse(i, &bp);
|
|
if (!(su->su_flags & SEGUSE_DIRTY) &&
|
|
seg_table[i].su_nbytes > 0) {
|
|
pwarn("%d bytes contained in 'clean' segment %d\n",
|
|
seg_table[i].su_nbytes, i);
|
|
if (preen || reply("fix")) {
|
|
su->su_flags |= SEGUSE_DIRTY;
|
|
dirty(bp);
|
|
}
|
|
}
|
|
if ((su->su_flags & SEGUSE_DIRTY) &&
|
|
su->su_nbytes != seg_table[i].su_nbytes) {
|
|
pwarn("segment %d claims %d bytes but has %d",
|
|
i, su->su_nbytes, seg_table[i].su_nbytes);
|
|
if (su->su_nbytes > seg_table[i].su_nbytes)
|
|
pwarn(" (high by %d)\n", su->su_nbytes -
|
|
seg_table[i].su_nbytes);
|
|
else
|
|
pwarn(" (low by %d)\n", - su->su_nbytes +
|
|
seg_table[i].su_nbytes);
|
|
if (preen || reply("fix")) {
|
|
su->su_nbytes = seg_table[i].su_nbytes;
|
|
dirty(bp);
|
|
}
|
|
}
|
|
if (su->su_flags & SEGUSE_DIRTY) {
|
|
bb += btodb(su->su_nbytes) + su->su_nsums;
|
|
ubb += btodb(su->su_nbytes) + su->su_nsums + fsbtodb(&sblock, su->su_ninos);
|
|
} else {
|
|
avail += fsbtodb(&sblock, sblock.lfs_ssize);
|
|
if (su->su_flags & SEGUSE_SUPERBLOCK)
|
|
avail -= btodb(LFS_SBPAD);
|
|
}
|
|
bp->b_flags &= ~B_INUSE;
|
|
}
|
|
/* Also may be available bytes in current seg */
|
|
i = datosn(&sblock, sblock.lfs_offset);
|
|
avail += sntoda(&sblock, i + 1) - sblock.lfs_offset;
|
|
/* But do not count minfreesegs */
|
|
avail -= fsbtodb(&sblock, sblock.lfs_ssize) *
|
|
(sblock.lfs_minfreeseg - (sblock.lfs_minfreeseg / 2));
|
|
|
|
if (avail != sblock.lfs_avail) {
|
|
pwarn("avail given as %d, should be %ld\n", sblock.lfs_avail,
|
|
avail);
|
|
if (preen || reply("fix")) {
|
|
sblock.lfs_avail = avail;
|
|
sbdirty();
|
|
}
|
|
}
|
|
if (sblock.lfs_bfree > sblock.lfs_dsize - bb ||
|
|
sblock.lfs_bfree < sblock.lfs_dsize - ubb) {
|
|
pwarn("bfree given as %d, should be between %ld and %ld\n",
|
|
sblock.lfs_bfree, sblock.lfs_dsize - ubb,
|
|
sblock.lfs_dsize - bb);
|
|
if (preen || reply("fix")) {
|
|
sblock.lfs_bfree = sblock.lfs_dsize - (ubb + bb) / 2;
|
|
sbdirty();
|
|
}
|
|
}
|
|
}
|