42614ed3f3
64 bit block pointers, extended attribute storage, and a few other things. This commit does not yet include the code to manipulate the extended storage (for e.g. ACLs), this will be done later. Originally written by Kirk McKusick and Network Associates Laboratories for FreeBSD.
159 lines
4.2 KiB
C
159 lines
4.2 KiB
C
/* $NetBSD: pass4.c,v 1.8 2003/04/02 10:39:28 fvdl 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. 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/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.h"
|
|
|
|
#include "fsutil.h"
|
|
#include "fsck.h"
|
|
#include "extern.h"
|
|
|
|
extern SEGUSE *seg_table;
|
|
|
|
void
|
|
pass4()
|
|
{
|
|
register ino_t inumber;
|
|
register 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=%d\n",
|
|
statemap[inumber], inumber);
|
|
}
|
|
}
|
|
}
|
|
|
|
int
|
|
pass4check(struct inodesc * idesc)
|
|
{
|
|
register struct dups *dlp;
|
|
int ndblks, res = KEEPON;
|
|
daddr_t blkno = idesc->id_blkno;
|
|
SEGUSE *sup;
|
|
struct ubuf *bp;
|
|
int sn, doanyway = 0;
|
|
|
|
sn = dtosn(fs, blkno);
|
|
/* If preening, bmap is not valid for non-active segs */
|
|
if (preen && !(seg_table[sn].su_flags & SEGUSE_ACTIVE))
|
|
doanyway = 1;
|
|
for (ndblks = fragstofsb(fs, idesc->id_numfrags); ndblks > 0; blkno++, ndblks--) {
|
|
if (chkrange(blkno, 1)) {
|
|
res = SKIP;
|
|
} else if (testbmap(blkno) || doanyway) {
|
|
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);
|
|
}
|