Merge from vendor branch FILE:
[dragonfly.git] / sbin / fsck / pass4.c
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  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *      This product includes software developed by the University of
16  *      California, Berkeley and its contributors.
17  * 4. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  * @(#)pass4.c  8.4 (Berkeley) 4/28/95
34  * $FreeBSD: src/sbin/fsck/pass4.c,v 1.7.2.1 2001/01/23 23:11:07 iedowse Exp $
35  * $DragonFly: src/sbin/fsck/pass4.c,v 1.7 2006/10/12 04:04:03 dillon Exp $
36  */
37
38 #include <sys/param.h>
39
40 #include <vfs/ufs/dinode.h>
41 #include <vfs/ufs/fs.h>
42
43 #include <err.h>
44 #include <string.h>
45
46 #include "fsck.h"
47
48 void
49 pass4(void)
50 {
51         ufs1_ino_t inumber;
52         struct zlncnt *zlnp;
53         struct ufs1_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                 inumber = cg * sblock.fs_ipg;
68                 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
69                         if (inumber < ROOTINO)
70                                 continue;
71                         idesc.id_number = inumber;
72                         switch (inoinfo(inumber)->ino_state) {
73
74                         case FSTATE:
75                         case DFOUND:
76                                 n = inoinfo(inumber)->ino_linkcnt;
77                                 if (n) {
78                                         adjust(&idesc, (short)n);
79                                         break;
80                                 }
81                                 for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {
82                                         if (zlnp->zlncnt == inumber) {
83                                                 zlnp->zlncnt = zlnhead->zlncnt;
84                                                 zlnp = zlnhead;
85                                                 zlnhead = zlnhead->next;
86                                                 free((char *)zlnp);
87                                                 clri(&idesc, "UNREF", 1);
88                                                 break;
89                                         }
90                                 }
91                                 break;
92
93                         case DSTATE:
94                                 clri(&idesc, "UNREF", 1);
95                                 break;
96
97                         case DCLEAR:
98                                 dp = ginode(inumber);
99                                 if (dp->di_size == 0) {
100                                         clri(&idesc, "ZERO LENGTH", 1);
101                                         break;
102                                 }
103                                 /* fall through */
104                         case FCLEAR:
105                                 clri(&idesc, "BAD/DUP", 1);
106                                 break;
107
108                         case USTATE:
109                                 break;
110
111                         default:
112                                 errx(EEXIT, "BAD STATE %d FOR INODE I=%d",
113                                     inoinfo(inumber)->ino_state, inumber);
114                         }
115                 }
116         }
117 }
118
119 int
120 pass4check(struct inodesc *idesc)
121 {
122         struct dups *dlp;
123         int nfrags, res = KEEPON;
124         ufs_daddr_t blkno = idesc->id_blkno;
125
126         for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
127                 if (chkrange(blkno, 1)) {
128                         res = SKIP;
129                 } else if (testbmap(blkno)) {
130                         for (dlp = duplist; dlp; dlp = dlp->next) {
131                                 if (dlp->dup != blkno)
132                                         continue;
133                                 dlp->dup = duplist->dup;
134                                 dlp = duplist;
135                                 duplist = duplist->next;
136                                 free((char *)dlp);
137                                 break;
138                         }
139                         if (dlp == 0) {
140                                 clrbmap(blkno);
141                                 n_blks--;
142                         }
143                 }
144         }
145         return (res);
146 }