NetBSD/sbin/fsck_ffs/pass1.c

374 lines
9.7 KiB
C
Raw Normal View History

/* $NetBSD: pass1.c,v 1.25 2002/09/28 20:11:06 dbj Exp $ */
1993-03-21 12:45:37 +03:00
/*
* Copyright (c) 1980, 1986, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* 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 University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University 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 REGENTS 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 REGENTS 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/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
1997-09-16 20:44:43 +04:00
static char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95";
#else
__RCSID("$NetBSD: pass1.c,v 1.25 2002/09/28 20:11:06 dbj Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#include <sys/param.h>
1994-04-25 22:23:19 +04:00
#include <sys/time.h>
1997-09-16 20:44:43 +04:00
#include <ufs/ufs/dinode.h>
#include <ufs/ufs/dir.h>
#include <ufs/ffs/fs.h>
1997-09-16 20:44:43 +04:00
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
1993-03-21 12:45:37 +03:00
#include <string.h>
1993-03-21 12:45:37 +03:00
#include "fsck.h"
#include "extern.h"
1996-09-28 02:45:10 +04:00
#include "fsutil.h"
1993-03-21 12:45:37 +03:00
1997-09-16 20:44:43 +04:00
static ufs_daddr_t badblk;
static ufs_daddr_t dupblk;
static void checkinode __P((ino_t, struct inodesc *));
1993-03-21 12:45:37 +03:00
void
1993-03-21 12:45:37 +03:00
pass1()
{
ino_t inumber;
int c, i, cgd;
struct inodesc idesc;
1993-03-21 12:45:37 +03:00
/*
* Set file system reserved blocks in used block map.
*/
for (c = 0; c < sblock->fs_ncg; c++) {
cgd = cgdmin(sblock, c);
if (c == 0)
i = cgbase(sblock, c);
else
i = cgsblock(sblock, c);
1993-03-21 12:45:37 +03:00
for (; i < cgd; i++)
setbmap(i);
}
i = sblock->fs_csaddr;
cgd = i + howmany(sblock->fs_cssize, sblock->fs_fsize);
for (; i < cgd; i++)
setbmap(i);
1993-03-21 12:45:37 +03:00
/*
* Find all allocated blocks.
*/
memset(&idesc, 0, sizeof(struct inodesc));
1993-03-21 12:45:37 +03:00
idesc.id_type = ADDR;
idesc.id_func = pass1check;
inumber = 0;
n_files = n_blks = 0;
resetinodebuf();
for (c = 0; c < sblock->fs_ncg; c++) {
if (got_siginfo) {
fprintf(stderr,
"%s: phase 1: cyl group %d of %d (%d%%)\n",
cdevname(), c, sblock->fs_ncg,
c * 100 / sblock->fs_ncg);
got_siginfo = 0;
}
for (i = 0; i < sblock->fs_ipg; i++, inumber++) {
1993-03-21 12:45:37 +03:00
if (inumber < ROOTINO)
continue;
checkinode(inumber, &idesc);
}
}
freeinodebuf();
do_blkswap = 0; /* has been done */
}
static void
checkinode(inumber, idesc)
ino_t inumber;
struct inodesc *idesc;
{
struct dinode *dp;
struct zlncnt *zlnp;
int ndb, j;
mode_t mode;
u_int64_t size;
1997-09-16 20:44:43 +04:00
char symbuf[MAXSYMLINKLEN];
dp = getnextinode(inumber);
mode = iswap16(dp->di_mode) & IFMT;
size = iswap64(dp->di_size);
if (mode == 0) {
1997-09-16 20:44:43 +04:00
if (memcmp(dp->di_db, zino.di_db,
NDADDR * sizeof(ufs_daddr_t)) ||
memcmp(dp->di_ib, zino.di_ib,
NIADDR * sizeof(ufs_daddr_t)) ||
dp->di_mode || dp->di_size) {
pfatal("PARTIALLY ALLOCATED INODE I=%u", inumber);
1993-03-21 12:45:37 +03:00
if (reply("CLEAR") == 1) {
dp = ginode(inumber);
clearinode(dp);
inodirty();
} else
markclean = 0;
1993-03-21 12:45:37 +03:00
}
statemap[inumber] = USTATE;
return;
}
lastino = inumber;
if (/* dp->di_size < 0 || */
size + sblock->fs_bsize - 1 < size ||
(mode == IFDIR && size > MAXDIRSIZE)) {
if (debug)
printf("bad size %llu:",(unsigned long long)size);
goto unknown;
}
if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
dp = ginode(inumber);
dp->di_size = iswap64(sblock->fs_fsize);
size = sblock->fs_fsize;
dp->di_mode = iswap16(IFREG|0600);
inodirty();
}
ndb = howmany(size, sblock->fs_bsize);
if (ndb < 0) {
if (debug)
printf("bad size %llu ndb %d:",
(unsigned long long)size, ndb);
goto unknown;
}
if (mode == IFBLK || mode == IFCHR)
ndb++;
if (mode == IFLNK) {
/*
* Note that the old fastlink format always had di_blocks set
* to 0. Other than that we no longer use the `spare' field
* (which is now the extended uid) for sanity checking, the
* new format is the same as the old. We simply ignore the
* conversion altogether. - mycroft, 19MAY1994
*/
if (doinglevel2 &&
size > 0 && size < MAXSYMLINKLEN &&
dp->di_blocks != 0) {
if (bread(fsreadfd, symbuf,
fsbtodb(sblock, iswap32(dp->di_db[0])),
(long)secsize) != 0)
1997-09-16 20:44:43 +04:00
errx(EEXIT, "cannot read symlink");
if (debug) {
symbuf[size] = 0;
printf("convert symlink %u(%s) of size %lld\n",
inumber, symbuf,
(unsigned long long)size);
}
dp = ginode(inumber);
memmove(dp->di_shortlink, symbuf, (long)size);
dp->di_blocks = 0;
inodirty();
}
/*
* Fake ndb value so direct/indirect block checks below
* will detect any garbage after symlink string.
*/
if (size < sblock->fs_maxsymlinklen ||
(isappleufs && (size < APPLEUFS_MAXSYMLINKLEN)) ||
(sblock->fs_maxsymlinklen == 0 && dp->di_blocks == 0)) {
ndb = howmany(size, sizeof(daddr_t));
if (ndb > NDADDR) {
j = ndb - NDADDR;
for (ndb = 1; j > 1; j--)
ndb *= NINDIR(sblock);
ndb += NDADDR;
}
}
}
for (j = ndb; j < NDADDR; j++)
if (dp->di_db[j] != 0) {
if (debug)
1999-11-15 22:18:24 +03:00
printf("bad direct addr ix %d: %d [ndb %d]\n",
j, iswap32(dp->di_db[j]), ndb);
goto unknown;
}
for (j = 0, ndb -= NDADDR; ndb > 0; j++)
ndb /= NINDIR(sblock);
for (; j < NIADDR; j++)
if (dp->di_ib[j] != 0) {
if (debug)
printf("bad indirect addr: %d\n",
iswap32(dp->di_ib[j]));
goto unknown;
}
if (ftypeok(dp) == 0)
goto unknown;
n_files++;
lncntp[inumber] = iswap16(dp->di_nlink);
if (lncntp[inumber] <= 0) {
zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
if (zlnp == NULL) {
markclean = 0;
pfatal("LINK COUNT TABLE OVERFLOW");
1999-11-15 22:18:24 +03:00
if (reply("CONTINUE") == 0) {
ckfini();
1997-09-16 20:44:43 +04:00
exit(EEXIT);
1999-11-15 22:18:24 +03:00
}
} else {
zlnp->zlncnt = inumber;
zlnp->next = zlnhead;
zlnhead = zlnp;
}
}
if (mode == IFDIR) {
if (size == 0)
statemap[inumber] = DCLEAR;
else
statemap[inumber] = DSTATE;
cacheino(dp, inumber);
} else
statemap[inumber] = FSTATE;
typemap[inumber] = IFTODT(mode);
if (doinglevel2 &&
(iswap16(dp->di_ouid) != (u_short)-1 ||
iswap16(dp->di_ogid) != (u_short)-1)) {
dp = ginode(inumber);
dp->di_uid = iswap32(iswap16(dp->di_ouid));
dp->di_ouid = iswap16(-1);
dp->di_gid = iswap32(iswap16(dp->di_ogid));
dp->di_ogid = iswap16(-1);
inodirty();
}
badblk = dupblk = 0;
idesc->id_number = inumber;
(void)ckinode(dp, idesc);
idesc->id_entryno *= btodb(sblock->fs_fsize);
if (iswap32(dp->di_blocks) != idesc->id_entryno) {
pwarn("INCORRECT BLOCK COUNT I=%u (%d should be %d)",
inumber, iswap32(dp->di_blocks), idesc->id_entryno);
if (preen)
printf(" (CORRECTED)\n");
else if (reply("CORRECT") == 0) {
markclean = 0;
return;
}
dp = ginode(inumber);
dp->di_blocks = iswap32(idesc->id_entryno);
inodirty();
}
return;
unknown:
pfatal("UNKNOWN FILE TYPE I=%u", inumber);
statemap[inumber] = FCLEAR;
if (reply("CLEAR") == 1) {
statemap[inumber] = USTATE;
dp = ginode(inumber);
clearinode(dp);
inodirty();
} else
markclean = 0;
1993-03-21 12:45:37 +03:00
}
int
1993-03-21 12:45:37 +03:00
pass1check(idesc)
struct inodesc *idesc;
1993-03-21 12:45:37 +03:00
{
int res = KEEPON;
int anyout, nfrags;
1997-09-16 20:44:43 +04:00
ufs_daddr_t blkno = idesc->id_blkno;
struct dups *dlp;
1993-03-21 12:45:37 +03:00
struct dups *new;
if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
blkerror(idesc->id_number, "BAD", blkno);
if (badblk++ >= MAXBAD) {
pwarn("EXCESSIVE BAD BLKS I=%u",
1993-03-21 12:45:37 +03:00
idesc->id_number);
if (preen)
printf(" (SKIPPING)\n");
1999-11-15 22:18:24 +03:00
else if (reply("CONTINUE") == 0) {
markclean = 0;
ckfini();
1997-09-16 20:44:43 +04:00
exit(EEXIT);
1999-11-15 22:18:24 +03:00
}
1993-03-21 12:45:37 +03:00
return (STOP);
}
}
for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
if (anyout && chkrange(blkno, 1)) {
res = SKIP;
} else if (!testbmap(blkno)) {
n_blks++;
setbmap(blkno);
} else {
blkerror(idesc->id_number, "DUP", blkno);
if (dupblk++ >= MAXDUP) {
pwarn("EXCESSIVE DUP BLKS I=%u",
1993-03-21 12:45:37 +03:00
idesc->id_number);
if (preen)
printf(" (SKIPPING)\n");
1999-11-15 22:18:24 +03:00
else if (reply("CONTINUE") == 0) {
markclean = 0;
ckfini();
1997-09-16 20:44:43 +04:00
exit(EEXIT);
1999-11-15 22:18:24 +03:00
}
1993-03-21 12:45:37 +03:00
return (STOP);
}
new = (struct dups *)malloc(sizeof(struct dups));
if (new == NULL) {
markclean = 0;
1993-03-21 12:45:37 +03:00
pfatal("DUP TABLE OVERFLOW.");
1999-11-15 22:18:24 +03:00
if (reply("CONTINUE") == 0) {
markclean = 0;
ckfini();
1997-09-16 20:44:43 +04:00
exit(EEXIT);
1999-11-15 22:18:24 +03:00
}
1993-03-21 12:45:37 +03:00
return (STOP);
}
new->dup = blkno;
if (muldup == 0) {
duplist = muldup = new;
new->next = 0;
} else {
new->next = muldup->next;
muldup->next = new;
}
for (dlp = duplist; dlp != muldup; dlp = dlp->next)
if (dlp->dup == blkno)
break;
if (dlp == muldup && dlp->dup != blkno)
muldup = new;
}
/*
* count the number of blocks found in id_entryno
*/
idesc->id_entryno++;
}
return (res);
}