1/*
2 * Copyright (c) 1980, 1986, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 *    may be used to endorse or promote products derived from this software
15 *    without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30#if 0
31#ifndef lint
32static const char sccsid[] = "@(#)pass4.c	8.4 (Berkeley) 4/28/95";
33#endif /* not lint */
34#endif
35#include <sys/cdefs.h>
36__FBSDID("$FreeBSD$");
37
38#include <sys/param.h>
39
40#include <ufs/ufs/dinode.h>
41#include <ufs/ffs/fs.h>
42
43#include <err.h>
44#include <stdint.h>
45#include <string.h>
46
47#include "fsck.h"
48
49void
50pass4(void)
51{
52	ino_t inumber;
53	union dinode *dp;
54	struct inodesc idesc;
55	int i, n, cg;
56
57	memset(&idesc, 0, sizeof(struct inodesc));
58	idesc.id_type = ADDR;
59	idesc.id_func = pass4check;
60	for (cg = 0; cg < sblock.fs_ncg; cg++) {
61		if (got_siginfo) {
62			printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
63			    cdevname, cg, sblock.fs_ncg,
64			    cg * 100 / sblock.fs_ncg);
65			got_siginfo = 0;
66		}
67		if (got_sigalarm) {
68			setproctitle("%s p4 %d%%", cdevname,
69			    cg * 100 / sblock.fs_ncg);
70			got_sigalarm = 0;
71		}
72		inumber = cg * sblock.fs_ipg;
73		for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
74			if (inumber < ROOTINO)
75				continue;
76			idesc.id_number = inumber;
77			switch (inoinfo(inumber)->ino_state) {
78
79			case FZLINK:
80			case DZLINK:
81				if (inoinfo(inumber)->ino_linkcnt == 0) {
82					clri(&idesc, "UNREF", 1);
83					break;
84				}
85				/* fall through */
86
87			case FSTATE:
88			case DFOUND:
89				n = inoinfo(inumber)->ino_linkcnt;
90				if (n) {
91					adjust(&idesc, (short)n);
92					break;
93				}
94				break;
95
96			case DSTATE:
97				clri(&idesc, "UNREF", 1);
98				break;
99
100			case DCLEAR:
101				/* if on snapshot, already cleared */
102				if (cursnapshot != 0)
103					break;
104				dp = ginode(inumber);
105				if (DIP(dp, di_size) == 0) {
106					clri(&idesc, "ZERO LENGTH", 1);
107					break;
108				}
109				/* fall through */
110			case FCLEAR:
111				clri(&idesc, "BAD/DUP", 1);
112				break;
113
114			case USTATE:
115				break;
116
117			default:
118				errx(EEXIT, "BAD STATE %d FOR INODE I=%ju",
119				    inoinfo(inumber)->ino_state,
120				    (uintmax_t)inumber);
121			}
122		}
123	}
124}
125
126int
127pass4check(struct inodesc *idesc)
128{
129	struct dups *dlp;
130	int nfrags, res = KEEPON;
131	ufs2_daddr_t blkno = idesc->id_blkno;
132
133	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
134		if (chkrange(blkno, 1)) {
135			res = SKIP;
136		} else if (testbmap(blkno)) {
137			for (dlp = duplist; dlp; dlp = dlp->next) {
138				if (dlp->dup != blkno)
139					continue;
140				dlp->dup = duplist->dup;
141				dlp = duplist;
142				duplist = duplist->next;
143				free((char *)dlp);
144				break;
145			}
146			if (dlp == 0) {
147				clrbmap(blkno);
148				n_blks--;
149			}
150		}
151	}
152	return (res);
153}
154