29f1062b46
* Add lfs_balloc capability to the lfs library. * Extend the Ifile if we run out of free inodes when creating lost+found. * Don't roll forward if we have allocated a lost+found, to avoid conflicts when adding new files in roll-forward. * Make some messages slightly more verbose (e.g. include inode number, and use pwarn() instead of printf() so the messages include the device name when preening). * Change superblock detection/avoidance to use the offset table in the primary superblock, rather than looking at the contents. * Be more verbose about various operations when passed the -d flag, especially roll-forward. * Be more careful about dirops during roll forward, since the cleaner can sometimes write blocks from dirop vnodes. Detect and avoid this problem. * Always check the free list, even if given -i; if we're going to write it we have to check it first. * Mark inodes dirty when blocks are found during roll forward, so the inodes are written with the new block locations. * Update size of inodes if blocks beyond EOF are found during roll forward. * Fix segment accounting for blocks and inodes found during roll forward. * Report statistics on roll forward: how many new/deleted/moved files and how many updated blocks (or "nothing new"). * Don't care if the device being checked is really a device, if we have been passed the -f flag (to facilitate automated testing). * When writing to the disk, use the current time in the segment headers rathern than time 0. * When passed the -i flag, locate the partial segment containing the Ifile inode and use that to calculate lfs_offset, lfs_curseg, lfs_nextseg. (Again for automated testing.)
152 lines
3.9 KiB
C
152 lines
3.9 KiB
C
/* $NetBSD: pass4.c,v 1.14 2006/07/18 23:37:13 perseant Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1980, 1986, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* 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
|
|
* 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/param.h>
|
|
#include <sys/time.h>
|
|
#include <sys/mount.h>
|
|
#include <ufs/ufs/inode.h>
|
|
|
|
#define vnode uvnode
|
|
#define buf ubuf
|
|
#define panic call_panic
|
|
#include <ufs/lfs/lfs.h>
|
|
|
|
#include <err.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "bufcache.h"
|
|
#include "vnode.h"
|
|
#include "lfs_user.h"
|
|
|
|
#include "fsutil.h"
|
|
#include "fsck.h"
|
|
#include "extern.h"
|
|
|
|
extern SEGUSE *seg_table;
|
|
|
|
void
|
|
pass4(void)
|
|
{
|
|
ino_t inumber;
|
|
struct zlncnt *zlnp;
|
|
struct ufs1_dinode *dp;
|
|
struct inodesc idesc;
|
|
int n;
|
|
|
|
memset(&idesc, 0, sizeof(struct inodesc));
|
|
idesc.id_type = ADDR;
|
|
idesc.id_func = pass4check;
|
|
for (inumber = ROOTINO; inumber <= lastino; inumber++) {
|
|
idesc.id_number = inumber;
|
|
switch (statemap[inumber]) {
|
|
|
|
case FSTATE:
|
|
case DFOUND:
|
|
n = lncntp[inumber];
|
|
if (n)
|
|
adjust(&idesc, (short) n);
|
|
else {
|
|
for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)
|
|
if (zlnp->zlncnt == inumber) {
|
|
zlnp->zlncnt = zlnhead->zlncnt;
|
|
zlnp = zlnhead;
|
|
zlnhead = zlnhead->next;
|
|
free((char *) zlnp);
|
|
clri(&idesc, "UNREF", 1);
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
|
|
case DSTATE:
|
|
clri(&idesc, "UNREF", 1);
|
|
break;
|
|
|
|
case DCLEAR:
|
|
dp = ginode(inumber);
|
|
if (dp->di_size == 0) {
|
|
clri(&idesc, "ZERO LENGTH", 1);
|
|
break;
|
|
}
|
|
/* fall through */
|
|
case FCLEAR:
|
|
clri(&idesc, "BAD/DUP", 1);
|
|
break;
|
|
|
|
case USTATE:
|
|
break;
|
|
|
|
default:
|
|
err(8, "BAD STATE %d FOR INODE I=%llu\n",
|
|
statemap[inumber], (unsigned long long)inumber);
|
|
}
|
|
}
|
|
}
|
|
|
|
int
|
|
pass4check(struct inodesc * idesc)
|
|
{
|
|
struct dups *dlp;
|
|
int ndblks, res = KEEPON;
|
|
daddr_t blkno = idesc->id_blkno;
|
|
SEGUSE *sup;
|
|
struct ubuf *bp;
|
|
int sn;
|
|
|
|
sn = dtosn(fs, blkno);
|
|
for (ndblks = fragstofsb(fs, idesc->id_numfrags); ndblks > 0; blkno++, ndblks--) {
|
|
if (chkrange(blkno, 1)) {
|
|
res = SKIP;
|
|
} else if (testbmap(blkno) || preen) {
|
|
for (dlp = duplist; dlp; dlp = dlp->next) {
|
|
if (dlp->dup != blkno)
|
|
continue;
|
|
dlp->dup = duplist->dup;
|
|
dlp = duplist;
|
|
duplist = duplist->next;
|
|
free((char *) dlp);
|
|
break;
|
|
}
|
|
if (dlp == 0) {
|
|
clrbmap(blkno);
|
|
LFS_SEGENTRY(sup, fs, sn, bp);
|
|
sup->su_nbytes -= fsbtob(fs, 1);
|
|
VOP_BWRITE(bp);
|
|
seg_table[sn].su_nbytes -= fsbtob(fs, 1);
|
|
++fs->lfs_bfree;
|
|
n_blks--;
|
|
}
|
|
}
|
|
}
|
|
return (res);
|
|
}
|