NetBSD/sbin/fsck_ffs/pass1b.c

124 lines
3.6 KiB
C
Raw Permalink Normal View History

/* $NetBSD: pass1b.c,v 1.24 2023/01/07 19:41:29 chs 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. Neither the name of the University nor the names of its contributors
1993-03-21 12:45:37 +03:00
* 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[] = "@(#)pass1b.c 8.4 (Berkeley) 4/28/95";
#else
__RCSID("$NetBSD: pass1b.c,v 1.24 2023/01/07 19:41:29 chs Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#include <sys/param.h>
1994-04-25 22:28:42 +04:00
#include <sys/time.h>
1997-09-16 20:44:43 +04:00
#include <ufs/ufs/dinode.h>
#include <ufs/ffs/fs.h>
1993-03-21 12:45:37 +03:00
#include <string.h>
1997-09-16 20:44:43 +04:00
1993-03-21 12:45:37 +03:00
#include "fsck.h"
#include "extern.h"
#include "fsutil.h"
1993-03-21 12:45:37 +03:00
static struct dups *duphead;
2005-01-20 18:29:40 +03:00
static int pass1bcheck(struct inodesc *);
1993-03-21 12:45:37 +03:00
void
2005-01-19 20:33:58 +03:00
pass1b(void)
1993-03-21 12:45:37 +03:00
{
uint32_t c, i;
union dinode *dp;
1993-03-21 12:45:37 +03:00
struct inodesc idesc;
ino_t inumber;
memset(&idesc, 0, sizeof(struct inodesc));
1993-03-21 12:45:37 +03:00
idesc.id_type = ADDR;
idesc.id_func = pass1bcheck;
duphead = duplist;
inumber = 0;
for (c = 0; c < sblock->fs_ncg; c++) {
if (got_siginfo) {
fprintf(stderr,
"%s: phase 1b: cyl group %d of %d (%d%%)\n",
cdevname(), c, sblock->fs_ncg,
c * 100 / sblock->fs_ncg);
got_siginfo = 0;
}
#ifdef PROGRESS
progress_bar(cdevname(), "phase 1b", c, sblock->fs_ncg);
#endif /* PROGRESS */
for (i = 0; i < sblock->fs_ipg; i++, inumber++) {
if (inumber < UFS_ROOTINO)
1993-03-21 12:45:37 +03:00
continue;
dp = ginode(inumber);
if (dp == NULL)
continue;
idesc.id_number = inumber;
idesc.id_uid = iswap32(DIP(dp, uid));
idesc.id_gid = iswap32(DIP(dp, gid));
if (inoinfo(inumber)->ino_state != USTATE &&
1993-03-21 12:45:37 +03:00
(ckinode(dp, &idesc) & STOP))
return;
}
}
#ifdef PROGRESS
progress_done();
#endif /* PROGRESS */
1993-03-21 12:45:37 +03:00
}
static int
2005-01-19 20:33:58 +03:00
pass1bcheck(struct inodesc *idesc)
1993-03-21 12:45:37 +03:00
{
struct dups *dlp;
1993-03-21 12:45:37 +03:00
int nfrags, res = KEEPON;
daddr_t blkno = idesc->id_blkno;
1993-03-21 12:45:37 +03:00
for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
if (chkrange(blkno, 1))
res = SKIP;
for (dlp = duphead; dlp; dlp = dlp->next) {
if (dlp->dup == blkno) {
blkerror(idesc->id_number, "DUP", blkno);
dlp->dup = duphead->dup;
duphead->dup = blkno;
duphead = duphead->next;
}
if (dlp == muldup)
break;
}
if (muldup == 0 || duphead == muldup->next)
return (STOP);
}
return (res);
}