* Copyright (c) 1980, 1986 The Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 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
static char sccsid
[] = "@(#)pass4.c 5.10 (Berkeley) 7/20/90";
static char rcsid
[] = "$Header: /b/source/CVS/src/sbin/fsck/pass4.c,v 1.3 1993/03/23 00:28:07 cgd Exp $";
register struct zlncnt
*zlnp
;
bzero((char *)&idesc
, sizeof(struct inodesc
));
idesc
.id_func
= pass4check
;
for (inumber
= ROOTINO
; inumber
<= lastino
; inumber
++) {
idesc
.id_number
= inumber
;
switch (statemap
[inumber
]) {
adjust(&idesc
, (short)n
);
for (zlnp
= zlnhead
; zlnp
; zlnp
= zlnp
->next
)
if (zlnp
->zlncnt
== inumber
) {
zlnp
->zlncnt
= zlnhead
->zlncnt
;
clri(&idesc
, "UNREF", 1);
clri(&idesc
, "UNREF", 1);
clri(&idesc
, "ZERO LENGTH", 1);
clri(&idesc
, "BAD/DUP", 1);
errexit("BAD STATE %d FOR INODE I=%d",
statemap
[inumber
], inumber
);
register struct inodesc
*idesc
;
register struct dups
*dlp
;
int nfrags
, res
= KEEPON
;
daddr_t blkno
= idesc
->id_blkno
;
for (nfrags
= idesc
->id_numfrags
; nfrags
> 0; blkno
++, nfrags
--) {
if (chkrange(blkno
, 1)) {
} else if (testbmap(blkno
)) {
for (dlp
= duplist
; dlp
; dlp
= dlp
->next
) {