2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
32 static const char sccsid[] = "@(#)pass4.c 8.4 (Berkeley) 4/28/95";
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include <sys/param.h>
40 #include <ufs/ufs/dinode.h>
41 #include <ufs/ffs/fs.h>
57 memset(&idesc, 0, sizeof(struct inodesc));
59 idesc.id_func = pass4check;
60 for (cg = 0; cg < sblock.fs_ncg; cg++) {
62 printf("%s: phase 4: cyl group %d of %d (%d%%)\n",
63 cdevname, cg, sblock.fs_ncg,
64 cg * 100 / sblock.fs_ncg);
68 setproctitle("%s p4 %d%%", cdevname,
69 cg * 100 / sblock.fs_ncg);
72 inumber = cg * sblock.fs_ipg;
73 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
74 if (inumber < ROOTINO)
76 idesc.id_number = inumber;
77 switch (inoinfo(inumber)->ino_state) {
81 n = inoinfo(inumber)->ino_linkcnt;
83 adjust(&idesc, (short)n);
86 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
87 if (zlnp->zlncnt == inumber) {
88 zlnp->zlncnt = zlnhead->zlncnt;
90 zlnhead = zlnhead->next;
92 clri(&idesc, "UNREF", 1);
99 clri(&idesc, "UNREF", 1);
103 dp = ginode(inumber);
104 if (DIP(dp, di_size) == 0) {
105 clri(&idesc, "ZERO LENGTH", 1);
110 clri(&idesc, "BAD/DUP", 1);
117 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
118 inoinfo(inumber)->ino_state, inumber);
125 pass4check(struct inodesc *idesc)
128 int nfrags, res = KEEPON;
129 ufs2_daddr_t blkno = idesc->id_blkno;
131 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
132 if (chkrange(blkno, 1)) {
134 } else if (testbmap(blkno)) {
135 for (dlp = duplist; dlp; dlp = dlp->next) {
136 if (dlp->dup != blkno)
138 dlp->dup = duplist->dup;
140 duplist = duplist->next;